mlfoundations-dev/apps_processed · Datasets at Hugging Face

problem_id stringlengths 32 32	name stringclasses 1 value	problem stringlengths 200 14k	solutions stringlengths 12 1.12M	test_cases stringlengths 37 74M	difficulty stringclasses 3 values	language stringclasses 1 value	source stringclasses 7 values	num_solutions int64 12 1.12M
f39e919597e397681bb961672e4542e6	UNKNOWN	Almir had a small sequence $A_1, A_2, \ldots, A_N$. He decided to make $K$ copies of this sequence and concatenate them, forming a sequence $X_1, X_2, \ldots, X_{NK}$; for each valid $i$ and $j$ ($0 \le j < K$), $X_{j \cdot N + i} = A_i$. For example, if $A = (1, 2, 3)$ and $K = 4$, the final sequence is $X = (1, 2, 3, 1, 2, 3, 1, 2, 3, 1, 2, 3)$. A pair $(i, j)$, where $1 \le i < j \le N$, is an inversion if $X_i > X_j$. Find the number of inversions in the final sequence $X$. -----Input----- - The first line of the input contains a single integer $T$ denoting the number of test cases. The description of $T$ test cases follows. - The first line of each test case contains two space-separated integers $N$ and $K$. - The second line contains $N$ space-separated integers $A_1, A_2, \ldots, A_N$. -----Output----- For each test case, print a single line containing one integer ― the number of inversions in the sequence $X$. -----Constraints----- - $1 \le T \le 1,000$ - $1 \le N \le 100$ - $1 \le K \le 10^6$ - $1 \le A_i \le 10^9$ for each valid $i$ -----Subtasks----- Subtask #1 (100 points): original constraints -----Example Input----- 2 3 3 2 1 3 4 100 99 2 1000 24 -----Example Output----- 12 30000	["# cook your dish here\ndef count(k,n,m):\n sum1=(m(m+1))//2\n sum2=(m(m-1))//2\n ct=0\n for i in range(n):\n for j in range(n):\n if i<j and k[i]>k[j]:\n ct+=sum1\n elif j<i and k[i]>k[j]:\n ct+=sum2\n return ct\n\ntest=int(input())\nfor _ in range(test):\n n,m=map(int,input().split())\n k=list(map(int,input().split()))\n print(count(k,n,m))\n", "# cook your dish here\n# cook your dish here\ndef sree(k, n, m):\n sum1 = (m(m+1))//2\n sum2 = (m(m-1))//2\n shanth = 0\n for i in range(n):\n count = 0\n for j in range(n):\n if i < j and k[i] > k[j]:\n shanth += sum1\n elif j < i and k[i] > k[j]:\n shanth += sum2\n return shanth\n\n\nt = int(input())\nfor _ in range(t):\n n, m = map(int, input().split())\n k = list(map(int, input().split()))\n print(sree(k, n, m))\n", "# cook your dish here\ndef sree(k, n, m):\n sum1 = (m(m+1))//2\n sum2 = (m(m-1))//2\n shanth = 0\n for i in range(n):\n count = 0\n for j in range(n):\n if i < j and k[i] > k[j]:\n shanth += sum1\n elif j < i and k[i] > k[j]:\n shanth += sum2\n return shanth\n\n\nt = int(input())\nfor _ in range(t):\n n, m = map(int, input().split())\n k = list(map(int, input().split()))\n print(sree(k, n, m))\n", "# cook your dish here\ndef sree(k, n, m):\n sum1 = (m(m+1))//2\n sum2 = (m(m-1))//2\n shanth = 0\n for i in range(n):\n count = 0\n for j in range(n):\n if i < j and k[i] > k[j]:\n shanth += sum1\n elif j < i and k[i] > k[j]:\n shanth += sum2\n return shanth\n\n\nt = int(input())\nfor _ in range(t):\n n, m = map(int, input().split())\n k = list(map(int, input().split()))\n print(sree(k, n, m))\n", "import sys\r\nimport math\r\nfrom collections import defaultdict\r\n\r\ndef fout(s, end='\\n'): sys.stdout.write(str(s) + end)\r\ndef fin(): return sys.stdin.readline().strip()\r\nmod = pow(10, 9)+7\r\nt = int(fin())\r\nwhile t>0:\r\n t -= 1\r\n n, k = map(int, fin().split())\r\n a = [int(x) for x in fin().split()]\r\n ans = 0\r\n for i in range(n):\r\n c = 0\r\n for j in range(i):\r\n if a[i] < a[j]:\r\n c += 1\r\n ans += k(c)\r\n for j in range(i+1, n):\r\n if a[j] > a[i]:\r\n c += 1\r\n ans += k(k-1)(c)//2\r\n print(ans)\r\n\r\n", "# cook your dish here\nfor _ in range(int(input())):\n n, k = map(int, input().split())\n arr = list(map(int, input().split()))\n x, suffix = 0, 0\n for i, a_i in enumerate(arr):\n for j, a_j in enumerate(arr):\n if a_i > a_j: x += 1\n if j > i:\n if a_i > a_j: suffix += 1\n print(x( (k(k-1))//2 ) + suffixk)", "# cook your dish here\nfor _ in range(int(input())):\n n, k = map(int, input().split())\n arr = list(map(int, input().split()))\n x, suffix = 0, 0\n for i in range(n):\n for j in range(n):\n if arr[i] > arr[j]: x += 1\n if j > i:\n if arr[i] > arr[j]: suffix += 1\n print(x( (k(k-1))//2 ) + suffixk)", "# cook your dish here\nfor _ in range(int(eval(input()))):\n n, k = list(map(int, input().split()))\n arr = list(map(int, input().split()))\n x, suffix = 0, 0\n for i, a_i in enumerate(arr):\n for a_j in arr:\n if a_i > a_j: x += 1\n for j in range(i+1, n):\n if a_i > arr[j]: suffix += 1\n \n ans = x( (k(k-1))//2 ) + suffixk\n print(ans)", "from math import \r\nfrom collections import \r\nfrom itertools import \r\nfrom bisect import \r\nfrom heapq import \r\nfrom operator import \r\nfrom sys import \r\nsetrecursionlimit(1000000)\r\nd=defaultdict(lambda:0,{})\r\ndef io():\r\n return map(int,input().split())\r\ndef op():\r\n return list(map(int,input().split()))\r\ndef o():\r\n return int(input())\r\ndef r(x):\r\n if type(x)==int:\r\n return range(x)\r\n else:return range(len(x))\r\ndef kl(con,x=0):\r\n if x==0:print('Yes') if con else print('No')\r\n elif x==1:print('yes') if con else print('no')\r\n elif x==2:print('YES') if con else print('NO')\r\nMOD = 1000000007\r\nMAX=float('inf')\r\nMIN=-float('inf')\r\np=input\r\nfor _ in r(o()):\r\n n,k=io()\r\n l=op()\r\n ans=0\r\n for i in r(l):\r\n for j in r(l):\r\n if l[i]>l[j]:\r\n if i>j:\r\n ans+=k(k-1)/2\r\n elif i<j:\r\n ans+=k(k+1)/2\r\n print(int(ans))\r\n\r\n", "t = int(input())\r\nfor jack in range(t):\r\n n, k = map(int, input().split())\r\n a = list(map(int, input().split()))\r\n r1 = 0\r\n for i in range(n - 1):\r\n m = 0\r\n for j in range(i + 1, n):\r\n if a[i] > a[j]:\r\n m += 1\r\n r1 += m\r\n a.sort()\r\n last, r2 = 0, 0\r\n for i in range(n):\r\n if a[i] != a[i - 1]:\r\n r2 += i\r\n last = i\r\n else:\r\n r2 += last\r\n r = r1 k + (k * (k - 1) * r2) // 2\r\n print(r)", "for i in range(int(input())):\n n,k=map(int,input().split())\n s,a,l = 0,0,list(map(int,input().split()))\n l2=2l\n for i in range(n-1):\n for j in range(i+1,n):\n if(l[i]>l[j]):a+=1\n for i in range(n):\n for j in range(n,2n):\n if(l2[i]>l2[j]):s+=1\n print(((k(k-1))//2)s+ka)", "# cook your dish here\nfor i in range(int(input())):\n n,k=map(int,input().split())\n s=0\n a=0\n l=list(map(int,input().split()))\n l2=2l\n for i in range(n-1):\n for j in range(i+1,n):\n if(l[i]>l[j]):\n a+=1\n for i in range(n):\n for j in range(n,2n):\n if(l2[i]>l2[j]):\n s+=1\n print(((k(k-1))//2)s+ka)", "t = int(input())\nfor _ in range(t):\n n, rep = map(int, input().split())\n a = list(map(int, input().split()))\n ans = 0\n for i in range(len(a)):\n l = 0\n r = 0\n for j in range(i, -1, -1):\n if(a[j] < a[i]):\n l += 1\n for j in range(i, n, 1):\n if(a[j] < a[i]):\n r += 1\n tot = l + r\n lt = tot * (rep - 1) + r\n ans += (rep / 2.0) * (r + lt)\n print(int(ans))\n \n \n ", "for T in range(int(input())):\n N, K = map(int, input().split())\n A = list(map(int, input().split()))\n C = [0, 0]\n for Z in range(2):\n L = N * (Z + 1)\n A = Z + 1\n for I in range(L-1):\n for J in range(I+1, L):\n if A[I] > A[J]:\n C[Z] += 1\n print(C[0] + (K - 1) (C[1] + (K - 1) * (C[1] - 2 * C[0])) // 2)", "t = int(input())\r\nfor _ in range(t):\r\n n, k = map(int, input().split())\r\n num = list(map(int, input().split()))\r\n sum = 0\r\n for i in range(1, n+1):\r\n c = num[i-1]\r\n count_for = 0\r\n count_bac = 0\r\n for j in range(i, n):\r\n if num[j] < c:\r\n count_for += 1\r\n for j in range(i):\r\n if num[j] < c:\r\n count_bac += 1\r\n count = count_for + count_bac\r\n p = (k(k+1))//2 count\r\n p = p - k * count_bac\r\n sum = sum + p\r\n print(sum)\r\n\r\n", "t = int(input())\r\nfor _ in range(t):\r\n n, k = map(int, input().split())\r\n num = list(map(int, input().split()))\r\n sum = 0\r\n for i in range(1, n+1):\r\n c = num[i-1]\r\n count_for = 0\r\n count_bac = 0\r\n for j in range(i, n):\r\n if num[j] < c:\r\n count_for += 1\r\n for j in range(i):\r\n if num[j] < c:\r\n count_bac += 1\r\n count = count_for + count_bac\r\n p = (k(k+1))//2 count\r\n p = p - k * count_bac\r\n sum = sum + p\r\n print(sum)\r\n\r\n", "for _ in range(int(input())):\n N,K=map(int,input().split())\n ll=list(map(int,input().split()))\n c1=0\n c2=0\n for i in range(N):\n for j in range(i+1,N):\n if ll[i]>ll[j]:\n c1+=1\n for i in range(N):\n for j in range(N):\n if ll[i]>ll[j]:\n c2+=1\n print(c1K+c2K(K-1)//2)", "# cook your dish here\nt=int(input())\nwhile(t):\n\tt-=1\n\tn,k=map(int,input().split())\n\tarr=list(map(int,input().split()))\n\tans=[0]n\n\tans2=[0]n\n\tfor i in range(n):\n\t\tfor j in range(n):\n\t\t\tif(i<j and arr[i]>arr[j]):\n\t\t\t\tans[i]=ans[i]+1\n\t\t\tif(i>j and arr[i]>arr[j]):\n\t\t\t\tans2[i]=ans2[i]+1\n\t#print(ans)\n\t#print(ans2)\t\n\tfor i in range(n):\n\t\tif(ans[i]!=0):\n\t\t\tans[i]=(ans[i]k(k+1))//2\n\t\tif(ans2[i]!=0):\n\t\t\tans2[i]=(ans2[i]k(k-1))//2\n\tprint(sum(ans)+sum(ans2))", "# cook your dish here\nt=int(eval(input()))\nfor i in range(t):\n inp = list(map(int,input().split()))\n n=inp[0]\n k=inp[1]\n inp = list(map(int,input().split()))\n before=[]\n after=[]\n ans=0\n for p in range(len(inp)):\n bef_count=0\n af_count=0\n for q in range(len(inp)):\n if(q>p and inp[q]<inp[p]):\n af_count+=1\n elif(q<p and inp[q]<inp[p]):\n bef_count+=1\n ans+=af_count(k(k+1))//2\n ans+=bef_count(k(k-1))//2\n print(ans)", "import sys\nfrom random import choice,randint\ninp=sys.stdin.readline\nout=sys.stdout.write\nflsh=sys.stdout.flush\n \nsys.setrecursionlimit(109)\ninf = 1020\neps = 1.0 / 1010\nmod = 109+7\ndd = [(-1,0),(0,1),(1,0),(0,-1)]\nddn = [(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]\n \ndef MI(): return map(int, inp().strip().split())\ndef LI(): return list(map(int, inp().strip().split()))\ndef LLI(): return [list(map(int, l.split())) for l in sys.stdin.readlines().strip()]\ndef LI_(): return [int(x)-1 for x in inp().strip().split()]\ndef LF(): return [float(x) for x in inp().strip().split()]\ndef LS(): return inp().strip().split()\ndef I(): return int(inp().strip())\ndef F(): return float(inp().strip())\ndef S(): return inp().strip()\ndef pf(s): return out(s+'\\n')\ndef JA(a, sep): return sep.join(map(str, a))\ndef JAA(a, s, t): return s.join(t.join(map(str, b)) for b in a)\n\ndef main():\n t = I()\n l = []\n for _ in range(t):\n n,k=MI()\n a=LI()\n lcf=[0]n\n lce=[0]n\n for i in range(n):\n cnt1,cnt2=0,0\n for j in a[:i]:\n if j<a[i]:\n cnt1+=1\n for j in a[i:]:\n if j<a[i]:\n cnt2+=1\n lcf[i]=cnt1\n lce[i]=cnt2\n ans=0\n for i in range(n):\n ans += lcf[i]((k(k-1))//2)\n for i in range(n):\n ans += lce[i]((k(k+1))//2)\n l.append(ans)\n\n for i in range(t):\n pf(str(l[i]))\n\ndef __starting_point():\n main()\n__starting_point()", "def main():\r\n t = int(input())\r\n \r\n while t>0:\r\n n,k = map(int,input().split())\r\n l = list(map(int,input().split()))\r\n \r\n ll = sorted(l)\r\n count1 = 0\r\n \r\n for i,val in enumerate(ll):\r\n count1 = count1 + ( i - (ll[:i]).count(val) )\r\n \r\n ans = 0\r\n \r\n ans = ans + ( count1 k * (k-1) ) // 2\r\n \r\n count2 = 0\r\n \r\n for i,val in enumerate(l):\r\n temp = sum( 1 for j in l[i+1:] if j < val)\r\n count2 = count2 + ( temp )\r\n \r\n ans = ans + count2k\r\n \r\n print(ans)\r\n t-=1\r\n \r\ndef __starting_point():\r\n main()\n__starting_point()", "#!/usr/bin/env python\r\nimport os\r\nimport sys\r\n\r\ndef main():\r\n t = int(input())\r\n \r\n while t>0:\r\n n,k = map(int,input().split())\r\n l = list(map(int,input().split()))\r\n \r\n ll = sorted(l)\r\n count1 = 0\r\n \r\n for i,val in enumerate(ll):\r\n count1 = count1 + ( i - (ll[:i]).count(val) )\r\n \r\n ans = 0\r\n \r\n ans = ans + ( count1 k * (k-1) ) // 2\r\n \r\n count2 = 0\r\n \r\n for i,val in enumerate(l):\r\n temp = sum( 1 for j in l[i+1:] if j < val)\r\n count2 = count2 + ( temp )\r\n \r\n ans = ans + count2*k\r\n \r\n sys.stdout.write(str(ans)+\"\\n\")\r\n t-=1\r\n \r\ndef __starting_point():\r\n main()\n__starting_point()"]	{"inputs": [["2", "3 3", "2 1 3", "4 100", "99 2 1000 24", ""]], "outputs": [["12", "30000"]]}	INTERVIEW	PYTHON3	CODECHEF	12,758
69a52b017f9ef99f9140db9b27a850ac	UNKNOWN	Indian National Olympiad in Informatics 2015 A string is any nonempty sequence of 0s and 1s. Examples of strings are 00, 101, 111000, 1, 0, 01. The length of a string is the number of symbols in it. For example, the length of 111000 is 6. If u and v are strings, then uv is the string obtained by concatenating u and v. For example if u = 110 and v = 0010 then uv = 1100010. A string w is periodic if there exists a string v such that w = vn = vv · · · v (n times), for some n ≥ 2. Note that in this case the length of v is strictly less than that of w. For example, 110110 is periodic, because it is vv for v = 110. Given a positive integer N , find the number of strings of length N which are not periodic. Report the answer modulo M . The non-periodic strings of length 2 are 10 and 01. The non- periodic strings of length 3 are 001, 010, 011, 100, 101, and 110. -----Input format----- A single line, with two space-separated integers, N and M . -----Output format----- A single integer, the number of non-periodic strings of length N , modulo M . -----Test Data----- In all subtasks, 2 ≤ M ≤ 108. The testdata is grouped into 4 subtasks. Subtask 1 (10 marks) 1 ≤ N ≤ 4000. N is the product of two distinct prime numbers. Subtask 2 (20 marks) 1 ≤ N ≤ 4000. N is a power of a prime number. Subtask 3 (35 marks) 1 ≤ N ≤ 4000. Subtask 4 (35 marks) 1 ≤ N ≤ 150000. -----Example----- Here is the sample input and output corresponding to the example above: -----Sample input----- 3 176 -----Sample output----- 6 Note: Your program should not print anything other than what is specified in the output format. Please remove all diagnostic print statements before making your final submission. A program with extraneous output will be treated as incorrect!	["# cook your dish here\r\ndef offset(l, flag):\r\n x = 0\r\n # print(l)\r\n for i in range(1, len(l)):\r\n temp = []\r\n for j in range(i):\r\n v = getbig(l[i], l[j], fs)\r\n if v > 1:\r\n temp.append(v)\r\n if flag:\r\n x += 2v - 2\r\n else:\r\n x -= 2v - 2\r\n x += offset(temp, not flag)\r\n return x\r\n \r\ndef getbig(v1, v2, factors):\r\n x = 1\r\n for f in factors:\r\n while v1%f == 0 and v2%f == 0:\r\n v1//=f\r\n v2//=f\r\n x=f\r\n return x\r\n \r\ndef prime_factors(n):\r\n i = 2\r\n factors = set()\r\n while i i <= n:\r\n if n % i:\r\n i += 1\r\n else:\r\n n //= i\r\n factors.add(i)\r\n if n > 1:\r\n factors.add(n)\r\n return factors\r\n \r\nn,m = map(int, input().split())\r\nif n == 1:\r\n print(1)\r\nelse:\r\n fs = prime_factors(n)\r\n fs.discard(n)\r\n ans = 2n-2\r\n temp = []\r\n for v in fs:\r\n v = n//v\r\n temp.append(v)\r\n ans -= 2v - 2\r\n # print(ans)\r\n ans += offset(temp, True)\r\n # print(fs)\r\n print(ans%m)", "from math import sqrt\n\ndef per(n):\n if n in diz:\n return diz[n]\n else:\n counter=pow(2,n,m)\n for i in range(1,int(sqrt(n))+1):\n if n%i==0:\n counter-=per(i)\n if i!=1 and i!=(n//i):\n counter-=per(n//i)\n counter%=m\n return counter\n \nn, m = map(int, input().split())\ndiz={1:2}\nprint(per(n))\ncounter=pow(2,n,m)", "powersof2 = {}\r\nnonperiodics= {}\r\n\r\n\r\ndef pow2(x, m):\r\n powersof2[0] = 1%m\r\n powersof2[1] = 2%m\r\n for i in range(2, x+1):\r\n powersof2[i] = (powersof2[i-1]2)%m\r\n\r\n\r\ndef nonperiodicsfill(x):\r\n for i in range(x):\r\n nonperiodics[i]=0\r\n\r\n\r\ndef listoffactors(x):\r\n lista=[]\r\n for i in range(1, 1 + x//2):\r\n if x%i == 0 :\r\n lista.append(i)\r\n return lista\r\n\r\n\r\ndef sieve(x):\r\n for i in range(2, x):\r\n if prime[i]:\r\n for q in range(i2, x, i):\r\n prime[q] = False\r\n\r\n\r\ndef nonPeriodicStrings(s,m):\r\n # print(\"\\nNPS\"+ str(s) +\" \"+ str(m) + \"\\n\")\r\n if s==1:\r\n return 2%m\r\n if s in nonperiodics:\r\n return nonperiodics[s]\r\n if prime[s]:\r\n nps = (powersof2[s] - 2) % m\r\n nonperiodics[s] = nps\r\n return nps\r\n # print(s)\r\n li = listoffactors(s)\r\n # print(li)\r\n nps = powersof2[s]\r\n for i in li:\r\n nps -= nonPeriodicStrings(i, m)\r\n # print(nonPeriodicStrings(i,m))\r\n nps %= m\r\n nonperiodics[s] = nps\r\n return nps\r\n\r\n\r\ncc = input().split(' ')\r\na= int(cc[0])\r\nm= int(cc[1])\r\n#print(a)\r\n#print(m)\r\nprime = [True for i in range(a+1)]\r\n#m = int(input())\r\npow2(a, m)\r\n#print(powersof2)\r\nsieve(a+1)\r\n#print(prime)\r\nif prime[a]:\r\n l = powersof2[a] - 2\r\n print(l)\r\nelse:\r\n print(nonPeriodicStrings(a, m))\r\n\r\n\r\n\r\n", "# cook your dish here\nimport sys\n\n\ndef get_factor(n:int):\n for i in range(2, int(n0.5)+1):\n if(n%i==0):\n return i, n\n return n,n\n\nN,M=sys.stdin.readline().strip().split(\" \")[:2]\n\nN,M=int(N),int(M)\nif(N in (0,1)): print(0)\n#elif(N==1): print(2%M)\nelse:\n res=2N-2\n f_, n_=get_factor(N)\n if(f_<N):\n res_=[f_]\n res-=2(N//f_)-2\n while(f_<n_):\n f_, n_=get_factor(n_//f_)\n if(f_ not in res_):\n res_.append(f_)\n res-=2(N//f_)-2\n if(n_ not in res_):\n res-=2(N//n_)-2\n# if(N%(f_2)==0):\n# res-=2(N//f_)-2\n# else:\n# res-=2(N//f_)-2+2f_-2\n print(res%M)\n \n ", "# cook your dish here\nimport sys\n\n\ndef get_factor(n:int):\n for i in range(2, int(n0.5)+1):\n if(n%i==0):\n return i\n \n\nN,M=sys.stdin.readline().strip().split(\" \")[:2]\n\nN,M=int(N),int(M)\nif(N in (0,1)): print(0)\n#elif(N==1): print(2%M)\nelse:\n res=2N-2\n f_=get_factor(N)\n if(f_):\n if(N%(f_2)==0):\n res-=2(N//f_)-2\n else:\n res-=2(N//f_)-2+2f_-2\n \n print(res%M)\n \n ", "# cook your dish here\nimport sys\n\ndef get_factors(n:int):\n for i in range(2, n//2+1):\n if(n%i==0):\n yield i\n\nN,M=sys.stdin.readline().strip().split(\" \")[:2]\n\nN,M=int(N),int(M)\nif(N in (0,1)): print(0)\n#elif(N==1): print(2%M)\nelse:\n res=2N-2\n for el in get_factors(N):\n res-=2el-2\n print(res%M)\n \n ", "# cook your dish here\ndef offset(l, flag):\n x = 0\n # print(l)\n for i in range(1, len(l)):\n temp = []\n for j in range(i):\n v = getbig(l[i], l[j], fs)\n if v > 1:\n temp.append(v)\n if flag:\n x += 2v - 2\n else:\n x -= 2*v - 2\n x += offset(temp, not flag)\n return x\n \ndef getbig(v1, v2, factors):\n x = 1\n for f in factors:\n while v1%f == 0 and v2%f == 0:\n v1//=f\n v2//=f\n x=f\n return x\n \ndef prime_factors(n):\n i = 2\n factors = set()\n while i * i <= n:\n if n % i:\n i += 1\n else:\n n //= i\n factors.add(i)\n if n > 1:\n factors.add(n)\n return factors\n \nn,m = map(int, input().split())\nif n == 1:\n print(1)\nelse:\n fs = prime_factors(n)\n fs.discard(n)\n ans = 2n-2\n temp = []\n for v in fs:\n v = n//v\n temp.append(v)\n ans -= 2v - 2\n # print(ans)\n ans += offset(temp, True)\n # print(fs)\n print(ans%m)", "# cook your dish here\ndef prime_factors(n):\n i = 2\n factors = set()\n while i * i <= n:\n if n % i:\n i += 1\n else:\n n //= i\n factors.add(i)\n if n > 1:\n factors.add(n)\n return factors\n \nn,m = map(int, input().split())\nfs = prime_factors(n)\nfs.discard(n)\nans = 2n-2\nfor v in fs:\n # print(ans, v)\n v = n//v\n # print(v)\n ans -= 2v - 2\n # print(ans)\n# print(fs)\nprint(ans%m)", "# cook your dish here\ndef prime_factors(n):\n i = 2\n factors = set()\n while i * i <= n:\n if n % i:\n i += 1\n else:\n n //= i\n factors.add(n)\n if n % i != 0:\n factors.add(i)\n break\n \n return factors\n \nn,m = map(int, input().split())\nif n > 1:\n fs = prime_factors(n)\n ans = 2n-2\n for v in fs:\n # print(ans, v)\n ans -= 2v - 2\n # print(ans)\n # print(fs)\n print(ans%m)\nelse:\n print(1)", "# cook your dish here\ndef prime_factors(n):\n i = 2\n factors = set()\n while i * i <= n:\n if n % i:\n i += 1\n else:\n n //= i\n factors.add(n)\n if n % i != 0:\n factors.add(i)\n break\n \n return factors\n \nn,m = map(int, input().split())\nfs = prime_factors(n)\nans = 2n-2\nfor v in fs:\n if v != n:\n # print(ans, v)\n ans -= 2v - 2\n # print(ans)\n# print(fs)\nprint(ans%m)", "# cook your dish here\ndef prime_factors(n):\n i = 2\n factors = set()\n while i * i <= n:\n if n % i:\n i += 1\n else:\n n //= i\n factors.add(i)\n factors.add(n)\n break\n \n return factors\n \nn,m = map(int, input().split())\nfs = prime_factors(n)\nans = 2n-2\nfor v in fs:\n if v != n:\n # print(ans, v)\n ans -= 2v - 2\n # print(ans)\n# print(fs)\nprint(ans%m)", "# cook your dish here\ndef prime_factors(n):\n i = 2\n factors = set()\n while i * i <= n:\n if n % i:\n i += 1\n else:\n n //= i\n factors.add(i)\n if n > 1:\n factors.add(n)\n return factors\n \nn,m = map(int, input().split())\nfs = prime_factors(n)\nans = 2n-2\nfor v in fs:\n if v != n:\n ans -= 2v - 2\n# print(fs)\nprint(ans%m)", "def mod(f,m):\r\n if f==1:\r\n return(2%m)\r\n elif f%2==0:\r\n return(((mod(f//2,m))2)%m)\r\n else:\r\n return((((mod(f//2,m))2)2)%m)\r\nn,m=list(map(int,input().strip().split()))\r\nl=[0 for i in range(n+1)]\r\nl[0],l[1]=1,1\r\nfor i in range(2,n+1):\r\n if l[i]==0:\r\n t=2\r\n while ti<=n:\r\n l[ti]=1\r\n t+=1\r\nprime=[]\r\nfor i in range(len(l)):\r\n if l[i]==0:\r\n prime.append(i)\r\nt=0\r\nfor j in prime:\r\n if n%j==0:\r\n t+=mod(n//j,m)\r\ns=mod(n,m)\r\nt%=m\r\nif s-t>0:\r\n print(s-t)\r\nelse:\r\n print(m-s+t)\r\n\r\n ", "import random\ndef miller_rabin(n, k):\n\n if n == 2 or n==3:\n return True\n\n if n % 2 == 0:\n return False\n\n r, s = 0, n - 1\n while s % 2 == 0:\n r += 1\n s //= 2\n for _ in range(k):\n a = random.randrange(2, n - 1)\n x = pow(a, s, n)\n if x == 1 or x == n - 1:\n continue\n for _ in range(r - 1):\n x = pow(x, 2, n)\n if x == n - 1:\n break\n else:\n return False\n return True\npows = {1:2}\nn, k = list(map(int, input().split(' ')))\nT = pow(2,n)\nif miller_rabin(n,6):\n print((T-2)%k)\nelse:\n m = 0\n for i in range(2,n//2+1):\n if n%i==0:\n if i>50000:\n a = 6\n elif i>20000:\n a = 5\n else:\n a = 4\n if miller_rabin(i,a):\n pows[i]=pow(2,i)-2\n m+=pows[i]\n else:\n w = 0\n for j in pows:\n if i%j==0:\n w+=pows[j]\n if j>i//2:\n break\n pows[i] = pow(2,i)-w\n m+=pows[i]\n\n print((T-m-2)%k)\n", "# cook your dish here\nimport random\ndef miller_rabin(n, k):\n\n if n == 2 or n==3:\n return True\n\n if n % 2 == 0:\n return False\n\n r, s = 0, n - 1\n while s % 2 == 0:\n r += 1\n s //= 2\n for _ in range(k):\n a = random.randrange(2, n - 1)\n x = pow(a, s, n)\n if x == 1 or x == n - 1:\n continue\n for _ in range(r - 1):\n x = pow(x, 2, n)\n if x == n - 1:\n break\n else:\n return False\n return True\npows = {1:2}\nn, k = list(map(int, input().split(' ')))\nT = pow(2,n)\nif miller_rabin(n,6):\n print((T-2)%k)\nelse:\n m = 0\n for i in range(2,n//2+1):\n if n%i==0:\n if i>50000:\n a = 6\n elif i>20000:\n a = 5\n else:\n a = 4\n if miller_rabin(i,a):\n pows[i]=pow(2,i)-2\n m+=pows[i]\n else:\n w = 0\n for j in pows:\n if i%j==0:\n w+=pows[j]\n if j>i//2:\n break\n pows[i] = pow(2,i)-w\n m+=pows[i]\n\n print((T-m-2)%k)\n", "\r\npowers=[0 for i in range(150001)]\r\n\r\ndef factorize(n):\r\n factors=set()\r\n for i in range(1,n):\r\n if ii>n:\r\n break\r\n else:\r\n if (n%i)==0:\r\n factors.add(i)\r\n factors.add(n//i)\r\n factors.remove(n)\r\n return factors\r\n\r\ndef calc(m):\r\n powers[0]=1\r\n for i in range(1,150001):\r\n powers[i]=(powers[i-1]2)%m\r\n\r\nn,m=list(map(int,input().split()))\r\ncalc(m)\r\ndp=[0 for i in range(n+1)]\r\ndp[1]=2\r\nfor i in range(2,n+1):\r\n factors=factorize(i)\r\n dp[i]=powers[i]\r\n for num in factors:\r\n dp[i]-=dp[num]\r\n dp[i]=(dp[i]+m)%m\r\nprint(dp[n])\r\n", "\nn, m = map(int, input().split())\np, mem = 3, []\nres = 2n - 2\nif n % 2 == 0:\n res -= 2\nwhile p < n:\n if not any(p % e == 0 for e in mem) and n % p == 0 :\n mem.append(p)\n res -= 2p - 2\n \n p +=2\n \nprint(res % m)\n \n \n \n \n \n \n ", "from math import sqrt, gcd\r\nn, MOD = list(map(int, input().split()))\r\nfactors = set()\r\nfor i in range(2, 1+int(sqrt(n))):\r\n if(n % i == 0):\r\n factors.add(i)\r\n factors.add(n//i)\r\nfactors = sorted(list(factors), reverse = True)\r\nans = 2n\r\nif(factors == []):\r\n ans -= 2\r\ndone = []\r\nfor i in factors:\r\n ans -= (2i) % MOD\r\n temp = i\r\n #print(\"i=\",i,ans)\r\n for j in done:\r\n if(temp == 1):\r\n break\r\n ans = (ans + (2gcd(temp,j))%MOD) % MOD\r\n temp //= gcd(temp,j)\r\n #print(\"j=\",j,ans)\r\n done.append(i)\r\nif(factors):\r\n ans -= max(0,len(factors)//2 - 1) 2\r\nprint(ans%MOD)", "\r\nN,M = map(int,input().split())\r\ndp = [0]( (2(10*5)) +1)\r\npower = [0]( (2(105)) +1)\r\npower[1] = 2\r\ndp[1] = 2%int(M)\r\nfor i in range(2,int(N)+1):\r\n power[i] = (2power[i-1])%int(M)\r\n\r\n\r\nfor i in range(2,int(N)+1):\r\n if(int(N)%i!=0):\r\n continue\r\n\r\n dp[i] = power[i]\r\n #print(power[i])\r\n for j in range(1,int(int(i)/2)+1):\r\n if(i%j==0):\r\n dp[i] = dp[i]-dp[j]\r\n if(dp[i]<0):\r\n dp[i] += int(M)\r\n \r\nprint(dp[int(N)]) ", "factors = []\r\n\r\ndef fact(n):\r\n factors.clear()\r\n for i in range(2,int(n*0.5)+1):\r\n if n%i == 0:\r\n factors.append(i)\r\n if ii != n:\r\n factors.append(n//i)\r\nn , m = map(int,input().split())\r\n\r\ndp = [0]( (2(10*5)) +1)\r\n\r\ndp[2] = 2%m\r\ndp[3] = 6%m\r\ndp[4] = 12%m\r\n\r\nif n > 4:\r\n for i in range(5,n+1):\r\n fact(i)\r\n k = (pow(2,i,m) - 2)%m\r\n if len(factors) == 0:\r\n dp[i] = k\r\n else:\r\n sub = 0\r\n for j in factors:\r\n sub += dp[j]\r\n sub %= m\r\n dp[i] = (k - sub)%m\r\nprint(dp[n])\r\n", "# cook your dish here\n\nN, M = map(int, input().split())\n\npow2ModM = [1 for i in range(N + 1)]\npow2ModM[0] = 1\nfor i in range(1, N + 1):\n pow2ModM[i] = (pow2ModM[i - 1] 2) % M\n\ndef fModM(N):\n answer = pow2ModM[N]\n for d in range(1, N):\n if N % d == 0:\n answer = (answer - fModM(d)) % M\n return answer\n\nprint(fModM(N))\n\n"]	{"inputs": [["3 176"]], "outputs": [["6"]]}	INTERVIEW	PYTHON3	CODECHEF	15,055
b1c857fa02977c0552a3dc516d7d50bf	UNKNOWN	Finally, the pandemic is over in ChefLand, and the chef is visiting the school again. Chef likes to climb the stairs of his school's floor by skipping one step, sometimes chef climbs the stairs one by one. Simply, the chef can take one or 2 steps in one upward movement. There are N stairs between ground and next floor. The chef is on the ground floor and he wants to go to the next floor with Cheffina but, Cheffina asks chef in how many ways, the chef can reach the next floor normally or any combination of skipping one step, where order doesn't matter. -----Input:----- - First-line will contain $T$, the number of test cases. Then the test cases follow. - Each test case contains a single line of input, two integers $N$. -----Output:----- For each test case, output in a single line answer as the number of ways. -----Constraints----- - $1 \leq T \leq 1000$ - $1 \leq N \leq 10^5$ -----Sample Input:----- 1 3 -----Sample Output:----- 2 -----EXPLANATION:----- ways: [1,1,1], here chef climb to the next floor, one by one stair. [1,2], here chef climb to the next floor, one step first and after that 2 stairs at once. Note, [2,1] consider the same as that of [1,2] hence ignored.	["for _ in range(int(input())):\n N=int(input())\n if N%2==0:\n print(N//2+1)\n else:\n print((N-1)//2+1)", "# cook your dish here\nfor _ in range(int(input())):\n n=int(input())\n print((n//2)+1)", "# cook your dish here\nfor t in range(int(input())):\n n = int(input())\n print(int(n/2)+1)\n", "t = int(input())\n\nwhile(t):\n \n t -= 1\n \n n = int(input())\n \n ans = 1 + n//2\n \n print(ans)", "# your code goes here\nt=int(input())\nwhile t>0:\n\tn=int(input())\n\tprint(n//2+1)\n\tt-=1", "# cook your dish here\nfor _ in range(int(input())):\n n = int(input())\n print(n//2+1)", "# cook your dish here\nimport sys\nT=int(input())\nfor t in range(T):\n N=int(input())\n print(int(N/2)+1)\n"]	{"inputs": [["1", "3"]], "outputs": [["2"]]}	INTERVIEW	PYTHON3	CODECHEF	768
25fa88a3996bbd4c6bbb4555d24f5d62	UNKNOWN	Indian National Olympiad in Informatics 2016 There are k types of brackets each with its own opening bracket and closing bracket. We assume that the first pair is denoted by the numbers 1 and k+1, the second by 2 and k+2 and so on. Thus the opening brackets are denoted by 1,2,.., k, and the corresponding closing brackets are denoted by k+1,k+2,..., 2k respectively. Some sequences with elements from 1,2, ... 2k form well-bracketed sequences while others don't. A sequence is well-bracketed, if we can match or pair up opening brackets and closing brackets of the same type in such a way that the following holds: 1) every bracket is paired up 2) in each matched pair, the opening bracket occurs before the closing bracket 3) for a matched pair, any other matched pair lies either completely between them or outside them. For the examples discussed below, let us assume that k = 2. The sequence 1,1,3 is not well-bracketed as one of the two 1's cannot be paired. The sequence 3,1,3,1 is not well-bracketed as there is no way to match the second 1 to a closing bracket occurring after it. The sequence 1,2,3,4 is not well-bracketed as the matched pair 2,4 is neither completely between the matched pair 1,3 nor completely outside it. That is, the matched pairs cannot overlap. The sequence 1,2,4,3,1,3 is well-bracketed. We match the first 1 with the first 3, the 2 with the 4 and the second 1 with the second 3, satisfying all the 3 conditions. If you rewrite these sequences using [,{,],} instead of 1,2,3,4 respectively, this will be quite clear. In this problem you are given a sequence of brackets, of length N: B[1], .., B[N], where each B[i] is one of the brackets. You are also given an array of Values: V[1],.., V[N]. Among all the subsequences in the Values array, such that the corresponding bracket subsequence in the B Array is a well-bracketed sequence, you need to find the maximum sum. Suppose N = 6, k = 3 and the values of V and B are as follows: i 1 2 3 4 5 6 V[i] 4 5 -2 1 1 6 B[i] 1 3 4 2 5 6 Then, the brackets in positions 1,3 form a well-bracketed sequence (1,4) and the sum of the values in these positions is 2 (4 + -2 = 2). The brackets in positions 1,3,4,5 form a well-bracketed sequence (1,4,2,5) and the sum of the values in these positions is 4. Finally, the brackets in positions 2,4,5,6 forms a well-bracketed sequence (3,2,5,6) and the sum of the values in these positions is 13. The sum of the values in positions 1,2,5,6 is 16 but the brackets in these positions (1,3,5,6) do not form a well-bracketed sequence. You can check the best sum from positions whose brackets form a well-bracketed sequence is 13. -----Input format----- One line, which contains (2N + 2) space separate integers. The first integer denotes N. The next integer is k. The next N integers are V[1],..., V[N]. The last N integers are B[1],.., B[N]. -----Output format----- One integer, which is the maximum sum possible satisfying the requirement mentioned above. -----Test data----- 1 ≤ k ≤ 7 -106 ≤ V[i] ≤ 106, for all i 1 ≤ B[i] ≤ 2k, for all i. Subtask 1 (40 Marks) 1 ≤ n ≤ 10. Subtask 2 (60 Marks) 1 ≤ n ≤ 700. -----Sample Input----- 6 3 4 5 -2 1 1 6 1 3 4 2 5 6 -----Sample Output----- 13	["# cook your dish here\r\nimport bisect\r\nn, k1, l = map(int, input().split())\r\nv_l, b_l = l[:n], l[n:]\r\n\r\nb_inv = {key:[] for key in range(2k1)}\r\nfor i in range(n):\r\n b_l[i] -= 1\r\n b_inv[b_l[i]].append(i)\r\n\r\ndp = [[0 for _ in range(n)] for _ in range(n)]\r\nfor k in range(1, n):\r\n for j in range(n-2, -1, -1):\r\n if j+k >= n:\r\n continue\r\n \r\n dp[j][j+k] = max(dp[j][j+k], dp[j][j+k-1])\r\n if b_l[j+k] >= k1:\r\n left = bisect.bisect_right(b_inv[b_l[j+k]-k1], j)\r\n \r\n if b_l[j+k] >= k1:\r\n for i in b_inv[b_l[j+k]-k1][left:]:\r\n if i > j+k:\r\n break\r\n if i > j:\r\n dp[j][j+k] = max(dp[j][j+k], dp[j][i-1]+dp[i][j+k])\r\n \r\n if b_l[j+k]-k1 == b_l[j]:\r\n if j+k-1 < n:\r\n dp[j][j+k] = max(dp[j][j+k], v_l[j+k]+v_l[j]+dp[j+1][j+k-1])\r\n else:\r\n dp[j][j+k] = max(dp[j][j+k], v_l[j+k]+v_l[j])\r\n \r\n\r\nprint(dp[0][-1])", "a,b,c=list(map(int,input().strip().split()))\r\nd=[]\r\ne=[]\r\nfor i in range(a):\r\n e.append(c[i])\r\n d.append(c[i+a])\r\nDP1=[[-1 for i in range(a)] for j in range(a)]\r\ndef DP(l,r):\r\n nonlocal d,e,b,DP1\r\n if l>=r:\r\n return 0\r\n elif DP1[l][r]!=-1:\r\n return DP1[l][r]\r\n else:\r\n DP1[l][r]=max(DP1[l][r],DP(l+1,r))\r\n DP1[l][r]=max(DP1[l][r],DP(l,r-1))\r\n if d[l]+b==d[r]:\r\n DP1[l][r]=max(DP1[l][r],e[l]+e[r]+DP(l+1,r-1))\r\n for i in range(l,r):\r\n if d[l]+b==d[i] or d[i]+b==d[r]:\r\n DP1[l][r]=max(DP1[l][r],DP(l,i)+DP(i+1,r))\r\n return DP1[l][r]\r\nprint(DP(0,a-1))\r\n", "a,b,c=list(map(int,input().strip().split()))\r\nd=[]\r\ne=[]\r\nfor i in range(a):\r\n e.append(c[i])\r\n d.append(c[i+a])\r\nDP1=[[-1 for i in range(a)] for j in range(a)]\r\ndef DP(l,r):\r\n nonlocal d,e,b,DP1\r\n if l>=r:\r\n return 0\r\n elif DP1[l][r]!=-1:\r\n return DP1[l][r]\r\n else:\r\n #DP1[l][r]=max(DP1[l][r],DP(l+1,r))\r\n #DP1[l][r]=max(DP1[l][r],DP(l,r-1))\r\n if d[l]+b==d[r]:\r\n DP1[l][r]=max(DP1[l][r],e[l]+e[r]+DP(l+1,r-1))\r\n for i in range(l,r):\r\n DP1[l][r]=max(DP1[l][r],DP(l,i)+DP(i+1,r))\r\n return DP1[l][r]\r\nprint(DP(0,a-1))\r\n", "# cook your dish here\nimport bisect\nn, k1, l = map(int, input().split())\nv_l, b_l = l[:n], l[n:]\n\nb_inv = {key:[] for key in range(2k1)}\nfor i in range(n):\n b_l[i] -= 1\n b_inv[b_l[i]].append(i)\n\ndp = [[0 for _ in range(n)] for _ in range(n)]\nfor k in range(1, n):\n for j in range(n-2, -1, -1):\n if j+k >= n:\n continue\n \n dp[j][j+k] = max(dp[j][j+k], dp[j][j+k-1])\n if b_l[j+k] >= k1:\n left = bisect.bisect_right(b_inv[b_l[j+k]-k1], j)\n \n if b_l[j+k] >= k1:\n for i in b_inv[b_l[j+k]-k1][left:]:\n if i > j+k:\n break\n if i > j:\n dp[j][j+k] = max(dp[j][j+k], dp[j][i-1]+dp[i][j+k])\n \n if b_l[j+k]-k1 == b_l[j]:\n if j+k-1 < n:\n dp[j][j+k] = max(dp[j][j+k], v_l[j+k]+v_l[j]+dp[j+1][j+k-1])\n else:\n dp[j][j+k] = max(dp[j][j+k], v_l[j+k]+v_l[j])\n \n\nprint(dp[0][-1])", "# cook your dish here\r\ninpu=list(map(int,input().split()))\r\nn,k=inpu[0],inpu[1]\r\nv=inpu[2:n+2]\r\nb=inpu[n+2:2n+2]\r\nbrac={i:set() for i in range(n)}\r\nfor i in range(n):\r\n for j in range(i+1,n):\r\n if b[j]-b[i]==k:\r\n brac[i].add(j)\r\n \r\ndp=[[0 for i in range(n)] for j in range(n)]\r\nfor j in range(1,n):\r\n for i in range(n-j):\r\n ans=-float(\"inf\")\r\n if i+j in brac[i]:\r\n if j==1:\r\n ans=max(ans,v[i+j]+v[i])\r\n else:\r\n ans=max(ans,v[i+j]+v[i]+dp[i+1][i+j-1])\r\n for l in brac[i]:\r\n if l>=i+j:\r\n continue\r\n if b[l]-b[i]==k:\r\n if l==i+1:\r\n ans=max(ans,v[l]+v[i]+dp[l+1][i+j])\r\n else:\r\n ans=max(ans,v[l]+v[i]+dp[l+1][i+j]+dp[i+1][l-1])\r\n ans=max(ans,dp[i+1][i+j])\r\n dp[i][i+j]=ans\r\nprint(dp[0][n-1])\r\n", "# cook your dish here\nimport bisect\n# def recur(s_i, e_i, end_i):\n# # if end_i in dp[s_i] and e_i in dp[s_i][end_i]:\n# # return dp[s_i][end_i][e_i]\n \n# inside = 0\n# for i in range(s_i+1, e_i):\n# if b_l[i] < k:\n# if e_i not in dp[i]:\n# dp[i][e_i] = 0\n# bi_i = bisect.bisect_left(b_inv[b_l[i]+k], i)\n# for ind in b_inv[b_l[i]+k][bi_i:]:\n# if i < ind < e_i:\n# dp[i][e_i] = max(dp[i][e_i], recur(i, ind, e_i))\n# inside = max(inside, dp[i][e_i])\n# outside = 0\n# for i in range(e_i+1, min(n, end_i)):\n# if b_l[i] < k:\n# if end_i not in dp[i]:\n# dp[i][end_i] = 0\n# bi_i = bisect.bisect_left(b_inv[b_l[i]+k], i)\n# for ind in b_inv[b_l[i]+k][bi_i:]:\n# if i < ind < end_i:\n# dp[i][end_i] = max(dp[i][end_i], recur(i, ind, end_i))\n# outside = max(outside, dp[i][end_i])\n \n# # if end_i not in dp[s_i]:\n# # dp[s_i][end_i] = {}\n# # dp[s_i][end_i].update({e_i: v_l[s_i] + v_l[e_i] + outside + inside})\n# # return dp[s_i][end_i][e_i]\n# return v_l[s_i] + v_l[e_i] + outside + inside\n \nn, k1, l = map(int, input().split())\nv_l, b_l = l[:n], l[n:]\n\nb_inv = {key:[] for key in range(2k1)}\nfor i in range(n):\n b_l[i] -= 1\n b_inv[b_l[i]].append(i)\n\ndp = [[0 for _ in range(n)] for _ in range(n)]\nfor k in range(1, n):\n for j in range(n-2, -1, -1):\n if j+k >= n:\n continue\n \n dp[j][j+k] = max(dp[j][j+k], dp[j][j+k-1])\n if b_l[j+k] >= k1:\n left = bisect.bisect_right(b_inv[b_l[j+k]-k1], j)\n \n if b_l[j+k] >= k1:\n for i in b_inv[b_l[j+k]-k1][left:]:\n if i > j+k:\n break\n if i > j:\n dp[j][j+k] = max(dp[j][j+k], dp[j][i-1]+dp[i][j+k])\n \n if b_l[j+k]-k1 == b_l[j]:\n if j+k-1 < n:\n dp[j][j+k] = max(dp[j][j+k], v_l[j+k]+v_l[j]+dp[j+1][j+k-1])\n else:\n dp[j][j+k] = max(dp[j][j+k], v_l[j+k]+v_l[j])\n \n# dp = [{} for _ in range(n)]\n# ans = 0\n# for i in range(n):\n# if b_l[i] < k:\n# if n+1 not in dp[i]:\n# dp[i][n+1] = 0\n# bi_i = bisect.bisect_left(b_inv[b_l[i]+k], i)\n# for ind in b_inv[b_l[i]+k][bi_i:]:\n# if i < ind:\n# dp[i][n+1] = max(dp[i][n+1], recur(i, ind, n+1))\n# ans = max(ans, dp[i][n+1])\n# print(dp)\nprint(dp[0][-1])", "# cook your dish here\nimport bisect\n# def recur(s_i, e_i, end_i):\n# # if end_i in dp[s_i] and e_i in dp[s_i][end_i]:\n# # return dp[s_i][end_i][e_i]\n \n# inside = 0\n# for i in range(s_i+1, e_i):\n# if b_l[i] < k:\n# if e_i not in dp[i]:\n# dp[i][e_i] = 0\n# bi_i = bisect.bisect_left(b_inv[b_l[i]+k], i)\n# for ind in b_inv[b_l[i]+k][bi_i:]:\n# if i < ind < e_i:\n# dp[i][e_i] = max(dp[i][e_i], recur(i, ind, e_i))\n# inside = max(inside, dp[i][e_i])\n# outside = 0\n# for i in range(e_i+1, min(n, end_i)):\n# if b_l[i] < k:\n# if end_i not in dp[i]:\n# dp[i][end_i] = 0\n# bi_i = bisect.bisect_left(b_inv[b_l[i]+k], i)\n# for ind in b_inv[b_l[i]+k][bi_i:]:\n# if i < ind < end_i:\n# dp[i][end_i] = max(dp[i][end_i], recur(i, ind, end_i))\n# outside = max(outside, dp[i][end_i])\n \n# # if end_i not in dp[s_i]:\n# # dp[s_i][end_i] = {}\n# # dp[s_i][end_i].update({e_i: v_l[s_i] + v_l[e_i] + outside + inside})\n# # return dp[s_i][end_i][e_i]\n# return v_l[s_i] + v_l[e_i] + outside + inside\n \nn, k1, l = map(int, input().split())\nv_l, b_l = l[:n], l[n:]\n\nb_inv = {key:[] for key in range(2k1)}\nfor i in range(n):\n b_l[i] -= 1\n b_inv[b_l[i]].append(i)\n\ndp = [[0 for _ in range(n)] for _ in range(n)]\nfor k in range(1, n):\n for j in range(n-2, -1, -1):\n if j+k >= n:\n continue\n \n dp[j][j+k] = max(dp[j][j+k], dp[j][j+k-1])\n if b_l[j+k] >= k1:\n left = bisect.bisect_left(b_inv[b_l[j+k]-k1], j)\n \n if b_l[j+k] >= k1:\n for i in b_inv[b_l[j+k]-k1][left:]:\n if i > j+k:\n break\n dp[j][j+k] = max(dp[j][j+k], dp[j][i-1]+dp[i][j+k])\n \n if b_l[j+k]-k1 == b_l[j]:\n if j+k-1 < n:\n dp[j][j+k] = max(dp[j][j+k], v_l[j+k]+v_l[j]+dp[j+1][j+k-1])\n else:\n dp[j][j+k] = max(dp[j][j+k], v_l[j+k]+v_l[j])\n \n# dp = [{} for _ in range(n)]\n# ans = 0\n# for i in range(n):\n# if b_l[i] < k:\n# if n+1 not in dp[i]:\n# dp[i][n+1] = 0\n# bi_i = bisect.bisect_left(b_inv[b_l[i]+k], i)\n# for ind in b_inv[b_l[i]+k][bi_i:]:\n# if i < ind:\n# dp[i][n+1] = max(dp[i][n+1], recur(i, ind, n+1))\n# ans = max(ans, dp[i][n+1])\n# print(dp)\nprint(dp[0][-1])", "# cook your dish here\n# import bisect\n# def recur(s_i, e_i, end_i):\n# # if end_i in dp[s_i] and e_i in dp[s_i][end_i]:\n# # return dp[s_i][end_i][e_i]\n \n# inside = 0\n# for i in range(s_i+1, e_i):\n# if b_l[i] < k:\n# if e_i not in dp[i]:\n# dp[i][e_i] = 0\n# bi_i = bisect.bisect_left(b_inv[b_l[i]+k], i)\n# for ind in b_inv[b_l[i]+k][bi_i:]:\n# if i < ind < e_i:\n# dp[i][e_i] = max(dp[i][e_i], recur(i, ind, e_i))\n# inside = max(inside, dp[i][e_i])\n# outside = 0\n# for i in range(e_i+1, min(n, end_i)):\n# if b_l[i] < k:\n# if end_i not in dp[i]:\n# dp[i][end_i] = 0\n# bi_i = bisect.bisect_left(b_inv[b_l[i]+k], i)\n# for ind in b_inv[b_l[i]+k][bi_i:]:\n# if i < ind < end_i:\n# dp[i][end_i] = max(dp[i][end_i], recur(i, ind, end_i))\n# outside = max(outside, dp[i][end_i])\n \n# # if end_i not in dp[s_i]:\n# # dp[s_i][end_i] = {}\n# # dp[s_i][end_i].update({e_i: v_l[s_i] + v_l[e_i] + outside + inside})\n# # return dp[s_i][end_i][e_i]\n# return v_l[s_i] + v_l[e_i] + outside + inside\n \nn, k1, l = map(int, input().split())\nv_l, b_l = l[:n], l[n:]\n\nb_inv = {key:[] for key in range(2k1)}\nfor i in range(n):\n b_l[i] -= 1\n b_inv[b_l[i]].append(i)\n\ndp = [[0 for _ in range(n)] for _ in range(n)]\nfor k in range(1, n):\n for j in range(n-2, -1, -1):\n if j+k >= n:\n continue\n \n dp[j][j+k] = max(dp[j][j+k], dp[j][j+k-1])\n if b_l[j+k] >= k1:\n for i in reversed(b_inv[b_l[j+k]-k1]):\n if i <= j:\n break\n dp[j][j+k] = max(dp[j][j+k], dp[j][i-1]+dp[i][j+k])\n \n if b_l[j+k]-k1 == b_l[j]:\n if j+k-1 < n:\n dp[j][j+k] = max(dp[j][j+k], v_l[j+k]+v_l[j]+dp[j+1][j+k-1])\n else:\n dp[j][j+k] = max(dp[j][j+k], v_l[j+k]+v_l[j])\n \n# dp = [{} for _ in range(n)]\n# ans = 0\n# for i in range(n):\n# if b_l[i] < k:\n# if n+1 not in dp[i]:\n# dp[i][n+1] = 0\n# bi_i = bisect.bisect_left(b_inv[b_l[i]+k], i)\n# for ind in b_inv[b_l[i]+k][bi_i:]:\n# if i < ind:\n# dp[i][n+1] = max(dp[i][n+1], recur(i, ind, n+1))\n# ans = max(ans, dp[i][n+1])\n# print(dp)\nprint(dp[0][-1])", "# cook your dish here\n# import bisect\n# def recur(s_i, e_i, end_i):\n# # if end_i in dp[s_i] and e_i in dp[s_i][end_i]:\n# # return dp[s_i][end_i][e_i]\n \n# inside = 0\n# for i in range(s_i+1, e_i):\n# if b_l[i] < k:\n# if e_i not in dp[i]:\n# dp[i][e_i] = 0\n# bi_i = bisect.bisect_left(b_inv[b_l[i]+k], i)\n# for ind in b_inv[b_l[i]+k][bi_i:]:\n# if i < ind < e_i:\n# dp[i][e_i] = max(dp[i][e_i], recur(i, ind, e_i))\n# inside = max(inside, dp[i][e_i])\n# outside = 0\n# for i in range(e_i+1, min(n, end_i)):\n# if b_l[i] < k:\n# if end_i not in dp[i]:\n# dp[i][end_i] = 0\n# bi_i = bisect.bisect_left(b_inv[b_l[i]+k], i)\n# for ind in b_inv[b_l[i]+k][bi_i:]:\n# if i < ind < end_i:\n# dp[i][end_i] = max(dp[i][end_i], recur(i, ind, end_i))\n# outside = max(outside, dp[i][end_i])\n \n# # if end_i not in dp[s_i]:\n# # dp[s_i][end_i] = {}\n# # dp[s_i][end_i].update({e_i: v_l[s_i] + v_l[e_i] + outside + inside})\n# # return dp[s_i][end_i][e_i]\n# return v_l[s_i] + v_l[e_i] + outside + inside\n \nn, k1, l = map(int, input().split())\nv_l, b_l = l[:n], l[n:]\n\nb_inv = {key:[] for key in range(2k1)}\nfor i in range(n):\n b_l[i] -= 1\n b_inv[b_l[i]].append(i)\n\ndp = [[0 for _ in range(n)] for _ in range(n)]\nfor k in range(1, n):\n for j in range(n-2, -1, -1):\n if j+k >= n:\n continue\n \n dp[j][j+k] = max(dp[j][j+k], dp[j][j+k-1])\n dp[j][j+k] = max(dp[j][j+k], dp[j+1][j+k])\n if b_l[j+k] >= k1:\n for i in b_inv[b_l[j+k]-k1]:\n dp[j][j+k] = max(dp[j][j+k], dp[j][i-1]+dp[i][j+k])\n \n if b_l[j+k]-k1 == b_l[j]:\n if j+k-1 < n:\n dp[j][j+k] = max(dp[j][j+k], v_l[j+k]+v_l[j]+dp[j+1][j+k-1])\n else:\n dp[j][j+k] = max(dp[j][j+k], v_l[j+k]+v_l[j])\n \n# dp = [{} for _ in range(n)]\n# ans = 0\n# for i in range(n):\n# if b_l[i] < k:\n# if n+1 not in dp[i]:\n# dp[i][n+1] = 0\n# bi_i = bisect.bisect_left(b_inv[b_l[i]+k], i)\n# for ind in b_inv[b_l[i]+k][bi_i:]:\n# if i < ind:\n# dp[i][n+1] = max(dp[i][n+1], recur(i, ind, n+1))\n# ans = max(ans, dp[i][n+1])\n# print(dp)\nprint(dp[0][-1])", "# cook your dish here\n# import bisect\n# def recur(s_i, e_i, end_i):\n# # if end_i in dp[s_i] and e_i in dp[s_i][end_i]:\n# # return dp[s_i][end_i][e_i]\n \n# inside = 0\n# for i in range(s_i+1, e_i):\n# if b_l[i] < k:\n# if e_i not in dp[i]:\n# dp[i][e_i] = 0\n# bi_i = bisect.bisect_left(b_inv[b_l[i]+k], i)\n# for ind in b_inv[b_l[i]+k][bi_i:]:\n# if i < ind < e_i:\n# dp[i][e_i] = max(dp[i][e_i], recur(i, ind, e_i))\n# inside = max(inside, dp[i][e_i])\n# outside = 0\n# for i in range(e_i+1, min(n, end_i)):\n# if b_l[i] < k:\n# if end_i not in dp[i]:\n# dp[i][end_i] = 0\n# bi_i = bisect.bisect_left(b_inv[b_l[i]+k], i)\n# for ind in b_inv[b_l[i]+k][bi_i:]:\n# if i < ind < end_i:\n# dp[i][end_i] = max(dp[i][end_i], recur(i, ind, end_i))\n# outside = max(outside, dp[i][end_i])\n \n# # if end_i not in dp[s_i]:\n# # dp[s_i][end_i] = {}\n# # dp[s_i][end_i].update({e_i: v_l[s_i] + v_l[e_i] + outside + inside})\n# # return dp[s_i][end_i][e_i]\n# return v_l[s_i] + v_l[e_i] + outside + inside\n \nn, k1, l = map(int, input().split())\nv_l, b_l = l[:n], l[n:]\n\n# b_inv = {key:[] for key in range(2k)}\nfor i in range(n):\n b_l[i] -= 1\n # b_inv[b_l[i]].append(i)\n\ndp = [[0 for _ in range(n)] for _ in range(n)]\nfor k in range(1, n):\n for j in range(n-2, -1, -1):\n if j+k >= n:\n continue\n elif b_l[j+k]-k1 == b_l[j]:\n if j+k-1 < n:\n dp[j][j+k] = max(dp[j][j+k], v_l[j+k]+v_l[j]+dp[j+1][j+k-1])\n else:\n dp[j][j+k] = max(dp[j][j+k], v_l[j+k]+v_l[j])\n for i in range(j, j+k):\n dp[j][j+k] = max(dp[j][j+k], dp[j][i]+dp[i+1][j+k])\n \n# dp = [{} for _ in range(n)]\n# ans = 0\n# for i in range(n):\n# if b_l[i] < k:\n# if n+1 not in dp[i]:\n# dp[i][n+1] = 0\n# bi_i = bisect.bisect_left(b_inv[b_l[i]+k], i)\n# for ind in b_inv[b_l[i]+k][bi_i:]:\n# if i < ind:\n# dp[i][n+1] = max(dp[i][n+1], recur(i, ind, n+1))\n# ans = max(ans, dp[i][n+1])\n# print(dp)\nprint(dp[0][-1])", "# cook your dish here\nimport bisect\ndef recur(s_i, e_i, end_i):\n # if end_i in dp[s_i] and e_i in dp[s_i][end_i]:\n # return dp[s_i][end_i][e_i]\n \n inside = 0\n for i in range(s_i+1, e_i):\n if b_l[i] < k:\n if e_i not in dp[i]:\n dp[i][e_i] = 0\n bi_i = bisect.bisect_left(b_inv[b_l[i]+k], i)\n for ind in b_inv[b_l[i]+k][bi_i:]:\n if i < ind < e_i:\n dp[i][e_i] = max(dp[i][e_i], recur(i, ind, e_i))\n inside = max(inside, dp[i][e_i])\n outside = 0\n for i in range(e_i+1, min(n, end_i)):\n if b_l[i] < k:\n if end_i not in dp[i]:\n dp[i][end_i] = 0\n bi_i = bisect.bisect_left(b_inv[b_l[i]+k], i)\n for ind in b_inv[b_l[i]+k][bi_i:]:\n if i < ind < end_i:\n dp[i][end_i] = max(dp[i][end_i], recur(i, ind, end_i))\n outside = max(outside, dp[i][end_i])\n \n # if end_i not in dp[s_i]:\n # dp[s_i][end_i] = {}\n # dp[s_i][end_i].update({e_i: v_l[s_i] + v_l[e_i] + outside + inside})\n # return dp[s_i][end_i][e_i]\n return v_l[s_i] + v_l[e_i] + outside + inside\n \nn, k, l = map(int, input().split())\nv_l, b_l = l[:n], l[n:]\n\nb_inv = {key:[] for key in range(2k)}\nfor i in range(n):\n b_l[i] -= 1\n b_inv[b_l[i]].append(i)\n\ndp = [{} for _ in range(n)]\nans = 0\nfor i in range(n):\n if b_l[i] < k:\n if n+1 not in dp[i]:\n dp[i][n+1] = 0\n bi_i = bisect.bisect_left(b_inv[b_l[i]+k], i)\n for ind in b_inv[b_l[i]+k][bi_i:]:\n if i < ind:\n dp[i][n+1] = max(dp[i][n+1], recur(i, ind, n+1))\n ans = max(ans, dp[i][n+1])\n# print(dp)\nprint(ans)", "# cook your dish here\nimport bisect\ndef recur(s_i, e_i, end_i):\n if end_i in dp[s_i] and e_i in dp[s_i][end_i]:\n return dp[s_i][end_i][e_i]\n \n inside = 0\n for i in range(s_i+1, e_i):\n if b_l[i] < k:\n bi_i = bisect.bisect_left(b_inv[b_l[i]+k], i)\n for ind in b_inv[b_l[i]+k][bi_i:]:\n if i < ind < e_i:\n inside = max(inside, recur(i, ind, e_i))\n outside = 0\n for i in range(e_i+1, min(n, end_i)):\n if b_l[i] < k:\n bi_i = bisect.bisect_left(b_inv[b_l[i]+k], i)\n for ind in b_inv[b_l[i]+k][bi_i:]:\n if i < ind < end_i:\n outside = max(outside, recur(i, ind, end_i))\n if end_i not in dp[s_i]:\n dp[s_i][end_i] = {}\n dp[s_i][end_i].update({e_i: v_l[s_i] + v_l[e_i] + outside + inside})\n return dp[s_i][end_i][e_i]\n \nn, k, l = map(int, input().split())\nv_l, b_l = l[:n], l[n:]\n\nb_inv = {key:[] for key in range(2k)}\nfor i in range(n):\n b_l[i] -= 1\n b_inv[b_l[i]].append(i)\n\ndp = [{} for _ in range(n)]\nans = 0\nfor i in range(n):\n if b_l[i] < k:\n bi_i = bisect.bisect_left(b_inv[b_l[i]+k], i)\n for ind in b_inv[b_l[i]+k][bi_i:]:\n if i < ind:\n ans = max(ans, recur(i, ind, n+1))\n# print(dp)\nprint(ans)", "# cook your dish here\nimport bisect\ndef recur(s_i, e_i, end_i):\n inside = 0\n for i in range(s_i+1, e_i):\n if b_l[i] < k:\n bi_i = bisect.bisect_left(b_inv[b_l[i]+k], i)\n for ind in b_inv[b_l[i]+k][bi_i:]:\n if i < ind < e_i:\n dp[i][e_i] = recur(i, ind, e_i)\n inside = max(inside, dp[i][e_i])\n outside = 0\n for i in range(e_i+1, min(n, end_i)):\n if b_l[i] < k:\n bi_i = bisect.bisect_left(b_inv[b_l[i]+k], i)\n for ind in b_inv[b_l[i]+k][bi_i:]:\n if i < ind < end_i:\n dp[i][end_i] = recur(i, ind, end_i)\n outside = max(outside, dp[i][end_i])\n return v_l[s_i] + v_l[e_i] + outside + inside\n \nn, k, l = map(int, input().split())\nv_l, b_l = l[:n], l[n:]\n\nb_inv = {key:[] for key in range(2k)}\nfor i in range(n):\n b_l[i] -= 1\n b_inv[b_l[i]].append(i)\n\ndp = [{} for _ in range(n)]\nans = 0\nfor i in range(n):\n if b_l[i] < k:\n bi_i = bisect.bisect_left(b_inv[b_l[i]+k], i)\n for ind in b_inv[b_l[i]+k][bi_i:]:\n if i < ind:\n dp[i][n+1] = recur(i, ind, n+1)\n ans = max(ans, dp[i][n+1])\n# print(dp)\nprint(ans)", "# -- coding: utf-8 --\r\n\r\nimport math\r\nimport collections\r\nimport bisect\r\nimport heapq\r\nimport time\r\nimport random\r\nimport itertools\r\nimport sys\r\n\r\n\"\"\"\r\ncreated by shhuan at 2019/11/30 21:18\r\n\r\n\"\"\"\r\n\r\nL = [int(x) for x in input().split()]\r\nN = L[0]\r\nK = L[1]\r\nV = L[2: 2+N]\r\nB = L[2+N:]\r\n\r\n# N = 700\r\n# K = 7\r\n# V = [random.randint(0, 10) for _ in range(N)]\r\n# B = [random.randint(1, K2) for _ in range(N)]\r\n# N, K = 6, 3\r\n# V = [4, 5, -2, 1, 1, 6]\r\n# B = [1, 3, 4, 2, 5, 6]\r\n\r\n# t0 = time.time()\r\nbi = collections.defaultdict(list)\r\nfor i, v in enumerate(B):\r\n bi[v].append(i)\r\n\r\n\r\ndp = [[float('-inf') for _ in range(N+1)] for _ in range(N)]\r\nfor i in range(N):\r\n dp[i][1] = 0\r\n dp[i][0] = 0\r\n\r\nans = 0\r\nfor l in range(2, N+1):\r\n for s in range(N-l+1):\r\n t = s+l-1\r\n dp[s][l] = max(dp[s][l], dp[s][l-1])\r\n\r\n pres = bi[B[t]-K]\r\n pl, pr = bisect.bisect_left(pres, s), bisect.bisect_right(pres, t)\r\n for i in pres[pl: pr]:\r\n dp[s][l] = max(dp[s][l], V[i] + V[t] + dp[s][max(i-s, 0)] + dp[i+1][max(t-i-1, 0)])\r\n ans = max(ans, dp[s][l])\r\nprint(ans)\r\n", "# -- coding: utf-8 --\r\n\r\nimport math\r\nimport collections\r\nimport bisect\r\nimport heapq\r\nimport time\r\nimport random\r\nimport itertools\r\nimport sys\r\n\r\n\"\"\"\r\ncreated by shhuan at 2019/11/30 21:18\r\n\r\n\"\"\"\r\n\r\nL = [int(x) for x in input().split()]\r\nN = L[0]\r\nK = L[1]\r\nV = L[2: 2+N]\r\nB = L[2+N:]\r\n\r\n# N = 700\r\n# K = 7\r\n# V = [random.randint(0, 10) for _ in range(N)]\r\n# B = [random.randint(1, K2) for _ in range(N)]\r\n# N, K = 6, 3\r\n# V = [4, 5, -2, 1, 1, 6]\r\n# B = [1, 3, 4, 2, 5, 6]\r\n\r\n# t0 = time.time()\r\nbi = [[] for _ in range(20)]\r\nL = []\r\nfor i, v in enumerate(B):\r\n bi[v].append(i)\r\n if v <= K:\r\n L.append(i)\r\n\r\n\r\ndp = [[float('-inf') for _ in range(N+1)] for _ in range(N)]\r\nfor i in range(N):\r\n dp[i][1] = 0\r\n dp[i][0] = 0\r\n\r\nans = 0\r\nfor l in range(2, N+1):\r\n for s in range(N-l+1):\r\n t = s+l-1\r\n dp[s][l] = max(dp[s][l], dp[s][l-1])\r\n\r\n pres = bi[B[t]-K]\r\n pl, pr = bisect.bisect_left(pres, s), bisect.bisect_right(pres, t)\r\n for i in pres[pl: pr]:\r\n dp[s][l] = max(dp[s][l], V[i] + V[t] + dp[s][max(i-s, 0)] + dp[i+1][max(t-i-1, 0)])\r\n ans = max(ans, dp[s][l])\r\nprint(ans)\r\n", "# -- coding: utf-8 --\r\n\r\nimport math\r\nimport collections\r\nimport bisect\r\nimport heapq\r\nimport time\r\nimport random\r\nimport itertools\r\nimport sys\r\n\r\n\"\"\"\r\ncreated by shhuan at 2019/11/30 21:18\r\n\r\n\"\"\"\r\n\r\nL = [int(x) for x in input().split()]\r\nN = L[0]\r\nK = L[1]\r\nV = L[2: 2+N]\r\nB = L[2+N:]\r\n\r\n# N = 700\r\n# K = 7\r\n# V = [random.randint(0, 10) for _ in range(N)]\r\n# B = [random.randint(1, K2) for _ in range(N)]\r\n# N, K = 6, 3\r\n# V = [4, 5, -2, 1, 1, 6]\r\n# B = [1, 3, 4, 2, 5, 6]\r\n\r\n# t0 = time.time()\r\nbi = [[] for _ in range(20)]\r\nL = []\r\nfor i, v in enumerate(B):\r\n bi[v].append(i)\r\n if v <= K:\r\n L.append(i)\r\n\r\n\r\ndp = [[float('-inf') for _ in range(N+1)] for _ in range(N)]\r\nfor i in range(N):\r\n dp[i][1] = 0\r\n dp[i][0] = 0\r\n\r\nans = 0\r\nfor l in range(2, N+1):\r\n for s in range(N-l+1):\r\n t = s+l-1\r\n dp[s][l] = max(dp[s][l], dp[s][l-1])\r\n for i in range(s, t+1):\r\n if B[i] + K == B[t]:\r\n dp[s][l] = max(dp[s][l], V[i] + V[t] + dp[s][max(i-s, 0)] + dp[i+1][max(t-i-1, 0)])\r\n ans = max(ans, dp[s][l])\r\nprint(ans)\r\n", "# -- coding: utf-8 --\r\n\r\nimport math\r\nimport collections\r\nimport bisect\r\nimport heapq\r\nimport time\r\nimport random\r\nimport itertools\r\nimport sys\r\n\r\n\"\"\"\r\ncreated by shhuan at 2019/11/30 21:18\r\n\r\n\"\"\"\r\n\r\nL = [int(x) for x in input().split()]\r\n\r\nN = L[0]\r\nK = L[1]\r\nV = L[2: 2+N]\r\nB = L[2+N:]\r\n\r\n\r\nbi = collections.defaultdict(list)\r\nfor i, v in enumerate(B):\r\n bi[v].append(i)\r\n\r\n\r\nmemo = {}\r\n\r\n\r\ndef dfs(l, r):\r\n if l >= r:\r\n return 0\r\n\r\n k = (l, r)\r\n if k in memo:\r\n return memo[k]\r\n\r\n ans = 0\r\n for i in range(l, r):\r\n br = bi[B[i]+K]\r\n jl, jr = bisect.bisect_left(br, i), bisect.bisect_right(br, r)\r\n for j in br[jl: jr]:\r\n if i < j <= r:\r\n ans = max(ans, V[i]+V[j] + dfs(i+1, j-1) + dfs(j+1, r))\r\n memo[k] = ans\r\n\r\n return ans\r\n\r\n\r\nprint(dfs(0, N-1))", "# -- coding: utf-8 --\r\n\r\nimport math\r\nimport collections\r\nimport bisect\r\nimport heapq\r\nimport time\r\nimport random\r\nimport itertools\r\nimport sys\r\n\r\n\"\"\"\r\ncreated by shhuan at 2019/11/30 21:18\r\n\r\n\"\"\"\r\n\r\nL = [int(x) for x in input().split()]\r\n\r\nN = L[0]\r\nK = L[1]\r\nV = L[2: 2+N]\r\nB = L[2+N:]\r\n\r\n\r\nbi = collections.defaultdict(list)\r\nfor i, v in enumerate(B):\r\n bi[v].append(i)\r\n\r\n\r\nmemo = {}\r\n\r\n\r\ndef dfs(l, r):\r\n if l >= r:\r\n return 0\r\n\r\n k = (l, r)\r\n if k in memo:\r\n return memo[k]\r\n\r\n ans = 0\r\n for i in range(l, r):\r\n for j in bi[B[i]+K]:\r\n if i < j <= r:\r\n ans = max(ans, V[i]+V[j] + dfs(i+1, j-1) + dfs(j+1, r))\r\n memo[k] = ans\r\n\r\n return ans\r\n\r\n\r\nprint(dfs(0, N-1))", "# cook your dish here\ninpu=list(map(int,input().split()))\nn,k=inpu[0],inpu[1]\nv=inpu[2:n+2]\nb=inpu[n+2:2n+2]\nbrac={i:set() for i in range(n)}\nfor i in range(n):\n for j in range(i+1,n):\n if b[j]-b[i]==k:\n brac[i].add(j)\n \ndp=[[0 for i in range(n)] for j in range(n)]\nfor j in range(1,n):\n for i in range(n-j):\n ans=-float(\"inf\")\n if i+j in brac[i]:\n if j==1:\n ans=max(ans,v[i+j]+v[i])\n else:\n ans=max(ans,v[i+j]+v[i]+dp[i+1][i+j-1])\n for l in brac[i]:\n if l>=i+j:\n continue\n if b[l]-b[i]==k:\n if l==i+1:\n ans=max(ans,v[l]+v[i]+dp[l+1][i+j])\n else:\n ans=max(ans,v[l]+v[i]+dp[l+1][i+j]+dp[i+1][l-1])\n ans=max(ans,dp[i+1][i+j])\n dp[i][i+j]=ans\nprint(dp[0][n-1])\n", "# cook your dish here\ninpu=list(map(int,input().split()))\nn,k=inpu[0],inpu[1]\nv=inpu[2:n+2]\nb=inpu[n+2:2n+2]\ndp=[[0 for i in range(n)] for j in range(n)]\nfor j in range(1,n):\n for i in range(n-j):\n ans=-float(\"inf\")\n if b[i+j]-b[i]==k:\n if j==1:\n ans=max(ans,v[i+j]+v[i])\n else:\n ans=max(ans,v[i+j]+v[i]+dp[i+1][i+j-1])\n for l in range(i+1,i+j):\n if b[l]-b[i]==k:\n if l==i+1:\n ans=max(ans,v[l]+v[i]+dp[l+1][i+j])\n else:\n ans=max(ans,v[l]+v[i]+dp[l+1][i+j]+dp[i+1][l-1])\n ans=max(ans,dp[i+1][i+j])\n dp[i][i+j]=ans\nprint(dp[0][n-1])\n\n", "# cook your dish here\ninpu=list(map(int,input().split()))\nn,k=inpu[0],inpu[1]\nv=inpu[2:n+2]\nb=inpu[n+2:2n+2]\ndp=[[0 for i in range(n)] for j in range(n)]\nfor j in range(1,n):\n for i in range(n-j):\n ans=-float(\"inf\")\n if b[i+j]-b[i]==k:\n if j==1:\n ans=max(ans,v[i+j]+v[i])\n else:\n ans=max(ans,v[i+j]+v[i]+dp[i+1][i+j-1])\n for l in range(i+1,i+j):\n if b[l]-b[i]==k:\n if l==i+1:\n ans=max(ans,v[l]+v[i]+dp[l+1][i+j])\n else:\n ans=max(ans,v[l]+v[i]+dp[l+1][i+j]+dp[i+1][l-1])\n ans=max(ans,dp[i+1][i+j])\n dp[i][i+j]=ans\nprint(dp[0][n-1])\n", "inpu=list(map(int,input().split()))\r\nn,k=inpu[0],inpu[1]\r\nv=inpu[2:n+2]\r\nb=inpu[n+2:2n+2]\r\nbrac={i:set() for i in range(n)}\r\nfor i in range(n):\r\n for j in range(i+1,n):\r\n if b[j]-b[i]==k:\r\n brac[i].add(j)\r\n \r\ndp=[[0 for i in range(n)] for j in range(n)]\r\nfor j in range(1,n):\r\n for i in range(n-j):\r\n ans=-float(\"inf\")\r\n if i+j in brac[i]:\r\n if j==1:\r\n ans=max(ans,v[i+j]+v[i])\r\n else:\r\n ans=max(ans,v[i+j]+v[i]+dp[i+1][i+j-1])\r\n for l in brac[i]:\r\n if l>=i+j:\r\n continue\r\n if b[l]-b[i]==k:\r\n if l==i+1:\r\n ans=max(ans,v[l]+v[i]+dp[l+1][i+j])\r\n else:\r\n ans=max(ans,v[l]+v[i]+dp[l+1][i+j]+dp[i+1][l-1])\r\n ans=max(ans,dp[i+1][i+j])\r\n dp[i][i+j]=ans\r\nprint(dp[0][n-1])\r\n", "inpu=list(map(int,input().split()))\r\nn,k=inpu[0],inpu[1]\r\nv=inpu[2:n+2]\r\nb=inpu[n+2:2*n+2]\r\ndp=[[0 for i in range(n)] for j in range(n)]\r\nfor j in range(1,n):\r\n for i in range(n-j):\r\n ans=-float(\"inf\")\r\n if b[i+j]-b[i]==k:\r\n if j==1:\r\n ans=max(ans,v[i+j]+v[i])\r\n else:\r\n ans=max(ans,v[i+j]+v[i]+dp[i+1][i+j-1])\r\n for l in range(i+1,i+j):\r\n if b[l]-b[i]==k:\r\n if l==i+1:\r\n ans=max(ans,v[l]+v[i]+dp[l+1][i+j])\r\n else:\r\n ans=max(ans,v[l]+v[i]+dp[l+1][i+j]+dp[i+1][l-1])\r\n ans=max(ans,dp[i+1][i+j])\r\n dp[i][i+j]=ans\r\nprint(dp[0][n-1])\r\n"]	{"inputs": [["6 3 4 5 -2 1 1 6 1 3 4 2 5 6"]], "outputs": [["13"]]}	INTERVIEW	PYTHON3	CODECHEF	31,739
088c6f856fd7cd6d13ccea67ae630919	UNKNOWN	Write a program that takes in a letterclass ID of a ship and display the equivalent string class description of the given ID. Use the table below. Class ID Ship ClassB or bBattleShipC or cCruiserD or dDestroyerF or fFrigate -----Input----- The first line contains an integer T, the total number of testcases. Then T lines follow, each line contains a character. -----Output----- For each test case, display the Ship Class depending on ID, in a new line. -----Constraints----- - 1 ≤ T ≤ 1000 -----Example----- Input 3 B c D Output BattleShip Cruiser Destroyer	["# cook your dish here\nt=int(input())\nfor i in range(t):\n n=input()\n if(n=='b' or n=='B'):\n print('BattleShip')\n elif(n=='c' or n=='C'):\n print('Cruiser')\n elif(n=='d' or n=='D'):\n print('Destroyer')\n else:\n print('Frigate')", "for _ in range(int(input())):\n p=input()\n if(p=='B' or p=='b'):\n print('BattleShip')\n elif(p=='C' or p=='c'):\n print('Cruiser')\n elif(p=='D' or p=='d'):\n print('Destroyer')\n elif(p=='F' or p=='f'):\n print('Frigate')\n", "# cook your dish here\nx=int(input())\nfor i in range(x):\n y=input()\n y=y.lower()\n if(y==\"b\"):\n print(\"BattleShip\")\n if(y==\"c\"):\n print(\"Cruiser\")\n if(y==\"d\"):\n print(\"Destroyer\")\n if(y==\"f\"):\n print(\"Frigate\")\n", "# cook your dish here\nT=int(input())\nfor i in range(T):\n n=input()\n if n==\"B\" or n==\"b\":\n print(\"BattleShip\")\n if n == \"C\" or n == \"c\":\n print(\"Cruiser\")\n if n == \"D\" or n == \"d\":\n print(\"Destroyer\")\n if n == \"F\" or n == \"f\":\n print(\"Frigate\")\n", "# cook your dish here\nn=int(input())\nd={\"B\":\"BattleShip\",\n\"C\" :\t\"Cruiser\",\n\"D\" : \t\"Destroyer\",\n\"F\" : \t\"Frigate\"}\nfor i in range(n):\n m=input().upper()\n print(d[m])\n", "t=int(input())\r\nfor i in range(0,t):\r\n ch=input()\r\n if ch=='b' or ch=='B':\r\n \tprint(\"BattleShip\\n\")\r\n elif ch=='c' or ch=='C':\r\n print(\"Cruiser\\n\")\r\n elif ch=='D' or ch=='d':\r\n print(\"Destroyer\\n\")\r\n elif ch=='F' or ch=='f':\r\n print(\"Frigate\\n\")", "t=int(input())\r\nfor i in range(0,t):\r\n ch=input()\r\n if ch=='b' or ch=='B':\r\n \tprint(\"BattleShip\\n\")\r\n elif ch=='c' or ch=='C':\r\n print(\"Cruiser\\n\")\r\n elif ch=='D' or ch=='d':\r\n print(\"Destroyer\\n\")\r\n elif ch=='F' or ch=='f':\r\n print(\"Frigate\\n\")", "# cook your dish here\nt=int(input())\nfor i in range(0,t):\n ch=input()\n if ch=='b' or ch=='B':\n print(\"BattleShip\\n\")\n elif ch=='c' or ch=='C':\n print(\"Cruiser\\n\") \n elif ch=='d' or ch=='D':\n print(\"Destroyer\\n\") \n elif ch=='f' or ch=='F':\n print(\"Frigate\\n\") ", "t=int(input())\nfor i in range(0,t):\n ch=input()\n if ch=='b' or ch=='B':\n print(\"BattleShip\\n\")\n elif ch=='c' or ch=='C':\n print(\"Cruiser\\n\") \n elif ch=='d' or ch=='D':\n print(\"Destroyer\\n\") \n elif ch=='f' or ch=='F':\n print(\"Frigate\\n\") # cook your dish here\n", "# cook your dish here\nt=int(input())\nfor i in range(t):\n id=input()\n if id==\"B\" or id==\"b\":\n print(\"BattleShip\")\n if id==\"C\" or id==\"c\":\n print(\"Cruiser\")\n if id==\"D\" or id==\"d\":\n print(\"Destroyer\")\n if id==\"F\" or id==\"f\":\n print(\"Frigate\")\n", "# cook your dish here\nn=int(input())\nfor i in range(n):\n x=input()\n if x==\"b\" or x==\"B\":\n print(\"BattleShip\")\n elif x==\"c\" or x==\"C\":\n print(\"Cruiser\")\n elif x==\"d\" or x==\"D\":\n print(\"Destroyer\")\n else:\n print(\"Frigate\")", "test_case = int(input())\n\nwhile test_case > 0:\n val = input()\n val = val.lower()\n if val == 'b':\n print(\"BattleShip\")\n elif val == 'c':\n print('Cruiser')\n elif val == 'd':\n print('Destroyer')\n elif val == 'f':\n print(\"Frigate\")\n test_case -= 1\n", "t=int(input())\nfor i in range(t):\n x=input()\n if(x=='B' or x=='b'):\n print(\"BattleShip\")\n elif (x=='C' or x=='c'):\n print(\"Cruiser\")\n elif (x=='D' or x=='d'):\n print(\"Destroyer\")\n elif (x=='F' or x=='f'):\n print(\"Frigate\")", "t=int(input())\na={'B':\"BattleShip\",'C':\"Cruiser\",'D':\"Destroyer\",'F':\"Frigate\",'b':\"BattleShip\",'c':\"Cruiser\",'d':\"Destroyer\",'f':\"Frigate\"}\nfor i in range(t):\n key=input()\n print(a[key])\n", "t=int(input())\r\ni=0\r\nwhile i<t:\r\n\tn=input()\r\n\tif n=='b' or n=='B':\r\n\t\tprint(\"BattleShip\")\r\n\tif n=='c' or n=='C':\r\n\t\tprint(\"Cruiser\")\r\n\tif n=='d' or n=='D':\r\n\t\tprint(\"Destroyer\")\r\n\tif n=='f' or n=='F':\r\n\t\tprint(\"Frigate\")\r\n\ti+=1", "# cook your dish he\nfor i in range(int(input())):\n s=input()\n if s==\"B\" or s==\"b\":\n print(\"BattleShip\")\n if s==\"C\" or s==\"c\":\n print(\"Cruiser\")\n if s==\"D\" or s==\"d\":\n print(\"Destroyer\")\n if s==\"F\" or s==\"f\":\n print(\"Frigate\")", "t = int(input())\n\nfor i in range(t):\n num = (input())\n if (num == \"B\" or num == \"b\"):\n print(\"BattleShip\")\n elif (num == \"C\" or num == \"c\"):\n print(\"Cruiser\")\n elif (num == \"D\" or num == \"d\"):\n print(\"Destroyer\")\n elif (num == \"F\" or num == \"f\" ):\n print(\"Frigate\") \n\n", "# cook your dish here\nt = int(input())\n\nfor i in range(t):\n num = (input())\n if (num == \"B\" or num == \"b\"):\n print(\"BattleShip\")\n elif (num == \"C\" or num == \"c\"):\n print(\"Cruiser\")\n elif (num == \"D\" or num == \"d\"):\n print(\"Destroyer\")\n elif (num == \"F\" or num == \"f\" ):\n print(\"Frigate\") \n", "# cook your dish here\nd={'b':\"BattleShip\",'B':\"BattleShip\",'c':\"Cruiser\",'C':\"Cruiser\",'d':\"Destroyer\",\"D\":\"Destroyer\",'f':\"Frigate\",'F':\"Frigate\"}\nt=int(input())\nfor i in range(t):\n a=input()\n print(d[a])", "# cook your dish here\nt=int(input())\nfor i in range(t):\n n=input()\n if(n=='B'or n=='b'):\n print(\"BattleShip\")\n elif (n==\"C\" or n==\"c\"):\n print(\"Cruiser\")\n elif (n==\"D\" or n==\"d\"):\n print(\"Destroyer\")\n else:\n print(\"Frigate\")\n", "dec= {\"b\":\"BattleShip\",\"c\":\"Cruiser\",\"d\":\"Destroyer\",\"f\":\"Frigate\"}\nfor _ in range(int(input())):\n word = input().lower()\n print(dec[word])", "# cook your dish here\ndec= {\"B\":\"BattleShip\",\"C\":\"Cruiser\",\"D\":\"Destroyer\",\"F\":\"Frigate\",\"b\":\"BattleShip\",\"c\":\"Cruiser\",\"d\":\"Destroyer\",\"f\":\"Frigate\"}\nT = int(input())\nfor i in range(T):\n word = input()\n print(dec[word])", "# cook your dish here\nfor _ in range(int(input())):\n d={'b':'BattleShip','c':'Cruiser','d':'Destroyer','f':'Frigate'}\n a=input().lower()\n print(d[a])", "T =int(input())\nfor i in range(0,T) :\n Ch=str(input())\n if Ch=='B'or Ch=='b':\n print(\"BattleShip\")\n if Ch=='C'or Ch=='c':\n print(\"Cruiser\")\n if Ch=='D'or Ch=='d':\n print(\"Destroyer\")\n if Ch=='F'or Ch=='f':\n print(\"Frigate\")", "# cook your dish here\nfor i in range(int(input())):\n ele=input()\n if(ele=='B' or ele=='b'):\n print('BattleShip')\n elif(ele=='C' or ele=='c'):\n print('Cruiser')\n elif(ele=='D' or ele=='d'):\n print('Destroyer')\n else:\n print('Frigate')"]	{"inputs": [["3", "B", "c", "D"]], "outputs": [["BattleShip", "Cruiser", "Destroyer"]]}	INTERVIEW	PYTHON3	CODECHEF	7,161
345904291e0f2f68608866e1b22ec387	UNKNOWN	Nature photographing may be fun for tourists, but it is one of the most complicated things for photographers. To capture all the facets of a bird, you might need more than one cameras. You recently encountered such a situation. There are $n$ photographers, so there are $n$ cameras in a line on the x-axis. All the cameras are at distinct coordinates. You want to pair up these cameras ($n$ is even) in such a way that the sum of angles subtended on the bird by the pair of cameras is maximized. Formally, let A, B be two cameras, and let P be the bird to be captured by these two cameras. The angle will APB. Note: All angles are in radians. -----Input----- - The first line of the input contains an integer $T$ denoting the number of test cases. The description of the test cases follows. - The first line of each test case contains an integer $n$. - The second line of each test case contains $n$ space-separated integers denoting the $x_i$ coordinates of the cameras. - The third line of each test case contains two space-separated integers $P, Q$ denoting the x and y coordinates of the bird respectively. -----Output----- For each test case, output your answer in a single line. Your answer would be considered correct if its absolute error is less than or equal to 1e-6 of the actual answer. -----Constraints----- - $1 \le T \le 10$ - $2 \le n \leq 100$ - $1 \le x_i \leq 300$ - $0 \le P \leq 300$ - $1 \le Q \leq 300$ -----Example Input----- 2 2 0 1 0 1 2 0 1 100 1 -----Example Output----- 0.785398163397 0.000100999899 -----Explanation----- Note: $1 \leq x_i$ is not being satisfied by the sample input, but will be satisfied in the actual test data. Testcase 1: There are only 2 cameras, so they have to paired up with each other. And the angle subtended by then is 45 degrees. Converting this to radians gives the output.	["from math import \r\nfrom collections import \r\nimport sys\r\ninput=sys.stdin.readline\r\nt=int(input())\r\nwhile(t):\r\n t-=1\r\n n=int(input())\r\n a=list(map(int,input().split()))\r\n p,q=map(int,input().split())\r\n s=0\r\n a.sort()\r\n for i in range(n//2):\r\n x=a[i]\r\n x1=a[n-i-1]\r\n if(x==p or x1==p):\r\n s1=abs(x-x1)\r\n s2=q\r\n s+=abs(atan2(s1,s2))\r\n elif(x<p and x1>p):\r\n s1=abs(p-x)\r\n ex=atan2(s1,q)\r\n s1=abs(p-x1)\r\n ex1=atan2(s1,q)\r\n ex+=ex1\r\n s+=abs(ex)\r\n else:\r\n if(p<x):\r\n s1=abs(p-x)\r\n ex=atan2(s1,q)\r\n s1=abs(p-x1)\r\n ex1=atan2(s1,q)\r\n ex=ex1-ex\r\n s+=abs(ex)\r\n else:\r\n s1=abs(p-x)\r\n ex=atan2(s1,q)\r\n s1=abs(p-x1)\r\n ex1=atan2(s1,q)\r\n ex=ex-ex1\r\n s+=abs(ex) \r\n print(s)\r\n", "from math import \r\nfrom collections import \r\nimport sys\r\ninput=sys.stdin.readline\r\nt=int(input())\r\nwhile(t):\r\n t-=1\r\n n=int(input())\r\n a=list(map(int,input().split()))\r\n p,q=map(int,input().split())\r\n s=0\r\n a.sort()\r\n for i in range(n//2):\r\n x=a[i]\r\n x1=a[n-i-1]\r\n if(x==p or x1==p):\r\n s1=abs(x-x1)\r\n s2=q\r\n s+=abs(atan2(s1,s2))\r\n elif(x<p and x1>p):\r\n s1=abs(p-x)\r\n ex=atan2(s1,q)\r\n s1=abs(p-x1)\r\n ex1=atan2(s1,q)\r\n ex+=ex1\r\n s+=abs(ex)\r\n else:\r\n if(p<x):\r\n s1=abs(p-x)\r\n ex=atan2(s1,q)\r\n s1=abs(p-x1)\r\n ex1=atan2(s1,q)\r\n ex=ex1-ex\r\n s+=abs(ex)\r\n else:\r\n s1=abs(p-x)\r\n ex=atan2(s1,q)\r\n s1=abs(p-x1)\r\n ex1=atan2(s1,q)\r\n ex=ex-ex1\r\n s+=abs(ex) \r\n print(s)\r\n", "# f = open(\"file.txt\", 'r+')\n# inp = f.readline\ninp = input\nimport math\n\n\nfor _ in range( int(input()) ):\n \n n = int(input())\n arr = list(map(int , input().split()))\n p,q = map(int , input().split())\n \n ans = 0\n arr.sort()\n \n for i in range(n//2):\n \n \n mn , mx = arr[i] , arr[n-i-1]\n \n if(mx == p) or (mn == p):\n # print(\"Case 1\")\n adj = q\n opp = mx-mn\n val = math.atan2(opp, adj)\n elif(mn < p) and (mx > p):\n # print(\"Case 2\")\n adj = q\n opp = p - mn\n valA = math.atan2(opp, adj)\n \n opp = mx - p\n valB = math.atan2(opp, adj)\n \n val = valA + valB\n else:\n # print(\"Case 3\")\n if(p < mn): \n adj = abs(mx - p)\n opp = q\n valA = math.atan2(opp, adj)\n \n adj = abs(mn - p)\n valB = math.atan2(opp, adj)\n \n val = valA - valB\n else:\n adj = abs(p - mn)\n opp = q\n valA = math.atan2(opp, adj)\n \n adj = abs(p-mx)\n valB = math.atan2(opp, adj)\n \n val = valA - valB\n val = abs(val)\n \n ans += val\n# val = print('%.2f'%val)\n print('%.12f'%ans)\n ", "import math\r\ndef ar(a,b,c):\r\n s=(a+b+c)/2\r\n return math.sqrt((s(s-a)(s-b)(s-c)))\r\ndef dist(x1,y1,x2,y2):\r\n\treturn math.sqrt((y2-y1)2 + (x2-x1)2)\r\ndef return_angle(a,b,c):\r\n\treturn math.acos((a2+b2-c2)/(2ab))\r\nfrom math import asin\r\nt=int(input())\r\nfor _ in range(t):\r\n n=int(input())\r\n it=list(map(int,input().split()))\r\n x,y=map(int,input().split())\r\n it.sort()\r\n tot=0\r\n vis=[0]n\r\n pp=[]\r\n for i in range(n):\r\n for j in range(i+1,n):\r\n a=it[i]\r\n b=it[j]\r\n d=abs(a-b)\r\n d1=dist(a,0,x,y)\r\n d2=dist(b,0,x,y)\r\n ans=return_angle(d1,d2,d)\r\n # r=(d1d2d)/(4ar(d1,d2,d))\r\n # ans=asin(d/(2r))\r\n ans=abs(ans)\r\n pp.append([ans,i,j])\r\n pp.sort(reverse=True)\r\n for i in pp:\r\n if vis[i[1]] or vis[i[2]]:\r\n continue\r\n tot+=i[0]\r\n vis[i[2]]=1\r\n vis[i[1]]=1\r\n print(tot)\r\n", "import math\r\n\r\ndef calLen(cam1, cam2, bird):\r\n a = math.sqrt((cam1[0]-bird[0])2 + (cam1[1]-bird[1])2)\r\n b = math.sqrt((cam2[0]-bird[0])2 + (cam2[1]-bird[1])2)\r\n c = math.sqrt((cam1[0]-cam2[0])2 + (cam1[1]-cam2[1])2)\r\n\r\n return a,b,c\r\n\r\nfor h in range(int(input())):\r\n n = int(input())\r\n cams = list(map(lambda x: [int(x), 0], input().strip().split()))\r\n bird = list(map(int, input().strip().split()))\r\n cams.sort(key = lambda x:x[0])\r\n\r\n ans = 0\r\n for i in range(n//2):\r\n cam1 = cams[i]\r\n cam2 = cams[n-1-i]\r\n\r\n a, b, c = calLen(cam1, cam2, bird)\r\n ans += math.acos((a2 + b2 - c*2)/(2ab))\r\n print(ans)", "import math\r\n\r\ndef calLen(cam1, cam2, bird):\r\n a = math.sqrt((cam1[0]-bird[0])2 + (cam1[1]-bird[1])2)\r\n b = math.sqrt((cam2[0]-bird[0])2 + (cam2[1]-bird[1])2)\r\n c = math.sqrt((cam1[0]-cam2[0])2 + (cam1[1]-cam2[1])2)\r\n\r\n return a,b,c\r\n\r\ndef calculateAngle(a,b,c):\r\n return math.acos((a2 + b2 - c2)/(2ab))\r\n\r\n# def best_angle()\r\n\r\n# def brute(n,cams,bird):\r\n # angles = []\r\n # for i in range(n):\r\n # temp = [0]n\r\n # angles.append(temp)\r\n # for j in range(i+1,n):\r\n # a,b,c = calLen(cams[i],cams[j],bird)\r\n # angles[i][j] = (calculateAngle(a,b,c))\r\n # print(angles) \r\n # ans = 0\r\n # for i in range(n):\r\n \r\n # while \r\n\r\ndef angle2(cam1, cam2, bird):\r\n a, b, c = calLen(cam1, cam2, bird)\r\n return math.acos((a2 + b2 - c*2)/(2ab))\r\n\r\ndef backtrack(s, vertices, order):\r\n global res\r\n\r\n flag9 = 0\r\n for a in range(0, len(vertices)):\r\n if vertices[a] != 0:\r\n flag9 = 1\r\n break\r\n if flag9==0:\r\n # if s > res:\r\n\r\n # print(order)\r\n res = max(s, res)\r\n return\r\n for a in range(0, len(vertices)):\r\n for b in range(0, len(vertices)):\r\n if vertices[a] and vertices[b]:\r\n n1 = vertices[a]\r\n n2 = vertices[b]\r\n vertices[a] = 0\r\n vertices[b] = 0\r\n backtrack(s + angle2(n1, n2, bird), vertices,order + [vertices[a],vertices[b]] )\r\n vertices[a] = n1\r\n vertices[b] = n2\r\n\r\nfrom random import randint\r\n\r\nfor h in range(int(input())):\r\n n = int(input())\r\n cams = list(map(lambda x: (int(x), 0), input().strip().split())) \r\n # cams = [(randint(1,33),0) for a in range(0, n)]\r\n cams1 = [i for i in cams]\r\n # print(cams,cams1)\r\n bird = list(map(int, input().strip().split()))\r\n # bird = [randint(0,33),randint(1,33)]\r\n\r\n # brute(n,cams,bird)\r\n\r\n ans = 0\r\n i = 0\r\n i2 = [0,0]\r\n i4 = [0,0]\r\n\r\n while set(cams1) != {0}:\r\n\r\n # print(set(cams1) )\r\n i = 0\r\n # i2 = [0,0]\r\n for a in range(0, len(cams1)):\r\n for b in range(a+1, len(cams1)):\r\n if cams1[a] and cams1[b]:\r\n if abs( cams1[a][0] - cams1[b][0]) >= i:\r\n i = abs( cams1[a][0] - cams1[b][0])\r\n i2 = [cams1[a], cams1[b ]]\r\n i4=[a, b]\r\n # print(i2)\r\n ans += angle2(i2[0],i2[1], bird)\r\n cams1[i4[0]] = 0\r\n cams1[i4[1 ]] = 0\r\n print(ans)\r\n\r\n res = 0\r\n # backtrack(0,cams,[])\r\n # print(res)\r\n\r\n\r\n", "import math\nfor _ in range(int(input())):\n n = int(input())\n ar = list(map(int, input().split()))\n ar.sort()\n ans = 0\n p, q = map(int, input().split())\n for i in range(n//2):\n a = ar[i]\n b = ar[-(i+1)]\n t1 = math.atan((p-a)/q)\n t2 = math.atan((b-p)/q)\n ans += (t1+t2)\n print(ans)", "import math\r\nfor _ in range(int(input())):\r\n n = int(input())\r\n ar = list(map(int, input().split()))\r\n ar.sort()\r\n ans = 0\r\n p, q = map(int, input().split())\r\n for i in range(n//2):\r\n a = ar[i]\r\n b = ar[-(i+1)]\r\n t1 = math.atan((p-a)/q)\r\n t2 = math.atan((b-p)/q)\r\n ans += (t1+t2)\r\n print(ans)\r\n", "t=int(input())\r\nimport math\r\nfor i in range(t):\r\n n=int(input())\r\n l=list(map(int,input().split()))\r\n l.sort()\r\n p,q=map(int,input().split())\r\n i=0\r\n j=-1\r\n c=0\r\n while True:\r\n if l[i]>l[j]:\r\n break\r\n a=math.sqrt((p-l[i])2+q2)\r\n b=abs(l[i]-l[j])\r\n d=math.sqrt((p-l[j])2+q2)\r\n e=a2+d2-b2\r\n e/=2ad\r\n e=math.acos(e)\r\n round(e,6)\r\n c+=e\r\n \r\n i+=1\r\n j-=1\r\n round(c,6)\r\n print(c)\r\n \r\n \r\n", "from math import \r\nt = int(input())\r\nfor _ in range(t):\r\n n = int(input())\r\n l = list(map(int,input().split()))\r\n l.sort()\r\n x,y = map(int,input().split())\r\n ans = 0\r\n for i in range(n//2):\r\n a = l[i]\r\n b = l[i+n//2]\r\n theta1 = (b-x)/y\r\n theta2 = (a-x)/y\r\n theta1 = atan(theta1)\r\n theta2 = atan(theta2)\r\n ans += (theta1-theta2)\r\n print(abs(ans)) \r\n \r\n", "from math import \r\nt = int(input())\r\nfor _ in range(t):\r\n n = int(input())\r\n l = list(map(int,input().split()))\r\n l.sort()\r\n x,y = map(int,input().split())\r\n ans = 0\r\n for i in range(n//2):\r\n a = l[i]\r\n b = l[n-i-1]\r\n theta1 = (b-x)/y\r\n theta2 = (a-x)/y\r\n theta1 = atan(theta1)\r\n theta2 = atan(theta2)\r\n ans += (theta1-theta2)\r\n print(abs(ans)) \r\n \r\n", "from math import atan\r\nt = int(input())\r\ndef f(a,b,x,y):\r\n m = (b-x)/y\r\n n = (a-x)/y\r\n return atan(m)-atan(n);\r\nfor i in range(t):\r\n n = int(input())\r\n a = list(map(int,input().split()))\r\n a.sort()\r\n p,q = map(int,input().split())\r\n k = n//2\r\n s = 0\r\n for j in range(k):\r\n s = s+f(a[j],a[n-1-j],p,q)\r\n if s<0:\r\n s = -s\r\n print(s)\r\n", "from math import \r\n\r\n\r\nfor t in range(int(input())):\r\n\tn = int(input())\r\n\tarr = list(map(int, input().split()))\r\n\tl = list(map(int, input().split()))\r\n\tarr.sort()\r\n\tx = l[0]\r\n\ty = l[1]\r\n\tans = 0\r\n\tfor i in range(int(n/2)):\r\n\t\tx1 = arr[i]\r\n\t\tx2 = arr[n-i-1]\r\n\t\tif x1 < x and x2 <= x:\r\n\t\t\tangle = atan((x-x1)/y) - atan((x-x2)/y)\r\n\t\telif x1 < x and x2 > x:\r\n\t\t\tangle = atan((x-x1)/y) + atan((x2-x)/y)\r\n\t\telse:\r\n\t\t\tangle = atan((x2-x)/y) - atan((x1-x)/y)\r\n\t\tans += angle\r\n\tprint(ans)\r\n", "from math import atan\r\ndef f(a,b,x,y):\r\n m=(a-x)/y\r\n n=(b-x)/y\r\n return atan(m)-atan(n)\r\nfor i in range(int(input())):\r\n c=int(input())\r\n b=list(map(int,input().split()))\r\n b.sort()\r\n x,y=map(int,input().split())\r\n s=0\r\n k=c//2\r\n for i in range(k):\r\n s += f(b[i],b[c-1-i],x,y)\r\n if s < 0:\r\n s = -s\r\n print(s)", "import math\r\nT=int(input())\r\nfor i in range(T):\r\n n=int(input())\r\n A=[int(k) for k in input().split()]\r\n A.sort()\r\n P,Q=[int(j) for j in input().split()]\r\n def angle(x1,x2,x,y):\r\n y=math.atan((x2-x)/y) + math.atan((x-x1)/y)\r\n return y\r\n c=0\r\n for i in range(n//2):\r\n c=c+angle(A[i],A[n-i-1],P,Q)\r\n\r\n print(c) \r\n\r\n\r\n", "import math\r\nfor _ in range(int(input())):\r\n n=int(input())\r\n arr=list(map(int,input().split()))\r\n p,q=map(int,input().split())\r\n k=[]\r\n for i in range(n):\r\n if p==arr[i]:\r\n k.append(0)\r\n else:\r\n k.append(math.atan((p-arr[i])/q))\r\n k=sorted(k) \r\n print(round(abs(sum(k[:n//2])-sum(k[n//2:])),12))\r\n", "import math\nfor i in range(int(input())):\n\tn=int(input())\n\ttmp=input().split()\n\tarr=[]\n\tfor j in tmp:\n\t\tarr.append(int(j))\n\ttmp=input().split()\n\tx=int(tmp[0])\n\ty=int(tmp[1])\n\ts=0\n\tarr.sort()\n\tfor j in range(int(n/2)):\n\t\td1=(arr[j]-x)2+y2\n\t\td2=(arr[n-j-1]-x)2+y2\n\t\td3=(arr[n-1-j]-arr[j])*2\n\t\ts+=math.acos((d1+d2-d3)/(2math.sqrt(d1)math.sqrt(d2)))\n\tprint('{0:0.12}'.format(s))", "import math\r\nfor _ in range(int(input())):\r\n n = int(input())\r\n cameras = list(map(int,input().split()))\r\n p,q = map(int,input().split())\r\n cameras.sort()\r\n sumA = 0\r\n # radians c2 = a2 + b2 -2ac(Cos(degree))\r\n for i in range(n//2):\r\n p1 = cameras[i]\r\n p2 = cameras[n-1-i]\r\n p12 = p2-p1\r\n # print(p1,p2)\r\n sideA = math.sqrt((p-p1)2 + q2)\r\n sideB = math.sqrt((p-p2)2 + q2)\r\n # print('sideA:',sideA,'sideB:',sideB)\r\n radians = math.acos(((p122)-sideA2 - sideB2 )/(-2sideAsideB))\r\n sumA +=radians\r\n\r\n print(sumA)", "from math import \r\n\r\nt=int(input())\r\nfor i in range(t):\r\n\tn=int(input())\r\n\tx=[float(y) for y in input().split()]\r\n\tx.sort()\r\n\tp,q=input().split()\r\n\tp=float(p)\r\n\tq=float(q)\r\n\tma=0.0\r\n\tfor ind in range(n//2):\r\n\t\ti=x[ind]\r\n\t\tj=x[n-ind-1]\t\r\n\t\tt1=t2=pi/2\r\n\t\tif (i!=p):\r\n\t\t\tt1=atan(q/abs(i-p))\r\n\t\tif (i>p):\r\n\t\t\tt1=pi-t1\r\n\t\tif (j!=p):\r\n\t\t\tt2=atan(q/abs(j-p))\r\n\t\tif (j<p):\r\n\t\t\tt2=pi-t2\r\n\t\tma+=(pi-t1-t2)\r\n\tprint(ma)\r\n", "import math\r\nfor _ in range(int(input())):\r\n\tn = int(input())\r\n\txs = list(map(int,input().split()))\r\n\tp,q = map(int,input().split())\r\n\tangles = sorted(math.atan((x-p)/q) for x in xs)\r\n\tprint(sum(angles[n//2:])-sum(angles[:n//2]))\r\n\r\n", "import math\r\nt=int(input())\r\nfor _ in range(t):\r\n n=int(input())\r\n a=list(map(int,input().split()))\r\n p,q=list(map(int,input().split()))\r\n a=sorted(a)\r\n b=[0]len(a)\r\n s=0\r\n for i in range(len(a)):\r\n b[i]=a[i]-p\r\n for i in range(len(a)//2):\r\n s=s-math.atan(b[i]/q)+math.atan(b[n-1-i]/q)\r\n print(s)", "from math import atan\r\nt = int(input())\r\ndef f(a,b,x,y):\r\n m = (b-x)/y\r\n n = (a-x)/y\r\n return atan(m)-atan(n);\r\nfor i in range(t):\r\n n = int(input())\r\n a = list(map(int,input().split()))\r\n a.sort()\r\n p,q = map(int,input().split())\r\n k = n//2\r\n s = 0\r\n for j in range(k):\r\n s = s+f(a[j],a[n-1-j],p,q)\r\n if s<0:\r\n s = -s\r\n print(s)\r\n", "import math\r\n\r\ndef angle(x1, B, x2):\r\n xb, yb = B\r\n a = math.sqrt((xb-x1)2+yb2)\r\n b = math.sqrt((xb-x2)2+yb2)\r\n c = abs(x2-x1)\r\n return math.acos((a2+b2-c2)/(2ab))\r\n\r\n\r\nfor _ in range(int(input())):\r\n n = int(input())\r\n X = [int(x) for x in input().split()]\r\n B = [int(x) for x in input().split()]\r\n X.sort()\r\n l, r = 0, len(X)-1\r\n ang = 0\r\n while l<r:\r\n ang += angle(X[l], B, X[r])\r\n l += 1\r\n r -= 1\r\n print(ang)", "from math import acos,sqrt\r\nt=int(input())\r\n\r\n\r\ndef distance(x,y,p,q):\r\n a=abs(x-y)\r\n b=sqrt((p-x)2+q2)\r\n c=sqrt((p-y)2+q2)\r\n angle = acos((c * 2 + b 2 - a 2) / (2 * b * c))\r\n return angle\r\n\r\n\r\ndef main():\r\n for _ in range(t):\r\n n=int(input())\r\n c=[int(x) for x in input().split()]\r\n p,q=map(int,input().split())\r\n c.sort()\r\n l=0\r\n h=n-1\r\n sum1=0\r\n while l<h:\r\n angle=distance(c[l],c[h],p,q)\r\n sum1+=angle\r\n l+=1\r\n h-=1\r\n print(sum1)\r\n\r\n\r\ndef __starting_point():\r\n main()\n__starting_point()"]	{"inputs": [["2", "2", "0 1", "0 1", "2", "0 1", "100 1", ""]], "outputs": [["0.785398163397", "0.000100999899"]]}	INTERVIEW	PYTHON3	CODECHEF	16,651
34af6b3ddf701cf4352e90de94842a31	UNKNOWN	Three Best Friends $AMAN$ , $AKBAR$ , $ANTHONY$ are planning to go to “GOA” , but just like every other goa trip plan there is a problem to their plan too. Their parents will only give permission if they can solve this problem for them They are a given a number N and they have to calculate the total number of triplets (x ,y ,z) Satisfying the given condition y * x +z=n. For ex if N=3 Then there exist 3 triplets( x ,y ,z): (1,1,2) , (1,2,1) , (2,1,1) which satisfy the condition Help the group to get permission for the trip -----Input:----- - First line will contain the number $N$. -----Output:----- the possible number of triplets satisfying the given condition -----Constraints----- - $2 \leq N \leq 10^6$ -----Sample Input:----- 3 -----Sample Output:----- 3 -----EXPLANATION:----- there exist 3 triplets ( x ,y ,z): (1,1,2) , (1,2,1) , (2,1,1) which satisfy the condition	["import sys\r\ndef get_array(): return list(map(int , sys.stdin.readline().strip().split()))\r\ndef get_ints(): return list(map(int, sys.stdin.readline().strip().split()))\r\ndef input(): return sys.stdin.readline().strip()\r\nimport sys\r\nsys.setrecursionlimit(10*9)\r\nfrom math import sqrt,ceil,floor\r\nn=int(input())\r\nco=0\r\nans=0\r\nfor i in range(1,n):\r\n ans+=n//i\r\n if n%i==0:\r\n ans-=1\r\nprint(ans)\r\n\r\n", "# cook your dish here\ntry:\n n=int(input())\n l=[int(i) for i in range(1,n+1)]\n cnt=0\n for i in range(1,n+1):\n for j in range(1,(n//i)+1):\n if 1<=n-(ij)<=n:\n # print(i,j,(n-(ij)))\n cnt+=1\n print(cnt)\nexcept EOFError as e: pass", "N = int(input())\r\nr = range(1, N + 1)\r\ncount = 0\r\nfor i in r:\r\n\tfor j in r:\r\n\t\tif i j >= N: break\r\n\t\tcount += 1\r\nprint(count)", "N = int(input())\r\n\r\ncount = 0\r\nfor i in range(1, N):\r\n\tfor j in range(1, N):\r\n\t\tif i * j >= N: break\r\n\t\tcount += 1\r\nprint(count)", "\n\nn=int(input())\nans=0\nfor i in range(1,n):\n ans+=(n-1)//i\nprint(ans)"]	{"inputs": [["3"]], "outputs": [["3"]]}	INTERVIEW	PYTHON3	CODECHEF	1,129
11f736cf93352e54ffc606a124301fd9	UNKNOWN	Maheshmati and Sangu are playing a game. First, Maheshmati gives Sangu a sequence of $N$ distinct integers $a_1, a_2, \dots, a_N$ (not necessarily sorted) and an integer $K$. Sangu has to create all subsequences of this sequence with length $K$. For each subsequence, he has to write down the product of $K-2$ integers: all elements of this subsequence except the minimum and maximum element. Sangu wins the game if he is able to write down all these numbers and tell Maheshmati their product (modulo $10^9+7$, since it can be very large). However, Sangu is a very lazy child and thus wants you to help him win this game. Compute the number Sangu should tell Maheshmati! -----Input----- - The first line of the input contains a single integer $T$ denoting the number of test cases. The description of $T$ test cases follows. - The first line of each test case contains two space-separated integers $N$ and $K$. - The second line contains $N$ space-separated integers $a_1, a_2, \dots, a_N$. -----Output----- For each test case, print a single line containing one integer — the product of all numbers written down by Sangu modulo $10^9+7$. -----Constraints----- - $1 \le T \le 10$ - $3 \le N \le 5,000$ - $3 \le K \le N$ - $1 \le a_i \le 10,000$ for each valid $i$ - the numbers $a_1, a_2, \dots, a_N$ are pairwise distinct -----Subtasks----- Subtask #1 (20 points): $1 \le N \le 10$ Subtask #2 (80 points): original constraints -----Example Input----- 1 4 3 1 2 3 4 -----Example Output----- 36 -----Explanation----- Example case 1: There are four possible subsequences: - $[1, 2, 3]$ (Sangu should write down $2$.) - $[1, 3, 4]$ (Sangu should write down $3$.) - $[1, 2, 4]$ (Sangu should write down $2$.) - $[2, 3, 4]$ (Sangu should write down $3$.) The required product is $2 \cdot 3 \cdot 2 \cdot 3 = 36$.	["f = 5003[0]\nmodn = 1000000007\n\n\ndef qPow(a, b):\n nonlocal modn\n res = 1\n while b > 0:\n if (b & 1) == 1:\n res = res a % modn\n a = a * a % modn\n b = b >> 1\n return res\n\n\ndef getF():\n nonlocal f\n f[0] = 1\n for i in range(1, 5001):\n f[i] = f[i-1] * i\n\n\ndef __starting_point():\n getF()\n T = int(input())\n while T > 0:\n T = T - 1\n n, k = list(map(int,input().split()))\n lis = list(map(int, input().split()))\n lis = sorted(lis)\n res = 1\n for i in range(n):\n zhi = f[n-1]//f[k-1]//f[n-k]\n if i >= k-1:\n zhi = zhi - f[i]//f[k-1]//f[i+1-k]\n if n-i-1 >= k-1:\n zhi = zhi - f[n-i-1]//f[k-1]//f[n-i-k]\n zhi = zhi % (modn-1)\n # print(zhi)\n res = res * qPow(lis[i], zhi) % modn\n print(res)\n\n__starting_point()", "# cook your dish here\nMOD = (10*9) + 7\n\ndef ncr(n, r, p): \n # initialize numerator \n # and denominator \n num = den = 1 \n for i in range(r): \n num = (num (n - i)) % p \n den = (den * (i + 1)) % p \n return (num * pow(den, \n p - 2, p)) % p \n\nfor _ in range(int(input())):\n \n n , k = list(map( int, input().split()))\n \n arr = list( map( int, input().split()) )\n \n arr = sorted(arr)\n \n value = ncr(n-1,k-1,MOD)\n \n ans = 1\n \n \n \n for x in range(1,n-1):\n \n if (n - x - 1) >= (k-1) :\n \n temp1 = ncr(n-x-1,k-1,MOD)\n else:\n temp1 = 0\n \n if x >= (k-1):\n \n temp2 = ncr(x,k-1,MOD)\n else:\n temp2 = 0 \n \n \n # print(value,ans,temp1,temp2)\n ans = ( ans * (arr[x]( value - temp2 - temp1 )) )%MOD\n \n print(ans)\n \n \n \n \n", "# cook your dish here\nMOD = (109) + 7\n\ndef ncr(n, r, p): \n # initialize numerator \n # and denominator \n num = den = 1 \n for i in range(r): \n num = (num * (n - i)) % p \n den = (den * (i + 1)) % p \n return (num * pow(den, \n p - 2, p)) % p \n\nfor _ in range(int(input())):\n \n n , k = list(map( int, input().split()))\n \n arr = list( map( int, input().split()) )\n \n arr = sorted(arr)\n \n value = ncr(n-1,k-1,MOD)\n \n ans = 1\n \n \n \n for x in range(1,n-1):\n \n if (n - x - 1) >= (k-1) :\n \n temp1 = ncr(n-x-1,k-1,MOD)\n else:\n temp1 = 0\n \n if x >= (k-1):\n \n temp2 = ncr(x,k-1,MOD)\n else:\n temp2 = 0 \n \n \n # print(value,ans,temp1,temp2)\n ans = ( ans * (arr[x]( value - temp2 - temp1 )) )%MOD\n \n print(ans)\n \n \n \n \n", "# cook your dish here\nMOD = (109) + 7\n\ndef nCrModpDP(n, r, p): \n \n # The array C is going to store \n # last row of pascal triangle \n # at the end. And last entry \n # of last row is nCr \n C = [0] * (n + 1); \n \n # Top row of Pascal Triangle \n C[0] = 1; \n \n # One by constructs remaining \n # rows of Pascal Triangle from \n # top to bottom \n for i in range(1, (n + 1)): \n \n # Fill entries of current \n # row using previous row \n # values \n j = min(i, r); \n while(j > 0): \n C[j] = (C[j] + C[j - 1]) % p; \n j -= 1; \n return C[r]; \n \n# Lucas Theorem based function that \n# returns nCr % p. This function \n# works like decimal to binary \n# conversion recursive function. \n# First we compute last digits of \n# n and r in base p, then recur \n# for remaining digits \ndef nCrModpLucas(n, r, p): \n \n # Base case \n if (r == 0): \n return 1; \n \n # Compute last digits of n \n # and r in base p \n ni = int(n % p); \n ri = int(r % p); \n \n # Compute result for last digits \n # computed above, and for remaining \n # digits. Multiply the two results \n # and compute the result of \n # multiplication in modulo p. \n # Last digits of n and r \n return (nCrModpLucas(int(n / p), int(r / p), p) * \n nCrModpDP(ni, ri, p)) % p;\n\nfor _ in range(int(input())):\n \n n , k = list(map( int, input().split()))\n \n arr = list( map( int, input().split()) )\n \n arr = sorted(arr)\n \n value = nCrModpLucas(n-1,k-1,MOD)\n \n ans = 1\n \n \n \n for x in range(1,n-1):\n \n if (n - x - 1) >= (k-1) :\n \n temp1 = nCrModpLucas(n-x-1,k-1,MOD)\n else:\n temp1 = 0\n \n if x >= (k-1):\n \n temp2 = nCrModpLucas(x,k-1,MOD)\n else:\n temp2 = 0 \n \n \n # print(value,ans,temp1,temp2)\n ans = ( ans * (arr[x]( value - temp2 - temp1 )) )%MOD\n \n print(ans)\n \n \n \n \n", "# cook your dish here\nMOD = (109) + 7\n\ndef binomialCoefficient(n, r, p): \n\n # The array C is going to store last row of \n # pascal triangle at the end. And last entry \n # of last row is nCr. \n C = [0 for i in range(r+1)] \n \n C[0] = 1 # Top row of Pascal Triangle \n \n # One by constructs remaining rows of Pascal \n # Triangle from top to bottom \n for i in range(1, n+1): \n \n # Fill entries of current row \n # using previous row values \n for j in range(min(i, r), 0, -1): \n \n # nCj = (n - 1)Cj + (n - 1)C(j - 1) \n C[j] = (C[j] + C[j-1]) % p \n \n return int(C[r])\n\nfor _ in range(int(input())):\n \n n , k = list(map( int, input().split()))\n \n arr = list( map( int, input().split()) )\n \n arr = sorted(arr)\n \n value = binomialCoefficient(n-1,k-1,MOD)\n \n ans = 1\n \n \n \n for x in range(1,n-1):\n \n if (n - x - 1) >= (k-1) :\n \n temp1 = binomialCoefficient(n-x-1,k-1,MOD)\n else:\n temp1 = 0\n \n if x >= (k-1):\n \n temp2 = binomialCoefficient(x,k-1,MOD)\n else:\n temp2 = 0 \n \n \n # print(value,ans,temp1,temp2)\n ans = ( ans * (arr[x]( value - temp2 - temp1 )) )%MOD\n \n print(ans)\n \n \n \n \n", "# cook your dish here\nMOD = (109) + 7\n\ndef binomialCoefficient(n, k): \n # since C(n, k) = C(n, n - k) \n # Declaring an empty array \n C = [0 for i in range(k+1)] \n C[0] = 1 #since nC0 is 1 \n \n for i in range(1,n+1): \n \n # Compute next row of pascal triangle using \n # the previous row \n j = min(i ,k) \n while (j>0): \n C[j] = C[j] + C[j-1] \n j -= 1\n \n return int(C[k] )\n\nfor _ in range(int(input())):\n \n n , k = list(map( int, input().split()))\n \n arr = list( map( int, input().split()) )\n \n arr = sorted(arr)\n \n value = binomialCoefficient(n-1,k-1)\n \n ans = 1\n \n \n \n for x in range(1,n-1):\n \n if (n - x - 1) >= (k-1) :\n \n temp1 = binomialCoefficient(n-x-1,k-1)\n else:\n temp1 = 0\n \n if x >= (k-1):\n \n temp2 = binomialCoefficient(x,k-1)\n else:\n temp2 = 0 \n \n \n # print(value,ans,temp1,temp2)\n ans = ( ans * (arr[x]( value - temp2 - temp1 )) )%MOD\n \n print(ans)\n \n \n \n \n", "# cook your dish here\nMOD = (109) + 7\n\ndef binomialCoefficient(n, k): \n # since C(n, k) = C(n, n - k) \n if(k > n - k): \n k = n - k \n # initialize result \n res = 1\n # Calculate value of \n # [n * (n-1) --- (n-k + 1)] / [k * (k-1) ---- 1] \n for i in range(k): \n res = res * (n - i) \n res = res / (i + 1) \n return int(res) \n\nfor _ in range(int(input())):\n \n n , k = list(map( int, input().split()))\n \n arr = list( map( int, input().split()) )\n \n arr = sorted(arr)\n \n value = binomialCoefficient(n-1,k-1)\n \n ans = 1\n \n \n \n for x in range(1,n-1):\n \n if (n - x - 1) >= (k-1) :\n \n temp1 = binomialCoefficient(n-x-1,k-1)\n else:\n temp1 = 0\n \n if x >= (k-1):\n \n temp2 = binomialCoefficient(x,k-1)\n else:\n temp2 = 0 \n \n \n # print(value,ans,temp1,temp2)\n ans = ( ans * (arr[x]*( value - temp2 - temp1 )) )%MOD\n \n print(ans)\n \n \n \n \n", "# cook your dish here\n\nfrom itertools import combinations\n\n\nfor i in range(int(input())) :\n \n n , k = list(map(int,input().split()))\n \n arr = list(map(int,input().split()))\n \n arr.sort()\n \n sub = [arr[i] for i in range(1,n-1)]\n \n comb = combinations(sub,k-2) \n \n prod = 1\n \n #print(list(comb))\n \n for i in list(comb) :\n \n maximum = max(i)\n \n minimum = min(i)\n \n \n ind_max , ind_min = arr.index(maximum) , arr.index(minimum) \n \n \n \n aftermax = n - ind_max - 1 \n \n beforemin = ind_min \n \n \n \n temp = aftermax beforemin\n \n for j in i :\n \n \n \n prod = prod * (jtemp)\n \n print(prod % (109 + 7))\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n", "MOD=10*9+7\np=100000\nfact=[0]p \nfact[0]=1 \nfor i in range(1,p):\n fact[i]=(fact[i-1]i)%MOD\ndef MI(a,MOD):\n return pow(a,MOD-2,MOD)\ndef nck(n, k,MOD):\n if n==k or k==0:\n return 1 \n if n<k:\n return 0 \n return (fact[n]MI(fact[k],MOD)%MODMI(fact[n-k],MOD)%MOD)%MOD\nfor _ in range(int(input())):\n n,k=map(int,input().split())\n prod=1\n l=[int(i) for i in input().split()]\n l.sort()\n for i in range(n):\n tot=nck(n-1,k-1,MOD)\n x=n-i\n asmin=nck(x-1,k-1,MOD)\n y=i+1\n asmax=nck(y-1,k-1,MOD)\n req=tot-asmin-asmax\n prod=(prodpow(l[i],req,MOD))%MOD\n print(prod%MOD)", "MOD=10*9+7\np=100000\nfact=[0]p \nfact[0]=1 \nfor i in range(1,p):\n fact[i]=(fact[i-1]i)%MOD\ndef MI(a,MOD):\n return pow(a,MOD-2,MOD)\ndef nck(n, k):\n if n==k or k==0:\n return 1 \n if n<k:\n return 0 \n return (fact[n]MI(fact[k],MOD)%MODMI(fact[n-k],MOD)%MOD)%MOD\nfor _ in range(int(input())):\n n,k=map(int,input().split())\n prod=1\n l=[int(i) for i in input().split()]\n l.sort()\n for i in range(n):\n tot=nck(n-1,k-1)\n x=n-i\n asmin=nck(x-1,k-1)\n y=i+1\n asmax=nck(y-1,k-1)\n req=tot-asmin-asmax\n prod=(prodpow(l[i],req,MOD))%MOD\n print(prod%MOD)", "MOD=10*9+7\np=1000000\nfact=[0]p \nfact[0]=1 \nfor i in range(1,p):\n fact[i]=(fact[i-1]i)%MOD\ndef MI(a,MOD):\n return pow(a,MOD-2,MOD)\ndef nck(n, k):\n if n==k or k==0:\n return 1 \n if n<k:\n return 0 \n return (fact[n]MI(fact[k],MOD)%MODMI(fact[n-k],MOD)%MOD)%MOD\nfor _ in range(int(input())):\n n,k=map(int,input().split())\n prod=1\n l=[int(i) for i in input().split()]\n l.sort()\n for i in range(n):\n tot=nck(n-1,k-1)\n x=n-i\n asmin=nck(x-1,k-1)\n y=i+1\n asmax=nck(y-1,k-1)\n req=tot-asmin-asmax\n prod=pow(l[i],req,MOD)\n print(prod%MOD)", "MOD=10*9+7\np=1000000\nfact=[0]p \nfact[0]=1 \nfor i in range(1,p):\n fact[i]=(fact[i-1]i)%MOD\ndef MI(a,MOD):\n return pow(a,MOD-2,MOD)\ndef nck(n, k):\n if n==k or k==0:\n return 1 \n if n<k:\n return 0 \n return fact[n]MI(fact[k],MOD)MI(fact[n-k],MOD)%MOD\nfor _ in range(int(input())):\n n,k=map(int,input().split())\n prod=1\n l=[int(i) for i in input().split()]\n l.sort()\n for i in range(n):\n tot=nck(n-1,k-1)\n x=n-i\n asmin=nck(x-1,k-1)\n y=i+1\n asmax=nck(y-1,k-1)\n req=tot-asmin-asmax\n prod=pow(l[i],req,MOD)\n print(prod%MOD)", "MOD=10*9+7\np=6000\nfact=[0]p \nfact[0]=1 \nfor i in range(1,p):\n fact[i]=(fact[i-1]i)%MOD\ndef MI(a,MOD):\n return pow(a,MOD-2,MOD)\ndef nck(n, k):\n if n==k or k==0:\n return 1 \n if n<k:\n return 0 \n return fact[n]MI(fact[k],MOD)MI(fact[n-k],MOD)%MOD\nfor _ in range(int(input())):\n n,k=map(int,input().split())\n prod=1\n l=[int(i) for i in input().split()]\n l.sort()\n #nck=combo_nck(n,k)\n for i in range(n):\n tot=nck(n-1,k-1)\n # print(tot)\n x=n-i\n if x>=k-1:\n asmin=nck(x-1,k-1)\n else:\n asmin=0\n y=i+1\n if y>=k-1:\n asmax=nck(y-1,k-1)\n else:\n asmax=0\n #print(asmin)\n #print(asmin,asmax)\n prod=pow(l[i],tot-asmin-asmax,MOD)\n # print(prod)\n print(prod%MOD)"]	{"inputs": [["1", "4 3", "1 2 3 4"]], "outputs": [["36"]]}	INTERVIEW	PYTHON3	CODECHEF	11,058
c9afd6a7eb3626d1cb4bc489bbb65c69	UNKNOWN	There are total $N$ cars in a sequence with $ith$ car being assigned with an alphabet equivalent to the $ith$ alphabet of string $S$ . Chef has been assigned a task to calculate the total number of cars with alphabet having a unique even value in the given range X to Y (both inclusive) . The value of an alphabet is simply its position in alphabetical order e.g.: a=1, b=2, c=3… The chef will be given $Q$ such tasks having varying values of $X$ and $Y$ Note: string $S$ contains only lowercase alphabets -----Input----- First line of input contains a string $S$ of length $N$. Second line contains an integer denoting no. of queries $Q$. Next q lines contain two integers denoting values of $X$ and $Y$. -----Output----- For each query print a single integer denoting total number of cars with alphabet having a unique even value in the given range $X$ to $Y$. -----Constraints----- - $1 \leq n \leq 10^5$ - $1 \leq q \leq 10^5$ -----Example Input----- bbccdd 5 1 2 3 4 5 6 1 6 2 5 -----Example Output----- 1 0 1 2 2 -----Explanation:----- Example case 1: Query 1: range 1 to 2 contains the substring $"bb"$ where each character has a value of 2. Since we will only be considering unique even values, the output will be 1	["arr = list(input())\r\nn = len(arr)\r\nans = list()\r\n#for i in arr:\r\n #ans.append(ord(i)-96)\r\nli = ['b','d','f','h','j','l','n','p','r','t','v','x','z']\r\ns = set(arr)\r\ntemp = s.intersection(li)\r\nfor _ in range(int(input())):\r\n x,y = list(map(int,input().split()))\r\n li = list(temp)\r\n #s = set()\r\n c=0\r\n for i in range(x-1,y):\r\n if arr[i] in li:\r\n c+=1 \r\n li.remove(arr[i])\r\n if len(li)==0:\r\n break\r\n print(c)\r\n", "S=input()\nN=len(S)\nQ=int(input())\nA=[[0]27 for i in range(N)]\nfor i in range(N):\n try:\n if i>0:\n for j in range(1,27):\n A[i][j]=A[i-1][j]\n A[i][ord(S[i])-ord('a')+1]+=1\n except:\n pass\n# for i in A:\n# print(i)\nwhile Q>0:\n Q-=1\n X,Y = [int(x) for x in input().split()]\n ans=0\n X-=1\n Y-=1\n for i in range(2,27,2):\n try:\n if X>0:\n val = A[Y][i]-A[X-1][i]\n else:\n val = A[Y][i]\n except:\n pass\n if (val)>0:\n ans+=1\n print(ans)", "\r\nstring = input()\r\ntoken = {}\r\nfor i in range(98,123,2):\r\n token[chr(i)] = 0\r\nl = [token.copy()]\r\nfor letter in string:\r\n if (ord(letter)+1)%2:\r\n token[letter] += 1\r\n l.append(token.copy())\r\nq = int(input())\r\nfor query in range(q):\r\n a,b = map(int,input().split())\r\n if a > b:\r\n a,b = b,a\r\n ans = 0\r\n if a > len(string):\r\n a = len(string)\r\n if b > len(string):\r\n b = len(string)\r\n if a < 1:\r\n a = 1\r\n if b < 1:\r\n b = 1\r\n for i in range(98,123,2):\r\n if l[b][chr(i)] > l[a-1][chr(i)]:\r\n ans += 1\r\n print(ans) ", "import sys\r\nfrom functools import lru_cache, cmp_to_key\r\nfrom heapq import merge, heapify, heappop, heappush\r\nfrom math import \r\nfrom collections import defaultdict as dd, deque, Counter as C\r\nfrom itertools import combinations as comb, permutations as perm\r\nfrom bisect import bisect_left as bl, bisect_right as br, bisect\r\nfrom time import perf_counter\r\nfrom fractions import Fraction\r\nimport copy\r\nimport time\r\nstarttime = time.time()\r\nmod = int(pow(10, 9) + 7)\r\nmod2 = 998244353\r\n# from sys import stdin\r\n# input = stdin.readline\r\ndef data(): return sys.stdin.readline().strip()\r\ndef out(var, end=\"\\n\"): sys.stdout.write(' '.join(map(str, var))+end)\r\ndef L(): return list(sp())\r\ndef sl(): return list(ssp())\r\ndef sp(): return map(int, data().split())\r\ndef ssp(): return map(str, data().split())\r\ndef l1d(n, val=0): return [val for i in range(n)]\r\ndef l2d(n, m, val=0): return [l1d(n, val) for j in range(m)]\r\ntry:\r\n # sys.setrecursionlimit(int(pow(10,7)))\r\n sys.stdin = open(\"input.txt\", \"r\")\r\n # sys.stdout = open(\"../output.txt\", \"w\")\r\nexcept:\r\n pass\r\ndef pmat(A):\r\n for ele in A:\r\n print(ele,end=\"\\n\")\r\ndef seive():\r\n prime=[1 for i in range(106+1)]\r\n prime[0]=0\r\n prime[1]=0\r\n for i in range(106+1):\r\n if(prime[i]):\r\n for j in range(2i,106+1,i):\r\n prime[j]=0\r\n return prime\r\n\r\nimport sys\r\n\r\ns = list(sys.stdin.readline().strip())\r\nn = len(s)\r\nBIT = [[0](n+1) for i in range(26)]\r\n\r\ndef update(i, idx, val):\r\n idx += 1\r\n while idx <= n:\r\n BIT[i][idx] += val\r\n idx += (-idx & idx)\r\n\r\ndef read(i, idx):\r\n ret = 0\r\n while idx > 0:\r\n ret += BIT[i][idx]\r\n idx -= (-idx & idx)\r\n return ret \r\n\r\nfor i in range(n):\r\n update(ord(s[i])-97, i, 1)\r\n\r\nq = int(sys.stdin.readline())\r\n\r\nfor _ in range(q):\r\n a, b = sys.stdin.readline().split()\r\n t=2\r\n if t==\"1\":\r\n idx = int(a) - 1\r\n bit_idx = ord(s[idx])-97\r\n update(bit_idx, idx, -1)\r\n s[idx] = b\r\n bit_idx = ord(b)-97\r\n update(bit_idx, idx, 1)\r\n else:\r\n ans = 0\r\n l, r = int(a), int(b)\r\n for i in range(1,26,2):\r\n ans += 1 if (read(i, r) - read(i, l-1)) > 0 else 0\r\n print(ans)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\nendtime = time.time()\r\n# print(f\"Runtime of the program is {endtime - starttime}\")\r\n\r\n", "import sys\r\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\ninp = lambda: list(map(int,sys.stdin.readline().rstrip(\"\\r\\n\").split()))\r\n#______________________________________________________________________________________________________\r\n# from math import \r\n# from bisect import \r\n# from heapq import \r\n# from collections import defaultdict as dd\r\n# from collections import OrderedDict as odict\r\n# from collections import Counter as cc\r\n# from collections import deque\r\n# sys.setrecursionlimit(2(105)+100) this is must for dfs\r\n# mod = 109+7; md = 998244353\r\n# ______________________________________________________________________________________________________\r\n# Checking prime in O(root(N))\r\n# def isprime(n):\r\n# if (n % 2 == 0 and n > 2) or n == 1: return 0\r\n# else:\r\n# s = int(n*(0.5)) + 1\r\n# for i in range(3, s, 2):\r\n# if n % i == 0:\r\n# return 0\r\n# return 1\r\n# def lcm(a,b):\r\n# return (ab)//gcd(a,b)\r\n# ______________________________________________________________________________________________________\r\n# nCr under mod\r\n# def C(n,r,mod):\r\n# if r>n:\r\n# return 0\r\n# num = den = 1\r\n# for i in range(r):\r\n# num = (num(n-i))%mod\r\n# den = (den(i+1))%mod\r\n# return (numpow(den,mod-2,mod))%mod\r\n# M = 105 +10\r\n# ______________________________________________________________________________________________________\r\n# For smallest prime factor of a number\r\n# M = 1000010\r\n# pfc = [i for i in range(M)]\r\n# def pfcs(M):\r\n# for i in range(2,M):\r\n# if pfc[i]==i:\r\n# for j in range(i+i,M,i):\r\n# if pfc[j]==j:\r\n# pfc[j] = i\r\n# return\r\n# pfcs(M)\r\n# ______________________________________________________________________________________________________\r\n# import sys\r\nsys.setrecursionlimit(105)\r\n# n = int(sys.stdin.readline().strip())\r\n# a = list(map(int,sys.stdin.readline().strip().split()))\r\na = str(input())\r\nn = len(a)\r\nst = [float('inf') for i in range(4len(a))]\r\ndef build(a,ind,start,end):\r\n\tif start == end:\r\n\t\tst[ind] = [a[start]] if ord(a[start])%2==0 else []\r\n\telse:\r\n\t\tmid = (start+end)//2\r\n\t\tbuild(a,2ind+1,start,mid)\r\n\t\tbuild(a,2ind+2,mid+1,end)\r\n\t\tst[ind] = list(set(st[2ind+1]+st[2ind+2]))\r\nbuild(a,0,0,n-1)\r\ndef query(ind,l,r,start,end):\r\n\tif start>r or end<l:\r\n\t\treturn []\r\n\tif l<=start<=end<=r:\r\n\t\treturn st[ind]\r\n\tmid = (start+end)//2\r\n\treturn list(set(query(2ind+1,l,r,start,mid)+query(2ind+2,l,r,mid+1,end)))\r\nfor i in range(int(input())):\r\n\tl,r = inp()\r\n\tans = query(0,l-1,r-1,0,n-1)\r\n\t# print(ans)\r\n\tprint(len(ans))\r\n# tc = 1\r\n# # tc, = inp()\r\n# for _ in range(tc):\r\n# # s = str(input())\r\n# a = [i for i in input().split()]\r\n# k = min(a,key = lambda x:len(x))\r\n# print(k)\n"]	{"inputs": [["bbccdd", "5", "1 2", "3 4", "5 6", "1 6", "2 5"]], "outputs": [["1", "0", "1", "2", "2"]]}	INTERVIEW	PYTHON3	CODECHEF	7,366
641cad3585b966480a714cbe24852b98	UNKNOWN	You are given three numbers $a$, $b$, $c$ . Write a program to determine the largest number that is less than or equal to $c$ and leaves a remainder $b$ when divided by $a$. -----Input:----- - First line will contain $T$, number of testcases. Then the testcases follow. - Each testcase contains a single line of input, having three integers $a$, $b$, $c$. -----Output:----- - For each testcase, output in a single line the largest number less than or equal to $c$. -----Constraints:----- - $1 \leq T \leq 100000$ - $0 \leq b < a < c \leq$ $10$^18 -----Sample Input:----- 1 7 2 10 -----Sample Output:----- 9	["# cook your dish here\nfor t in range(int(input())):\n a,b,c=map(int,input().split())\n p=(c//a)a+b\n if p<=c:\n print(p)\n else:\n print(((c//a)-1)a+b)", "try:\r\n for _ in range(int(input())):\r\n a,b,c=[int(i) for i in input().split()]\r\n r=c%a\r\n if(r>b):\r\n print(c-(r-b))\r\n elif(r<b):\r\n print(c-r-a+b)\r\n else:\r\n print(c)\r\nexcept EOFError as e:\r\n pass", "n=int(input())\r\nwhile n:\r\n a,b,c=list(map(int,input().split()))\r\n m=c//a\r\n m=(ma)+b\r\n if m>c:\r\n \tm-=a\r\n print(m)\r\n n-=1\r\n", "t=int(input())\nfor _ in range(t):\n \n a,b,c=(list(map(int,input().split())))\n print((c-b)//aa+b)\n", "# cook your dish here\ntry:\n t= int(input())\n for i in range(t):\n a,b,c= map(int,input().split())\n x=c//a\n ans=(xa)+b\n if(ans>c):\n ans=ans-a\n print(ans)\n\nexcept:\n pass", "n=int(input())\r\nfor i in range(n):\r\n abc=list(map(int,input().split()))\r\n a=abc[0];b=abc[1];c=abc[2]\r\n l=c-(c%a)\r\n if((l+b)>c):\r\n l=l-a\r\n if(a<=b):\r\n l=0\r\n print(l+b)\r\n", "# cook your dish here\nfor t in range(int(input())):\n a, b, c = [int(i) for i in input().split(\" \")]\n r = c % a\n ans = c - r + b\n if ans > c:\n ans -= a\n print(ans)", "t=int(input())\nfor _ in range(t):\n a,b,c=list(map(int,input().split()))\n x=(c-b)//a\n print((xa)+b)\n", "x=int(input())\nfor i in range(x):\n a,b,c=list(map(int,input().split()))\n for j in range(c//a,-1,-1):\n if aj+b<=c:\n print(aj+b)\n break\n", "# cook your dish here\nx=int(input())\nfor i in range(x):\n a,b,c=list(map(int,input().split()))\n for j in range(c//a,-1,-1):\n if aj+b<=c:\n print(aj+b)\n break\n \n", "# cook your dish here\n# cook your dish here\n# cook your dish here\nT = int(input())\n\nfor i in range(T):\n a, b, c = map(int, input().split())\n\n rem = c%a\n k = c-rem+b\n \n while(k>c):\n k = k-a\n \n print(k)", "for _ in range(int(input())):\n a,b,c=list(map(int,input().split()))\n i=0\n d=0\n while d<=c:\n d=ai+b \n \n i=i+1\n print(d-a)\n \n \n \n \n", "t = int(input())\r\nfor _ in range(t):\r\n a,b,c = input().split()\r\n a,b,c = int(a),int(b),int(c)\r\n d = c-(c%a)+b\r\n if d > c:\r\n print(d-a)\r\n else:\r\n print(d)\r\n", "# cook your dish here\r\nT = int(input())\r\n\r\nfor i in range(T):\r\n a, b, c = map(int, input().split())\r\n\r\n rem = c%a\r\n k = c-rem+b\r\n \r\n while(k>c):\r\n k = k-a\r\n \r\n print(k)", "# cook your dish here\ndef solve(a, b, c):\n n = b\n while n <= c:\n n += a\n \n return n - a\n\nans = []\nT = int(input())\nfor i in range(T):\n li = [int(x) for x in input().strip().split()]\n ans.append(solve(li[0], li[1], li[2]))\n\nfor ele in ans:\n print(ele)", "# cook your dish here\ndef solve(a, b, c):\n k = c // a\n n = b\n while n <= c:\n n += a\n \n return n - a\n\nans = []\nT = int(input())\nfor i in range(T):\n li = [int(x) for x in input().strip().split()]\n ans.append(solve(li[0], li[1], li[2]))\n\nfor ele in ans:\n print(ele)", "a=int(input())\r\nfor i in range(a):\r\n l=list(map(int,input().split()))\r\n for i in range(((l[2]-l[1])//l[0])+1):\r\n x=(il[0])+l[1]\r\n while(x>=l[2]):\r\n break\r\n print(x)", "t=int(input())\r\nfor i in range(t):\r\n a,b,c=map(int,input().split())\r\n k=(c-b)//a\r\n print(ka+b)", "t=int(input())\nfor _ in range(t):\n l=list(map(int,input().split()))\n a=l[0]\n b=l[1]\n c=l[2]\n x=c//a\n while(1):\n if ax+b<=c:\n print(ax+b)\n break\n else:\n x=x-1\n", "T=int(input())\nwhile T:\n\ta,b,c=map(int,input().split())\n\td=c%a\n\tif d<b:\n\t\ti=c-d-a+b\n\telse:\n\t\ti=c-d+b\n\tprint(i)\n\tT-=1", "# cook your dish here\nt = int(input())\nfor i in range(0,t):\n a=input().split()\n b=list(map(int,a))\n n=int(b[2]/b[0])\n if((b[0])n+b[1]<=b[2]):\n print((b[0])n+b[1])\n else:\n print((b[0])(n-1)+b[1])", "# cook your dish here\nt=int(input())\nwhile t:\n a,b,c=[int(i) for i in input().split(' ')]\n k=(c-b)//a\n print((ka)+b)\n t-=1", "t = int(input())\r\nfor i in range(t):\r\n lst = input().split()\r\n for j in range(3):\r\n lst[j] = int(lst[j])\r\n if(lst[2] % lst[0] == lst[1]):\r\n print(lst[2])\r\n elif(lst[2] % lst[0] < lst[1]):\r\n print(lst[2] - (lst[0] - lst[1] + lst[2] % lst[0]))\r\n else:\r\n print(lst[2] - (lst[2] % lst[0] - lst[1]))", "t=0\ntry:\n t=int(input())\nexcept:\n pass\nfor _ in range(t):\n a,b,c=map(int,input().split())\n d=c%a\n if(d<b):\n print(c-d+b-a)\n else:\n print(c-d+b)", "# cook your dish here\nn=int(input())\nfor i in range(n):\n l=list(map(int,input().split(\" \")))\n p=0\n k=0\n while(p<=l[2]):\n m=p\n p=(l[0]k)+l[1]\n k+=1\n print(m)"]	{"inputs": [["1", "7 2 10"]], "outputs": [["9"]]}	INTERVIEW	PYTHON3	CODECHEF	5,258
19f7e653c49205d19730fdcaf165f311	UNKNOWN	Aureole the Techno-cultural fest of JEC thought of conducting a workshop on big data, as the topic is hot everyone wants to take part but due to limited seats in the Jashan Auditorium there is a selection criteria, a problem is given. the problem states a string is to be compressed when two or more consecutive characters are same they are to be compressed into one character and the original number count is to be written after it ex. aaabb -> a3b2 where every character is of 8bits and every integer is of 32bits you are asked to find the difference in size between original string and compressed string -----Input:----- - First line will contain $T$, number of testcases. Then the testcases follow. - Each testcase contains of a single line of input $S$ the string to be compressed. -----Output:----- For each testcase, output in a single line The difference in size. -----Constraints----- - $1 \leq T \leq 100$ - $1 \leq \|S\| \leq 10^5$ -----Subtasks----- - 40 points : S will contain only a-z - 60 points : S will contain 0-9 characters also -----Sample Input:----- 1 aaabb -----Sample Output:----- -40 -----EXPLANATION:----- the resulting string will be a3b2 its size will be 80, original string size will be 40 so ans= 40-80	["#include<sdg.h>\nfor _ in range(int(input())):\n s=input()\n n=len(s)\n if n==1:\n if s[0].isalpha(): print(\"-32\")\n else: print(0)\n else:\n num,ch=0,0\n p,q=0,0\n c=1\n x=s[0]\n ans=\"\"\n for i in range(1,n):\n if s[i-1]==s[i]:\n c+=1\n if i==n-1:\n ans+=s[i-1]\n ch+=1\n if c>1:\n ans+=str(c)\n num+=1\n c=1\n else:\n ans+=s[i-1]\n ch+=1\n if c>1:\n ans+=str(c)\n num+=1\n c=1\n if i==n-1:\n ans+=s[i]\n ch+=1\n #print(ans,num,ch)\n sol=(n8)-((num32)+(ch8))\n print(sol)", "t=int(input())\nfor _ in range(t):\n s=input()\n x=\"\"\n i=0\n ans=0\n while i<len(s):\n x=s[i]\n c=1\n i+=1\n while i<len(s) and s[i]==x:\n i+=1\n c+=1\n if c==1:\n ans+=8\n else:\n ans+=40\n m=8len(s)\n print(m-ans)\n", "# cook your dish here\nt=int(input())\nwhile t>0:\n c=input()\n len1=len(c)\n sum1=0\n l=[]\n for i in range(len1):\n sum1+=8\n sum2=8\n q=1\n for i in range(1,len1):\n if c[i]!=c[i-1]:\n if q>1:\n sum2+=32\n q=1 \n sum2+=8 \n else:\n q+=1 \n \n if q>1:\n sum2+=32 \n print(sum1-sum2)\n t-=1\n \n \n \n \n \n \n \n \n \n", "# cook your dish here\ndef compress(a):\n prev = None\n prev_c = 1\n ans_s=\"\"\n k=0\n for x in a:\n if prev == x:\n prev_c+=1\n else:\n if prev!=None:\n if prev_c!=1:\n ans_s = ans_s + str(prev) + str(prev_c)\n k+=40\n else:\n ans_s = ans_s + str(prev)\n k+=8\n prev_c=1\n prev =x\n if prev_c!=1:\n ans_s = ans_s + str(prev) + str(prev_c)\n k+=40\n else:\n ans_s = ans_s + str(prev)\n k+=8\n #print(ans_s)\n return k\nt=int(input())\nwhile(t):\n t=t-1\n a=input()\n ans = compress(a)\n size = 8len(a)\n print( size - ans )", "#include<sdg.h>\nfor _ in range(int(input())):\n s=input()\n n=len(s)\n if n==1:\n if s[0].isalpha(): print(\"-32\")\n else: print(0)\n else:\n num,ch=0,0\n p,q=0,0\n c=1\n x=s[0]\n ans=\"\"\n for i in range(1,n):\n if s[i-1]==s[i]:\n c+=1\n if i==n-1:\n ans+=s[i]\n if s[i].isalpha(): ch+=1\n else: num+=1\n if c>1: \n ans+=str(c)\n num+=1\n c=1\n \n else:\n if s[i-1].isalpha():\n ch+=1\n ans+=s[i-1]\n if c>1: \n ans+=str(c)\n num+=1\n c=1\n else:\n ans+=s[i-1]\n num+=1\n if c>1: \n ans+=str(c)\n num+=1\n c=1\n if i==n-1:\n ans+=s[i]\n if s[i].isalpha(): ch+=1\n else: num+=1\n #print(ans,num,ch)\n alp,qt=0,0\n for i in range(n):\n if s[i].isalpha(): alp+=1\n else: qt+=1\n sol=((qt-num)32)+((alp-ch)8)\n print(sol)", "for _ in range(int(input())):\r\n s = input()\r\n curr = 0\r\n for i in range(len(s)):\r\n if(s[i].isdigit()):\r\n curr = curr + 32\r\n else:\r\n curr = curr + 8\r\n c = s[0]\r\n ans = s[0]\r\n count = 0\r\n d = dict()\r\n if(c.isdigit()):\r\n curr2 = 32\r\n else:\r\n curr2 = 8\r\n for i in range(len(s)):\r\n if(c ==s[i]):\r\n count +=1\r\n else:\r\n c = s[i]\r\n if(count!=1):\r\n ans = ans + str(count)\r\n curr2 += 32\r\n ans = ans + str(s[i])\r\n if(s[i].isdigit()):\r\n curr2 += 32\r\n else:\r\n curr2 += 8\r\n count = 1\r\n if(count!=1):\r\n ans = ans + str(count)\r\n curr2 += 32\r\n print(curr - curr2)\r\n\r\n\r\n\r\n\r\n", "t=int(input())\r\nfor i in range(t):\r\n s=input()\r\n l=len(s)\r\n sm=1\r\n total=0\r\n for j in range(1,l):\r\n if s[j-1]==s[j]:\r\n sm+=1\r\n else:\r\n if sm==1:\r\n total+=8\r\n else:\r\n total+=8\r\n total=total+32\r\n sm=1\r\n if s[j-1]==s[j]:\r\n sm+=1\r\n total+=8\r\n total=total+32\r\n else:\r\n if sm==1:\r\n total+=8\r\n else:\r\n total+=8\r\n total=total+32\r\n print(l8-total)", "t = int(input())\n\nwhile t:\n t -= 1\n string = input()\n l = len(string)\n temp = string[0]\n occ = 1\n\n pre = 0\n this = 0\n\n for i in range(1, l):\n if string[i] == temp:\n occ += 1\n else:\n if occ != 1:\n pre += occ * 8\n this += 40\n else:\n pre += 8\n this += 8\n occ = 1\n temp = string[i]\n if occ == 1:\n pre += 8\n this += 8\n else:\n pre += 8 * occ\n this += 40\n print(pre-this)\n\n", "# cook your dish here\nfor _ in range(int(input())):\n s=input()\n size1=8len(s)\n size2=8\n i=1\n while i<len(s):\n if s[i]==s[i-1]:\n while s[i]==s[i-1]:\n i+=1\n if i>=len(s):\n break\n size2+=32\n else:\n size2+=8\n i+=1\n print(size1-size2)", "# cook your dish here\nn = int(input())\nfor i in range(n):\n s = str(input())\n o_l = len(s)8\n n_l = 0\n t = 0\n for i in range(len(s)-1):\n if s[i] ==s[i+1]:\n t+=1\n else:\n if(t>=1):\n n_l += 32+8\n else:\n n_l += 8\n t = 0\n if(t>=1):\n n_l += 32+8\n else:\n n_l += 8\n print(o_l-n_l)\n", "# cook your dish here\ntemp=[]\nt=int(input())\nfor _ in range(t):\n s=input()\n l=list(s)\n x=len(l)8\n \n i=0\n y=0\n while i<(len(l)):\n count=0\n while i<(len(l)-1) and l[i]==l[i+1] :\n \n count+=1\n \n \n i+=1\n if count==0:\n y+=8\n else:\n y+=40\n i=i+1\n temp.append(x-y)\nfor i in temp:\n print(i)", "for _ in range(int(input())):\r\n s = input()\r\n curr = 0\r\n for i in range(len(s)):\r\n if(s[i].isdigit()):\r\n curr = curr + 32\r\n else:\r\n curr = curr + 8\r\n c = s[0]\r\n ans = s[0]\r\n count = 0\r\n d = dict()\r\n if(c.isdigit()):\r\n curr2 = 32\r\n else:\r\n curr2 = 8\r\n for i in range(len(s)):\r\n if(c ==s[i]):\r\n count +=1\r\n else:\r\n if(c.isdigit()):\r\n curr2 +=32\r\n else:\r\n curr2+=8\r\n c = s[i]\r\n if(count!=1):\r\n ans = ans + str(count)\r\n curr2 += 32\r\n ans = ans + str(s[i])\r\n count = 1\r\n if(count!=1):\r\n ans = ans + str(count)\r\n curr2 += 32\r\n print(curr - curr2)\r\n\r\n\r\n\r\n\r\n", "# cook your dish here\nt=int(input())\nwhile t>0:\n c=input()\n len1=len(c)\n sum1=0\n l=[]\n for i in range(len1):\n if c[i].isalpha():\n sum1+=8\n else:\n sum1+=32\n sum2=0\n l.append(c[0])\n q=1\n for i in range(1,len1):\n if c[i].isalpha():\n if c[i]==c[i-1]:\n q+=1 \n else:\n if q>1:\n l.append(q)\n l.append(c[i])\n q=1 \n else:\n if q>1:\n l.append(q)\n q=1 \n l.append(c[i])\n if c[len1-1].isalpha():\n if q>1:\n l.append(q)\n for i in l:\n if str(i).isalpha():\n sum2+=8 \n else:\n sum2+=32\n print(sum1-sum2)\n t-=1\n \n \n \n \n \n", "from collections import Counter\nfor _ in range(int(input())):\n S = list(map(str,input()))\n original = 8\n new = 0\n if S[0].isdigit():\n original = 32\n lst = [S[0]]\n lst1 = [1]\n \n b = 0\n for i in range(1, len(S)):\n if S[i].isdigit():\n original += 32\n else:\n original += 8\n \n if S[i]==lst[-1]:\n lst1[-1]+=1\n else:\n lst.append(S[i])\n lst1.append(1)\n \n for i in range(len(lst)):\n if lst[i].isdigit():\n if lst1[i] > 1:\n new += 64\n else:\n new += 32\n \n else:\n if lst1[i] > 1:\n new += 40\n else:\n new += 8\n \n print(original-new)", "from collections import Counter\nfor _ in range(int(input())):\n S = list(map(str,input()))\n original = 8\n new = 8\n if S[0].isdigit():\n original = 32\n new = 32\n a = S[0]\n b = 0\n for i in range(1, len(S)):\n if S[i].isdigit():\n original += 32\n else:\n original += 8\n \n if S[i]==a:\n b = 32\n else:\n new += b\n b = 0\n a = S[i]\n if S[i].isdigit():\n new += 32\n else:\n new += 8\n new += b\n print(original-new)", "try:\n for _ in range(int(input())):\n s=input()\n l=len(s)\n k=8l\n p=8\n t=0\n for i in range(1,l):\n if(s[i]==s[i-1]):\n if(t==0):\n p+=32\n t=1\n else:\n p+=8\n t=0\n print(k-p)\nexcept EOFError as e:\n pass", "# cook your dish here\ntest = int(input())\nfor t in range(test):\n s = input()\n prev = s[0]\n total = 0\n count = 0\n for i in s:\n if i == prev:\n count += 1\n else:\n if(count==0 or count == 1):\n total += 8\n else:\n total += 40\n count = 1\n prev = i\n \n if(s[len(s)-1] == s[len(s)-2]):\n total += 40\n else:\n total += 8\n #print(total)\n diff = (len(s)8) - (total)\n print(diff)", "from collections import Counter\nfor _ in range(int(input())):\n S = list(map(str,input()))\n original = 8\n new = 8\n if S[0].isdigit():\n original = 32\n new = 32\n a = S[0]\n b = 0\n for i in range(1, len(S)):\n if S[i].isdigit():\n original += 32\n new += 32\n else:\n original += 8\n if S[i]==a:\n b = 32\n else:\n new += b+8\n b = 0\n a = S[i]\n new +=b\n print(original-new)\n", "def fac(a):\r\n s=1\r\n for i in range(1,a+1):\r\n s=si\r\n return s\r\n\r\ndef prime(n):\r\n n=int(n)\r\n if(n==2 or n==3):\r\n return 1\r\n k=n*(1/2)\r\n for i in range(2,int(k)+2):\r\n if(n%i==0):\r\n return 0\r\n return 1\r\n\r\n\r\ndef sieve(n):\r\n arr=[]\r\n prime = [True for i in range(n+1)]\r\n p = 2\r\n while (p p <= n):\r\n if (prime[p] == True):\r\n for i in range(p * 2, n+1, p):\r\n prime[i] = False\r\n p += 1\r\n for p in range(2, n):\r\n if prime[p]:\r\n arr.append(p)\r\n return arr\r\n\r\n\r\n\r\n\r\nt=int(input())\r\n# n,m=[int(x) for x in input().split()]\r\n\r\nfor ii in range(t):\r\n s=input()\r\n prev=s[0]\r\n ss=[]\r\n c=1\r\n for i in s[1:]:\r\n if(i!=prev):\r\n if(c==1):\r\n ss.append('p'+prev)\r\n else:\r\n ss.append('p'+prev)\r\n ss.append(str(c))\r\n prev=i\r\n c=1\r\n else:\r\n c+=1\r\n\r\n if(c==1):\r\n ss.append('p'+prev)\r\n else:\r\n ss.append('p'+prev)\r\n ss.append(str(c))\r\n hah='0987654321'\r\n s1=0\r\n s2=0\r\n\r\n\r\n s1=8(len(s))\r\n for i in ss:\r\n if (i[0] in hah):\r\n s2 += 32\r\n else:\r\n s2 += 8\r\n # print(s,ss)\r\n print(s1-s2)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "# cook your dish here\r\nfrom sys import stdin, stdout\r\nimport math\r\nfrom itertools import permutations, combinations\r\nfrom collections import defaultdict\r\nfrom bisect import bisect_left \r\nfrom bisect import bisect_right\r\n \r\ndef L():\r\n return list(map(int, stdin.readline().split()))\r\n \r\ndef In():\r\n return list(map(int, stdin.readline().split()))\r\n \r\ndef I():\r\n return int(stdin.readline())\r\n \r\nP = 1000000007\r\ndef main():\r\n for t in range(I()):\r\n s = input()\r\n st = s[0]\r\n i = 1\r\n c1, c2 = 1, 0\r\n while i < len(s):\r\n if s[i] == s[i-1]:\r\n j = i \r\n c = 0\r\n while j < len(s) and s[j] == s[i-1]:\r\n c += 1 \r\n j += 1 \r\n if c != 0:\r\n c2 += 1\r\n i = j-1 \r\n st += str(c+1)\r\n else:\r\n st += s[i]\r\n c1 += 1\r\n i += 1 \r\n print(len(s)8 -(c18+c232))\r\n \r\ndef __starting_point():\r\n main()\r\n\n__starting_point()"]	{"inputs": [["1", "aaabb"]], "outputs": [["-40"]]}	INTERVIEW	PYTHON3	CODECHEF	14,656
d3f47586aa3538d20c1e09441c85e61f	UNKNOWN	Given an Array of length $N$ containing elements $Ai$ ( i = 1 to n ) . You have to handle $Q$ queries on this array . Each Query is of two types k=(1 or 2). Type 1:- $k$ $l$ $r$ in which you have to tell whether the product of numbers in range l to r results in a perfect square or not. if product of numbers in range $l$ to$r$ is a perfect square then simply output YES else output NO. Type 2:- $k$ $i$ $val$ Multiply the value present at index $i$ with $val$. Note#1: 1 based indexing in each query. Note#2: Values of prime factors of all numbers $val$ and $Ai$ is between 2 to 100 only. -----Input:----- - First line will contain $N$, denoting the size of the array. Then the next line follow. - N integers $Ai - An$. - Third line will contain $Q$, denoting the number of queries. Then the next $Q$ lines follow -description of each query. - Each query consists of either type 1 or type 2 and each query gives you three elements either -{$k$ $l$ $r$} or {$k$ $i$ $val$} -----Output:----- For each Query of Type 1 Output either "YES" or "NO" Without Quotes. -----Constraints----- - $1 \leq N \leq 20000$ - $1 \leq Q \leq 20000$ - $2 \leq Ai \leq 1000000$ - $1 \leq i ,l,r \leq N$ - $1 \leq val \leq 1000000$ - $1 \leq l \leq r$ -----Subtasks----- Subtask 1 :-40 points - Values of prime factors of all numbers $val$ and $Ai$ is between 2 to 40 only. Subtask 2 :- 60 points - Original Constraints -----Sample Input:----- 4 2 2 3 4 4 1 1 2 1 3 4 2 3 3 1 1 4 -----Sample Output:----- YES NO YES -----EXPLANATION:----- -Query 1 :- product of numbers in range 1 to 2=2 * 2=4 (perfect square so YES) -Query 2:- product of numbers in range 3 to 4 = 3 * 4 = 12 (not perfect square so NO) -Query 3:- multiply number at index3 with 3 so number at index 3= 33 = 9 . -Query 4:- product of numbers in range 1 to 4 = 2 2 * 9 * 4 = 144 (perfect square so YES)	["def update(index, value, bi_tree):\n while index < len(bi_tree):\n bi_tree[index] += value\n index += index & -index\n\n\ndef get_sum(index, bi_tree):\n ans = 0\n while index > 0:\n ans += bi_tree[index]\n index -= index & -index\n\n return ans\n\n\ndef get_range_sum(left, right, bi_tree):\n ans = get_sum(right, bi_tree) - get_sum(left - 1, bi_tree)\n return ans\n\n\ndef solve(x):\n s = set()\n res = 1\n i = 2\n while (i * i <= x):\n count = 0\n while (x % i == 0):\n x = x // i\n count += 1\n if (count % 2):\n s.add(i)\n i += 1\n if (x > 0):\n s.add(x)\n return s\n\n\nn = int(input())\nl = [0] + [int(i) for i in input().split()]\nbit = [[0 for i in range(n + 1)] for i in range(101)]\n\nfor i in range(1, n + 1):\n s = solve(l[i])\n for j in s:\n update(i, 1, bit[j])\n\nq = int(input())\nfor i in range(q):\n k, a, b = [int(i) for i in input().split()]\n if (k == 1):\n f = 1\n for i in range(2, 100):\n res = get_range_sum(a, b, bit[i])\n if (res % 2):\n f = 0\n break\n if (f):\n print(\"YES\")\n else:\n print(\"NO\")\n else:\n s = solve(b)\n for j in s:\n update(a, 1, bit[j])"]	{"inputs": [["4", "2 2 3 4", "4", "1 1 2", "1 3 4", "2 3 3", "1 1 4"]], "outputs": [["YES", "NO", "YES"]]}	INTERVIEW	PYTHON3	CODECHEF	1,131
1a606a3bc75555fbc61de8d1722960d9	UNKNOWN	Recently in JEC ants have become huge, the Principal is on a journey to snipe them !! Principal has limited $N$ practice Bullets to practice so that he can be sure to kill ants. - The Practice ground has max length $L$. - There is a Limit X such that if the bullet is fired beyond this, it will destroy and it wont be of any further use. - Bullet can be reused if fired in a range strictly less than X. He wants to find minimum number of shots taken to find the distance X by using $N$ bullets. -----Input:----- - First line will contain $T$, number of testcases. Then the testcases follow. - Each testcase contains of a single line of input, two integers $N, L$. -----Output:----- For each testcase, output in a single line answer the minimum number of shots to find the distance X. -----Constraints----- - $1 \leq T \leq 10$ - $2 \leq N,L \leq 100$ *N is always less than equal to square root of L -----Subtasks----- - 10 points : $ N = 1$ - 40 points : $ N = 2$ - 50 points : Original Constraints. -----Sample Input:----- 2 1 10 2 10 -----Sample Output:----- 10 4 -----EXPLANATION:----- - There is only single bullet which is to be fired from distance 1 to 10 to get the distance X so in the worst case it can take up to 10 shots to find the distance X. - there are 2 bullets and distance 10 meters suppose if distance X is 10 we can get to that by firing first bullet at 4 then 7 then 9 then at 10 it will break it took only 4 turns, and if the distance X was 3, we can get that by firing first bullet at 4 it will get destroyed than we use 2nd bullet at 1 , 2, 3 and 2nd bullet will also break it also took 4 turns. You can check for any position minimum number of turns will be at most 4.	["# cook your dish here\n\nfrom sys import stdin,stdout\nfrom collections import deque,defaultdict\nfrom math import ceil,floor,inf,sqrt,factorial,gcd,log\nfrom copy import deepcopy\nii1=lambda:int(stdin.readline().strip())\nis1=lambda:stdin.readline().strip()\niia=lambda:list(map(int,stdin.readline().strip().split()))\nisa=lambda:stdin.readline().strip().split()\nmod=1000000007\n\nfor _ in range(ii1()):\n n,l=iia()\n if n==1:\n print(l)\n elif n==2:\n print(int(log2(10))+1)\n else:\n print(ceil(l/(n+1)))\n", "# cook your dish here\nimport math\nt=int(input())\nwhile t>0:\n n,l=list(map(int,input().split()))\n if n==1:\n print(l)\n elif n==2:\n ans=(n-1)//2\n print(ans)\n \n t-=1", "import sys\ndef eggDrop(n, k): \n if (k == 1 or k == 0): \n return k \n \n if (n == 1): \n return k \n \n min = sys.maxsize \n\n for x in range(1, k + 1): \n \n res = max(eggDrop(n - 1, x - 1), \n eggDrop(n, k - x)) \n if (res < min): \n min = res \n \n return min + 1\nfor _ in range(int(input())):\n n,l = [int(i) for i in input().split()]\n if(n == 1):\n print(l)\n else:\n print(eggDrop(n,l))", "import sys\ndef eggDrop(n, k): \n if (k == 1 or k == 0): \n return k \n \n if (n == 1): \n return k \n \n min = sys.maxsize \n\n for x in range(1, k + 1): \n \n res = max(eggDrop(n - 1, x - 1), \n eggDrop(n, k - x)) \n if (res < min): \n min = res \n \n return min + 1\nfor _ in range(int(input())):\n n,l = [int(i) for i in input().split()]\n if(n == 1):\n print(l)\n else:\n print(eggDrop(l,n))", "def fac(a):\n s=1\n for i in range(1,a+1):\n s=si\n return s\n\ndef prime(n):\n n=int(n)\n if(n==2 or n==3):\n return 1\n k=n(1/2)\n for i in range(2,int(k)+2):\n if(n%i==0):\n return 0\n return 1\n\n\ndef sieve(n):\n arr=[]\n prime = [True for i in range(n+1)]\n p = 2\n while (p p <= n):\n if (prime[p] == True):\n for i in range(p * 2, n+1, p):\n prime[i] = False\n p += 1\n for p in range(2, n):\n if prime[p]:\n arr.append(p)\n return arr\n\n\n\n\nt=int(input())\n# n,m=[int(x) for x in input().split()]\n\nfor ii in range(t):\n n, m = [int(x) for x in input().split()]\n if(n==1):\n print(m)\n else:\n if(m%2==0):\n m-=1\n print(m//2)\n\n\n\n\n\n\n\n\n\n\n", "# cook your dish here\nimport math\nt=int(input())\nwhile t>0:\n n,l=list(map(int,input().split()))\n if n==1:\n print(l)\n elif n==2:\n ans=0\n while l>0:\n ans+=1 \n l=l//2\n print(ans)\n \n t-=1", "# cook your dish here\nt=int(input())\nwhile(t):\n t=t-1\n N,L = map(int,input().split())\n if N==1:\n print(L)\n elif N==2:\n z = (8L+1)0.5\n z= z - 1\n z=z/2\n if z-int(z)>0:\n print(int(z)+1)\n else:\n print(int(z))\n else:\n if L%N==0:\n print(L//N)\n else:\n print(1+(L//N))", "import math\nfor _ in range(int(input())):\n n,l = [int(i) for i in input().split()]\n if(n == 1):\n print(l)\n else:\n print(math.floor(l/(n+1)) + 1)", "# cook your dish here\nimport math\nt=int(input())\nwhile t>0:\n n,l=list(map(int,input().split()))\n if n==1:\n print(l)\n elif n==2:\n for i in range(1,101):\n if l//i==2:\n print(i)\n break\n \n t-=1", "# cook your dish here\ntry:\n t=int(input())\n for i in range (t):\n n,m=list(map(int,input().split()))\n if n==1:\n print(m)\n elif n==2:\n print((m//2)-1)\nexcept EOFError as e:\n pass\n", "T = int(input())\nfor _ in range(T):\n n, l = map(int,input().split())\n if n == 1:\n print(l)", "# cook your dish here\nimport math\nt=int(input())\nwhile t>0:\n n,l=list(map(int,input().split()))\n if n==1:\n print(l)\n elif n==2:\n ans=n2\n print(ans)\n \n t-=1", "# cook your dish here\nt=int(input())\nwhile(t):\n t=t-1\n N,L = map(int,input().split())\n if N==1:\n print(L)\n elif N==2:\n z = (8L+1)0.5\n z= z - 1\n z=z/2\n if z-int(z)>0:\n print(int(z)+1)\n else:\n print(int(z))\n else:\n print(\"Fuck me\")", "# cook your dish here\nimport math\nt=int(input())\nwhile t>0:\n n,l=list(map(int,input().split()))\n if n==1:\n print(l)\n elif n==2:\n ans=math.sqrt(l)\n k=int(ans)\n if kk==ans:\n print(k)\n else:\n print(k+1)\n \n t-=1", "# cook your dish here\ntest = int(input())\nfor t in range(test):\n n,l = input().split()\n n,l = int(n),int(l)\n if(n==1):\n print(l)\n elif(n==2):\n if(l%2==0):\n print((l//2)-1)\n else:\n print((l//2)-2)\n else:\n print((l//n) -1)", "# cook your dish here\ndef nextPowerOf2(n): \n count = 0; \n \n # First n in the below \n # condition is for the \n # case where n is 0 \n if (n and not(n & (n - 1))): \n return n \n \n while( n != 0): \n n >>= 1\n count += 1\n \n return 1 << count; \n \n \nT=int(input())\nfor i in range(0,T):\n N,L=list(map(int,input().split()))\n l=1\n j=Nl\n if(N==1):\n print(L)\n elif(N==2):\n n=nextPowerOf2(L)\n print(n)\n \n \n \n \n \n \n", "# cook your dish here\nimport math\nt=int(input())\nwhile t>0:\n n,l=list(map(int,input().split()))\n if n==1:\n print(l)\n elif n==2:\n ans=math.sqrt(l)\n k=int(ans)\n print(k+1)\n \n t-=1", "# cook your dish here\ndef nextPowerOf2(n): \n count = 0; \n \n # First n in the below \n # condition is for the \n # case where n is 0 \n if (n and not(n & (n - 1))): \n return n \n \n while( n != 0): \n n >>= 1\n count += 1\n \n return 1 << count; \n \n \nT=int(input())\nfor i in range(0,T):\n N,L=list(map(int,input().split()))\n l=1\n j=Nl\n if(N==1):\n print(L)\n elif(N==2):\n print(4)\n \n \n \n \n \n \n", "# cook your dish here\nt=int(input())\nwhile(t):\n t=t-1\n N,L = map(int,input().split())\n if N==1:\n print(L)\n elif N==2:\n z = (8L+1)0.5\n z= z - 1\n z=z/2\n z=int(z)\n print(z)\n else:\n print(\"Fuck me\")", "# cook your dish here\nfor _ in range(int(input())):\n n,l=map(int,input().split(\" \"))\n if(n==1):\n print(l)\n if(n==2):\n print((l//n)-1)", "# cook your dish here\ntest = int(input())\nfor t in range(test):\n n,l = input().split()\n n,l = int(n),int(l)\n if(n==1):\n print(l)\n elif(n==2):\n print((l//2)-1)\n else:\n print(l//n)", "# cook your dish here\nt=int(input())\nwhile(t):\n t=t-1\n N,L = map(int,input().split())\n if N==1:\n print(L)\n elif N==2:\n z = (8L+1)**0.5\n z= z - 1\n z=z/2\n z=int(z)\n print(z)\n else:\n print(\"Fuck me\")"]	{"inputs": [["2", "1 10", "2 10"]], "outputs": [["10", "4"]]}	INTERVIEW	PYTHON3	CODECHEF	6,204
836aacd6d510158ba409a322b600d612	UNKNOWN	Given an integer N. Integers A and B are chosen randomly in the range [1..N]. Calculate the probability that the Greatest Common Divisor(GCD) of A and B equals to B. -----Input----- The first line of the input contains an integer T denoting the number of test cases. The description of T test cases follows. Each test case consists of a single integer N on a separate line. -----Output----- For each test case, output a single line containing probability as an irreducible fraction. -----Example----- Input: 3 1 2 3 Output: 1/1 3/4 5/9 -----Constraints----- 1<=T<=103 1<=N<=109	["import math\nfor _ in range(int(input())):\n n=int(input())\n s=int(math.sqrt(n))\n ans=0\n for i in range(1,s+1):\n ans+=(n//i)\n ans=ans2-(ss)\n g=math.gcd(nn,ans)\n print(str(ans//g)+\"/\"+str(nn//g)) ", "from collections import defaultdict\nimport sys\nimport math as m\nimport random as rd\nimport bisect as b\n#import numpy as np\nimport time\nsys.setrecursionlimit(1000000)\n\n\ndef uno(): return int(sys.stdin.readline().strip())\n\n\ndef dos(): return sys.stdin.readline().strip()\n\n\ndef tres(): return list(map(int, sys.stdin.readline().strip().split()))\n\n\ndef cuatro(): return sys.stdin.readline().strip().split()\n\n################## CODE STARTS FROM HERE ######################\n\n\nfor _ in range(uno()):\n n = uno()\n ans, root = 0, m.floor(m.sqrt(n))\n for i in range(1, root+1):\n ans += n//i\n ans = ans+ans-rootroot\n a, b = ans//m.gcd(ans, nn), (nn)//m.gcd(ans, nn)\n print(str(a)+\"/\"+str(b))\n", "from collections import defaultdict\nimport sys\nimport math as m\nimport random as rd\nimport bisect as b\n#import numpy as np\nimport time\nsys.setrecursionlimit(1000000)\n\n\ndef uno(): return int(sys.stdin.readline().strip())\n\n\ndef dos(): return sys.stdin.readline().strip()\n\n\ndef tres(): return map(int, sys.stdin.readline().strip().split())\n\n\ndef cuatro(): return sys.stdin.readline().strip().split()\n\n################## CODE STARTS FROM HERE ######################\n\n\nfor _ in range(uno()):\n n = uno()\n ans, root = 0, m.floor(m.sqrt(n))\n for i in range(1, root+1):\n ans += n//i\n ans = ans+ans-rootroot\n a, b = ans//m.gcd(ans, nn), (nn)//m.gcd(ans, nn)\n print(str(a)+\"/\"+str(b))", "import math\n\ndef solve():\n n = int(input())\n num = 0\n\n denom = n * n\n s = int(math.sqrt(n))\n for i in range(1, s + 1):\n num += n//i\n\n num = (2 * num) - (s * s)\n k = math.gcd(num, denom)\n\n print(str(num//k) + \"/\" + str(denom//k)) \n\nt = int(input())\n\n\nfor tt in range(0, t):\n solve()", "import math\n\ndef solve():\n n = int(input())\n num = 0\n\n denom = n * n\n s = int(math.sqrt(n))\n for i in range(1, s + 1):\n num += n//i\n\n num = (2 * num) - (s * s)\n k = math.gcd(num, denom)\n\n print(str(num//k) + \"/\" + str(denom//k)) \n\nt = int(input())\n\n\nfor tt in range(0, t):\n solve()", "def gcd(a,b):\n if b==0: return a \n return gcd(b,a%b)\nfrom math import sqrt as S \nfor _ in range(int(input())):\n n=int(input())\n tot=nn\n s=0\n beta=int(S(n))\n for i in range(1,int(S(n))+1):\n s+=n//i \n s=2s-beta*beta \n g=gcd(s,tot)\n s=s//g \n tot=tot//g \n print(s,end='')\n print('/',end='')\n print(tot)\n "]	{"inputs": [["3", "1", "2", "3"]], "outputs": [["1/1", "3/4", "5/9"]]}	INTERVIEW	PYTHON3	CODECHEF	2,592
c8022aff577fb955ddb73dccbae51d31	UNKNOWN	The median of a sequence is the element in the middle of the sequence after it is sorted. For a sequence with even size, the median is the average of the two middle elements of the sequence after sorting. For example, for a sequence $A = [1, 3, 3, 5, 4, 7, 11]$, the median is equal to $4$, and for $A = [2, 3, 4, 5]$, the median is equal to $(3+4)/2 = 3.5$. Fulu is a famous programmer in his country. He wrote the following program (given in pseudocode) for finding the median in a sequence $A$ with length $N$: read(N) read(A[0], A[1], ..., A[N-1]) sort(A) # simultaneously remove elements A[K] and A[N mod K] from the array A # the order of the remaining N-2 elements is unchanged remove(A[K], A[N mod K]) return A[(N-2)/2] # integer division The program takes an integer $K$ as a parameter. Fulu can choose this integer arbitrarily between $1$ and $N-1$ inclusive. Little Lima, Fulu's friend, thinks Fulu's program is wrong (as always). As finding one counterexample would be an easy task for Lima (he has already found the sequence $A = [34, 23, 35, 514]$, which is a counterexample for any $K \le 3$), Lima decided to make hacking more interesting. Fulu should give him four parameters $S, K, m, M$ (in addition to $N$) and Lima should find the lexicographically smallest proper sequence $A$ with length $N$ as a counterexample. We say that a sequence $A$ with length $N$ ($0$-indexed) is proper if it satisfies the following conditions: - it contains only positive integers - $A_0 + A_1 +A_2 + \dots + A_{N-1} = S$ - $m \le A_i \le M$ for each $0 \le i < N$ - the number returned by Fulu's program, ran with the given parameter $K$, is different from the correct median of the sequence $A$ Can you help Lima find the lexicographically smallest counterexample or determine that Fulu's program works perfectly for the given parameters? -----Input----- - The first line of the input contains a single integer $T$ denoting the number of test cases. The description of $T$ test cases follows. - The first and only line of each test case contains five space-separated integers $N$, $S$, $K$, $m$ and $M$. -----Output----- For each test case, if there is no proper sequence, print a single line containing the integer $-1$; otherwise, print a single line containing $N$ space-separated integers — the lexicographically smallest proper sequence. -----Constraints----- - $1 \le T \le 8$ - $3 \le N \le 10^5$ - $1 \le K \le N-1$ - $1 \le S \le 10^9$ - $1 \le m \le M \le S$ -----Example Input----- 2 3 6 1 1 5 4 4 2 1 3 -----Example Output----- 1 1 4 -1 -----Explanation----- Example case 1: For the sequence $A = [1, 1, 4]$, it is already sorted, so the program would just remove the first two elements ($K=1$, $N\%K=0$) and return the only remaining element $4$. Obviously, the median of the original sequence is $1$. It can be shown that there is no lexicographically smaller proper sequence. Example case 2: The only possible sequence is $A = [1, 1, 1, 1]$, which is not proper, since Fulu's program will give the correct answer $1$ for it.	["# cook your dish here\n# cook your dish here\nimport numpy as np\nimport sys\n\ndef findSeq(n, s, k, m, M):\n midInd = n // 2\n seqs = []\n for ind in range(midInd + 2, midInd - 3, -1):\n if ind >= n or ind < 0:\n continue \n seq = genBestSeq(n, ind, m, M, s)\n if seq is not -1 and testSeq(k, seq):\n seqs.append(list(seq))\n if len(seqs) == 0:\n return -1\n return min(seqs)\n\n#def findSeq(n, s, k, m, M):\n# midInd = n // 2\n# if k <= midInd: #and (n % 2 == 1 or s < m * midInd + M * (n - midInd)):\n# return genBestSeq(n, midInd + 1, m, M, s) \n# elif k > midInd + 1 and n % 2 == 1:\n# return -1\n# return genBestSeq(n, midInd, m, M, s)\n\ndef genBestSeq(n, diffInd, m, M, s):\n #inc = M - m - 1\n arr = np.full((n,), m)\n arr[diffInd:] += 1\n #remainder = s - np.sum(arr)\n #if remainder < 0:\n # return -1\n\n #nFull, remainder = divmod(remainder, inc)\n #if nFull > n or (nFull == n and remainder > 0):\n # return -1\n\n #addingInd = n - nFull -1\n #arr[addingInd + 1:] += inc\n #arr[addingInd] += remainder\n #return arr\n s = s - np.sum(arr)\n if s < 0:\n return -1\n inc = M - m - 1\n ind = n - 1\n while (ind >= 0):\n z = min(inc, s)\n arr[ind] += z\n s -= z\n ind -= 1\n if s != 0:\n return -1\n return arr\n\ndef testSeq(k, seq):\n seq = sorted(seq)\n n = len(seq)\n if n % 2 == 1:\n median = seq[n // 2]\n else:\n median = (seq[n // 2 - 1] + seq[n // 2]) / 2\n seq.pop(n % k)\n seq.pop(k - 1)\n return (median != seq[(n - 2) // 2]) \n \n\ndef __starting_point():\n nCases = int(input())\n answers = []\n #ks = []\n for i in range(nCases):\n #nums = [int(val) for val in input().split()]\n #ks.append(nums[2])\n #answers.append(findSeq(nums))\n answers.append(findSeq((int(val) for val in input().split())))\n ans = answers[-1]\n if not isinstance(ans, int):\n print(ans, sep=' ')\n else:\n print(ans)\n #for i, ans in enumerate(answers):\n\n #for ans in answers:\n # if isinstance(ans, np.ndarray):\n # print(ans, sep=' ')\n # else:\n # print(ans)\n\n__starting_point()", "# cook your dish here\n# cook your dish here\nimport numpy as np\nimport sys\n\ndef findSeq(n, s, k, m, M):\n midInd = n // 2\n seqs = []\n for ind in range(midInd + 2, midInd - 3, -1):\n if ind >= n or ind < 0:\n continue \n seq = genBestSeq(n, ind, m, M, s)\n if seq is not -1 and testSeq(k, seq):\n seqs.append(list(seq))\n if len(seqs) == 0:\n return -1\n return min(seqs)\n\n#def findSeq(n, s, k, m, M):\n# midInd = n // 2\n# if k <= midInd: #and (n % 2 == 1 or s < m * midInd + M * (n - midInd)):\n# return genBestSeq(n, midInd + 1, m, M, s) \n# elif k > midInd + 1 and n % 2 == 1:\n# return -1\n# return genBestSeq(n, midInd, m, M, s)\n\ndef genBestSeq(n, diffInd, m, M, s):\n #inc = M - m - 1\n arr = np.full((n,), m)\n arr[diffInd:] += 1\n #remainder = s - np.sum(arr)\n #if remainder < 0:\n # return -1\n\n #nFull, remainder = divmod(remainder, inc)\n #if nFull > n or (nFull == n and remainder > 0):\n # return -1\n\n #addingInd = n - nFull -1\n #arr[addingInd + 1:] += inc\n #arr[addingInd] += remainder\n #return arr\n s = s - np.sum(arr)\n if s < 0:\n return -1\n inc = M - m - 1\n ind = n - 1\n while (ind >= 0):\n z = min(inc, s)\n arr[ind] += z\n s -= z\n ind -= 1\n if s != 0:\n return -1\n return arr\n\ndef testSeq(k, seq):\n seq = sorted(seq)\n n = len(seq)\n if n % 2 == 1:\n median = seq[n // 2]\n else:\n median = (seq[n // 2 - 1] + seq[n // 2]) / 2\n seq.pop(n % k)\n seq.pop(k - 1)\n return (median != seq[(n - 2) // 2]) \n \n\ndef __starting_point():\n nCases = int(input())\n answers = []\n #ks = []\n for i in range(nCases):\n #nums = [int(val) for val in input().split()]\n #ks.append(nums[2])\n #answers.append(findSeq(nums))\n answers.append(findSeq((int(val) for val in input().split())))\n ans = answers[-1]\n if not isinstance(ans, int):\n print(ans, sep=' ')\n else:\n print(ans)\n #for i, ans in enumerate(answers):\n\n #for ans in answers:\n # if isinstance(ans, np.ndarray):\n # print(ans, sep=' ')\n # else:\n # print(ans)\n\n__starting_point()", "# cook your dish here\nimport numpy as np\nimport sys\n\ndef findSeq(n, s, k, m, M):\n midInd = n // 2\n seqs = []\n for ind in range(midInd + 2, midInd - 3, -1):\n if ind >= n or ind < 0:\n continue \n seq = genBestSeq(n, ind, m, M, s)\n if seq is not -1 and testSeq(k, seq):\n seqs.append(list(seq))\n if len(seqs) == 0:\n return -1\n return min(seqs)\n\n#def findSeq(n, s, k, m, M):\n# midInd = n // 2\n# if k <= midInd: #and (n % 2 == 1 or s < m * midInd + M * (n - midInd)):\n# return genBestSeq(n, midInd + 1, m, M, s) \n# elif k > midInd + 1 and n % 2 == 1:\n# return -1\n# return genBestSeq(n, midInd, m, M, s)\n\ndef genBestSeq(n, diffInd, m, M, s):\n #inc = M - m - 1\n arr = np.full((n,), m)\n arr[diffInd:] += 1\n #remainder = s - np.sum(arr)\n #if remainder < 0:\n # return -1\n\n #nFull, remainder = divmod(remainder, inc)\n #if nFull > n or (nFull == n and remainder > 0):\n # return -1\n\n #addingInd = n - nFull -1\n #arr[addingInd + 1:] += inc\n #arr[addingInd] += remainder\n #return arr\n s = s - np.sum(arr)\n if s < 0:\n return -1\n inc = M - m - 1\n ind = n - 1\n while (ind >= 0):\n z = min(inc, s)\n arr[ind] += z\n s -= z\n ind -= 1\n if s != 0:\n return -1\n return arr\n\ndef testSeq(k, seq):\n seq = sorted(seq)\n n = len(seq)\n if n % 2 == 1:\n median = seq[n // 2]\n else:\n median = (seq[n // 2 - 1] + seq[n // 2]) / 2\n seq.pop(n % k)\n seq.pop(k - 1)\n return (median != seq[(n - 2) // 2]) \n \n\ndef __starting_point():\n nCases = int(input())\n answers = []\n #ks = []\n for i in range(nCases):\n #nums = [int(val) for val in input().split()]\n #ks.append(nums[2])\n #answers.append(findSeq(nums))\n answers.append(findSeq((int(val) for val in input().split())))\n ans = answers[-1]\n if not isinstance(ans, int):\n print(ans, sep=' ')\n else:\n print(ans)\n #for i, ans in enumerate(answers):\n\n #for ans in answers:\n # if isinstance(ans, np.ndarray):\n # print(ans, sep=' ')\n # else:\n # print(ans)\n\n__starting_point()", "# cook your dish here\nimport numpy as np\nimport sys\n\ndef findSeq(n, s, k, m, M):\n midInd = n // 2\n seqs = []\n for ind in range(midInd + 2, midInd - 3, -1):\n if ind >= n or ind < 0:\n continue \n seq = genBestSeq(n, ind, m, M, s)\n if seq is not -1 and testSeq(k, seq):\n seqs.append(list(seq))\n if len(seqs) == 0:\n return -1\n return min(seqs)\n\n#def findSeq(n, s, k, m, M):\n# midInd = n // 2\n# if k <= midInd: #and (n % 2 == 1 or s < m * midInd + M * (n - midInd)):\n# return genBestSeq(n, midInd + 1, m, M, s) \n# elif k > midInd + 1 and n % 2 == 1:\n# return -1\n# return genBestSeq(n, midInd, m, M, s)\n\ndef genBestSeq(n, diffInd, m, M, s):\n #inc = M - m - 1\n arr = np.full((n,), m)\n arr[diffInd:] += 1\n #remainder = s - np.sum(arr)\n #if remainder < 0:\n # return -1\n\n #nFull, remainder = divmod(remainder, inc)\n #if nFull > n or (nFull == n and remainder > 0):\n # return -1\n\n #addingInd = n - nFull -1\n #arr[addingInd + 1:] += inc\n #arr[addingInd] += remainder\n #return arr\n s = s - np.sum(arr)\n if s < 0:\n return -1\n inc = M - m - 1\n ind = n - 1\n while (ind >= 0):\n z = min(inc, s)\n arr[ind] += z\n s -= z\n ind -= 1\n if s != 0:\n return -1\n return arr\n\ndef testSeq(k, seq):\n seq = sorted(seq)\n n = len(seq)\n if n % 2 == 1:\n median = seq[n // 2]\n else:\n median = (seq[n // 2 - 1] + seq[n // 2]) / 2\n seq.pop(n % k)\n seq.pop(k - 1)\n return (median != seq[(n - 2) // 2]) \n \n\ndef __starting_point():\n nCases = int(input())\n answers = []\n #ks = []\n for i in range(nCases):\n #nums = [int(val) for val in input().split()]\n #ks.append(nums[2])\n #answers.append(findSeq(nums))\n answers.append(findSeq((int(val) for val in input().split())))\n ans = answers[-1]\n if not isinstance(ans, int):\n print(ans, sep=' ')\n else:\n print(ans)\n #for i, ans in enumerate(answers):\n\n #for ans in answers:\n # if isinstance(ans, np.ndarray):\n # print(ans, sep=' ')\n # else:\n # print(ans)\n\n__starting_point()", "import numpy as np\r\nimport sys\r\n\r\ndef findSeq(n, s, k, m, M):\r\n midInd = n // 2\r\n seqs = []\r\n for ind in range(midInd + 2, midInd - 3, -1):\r\n if ind >= n or ind < 0:\r\n continue \r\n seq = genBestSeq(n, ind, m, M, s)\r\n if seq is not -1 and testSeq(k, seq):\r\n seqs.append(list(seq))\r\n if len(seqs) == 0:\r\n return -1\r\n return min(seqs)\r\n\r\n#def findSeq(n, s, k, m, M):\r\n# midInd = n // 2\r\n# if k <= midInd: #and (n % 2 == 1 or s < m * midInd + M * (n - midInd)):\r\n# return genBestSeq(n, midInd + 1, m, M, s) \r\n# elif k > midInd + 1 and n % 2 == 1:\r\n# return -1\r\n# return genBestSeq(n, midInd, m, M, s)\r\n\r\ndef genBestSeq(n, diffInd, m, M, s):\r\n #inc = M - m - 1\r\n arr = np.full((n,), m)\r\n arr[diffInd:] += 1\r\n #remainder = s - np.sum(arr)\r\n #if remainder < 0:\r\n # return -1\r\n\r\n #nFull, remainder = divmod(remainder, inc)\r\n #if nFull > n or (nFull == n and remainder > 0):\r\n # return -1\r\n\r\n #addingInd = n - nFull -1\r\n #arr[addingInd + 1:] += inc\r\n #arr[addingInd] += remainder\r\n #return arr\r\n s = s - np.sum(arr)\r\n if s < 0:\r\n return -1\r\n inc = M - m - 1\r\n ind = n - 1\r\n while (ind >= 0):\r\n z = min(inc, s)\r\n arr[ind] += z\r\n s -= z\r\n ind -= 1\r\n if s != 0:\r\n return -1\r\n return arr\r\n\r\ndef testSeq(k, seq):\r\n seq = sorted(seq)\r\n n = len(seq)\r\n if n % 2 == 1:\r\n median = seq[n // 2]\r\n else:\r\n median = (seq[n // 2 - 1] + seq[n // 2]) / 2\r\n seq.pop(n % k)\r\n seq.pop(k - 1)\r\n return (median != seq[(n - 2) // 2]) \r\n \r\n\r\ndef __starting_point():\r\n nCases = int(input())\r\n answers = []\r\n #ks = []\r\n for i in range(nCases):\r\n #nums = [int(val) for val in input().split()]\r\n #ks.append(nums[2])\r\n #answers.append(findSeq(nums))\r\n answers.append(findSeq((int(val) for val in input().split())))\r\n ans = answers[-1]\r\n if not isinstance(ans, int):\r\n print(ans, sep=' ')\r\n else:\r\n print(ans)\r\n #for i, ans in enumerate(answers):\r\n\r\n #for ans in answers:\r\n # if isinstance(ans, np.ndarray):\r\n # print(ans, sep=' ')\r\n # else:\r\n # print(ans)\r\n\n__starting_point()", "import numpy as np\r\nimport sys\r\n\r\ndef findSeq(n, s, k, m, M):\r\n midInd = n // 2\r\n seqs = []\r\n for ind in range(midInd + 2, midInd - 3, -1):\r\n if ind >= n or ind < 0:\r\n continue \r\n seq = genBestSeq(n, ind, m, M, s)\r\n if seq is not -1 and testSeq(k, seq):\r\n seqs.append(list(seq))\r\n if len(seqs) == 0:\r\n return -1\r\n return min(seqs)\r\n\r\n#def findSeq(n, s, k, m, M):\r\n# midInd = n // 2\r\n# if k <= midInd: #and (n % 2 == 1 or s < m * midInd + M * (n - midInd)):\r\n# return genBestSeq(n, midInd + 1, m, M, s) \r\n# elif k > midInd + 1 and n % 2 == 1:\r\n# return -1\r\n# return genBestSeq(n, midInd, m, M, s)\r\n\r\ndef genBestSeq(n, diffInd, m, M, s):\r\n #inc = M - m - 1\r\n arr = np.full((n,), m)\r\n arr[diffInd:] += 1\r\n #remainder = s - np.sum(arr)\r\n #if remainder < 0:\r\n # return -1\r\n\r\n #nFull, remainder = divmod(remainder, inc)\r\n #if nFull > n or (nFull == n and remainder > 0):\r\n # return -1\r\n\r\n #addingInd = n - nFull -1\r\n #arr[addingInd + 1:] += inc\r\n #arr[addingInd] += remainder\r\n #return arr\r\n s = s - np.sum(arr)\r\n if s < 0:\r\n return -1\r\n inc = M - m - 1\r\n ind = n - 1\r\n while (ind >= 0):\r\n z = min(inc, s)\r\n arr[ind] += z\r\n s -= z\r\n ind -= 1\r\n if s != 0:\r\n return -1\r\n return arr\r\n\r\ndef testSeq(k, seq):\r\n seq = sorted(seq)\r\n n = len(seq)\r\n if n % 2 == 1:\r\n median = seq[n // 2]\r\n else:\r\n median = (seq[n // 2 - 1] + seq[n // 2]) / 2\r\n seq.pop(n % k)\r\n seq.pop(k - 1)\r\n return (median != seq[(n - 2) // 2]) \r\n \r\n\r\ndef __starting_point():\r\n nCases = int(input())\r\n answers = []\r\n #ks = []\r\n for i in range(nCases):\r\n #nums = [int(val) for val in input().split()]\r\n #ks.append(nums[2])\r\n #answers.append(findSeq(nums))\r\n answers.append(findSeq((int(val) for val in input().split())))\r\n ans = answers[-1]\r\n if not isinstance(ans, int):\r\n print(ans, sep=' ')\r\n else:\r\n print(ans)\r\n #for i, ans in enumerate(answers):\r\n\r\n #for ans in answers:\r\n # if isinstance(ans, np.ndarray):\r\n # print(ans, sep=' ')\r\n # else:\r\n # print(ans)\r\n\n__starting_point()", "import numpy as np\r\nimport sys\r\n\r\ndef findSeq(n, s, k, m, M):\r\n midInd = n // 2\r\n seqs = []\r\n for ind in range(midInd + 2, midInd - 3, -1):\r\n if ind >= n or ind < 0:\r\n continue \r\n seq = genBestSeq(n, ind, m, M, s)\r\n if seq is not -1 and testSeq(k, seq):\r\n seqs.append(list(seq))\r\n if len(seqs) == 0:\r\n return -1\r\n return min(seqs)\r\n\r\n#def findSeq(n, s, k, m, M):\r\n# midInd = n // 2\r\n# if k <= midInd: #and (n % 2 == 1 or s < m * midInd + M * (n - midInd)):\r\n# return genBestSeq(n, midInd + 1, m, M, s) \r\n# elif k > midInd + 1 and n % 2 == 1:\r\n# return -1\r\n# return genBestSeq(n, midInd, m, M, s)\r\n\r\ndef genBestSeq(n, diffInd, m, M, s):\r\n #inc = M - m - 1\r\n arr = np.full((n,), m)\r\n arr[diffInd:] += 1\r\n #remainder = s - np.sum(arr)\r\n #if remainder < 0:\r\n # return -1\r\n\r\n #nFull, remainder = divmod(remainder, inc)\r\n #if nFull > n or (nFull == n and remainder > 0):\r\n # return -1\r\n\r\n #addingInd = n - nFull -1\r\n #arr[addingInd + 1:] += inc\r\n #arr[addingInd] += remainder\r\n #return arr\r\n s = s - np.sum(arr)\r\n if s < 0:\r\n return -1\r\n inc = M - m - 1\r\n ind = n - 1\r\n while (ind >= 0):\r\n z = min(inc, s)\r\n arr[ind] += z\r\n s -= z\r\n ind -= 1\r\n if s != 0:\r\n return -1\r\n return arr\r\n\r\ndef testSeq(k, seq):\r\n seq = sorted(seq)\r\n n = len(seq)\r\n if n % 2 == 1:\r\n median = seq[n // 2]\r\n else:\r\n median = (seq[n // 2 - 1] + seq[n // 2]) / 2\r\n seq.pop(n % k)\r\n seq.pop(k - 1)\r\n return (median != seq[(n - 2) // 2]) \r\n \r\n\r\ndef __starting_point():\r\n nCases = int(input())\r\n answers = []\r\n #ks = []\r\n for i in range(nCases):\r\n #nums = [int(val) for val in input().split()]\r\n #ks.append(nums[2])\r\n #answers.append(findSeq(nums))\r\n answers.append(findSeq((int(val) for val in input().split())))\r\n ans = answers[-1]\r\n if not isinstance(ans, int):\r\n print(ans, sep=' ')\r\n else:\r\n print(ans)\r\n #for i, ans in enumerate(answers):\r\n\r\n #for ans in answers:\r\n # if isinstance(ans, np.ndarray):\r\n # print(ans, sep=' ')\r\n # else:\r\n # print(ans)\r\n\n__starting_point()", "import numpy as np\nimport sys\n\ndef findSeq(n, s, k, m, M):\n midInd = n // 2\n seqs = []\n for ind in range(midInd + 2, midInd - 3, -1):\n if ind >= n or ind < 0:\n continue \n seq = genBestSeq(n, ind, m, M, s)\n if seq is not -1 and testSeq(k, seq):\n seqs.append(list(seq))\n if len(seqs) == 0:\n return -1\n return min(seqs)\n\n#def findSeq(n, s, k, m, M):\n# midInd = n // 2\n# if k <= midInd: #and (n % 2 == 1 or s < m * midInd + M * (n - midInd)):\n# return genBestSeq(n, midInd + 1, m, M, s) \n# elif k > midInd + 1 and n % 2 == 1:\n# return -1\n# return genBestSeq(n, midInd, m, M, s)\n\ndef genBestSeq(n, diffInd, m, M, s):\n #inc = M - m - 1\n arr = np.full((n,), m)\n arr[diffInd:] += 1\n #remainder = s - np.sum(arr)\n #if remainder < 0:\n # return -1\n\n #nFull, remainder = divmod(remainder, inc)\n #if nFull > n or (nFull == n and remainder > 0):\n # return -1\n\n #addingInd = n - nFull -1\n #arr[addingInd + 1:] += inc\n #arr[addingInd] += remainder\n #return arr\n s = s - np.sum(arr)\n if s < 0:\n return -1\n inc = M - m - 1\n ind = n - 1\n while (ind >= 0):\n z = min(inc, s)\n arr[ind] += z\n s -= z\n ind -= 1\n if s != 0:\n return -1\n return arr\n\ndef testSeq(k, seq):\n seq = sorted(seq)\n n = len(seq)\n if n % 2 == 1:\n median = seq[n // 2]\n else:\n median = (seq[n // 2 - 1] + seq[n // 2]) / 2\n seq.pop(n % k)\n seq.pop(k - 1)\n return (median != seq[(n - 2) // 2]) \n \n\ndef __starting_point():\n nCases = int(input())\n answers = []\n #ks = []\n for i in range(nCases):\n #nums = [int(val) for val in input().split()]\n #ks.append(nums[2])\n #answers.append(findSeq(nums))\n answers.append(findSeq((int(val) for val in input().split())))\n ans = answers[-1]\n if not isinstance(ans, int):\n print(ans, sep=' ')\n else:\n print(ans)\n #for i, ans in enumerate(answers):\n\n #for ans in answers:\n # if isinstance(ans, np.ndarray):\n # print(ans, sep=' ')\n # else:\n # print(ans)\n\n__starting_point()"]	{"inputs": [["2", "3 6 1 1 5", "4 4 2 1 3", ""]], "outputs": [["1 1 4", "-1"]]}	INTERVIEW	PYTHON3	CODECHEF	19,124
e4307da7b5ae872452ed840363efbba5	UNKNOWN	Shashank is playing a game with his friends. There are n sticks located in a row at points $a_1,a_2, ...,a_n$. Each stick has a height- $h_i$. A person can chop a stick down, after which it takes over one of the regions [$a_i$ - $h_i$, $a_i$] or [$a_i$, $a_i$ + $h_i$]. The stick that is not chopped remains at the point $a_i$. A person can chop a stick in a particular direction if the region to be taken up by the chopped stick does not overlap with an already existing point. The winner $($s$)$ of the game will be one or more people who can answer the question: What is the maximum number of sticks that can be chopped? Shashank wants to win the game and hence he needs needs your help in finding out what is the maximum number of sticks that can be chopped down. -----Input:----- - The first line of each input contains a single integer n. - n lines follow. Each of the n lines contain a pair of integers: $a_i,h_i$. -----Output:----- Output in a single line answer- the maximum number of sticks that can be chopped down. -----Constraints----- - $1 \leq n \leq 10^5$ - $1 \leq a_i,h_i \leq 10^9$ - The pairs are given in the order of ascending $a_i$. No two sticks are located at the same point. -----Sample Input 1:----- 5 1 2 2 1 5 10 10 9 19 1 -----Sample Input 2:----- 5 1 2 2 1 5 10 10 9 20 1 -----Sample Output 1:----- 3 -----Sample Output 2:----- 4 -----EXPLANATION:----- In the first example you can fell the sticks as follows: - chop the stick 1 to the left — now it will take over the region $[ - 1;1]$ - chop the stick 2 to the right — now it will take over the region $[2;3]$ - spare the stick 3— it will take over the point $5$ - spare the stick 4— it will take over the point $10$ - chop the stick 5 to the right — now it will take over the region $[19;20]$	["# cook your dish here\nn=int(input())\ncounts=dict()\nz=0\nupper=None\nfor i in range(0,n):\n a,h= [int(num) for num in input().split()]\n counts[a]=h\nfor key,count in counts.items():\n c=0\n x=key-count\n y=key+count\n c1=0\n c2=0\n for j in counts.keys():\n if j==key:\n continue\n else:\n if x<=j<=key:\n c1=0\n break\n else:\n c1=1\n for j in counts.keys():\n if j==key:\n continue\n else:\n if key<=j<=y:\n c2=0\n break\n else:\n c2=1\n if c2==0 and c1==1:\n if upper is None:\n z=z+c1\n upper=key\n else:\n if x>=upper:\n z=z+c1\n upper=key\n else:\n z=z+c2\n upper=key\n elif c2==1 and c1==0:\n if upper is None:\n z=z+c2\n upper=y\n else:\n if upper<=key:\n z=z+c2\n upper=y\n else:\n z=z+c1\n upper=y\n elif c2==1 and c1==1:\n if upper is None:\n z=z+c1\n upper=key\n else:\n if x>=upper:\n z=z+c1\n upper=key\n else:\n if upper<=key:\n z=z+c2\n upper=y\n else:\n z=z+0\n upper=y\n else:\n z=z+0\n upper=key\nif len(counts)==1:\n print(1)\nelse:\n print(z)", "l=[]\nn=int(input())\nfor i in range(n):\n l.append(list(map(int,input().split())))\nif(n==1):\n print(1)\nelse:\n c=2\n for i in range(1,n-1):\n if(l[i][0]-l[i][1]>l[i-1][0]):\n c=c+1\n elif(l[i][0]+l[i][1]<l[i+1][0]):\n l[i][0]+=l[i][1]\n c=c+1\n print(c)\n", "# cook your dish here\n#Coding is about expressing your feeling and\n#there is always a better way to express your feeling _Deepak\nimport sys\n# sys.stdin=open('input.txt','r')\n# sys.stdout=open('output.txt','w')\nfrom sys import stdin,stdout\nfrom collections import deque,defaultdict\nfrom math import ceil,floor,inf,sqrt,factorial,gcd,log2\nfrom copy import deepcopy\nii1=lambda:int(stdin.readline().strip())\nis1=lambda:stdin.readline().strip()\niia=lambda:list(map(int,stdin.readline().strip().split()))\nisa=lambda:stdin.readline().strip().split()\nmod=1000000007\n# s=is1()\n# n = len(s)\n# count,res,flag,subans=1,0,0,1\n# subcount=0\n# for i in range(0,n-1):\n# if s[i]=='c' or s[i]=='k':\n# flag=1\n# break\n# if s[i]==s[i+1] and (s[i]=='f' or s[i]=='g'):\n# count+=1\n# elif count>1:\n# subans=(count(count-1))//2\n# count=1\n# subcount+=1\n# if s[-1]=='c' or s[-1]=='k':\n# flag=1\n# elif count>1:\n# subans=(count(count-1))//2\n# subcount+=1\n# if flag:\n# print(0)\n# else:\n# res=(1<<(subcount-1))\n# res=subans\n# print(res%mod)\nn = ii1()\narr=[None]n\nfor ii in range(n):\n arr[ii]=iia()\ncount=2\nif n==1 or n==2:\n print(n)\nelse:\n flag=[0]n\n flag[0]=-1\n flag[-1]=1\n for i in range(1,n-1):\n if flag[i-1]==-1:\n if arr[i][0]-arr[i-1][0]>arr[i][1]:\n flag[i] =- 1\n count += 1\n elif arr[i+1][0]-arr[i][0]>arr[i][1]:\n flag[i] = 1\n count += 1\n elif flag[i-1]==1:\n if arr[i][0]-(arr[i-1][0]+arr[i-1][1])>arr[i][1]:\n flag[i]=-1\n count += 1\n elif arr[i+1][0]-arr[i][0]>arr[i][1]:\n flag[i]=1\n count += 1\n else:\n if arr[i][0]-arr[i-1][0]>arr[i][1]:\n flag[i]=-1\n count+=1\n elif arr[i+1][0]-arr[i][0]>arr[i][1]:\n flag[i]=1\n count+=1\n print(count)\n\n\n\n", "n=int(input())\na=list(range(n))\nh=list(range(n))\nm=2\nfor i in range(n):\n a[i],h[i]=[int(s) for s in input().split()]\nif n<3:\n m=n\nelse:\n for j in range(1,n-1):\n if a[j]-h[j]>a[j-1]:\n m+=1\n elif a[j]+h[j]<a[j+1]:\n m+=1\n a[j]=a[j]+h[j]\n else:\n continue\n\nprint(m)\n", "# cook your dish here\nn = int(input())\nl = []\nfor i in range(n):\n a, h = map(int,input().split())\n l.append([a,h])\nif len(l)==1:\n print(1)\n return\np = l[0][0]\ncount = 2\nfor i in range(1,len(l)-1):\n if l[i][0]-l[i][1]>p:\n p = l[i][0]\n count+=1\n elif l[i][0]+l[i][1]<l[i+1][0]:\n p = l[i][0]+l[i][1]\n count+=1\n else:\n p = l[i][0]\nprint(count)", "n = int(input())\nres = []\nfor _ in range(n):\n res.append(list(map(int, input().split())))\nif n == 1:\n print(1)\n return\nif n == 2:\n print(2)\n return\nstart = 2\nfor i in range(1, n - 1):\n #first check left\n if (res[i][0] - res[i][1]) > res[i - 1][0]:\n #print(res[i])\n #print(abs(res[i][0] - res[i][1]))\n #print(res[i - 1][0])\n start += 1\n continue\n #check right\n if res[i][0] + res[i][1] < res[i + 1][0]:\n #print(res[i], res[i])\n res[i][0] += res[i][1]\n start += 1\n continue\nprint(start)", "# cook your dish here\nn=int(input())\nlist1=[]\nlist2=[]\nfor i in range(n):\n a,h=list(map(int,input().split()))\n list1.append(a)\n list2.append(h)\ncount=2\nfor j in range(1,n-1):\n k=list1[j]-list2[j]\n if k>list1[j-1]:\n count+=1\n else:\n z=list1[j]+list2[j]\n if z<list1[j+1]:\n count+=1\n list1[j]=list2[j]+list1[j]\nif n==1:\n print('1')\nelse:\n print(count)", "n= int(input())\nco =[]\nhi=[]\nfor i in range(n):\n arr=[int(x) for x in input().split()]\n co.append(arr[0])\n hi.append(arr[-1])\n \nif n<=2:\n count=n\nelse:\n count=2\n for i in range(1,n-1):\n if hi[i]<co[i]-co[i-1]:\n count+=1\n elif hi[i]<co[i+1]-co[i]:\n count+=1\n co[i]+=hi[i]\n else:\n continue\nprint(count)", "from sys import\ninput= stdin.readline\nn=int(input())\nt=[]\nfor i in range(n):\n a,b=list(map(int,input().split()))\n t.append([a,b])\nif(n==1):\n c=1\nelse:\n c=2 #first tree to left and last tree to right\nfor i in range(1,n-1):\n l = t[i][0]-t[i-1][0]\n r = t[i+1][0] - t[i][0]\n h = t[i][1]\n if(h<l):\n c+=1\n elif(h<r):\n c+=1\n t[i][0]=t[i][0]+h\nprint(c)\n", "n=int(input())\nans=2\n\na=[]\nfor i in range(n):\n a.append(list(map(int,input().split())))\nif(n==1):\n print(1)\n return\nvector=a[0][0]\nfor i in range(1,n-1):\n if(a[i][0]-a[i][1]>vector):\n ans+=1\n vector=a[i][0]\n\n else:\n if(a[i][0]+a[i][1]<a[i+1][0]):\n ans+=1\n vector=a[i][0]+a[i][1]\n else:\n vector=a[i][0]\n \n\n \n \nprint(ans)\n\n \n", "n=int(input())\nl=[]\nfor _ in range(n):\n a,h=map(int,input().split())\n l.append([a,h])\nans=2\nif n==1:\n ans=1\n print(ans)\n return\nl[0].append(\"left\")\nl[n-1].append(\"right\")\nfor i in range(1,n-1):\n if l[i-1][2]==\"right\":\n if abs(l[i][0]-(l[i-1][1]+l[i-1][0]))>l[i][1]:\n ans+=1\n l[i].append(\"left\")\n elif abs(l[i][0]-l[i+1][0])>l[i][1]:\n ans+=1\n l[i].append(\"right\")\n else:\n l[i].append(\"stand\")\n else:\n if abs(l[i][0]-l[i-1][0])>l[i][1]:\n ans+=1\n l[i].append(\"left\")\n elif abs(l[i][0]-l[i+1][0])>l[i][1]:\n ans+=1\n l[i].append(\"right\")\n else:\n l[i].append(\"stand\")\nprint(ans)", "from math import inf as inf\nfrom math import \nfrom collections import \nimport sys\nfrom itertools import permutations\n#input=sys.stdin.readline\nn=int(input())\nr=[]\nfor i in range(n):\n a,h=list(map(int,input().split()))\n r.append([a,h])\ns=2\nif(n==1):\n print(1)\n return\nprev=-10000000000000\nfor i in range(1,n-1):\n prev=max(r[i-1][0],prev)\n nex=r[i+1][0]\n if(r[i][0]-r[i][1]>prev):\n s+=1\n elif(r[i][0]+r[i][1]<nex):\n s+=1\n prev=r[i][0]+r[i][1]\nprint(s)\n", "t = int(input())\nlistt = []\nans = 2\n\nfor x in range(t):\n a,b = map(int,input().split())\n listt.append([a,b])\n \ni = 1\n\nwhile i+1<t:\n if listt[i][0] - listt[i][1] > listt[i-1][0]:\n ans = ans+1\n elif listt[i][0] + listt[i][1] < listt[i+1][0]:\n ans = ans+1\n listt[i][0] = listt[i][0]+listt[i][1]\n \n i = i+1\nif t == 1:\n print('1')\nelse:\n print(ans)", "n=int(input())\nl=[]\nfor i in range(n):\n l.append(list(map(int,(input().split()))))\nans=0\nfor i in range(n):\n if i==0:\n ans+=1\n elif i==n-1:\n ans+=1\n else:\n if l[i][0]-l[i][1]>l[i-1][0]:\n ans+=1\n else:\n if l[i][0]+l[i][1]<l[i+1][0]:\n ans+=1\n l[i][0] = l[i][0]+l[i][1]\nprint(ans)\n \n", "n = int(input())\nmainlist = []\nchoppedlist = []\nfor i in range(0,n):\n mainlist.append(input().split())\n\nfor i in range(0,n):\n mainlist[i][0] = int(mainlist[i][0])\n mainlist[i][1] = int(mainlist[i][1])\n\n# print('typeis ',type(mainlist[0][0]))\n\ndef checkifpossible(mainlist, sublist, right, pos):\n # print('sublist is ', sublist)\n # print('mainlist is ', mainlist)\n returncode = True\n\n if right:\n for i in range(pos+1, n):\n # print('at right value of m and s are ', mainlist[i][0], ' ', \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0sublist[1])\n if mainlist[i][0] <= sublist[1]:\n returncode = False\n else:\n for i in range(0, pos):\n # print('value of m and s are ', mainlist[i][0], ' ', sublist[0])\n if mainlist[i][0] >= sublist[0]:\n # print('setting to False')\n returncode = False\n for j in range(0,len(choppedlist)):\n if choppedlist[j][1] >= sublist[0] and not right:\n # print('overlapping chopped list')\n returncode = False\n\n return returncode\n\n\ndef choptreetoright(mainlist, pos):\n nonlocal choppedlist\n sublist = []\n sublist.append(mainlist[pos][0])\n sublist.append(mainlist[pos][0] + mainlist[pos][1])\n right = True\n\n if checkifpossible(mainlist, sublist, right, pos) == True:\n choppedlist.append(sublist)\n return True\n else:\n return False\n\ndef choptreetoleft(mainlist, pos):\n nonlocal choppedlist\n sublist = []\n sublist.append(mainlist[pos][0] - mainlist[pos][1])\n sublist.append(mainlist[pos][0])\n right = False\n if checkifpossible(mainlist, sublist, right, pos) == True:\n choppedlist.append(sublist)\n return True\n else:\n return False\n\nif n >= 2:\n counter = 2\nelif n == 1:\n counter = 1\nelse:\n counter = 0\n\nfor i in range (1, n-1):\n # print('calling left with i ', i)\n if choptreetoleft(mainlist, i):\n counter = counter + 1\n continue\n # print('calling right with i ', i)\n if choptreetoright(mainlist, i):\n counter = counter + 1\n\n# print('chopped list ', choppedlist)\nprint(counter)", "n = int(input())\nmainlist = []\nchoppedlist = []\nfor i in range(0,n):\n mainlist.append(input().split())\n\nfor i in range(0,n):\n mainlist[i][0] = int(mainlist[i][0])\n mainlist[i][1] = int(mainlist[i][1])\n\n# print('typeis ',type(mainlist[0][0]))\n\ndef checkifpossible(mainlist, sublist, right, pos):\n # print('sublist is ', sublist)\n # print('mainlist is ', mainlist)\n returncode = True\n\n if right:\n for i in range(pos+1, n):\n # print('at right value of m and s are ', mainlist[i][0], ' ', \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0sublist[1])\n if mainlist[i][0] <= sublist[1]:\n returncode = False\n else:\n for i in range(0, pos):\n # print('value of m and s are ', mainlist[i][0], ' ', sublist[0])\n if mainlist[i][0] >= sublist[0]:\n # print('setting to False')\n returncode = False\n for j in range(0,len(choppedlist)):\n if choppedlist[j][1] >= sublist[0] and not right:\n # print('overlapping chopped list')\n returncode = False\n\n return returncode\n\n\ndef choptreetoright(mainlist, pos):\n nonlocal choppedlist\n sublist = []\n sublist.append(mainlist[pos][0])\n sublist.append(mainlist[pos][0] + mainlist[pos][1])\n right = True\n\n if checkifpossible(mainlist, sublist, right, pos) == True:\n choppedlist.append(sublist)\n return True\n else:\n return False\n\ndef choptreetoleft(mainlist, pos):\n nonlocal choppedlist\n sublist = []\n sublist.append(mainlist[pos][0] - mainlist[pos][1])\n sublist.append(mainlist[pos][0])\n right = False\n if checkifpossible(mainlist, sublist, right, pos) == True:\n choppedlist.append(sublist)\n return True\n else:\n return False\n\nif n >= 2:\n counter = 2\nelif n == 1:\n counter = 1\nelse:\n counter = 0\n\nfor i in range (1, n-1):\n # print('calling left with i ', i)\n if choptreetoleft(mainlist, i):\n counter = counter + 1\n continue\n # print('calling right with i ', i)\n if choptreetoright(mainlist, i):\n counter = counter + 1\n\n# print('chopped list ', choppedlist)\nprint(counter)", "# cook your dish here\nn = int(input())\na = [list(map(int,input().split())) for _ in range(n)]\na = a + [ (float('inf'), -1) ]\n\nc = 0\n_w = a[0][0]\nfor i in range(1,len(a)):\n if a[i][0] - a[i][1] > _w:\n c += 1\n _w = a[i][0]\n elif a[i][0] + a[i][1] < a[i+1][0]:\n c += 1\n _w = a[i][0] + a[i][1]\n else:\n _w = a[i][0]\n\nprint(c)\n\n", "# cook your dish here\nn = int(input())\na,h=[],[]\narr = [list(map(int,input().split())) for i in range(n)]\narr = sorted(arr,key=lambda i:i[0])\nfor i in arr:\n k,m = i\n a.append(k)\n h.append(m)\nif n==1 or n==2:\n print(n)\nelse:\n count,chopped=2,0\n for i in range(1,n-1):\n if a[i]-a[i-1]>h[i] and chopped ==0:\n count+=1\n elif chopped ==1 and a[i]-a[i-1]-h[i-1]>h[i]:\n chopped=0\n count+=1\n elif a[i+1]-a[i]>h[i]:\n count+=1\n chopped=1\n else:\n chopped=0\n print(count)\n", "import numpy as np\nn = int(input())\narr = np.empty((n,2),dtype=int)\nfor i in range(n):\n x = list(map(int,input().split()))\n arr[i]=x\nflag = 'l'\nif(n==1):\n ans=1\nelse:\n ans=2\nfor i in range(1,n-1):\n curr = arr[i]\n pre = arr[i-1]\n next = arr[i+1]\n if(flag=='l'):\n cn_l = curr[0]-curr[1]\n cn_r = curr[0]+curr[1]\n if(cn_l>pre[0]):\n flag='l'\n ans+=1\n elif(cn_r<next[0]):\n flag='r'\n ans+=1\n elif(flag=='r'):\n cn_l = curr[0] - curr[1]\n cn_r = curr[0] + curr[1]\n pre_r = pre[0] + pre[1]\n if(cn_l > pre_r):\n flag = 'l'\n ans+=1\n elif(cn_r < next[0]):\n flag='r'\n ans+=1\nprint(ans)\n", "\nn=int(input())\nsticks=[]\ncount=2\n\nfor i in range(n):\n inn=input().split(' ')\n sticks.append([int(inn[0]),int(inn[1])])\nif len(sticks)<2:\n print(len(sticks))\n return\narea=[[sticks[0][0]-sticks[0][1],sticks[0][0]],\n\n[sticks[-1][0],sticks[-1][0]+sticks[-1][1]]\n\n]\n\n# print(sticks)\n# print(area)\nfor i in sticks:\n area.append([i[0],i[0]])\ndef check(aa,hh):\n a=aa-hh\n h=aa\n flag=0\n for i in area:\n if i==[aa,aa]:\n continue\n if i[0]==i[1] and a<=i[0] and h>=i[0]:\n flag=-1\n break\n if a<=i[0] and h>=i[0]:\n \n flag=-1\n break\n if a<=i[0] and h>=i[1]:\n \n flag=-1\n break\n if a<=i[1] and h>=i[1]:\n \n flag=-1\n break\n if a>=i[0] and h<=i[1]:\n \n flag=-1\n break\n if flag==0:\n return [a,h]\n flag=1\n a=aa\n h=aa+hh\n for i in area:\n if i==[aa,aa]:\n continue\n if i[0]==i[1] and a<=i[0] and h>=i[0]:\n flag=-1\n break\n if a<=i[0] and h>=i[0]:\n \n flag=-1\n break\n if a<=i[0] and h>=i[1]:\n \n flag=-1\n break\n if a<=i[1] and h>=i[1]:\n \n flag=-1\n break\n if a>=i[0] and h<=i[1]:\n \n flag=-1\n break\n if flag==1:\n return [a,h]\n return -1\n\n\nfor i in sticks[1:-1]:\n temp=check(i[0],i[1])\n \n if temp==-1:\n continue\n count+=1\n area.append(temp)\n\nprint(count)\n\n\n \n\n", "n=int(input())\nah=[]\nfor _ in range(n):\n cach=list(map(int,input().split()))\n ah.append(cach)\nah.sort(key=lambda x:x[0])\n#print(ah)\nlmit=-2(10*9)\nchop=0\nfor i in range(n-1):\n a=ah[i][0]-ah[i][1]\n b=ah[i][0]\n c=ah[i][0]\n d=ah[i][0]+ah[i][1]\n if b<ah[i+1][0] and a>lmit:\n lmit=b\n chop+=1\n #print(\"first\")\n elif d<ah[i+1][0] and c>lmit:\n #print(\"sec\",a,b,c,d,lmit,ah[i+1][0])\n lmit=d\n chop+=1\n #print(\"sec\")\n else:\n lmit=b\n #print(lmit)\nprint(chop+1)\n", "n = int(input())\n\nl = []\nlc = False\nc = 0\n\nfor i in range(n):\n a, h = list(map(int, input().split()))\n\n l.append([a, h])\n\n if i == 0:\n c += 1\n lc = True\n continue\n\n if lc:\n if a - l[-2][0] <= h:\n lc = False\n\n else:\n c += 1\n lc = True\n\n continue\n\n if a - l[-2][0] > l[-2][1]:\n c += 1\n l[-2][0] += l[-2][1]\n l[-2][1] = 0\n\n if a - l[-2][0] <= h:\n lc = False\n else:\n c += 1\n lc = True\n\nif not lc:\n c += 1\n\nprint(c)\n", "# cook your dish here\nn = int(input())\n\noccupy = [float(\"-inf\")]\nheight = [0]\npos = [float(\"-inf\")]\n\nfor i in range(n):\n p,h = list(map(int, input().split()))\n pos.append(p)\n height.append(h)\n occupy.append(p)\n\npos.append(float(\"inf\"))\nheight.append(0)\noccupy.append(float(\"inf\"))\n\nsol = 0\nfor i in range(1,n+1):\n if pos[i]-height[i] > occupy[i-1]:\n sol +=1\n elif pos[i]+height[i] < occupy[i+1]:\n sol +=1\n occupy[i] = pos[i]+height[i]\n \nprint(sol)\n \n \n\n", "# cook your dish here\nn=int(input())\nout=[0]\ndp=[[float(\"-inf\"),float(\"-inf\"),float(\"-inf\")]]\nfor _ in range(n):\n x=list(map(int,input().split()))\n x=[x[0]-x[1],x[0],x[0]+x[1]]\n dp.append(x)\ndp.append([float(\"inf\"),float(\"inf\"),float(\"inf\")])\nfor i in range(1,len(dp)-1):\n if dp[i-1][2]<dp[i][0]:\n dp[i][2]=dp[i][1]\n out.append(out[-1]+1)\n elif dp[i][2]<dp[i+1][1]:\n out.append(out[-1]+1)\n else:\n dp[i]=[dp[i][1],dp[i][1],dp[i][1]]\n out.append(out[-1])\nprint(out[-1])\n \n\n"]	{"inputs": [["5", "1 2", "2 1", "5 10", "10 9", "19 1", "Sample Input 2:", "5", "1 2", "2 1", "5 10", "10 9", "20 1"]], "outputs": [["3", "Sample Output 2:", "4"]]}	INTERVIEW	PYTHON3	CODECHEF	16,547
cfbc27c1b216dda6841e6eaa7a6b914e	UNKNOWN	To help Lavanya learn all about binary numbers and binary sequences, her father has bought her a collection of square tiles, each of which has either a 0 or a 1 written on it. Her brother Nikhil has played a rather nasty prank. He has glued together pairs of tiles with 0 written on them. Lavanya now has square tiles with 1 on them and rectangular tiles with two 0's on them, made up of two square tiles with 0 stuck together). Thus, she can no longer make all possible binary sequences using these tiles. To amuse herself, Lavanya has decided to pick a number $N$ and try and construct as many binary sequences of length $N$ as possible using her collection of tiles. For example if $N$ = 1, she can only make the sequence 1. For $N$=2, she can make 11 and 00. For $N$=4, there are 5 possibilities: 0011, 0000, 1001, 1100 and 1111. Lavanya would like you to write a program to compute the number of arrangements possible with $N$ tiles so that she can verify that she has generated all of them. Since she cannot count beyond 15746, it is sufficient to report this number modulo 15746. -----Input:----- A single line with a single integer $N$. -----Output:----- A single integer indicating the number of binary sequences of length $N$, modulo 15746, that Lavanya can make using her tiles. -----Constraints:----- You may assume that $N \leq$ 1000000. -----Sample Input:----- 4 -----Sample Output:----- 5 -----Explanation:----- This corresponds to the example discussed above.	["n=int(input())\nmodulo=15746\nnum=[1,1]\nfor i in range(2,n+1):\n num.append((num[i-1]+num[i-2])%modulo)\nprint(num[n])", "def EXEC(n):\r\n if n < 3: return n\r\n else:\r\n x, y = 1, 2\r\n for _ in range(2, n):\r\n z = (x + y) % 15746\r\n x, y = y, z\r\n return y % 15746\r\n\r\n\r\nprint(EXEC(int(input())))", "def fib(n):\r\n s1,s2=1,2\r\n if n==1:\r\n return s1\r\n elif n==2:\r\n return s2\r\n else:\r\n for i in range(2,n):\r\n s3=(s1+s2)%15746\r\n s1=s2\r\n s2=s3\r\n return s2%15746\r\n\r\ntry:\r\n n=int(input())\r\n z=fib(n)\r\n print(z)\r\n \r\nexcept:\r\n pass", "\r\n# // Problem : Zero One Tiles\r\n# // Contest : CodeChef - IARCS OPC Judge Problems\r\n# // URL : https://www.codechef.com/IARCSJUD/problems/TILES01\r\n# // Memory Limit : 256 MB\r\n# // Time Limit : 1000 ms\r\n# // Powered by CP Editor (https://github.com/cpeditor/cpeditor)\r\n\r\ndp = [None]*1000010\r\ndp[0] = 0\r\ndp[1] = 1\t\r\nMOD = 15746\r\nn = int(input())\r\nfor i in range(2,n+2):\r\n\tdp[i] = (dp[i-1]+dp[i-2])%MOD\r\nprint(dp[n+1])", "n=int(input())\r\na,b=1,2\r\nif n==1 :\r\n print(1)\r\nelif n==2 :\r\n print(2)\r\nelse :\r\n for i in range (3 , n+1) :\r\n c=(a+b)%15746\r\n a=b\r\n b=c\r\n print(c%15746)", "n = int(input())\r\n\r\nl1 = 1\r\nl2 = 1\r\n\r\nans = 0\r\n\r\nif(n == 0):\r\n ans = 0\r\nelif(n == 1):\r\n ans = 1\r\nelif(n == 2):\r\n ans = 2\r\nelse:\r\n ans = 2\r\n for i in range(3,n+1):\r\n ans = ans % 15746\r\n k = l2 \r\n l2 = ans\r\n l1 = k\r\n ans = l1 + l2\r\n\r\nans = ans % 15746\r\n \r\nprint(ans)", "\r\n'''def abcd(n):\r\n x=(1+math.sqrt(5))/2\r\n y=(1-math.sqrt(5))/2\r\n \r\n val=((power(x, n, 15746)-power(y, n, 15746))//math.sqrt(5))\r\n return(int(val))'''\r\n \r\ndef main():\r\n n=int(input())\r\n #x=abcd(n+1)\r\n a=1; b=2;\r\n if(n==1):\r\n print(1)\r\n elif(n==2):\r\n print(2)\r\n else:\r\n for i in range(3, n+1):\r\n temp=(a+b)%15746\r\n a=b%15746\r\n b=temp%15746\r\n \r\n print(temp%15746)\r\n #print(power(0.55, 67, 1355))\r\n \r\nmain()"]	{"inputs": [["4"]], "outputs": [["5"]]}	INTERVIEW	PYTHON3	CODECHEF	2,329
9aa1ff9c7a9b31c162bca56de8c5374d	UNKNOWN	The chef is playing a game of long distance. Chef has a number K and he wants to find the longest distance between the index of the first and the last occurrence of K in a given array of N numbers. -----Input:----- - First-line will contain $T$, the number of test cases. Then the test cases follow. - Each test case contains two lines of input. - Next line with Two integers in one line $K, N$. - Next line with $N$ space-separated integers. -----Output:----- For each test case, output in a single line answer as the index of first and last occurrence of K in the given array. Note: Here Indexing is from 1 not 0 based. -----Constraints----- - $1 \leq T \leq 100$ - $1 \leq k \leq 10^5$ - $1 \leq N \leq 10^5$ -----Sample Input:----- 2 2 6 2 3 4 2 1 6 4 6 2 3 4 2 1 6 -----Sample Output:----- 3 0 -----EXPLANATION:----- For 1) Index of First and last occurrence of 2 in the given array is at 1 and 4, i.e. distance is 3. For 2) 4 occurs only once in the given array hence print 0.	["# cook your dish here\nfor _ in range(int(input())):\n m,n=list(map(int,input().split()))\n a=[int(i) for i in input().split()]\n l=-1\n for i in range(n-1,-1,-1):\n if a[i]==m:\n l=i\n break\n f=-1\n for i in range(0,n):\n if a[i]==m:\n f=i\n break\n print(l-f)\n \n \n", "# cook your dish here\nt=int(input())\nfor _ in range(t):\n k,n=map(int,input().split())\n l=list(map(int,input().split())) \n f=-1\n s=-1\n for i in range(n):\n if l[i]==k:\n f=i \n break \n for i in range(n-1,-1,-1):\n if l[i]==k:\n s=i\n break \n if f==-1 or s==-1:\n print(0) \n else:\n s+=1 \n f+=1\n print(s-f)", "# cook your dish here\nfor t in range(int(input())):\n k,n=map(int, input().split())\n a=list(map(int, input().split()))[:n]\n lst=[]\n for i in range(n):\n if a[i]==k:\n lst.append(i)\n if len(lst)>0:\n print(max(lst)-min(lst))\n else:\n print(0)", "# cook your dish here\nT = int(input())\n\nfor t in range(T):\n K,N = map(int,input().split())\n data = list(map(int,input().split()))\n \n first = -1\n \n for i in range(len(data)):\n if(data[i]==K):\n first = i\n break\n \n second = -1\n \n for i in range(len(data)-1,first,-1):\n if(data[i]==K):\n second = i\n break\n \n if(first == -1 or second == -1):\n print(0)\n else:\n print(second-first)", "# cook your dish here\nT = int(input())\n\nfor t in range(T):\n K,N = map(int,input().split())\n data = list(map(int,input().split()))\n \n first = -1\n \n for i in range(len(data)):\n if(data[i]==K):\n first = i\n break\n \n second = -1\n \n for i in range(len(data)-1,first,-1):\n if(data[i]==K):\n second = i\n break\n \n if(first == -1 or second == -1):\n print(0)\n else:\n print(second-first)", "from sys import stdin, stdout\r\ninput = stdin.readline\r\nfrom collections import defaultdict as dd\r\nimport math\r\ndef geti(): return list(map(int, input().strip().split()))\r\ndef getl(): return list(map(int, input().strip().split()))\r\ndef gets(): return input()\r\ndef geta(): return int(input())\r\ndef print_s(s): stdout.write(s+'\\n')\r\n\r\ndef solve():\r\n for _ in range(geta()):\r\n m,n=geti()\r\n a=getl()\r\n l=s=0\r\n for i in range(n):\r\n if a[i]==m:\r\n s=i\r\n break\r\n for i in range(n-1,-1,-1):\r\n if a[i]==m:\r\n l=i\r\n break\r\n print(l-s)\r\n\r\ndef __starting_point():\r\n solve()\r\n\n__starting_point()", "T = int(input())\r\n\r\nfor t in range(T):\r\n K,N = map(int,input().split())\r\n data = list(map(int,input().split()))\r\n \r\n first = -1\r\n \r\n for i in range(len(data)):\r\n if(data[i]==K):\r\n first = i\r\n break\r\n \r\n second = -1\r\n \r\n for i in range(len(data)-1,first,-1):\r\n if(data[i]==K):\r\n second = i\r\n break\r\n \r\n if(first == -1 or second == -1):\r\n print(0)\r\n else:\r\n print(second-first)"]	{"inputs": [["2", "2 6", "2 3 4 2 1 6", "4 6", "2 3 4 2 1 6"]], "outputs": [["3", "0"]]}	INTERVIEW	PYTHON3	CODECHEF	3,482
6b94b63ef40ecd0ba43a3634abedbef4	UNKNOWN	Vasya's older brother, Petya, attends an algorithm course in his school. Today he learned about matchings in graphs. Formally, a set of edges in a graph is called a matching if no pair of distinct edges in the set shares a common endpoint. Petya instantly came up with an inverse concept, an antimatching. In an antimatching, any pair of distinct edges should have a common endpoint. Petya knows that finding a largest matching in a graph is a somewhat formidable task. He wonders if finding the largest antimatching is any easier. Help him find the number of edges in a largest antimatching in a given graph. -----Input:----- The first line contains T$T$, number of test cases per file. The first line of each test case contains two integers n$n$ and m−$m-$ the number of vertices and edges of the graph respectively (1≤n≤104$1 \leq n \leq 10^4$, 0≤m≤104$0 \leq m \leq 10^4$). The next m$m$ lines describe the edges. The i$i$-th of these lines contains two integers ui$u_i$ and vi−$v_i-$ the indices of endpoints of the i$i$-th edge (1≤ui,vi≤n$1 \leq u_i, v_i \leq n$, ui≠vi$u_i \neq v_i$). It is guaranteed that the graph does not contain self-loops nor multiple edges. It is not guaranteed that the graph is connected. -----Output:----- Print a single number per test case −$-$ the maximum size of an antichain in the graph. -----Constraints----- - 1≤T≤10$1 \leq T \leq 10$ - 1≤n≤104$1 \leq n \leq 10^4$ - 0≤m≤104$0 \leq m \leq 10^4$ - 1≤ui,vi≤n$1 \leq u_i, v_i \leq n$ - ui≠vi$u_i \neq v_i$ -----Sample Input:----- 3 3 3 1 2 1 3 2 3 4 2 1 2 3 4 5 0 -----Sample Output:----- 3 1 0 -----EXPLANATION:----- In the first sample all three edges form an antimatching. In the second sample at most one of the two edges can be included in an antimatching since they do not share common endpoints. In the third sample there are no edges, hence the answer is 0$0$.	["def detect_triangle(adj): \n for x in range(len(adj)):\n for y in adj[x]:\n if not set(adj[x]).isdisjoint(adj[y]):\n return True\n\n \nfor _ in range(int(input())):\n n,m=list(map(int,input().split()))\n graph=[[] for i in range(n)]\n for i in range(m):\n u,v=list(map(int,input().split()))\n graph[u-1].append(v-1)\n graph[v-1].append(u-1)\n h=[] \n for i in range(len(graph)):\n h.append(len(graph[i]))\n h1=max(h) \n if h1>=3:\n print(h1)\n continue\n if detect_triangle(graph):\n print(3)\n continue\n print(h1) # cook your dish here\n", "# cook your dish here\ndef detect_triangle(adj): \n for x in range(len(adj)):\n for y in adj[x]:\n if not set(adj[x]).isdisjoint(adj[y]):\n return True\n\n \nfor _ in range(int(input())):\n n,m=map(int,input().split())\n graph=[[] for i in range(n)]\n for i in range(m):\n u,v=map(int,input().split())\n graph[u-1].append(v-1)\n graph[v-1].append(u-1)\n h=[] \n for i in range(len(graph)):\n h.append(len(graph[i]))\n h1=max(h) \n if h1>=3:\n print(h1)\n continue\n if detect_triangle(graph):\n print(3)\n continue\n print(h1) ", "# cook your dish here\ndef detect_triangle(adj): \n for x in range(len(adj)):\n for y in adj[x]:\n if not set(adj[x]).isdisjoint(adj[y]):\n return True\n\n \nfor _ in range(int(input())):\n n,m=map(int,input().split())\n graph=[[] for i in range(n)]\n for i in range(m):\n u,v=map(int,input().split())\n graph[u-1].append(v-1)\n graph[v-1].append(u-1)\n h=[] \n for i in range(len(graph)):\n h.append(len(graph[i]))\n h1=max(h) \n if h1>=3:\n print(h1)\n continue\n if detect_triangle(graph):\n print(3)\n continue\n print(h1) ", "def detect_triangle(adj): \n for x in range(len(adj)):\n for y in adj[x]:\n if not set(adj[x]).isdisjoint(adj[y]):\n return True\n\n \nfor _ in range(int(input())):\n n,m=list(map(int,input().split()))\n graph=[[] for i in range(n)]\n for i in range(m):\n u,v=list(map(int,input().split()))\n graph[u-1].append(v-1)\n graph[v-1].append(u-1)\n h=[] \n for i in range(len(graph)):\n h.append(len(graph[i]))\n h1=max(h) \n if h1>=3:\n print(h1)\n continue\n if detect_triangle(graph):\n print(3)\n continue\n print(h1) \n", "import sys\n#sys.stdin = open(\"i\",\"r\")\n\nfor _ in range( int(input()) ):\n\n n, m = list(map(int, input().split()))\n adj = [ [] for _ in range(n+1) ]\n\n for _ in range(m):\n src, dest = list(map(int, input().split()))\n adj[src].append(dest)\n adj[dest].append(src)\n\n print(( max( max( [len(a) for a in adj] ) , 3 \\\n if any( not set(adj[x]).isdisjoint(adj[y]) \\\n for x in range(len(adj)) for y in adj[x] ) \\\n else max( [len(a) for a in adj] ) ) ))\n"]	{"inputs": [["3", "3 3", "1 2", "1 3", "2 3", "4 2", "1 2", "3 4", "5 0"]], "outputs": [["3", "1", "0"]]}	INTERVIEW	PYTHON3	CODECHEF	2,979
454db7c33a5976ae5fde2997905fe196	UNKNOWN	Chef got in the trouble! He is the king of Chefland and Chessland. There is one queen in Chefland and one queen in Chessland and they both want a relationship with him. Chef is standing before a difficult choice… Chessland may be considered a chessboard with $N$ rows (numbered $1$ through $N$) and $M$ columns (numbered $1$ through $M$). Let's denote a unit square in row $r$ and column $c$ by $(r, c)$. Chef lives at square $(X, Y)$ of this chessboard. Currently, both queens are living in Chessland too. Each queen, when alone on the chessboard, can see all squares that lie on the same row, column or diagonal as itself. A queen from $(x_q, y_q)$ cannot see a square $(r, c)$ if the square $(X, Y)$ is strictly between them. Of course, if the queens can see each other, the kingdom will soon be in chaos! Help Chef calculate the number of possible configurations of the queens such that the kingdom will not be in chaos. A configuration is an unordered pair of distinct squares $(x_{q1}, y_{q1})$ and $(x_{q2}, y_{q2})$ such that neither of them is the square $(X, Y)$. Two configurations are different if the position of queen $1$ is different or the position of queen $2$ is different. -----Input----- - The first line of the input contains a single integer $T$ denoting the number of test cases. The description of $T$ test cases follows. - The first and only line of each test case contains four space-separated integers $N$, $M$, $X$ and $Y$. -----Output----- For each test case, print a single line containing one integer — the number of configurations such that the kingdom will not be in chaos. -----Constraints----- - $1 \le T \le 1000$ - $1 \le X \le N \le 10^2$ - $1 \le Y \le M \le 10^2$ - $2 \le N, M$ -----Example Input----- 2 3 3 2 2 4 4 2 3 -----Example Output----- 24 94 -----Explanation----- Example case 1: Half of these configurations are: - $(1, 1), (3, 3)$ - $(1, 1), (2, 3)$ - $(1, 1), (3, 2)$ - $(1, 2), (3, 3)$ - $(1, 2), (3, 2)$ - $(1, 2), (3, 1)$ - $(1, 3), (3, 1)$ - $(1, 3), (3, 2)$ - $(1, 3), (2, 1)$ - $(2, 1), (2, 3)$ - $(2, 1), (1, 3)$ - $(2, 1), (3, 3)$	["def C(n):\n return n(n-1)//2\n\n\ndef sol():\n equal, mini = False, min(N,M)\n total_ways = 2C(N * M)\n if N==M:\n equal = True\n ways = 0\n if not equal:\n ways = (NC(M)+MC(N))\n diag = 0\n for i in range(2, mini+1):\n diag += 2C(i)\n for i in range(mini+1,max(N,M)):\n diag += C(mini)\n diag = 2\n ways += diag\n ways = 2\n else:\n ways = (NC(M)+MC(N))\n diag = 0\n for i in range(2, mini):\n diag += 2C(i)\n diag += C(mini)\n diag = 2\n ways += diag\n ways =2\n safe = total_ways - ways\n l, r, t, d = Y-1, M-Y, X-1, N-X\n safe_add, to_remove = 0, 0\n\n for i in range(1,N+1):\n for j in range(1, M+1):\n if i==X or j==Y or abs(i-X)==abs(j-Y):\n continue\n else:\n to_remove += 1\n\n if l>0 and r>0 and t>0 and d>0:\n dtl, dtr, dbl, dbr = min(l,t), min(r,t), min(l,d), min(r,d)\n safe_add += dtldbr2 + dtrdbl2\n safe_add += td2\n safe_add += lr2\n elif l>0 and r>0:\n safe_add += lr2\n elif t>0 and d>0:\n safe_add += td2\n\n safe += safe_add - to_remove2\n\n return safe\n\n\nT = int(input())\nfor _ in range(T):\n N, M, X, Y = [int(x) for x in input().split()]\n print(sol())", "\ndef solve(N,M,x,y):\n n,m=min(N,M),max(N,M)\n\n count = ((n-1)n(2n-1)//3 + (m-n+1)n2 ) 2 ## total sum of l_d and \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0r_d at all places\n p1,p2 = min(x-1,y-1),min(N-x,M-y)\n r1,r2 = min(M-y,x-1),min(N-x,y-1)\n #print('-->',p1,p2,r1,r2)\n count += (n+m)nm ## total sum of places queen 2 cannt have at all cells \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0including kings cell\n #print('1',count)\n\n count -= p1+p2+r1+r2 + n+m + 2 ## place occupied by king cannot be \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0occupied by queen\n #print('2',count)\n \n count += (nm)-(p1+p2+r1+r2 + n + m -1) ## total count where queen 2 cannot \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0come\n #print('3',count)\n\n count -= (nm-1)3 ## total count where queen 2 cannot come where centre is \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0counted once\n #print('4',count)\n tot = (nm-1)nm - count\n #print(tot)\n tot += 2(p1p2 + r1r2 + (x-1)(N-x) + (y-1)(M-y))\n\n return tot\n \n\nfor _ in range(int(input())):\n\n n,m,x,y = list(map(int,input().split()))\n print(solve(n,m,x,y))\n", "def ncr(n, r): \n if n < r :\n return 0\n elif r == 2:\n return(n(n-1)/2)\n elif r == 1:\n return n\n else:\n t = 0\n\nt = int(input())\nfor p in range(t):\n n,m,x,y = input().split()\n n,m,x,y = int(n),int(m),int(x),int(y)\n\n maxi = ncr(nm-1,2)\n\n sub1 = ncr(n,2) (m-1)\n sub2 = ncr(m,2) * (n-1)\n maxi = maxi - (sub1 + sub2)\n #print(maxi)\n\n sub3 = ncr(y-1,2) + ncr(m-y,2)\n sub4 = ncr(x-1,2) + ncr(n-x,2)\n #print(sub3,sub4)\n maxi = maxi - (sub3 + sub4)\n #print(maxi)\n\n if n < m:\n temp = n\n diff = m-n\n else:\n temp = m\n diff = n-m\n\n sub5 = 0\n sub6 = 0\n for i in range(2,temp):\n sub5 += ncr(i,2)\n\n for j in range(diff+1):\n sub6 += ncr(temp,2)\n\n sub5 = 4\n sub6 = 2\n\n #print(sub5,sub6)\n maxi = maxi - (sub5 + sub6)\n #print(maxi)\n\n l1 = min(n-x,y-1)\n l2 = min(m-y,x-1)\n maxi = maxi + l1 + l2 + (l1l2)\n\n\n l3 = min(x-1,y-1)\n l4 = min(m-y,n-x)\n maxi = maxi + l3 + l4 + (l3l4)\n\n print(int(maxi*2))\n\n\n\n\n"]	{"inputs": [["2", "3 3 2 2", "4 4 2 3"]], "outputs": [["24", "94"]]}	INTERVIEW	PYTHON3	CODECHEF	3,259
26ac5951eecc0558de4dbf241c860a0b	UNKNOWN	2021 was approaching and the world was about to end. So 2 gods Saurabhx and Saurabhy (from Celesta) created the Cyberverse. But this time disappointed with humans both the gods decided not to have humans in this world. So they created a world of cyborgs. A world without humans. Isn’t it interesting? So let us dive into the cyberverse and have a look at their problems. There are $N$ kid cyborgs with Chief Cyborg '100gods' and he has $K$ weapons with him. He wants to distribute those $K$ weapons among $N$ kid cyborgs. Since all the kid cyborgs are very good friends, so they set a rule among themselves for taking those weapons. The rule states that the difference between kid cyborg having the maximum weapons and the kid cyborg having minimum weapons should be less than or equal to $1$. Find the value of the minimum number of weapons a kid cyborg can have when all the $K$ weapons are distributed among them. -----Input:----- - The first line contains an integer $T$, denoting the number of test cases. - Each of the next $T$ lines will contain two space-separated integers denoting $N$ and $K$ respectively. -----Output:----- - For each test case ,output a single line containing an integer $X$ denoting the minimum number of weapons a kid cyborg can have in that test case. -----Constraints:----- - $1 \leq T \leq 10^5$ - $1 \leq N \leq 10^5$ - $1 \leq K \leq 10^9$ -----Sample Input:----- 1 5 8 -----Expected Output:----- 1 -----Explanation----- - There are $5$ kids and $8$ weapons. - Hence we will distribute the weapons such that $3$ kids have $2$ weapons each and the remaining $2$ kids have $1$ weapon each. - Hence the minimum number of weapons a kid cyborg has is $1$. ( That is, $min(1,2)$ = $1$ )	["# cook your dish here\nt=int(input())\nfor i in range(t):\n (n,k)=tuple(map(int,input().split()))\n print(k//n)", "# cook your dish here\nt=int(input())\nfor _ in range(t):\n n,k=map(int,input().split())\n print(k//n)", "# cook your dish here\nt=int(input())\nfor i in range(0,t):\n s=input().split(\" \")\n k=list(map(int,s))\n print(k[1]//k[0])", "for i in range(int(input())):\n x,y=list(map(int,input().split()))\n print(y//x)\n", "for _ in range(int(input())):\n n,k=list(map(int,input().split()))\n print(k//n)\n", "t=input()\nt=int(t)\nwhile t!=0 :\n inp=input().split(\" \")\n inp=[int(x) for x in inp]\n print(int(inp[1]/inp[0]))\n t-=1", "# cook your dish here\nfor i in range(int(input())):\n k,w=map(int,input().split())\n if k>w:\n print(0)\n else:\n print(w//k)", "for i in range(int(input())):\n k,w=list(map(int,input().split()))\n c=0\n if k>w:\n print(0)\n \n else:\n print(w//k)\n", "for _ in range(int(input())):\n N, K = map(int, input().split())\n print(K // N)", "# cook your dish here\nfor t in range(int(input())):\n n,k=[int(x)for x in input().rstrip().split()]\n print(k//n)\n", "import math\nt=int(input())\nfor i in range(t):\n n,x=map(int,input().split())\n print(math.floor(x/n))", "t=int(input())\nfor a in range(t):\n (a,b)=map(int,input().split())\n import math\n print(math.floor(b/a))", "t=int(input())\nfor a in range(t):\n (a,b)=map(int,input().split())\n import math\n print(math.floor(b/a))", "# cook your dish here\nfor i in range(int(input())):\n NUMBER=input().split()\n CYBER_KIDS=int(NUMBER[0])\n WEAPONS=int(NUMBER[1])\n count=0\n if WEAPONS<CYBER_KIDS:\n print(count)\n else:\n count=WEAPONS//CYBER_KIDS\n print(count)", "# cook your dish here\nfor t in range(int(input())):\n n,k = map(int,input().split())\n print(k//n)", "# cook your dish here\nfor _ in range(int(input())):\n n,k=map(int,input().split())\n print(k//n)", "# cook your dish here\nt=int(input())\nfor _ in range(t):\n a,b=list(map(int,input().split()))\n print(int(b/a))\n", "for k in range(int(input())):\n a,b=map(int,input().split())\n print(b//a) ", "T = int(input())\nfor i in range(T):\n N,K = (int(x) for x in input().split())\n if N>K:\n print(0)\n else:\n print(K//N)\n \n", "for _ in range(int(input())):\n n,k=map(int,input().split())\n if n<=k:\n div=k//n\n rem=k%n\n if rem: \n maxx=div+1\n minn=div\n else: \n maxx=div\n minn=div\n else:\n maxx=1\n minn=0\n print(minn)", "for _ in range(int(input())):\n n,k=map(int,input().split())\n if n<=k:\n div=k//n\n rem=k%n\n if rem: \n maxx=div+1\n minn=div\n else: \n maxx=div\n minn=div\n else:\n maxx=1\n minn=0\n print(minn)", "# cook your dish here\nfor _ in range(int(input())):\n n,k=map(int,input().split())\n k1=k//n \n print(k1)", "# cook your dish here\nt=int(input())\nfor _ in range(t):\n n,k=map(int,input().split())\n k1=k//n \n print(k1)", "# cook your dish here\nt=int(input())\nfor _ in range(t):\n n,k=list(map(int,input().split()))\n k1=k//n \n print(k1)\n", "# cook your dish here\nt=int(input())\nfor _ in range(t):\n n,k=list(map(int,input().split()))\n k1=k//n \n k2=k-(k1*n)\n print(k1)\n"]	{"inputs": [["1", "5 8"]], "outputs": [["1"]]}	INTERVIEW	PYTHON3	CODECHEF	3,126
23dc1dec94f19037b403ceeccd854435	UNKNOWN	Zonal Computing Olympiad 2015, 29 Nov 2014 We say that two integers x and y have a variation of at least K, if \|x − y\| ≥ K (the absolute value of their difference is at least K). Given a sequence of N integers a1,a2,...,aN and K, the total variation count is the number of pairs of elements in the sequence with variation at least K, i.e. it is the size of the set of pairs {(i,j)\|1≤i<j≤N and\|ai−aj\|≥K} For example if K = 1 and the sequence is 3,2,4 the answer is 3. If K = 1 and the sequence is 3, 1, 3 then the answer is 2. Your task is to write a program that takes a sequence and the value K as input and computes the total variation count. -----Input format----- The first line contains two positive integers N and K, separated by a space. This is followed by a line containing N integers separated by space giving the values of the sequence. -----Output format----- A single integer in a single line giving the total variation count. -----Test data----- You may assume that all integers in the input are in the range 0 to 10^8 inclusive. Subtask 1 (40 marks) : 1 ≤ N ≤ 4000, 1 ≤ K ≤ 10^8 Subtask 2 (60 marks) : 1 ≤ N ≤ 65000, 1 ≤ K ≤ 10^8 -----Sample Input----- 3 1 3 1 3 -----Sample Output----- 2	["n,k=[int(x) for x in input().split()]\r\na=[int(x) for x in input().split()]\r\nans=0\r\nfor i in range(n-1):\r\n for j in range(i+1,n):\r\n if(abs(a[i]-a[j])>=k):\r\n ans+=1\r\nprint(ans)\r\n", "n,k=map(int,input().split())\na=list(map(int,input().split()))\na.sort()\ni=0\ns=0\nfor j in range(0,n):\n while(i<n):\n if(a[i]-a[j]>=k):\n s=s+(n-i)\n break\n i=i+1\nprint(s)", "import sys\r\nn,k=list(map(int,input().strip().split()))\r\na=list(map(int,sys.stdin.readline().strip().split()))\r\ns=0\r\nfor i in range(len(a)):\r\n for j in range(i+1,len(a)):\r\n if abs(a[i]-a[j])>=k:\r\n s+=1\r\n \r\nprint(s)\r\n", "n,k=list(map(int,input().strip().split()))\r\na=list(map(int,input().strip().split()))\r\ns=0\r\nfor i in range(len(a)):\r\n for j in range(i+1,len(a)):\r\n if abs(a[i]-a[j])>=k:\r\n s+=1\r\n \r\nprint(s)\r\n", "n,k=list(map(int,input().split()))\nl=list(map(int,input().split()))\nl.sort()\ni=0\nfin=0\nfor j in range(0,n):\n while(i<n):\n if(l[i]-l[j]>=k):\n fin=fin+(n-i)\n break\n i=i+1\nprint(fin)", "n,k=list(map(int,input().split()))\nl=list(map(int,input().split()))\nl.sort()\ni=0\nfin=0\nfor j in range(n):\n while(i<n):\n if(l[i]-l[j]>=k):\n fin=fin+(n-i)\n break\n i=i+1\nprint(fin)", "n,k=list(map(int,input().split()))\nl=list(map(int,input().split()))\ncount=0\nfor i in range(0,n-1):\n for j in range(i+1,n):\n if(abs(l[i]-l[j])>=k):\n count=count+1\nprint(count)\n \n", "# cook your dish here\nN, K = map(int, input().split(\" \"))\ninputs = list(map(int, input().split(\" \")))\ninputs.sort()\ndata = [[inputs[0], 1]]\ntotal = 0\nprevious = [inputs[0], 0]\nfor n in range(1,N): \n if inputs[n] == previous[0]: \n total+=previous[1]\n data[0][1] += 1\n else: \n flag = True\n for point in data:\n if inputs[n] - point[0] >= K: \n total += point[1]\n previous = [inputs[n], point[1]]\n flag = False\n break\n data = [[inputs[n], data[0][1] + 1]] + data\n if flag:\n previous = [inputs[n], 0]\nprint(total)", "# cook your dish here\nN, K = map(int, input().split(\" \"))\ninputs = list(map(int, input().split(\" \")))\ninputs.sort()\ndata = [[None, 0]]\ntotal = 0\nprevious = [None, None]\nfor n in range(N): \n if inputs[n] == previous[0]: \n total+=previous[1]\n data[0][1] += 1\n else: \n previous = [None, None]\n data = [[inputs[n], data[0][1] + 1]] + data\n for point in data[1:-1]:\n if inputs[n] - point[0] >= K: \n total += point[1]\n previous = [inputs[n], point[1]]\n break\n if previous == [None, None]:\n previous = [inputs[n], 0]\nprint(total)", "# cook your dish here\nN, K = map(int, input().split(\" \"))\ninputs = list(map(int, input().split(\" \")))\ninputs.sort()\ntotal = 0\nprevious = [None, None]\nfor n in range(1, N): \n if inputs[n] == previous[0]: \n total+=previous[1]\n continue\n previous = [None, None]\n for i in range(n-1, -1, -1):\n tmp = inputs[n] - inputs[i]\n if tmp < 0: \n tmp = -tmp\n if tmp >= K: \n total += i+1 \n previous[1] = i+1\n previous[0] = inputs[n]\n break\n if previous[0] is None: \n previous[0] = inputs[n]\n previous[1] = 0\nprint(total)", "# cook your dish here\nN, K = map(int, input().split(\" \"))\ninputs = list(map(int, input().split(\" \")))\ninputs.sort()\ntotal = 0\nfor n in range(N): \n for i in range(n-1, -1, -1):\n tmp = inputs[n] - inputs[i]\n if tmp < 0: \n tmp = -tmp\n if tmp >= K: \n total += i+1 \n break\nprint(total)", "# cook your dish here\nN,K=map(int,input().split())\nx=list(map(int,input().split()))[:N]\ncount=[]\nfor i in range(len(x)):\n for j in range(i,len(x)):\n if abs(x[i]-x[j])>=K:\n count.append(1)\nprint(len(count))", "# cook your dish here\nN,K=map(int,input().split())\nx=list(map(int,input().split()))[:N]\ncount=[]\nfor i in range(len(x)):\n for j in range(i,len(x)):\n if abs(x[i]-x[j])>=K:\n count.append(1)\nprint(len(count))", "n,k=list(map(int,input().split()))\narr=list(map(int,input().split()))\narr.sort()\ni=0\nres=0\nfor j in range(n):\n while(i<n):\n if(arr[i]-arr[j]>=k):\n res=res+(n-i)\n break\n i+=1\nprint(res) \n \n", "n,k=list(map(int,input().split()))\narr=list(map(int,input().split()))\narr.sort()\ni=0\nres=0\nwhile(i<len(arr)):\n j=i+1\n while(j<len(arr)):\n if(arr[j]-arr[i]>=k):\n res=res+len(arr)-j\n break\n j+=1\n i+=1\nprint(res) \n \n", "n,k=list(map(int,input().split()))\narr=list(map(int,input().split()))\narr.sort()\ni=0\nres=0\nwhile(i<len(arr)):\n j=i+1\n while(j<len(arr)):\n if(arr[j]-arr[i]>=k):\n res=res+1\n j+=1\n i+=1\nprint(res) \n \n", "n, k = list(map(int, input().split()))\narr = list(map(int, input().split()))\narr.sort()\ncount = 0\n\nj = 0\nfor i in range(n) :\n while(j < n) :\n if arr[j] - arr[i] >= k :\n count += n-j\n break\n j += 1\n \nprint(count)# cook your dish here\n", "nk=list(map(int,input().split()))\r\narr=list(map(int,input().split()))\r\narr.sort()\r\ncount=0\r\nfor i in range(0,len(arr)):\r\n for j in range (i+1,len(arr)):\r\n x=arr[j]-arr[i]\r\n if x>=nk[1]:\r\n count=count+1\r\nprint(count)\r\n3", "nk=list(map(int,input().split()))\r\narr=list(map(int,input().split()))\r\narr.sort()\r\ncount=0\r\nfor i in range(0,len(arr)):\r\n for j in range (i+1,len(arr)):\r\n x=arr[i]-arr[j]\r\n if x<0:\r\n x=x(-1)\r\n if x>=nk[1]:\r\n count=count+1\r\nprint(count)\r\n3", "n, k = map(int, input().split())\narr = list(map(int, input().split()))\narr.sort()\ncount = 0\n\nj = 0\nfor i in range(n) :\n while(j < n) :\n if arr[j] - arr[i] >= k :\n count += n-j\n break\n j += 1\n \nprint(count)", "n, k = map(int, input().split())\narr = list(map(int, input().split()))\narr.sort()\ncount = n(n-1)//2\n\nfor i in range(n-1, -1, -1) :\n for j in range(i-1, -1, -1) :\n if arr[i] - arr[j] >= k :\n break\n else :\n count -= 1\n \nprint(count)", "n, k = map(int, input().split())\narr = list(map(int, input().split()))\narr.sort()\narr.reverse()\ncount = n(n-1)//2\n\nfor i in range(n) :\n for j in range(i+1, n) :\n if arr[i] - arr[j] >= k :\n break\n else :\n count -= 1\n \nprint(count)", "n, k = map(int, input().split())\narr = list(map(int, input().split()))\narr.sort()\ncount = 0\n\nfor i in range(n) :\n for j in range(i+1, n) :\n if arr[i] - arr[j] <= -1k :\n count += 1\n \nprint(count)", "n, k = map(int, input().split())\narr = []\n\narr = list(map(int, input().split()))\ncount = 0\n\nfor i in arr :\n for j in arr :\n if i - j >= k :\n count += 1\n \nprint(count)", "n, k = map(int, input().split())\narr = list(map(int, input().split()))\ncount = 0\n\nfor i in arr :\n for j in arr :\n if i - j >= k :\n count += 1\n \nprint(count)"]	{"inputs": [["3 1", "3 1 3"]], "outputs": [["2"]]}	INTERVIEW	PYTHON3	CODECHEF	7,653
67cbc96175663aca8abc7d6e914c2567	UNKNOWN	Sebi goes to school daily with his father. They cross a big highway in the car to reach to the school. Sebi sits in front seat beside his father at driving seat. To kill boredom, they play a game of guessing speed of other cars on the highway. Sebi makes a guess of other car's speed being SG kph, his father FG kph. The highway is usually empty, so the drivers use cruise control, i.e. vehicles run at a constant speed. There are markers on the highway at a gap of 50 meters. Both father-son duo wants to check the accuracy of their guesses. For that, they start a timer at the instant at which their car and the other car (which speed they are guessing) are parallel to each other (they need not to be against some marker, they can be in between the markers too). After some T seconds, they observe that both the cars are next to some markers and the number of markers in between the markers of their car and the other car is D - 1 (excluding the markers next to both the cars). Also, they can observe these markers easily because the other car is faster than their. Speed of Sebi's father's car is S. Using this information, one can find the speed of the other car accurately. An example situation when Sebi's father starts the timer. Notice that both the car's are parallel to each other. Example situation after T seconds. The cars are next to the markers. Here the value of D is 1. The green car is Sebi's and the other car is of blue color. Sebi's a child, he does not know how to find the check whose guess is close to the real speed of the car. He does not trust his father as he thinks that he might cheat. Can you help to resolve this issue between them by telling whose guess is closer. If Sebi's guess is better, output "SEBI". If his father's guess is better, output "FATHER". If both the guess are equally close, then output "DRAW". -----Input----- The first line of the input contains an integer T denoting the number of test cases. Each of the next T lines contain five space separated integers S, SG, FG, D, T corresponding to the Sebi's car speed, Sebi's guess, his father's guess, D as defined in the statement and the time at which both the cars at against the markers (in seconds), respectively. -----Output----- Output description. For each test case, output a single line containing "SEBI", "FATHER" or "DRAW" (without quotes) denoting whose guess is better. -----Constraints----- - 1 ≤ T ≤ 10000 - 0 ≤ S ≤ 130 - 0 ≤ SG, FG ≤ 300 - 1 ≤ D ≤ 30 - 1 ≤ T ≤ 300 - The other car speed doesn't exceed 300 kph. -----Example----- Input: 2 100 180 200 20 60 130 131 132 1 72 Output: SEBI FATHER -----Explanation----- Example case 1. There are total 20 - 1 = 19 markers in between the Sebi's car and the other car. So, the distance between those cars at time T is 20 * 50 = 1000 meters = 1 km. As T = 60 seconds, i.e. 1 minutes. So, the other car goes 1 km more than Sebi's car in 1 minute. So, the other car will go 60 km more than Sebi's car in 1 hour. So, its speed is 60 kmph more than Sebi's car, i.e. 160 kmph. Sebi had made a guess of 180 kmph, while his father of 200 kmph. Other car's real speed is 160 kmph. So, Sebi's guess is better than his father. Hence he wins the game. Example case 2. The situation of this example is depicted in the image provided in the statement. You can find the speed of other car and see that Father's guess is more accurate.	["# cook your dish here\nn=int(input())\nfor i in range(n):\n S, SG, FG, D, T = map(int, input().split())\n speed = (D180)/T + S\n if abs(SG-speed) == abs(FG-speed):\n print('DRAW')\n elif abs(SG-speed) > abs(FG-speed):\n print('FATHER')\n else:\n print('SEBI')", "# cook your dish here\nn=int(input())\nfor i in range(n):\n S, SG, FG, D, T = map(int, input().split())\n speed = (D180)/T + S\n if abs(SG-speed) == abs(FG-speed):\n print('DRAW')\n elif abs(SG-speed) > abs(FG-speed):\n print('FATHER')\n else:\n print('SEBI')", "for i in range(int(input())):\n s,sg,fg,d,t = [int(i) for i in input().split()]\n dis = (d50)\n speed = dis/t \n exs = (speed18)/5\n ts = s + exs\n ss = abs(sg-ts)\n sf = abs(fg-ts)\n if ss>sf:\n print('FATHER')\n elif ss<sf:\n print('SEBI')\n elif ss==sf:\n print('DRAW')\n ", "for _ in range(int(input())):\r\n S, SG, FG, D, T = map(int, input().split())\r\n speed = (D180)/T + S\r\n if abs(SG-speed) == abs(FG-speed):\r\n print('DRAW')\r\n elif abs(SG-speed) > abs(FG-speed):\r\n print('FATHER')\r\n else:\r\n print('SEBI')", "# cook your dish here\nfor _ in range(int(input())):\n S, SG, FG, D, T = map(int, input().split())\n speed = (D180)/T + S\n if abs(SG-speed) == abs(FG-speed):\n print('DRAW')\n elif abs(SG-speed) > abs(FG-speed):\n print('FATHER')\n else:\n print('SEBI')", "for _ in range(int(input())):\n S, SG, FG, D, T = map(int, input().split())\n speed = (D180)/T + S\n if abs(SG-speed) == abs(FG-speed):\n print('DRAW')\n elif abs(SG-speed) > abs(FG-speed):\n print('FATHER')\n else:\n print('SEBI')", "for i in range(int(input())):\n s,sg,fg,d,t=list(map(int,input().split()))\n speed=((d180)/t+s)\n sa=abs(sg-speed)\n fa=abs(fg-speed)\n if fa<sa:\n print('FATHER')\n elif fa>sa:\n print('SEBI')\n else:\n print('DRAW')\n\n", "import math\nt=int(input())\nfor i in range(t):\n #n=int(input())\n s,sg,fg,d,t=map(int,input().split())\n #l=list(map(int,input().split()))\n #s=input()\n tot=(d503.6)/t\n final=s+tot\n a=abs(final-sg)\n b=abs(final-fg)\n #print(tot,final,a,b)\n if(a<b):\n print(\"SEBI\")\n elif(b<a):\n print(\"FATHER\")\n else:\n print(\"DRAW\")\n\n# cook your dish here\n", "for i in range(int(input())):\r\n s,sg,fg,d,t=list(map(int,input().split()))\r\n speed=((d180)/t+s)\r\n sa=abs(sg-speed)\r\n fa=abs(fg-speed)\r\n if fa<sa:\r\n print('FATHER')\r\n elif fa>sa:\r\n print('SEBI')\r\n else:\r\n print('DRAW')\r\n", "for i in range(int(input())):\n s,sg,fg,d,t = list(map(int,input().split()))\n tot = (50d3.6)/t\n final = s + tot\n a = abs(sg-final)\n b = abs(fg-final)\n if a<b:\n print(\"SEBI\")\n elif a>b:\n print(\"FATHER\")\n else:\n print(\"DRAW\")", "import math\r\nt=int(input())\r\n#t=1\r\nfor i in range(t):\r\n #n=int(input())\r\n s,sg,fg,d,t=map(int,input().split())\r\n #l=list(map(int,input().split()))\r\n #s=input()\r\n tot=(d503.6)/t\r\n final=s+tot\r\n a=abs(final-sg)\r\n b=abs(final-fg)\r\n #print(tot,final,a,b)\r\n if(a<b):\r\n print(\"SEBI\")\r\n elif(b<a):\r\n print(\"FATHER\")\r\n else:\r\n print(\"DRAW\")\r\n\r\n\r\n ", "# cook your dish here\nt = int(input())\n\nfor _ in range(t):\n s,sg,fg,d,t = map(int , input().split(\" \"))\n \n # t = t/3600\n # d = (d50)/1000\n \n car_speed = s + (d503.6)/t\n #print(car_speed)\n sebi = abs(car_speed-sg)\n fat = abs(car_speed-fg)\n #print(sebi,fat)\n if sebi<fat:\n print(\"SEBI\")\n elif fat==sebi:\n print(\"DRAW\")\n else:\n print(\"FATHER\")", "for _ in range(int(input())):\n S,SG,FG,D,T=map(int, input().strip().split())\n G=S+((180D)/T)\n if abs(G-SG)>abs(G-FG):\n print(\"FATHER\")\n elif abs(G-SG)<abs(G-FG):\n print(\"SEBI\") \n else:\n print(\"DRAW\")", "# cook your dish here\nfrom sys import stdin, stdout\nans = []\n\nfor _ in range(int(stdin.readline())):\n spd, sg, fg, d, time = map(int, stdin.readline().split())\n ckh = ((d180)/time) + spd\n dsg = abs(ckh - sg)\n dfg = abs(ckh - fg)\n ans.append('DRAW' if dsg == dfg else 'SEBI' if dsg < dfg else 'FATHER')\nstdout.write('\\n'.join(ans))\n", "# cook your dish here\nfrom sys import stdin, stdout\nans = []\n\nfor _ in range(int(stdin.readline())):\n spd, sg, fg, d, time = map(int, stdin.readline().split())\n ckh = ((d180)/time) + spd\n dsg = abs(ckh - sg)\n dfg = abs(ckh - fg)\n ans.append('DRAW' if dsg == dfg else 'SEBI' if dsg < dfg else 'FATHER')\nstdout.write('\\n'.join(ans))\n", "for _ in range(int(input())):\r\n s,sg,fg,d,t=map(int,input().split())\r\n dis=(d50)/1000\r\n t1=t/60\r\n speed=d506060/(t1000)\r\n speed+=s\r\n if(abs(speed-sg)>abs(speed-fg)):\r\n print('FATHER')\r\n elif(abs(speed-sg)<abs(speed-fg)):\r\n print('SEBI')\r\n else:\r\n print('DRAW')\r\n", "for i in range(int(input())):\n s,sg,fg,d,t=map(int,input().split())\n sc=s+(d180/t)\n if abs(sg-sc)==abs(fg-sc):\n print('DRAW')\n elif abs(sg-sc)<abs(fg-sc):\n print('SEBI')\n elif abs(sg-sc)>abs(fg-sc):\n print('FATHER')", "# cook your dish here\nfor i in range(int(input())):\n s,sg,fg,d,t=map(int,input().split())\n sc=s+(d180/t)\n if abs(sg-sc)==abs(fg-sc):\n print('DRAW')\n elif abs(sg-sc)<abs(fg-sc):\n print('SEBI')\n elif abs(sg-sc)>abs(fg-sc):\n print('FATHER')\n ", "# cook your dish here\nfor _ in range(int(input())):\n s,sg,fg,d,t=map(int,input().split())\n dif=float(d180/t)\n diff=float(s)+dif\n if abs(float(diff-sg))>abs(float(diff-fg)):\n print(\"FATHER\")\n elif abs(float(diff-sg))<abs(float(diff-fg)):\n print(\"SEBI\")\n else:\n print(\"DRAW\")", "# cook your dish here\ntests = int(input())\nfor _ in range(tests):\n s, sg, fg, d, t = [int(j) for j in input().split()]\n speed = s + 180 d / t\n abs_s = abs(sg-speed)\n abs_f = abs(fg-speed)\n if abs_s < abs_f:\n print(\"SEBI\")\n elif abs_f < abs_s:\n print(\"FATHER\")\n else:\n print(\"DRAW\")"]	{"inputs": [["2", "100 180 200 20 60", "130 131 132 1 72", "", ""]], "outputs": [["SEBI", "FATHER"]]}	INTERVIEW	PYTHON3	CODECHEF	6,493
a0e68d2a4270bebd628b25054d93ba11	UNKNOWN	Bob has got some injury in his leg and due to this he can take exactly M steps in one move. Bob enters a square field of size NxN. The field is only having one gate(for both entrance and exit) at its one of the corners. Bob started walking along the perimeter of square field.(remember Bob can only take exactly M steps in one move and cannot reverse his direction of motion). Bob wants to know how many minimum number of moves he needs to come out(i.e. he reaches the same gate from where he entered into the field) from the square field. Tell the answer to Bob ASAP. Luckily, you came to know M=N+1. -----Input----- - The first line of the input contains an integer T denoting the number of test cases. - Each test case contains a single integer N denoting the sides of the square. -----Output----- - For each test case, output a single line containing minimum number of moves Bob required to come out from the field. -----Constraints----- - 1 ≤ T ≤ 10000 - 1 ≤ N ≤ 1000000000 -----Example----- Input: 2 1 2 Output: 2 8 -----Explanation----- Example case 1.Let four corners of square be (0,0), (0,1), (1,1), (1,0). Let gate be at (0,0). Bob takes 2 steps in one move. Let movement of Bob be as follows (0,0) -> (1,1) -> (0,0). Thus minimum moves needed were 2. Example case 2.Let four corners of square be (0,0), (0,2), (2,2), (2,0). Let gate be at (0,0). Bob takes 3 steps in one move. Let movement of Bob be as follows (0,0) -> (2,1) -> (0,2) -> (1,0) -> (2,2) -> (0,1) -> (2,0) -> (1,2) -> (0,0). Thus minimum number of moves needed are 8.	["# By Prathmesh Maurya\nt=eval(input())\nwhile(t!=0):\n t-=1\n n=eval(input())\n if n%2 == 0:\n print(n4)\n elif n%4==3:\n print(n)\n else:\n print(n2)\n", "t = eval(input())\n\ndef gcd(a, b):\n while b:\n t = a % b\n a, b = b, t\n return a\n\nfor i in range(t):\n n = eval(input())\n m = n + 1\n k = n * 4\n g = gcd(m, k)\n lcm = m * k / g\n print(lcm / m)\n", "# your code goes here\ndef gcd(a,b):\n if b==0:\n return a\n else:\n return gcd(b,a%b)\n \nt=int(input().strip())\nwhile t:\n a=int(input().strip())\n b=a4\n a+=1\n ans=b/gcd(b,a)\n print(ans)\n t-=1", "t = int(input())\n\nfor i in range(t):\n n = int(input())\n if n%2==0:\n print(n4)\n else:\n temp = n/2 + 1\n if temp%2==0:\n print(n)\n else:\n print(n2)\n", "t=eval(input())\nfor i in range(t):\n n=eval(input())\n m=n+1\n l=4n\n if (4n)%m==0:\n print(4n/m)\n else:\n a=l\n b=m\n while b:\n a,b=b,a%b\n print(l/a)\n", "def function():\n print('hello world!!its ranjeet kumar yadav from iiitdmj')\n\n#please ignore the size of variable\ntgnfdngnd=eval(input())\nwhile tgnfdngnd>0:\n tgnfdngnd=tgnfdngnd-1\n #taking input\n adddddd=eval(input())\n s=0\n #calculating size of perimeter\n \n s=2(adddddd+1)+2(adddddd-1)\n i=0\n \n\n vddddddddddddd=0\n dddddddddddddddd=0\n if adddddd%2==0:\n print(s)\n else:\n n=(adddddd-1)/2+1\n if n%2==0:\n print(adddddd)\n else:\n print(adddddd2)\n \n \n \n", "import math\n\n \n \nt=eval(input())\nwhile t>0:\n t=t-1\n a=eval(input())\n s=0\n s=2(a+1)+2(a-1)\n i=0\n b=a+1\n if a%2==0:\n print(s)\n else:\n n=(a-1)/2+1\n if n%2==0:\n print(a)\n else:\n print(a2)\n \n \n", "from fractions import gcd\nfor _ in range(int(input())):\n n = int(input())\n s = n * 4\n m = n + 1\n if s % m == 0:\n print(s / m)\n else:\n print(s * m / gcd(s, m) / m)\n", "t=int(input())\nfor i in range(0,t):\n n=int(input())\n x=4n\n ans=2\n m=n+1\n tem=0\n if(n%2==0):\n ans=(n/2)8\n elif(n%4==3):\n ans=n\n else:\n val=(n+3)/4\n ans=2+(val-1)8\n print(ans)", "t=int(input())\nfor i in range(0,t):\n n=int(input())\n x=4n\n ans=2\n m=n+1\n tem=0\n if(n%2==0):\n ans=(n/2)8\n elif(n%4==3):\n ans=n\n else:\n val=(n+3)/4\n ans=2+(val-1)8\n print(ans)"]	{"inputs": [["2", "1", "2"]], "outputs": [["2", "8"]]}	INTERVIEW	PYTHON3	CODECHEF	2,208
79fc705bad4eb37d5b0bbeae2253e897	UNKNOWN	Chef has a sequence of positive integers $A_1, A_2, \ldots, A_N$. He wants to choose some elements of this sequence (possibly none or all of them) and compute their MEX, i.e. the smallest positive integer which does not occur among the chosen elements. For example, the MEX of $[1, 2, 4]$ is $3$. Help Chef find the largest number of elements of the sequence $A$ which he can choose such that their MEX is equal to $M$, or determine that it is impossible. -----Input----- - The first line of the input contains a single integer $T$ denoting the number of test cases. The description of $T$ test cases follows. - The first line of each test case contains two space-separated integers $N$ and $M$. - The second line contains $N$ space-separated integers $A_1, A_2, \ldots, A_N$. -----Output----- For each test case, print a single line containing one integer ― the maximum number of elements Chef can choose, or $-1$ if he cannot choose elements in such a way that their MEX is $M$. -----Constraints----- - $1 \le T \le 100$ - $2 \le M \le N \le 10^5$ - $1 \le A_i \le 10^9$ for each valid $i$ - the sum of $N$ over all test cases does not exceed $10^6$ -----Example Input----- 1 3 3 1 2 4 -----Example Output----- 3 -----Explanation----- Example case 1: The MEX of whole array is 3. Hence, we can choose all the elements.	[" \r\nfor __ in range(int(input())):\r\n n,m=map(int,input().split())\r\n arr=list(map(int,input().split()))\r\n s=set(arr)\r\n mex=-1\r\n ele=1\r\n for i in range(1,n+1):\r\n if i not in s:\r\n mex = i\r\n break\r\n if m>mex:\r\n print(-1)\r\n elif m==mex:\r\n print(n)\r\n else:\r\n c=arr.count(m)\r\n print(n-c)\r\n \r\n \r\n \r\n", "for _ in range(int(input())):\r\n n,m = map(int,input().split())\r\n arr = list(map(int,input().split()))\r\n\r\n st = set(arr)\r\n\r\n mex = -1\r\n\r\n for i in range(1,n+1):\r\n if i not in st:\r\n mex = i\r\n break\r\n \r\n if mex==m:\r\n print(n)\r\n elif mex<m:\r\n print(-1)\r\n else:\r\n res = 0\r\n \r\n for i in arr:\r\n if i!=m:\r\n res+=1\r\n \r\n print(res)\r\n\r\n\r\n\r\n\r\n\r\n ", "for _ in range(int(input())):\n n,m=map(int,input().split())\n ar=[int(x) for x in input().split()]\n ar.sort()\n f=0\n j=1\n # v=[]\n if m==1:\n c=ar.count(1)\n if n-c==0:\n print(-1)\n else:\n print(n-c)\n else:\n if ar[0]==1:\n prev=1\n j=2\n for i in range(1,n):\n if ar[i]<m:\n if ar[i]!=prev and ar[i]==j:\n j+=1\n prev=ar[i]\n elif ar[i]!=prev and ar[i]!=j:\n f=1\n break\n elif ar[i]==prev:\n continue\n else:\n break\n else:\n if m!=1:\n f=1\n if f==1 or j!=m:\n print(-1)\n else:\n c=ar.count(m)\n if n-c==0:\n print(-1)\n else:\n print(n-c)\n \n \n \n \n \n \n \n \n ", "t = int(input())\nfor i in range(t):\n c = 1\n n, m = map(int, input().split())\n A = list(map(int, input().split()))\n a = set(A)\n j = 1\n while j < m and j in a:\n j += 1\n if j != m:\n print(-1)\n else:\n print(n-A.count(m))", "t = int(input())\nfor i in range(t):\n c = 1\n n, m = map(int, input().split())\n A = list(map(int, input().split()))\n a = set(A)\n j = 1\n while j < m and j in a:\n j += 1\n if j != m:\n print(-1)\n else:\n print(n-A.count(m))", "# cook your dish here\nimport bisect\nt = int(input())\nfor _ in range(t):\n n,m = map(int, input().split())\n arr = list(map(int, input().split()))\n seti = set(arr)\n f = 1\n for i in range(1,m):\n if i not in seti:\n f = 0\n break\n if f==0:\n print(-1)\n else:\n if m in seti:\n print(n-arr.count(m))\n else:\n print(n)\n ", "tc = int(input())\r\nfor _ in range(tc):\r\n\tN,M = map(int,input().split())\r\n\tarr = list(map(int, input().split()))\r\n\tcurr_mex = 1\r\n\tarr.sort()\r\n\tfor i in range(N):\r\n\t\tif(arr[i]==curr_mex):\r\n\t\t\tcurr_mex+=1\r\n\tif(curr_mex == M):\r\n\t\tprint(N)\r\n\telif(curr_mex < M):\r\n\t\tprint(-1)\r\n\telse:\r\n\t\tcnt = 0\r\n\t\tfor x in arr:\r\n\t\t\tif(x == M):\r\n\t\t\t\tcnt+=1\r\n\t\tprint(N-cnt)\r\n\r\n", "# cook your dish here\nfor _ in range(int(input())):\n n,m=list(map(int, input().split()))\n l=list(map(int, input().split()))\n c, cnt = m-1, 0\n l1=[0]m\n \n for k in l:\n if k<m:\n if l1[k]==0:\n l1[k]=1 \n c-=1 \n cnt+=1 \n \n elif k>m:\n cnt+=1\n \n if c==0:\n print(cnt)\n \n else:\n print(-1)", "# cook your dish here\r\nfor T in range(int(input())):\r\n n,m=map(int,input().split())\r\n a=list(map(int,input().split()))\r\n \r\n count=[0]n\r\n\r\n for key in a:\r\n try:\r\n count[key-1]+=1\r\n except:\r\n pass\r\n\r\n a=list(set(a))\r\n a.sort()\r\n\r\n flag=True\r\n for i in range(len(a)):\r\n if(a[i]!=(i+1)):\r\n flag=False\r\n mex=i+1\r\n break\r\n if(flag):\r\n mex=len(a)+1\r\n\r\n if(mex < m):\r\n print(-1)\r\n else:\r\n print(n-count[m-1])\r\n \r\n", "# cook your dish here\r\nfor T in range(int(input())):\r\n n,m=map(int,input().split())\r\n a=list(map(int,input().split()))\r\n \r\n count=[0]n\r\n\r\n for key in a:\r\n try:\r\n count[key-1]+=1\r\n except:\r\n pass\r\n\r\n a=list(set(a))\r\n a.sort()\r\n\r\n flag=True\r\n for i in range(len(a)):\r\n if(a[i]!=(i+1)):\r\n flag=False\r\n mex=i+1\r\n break\r\n if(flag):\r\n mex=len(a)+1\r\n\r\n if(mex < m):\r\n print(-1)\r\n else:\r\n print(n-count[m-1])\r\n \r\n", "# cook your dish here\r\nfor T in range(int(input())):\r\n n,m=map(int,input().split())\r\n a=list(map(int,input().split()))\r\n \r\n count=[0]n\r\n\r\n for key in a:\r\n try:\r\n count[key-1]+=1\r\n except:\r\n pass\r\n\r\n a=list(set(a))\r\n a.sort()\r\n\r\n flag=True\r\n for i in range(len(a)):\r\n if(a[i]!=(i+1)):\r\n flag=False\r\n mex=i+1\r\n break\r\n if(flag):\r\n mex=len(a)+1\r\n\r\n if(mex < m):\r\n print(-1)\r\n else:\r\n print(n-count[m-1])\r\n \r\n", "# cook your dish here\r\nfor T in range(int(input())):\r\n n,m=map(int,input().split())\r\n a=list(map(int,input().split()))\r\n \r\n count=[0]n\r\n\r\n for key in a:\r\n try:\r\n count[key-1]+=1\r\n except:\r\n pass\r\n\r\n a=list(set(a))\r\n a.sort()\r\n\r\n flag=True\r\n for i in range(len(a)):\r\n if(a[i]!=(i+1)):\r\n flag=False\r\n mex=i+1\r\n break\r\n if(flag):\r\n mex=len(a)+1\r\n\r\n if(mex < m):\r\n print(-1)\r\n else:\r\n print(n-count[m-1])\r\n \r\n", "# cook your dish here\r\nfor T in range(int(input())):\r\n n,m=map(int,input().split())\r\n a=list(map(int,input().split()))\r\n \r\n count=[0]n\r\n\r\n for key in a:\r\n try:\r\n count[key-1]+=1\r\n except:\r\n pass\r\n\r\n a=list(set(a))\r\n a.sort()\r\n\r\n flag=True\r\n for i in range(len(a)):\r\n if(a[i]!=(i+1)):\r\n flag=False\r\n mex=i+1\r\n break\r\n if(flag):\r\n mex=len(a)+1\r\n\r\n if(mex < m):\r\n print(-1)\r\n else:\r\n print(n-count[m-1])\r\n \r\n", "def main():\r\n n , m = [int(x) for x in input().split()]\r\n l =[int(X) for X in input().split()]\r\n ls = set(l)\r\n f = 1\r\n for i in range(1,m):\r\n if i not in ls:\r\n f = 0\r\n break\r\n if f==0:\r\n print(-1)\r\n else:\r\n if m in ls:\r\n print(n-l.count(m))\r\n else:print(n)\r\ndef __starting_point():\r\n for _ in range(int(input())):\r\n main()\r\n\n__starting_point()", "for _ in range(int(input())):\r\n n , m = [int(x) for x in input().split()]\r\n ls =[int(X) for X in input().split()]\r\n x = ls.count(m)\r\n ls2 = list(set(ls))\r\n if len(ls2) <=m-2:\r\n print(-1)\r\n elif ls2[m-2]!=m-1:\r\n print(-1)\r\n else:\r\n print(n-x)\r\n", "t=int(input())\r\nfor _ in range(t):\r\n n,m=list(map(int,input().strip().split()))\r\n list1=list(map(int,input().strip().split()))\r\n count=list1.count(m)\r\n\r\n set1=set(list1)\r\n list2=list(set1)\r\n \r\n if len(list2)<=m-2:\r\n print(-1)\r\n elif list2[m-2]!=m-1:\r\n print(-1)\r\n else:\r\n print(n-count)\r\n \r\n \r\n", "t=int(input())\nwhile t:\n n,m=map(int,input().split())\n a=list(map(int,input().split()))\n a.sort()\n j=1\n cm=0\n for i in range(n):\n if a[i]>j:\n cm=a[i]\n break\n else:\n j+=1\n if i==n-1 and cm==0:\n cm=a[n-1]+1\n if cm==m:\n print(n)\n elif cm<m:\n print(-1)\n else:\n c=0\n for i in range(n):\n if a[i]!=m:\n c+=1\n print(c)\n \n t-=1\n", "from sys import stdin, stdout\nfrom collections import defaultdict as D\n\ntry:\n for _ in range(int(input())):\n n,m=[int(i) for i in stdin.readline().split()]\n a=[int(i) for i in stdin.readline().split()]\n d = D(lambda:0)\n for i in a:\n d[i] += 1 \n \n k = 1\n for i in range(1, max(a) + 2):\n if d[i] == 0:\n k = i\n break\n \n if k==m:\n print(n)\n elif k<m:\n print(-1)\n elif k>m:\n print(n - d[m])\nexcept:\n pass", "t=int(input())\nwhile t:\n n,m=(int(o) for o in input().split())\n a=[int(o) for o in input().split()]\n a.sort()\n j=1\n cm=0\n for i in range(n):\n if a[i]>j:\n cm=a[i]\n break\n else:\n j+=1\n if i==n-1 and cm==0:\n cm=a[n-1]+1\n if cm==m:\n print(n)\n elif cm<m:\n print(-1)\n else:\n c=0\n for i in range(n):\n if a[i]!=m:\n c+=1\n print(c)\n \n t-=1\n", "t=int(input())\r\nimport sys\r\nwhile(t!=0):\r\n n,m=list(map(int,input().strip().split()))\r\n a=list(map(int,input().strip().split()))\r\n l=[0]100000\r\n mx=-1\r\n c=0\r\n for i in a:\r\n if(i>mx):\r\n mx=i\r\n l[i]+=1\r\n for i in range(1,mx+1):\r\n if(l[i]==0):\r\n if(i==m):\r\n print(n)\r\n c=1\r\n break\r\n elif(i<m):\r\n print(-1)\r\n c=1\r\n break\r\n else:\r\n print(n-l[m])\r\n c=1\r\n break\r\n if(c==0):\r\n if(m==mx+1):\r\n print(n)\r\n else:\r\n print(\"-1\")\r\n t-=1", "from sys import stdin\r\ndef sin():\r\n return stdin.readline()\r\n\r\n\r\nfor _ in range(int(sin())):\r\n n,m = map(int, sin().split())\r\n l = list(map(int, sin().split(\" \")))\r\n g=[0]max(l)2\r\n for i in l:\r\n g[i-1]=1\r\n p=g.index(0)+1\r\n if p==m:\r\n print(n)\r\n elif p<m:\r\n print(-1)\r\n else:\r\n print(n-l.count(m))\r\n", "'''\r\n\r\n Online Python Compiler.\r\n Code, Compile, Run and Debug python program online.\r\nWrite your code in this editor and press \"Run\" button to execute it.\r\n\r\n'''\r\nimport bisect\r\nt=int(input())\r\nfor i in range(t):\r\n n,m=map(int,input().split())\r\n l=list(map(int,input().split()))\r\n l.sort()\r\n a=bisect.bisect(l,m)\r\n s=list(set(l[0:a]))\r\n if(len(s)==0):\r\n if(m==1):\r\n if(m in l):\r\n print(len(l)-l.count(m))\r\n else: \r\n print(n)\r\n else:\r\n print(-1)\r\n else: \r\n s.sort() \r\n a=s[len(s)-1]\r\n if(s==list(range(1,a+1))):\r\n if(m in l):\r\n print(len(l)-l.count(m))\r\n else: \r\n print(n)\r\n \r\n else:\r\n print(-1)", "t = int(input())\n\nfor _ in range(t):\n n,m = map(int,input().split())\n l = list(map(int,input().split()))\n \n ans = 0\n temp = [0](m-1)\n for i in l:\n if i>m:\n ans+=1 \n elif i<m:\n temp[i-1]+=1 \n \n flag=1\n for i in range(m-2,-1,-1):\n if temp[i]==0:\n flag=0\n break \n else:\n ans+=temp[i]\n if flag==0:\n print(\"-1\")\n else:\n print(ans)", "t = int(input())\r\nwhile t>0:\r\n t -= 1\r\n n, m = map(int, input().split())\r\n a = [int(x) for x in input().split()]\r\n count = 0\r\n temp = [0]*(m+1)\r\n for i in range(n):\r\n if a[i] == m:\r\n temp[a[i]] += 1\r\n elif a[i] > m:\r\n pass\r\n else:\r\n temp[a[i]] = 1\r\n for i in range(1, m):\r\n if temp[i] == 0:\r\n print(-1)\r\n break\r\n if i == m-1:\r\n print(n-temp[-1])\r\n \r\n \r\n "]	{"inputs": [["1", "3 3", "1 2 4", ""]], "outputs": [["3"]]}	INTERVIEW	PYTHON3	CODECHEF	12,855
7d28e5a350f25edfafdfb80aaf9506ca	UNKNOWN	"Humankind cannot gain anything without first giving something in return. To obtain, something of equal value must be lost. That is alchemy's first law of Equivalent Exchange. In those days, we really believed that to be the world's one, and only truth." -- Alphonse Elric Now, here we have an equivalent exchange law for triangles which states that two right-angled isosceles triangles of the same color can be made into a square of the same color using Alchemy. You are given N$N$ right-angled isosceles colored triangles numbered from 1$1$ to N$N$. For each triangle, the two equal sides have a length of 1$1$ unit. The Color of i$i$-th triangle is given by Ci$C_i$. To create a tower, we choose some consecutive (2×k)+1$2 \times k)+1$ triangles for any k≥0$k \geq 0$. We then pick some 2×k$2 \times k$ of them (these need not be consecutive), and form k$k$ pairs of triangles such that both triangles in pair have the same color. Also, each of the 2×k$2 \times k$ should be in exactly one pair. Then the two triangles in each pair are joined using Alchemy (following the law of equivalent exchange for triangles) to form squares and these k$k$ squares are placed one upon other. The one remaining triangle is placed as a roof to the tower. This results in a tower of the height of k$k$. Find the maximum height of the tower that can be formed. In other words, you should select the largest consecutive segment of triangles, such that you can form a tower using every single one of those triangles. In particular, you leave out one triangle, which will form the roof, and the other triangles should all be paired up such that both triangles in a pair have the same colour. -----Input:----- - The first line contains T$T$, the number of test cases. Then the test cases follow. - For every test case, the first line contains N$N$ denoting the number of triangles. - For every test case, the second line contains N$N$ space-separated integers Ci$C_{i}$ denoting the color of the triangles. ( 1≤i≤N$1 \leq i \leq N$). -----Output:----- For every test case, output a single integer denoting the maximum height of the tower that can be formed. -----Constraints----- - 1≤T≤100$1 \leq T \leq 100$ - 1≤N≤105$1 \leq N \leq 10^{5}$ - 1≤Ci≤30$1 \leq C_{i} \leq 30$ - Sum of N$N$ over all test cases doesn't exceed 5×105$5\times 10^{5}$ -----Sample Input:----- 4 14 5 4 2 2 3 2 1 3 2 7 4 9 9 9 3 1 2 1 3 1 1 1 5 1 2 3 4 1 -----Sample Output:----- 3 1 1 0 -----EXPLANATION:----- - #1$1$: The subarray [2,2,3,2,1,3,2]$[2, 2, 3, 2, 1, 3, 2]$ results in a tower of height 3$3$. - #2$2$: The subarray [1,2,1]$[ 1, 2, 1 ]$ results in a tower of height 1$1$. - #3$3$: The subarray [1,1,1]$[ 1, 1, 1 ]$ results in a tower of height 1$1$. - #4$4$: The subarrays [1]$[ 1 ]$, [2]$[ 2 ]$ , [3]$[ 3 ]$, [4]$[ 4 ]$ and [1]$[ 1 ]$ all results in a tower of height 0$0$. The above tower is possible by subarray [2,2,3,2,1,3,2]$[2, 2, 3, 2, 1, 3, 2]$ resulting in a height of 3$3$ in test case 1$1$.	["for i in range(int(input())):\n n = int(input())\n c = list(map(int, input().split()))\n d = {}\n d[0] = -1\n parity = 0\n ans = 0\n for i in range(n):\n parity ^= 1 << (c[i]-1)\n for t in range(30):\n x = parity^(1<<t)\n if(x in d.keys()):\n ans = max(ans, i - d[x])\n if parity not in d.keys():\n d[parity] = i\n print(ans//2)", "# cook your dish here\nfor t in range(int(input())):\n n = int(input())\n l = [int(j)-1 for j in input().split()]\n d = dict()\n # st = tuple([0 for i in range(30)])\n st = 0\n d[st] = -1\n ans = 1\n for i in range(n):\n # st = list(st)\n st = st ^ (1 << l[i])\n # st[l[i]] = 1-st[l[i]]\n for j in range(30):\n # st1 = list(st)\n st1 = st\n st1 = st1 ^ (1<<j)\n # st1[j] = 1 - st1[j]\n if st1 in d and d[st1]!=i-1:\n ans = max(ans, i-d[st1])\n # print(i, d[tuple(st1)])\n if st not in d:\n d[st] = i\n\n print(ans//2)", "for t in range(int(input())):\n n = int(input())\n l = [int(j)-1 for j in input().split()]\n d = dict()\n # st = tuple([0 for i in range(30)])\n st = 0\n d[st] = -1\n ans = 1\n for i in range(n):\n # st = list(st)\n st = st ^ (1 << l[i])\n # st[l[i]] = 1-st[l[i]]\n for j in range(30):\n # st1 = list(st)\n st1 = st\n st1 = st1 ^ (1<<j)\n # st1[j] = 1 - st1[j]\n if st1 in d and d[st1]!=i-1:\n ans = max(ans, i-d[st1])\n # print(i, d[tuple(st1)])\n if st not in d:\n d[st] = i\n\n print(ans//2)", "for t in range(int(input())):\n n = int(input())\n c = list(map(int,input().split()))\n dictionary = {0:0}\n parity = 0\n k = 0\n for i in range(n):\n parity ^= (1<<c[i]-1)\n if parity not in dictionary:\n dictionary[parity] = i+1;\n for j in range(30):\n x = parity ^ (1<<j);\n if x in dictionary:\n k=max(k,i-dictionary[x])\n\n print(k//2)\n\n", "# cook your dish here\nfor t in range(int(input())):\n n = int(input())\n l = [int(j)-1 for j in input().split()]\n d = dict()\n # st = tuple([0 for i in range(30)])\n st = 0\n d[st] = -1\n ans = 1\n for i in range(n):\n # st = list(st)\n st = st ^ (1 << l[i])\n # st[l[i]] = 1-st[l[i]]\n for j in range(30):\n # st1 = list(st)\n st1 = st\n st1 = st1 ^ (1<<j)\n # st1[j] = 1 - st1[j]\n if st1 in d and d[st1]!=i-1:\n ans = max(ans, i-d[st1])\n # print(i, d[tuple(st1)])\n if st not in d:\n d[st] = i\n\n print(ans//2)", "\nfrom sys import stdin, stdout\n\nfor tc_ in range(int(stdin.readline())):\n n=int(stdin.readline())\n a=list(map(int,stdin.readline().split()))\n dic={0:-1}\n ans=last=0\n for i in range(n):\n last^=(1<<(a[i]-1))\n for j in range(30):\n x=last^(1<<j)\n if x in dic:\n ans=max(ans,i-dic[x])\n if last not in dic:\n dic[last]=i\n stdout.write(f\"{ans>>1}\\n\")\n", "# cook your dish here\nfor t in range(int(input())):\n n = int(input())\n l = [int(j)-1 for j in input().split()]\n d = dict()\n # st = tuple([0 for i in range(30)])\n st = 0\n d[st] = -1\n ans = 1\n for i in range(n):\n # st = list(st)\n st = st ^ (1 << l[i])\n # st[l[i]] = 1-st[l[i]]\n for j in range(30):\n # st1 = list(st)\n st1 = st\n st1 = st1 ^ (1<<j)\n # st1[j] = 1 - st1[j]\n if st1 in d and d[st1]!=i-1:\n ans = max(ans, i-d[st1])\n # print(i, d[tuple(st1)])\n if st not in d:\n d[st] = i\n\n print(ans//2)", "for t in range(int(input())):\n n = int(input())\n l = [int(j)-1 for j in input().split()]\n d = dict()\n # st = tuple([0 for i in range(30)])\n st = 0\n d[st] = -1\n ans = 1\n for i in range(n):\n # st = list(st)\n st = st ^ (1 << l[i])\n # st[l[i]] = 1-st[l[i]]\n for j in range(30):\n # st1 = list(st)\n st1 = st\n st1 = st1 ^ (1<<j)\n # st1[j] = 1 - st1[j]\n if st1 in d and d[st1]!=i-1:\n ans = max(ans, i-d[st1])\n # print(i, d[tuple(st1)])\n if st not in d:\n d[st] = i\n\n print(ans//2)", "for t in range(int(input())):\n n = int(input())\n l = [int(j)-1 for j in input().split()]\n d = dict()\n # st = tuple([0 for i in range(30)])\n st = 0\n d[st] = -1\n ans = 1\n for i in range(n):\n # st = list(st)\n st = st ^ (1 << l[i])\n # st[l[i]] = 1-st[l[i]]\n for j in range(30):\n # st1 = list(st)\n st1 = st\n st1 = st1 ^ (1<<j)\n # st1[j] = 1 - st1[j]\n if st1 in d and d[st1]!=i-1:\n ans = max(ans, i-d[st1])\n # print(i, d[tuple(st1)])\n if st not in d:\n d[st] = i\n\n print(ans//2)\n\n"]	{"inputs": [["4", "14", "5 4 2 2 3 2 1 3 2 7 4 9 9 9", "3", "1 2 1", "3", "1 1 1", "5", "1 2 3 4 1"]], "outputs": [["3", "1", "1", "0"]]}	INTERVIEW	PYTHON3	CODECHEF	4,804
6b94b3c2b2458a87514acddd02824c41	UNKNOWN	Chef has just finished the construction of his new garden. He has sown the garden with patches of the most beautiful carpet grass he could find. He has filled it with patches of different color and now he wants to evaluate how elegant his garden is. Chef's garden looks like a rectangular grid of cells with N rows and M columns. So there are N x M cells in total. In each cell Chef planted grass of some color. The elegance of the garden is defined by the number of squares, composed of at least four garden cells, with edges parallel to the sides of the garden, that have four corner cells of the same color. Given the description of Chef's garden, calculate how many such squares exist. Input format The first line contains the number T, the number of test cases. In the following lines, T test cases follow (without any newlines between them.) The first line of each test case contains N and M, separated by a single space. Each of the next N lines contains M characters without any spaces between them, and without any leading or trailing spaces. Each character describes the color of the corresponding cell in the garden and belongs to the set of lowercase and uppercase lettes of the English alphabet. One letter in lowercase and uppercase describes different colors. Output format For each test case, print the number of squares that conform to the definition in the problem statement. Constraints 1 ≤ T ≤ 50 1 ≤ N, M ≤ 50 Sample input 3 2 2 aa aA 3 3 aba bab aba 4 4 aabb aabb bbaa bbaa Sample output 0 1 4 Explanation In the first case the only avaliable square does not conform to the definition in the problem statement because 'a' and 'A' describes different colors. In the second case, you can select the 4 a's at the corners of the garden. In the third case, you can only make four squares, from the four 2x2 segments that are of the same color.	["# cook your dish here\nimport sys\nimport math\n\ndef main(grid):\n ans=0\n for i in range(len(grid)):\n for j in range(len(grid[0])):\n first_point=grid[i][j]\n for k in range(j+1,len(grid[0])):\n second_point=grid[i][k]\n if first_point==second_point:\n dist=k-j\n if i+dist<len(grid):\n thrid_point=grid[i+dist][j]\n fourth_point=grid[i+dist][k] \n if second_point==thrid_point and second_point==fourth_point:\n ans+=1\n return ans\n \ntest=int(input())\nfor _ in range(test):\n n,m=input().split()\n n=int(n)\n arr=[]\n for b in range(n):\n arr.append(list(input()))\n print(main(arr))", "import sys\nimport math\n\ndef main(grid):\n \n ans=0\n for i in range(len(grid)):\n \n for j in range(len(grid[0])):\n first_point=grid[i][j]\n for k in range(j+1,len(grid[0])):\n second_point=grid[i][k]\n \n if first_point==second_point:\n dist=k-j\n \n if i+dist<len(grid):\n \n thrid_point=grid[i+dist][j]\n fourth_point=grid[i+dist][k] \n if second_point==thrid_point and second_point==fourth_point:\n ans+=1\n return ans\nfor _ in range(int(input())):\n n,m=input().split()\n n=int(n)\n arr=[]\n for b in range(n):\n arr.append(list(input()))\n print(main(arr))\n \n \n\n ", "for _ in range(int(input())):\r\n N, M = map(int, input().split())\r\n array = []\r\n for i in range(N):\r\n array.append(list(input().strip()))\r\n count = 0\r\n for i in range(N-1):\r\n for j in range(M-1):\r\n for k in range(j+1, min(j + N - i, M)):\r\n if array[i][j] == array[i][k] and array[i][j] == array[i+k-j][j] and array[i][j] == array[i+k-j][k]:\r\n count += 1\r\n print(count)", "for _ in range(int(input())):\n N,M = [int(x) for x in input().split()]\n List = []\n for i in range(N):\n Temp = [x for x in input()]\n List.append(Temp)\n Ans = 0\n for i in range(N):\n for j in range(M):\n x=1\n while(i+x<N and j+x<M):\n if(List[i][j]==List[i][j+x]==List[i+x][j]==List[i+x][j+x]):\n Ans+=1\n x+=1\n print(Ans)\n ", "def check(z,i,j,r):\n x = j-i\n if r[z][i]==r[z][j]==r[z+x][i]==r[z+x][j]:\n return True\n return False \nt = int(input())\nwhile(t):\n t-=1\n count = 0\n a = list((map(int , input().split())))\n r = []\n for h in range(a[0]):\n p = list(input())\n r.append(p)\n #print(r) \n for z in range(a[0]):\n for i in range(a[1]):\n for j in range(i+1,a[1]):\n x = j-i\n if x<=(a[0]-z-1):\n if check(z,i,j,r)==True:\n count+=1\n else:\n break\n print(count) \n \n ", "def check_square(arr,nn,mm):\r\n total = 0\r\n for dim in range (2,mm+1):\r\n for row in range(nn-dim+1):\r\n for col in range(mm-dim+1):\r\n if arr[row][col]== arr[row][col+dim-1]==arr[row+dim-1][col]==arr[row+dim-1][col+dim-1]:\r\n total+=1\r\n \r\n return total\r\n\r\nfor _ in range(int(input())):\r\n n,m = map(int,input().split())\r\n garden = []\r\n for i in range(n):\r\n garden.append(input())\r\n if n==1 or m == 1:\r\n print(0)\r\n else:\r\n print(check_square(garden,n,m))"]	{"inputs": [["3", "2 2", "aa", "aA", "3 3", "aba", "bab", "aba", "4 4", "aabb", "aabb", "bbaa", "bbaa", "", ""]], "outputs": [["0", "1", "4"]]}	INTERVIEW	PYTHON3	CODECHEF	3,920
b344bd988548869907ab14c12fce8409	UNKNOWN	Ram and Shyam are playing a game of Truth and Dare. In this game, Shyam will ask Ram to perform tasks of two types: - Truth task: Ram has to truthfully answer a question. - Dare task: Ram has to perform a given task. Each task is described by an integer. (If a truth task and a dare task are described by the same integer, they are still different tasks.) You are given four lists of tasks: - $T_{r, 1}, T_{r, 2}, \dots, T_{r, t_r}$: the truth tasks Ram can perform. - $D_{r, 1}, D_{r, 2}, \dots, D_{r, d_r}$: the dare tasks Ram can perform. - $T_{s, 1}, T_{s, 2}, \dots, T_{s, t_s}$: the truth tasks Shyam can ask Ram to perform. - $D_{s, 1}, D_{s, 2}, \dots, D_{s, d_s}$: the dare tasks Shyam can ask Ram to perform. Note that the elements of these lists are not necessarily distinct, each task may be repeated any number of times in each list. Shyam wins the game if he can find a task Ram cannot perform. Ram wins if he performs all tasks Shyam asks him to. Find the winner of the game. Let's take an example where Ram can perform truth tasks $3$, $2$ and $5$ and dare tasks $2$ and $100$, and Shyam can give him truth tasks $2$ and $3$ and a dare task $100$. We can see that whichever truth or dare tasks Shyam asks Ram to perform, Ram can easily perform them, so he wins. However, if Shyam can give him dare tasks $3$ and $100$, then Ram will not be able to perform dare task $3$, so Shyam wins. -----Input----- - The first line of the input contains a single integer $T$ denoting the number of test cases. The description of $T$ test cases follows. - The first line of each test case contains a single integer $t_r$. - The second line contains $t_r$ space-separated integers $T_{r, 1}, T_{r, 2}, \dots, T_{r, t_r}$. - The third line contains a single integer $d_r$. - The fourth line contains $d_r$ space-separated integers $D_{r, 1}, D_{r, 2}, \dots, D_{r, d_r}$. - The fifth line contains a single integer $t_s$. - The sixth line contains $t_s$ space-separated integers $T_{s, 1}, T_{s, 2}, \dots, T_{s, t_s}$. - The seventh line contains a single integer $d_s$. - The eighth line contains $d_s$ space-separated integers $D_{s, 1}, D_{s, 2}, \dots, D_{s, d_s}$. -----Output----- For each test case, print a single line containing the string "yes" if Ram wins the game or "no" otherwise. -----Constraints----- - $1 \le T \le 100$ - $1 \le t_r, d_r, t_s, d_s \le 100$ - $1 \le T_{r, i} \le 100$ for each valid $i$ - $1 \le D_{r, i} \le 100$ for each valid $i$ - $1 \le T_{s, i} \le 100$ for each valid $i$ - $1 \le D_{s, i} \le 100$ for each valid $i$ -----Example Input----- 4 2 1 2 3 1 3 2 1 2 2 3 2 2 1 2 3 1 3 2 1 2 3 3 2 4 3 3 2 5 2 2 100 1 2 1 100 2 1 2 3 1 3 2 1 2 3 3 2 2 -----Example Output----- yes no yes yes -----Explanation----- Example case 1: Ram's truth tasks are $[1, 2]$ and his dare tasks are $[1, 3, 2]$. Shyam's truth tasks are $[2]$ and his dare tasks are $[3, 2]$. Ram can perform all tasks Shyam gives him. Example case 2: Ram's truth tasks are $[1, 2]$ and his dare tasks are $[1, 3, 2]$. Shyam's truth tasks are $[2]$ and his dare tasks are $[3, 2, 4]$. If Shyam asks Ram to perform dare task $4$, Ram will not be able to do it.	["# cook your dish here\nfor _ in range(int(input())):\n tr=int(input())\n trl=list(map(int,input().split()))\n dr = int(input())\n drl = list(map(int, input().split()))\n ts = int(input())\n tsl = list(map(int, input().split()))\n ds = int(input())\n dsl = list(map(int, input().split()))\n for item in tsl:\n if item in trl:\n res=1\n continue\n else:\n res=0\n break\n for item1 in dsl:\n if item1 in drl:\n res1=1\n continue\n else:\n res1=0\n break\n if res==1 and res1==1:\n print(\"yes\")\n else:\n print(\"no\")\n", "# cook your dish here\nfor i in range(int(input())):\n Tr = int(input())\n Tr = list(map(int,input().split()))\n Dr = int(input())\n Dr = list(map(int,input().split()))\n Ts = int(input())\n Ts = list(map(int,input().split()))\n Ds = int(input())\n Ds = list(map(int,input().split()))\n for i in Ts:\n if i not in Tr:\n print(\"no\")\n break\n else:\n for j in Ds:\n if j not in Dr:\n print(\"no\")\n break\n else:\n print(\"yes\")\n\n\n", "for i in range(int(input())):\r\n _ = int(input())\r\n Tr = list(map(int, input().split()))\r\n _ = int(input())\r\n Dr = list(map(int, input().split()))\r\n _ = int(input())\r\n Ts = list(map(int, input().split()))\r\n _ = int(input())\r\n Ds = list(map(int, input().split()))\r\n \r\n for j in Ts:\r\n if j not in Tr:\r\n print(\"no\")\r\n break\r\n else:\r\n for k in Ds:\r\n if k not in Dr:\r\n print(\"no\")\r\n break\r\n else:\r\n print(\"yes\")", "# cook your dish here\r\n\r\nfor i in range(int(input())):\r\n _ = int(input())\r\n Tr = list(map(int, input().split()))\r\n _ = int(input())\r\n Dr = list(map(int, input().split()))\r\n _ = int(input())\r\n Ts = list(map(int, input().split()))\r\n _ = int(input())\r\n Ds = list(map(int, input().split()))\r\n \r\n for j in Ts:\r\n if j not in Tr:\r\n print(\"no\")\r\n break\r\n else:\r\n for k in Ds:\r\n if k not in Dr:\r\n print(\"no\")\r\n break\r\n else:\r\n print(\"yes\")", "for i in range(int(input())):\n trn = int(input())\n tr = input().split(\" \")\n drn = int(input())\n dr = input().split(\" \")\n tsn = int(input())\n ts = input().split(\" \")\n dsn = int(input())\n ds = input().split(\" \")\n for j in ts:\n if j not in tr:\n print(\"no\")\n break\n else:\n for k in ds:\n if k not in dr:\n print(\"no\")\n break\n else:\n print(\"yes\")\n \n ", "def Check(ram,shyam):\n for i in shyam:\n if i not in ram:\n return False\n return True\n\nfor _ in range(int(input())):\n tR = int(input())\n Tr = list(map(int,input().split()))\n dR = int(input())\n Dr = list(map(int,input().split()))\n tS = int(input())\n Ts = list(map(int,input().split()))\n dS = int(input())\n Ds = list(map(int,input().split()))\n truthCheck = Check(Tr,Ts)\n dareCheck = Check(Dr,Ds)\n if ( truthCheck and dareCheck ):\n print(\"yes\")\n else:\n print(\"no\")\n \n", "def Check(ram,shyam):\n for i in shyam:\n if i not in ram:\n return False\n return True\n\nfor _ in range(int(input())):\n tR = int(input())\n Tr = list(map(int,input().split()))\n dR = int(input())\n Dr = list(map(int,input().split()))\n tS = int(input())\n Ts = list(map(int,input().split()))\n dS = int(input())\n Ds = list(map(int,input().split()))\n truthCheck = Check(Tr,Ts)\n dareCheck = Check(Dr,Ds)\n if ( truthCheck and dareCheck ):\n print(\"yes\")\n else:\n print(\"no\")\n ", "# cook your dish here\nfor _ in range(int(input())):\n rt = int(input())\n tr= list(map(int,input().split()))\n rd = int(input())\n dr = list(map(int,input().split()))\n st = int(input())\n ts = list(map(int,input().split()))\n sd = int(input())\n ds = list(map(int,input().split()))\n l = []\n for i in ts:\n if i in tr:\n l.append('y')\n else:\n l.append('no')\n for i in ds:\n if i in dr:\n l.append('y')\n else:\n l.append('no')\n if \"no\" in l:\n print(\"no\")\n else:\n print(\"yes\") ", "# cook your dish here\nt = int(input())\nfor i in range(t):\n truthtasks = []\n daretasks = []\n tr = int(input())\n TR = list(map(int, input().split()))\n dr = int(input())\n DR = list(map(int, input().split()))\n ts = int(input())\n TS = list(map(int, input().split()))\n ds = int(input())\n DS = list(map(int, input().split()))\n for i in TS:\n if i in TR:\n flag = 1\n else:\n flag = 0\n break\n if flag:\n for j in DS:\n if j in DR:\n flag = 1\n else:\n flag = 0\n break\n if flag:\n print('yes')\n else:\n print('no')\n \n \n \n \n ", "for _ in range(int(input())):\n tr = int(input())\n Tr = list(map(int, input().split()))\n dr = int(input())\n Dr = list(map(int, input().split()))\n ts = int(input())\n Ts = list(map(int, input().split()))\n ds = int(input())\n Ds = list(map(int, input().split()))\n \n for truth_s in Ts:\n if truth_s in Tr:\n #Tr.remove(truth_s)\n flag = 1\n else:\n flag = 0\n break \n if flag:\n for dare_s in Ds:\n if dare_s in Dr:\n #Dr.remove(dare_s)\n flag = 1\n else:\n flag = 0\n break\n \n if flag:\n print('yes')\n else:\n print('no')", "# cook your dish here\ntry:\n for _ in range(int(input())):\n c,d=0,0\n t1=int(input())\n r1=list(map(int,input().split()))\n d1=int(input())\n r2=list(map(int,input().split()))\n t2=int(input())\n r3=list(map(int,input().split()))\n d2=int(input())\n r4=list(map(int,input().split()))\n for i in range(t2):\n a=r3[i]\n if a in r1:\n c=c+1\n for i in range(d2):\n b=r4[i]\n if b in r2:\n d=d+1\n if c==len(r3) and d==len(r4):\n print(\"yes\")\n else:\n print(\"no\")\nexcept:\n pass", "for _ in range(int(input())):\r\n t_r = int(input())\r\n tr = list(map(int, input().split()))\r\n d_r = int(input())\r\n dr = list(map(int, input().split()))\r\n t_s = int(input())\r\n ts = list(map(int, input().split()))\r\n d_s = int(input())\r\n ds = list(map(int, input().split()))\r\n l = []\r\n for i in ts:\r\n if i in tr:\r\n l.append('y')\r\n else:\r\n l.append('no')\r\n for i in ds:\r\n if i in dr:\r\n l.append('y')\r\n else:\r\n l.append('no')\r\n if \"no\" in l:\r\n print(\"no\")\r\n else:\r\n print(\"yes\")", "# cook your dish here\nfor _ in range(int(input())):\n t_r = int(input())\n tr = list(map(int, input().split()))\n d_r = int(input())\n dr = list(map(int, input().split()))\n t_s = int(input())\n ts = list(map(int, input().split()))\n d_s = int(input())\n ds = list(map(int, input().split()))\n \n flag = True\n \n for t in ts:\n if t not in tr:\n flag = False\n break\n \n if flag:\n for d in ds:\n if d not in dr:\n flag = False\n break\n \n print(\"yes\" if flag else \"no\")", "# cook your dish here\nfor _ in range(int(input())):\n t_r = int(input())\n tr = list(map(int, input().split()))\n d_r = int(input())\n dr = list(map(int, input().split()))\n t_s = int(input())\n ts = list(map(int, input().split()))\n d_s = int(input())\n ds = list(map(int, input().split()))\n \n flag = True\n \n for t in ts:\n if t not in tr:\n flag = False\n break\n \n if flag:\n for d in ds:\n if d not in dr:\n flag = False\n break\n \n print(\"yes\" if flag else \"no\")", "for _ in range(int(input())):\r\n t1=int(input())\r\n ta1=list(map(int,input().split()))\r\n d1=int(input())\r\n da1=list(map(int,input().split()))\r\n t2=int(input())\r\n ta2=list(map(int,input().split()))\r\n d2=int(input())\r\n da2=list(map(int,input().split()))\r\n if(set(ta2).issubset(set(ta1)) and set(da2).issubset(set(da1))):\r\n print(\"yes\")\r\n else:\r\n print(\"no\")", "def bs(a,n,k): \n l=0 \n h=n-1 \n while(l<=h): \n mid=(l+h)//2\n if a[mid]==k: \n return 1\n if a[mid]<k: \n l=mid+1 \n else: \n h=mid-1 \n return 0\n \n \nt=int(input())\nfor kk in range(t): \n ntr=int(input()) \n tr=[int(x) for x in input ().split()] \n tr.sort()\n ndr=int(input ()) \n dr=[int(x) for x in input (). split ()] \n dr.sort()\n nts=int(input ()) \n ts=[int(x) for x in input ().split()] \n nds=int(input ()) \n ds=[int(x) for x in input ().split()] \n s=1\n for i in range(nts): \n if bs(tr,ntr,ts[i]): \n continue \n else: \n s=0 \n break\n if s==0: \n print(\"no\") \n continue\n for i in range(nds): \n if bs(dr,ndr,ds[i]): \n continue\n else: \n s=0 \n break\n if s==0: \n print(\"no\")\n continue\n if s==1: \n print(\"yes\")\n \n \n ", "try:\n for _ in range(int(input())):\n n=int(input())\n d=list(map(int,input().split()))\n s=int(input())\n p=list(map(int,input().split()))\n o=int(input())\n t=list(map(int,input().split()))\n w=int(input())\n q=list(map(int,input().split()))\n l=[]\n for i in t:\n if i in d:\n l.append(\"y\")\n else:\n l.append(\"no\")\n for i in q:\n if i in p:\n l.append(\"y\")\n else:\n l.append(\"no\") \n \n if \"no\" in l:\n print(\"no\")\n else:\n print(\"yes\")\nexcept:\n pass\n\n\n", "try:\n t = int(input())\n result = []\n for i in range(t):\n check1 = True\n check2 = True\n tr = int(input())\n trl = list(map(int, input().split()))\n dr = int(input())\n drl = list(map(int, input().split()))\n ts = int(input())\n tsl = list(map(int, input().split()))\n ds = int(input())\n dsl = list(map(int, input().split()))\n\n for j in range(ts):\n if (tsl[j] not in trl):\n check1 = False\n else:\n continue\n\n for k in range(ds):\n if (dsl[k] not in drl):\n check2 = False\n else:\n continue\n\n if (check1 == True and check2 == True):\n result.append(\"yes\")\n else:\n result.append(\"no\")\n\n for b in result:\n print(b)\n\n\n\nexcept:\n pass", "# cook your dish here\nfor _ in range(int(input())):\n t_r = int(input())\n tr = list(map(int, input().split()))\n d_r = int(input())\n dr = list(map(int, input().split()))\n t_s = int(input())\n ts = list(map(int, input().split()))\n d_s = int(input())\n ds = list(map(int, input().split()))\n \n flag = True\n \n for t in ts:\n if t not in tr:\n flag = False\n break\n \n if flag:\n for d in ds:\n if d not in dr:\n flag = False\n break\n \n print(\"yes\" if flag else \"no\")\n", "# cook your dish here\nfor _ in range(int(input())):\n t_r = int(input())\n tr = list(map(int, input().split()))\n d_r = int(input())\n dr = list(map(int, input().split()))\n t_s = int(input())\n ts = list(map(int, input().split()))\n d_s = int(input())\n ds = list(map(int, input().split()))\n \n flag = True\n \n for t in ts:\n if t not in tr:\n flag = False\n break\n \n if flag:\n for d in ds:\n if d not in dr:\n flag = False\n break\n \n print(\"yes\" if flag else \"no\")\n", "# cook your dish here\nfor _ in range(int(input())):\n t_r = int(input())\n tr = list(map(int, input().split()))\n d_r = int(input())\n dr = list(map(int, input().split()))\n t_s = int(input())\n ts = list(map(int, input().split()))\n d_s = int(input())\n ds = list(map(int, input().split()))\n \n flag = True\n \n for t in ts:\n if t not in tr:\n flag = False\n break\n \n if flag:\n for d in ds:\n if d not in dr:\n flag = False\n break\n \n print(\"yes\" if flag else \"no\")", "# cook your dish here\n# cook your dish here\nfor _ in range(int(input())):\n t_r = int(input())\n tr = list(map(int, input().split()))\n d_r = int(input())\n dr = list(map(int, input().split()))\n t_s = int(input())\n ts = list(map(int, input().split()))\n d_s = int(input())\n ds = list(map(int, input().split()))\n \n flag = True\n \n for t in ts:\n if t not in tr:\n flag = False\n break\n \n if flag:\n for d in ds:\n if d not in dr:\n flag = False\n break\n \n print(\"yes\" if flag else \"no\")", "# cook your dish here\nfor _ in range(int(input())):\n t_r = int(input())\n tr = list(map(int, input().split()))\n d_r = int(input())\n dr = list(map(int, input().split()))\n t_s = int(input())\n ts = list(map(int, input().split()))\n d_s = int(input())\n ds = list(map(int, input().split()))\n \n flag = True\n \n for t in ts:\n if t not in tr:\n flag = False\n break\n \n if flag:\n for d in ds:\n if d not in dr:\n flag = False\n break\n \n print(\"yes\" if flag else \"no\")# cook your dish here\n", "# cook your dish here\nfor _ in range(int(input())):\n t_r = int(input())\n tr = list(map(int, input().split()))\n d_r = int(input())\n dr = list(map(int, input().split()))\n t_s = int(input())\n ts = list(map(int, input().split()))\n d_s = int(input())\n ds = list(map(int, input().split()))\n \n flag = True\n \n for t in ts:\n if t not in tr:\n flag = False\n break\n \n if flag:\n for d in ds:\n if d not in dr:\n flag = False\n break\n \n print(\"yes\" if flag else \"no\")\n \n ", "for _ in range(int(input())):\n t_r = int(input())\n tr = list(map(int, input().split()))\n d_r = int(input())\n dr = list(map(int, input().split()))\n t_s = int(input())\n ts = list(map(int, input().split()))\n d_s = int(input())\n ds = list(map(int, input().split()))\n \n flag = True\n \n for t in ts:\n if t not in tr:\n flag = False\n break\n \n if flag:\n for d in ds:\n if d not in dr:\n flag = False\n break\n \n print(\"yes\" if flag else \"no\")\n \n "]	{"inputs": [["4", "2", "1 2", "3", "1 3 2", "1", "2", "2", "3 2", "2", "1 2", "3", "1 3 2", "1", "2", "3", "3 2 4", "3", "3 2 5", "2", "2 100", "1", "2", "1", "100", "2", "1 2", "3", "1 3 2", "1", "2", "3", "3 2 2", ""]], "outputs": [["yes", "no", "yes", "yes"]]}	INTERVIEW	PYTHON3	CODECHEF	16,163
d0ee3a020d4f9cfd829227d9d715914d	UNKNOWN	An encoder encodes the first $16$ lowercase English letters using $4$ bits each. The first bit (from the left) of the code is $0$ if the letter lies among the first $8$ letters, else it is $1$, signifying that it lies among the last $8$ letters. The second bit of the code is $0$ if the letter lies among the first $4$ letters of those $8$ letters found in the previous step, else it's $1$, signifying that it lies among the last $4$ letters of those $8$ letters. Similarly, the third and the fourth bit each signify the half in which the letter lies. For example, the letter $j$ would be encoded as : - Among $(a,b,c,d,e,f,g,h$ $\|$ $i,j,k,l,m,n,o,p)$, $j$ appears in the second half. So the first bit of its encoding is $1$. - Now, among $(i,j,k,l$ $\|$ $m,n,o,p)$, $j$ appears in the first half. So the second bit of its encoding is $0$. - Now, among $(i,j$ $\|$ $k,l)$, $j$ appears in the first half. So the third bit of its encoding is $0$. - Now, among $(i$ $\|$ $j)$, $j$ appears in the second half. So the fourth and last bit of its encoding is $1$. So $j$'s encoding is $1001$, Given a binary encoded string $S$, of length at most $10^5$, decode the string. That is, the first 4 bits are the encoding of the first letter of the secret message, the next 4 bits encode the second letter, and so on. It is guaranteed that the string's length is a multiple of 4. -----Input:----- - The first line of the input contains an integer $T$, denoting the number of test cases. - The first line of each test case contains an integer $N$, the length of the encoded string. - The second line of each test case contains the encoded string $S$. -----Output:----- For each test case, print the decoded string, in a separate line. -----Constraints----- - $1 \leq T \leq 10$ - $4 \leq N \leq 10^5$ - The length of the encoded string is a multiple of $4$. - $0 \le S_i \le 1$ -----Subtasks----- - $100$ points : Original constraints. -----Sample Input:----- 3 4 0000 8 00001111 4 1001 -----Sample Output:----- a ap j -----Explanation:----- - Sample Case $1$ : The first bit is $0$, so the letter lies among the first $8$ letters, i.e., among $a,b,c,d,e,f,g,h$. The second bit is $0$, so it lies among the first four of these, i.e., among $a,b,c,d$. The third bit is $0$, so it again lies in the first half, i.e., it's either $a$ or $b$. Finally, the fourth bit is also $0$, so we know that the letter is $a$. - Sample Case $2$ : Each four bits correspond to a character. Just like in sample case $1$, $0000$ is equivalent to $a$. Similarly, $1111$ is equivalent to $p$. So, the decoded string is $ap$. - Sample Case $3$ : The first bit is $1$, so the letter lies among the last $8$ letters, i.e., among $i,j,k,l,m,n,o,p$. The second bit is $0$, so it lies among the first four of these, i.e., among $i,j,k,l$. The third bit is $0$, so it again lies in the first half, i.e., it's either $i$ or $j$. Finally, the fourth bit is $1$, so we know that the letter is $j$.	["# cook your dish here\ndef decode(L,S):\n str_2=\"\"\n lst=[]\n for i in range(L//4):\n str_1 = \"abcdefghijklmnop\"\n S_1=S[(i4):(4(i+1))]\n for j in range(4):\n if(S_1[j]==\"1\"):\n str_1=str_1[len(str_1)//2:len(str_1)]\n else:\n str_1 = str_1[0:len(str_1) // 2]\n str_2=str_2+str_1\n print(str_2)\n\nT=int(input())\nfor i in range(T):\n L=int(input())\n S=input()\n decode(L,S)\n", "testcases = int(input())\nalphabet = 'aiemckgobjfndlhp'\n\nfor testcase in range(testcases):\n length = int(input())\n code = input()\n string = ''\n for byte in range(0,length,4):\n letter = code[:4]\n num = (int(code[3])8+int(code[2])4+int(code[1])2+int(code[0]))\n string += alphabet[num]\n code = code[4:]\n print(string)", "# cook your dish here\nt=int(input())\nfor e in range(t):\n n=int(input())\n s=input()\n ans=''\n for i in range(0,n,4):\n s2=s[i]+s[i+1]+s[i+2]+s[i+3]\n l=[chr(q) for q in range(97,113)]\n for z in s2:\n if z=='0':\n l=l[0:int(len(l)/2)]\n else:\n l=l[int(len(l)/2):]\n ans=ans+l[0]\n print(ans)", "# cook your dish here\nt=int(input())\nwhile t>0:\n n=int(input())\n str1= input()\n str3=\"\"\n for i in range(0,n,4):\n str2=str1[i]+str1[i+1]+str1[i+2]+str1[i+3]\n l1=['a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p']\n for j in str2:\n if j=='0':\n l1=l1[:int(len(l1)/2)]\n else:\n l1=l1[int(len(l1)/2):]\n #print(l1)\n str3+=l1[0]\n print(str3)\n \n t=t-1", "# cook your dish here\nfor _ in range(int(input())):\n n=int(input())\n s=input()\n d={'0000':'a','0001':'b','0010':'c','0011':'d',\n '0100':'e','0101':'f','0110':'g','0111':'h',\n '1000':'i','1001':'j','1010':'k','1011':'l',\n '1100':'m','1101':'n','1110':'o','1111':'p'}\n a=\"\"\n for i in range(0,n,4):\n x=s[i:i+4]\n a+=d.get(x)\n print(a)\n \n", "# cook your dish here\ndef find(n,i):\n if i=='0':\n return n//2\n else:\n return n\n \nalphabets=['a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p']\ntest=int(input())\nwhile(test!=0):\n bits=int(input())\n li=list(input())\n k=0\n while(bits>=4):\n t=16\n s=''\n for i in range(k,k+4):\n s=s+li[i]\n bits=bits-4\n k=k+4\n s=int(s,2)\n print(alphabets[s],end=\"\")\n print()\n test=test-1", "# cook your dish here\nfor _ in range(int(input())):\n n = int(input())\n lst = ['a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p']\n f = lst\n o = ''\n fo = ''\n s = input()\n for i in range(n+1):\n if i%4==0:\n fo+=o\n f = lst\n if i==n:\n break\n if int(s[i])==0:\n f = f[:len(f)//2]\n o = f[0]\n elif int(s[i])==1:\n f = f[len(f)//2:]\n o = f[0]\n print(fo)\n", "# cook your dish here\nfor i in range(int(input())):\n n = int(input())\n a = str(input())\n d = {'0000':'a','0001':'b','0010':'c','0011':'d',\n '0100':'e','0101':'f','0110':'g','0111':'h',\n '1000':'i','1001':'j','1010':'k','1011':'l',\n '1100':'m','1101':'n','1110':'o','1111':'p'}\n\n ans = ''\n for i in range(0,len(a),4):\n x = a[i:i+4]\n ans+=(d.get(x))\n print(ans)", "# cook your code here\nzz= int(input(''))\nfor j in range(zz):\n xx=int(input(''))\n x=list(input(''))\n kk=0\n sos=''\n for i in range (xx,0,-4):\n t=3\n c=0\n for k in range (4):\n c=c+(int(x[kk])(2t))\n kk=kk+1\n t=t-1\n sos=sos+ chr(c+97)\n print(sos)", "# cook your dish here\nmap_dict={'0000':'a',\n '0001':'b',\n '0010':'c',\n '0011':'d',\n '0100':'e',\n '0101':'f',\n '0110':'g',\n '0111':'h',\n '1000':'i',\n '1001':'j',\n '1010':'k',\n '1011':'l',\n '1100':'m',\n '1101':'n',\n '1110':'o',\n '1111':'p'}\ndef decode_it(s):\n l=len(s)\n ch_list=[]\n for i in range(0,l,4):\n ind=s[i:i+4]\n x=map_dict[ind]\n ch_list.append(x)\n return \"\".join(ch_list)\nT=int(input())\nwhile T > 0:\n l=int(input())\n s=input()\n print(decode_it(s))\n T-=1", "d=['a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p']\nfor t in range(int(input())):\n n = int(input())\n s=input()\n string=''\n for i in range(0,n-3,4):\n string+=d[int(s[i:i+4],2)]\n print(string)", "# cook your dish here \nt=int(input())\nwhile(t): \n k=int(input())\n s=input()\n n=4\n l = [s[i:i+n] for i in range(0, k, n)] \n li=[]\n for i in l:\n \n li.append(chr(int(i,2)+97)) \n \n print(\"\".join(i for i in li))\n \n t-=1", "def find_string(k):\n f=\"abcdefghijklmnop\"\n for i in range(0,len(k)): \n if k[i]==\"1\": \n f=f[len(f)//2:] \n elif k[i]==\"0\":\n f=f[:len(f)//2]\n return f\nt=int(input())\nwhile(t):\n o=int(input())\n k=input()\n res=\"\"\n j=0\n while j+3 in range(len(k)):\n res=res+find_string(k[j:j+4])\n j=j+4\n print(res)\n t=t-1\n", "# cook your dish here\nt=int(input())\nwhile t>0:\n n=int(input())\n s=input()\n arr=[]\n for i in range(97,113):\n arr.append(chr(i))\n i=0\n while i<n:\n k=0\n l=15\n while k<l:\n m=(k+l)//2\n if k>=l:\n break\n if s[i]=='0':\n l=m\n elif s[i]=='1':\n k=m+1\n \n i=i+1\n print(arr[k],end=\"\")\n print() \n t=t-1", "# cook your dish here\ndef division(x,s):\n l=[]\n for i in range(0,s,4):\n l.append(x[i:i+4])\n return l\nt=int(input())\nfor i in range(t):\n size=int(input())\n x=input()\n s=division(x,size)\n string=\"\"\n for i in s:\n sum1=0\n for j in range(4):\n sum1+=(2(3-j))int(i[j])\n sum1+=97\n string+=chr(sum1)\n print(string)\n \n\n", "# cook your dish here\ndef division(x,s):\n l=[]\n for i in range(0,s,4):\n l.append(x[i:i+4])\n return l\nt=int(input())\nfor i in range(t):\n size=int(input())\n x=input()\n s=division(x,size)\n string=\"\"\n for i in s:\n sum1=0\n for j in range(4):\n sum1+=(2(3-j))int(i[j])\n sum1+=97\n string+=chr(sum1)\n print(string)\n \n\n", "for _ in range(int(input())):\n l=int(input())\n s=input()\n string=\"abcdefghijklmnop\"\n decode=''\n for b in range(0,l,4):\n string=\"abcdefghijklmnop\"\n for a in range(b,b+4):\n if s[a]=='0':\n n=len(string)//2\n string=string[0:n]\n elif s[a]=='1':\n n=len(string)\n string=string[(n//2):n]\n decode=decode+string\n print(decode)", "# cook your dish here\nfor i in range(int(input())):\n N = int(input())\n S = input()\n for i in range(0, N, 4):\n print(chr(97 + int(S[i:i+4], 2)), end='')\n print('')", "for _ in range(int(input())):\n N = int(input())\n S = input()\n for i in range(0, N, 4):\n print(chr(97 + int(S[i:i+4], 2)), end='')\n print('')", "import sys\nimport math\n\n\nclass Test:\n N=0\n S=[]\n def __init__(self):\n tmp=input().split()\n self.N=int(tmp[0])\n self.S=[int(i) for i in input()]\n\nclass Input:\n T=0\n test=[]\n def __init__(self):\n self.T=int(input())\n for i in range(0,self.T):\n self.test.append(Test())\n\nletter=[]\nletter.append([])\nletter.append([])\nletter[0].append([])\nletter[0].append([])\nletter[1].append([])\nletter[1].append([])\nletter[0][0].append([])\nletter[0][0].append([])\nletter[0][1].append([])\nletter[0][1].append([])\nletter[1][0].append([])\nletter[1][0].append([])\nletter[1][1].append([])\nletter[1][1].append([])\n\nletter[0][0][0].append(\"a\")\nletter[0][0][0].append(\"b\")\nletter[0][0][1].append(\"c\")\nletter[0][0][1].append(\"d\")\nletter[0][1][0].append(\"e\")\nletter[0][1][0].append(\"f\")\nletter[0][1][1].append(\"g\")\nletter[0][1][1].append(\"h\")\nletter[1][0][0].append(\"i\")\nletter[1][0][0].append(\"j\")\nletter[1][0][1].append(\"k\")\nletter[1][0][1].append(\"l\")\nletter[1][1][0].append(\"m\")\nletter[1][1][0].append(\"n\")\nletter[1][1][1].append(\"o\")\nletter[1][1][1].append(\"p\")\ndef getletter(i, j, k, l):\n return letter[i][j][k][l]\n\ndef test_case(t:Test):\n sum=0\n i=0\n string=\"\"\n while i + 3 < len(t.S):\n string+=getletter(t.S[i], t.S[i+1], t.S[i+2],t.S[i+3])\n i+=4\n print(string)\n\ninp=Input()\nfor test in inp.test:\n test_case(test)\n", "# cook your dish her\nt=int(input())\nwhile(t):\n a=['a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p']\n n=int(input())\n s=input()\n res=''\n for i in range(0,len(s),4):\n res=res+a[int(s[i:i+4],2)]\n print(res)\n t-=1\n"]	{"inputs": [["3", "4", "0000", "8", "00001111", "4", "1001"]], "outputs": [["a", "ap", "j"]]}	INTERVIEW	PYTHON3	CODECHEF	7,990
a61e80a517cd34f4039cc226ab665a4c	UNKNOWN	Chef wants to serve mankind by making people immortal by preparing a dish, a dish of life - a dish with the best taste in the universe, one with the smell and splash of fresh water flowing down the springs of the mountain, one with the smell of the best lily flowers of the garden, one that has contained the very essence of life in a real sense. This dish will contain K ingredients that are found only in remote islands amid mountains. For sake of convenience, we enumerate the ingredients by the integers from 1 to K, both inclusive. There are N islands and each of them offers some ingredients. Chef being a little child did not know how to collect the ingredients for the recipe. He went to all the islands and bought all the ingredients offered in each island. Could he possibly have saved some time by skipping some island? If it was not possible for Chef to collect the required ingredients (i.e. all the K ingredients), output "sad". If it was possible for him to skip some islands, output "some", otherwise output "all". -----Input----- First line of the input contains an integer T denoting number of test cases. The description of T test cases follow. The first line of each test case contains two space separated integers N, K. The i-th of the next lines will contain first an integer Pi, denoting the number of ingredients grown in the i-th island, followed by Pi distinct integers in the range [1, K]. All the integers are space separated. -----Output----- For each test case, output a single line containing one of the strings "sad", "all" or "some" (without quotes) according to the situation. -----Constraints----- - 1 ≤ T ≤ 10 - 1 ≤ N, K ≤ 105 - 1 ≤ Pi ≤ K - Sum of Pi over all test cases ≤ 106 -----Subtasks----- Subtask #1 (30 points) - 1 ≤ N, K ≤ 50 Subtask #2 (30 points) - 1 ≤ K ≤ 50 Subtask #3 (40 points) - original constraints -----Example----- Input 3 3 4 3 1 2 3 2 1 3 2 1 2 2 3 3 1 2 3 2 1 3 2 3 2 1 2 2 1 3 Output sad some all -----Explanation----- Example 1. The ingredient 4 is not available in any island, so Chef can't make the dish of life. Hence, the answer is "sad". Example 2. Chef can just go to the first island and collect all the three ingredients required. He does not need to visit the second island. So, the answer is "some". Example 3. Chef has to visit both the islands in order to obtain all the three ingredients. So, the answer is "all".	["for _ in range(int(input())):\n n,k = list(map(int,input().split()))\n array = []\n tot = []\n for _ in range(n):\n temp = list(map(int,input().split()))\n aa = temp[0]\n del(temp[0])\n temp.sort()\n temp.insert(0,aa)\n array.append(temp)\n dic = {}\n array.sort(reverse=True)\n for i in array:\n del(i[0])\n for i in range(1,k+1):\n dic[i] = False\n count = 0\n for i in array:\n count += 1\n # print(count,tot)\n for j in i:\n if(dic[j]==True):\n pass\n else:\n tot.append(j)\n dic[j]=True\n if(len(tot)==k):\n break\n if(len(tot)!=k):\n print(\"sad\")\n elif(count!=n):\n print(\"some\")\n else:\n print(\"all\")", "for _ in range(int(input())):\n n,k = list(map(int,input().split()))\n array = []\n tot = []\n for _ in range(n):\n temp = list(map(int,input().split()))\n aa = temp[0]\n del(temp[0])\n temp.sort()\n temp.insert(0,aa)\n array.append(temp)\n dic = {}\n array.sort(reverse=True)\n for i in array:\n del(i[0])\n for i in range(1,k+1):\n tot.append(i)\n dic[i] = False\n count = 0\n for i in array:\n count += 1\n # print(count,tot)\n for j in i:\n if(dic[j]==True):\n pass\n else:\n tot.remove(j)\n dic[j]=True\n if(len(tot)==0):\n break\n if(len(tot)!=0):\n print(\"sad\")\n elif(count!=n):\n print(\"some\")\n else:\n print(\"all\")", "for _ in range(int(input())):\n n,k = list(map(int,input().split()))\n array = []\n tot = []\n for _ in range(n):\n temp = list(map(int,input().split()))\n aa = temp[0]\n del(temp[0])\n temp.sort()\n temp.insert(0,aa)\n array.append(temp)\n array.sort(reverse=True)\n for i in array:\n del(i[0])\n for i in range(1,k+1):\n tot.append(i)\n count = 0\n for i in array:\n count += 1\n # print(count,tot)\n for j in i:\n if(j in tot):\n tot.remove(j)\n if(len(tot)==0):\n break\n if(len(tot)!=0):\n print(\"sad\")\n elif(count!=n):\n print(\"some\")\n else:\n print(\"all\")", "for q in range(int(input())):\n n,k=list(map(int,input().split()))\n test=[]\n z=[]\n f=0\n for i in range(n):\n l=[int(i) for i in input().split()]\n l=l[1:]\n z.append(l)\n c=[0](k+1)\n for i in range(n):\n for j in z[i]:\n c[j]+=1\n for i in range(1,k+1):\n if c[i]==0:\n print(\"sad\")\n f=1\n break\n if f==1:\n continue\n for i in range(n):\n cnt=0\n for j in z[i]:\n if c[j]!=1:\n cnt+=1\n if cnt==len(z[i]):\n print(\"some\")\n break\n else:\n print(\"all\")\n \n \n \n", "\n#island=[[0 for i in range(k+2)]for j in range(n)\nfor _ in range(int(input())):\n island=[]\n n,k=map(int,input().split())\n for i in range(n):\n l=[int(i) for i in input().split()]\n l=l[1:]\n island.append(l)\n cnt=[0](k+1)\n for i in range(n):\n for indigrient in island[i]:\n cnt[indigrient]+=1 \n f=1 \n for i in range(1,k+1):\n if cnt[i]==0:\n f=0 \n break \n if not f:\n print('sad')\n continue \n f1=0 \n # print(island)\n for i in range(n):\n f2=1 \n for j in island[i]:\n if cnt[j]==1:\n f2=0\n if f2:\n f1=1 \n break \n if f1:\n print('some')\n else:\n print('all')"]	{"inputs": [["3", "3 4", "3 1 2 3", "2 1 3", "2 1 2", "2 3", "3 1 2 3", "2 1 3", "2 3", "2 1 2", "2 1 3"]], "outputs": [["sad", "some", "all"]]}	INTERVIEW	PYTHON3	CODECHEF	3,038
4c0bad2dd8066126e6c1bfa51b338e4a	UNKNOWN	Motu and Patlu are playing with a Magical Ball. Patlu find some interesting pattern in the motion of the ball that ball always bounce back from the ground after travelling a linear distance whose value is some power of $2$. Patlu gave Motu total distance $D$ travelled by the ball and ask him to calculate the minimum number of bounces that the ball makes before coming to rest. -----Input:----- - First line will contain $T$, number of testcases. Then the testcases follow. - Each testcase contains of a single line of input, single integers $D$. - Note : Power of $2$ must be a non-negative integer. -----Output:----- For each testcase, output in a single line answer, the minimum number of bounces the ball makes before coming to rest. -----Constraints----- - $1 \leq T \leq 10^5$ - $1$ $\leq$ $M$< $10$^18 -----Sample Input:----- 1 13 -----Sample Output:----- 2 -----EXPLANATION:-----	["# cook your dish here\r\ntest=int(input())\r\nfor _ in range(test):\r\n n=int(input())\r\n n=list(bin(n))\r\n ans=n.count('1')\r\n print(ans-1)", "# cook your dish here\nt=int(input())\nfor i in range(t):\n n=int(input())\n binary=bin(n)\n setb=[ones for ones in binary[2:] if ones=='1']\n print(len(setb)-1)\n", "# cook your dish here\nimport math\ntry:\n \n t=int(input())\n\n while(t>0):\n n=int(input())\n c=0\n '''while(n>=1):\n if(n%2==1):\n c=c+1\n n=n//2'''\n m=n\n s=0\n if(math.log2(n)-int(math.log2(n))==0):\n print(0)\n else:\n while(n>=2):\n if(bool(math.log2(n))):\n c=c+1\n r=2(int(math.log2(n)))\n s=s+r \n n=n-r\n \n if(s==m):\n c=c-1\n #print(n)\n print(c)\n t=t-1\nexcept:\n pass", "test=int(input())\r\nfor _ in range(test):\r\n n=int(input())\r\n n=list(bin(n))\r\n ans=n.count('1')\r\n print(ans-1)", "# cook your dish here\nimport math;\ncount = 0;\n\ndef steps(num):\n nonlocal count;\n \n expo=int(math.log(num,2));\n nearPow=int(pow(2,expo));\n if(nearPow==num):\n return count;\n num-=nearPow;\n count+=1;\n if(num==1):\n return count;\n else:\n steps(num);\n return count;\n\n \niterator=int(input());\nwhile(iterator>0):\n count=0;\n num=int(input());\n print((steps(abs(num))));\n iterator-=1;\n", "try:\n t = int(input())\n for _ in range(t):\n N = int(input())\n a = bin(N)\n\n print(a.count('1') -1 )\n\nexcept:\n pass", "# cook your dish here\nimport math\nt=int(input())\nfor i in range(t):\n k=int(input())\n count=0\n temp=(int(math.log2(k)))\n for j in range(temp,-1,-1):\n if((k-(2j))>=0):\n k=k-(2j)\n \n count=count+1\n print(count-1)\n", "def countBits(n):\r\n\tcount=0\r\n\twhile n>0:\r\n\t\tn = n &n-1\r\n\t\tcount+=1\r\n\treturn count\t\r\n\r\nt = int(input())\r\nfor _ in range(t):\r\n\tn = int(input())\r\n\tprint(countBits(n)-1)", "# cook your dish here\ndef balls():\n d=int(input())\n i=0\n while(1):\n if (2i)>d:\n i-=1 \n break\n i+=1 \n temp=0\n result=0\n j=i \n while(j>=0):\n if (temp+(2j))==d:\n return result\n if (temp+(2j))>d:\n j-=1 \n else:\n temp+=(2*j)\n result+=1\n return result\nt=int(input())\nfor loop in range(t):\n print(balls())", "for i in range(int(input())):\r\n a=int(input())\r\n sum=0\r\n x=2\r\n while (a//x)!=0:\r\n sum+=1\r\n x=2\r\n \r\n temp=0\r\n while a>=0 and sum>=0:\r\n if 2sum<=a:\r\n a-=(2sum)\r\n temp+=1\r\n sum -= 1\r\n\r\n print(temp-1)\r\n", "for i in range(int(input())):\r\n a=int(input())\r\n sum=0\r\n x=2\r\n while (a//x)!=0:\r\n sum+=1\r\n x=2\r\n \r\n temp=0\r\n while a>=0 and sum>=0:\r\n if 2sum<=a:\r\n a-=(2sum)\r\n temp+=1\r\n sum -= 1\r\n\r\n print(temp-1)\r\n", "import math as m\nfor _ in range(int(input())):\n d=int(input())\n p=d\n c=0\n while(True):\n a=int(m.log2(d))\n c=c+1\n d=d-2a\n if d==1 or d==0:\n if p%2==0:\n c=c-1\n print(c)\n break\n else:\n print(c)\n break", "import math\r\nT=int(input())\r\nfor _ in range(T):\r\n D=int(input())\r\n count=0\r\n while D>0:\r\n p = int(math.log(D, 2))\r\n D = D - 2p\r\n count+=1\r\n print(count-1)", "# cook your dish here\nimport math\nt=int(input())\nfor _ in range(t):\n n=int(input())\n if math.ceil(math.log2(n))== math.floor(math.log2(n)):\n print(0)\n else:\n x,c=0,0\n while n>0:\n x=2math.floor(math.log2(n))\n c+=1\n n=n-x\n if math.ceil(math.log2(n))== math.floor(math.log2(n)):\n break\n print(c) \n", "import math\nt = int(input())\nwhile(t!=0):\n d = int(input())\n bounce=0\n while(d>0):\n p = int(math.log(d,2))\n d = d- (pow(2,p))\n if(d!=0):\n bounce+=1;\n print(int(bounce))\n t-=1", "# cook your dish here\ndef ConDecBin(num, count):\n\tcount += num%2\n\tif num > 1:\n\t\tConDecBin(num//2, count)\n\telse:\n\t\tprint(count - 1)\n\nfor k in range(int(input())):\n\tnum = int(input())\n\tcount = 0\n\n\tConDecBin(num, count)", "# def b(n):\r\n# str=\"\"\r\n# if n>1:\r\n# b(n//2)\r\n# print(n%2,end=\"\")\r\nt=int(input())\r\nfor i in range(t):\r\n n=int(input())\r\n # b(n)\r\n binary=bin(n)\r\n setBits=[ones for ones in binary[2:] if ones=='1']\r\n print(len(setBits)-1)\r\n", "try:\n t=int(input())\n for i in range(t):\n d=int(input())\n li=list(bin(d))\n print(li.count('1')-1)\nexcept:\n pass\n", "# cook your dish here\nimport numpy as np\n\ndef bb(d):\n if(d==0):\n return 0\n elif(d==1 or d==2):\n return 1\n else:\n return 1+bb(d-2*int(np.log2(d)))\n\n\nT = int(input())\ntests = np.zeros(T)\nfor i in range(T):\n tests[i] = int(input())\n print(bb(tests[i])-1)", "def bitsoncount(x):\n return bin(x).count('1')\nfor t in range(int(input())):\n x = int(input())\n if x == 0:\n print(0)\n else:\n\n print(bitsoncount(x)-1)", "for _ in range(int(input())):\n a=int(input())\n b=list(bin(a))\n print(b.count('1')-1)\n", "t=int(input())\r\nwhile(t!=0):\r\n k=0\r\n n=int(input())\r\n if n&n-1==0:\r\n print(0)\r\n else:\r\n while(n!=0):\r\n n=n&n-1\r\n k+=1\r\n print(k-1)\r\n t-=1\r\n\r\n\r\n", "t=int(input())\r\nwhile(t!=0):\r\n k=0\r\n n=int(input())\r\n if n==1:\r\n print(0)\r\n elif n&n-1==0:\r\n print(0)\r\n else:\r\n while(n!=0):\r\n n=n&n-1\r\n k+=1\r\n print(k-1)\r\n t-=1\r\n\r\n\r\n", "import math\nfor _ in range(int(input())):\n d=int(input())\n c=0\n while d>0:\n n=math.floor(math.log2(d))\n x=pow(2,n)\n d-=x\n c+=1\n print(c-1)", "for _ in range(int(input())):\r\n d=int(input())\r\n print(str(bin(d)).count(\"1\")-1)"]	{"inputs": [["1", "13"]], "outputs": [["2"]]}	INTERVIEW	PYTHON3	CODECHEF	6,800
99f24491321b5bb9201a0b9178a2aaf5	UNKNOWN	Two players are playing a game. The game is played on a sequence of positive integer pairs. The players make their moves alternatively. During his move the player chooses a pair and decreases the larger integer in the pair by a positive multiple of the smaller integer in the pair in such a way that both integers in the pair remain positive. If two numbers in some pair become equal then the pair is removed from the sequence. The player who can not make any move loses (or in another words the player who encounters an empty sequence loses). Given the sequence of positive integer pairs determine whether the first player can win or not (assuming that both players are playing optimally). -----Input----- The first line of the input contains an integer T denoting the number of test cases. The description of T test cases follows. Each test starts with an integer N denoting the number of pairs. Each of the next N lines contains a pair of positive integers. -----Output----- For each test case, output a single line containing "YES" if the first player can win and "NO" otherwise. -----Constraints----- - 1 ≤ T ≤ 100 - 1 ≤ N ≤ 100 - All other integers are between 1 to 108 - The integers in each pair will be different -----Example----- Input: 3 1 2 3 2 4 5 5 6 2 2 3 3 5 Output: NO NO YES -----Explanation----- Example case 1. The first player don't have any choice other subtracting 2 from 3. So during the turn of the second player integer pair will be (2,1). The second player will win by subtracting 1 from 2. Example case 2. If the first player choose to move (4,5) to (4,1) the second player will make it to (1,1). If the first player choose to move (5,6) to (5,1) the second player will make it to (1,1). So regardless of the move of the first player, the second will always win. Example case 3. The first player will select pair (3,5) and make it to (3,2). Now both pairs are equal. So whatever the move of second player he will just mirror that move in another pair. This will ensure his win.	["import sys\n\nt = int(input())\n\ndef g(a,b):\n if (a > b):\n tmp = a\n a = b\n b = tmp\n if (b == a):\n return 0\n if (b % a == 0):\n return int(b/a)-1\n r = g(b%a,a)\n q = int(b/a)\n if (r >= q):\n return q-1\n else:\n return q\n\ndef mex(x):\n n = len(list(x.keys()))\n for i in range(n):\n if (i not in x):\n return i\n return i\n\ndef g2(a,b):\n if (a == b):\n return 0\n if (a > b):\n tmp = a\n a = b\n b = tmp\n if (b % a == 0):\n return int(b/a)-1\n q = int(b/a)\n x = {}\n r = b % a\n for i in range(q):\n x[g2(r+i*a,a)] = True\n return mex(x)\n\n#print(str(g(6,33))+\" \"+str(g2(6,33)))\n\nwhile (t):\n\n n = int(input())\n x = 0\n while (n):\n line = input().split()\n a = int(line[0])\n b = int(line[1])\n x ^= g(a,b)\n n -= 1\n if (x):\n sys.stdout.write(\"YES\\n\")\n else:\n sys.stdout.write(\"NO\\n\")\n #print(str(g(a,b)) + \" \" + str(g2(a,b)))\n t -= 1"]	{"inputs": [["3", "1", "2 3", "2", "4 5", "5 6", "2", "2 3", "3 5"]], "outputs": [["NO", "NO", "YES"]]}	INTERVIEW	PYTHON3	CODECHEF	898
54f17b59bcf1c8cd30aa3aafea7f711c	UNKNOWN	The chef is trying to solve some pattern problems, Chef wants your help to code it. Chef has one number K to form a new pattern. Help the chef to code this pattern problem. -----Input:----- - First-line will contain $T$, the number of test cases. Then the test cases follow. - Each test case contains a single line of input, one integer $K$. -----Output:----- For each test case, output as the pattern. -----Constraints----- - $1 \leq T \leq 100$ - $1 \leq K \leq 100$ -----Sample Input:----- 4 1 2 3 4 -----Sample Output:----- * * * * * * * * * * *** *** * * * * *** * *** ***** -----EXPLANATION:----- No need, else pattern can be decode easily.	["# cook your dish here\nfor i in range(int(input())):\n n=int(input())\n p=1\n l=n-1\n for j in range(n):\n for k in range(l):\n print(\" \",end='')\n for k in range(p):\n print(\"\",end='')\n print()\n for k in range(l):\n print(\" \",end='')\n for k in range(p):\n print(\"\",end='')\n print()\n p+=2\n l-=1\n ", "t=int(input())\r\nfor _ in range(t):\r\n n=int(input())\r\n for i in range(n):\r\n print(\" \"(n-i-1)+''(2i+1))\r\n print(\" \"(n-i-1)+''(2i+1))\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n", "for _ in range(int(input())):\n n=int(input())\n for i in range(0,n):\n print((n-i)' '+(2i+1)\"\")\n print((n-i)' '+(2i+1)\"\")\n i=i+2\n'''\n\n\n \n \n*\n\n \n \n \n \n**\n**\n \n \n \n \n **\n *\n***\n****'''", "from sys import stdin, stdout\nfrom math import floor, gcd, fabs, factorial, fmod, sqrt, inf, log\nfrom collections import defaultdict as dd, deque\nfrom heapq import merge, heapify, heappop, heappush, nsmallest\nfrom bisect import bisect_left as bl, bisect_right as br, bisect\nmod = pow(10, 9) + 7\nmod2 = 998244353\ndef inp(): return stdin.readline().strip()\ndef out(var, end=\"\\n\"): stdout.write(str(var)+\"\\n\")\ndef outa(var, end=\"\\n\"): stdout.write(' '.join(map(str, var)) + end)\ndef lmp(): return list(mp())\ndef mp(): return list(map(int, inp().split()))\ndef smp(): return list(map(str, inp().split()))\ndef l1d(n, val=0): return [val for i in range(n)]\ndef l2d(n, m, val=0): return [l1d(n, val) for j in range(m)]\ndef remadd(x, y): return 1 if x%y else 0\ndef ceil(a,b): return (a+b-1)//b\n\ndef isprime(x):\n if x<=1: return False\n if x in (2, 3): return True\n if x%2 == 0: return False\n for i in range(3, int(sqrt(x))+1, 2):\n if x%i == 0: return False\n return True\n\nfor _ in range(int(inp())):\n n = int(inp())\n k = 1\n for i in range(2n):\n if i!=0 and i%2==0:\n k+=2\n print(\" \"((n-k)) + \"\"k + \" \"((n-k)))\n", "for i in range(int(input())):\r\n a=int(input())\r\n i=1\r\n for j in range(1,a2,2):\r\n print(\" \"(a-i),\"\"j)\r\n print(\" \"(a-i),\"\"j)\r\n i+=1", "for _ in range(int(input())):\r\n n = int(input())\r\n s = ''\r\n\r\n for i in range(n):\r\n x = ' ' ((n * 2 - 1 - len(s)) // 2)\r\n\r\n print(x + s + x)\r\n print(x + s + x)\r\n\r\n s = '' + s + ''", "for tc in range(int(input())):\r\n K = int(input())\r\n mx = 2 * K - 1\r\n for i in range(K):\r\n s = '' (2 * i + 1)\r\n s = ' ' * (mx - len(s) >> 1) + s\r\n print(s)\r\n print(s)"]	{"inputs": [["4", "1", "2", "3", "4"]], "outputs": [["", "", "", "", "*", "", "", "", "", "", "**", "**", "", "", "", "", "**", "*", "***", "*****"]]}	INTERVIEW	PYTHON3	CODECHEF	2,859
39c7d2800107f6fa85602aa4eacf88ee	UNKNOWN	In a fictitious city of CODASLAM there were many skyscrapers. The mayor of the city decided to make the city beautiful and for this he decided to arrange the skyscrapers in descending order of their height, and the order must be strictly decreasing but he also didn’t want to waste much money so he decided to get the minimum cuts possible. Your job is to output the minimum value of cut that is possible to arrange the skyscrapers in descending order. -----Input----- First line of input is the number of sky-scrappers in the city Second line of input is the height of the respective sky-scrappers -----Output----- * Your output should be the minimum value of cut required to arrange these sky-scrappers in descending order. -----Example----- Input: 5 1 2 3 4 5 Output: 8 By: Chintan,Asad,Ashayam,Akanksha	["import sys\n \nnum=int(sys.stdin.readline())\ns=sys.stdin.readline().split()\nsky=list(map(int,s))\nsky.reverse()\ncuts=0\nchange=0\nt=False\ni=1\n \nwhile i<len(sky):\n if sky[i]<=sky[i-1]:\n for j in range(i-1,-1,-1):\n \n if sky[j]<=sky[i]-(i-j):\n break\n else:\n change+=sky[j]-(sky[i]-(i-j))\n \n if change>=sky[i]:\n change=sky[i]\n t=True\n break\n \n cuts+=change\n \n if t:\n del sky[i]\n t=False\n i-=1\n \n else:\n for j in range(i-1,-1,-1):\n if sky[j]<sky[i]-(i-j):\n break\n else:\n sky[j]=sky[i]-(i-j)\n i+=1\n \n change=0\n \nprint(cuts)", "#!/usr/bin/env python\n\ndef main():\n N = int(input())\n while True:\n try:\n X = input()\n except:\n break\n H = list(map(int, X.split()))\n C = 0\n while H:\n e = H.pop(0)\n H2, C1, C2 = list(H), e, 0\n for i in range(len(H2)):\n if H2[i] > e-1:\n C2 += H2[i]-(e-1)\n H2[i] = e-1\n #print C+C2, H2, C+C1, H\n if C1 <= C2:\n C += C1\n else:\n C += C2\n H = H2\n print(C)\n\nmain()\n\n", "import sys\n\nnum=int(sys.stdin.readline())\ns=sys.stdin.readline().split()\nsky=list(map(int,s))\nsky.reverse()\ncuts=0\nchange=0\nt=False\ni=1\n\nwhile i<len(sky):\n if sky[i]<=sky[i-1]:\n for j in range(i-1,-1,-1):\n \n if sky[j]<=sky[i]-(i-j):\n break\n else:\n change+=sky[j]-(sky[i]-(i-j))\n \n if change>=sky[i]:\n change=sky[i]\n t=True\n break\n \n cuts+=change\n \n if t:\n del sky[i]\n t=False\n i-=1\n \n else:\n for j in range(i-1,-1,-1):\n if sky[j]<sky[i]-(i-j):\n break\n else:\n sky[j]=sky[i]-(i-j)\n i+=1\n \n change=0\n \nprint(cuts)\n"]	{"inputs": [["5", "1 2 3 4 5"]], "outputs": [["8", "By:", "Chintan,Asad,Ashayam,Akanksha"]]}	INTERVIEW	PYTHON3	CODECHEF	1,678
b6d90b2a4da50323edca7ee16e6e0292	UNKNOWN	There is Chef and Chef’s Crush who are playing a game of numbers. Chef’s crush has a number $A$ and Chef has a number $B$. Now, Chef wants Chef’s crush to win the game always, since she is his crush. The game ends when the greatest value of A^B is reached after performing some number of operations (possibly zero), Where ^ is Bitwise XOR. Before performing any operation you have to ensure that both $A$ and $B$ have the same number of bits without any change in the values. It is not guaranteed that $A$ and $B$ should have same number of bits in the input. For example, if $A$ is $2$ and $B$ is $15$, then the binary representation of both the numbers will have to be $0010$ and $1111$ respectively, before performing any operation. The operation is defined as : - Right circular shift of the bits of only $B$ from MSB$_B$ to LSB$_B$ i.e. if we consider $B_1 B_2 B_3 B_4$ as binary number, then after one circular right shift, it would be $B_4 B_1 B_2 B_3$ They both are busy with themselves, can you find the number of operations to end the game? -----Input :----- - The first line of input contains $T$, (number of test cases) - Then each of the next $T$ lines contain : two integers $A$ and $B$ respectively. -----Output :----- For each test case print two space-separated integers, The number of operations to end the game and value of A^B when the game ends. -----Constraints :----- - $1 \leq T \leq100$ - $1\leq A,B \leq 10^{18}$ -----Subtasks :----- - 30 Points: $1\leq A,B \leq 10^5$ - 70 Points: Original Constraints -----Sample Input :----- 1 4 5 -----Sample Output :----- 2 7 -----Explanation :----- Binary representation of $4$ is $100$ and binary representation $5$ is $101$. - After operation $1$ : $B$ $=$ $110$, so A^B $=$ $2$ - After operation $2$ : $B$ $=$ $011$, so A^B $=$ $7$ So, the value of A^B will be $7$. Which is the greatest possible value for A^B and the number of operations are $2$.	["\ndef main():\n t = int(input())\n while (t):\n m, n = map(int, input().split())\n a , b= bin(m)[2:],bin(n)[2:]\n #print(a,b)\n max = m^n\n if len(a)>len(b):\n diff =len(a)-len(b)\n b= (\"0\"diff)+b\n #print(b)\n elif len(a)<len(b):\n diff =len(b)-len(a)\n a= (\"0\"diff)+a\n #print(a)\n ll = len(b)\n count= 0\n for i in range(ll-1):\n s= b[ll-1] + b\n s= s[:ll]\n\n tt= m^ int(s,2)\n #print(m,s,tt)\n if tt>max:\n max =tt\n count= i+1\n b=s\n\n print(count,max)\n t-=1\n\ndef __starting_point():\n main()\n__starting_point()", "def bitLen(int_type):\n length = 0\n while (int_type):\n int_type >>= 1\n length += 1\n return(length)\ndef rot(b):\n b=b[-1]+b[:-1]\n return b\nfor __ in range(int(input())):\n ans=0\n r=0\n x=0\n c=0\n a, b = map(int, input().split())\n if a>=b:\n r = bitLen(a)\n b=(bitLen(a)-bitLen(b))'0'+bin(b).replace('0b','')\n a=bin(a).replace('0b','')\n else:\n r = bitLen(b)\n a = (bitLen(b) - bitLen(a)) '0' + bin(a).replace('0b', '')\n b = bin(b).replace('0b', '')\n for d in range(r):\n x=int(a,2)^int(b,2)\n b=rot(b)\n if ans < x:\n ans=x\n c=d\n print(c,ans)", "try:\n def ts(s): \n str1 = \"\" \n for ele in s: \n str1 += ele \n return str1 \n \n for _ in range(int(input())):\n x,y=[int(x) for x in input().split()]\n x=list(bin(x).replace(\"0b\", \"\"))\n y=list(bin(y).replace(\"0b\",\"\"))\n xl=len(x)\n yl=len(y)\n if(xl<yl):\n for __ in range(yl-xl):\n x.insert(0,'0')\n else:\n for __ in range(xl-yl):\n y.insert(0,'0') \n l=len(x)\n xor=-1\n rotations=-1\n for i in range(l):\n temp_xor=int(ts(x),2)^int(ts(y),2)\n if(temp_xor>xor):\n xor=temp_xor\n rotations=i\n temp=x.pop\n y.insert(0,y.pop())\n print(rotations,xor)\n \nexcept:\n pass", "t = int(input())\nwhile(t):\n a, b = map(int ,input().split())\n stra = bin(a).replace(\"0b\", \"\")\n strb = bin(b).replace(\"0b\",\"\")\n if(len(stra) == len(strb)):\n pass\n elif(len(stra) > len(strb)):\n addi = len(stra) - len(strb)\n for i in range(addi):\n strb = '0' + strb\n else:\n addi = len(strb) - len(stra)\n for i in range(addi):\n stra = '0'+ stra\n n = len(strb)\n maxi = int(stra, 2) ^ int(strb, 2)\n i = 0\n indi = 0\n tem = strb[-1] + strb[0:n-1]\n while(tem != strb):\n c = int(stra, 2) ^ int(tem, 2)\n i += 1\n if(c >= maxi):\n maxi = c\n indi = i\n tem = tem[-1] + tem[0:n-1]\n print(indi, maxi)\n t = t - 1", "# cook your dish here\nfor i in range(int(input())):\n a,b=map(int, input().split())\n b=bin(b)[2:]\n b=list(map(str, b))\n for j in range (len(str(bin(a)[2:]))-len(b)):\n b.insert(0,\"0\")\n xor=a^int((\"\".join(b)),2)\n max=xor\n c=0\n for j in range(len(b)-1):\n b = (b[-1:] + b[:-1])\n xor=a^int((\"\".join(b)),2)\n if xor>max:\n max=xor\n c=j+1\n print(c, max)", "\ndef bint(var):\n decimale = 0\n l = len(var)\n for i in range(l):\n decimale += int(var[i])(2(l-i-1))\n return decimale\n \n \nt = int(input())\nfor _ in range(t):\n a, b = map(int, input().split())\n a = bin(a)[2:]\n b = bin(b)[2:]\n if(len(a) > len(b)):\n b = \"0\"(len(a)-len(b)) + b\n elif(len(b) > len(a)):\n a = \"0\"(len(b)-len(a)) + a\n l = len(a)\n res =0\n val = bint(a)^bint(b)\n temp = b[-1] + b[:l-1]\n x = 1\n while(x < l):\n if(bint(a)^bint(temp) > val):\n val = bint(a)^bint(temp)\n res = x\n temp = temp[-1] + temp[:l-1]\n x += 1\n print(res, val)", "from math import log2\ndef rotate(n, bits):\n if(n&1):\n n = n>>1 \| 1<<bits\n else:\n n = n >> 1\n return n\nt = int(input())\nwhile(t > 0):\n t -= 1\n max_xor = 0\n count = 0\n max_count = 0\n a, b = map(int, input().split())\n a_bits = int(log2(a)+1)\n b_bits = int(log2(b)+1)\n if(a_bits > b_bits):\n bits = a_bits\n else:\n bits = b_bits\n c = bits\n bits -= 1\n while(c > 0):\n c -= 1\n c_xor = a^b\n if(c_xor > max_xor):\n max_xor = c_xor\n max_count = count\n b = rotate(b, bits)\n count += 1\n print(max_count, max_xor)", "def dec(n): \n return bin(n).replace(\"0b\", \"\")\ndef ss(str):\n if len(str) <= 1:\n return str\n mid = str[1:len(str)]\n return mid + str[0]\ndef btd(q): \n q1 = q \n decimal, i, n = 0, 0, 0\n while(q != 0): \n dec = q % 10\n decimal = decimal + dec (2*i) \n q= q//10\n i += 1\n return(decimal) \nt=int(input())\nfor iw in range(0,t):\n a=input()\n arr=[]\n \n we=[]\n x=a.split()\n string=str(dec(int(x[1])))\n string2=str(dec(int(x[0])))\n d=int(x[0])\n if(len(string)>len(string2)):\n l=len(string)\n else:\n l=len(string2)\n for lk in range(0,len(string2)-len(string)):\n string='0'+string\n for k in range(0,l):\n c=int(x[1])\n arr.append(d^c)\n string=ss(string)\n x[1]=btd(int(string))\n for h in range(0,len(arr)):\n if(max(arr)==arr[h]):\n if(h==0):\n we.append(0)\n break\n else:\n we.append(len(arr)-h)\n print(min(we),max(arr))", "t=int(input())\nwhile(t):\n l=input().split()\n a=int(l[0])\n b=int(l[1])\n a=str(bin(a).replace(\"0b\",\"\"))\n b=str(bin(b).replace(\"0b\",\"\"))\n if(len(a)!=len(b)):\n if(len(a)>len(b)):\n m=len(a)-len(b)\n b=(\"0\"m)+b\n else:\n m=len(b)-len(a)\n a=(\"0\"m)+a\n l=len(b)\n s1=b.count('1')\n s2=b.count('0')\n if(l==s1 or l==s2):\n j=int(a)^int(b)\n k=int(str(j),2)\n print(0,k)\n else:\n l1=[]\n o=int(a,2)\n p=int(b,2)\n q=o^p\n l1.append(q)\n for i in range(1,l):\n b=b[-1]+b[0:-1]\n c=int(b,2)\n l1.append(o^c)\n maxx=max(l1)\n print(l1.index(maxx),maxx)\n t-=1", "try:\n def right_shift(x):\n temp = x+x\n return temp[len(x)-1:2len(x)-1]\n \n for i in range(int(input())): \n a , b = map(int,input().split(\" \"))\n a,b=bin(a)[2:] , bin(b)[2:]\n \n if(len(a)<len(b)):\n diff = len(b)-len(a)\n a=\"0\"diff+a\n elif(len(b)<len(a)):\n diff = len(a)-len(b)\n b=\"0\"diff+b \n \n a=int(a,2) \n maxi = a^int(b,2) \n steps=0\n \n for i in range(1,len(b)): \n b=right_shift(b) \n \n if(a^int(b,2)>maxi):\n maxi=a^int(b,2)\n steps = i\n \n print(steps,maxi)\nexcept:\n pass", "# cook your dish here\ndef right_shift(x):\n temp = x+x\n return temp[len(x)-1:2len(x)-1]\n \nfor i in range(int(input())): \n a , b = map(int,input().split(\" \"))\n a,b=bin(a)[2:] , bin(b)[2:]\n \n if(len(a)<len(b)):\n diff = len(b)-len(a)\n a=\"0\"diff+a\n elif(len(b)<len(a)):\n diff = len(a)-len(b)\n b=\"0\"diff+b \n \n a=int(a,2) \n maxi = a^int(b,2) \n steps=0\n \n for i in range(1,len(b)): \n b=right_shift(b) \n \n if(a^int(b,2)>maxi):\n maxi=a^int(b,2)\n steps = i\n \n print(steps,maxi)", "# cook your dish here\ntry:\n def dectobin(a):\n r=[int(i) for i in bin(a)[2:]]\n return r\n def bintodec(a):\n r=int(\"\".join(str(x) for x in a),2)\n return r\n def s(a):\n a=[a[-1]]+a[:-1]\n return a\n for i in range(int(input())):\n a,b=map(int,input().split())\n bina=dectobin(a)\n binb=dectobin(b)\n ans=[]\n ans.append(a^b)\n bits=len(bina)-len(binb)\n if bits<0:\n for j in range(bits):\n bina.insert(0,0)\n elif bits>0:\n for j in range(bits):\n binb.insert(0,0)\n for j in range(len(binb)):\n binb=s(binb)\n b=bintodec(binb)\n ans.append(a^b)\n print(ans.index(max(ans)),max(ans))\nexcept:\n pass", "def right_shift(x):\n temp = x+x\n return temp[len(x)-1:2len(x)-1]\n \nfor i in range(int(input())): \n a , b = map(int,input().split(\" \"))\n a,b=bin(a)[2:] , bin(b)[2:]\n \n if(len(a)<len(b)):\n diff = len(b)-len(a)\n a=\"0\"diff+a\n elif(len(b)<len(a)):\n diff = len(a)-len(b)\n b=\"0\"diff+b \n \n a=int(a,2) \n maxi = a^int(b,2) \n steps=0\n \n for i in range(1,len(b)): \n b=right_shift(b) \n \n if(a^int(b,2)>maxi):\n maxi=a^int(b,2)\n steps = i\n \n print(steps,maxi)", "for _ in range(int(input())):\n a,b=list(map(int,input().split()))\n ab=bin(a)[2:]\n bb=bin(b)[2:]\n n=abs(len(bb)-len(ab))\n if n>0:\n if len(bb)>len(ab):\n ab = \"0\"n + ab\n else:\n bb = \"0\"n + bb\n m=0\n count=0\n for i in range(len(bb)):\n l=int(ab,2)^int(bb,2)\n if l>m:\n m=l\n count=i\n bb =bb[-1] + bb\n bb=bb[:-1]\n \n print(count,m)\n", "# cook your dish here\nfor i in range(int(input())):\n A,B=map(int, input().split())\n B=bin(B)[2:]\n B=list(map(str, B))\n for j in range (len(str(bin(A)[2:]))-len(B)):\n B.insert(0,\"0\")\n xor=A^int((\"\".join(B)),2)\n max=xor\n c=0\n for j in range(len(B)-1):\n B = (B[-1:] + B[:-1])\n xor=A^int((\"\".join(B)),2)\n if xor>max:\n max=xor\n c=j+1\n print(c, max)", "t=int(input())\nwhile(t):\n t-=1\n a,b=list(map(int,input().split()))\n a=bin(a).replace(\"0b\",\"\")\n b=bin(b).replace(\"0b\",\"\")\n s1=len(a)\n s2=len(b)\n if(s1!=s2):\n if(s1>s2):\n f=s1-s2\n b=(f'0')+b\n else:\n f=s2-s1\n a=(f'0')+a\n s1=len(a)\n s2=len(b)\n t1=b.count('1')\n t2=b.count('0')\n if(s2==t1 or s2==t2):\n n=int(a)^int(b)\n m=int(str(n),2)\n print(0,m)\n else:\n v=[]\n g=int(a,2)\n h=int(b,2)\n j=g^h\n v.append(j)\n for i in range(1,len(b)):\n b=b[-1]+b[0:-1]\n c=int(b,2)\n v.append(g^c)\n y=max(v)\n print(v.index(y),y)\n", "import math\nt = int(input())\nfor ti in range(t):\n a,b = map(int,input().split())\n mx = max(a,b)\n bit = int((math.log(mx) / math.log(2)) + 1)\n num = pow(2,bit) - 1\n res = a^b \n cnt = 0\n rot = 0\n for i in range(1,bit):\n if b%2==0:\n b//=2\n else:\n b+=num \n b//=2\n ans = a^b\n cnt+=1\n if ans>res:\n res=ans\n rot=cnt\n print(str(rot)+\" \"+str(res))"]	{"inputs": [["1", "4 5"]], "outputs": [["2 7"]]}	INTERVIEW	PYTHON3	CODECHEF	9,336
bf5a235dcc984bd82ebdbc1593200db3	UNKNOWN	Chef Tobby is playing a rapid fire with Bhuvan. He gives Bhuvan a string S and each time, Bhuvan has to guess whether there exists 2 equal subsequences in the string or not. Bhuvan got a perfect score in the game with Chef Tobby. However, Chef Tobby has now asked Bhuvan to write a program that will do this automatically given a string S. Bhuvan is an intelligent man but he does not know how to write a code. Can you help him? Find two different subsequences such that they are equal in their value, more formally, find two sequences of indices (a1, a2, ..., ak-1, ak) and (b1, b2, ..., bk-1, bk) such that: - 1≤ ai, bi ≤ \|S\| - ai < ai+1 for all valid i - bi < bi+1 for all valid i - Sai = Sbi for all valid i - there exist at least one i such that ai is not equal to bi -----Input section----- The first line contains T, the number of test cases. Each of the next T lines contain one string S each. Input will only consist of lowercase english characters -----Output section----- For each test case, output "yes" or "no" (without quotes) as the solution to the problem. -----Input constraints----- 1 ≤ T ≤ 1000 1 ≤ length of S ≤ 100 -----Sample Input----- 4 likecs venivedivici bhuvan codechef -----Sample Output----- no yes no yes -----Explanation----- In test case 2, one of the possible equal subsequence is "vi" and "vi". (one at position {0, 3} and other at {4, 7}, assuming 0-based indexing). In test case 4, one of the possible equal subsequence is "ce" and "ce". (one at position {0, 3} and other at {4, 6}, assuming 0-based indexing).	["t = int(input())\n\nfor _ in range(t):\n s = [x for x in input()]\n \n freq = {}\n \n for i in s:\n if i in freq:\n freq[i] += 1\n else:\n freq[i] = 1\n \n flag = 0\n \n for keys, values in freq.items():\n if(values >= 2):\n flag = 1\n break\n \n if(flag == 0):\n print(\"no\")\n else:\n print(\"yes\")", "t = int(input())\n\nfor _ in range(t):\n s = [x for x in input()]\n \n freq = {}\n \n for i in s:\n if i in freq:\n freq[i] += 1\n else:\n freq[i] = 1\n \n flag = 0\n \n for keys, values in freq.items():\n if(values >= 2):\n flag = 1\n break\n \n if(flag == 0):\n print(\"no\")\n else:\n print(\"yes\")", "for _ in range(int(input())):\n S = input()\n set_S = list(set(list(S)))\n flag = False\n \n for s in set_S:\n if S.count(s) > 1:\n flag = True\n break\n \n print(\"yes\" if flag else \"no\")", "for _ in range(int(input())) :\n s = input()\n if len(set(s)) == len(s) :\n print('no')\n else :\n print('yes')", "for _ in range(int(input())):\n S = input()\n for i in list(set(S)):\n if S.count(i) > 1:\n print('yes')\n break\n else:\n print('no')", "# cook your dish here\nfor _ in range(int(input())):\n s=input()\n flag=0\n for i in range(len(s)):\n if s.count(s[i]) > 1:\n flag=1\n break\n if flag==1:\n print('yes')\n else:\n print('no')", "t=int(input())\nfor i in range(t):\n s=input()\n list1=[]\n flag=0\n for i in range(len(s)):\n list1.append(s[i])\n set1=set(list1)\n dict1=dict()\n for i in set1:\n dict1[i]=0\n for i in list1:\n dict1[i]+=1\n if(dict1[i]>1):\n print(\"yes\")\n flag=1\n break\n if(flag==0):\n print(\"no\")\n \n", "T=int(input())\n\nwhile(T>0):\n s=input();\n flg=0;\n for i in range(len(s)-1):\n if(s.find(s[i],i+1)!=-1):\n flg=1;\n if(flg==0):\n print(\"no\");\n else:\n print(\"yes\");\n \n\n T=T-1\n", "def check(h):\n for n in h:\n if n > 1:\n return \"yes\"\n return \"no\"\n \n\nfor _ in range(int(input())):\n s = input()\n h = [0]*26\n \n for c in s:\n h[ord(c)-ord('a')] += 1\n \n print(check(h))", "# cook your dish here\nfor h in range(int(input())):\n s = input()\n if len(s)!=len(set(s)):\n print('yes')\n else:\n print('no')", "t=int(input())\nfor i in range(t):\n s=input()\n n=len(s)\n c=0\n if n!=len(set(s)):\n print('yes')\n else:\n print('no')", "def Cook(S):\n Counter = dict()\n for i in S:\n if i not in Counter.keys():\n Counter[i] = 0\n Counter[i] += 1\n for i in Counter.values():\n if i > 1:\n return \"yes\"\n return \"no\"\n\nfor T in range(int(input())):\n S = input()\n print(Cook(S))", "def Cook(S):\n Counter = dict()\n for i in S:\n if i not in Counter.keys():\n Counter[i] = 0\n Counter[i] += 1\n for i in Counter.values():\n if i > 1:\n return \"yes\"\n return \"no\"\n\nfor T in range(int(input())):\n S = input()\n print(Cook(S))", "t=int(input())\nfor i in range(t):\n s=input()\n l=[0 for i in range(26)]\n for j in range(len(s)):\n l[ord(s[j])-97]+=1\n f=0\n for j in range(26):\n if l[j]>1:\n f=1\n break\n if f==1:\n print(\"yes\")\n else:\n print(\"no\")", "# cook your dish here\nfor h in range(int(input())):\n s=input();\n l=list(s)\n s1=set(s)\n if(len(s1)==len(l)):\n print('no')\n else:\n print('yes')\n", "# cook your dish here\ntry:\n for _ in range(int(input())):\n s=input()\n l1=len(s)\n l2=len(set(s))\n if l1!=l2:\n print('yes')\n else:\n print('no')\nexcept:\n pass", "# cook your dish here\nfor i in range(int(input())):\n s=input()\n s1=set(s)\n l=[]\n for j in s1:\n l.append(s.count(j))\n if(max(l)>=2):\n print('yes')\n else:\n print('no')\n", "for _ in range(int(input())):\n s=input()\n l1=len(s)\n l2=len(set(s))\n if l1!=l2:\n print('yes')\n else:\n print('no')", "# cook your dish here\n# cook your dish here\nt=int(input())\nfor i in range(t):\n s=input()\n ans=1\n for j in s:\n if(s.count(j)>1):\n ans=0\n break\n if(ans==0):\n print(\"yes\")\n else:\n print(\"no\")\n", "# cook your dish here\nt=int(input())\nfor i in range(t):\n s=input()\n ans=1\n for j in s:\n if(s.count(j)>1):\n ans=0\n break\n if(ans==0):\n print(\"yes\")\n else:\n print(\"no\")\n", "# cook your dish here\nt=int(input())\nfor i in range(t):\n s=input()\n ans=1\n for j in s:\n if(s.count(j)>1):\n ans=0\n break\n if(ans==0):\n print(\"yes\")\n else:\n print(\"no\")\n", "# cook your dish here\nfor _ in range(int(input())):\n s = list(input())\n letters = set()\n flag = False\n for letter in s:\n if letter not in letters:\n letters.add(letter)\n else:\n flag = True\n break\n \n if flag:\n print(\"yes\")\n else:\n print(\"no\")", "t = int(input())\nfor i in range(t):\n a = input()\n b = list(a)\n c = 0\n for i in b:\n if a.count(i) > 1:\n c = c + 1\n if c >= 1:\n print(\"yes\")\n else:\n print(\"no\")"]	{"inputs": [["4", "likecs", "venivedivici", "bhuvan", "codechef"]], "outputs": [["no", "yes", "no", "yes"]]}	INTERVIEW	PYTHON3	CODECHEF	4,747
5bd2bfec4904a2b8ea43afc9c2738c38	UNKNOWN	Chef has gone shopping with his 5-year old son. They have bought N items so far. The items are numbered from 1 to N, and the item i weighs Wi grams. Chef's son insists on helping his father in carrying the items. He wants his dad to give him a few items. Chef does not want to burden his son. But he won't stop bothering him unless he is given a few items to carry. So Chef decides to give him some items. Obviously, Chef wants to give the kid less weight to carry. However, his son is a smart kid. To avoid being given the bare minimum weight to carry, he suggests that the items are split into two groups, and one group contains exactly K items. Then Chef will carry the heavier group, and his son will carry the other group. Help the Chef in deciding which items should the son take. Your task will be simple. Tell the Chef the maximum possible difference between the weight carried by him and the weight carried by the kid. -----Input:----- The first line of input contains an integer T, denoting the number of test cases. Then T test cases follow. The first line of each test contains two space-separated integers N and K. The next line contains N space-separated integers W1, W2, ..., WN. -----Output:----- For each test case, output the maximum possible difference between the weights carried by both in grams. -----Constraints:----- - 1 ≤ T ≤ 100 - 1 ≤ K < N ≤ 100 - 1 ≤ Wi ≤ 100000 (105) -----Example:----- Input: 2 5 2 8 4 5 2 10 8 3 1 1 1 1 1 1 1 1 Output: 17 2 -----Explanation:----- Case #1: The optimal way is that Chef gives his son K=2 items with weights 2 and 4. Chef carries the rest of the items himself. Thus the difference is: (8+5+10) − (4+2) = 23 − 6 = 17. Case #2: Chef gives his son 3 items and he carries 5 items himself.	["def main():\n T = int(input())\n for t in range(T):\n N,K = map(int, input().split())\n W = list(map(int, input().split()))\n W.sort()\n if 2K > N:\n K = N - K\n kid = sum(W[:K])\n dad = sum(W[K:])\n\n diff = dad - kid\n\n print(diff)\n\n\ndef __starting_point():\n main()\n__starting_point()", "# cook your dish here\nt=int(input())\nfor i in range(t):\n n,k=list(map(int,input().split()))\n s=list(map(int,input().split()))\n\n s.sort()\n su=sum(s)\n s1=sum(s[:k])\n s2=sum(s[n-k:])\n\n print(max(abs(s1-(su-s1)),abs(s2-(su-s2))))\n\n \n", "# cook your dish here\ntry:\n for _ in range(int(input())):\n N, K = map(int, input().split())\n memory = list(map(int, input().split()))\n memory.sort()\n a = memory[:K]\n b = memory[K:]\n memory.reverse()\n c = memory[:K]\n d = memory[K:]\n a = sum(a)\n b = sum(b)\n c = sum(c)\n d = sum(d)\n print(max(abs(a - b), abs(c - d)))\nexcept:\n pass", "# cook your dish here\ntry:\n for _ in range(int(input())):\n N, K = map(int, input().split())\n memory = list(map(int, input().split()))\n memory.sort()\n a = memory[:K]\n b = memory[K:]\n memory.reverse()\n c = memory[:K]\n d = memory[K:]\n a = sum(a)\n b = sum(b)\n c = sum(c)\n d = sum(d)\n print(max(abs(a - b), abs(c - d)))\nexcept:\n pass", "# cook your dish here\nt = int(input())\nfor _ in range(t):\n n,k = map(int,input().split())\n carryBag = list(map(int,input().split()))\n carryBag.sort()\n w1 = min(k,n-k)\n son = sum(carryBag[:w1])\n father = sum(carryBag[w1:])\n print(father-son)", "# cook your dish here\nfor i in range(int(input())):\n a,b=list(map(int,input().split()))\n ls=list(map(int,input().split()))\n ls.sort()\n l1=sum(ls[b:])-sum(ls[:b])\n l2=sum(ls[a-b:])-sum(ls[:a-b])\n print(max(l1,l2))\n \n", "t=int(input())\nwhile(t>0):\n t-=1\n n,k=list(map(int,input().split()))\n arr=list(map(int,input().split()))\n curr=sorted(arr)\n div1 = sum(curr[k:])-sum(curr[:k])\n div2 = sum(curr[n-k:])-sum(curr[:n-k])\n print(max(div1,div2))\n\n", "import heapq\ndef kSmallest(lst, k,n):\n res=lst[:k]\n heapq._heapify_max(res)\n for i in range(k,n):\n if lst[i]<res[0]:\n heapq._heapreplace_max(res,lst[i])\n return res \ndef solve():\n t = int(input())\n for _ in range(t):\n n,k = [int(x) for x in input().split()]\n k = min(k,n-k)\n a = [int(x) for x in input().split()]\n b = kSmallest(a,k,n)\n print(abs(sum(a)-2sum(b))) \n \n# import sys\n# def fast():\n# sys.stdin = open(\"input.txt\", \"r\")\n# sys.stdout = open(\"output.txt\", \"w\")\n# fast()\nsolve()", "def solve():\n n,k=map(int,input().split())\n w=list(map(int,input().split()))\n if k<=n//2:\n w.sort()\n else:\n w.sort(reverse=True)\n print(abs(sum(w[k:])-sum(w[:k])))\n\nt=int(input())\nwhile t:\n solve()\n t-=1", "# cook your dish here\nfor x in range(int(input())):\n n,k=input().split()\n n=int(n)\n k=int(k)\n l=list(map(int,input().split()))\n l.sort()\n if k<=n//2:\n print(sum(l[k:])-sum(l[:k]))\n else:\n print(abs(sum(l[:n-k])-sum(l[n-k:])))\n \n", "def subset_sum_check(l, n, sum1):\n while n >= 0:\n if sum1 - l[n] == 0:\n return True\n elif sum1 - l[n] > 0:\n if subset_sum_check(l, n - 1, sum1 - l[n]):\n return True\n n -= 1\n return False\n \nfor _ in range(int(input())):\n n,k = list(map(int,input().split()))\n arr = [int(i) for i in input().split()]\n h=n//2\n if n%2!=0:\n h+=1 \n if k>=h:\n k=n-k\n arr.sort()\n print(abs(sum(arr[:k])-sum(arr[k:])))\n", "t=int(input())\nwhile t>0:\n n,k=map(int,input().split(\" \"))\n li=list(map(int,input().split(\" \"))) \n li.sort()\n h=n//2\n if n%2!=0:\n h+=1 \n if k>=h:\n k=n-k\n l1=li[:k]\n l2=li[k:]\n #print(l1,l2)\n print(abs(sum(l1)-sum(l2)))\n t-=1", "for _ in range(int(input())):\n n,k = list(map(int, input().split()))\n weight = list(map(int, input().split()))\n weight.sort()\n a, b = 0, 0\n for i in range(n):\n if i < k:\n a += weight[i] \n \n if i >= n-k:\n b += weight[i] \n \n print(max(abs(a-(sum(weight) - a)), abs(b-(sum(weight)-b))))\n", "# cook your dish here\nfor _ in range(int(input())):\n n,k = list(map(int, input().split()))\n items = list(map(int,input().split()))\n items.sort()\n v1 = abs(sum(items[k:])-sum(items[:k]))\n items.sort(reverse = True)\n v2 = abs(sum(items[k:])-sum(items[:k]))\n print(max(v1,v2))", "test = int(input())\nfor i in range(test):\n items,given = [int(x) for x in input().split()]\n weight = [int(y) for y in input().split()]\n weight.sort()\n mn,mx = 0,0\n if given <= items//2:\n for j in range(1,items+1):\n if j <= given:\n mn = mn + weight[j-1]\n else:\n mx = mx + weight[j-1]\n print(mx-mn)\n else:\n for j in range(1,items+1):\n if j <= given:\n mn = mn + weight[items - j]\n else:\n mx = mx + weight[items - j]\n print(mn-mx)", "T = int(input())\n\nfor _ in range(T):\n N, K = map(int, input().split())\n W = list(map(int, input().split()))\n\n W.sort()\n\n if K <= N // 2:\n Kv = [W[i] for i in range(K)]\n else:\n Kv = [W[N - i - 1] for i in range(K)]\n for i in Kv:\n W.remove(i)\n\n diff = sum(Kv) - sum(W)\n if diff < 0:\n diff = -1\n\n print(diff)", "answers= []\n\ndef solve(weights, limit):\n weights.sort()\n diff1 = abs(sum(weights[limit:])-sum(weights[0:limit]))\n diff2 = abs(sum(weights[-limit:]) - sum(weights[:-limit]))\n # answers.append(abs(sum(weights[limit:])-sum(weights[0:limit])))\n answers.append(max(diff1, diff2))\n\n\nT = int(input())\nwhile T:\n N, K = [int(x) for x in input().split()]\n weights = [int(x) for x in input().split()]\n solve(weights, K)\n T -= 1\n\nfor ans in answers:\n print(ans)", "# cook your dish here\nfor _ in range(int(input())):\n n,k = map(int,input().split())\n w = list(map(int,input().split()))\n w.sort()\n if k <= n//2:\n s1 = sum(w[:k])\n s2 = sum(w[k:])\n print(abs(s2 - s1))\n else:\n s1 = sum(w[n-k:])\n s2 = sum(w[:n-k])\n print(abs(s2-s1))", "\nt = int(input())\nfor _ in range(t):\n n,k = list(map(int,input().split()))\n\n l = list(map(int,input().split()))\n l.sort()\n a = max(sum(l[k:])-sum(l[:k]),sum(l[:k])-sum(l[k:]))\n l.sort(reverse=True)\n b = max(sum(l[k:])-sum(l[:k]),sum(l[:k])-sum(l[k:]))\n print(max(a,b)) \n\n\n", "# n items bought (1,2,3,....,n)\n# 1 2 3 4 5 6 7 8 9\n\nt=int(input())\nfor i in range(t):\n n,k=map(int,input().split())\n weightlist=list(map(int,input().split()))\n summofweights=0\n sonweight=0\n dadweight=0\n weightlist.sort()\n for j in weightlist:\n summofweights+=j\n if(k>n/2):\n for j in range(-1,-(k+1),-1):\n dadweight+=weightlist[j]\n ans=False\n else:\n for j in range(k):\n sonweight+=weightlist[j]\n ans=True\n if(ans):\n print(summofweights-(2sonweight))\n else:\n print((2*dadweight)-summofweights)", "# cook your dish here\nfor _ in range(int(input())):\n sum_son=0\n n,k=map(int,input().split())\n w=[int(item) for item in input().split()]\n w.sort()\n k=min(k,n-k)\n for i in range(k):\n sum_son=sum_son+w[i]\n total_sum=sum(w) \n chef_sum=total_sum-sum_son\n print(abs(chef_sum-sum_son))", "t = int(input())\n\nfor i in range(t):\n w,k = map(int,input().split())\n l = [int(x) for x in input().split()]\n l.sort()\n sum_w = sum(l)\n s1 = 0\n s2 = 0\n start = 0\n end = len(l) - 1\n while k > 0:\n s1 += l[start]\n s2 += l[end]\n start += 1\n end -= 1\n k -= 1\n print(max(abs(s1 - (sum_w - s1)) , abs(s2 - (sum_w - s2))))", "# cook your dish here\nt=int(input())\nfor i in range(t):\n sum=0\n sum1=0\n n,k=map(int,input().split())\n l=list(map(int,input().split()))\n l.sort()\n k=min(k,n-k)\n for p in range(k):\n sum+=l[p]\n for q in range(k,n):\n sum1+=l[q]\n \n print(abs(sum-sum1))", "# cook your dish here\nfor _ in range(int(input())):\n num,k=list(map(int,input().split()))\n arr=list(map(int,input().split()))\n if(k<=num//2):\n arr.sort()\n ans=sum(arr[k:])-sum(arr[:k])\n print(abs(ans))\n else:\n arr.sort()\n ans=sum(arr[num-k:])-sum(arr[:num-k])\n print(ans)\n\n"]	{"inputs": [["2", "5 2", "8 4 5 2 10", "8 3", "1 1 1 1 1 1 1 1"]], "outputs": [["17", "2"]]}	INTERVIEW	PYTHON3	CODECHEF	7,851
47ddd45f6b2ea7dde6f22e3e8c026bc8	UNKNOWN	Consider the following operations on a triple of integers. In one operation, you should: - Choose an integer $d$ and an arithmetic operation ― either addition or multiplication. - Choose a subset of elements of the triple. - Apply the arithmetic operation to each of the chosen elements, i.e. either add $d$ to each of them or multiply each of them by $d$. For example, if we have a triple $(3, 5, 7)$, we may choose to add $3$ to the first and third element, and we get $(6, 5, 10)$ using one operation. You are given an initial triple $(p, q, r)$ and a target triple $(a, b, c)$. Find the minimum number of operations needed to transform $(p, q, r)$ into $(a, b, c)$. -----Input----- - The first line of the input contains a single integer $T$ denoting the number of test cases. The description of $T$ test cases follows. - The first line of each test case contains three space-separated integers $p$, $q$ and $r$. - The second line contains three space-separated integers $a$, $b$ and $c$. -----Output----- For each test case, print a single line containing one integer ― the minimum required number of operations. -----Constraints----- - $1 \le T \le 1,000$ - $\|p\|, \|q\|, \|r\|, \|a\|, \|b\|, \|c\| \le 10^9$ -----Subtasks----- Subtask #1 (10 points): $\|p\|, \|q\|, \|r\|, \|a\|, \|b\|, \|c\| \le 10$ Subtask #2 (90 points): original constraints -----Example Input----- 2 3 5 7 6 5 10 8 6 3 9 7 8 -----Example Output----- 1 2 -----Explanation----- Example case 1: We add $3$ to the first and third element of $(3, 5, 7)$ to form $(6, 5, 10)$. Example case 2: We can add $1$ to each element to form $(9, 7, 4)$ and then multiply the third element by $2$.	["def eq_solve(v0, v1, u0, u1):\r\n den = u0 - v0\r\n num = u1 - v1\r\n if den != 0:\r\n return num / den\r\n return 1\r\n \r\ndef solve(p, q, r, a, b, c, rs):\r\n if p == a and q == b and r == c:\r\n return rs\r\n if rs >= 2:\r\n return 3\r\n res = 3\r\n adds = [a - p, b - q, c - r]\r\n muls = []\r\n if p != 0:\r\n muls.append(a / p)\r\n if q != 0:\r\n muls.append(b / q)\r\n if r != 0:\r\n muls.append(c / r)\r\n muls.append(eq_solve(p, a, q, b))\r\n muls.append(eq_solve(p, a, r, c))\r\n muls.append(eq_solve(q, b, r, c))\r\n msks = 2 ** 3\r\n for msk in range(msks):\r\n for add in adds:\r\n np = p\r\n nq = q\r\n nr = r\r\n if (msk & 1) > 0:\r\n np += add\r\n if (msk & 2) > 0:\r\n nq += add\r\n if (msk & 4) > 0:\r\n nr += add\r\n res = min(res, solve(np, nq, nr, a, b, c, rs + 1))\r\n for mul in muls:\r\n np = p\r\n nq = q\r\n nr = r\r\n if (msk & 1) > 0:\r\n np = mul\r\n if (msk & 2) > 0:\r\n nq = mul\r\n if (msk & 4) > 0:\r\n nr = mul\r\n res = min(res, solve(np, nq, nr, a, b, c, rs + 1))\r\n return res\r\n \r\n \r\n \r\nt = int(input())\r\n \r\nwhile t > 0:\r\n p, q, r = map(int, input().split())\r\n a, b, c = map(int, input().split())\r\n z = solve(p, q, r, a, b, c, 0)\r\n print(z)\r\n t -= 1 ", "def eq_solve(v0, v1, u0, u1):\r\n den = u0 - v0\r\n num = u1 - v1\r\n if den != 0:\r\n return num / den\r\n return 1\r\n \r\ndef solve(p, q, r, a, b, c, rs):\r\n if p == a and q == b and r == c:\r\n return rs\r\n if rs >= 2:\r\n return 3\r\n res = 3\r\n adds = [a - p, b - q, c - r]\r\n muls = []\r\n if p != 0:\r\n muls.append(a / p)\r\n if q != 0:\r\n muls.append(b / q)\r\n if r != 0:\r\n muls.append(c / r)\r\n muls.append(eq_solve(p, a, q, b))\r\n muls.append(eq_solve(p, a, r, c))\r\n muls.append(eq_solve(q, b, r, c))\r\n msks = 7\r\n for msk in range(msks):\r\n msk = msk + 1\r\n for add in adds:\r\n np = p\r\n nq = q\r\n nr = r\r\n if (msk & 1) > 0:\r\n np += add\r\n if (msk & 2) > 0:\r\n nq += add\r\n if (msk & 4) > 0:\r\n nr += add\r\n res = min(res, solve(np, nq, nr, a, b, c, rs + 1))\r\n for mul in muls:\r\n np = p\r\n nq = q\r\n nr = r\r\n if (msk & 1) > 0:\r\n np = mul\r\n if (msk & 2) > 0:\r\n nq = mul\r\n if (msk & 4) > 0:\r\n nr = mul\r\n res = min(res, solve(np, nq, nr, a, b, c, rs + 1))\r\n return res\r\n \r\n \r\n \r\nt = int(input())\r\n \r\nwhile t > 0:\r\n p, q, r = map(int, input().split())\r\n a, b, c = map(int, input().split())\r\n z = solve(p, q, r, a, b, c, 0)\r\n print(z)\r\n t -= 1 ", "def eqSolve(p, a, q, b) :\n x = p - q\n y = a - b\n if x != 0 :\n z = int(y/x)\n return z\n else :\n return 1\n \ndef solve(p, q, r, a, b, c, rs) :\n if p == a and q == b and r == c :\n return rs\n elif rs >= 2 :\n return 3\n else :\n res = 3\n m = 8\n adds = [a - p, b - q, c - r]\n muls = []\n if p != 0 :\n muls.append(a/p)\n if q != 0 :\n muls.append(b/q)\n if r != 0 :\n muls.append(c/r)\n muls.append(eqSolve(p, a, q, b))\n muls.append(eqSolve(p, a, r, c))\n muls.append(eqSolve(q, b, r, c))\n for n in range(m) :\n for add in adds :\n np = p\n nq = q\n nr = r\n if n & 1 > 0 :\n np = np + add\n if n & 2 > 0 :\n nq = nq + add\n if n & 4 > 0 :\n nr = nr + add\n res = min(res, solve(np, nq, nr, a, b, c, rs + 1))\n for mul in muls :\n np = p\n nq = q\n nr = r\n if n & 1 > 0 :\n np = npmul\n if n & 2 > 0 :\n nq = nqmul\n if n & 4 > 0 :\n nr = nrmul\n res = min(res, solve(np, nq, nr, a, b, c, rs + 1))\n return res \n\nt = int(input())\nx = 0\nfor x in range(t) :\n p, q, r = map(int, input().split())\n a, b, c = map(int, input().split())\n y = solve(p, q, r, a, b, c, 0)\n print(y)", "def eqSolve(p, a, q, b) :\n x = p - q\n y = a - b\n if x != 0 :\n z = int(y/x)\n return z\n else :\n return 1\n \ndef solve(p, q, r, a, b, c, rs) :\n if p == a and q == b and r == c :\n return rs\n elif rs>=2 :\n return 3\n else :\n res = 3\n m = 7\n adds = [a - p, b - q, c - r]\n muls = []\n if p != 0 :\n muls.append(a/p)\n if q != 0 :\n muls.append(b/q)\n if r != 0 :\n muls.append(c/r)\n muls.append(eqSolve(p, a, q, b))\n muls.append(eqSolve(p, a, r, c))\n muls.append(eqSolve(q, b, r, c))\n for n in range(m) :\n n = n + 1\n for add in adds :\n np = p\n nq = q\n nr = r\n if n & 1 > 0 :\n np = np + add\n if n & 2 > 0 :\n nq = nq + add\n if n & 4 > 0 :\n nr = nr + add\n res = min(res, solve(np, nq, nr, a, b, c, rs + 1))\n for mul in muls :\n np = p\n nq = q\n nr = r\n if n & 1 > 0 :\n np = npmul\n if n & 2 > 0 :\n nq = nqmul\n if n & 4 > 0 :\n nr = nrmul\n res = min(res, solve(np, nq, nr, a, b, c, rs + 1))\n return res \n\nt = int(input())\nx = 0\nfor x in range(t) :\n p, q, r = map(int, input().split())\n a, b, c = map(int, input().split())\n y = solve(p, q, r, a, b, c, 0)\n print(y)", "for _ in range(int(input())):\n a, b, c = map(int, input().split())\n p, q, r = map(int, input().split())\n zeros = [a, b, c].count(0)\n d, e, f = p - a, q - b, r - c\n operations = 0\n if d == e == f:\n if d:\n operations = 1\n else:\n operations = 0\n elif zeros >= 2:\n if (d == e and f == 0) or (d == e == 0 and f) or (e == f and d == 0) or (e == f == 0 and d) or (f == d and e == 0) or (f == d == 0 and e):\n operations = 1\n elif d == e or e == f or f == d or d == e + f or e == d + f or f == d + e:\n operations = 2\n elif zeros == 1:\n if a == 0:\n if (d == e and f == 0) or (d == e == 0 and f) or (e == f and d == 0) or (e == f == 0 and d) or (f == d and e == 0) or (f == d == 0 and e) or (d == 0 and q // b == r // c and q % b == 0 and r % c == 0):\n operations = 1\n elif d == e or e == f or f == d or (d and q // b == r // c and q % b == 0 and r % c == 0) or d == e + f or e == d + f or f == d + e:\n operations = 2\n elif b == 0:\n if (d == e and f == 0) or (d == e == 0 and f) or (e == f and d == 0) or (e == f == 0 and d) or (f == d and e == 0) or (f == d == 0 and e) or (e == 0 and p // a == r // c and p % a == 0 and r % c == 0):\n operations = 1\n elif d == e or e == f or f == d or (e and p // a == r // c and p % a == 0 and r % c == 0) or d == e + f or e == d + f or f == d + e:\n operations = 2\n else:\n if (d == e and f == 0) or (d == e == 0 and f) or (e == f and d == 0) or (e == f == 0 and d) or (f == d and e == 0) or (f == d == 0 and e) or (f == 0 and p // a == q // b and p % a == 0 and q % b == 0):\n operations = 1\n elif d == e or e == f or f == d or (f and p // a == q // b and p % a == 0 and q % b == 0) or d == e + f or e == d + f or f == d + e:\n operations = 2\n else:\n x, y, z = p // a, q // b, r // c\n if (d == e and f == 0) or (d == e == 0 and f) or (e == f and d == 0) or (e == f == 0 and d) or (f == d and e == 0) or (f == d == 0 and e) or (x == y == z and p % a == 0 and q % b == 0 and r % c == 0) or (d == 0 and y == z and q % b == 0 and r % c == 0) or (e == 0 and x == z and p % a == 0 and r % c == 0) or (f == 0 and x == y and p % a == 0 and q % b == 0):\n operations = 1\n elif d == e or e == f or f == d or (f and x == y and p % a == 0 and q % b == 0) or (d and y == z and q % b == 0 and r % c == 0) or (e and x == z and p % a == 0 and r % c == 0) or (d == 0 and e != f and e and f) or (e == 0 and d != f and d and f) or (f == 0 and d != e and d and e) or d == e + f or e == d + f or f == d + e or (p % a == 0 and q % b == 0 and r % c == 0 and (x * y == z or y * z == x or z * x == y)):\n operations = 2\n if operations == 0:\n if d:\n operations += 1\n if e:\n operations += 1\n if f:\n operations += 1\n if operations == 3:\n try:\n u, v, w = (q * a - p * b) // (p - q), (r * b - q * c) // (q - r), (p * c - r * a) // (r - p)\n if u == v == w and (q * a - p * b) % (p - q) == 0 and (r * b - q * c) % (q - r) == 0 and (p * c - r * a) % (r - p) == 0 and p // (a + u) == q // (b + u) == r // (c + u) and p % (a + u) == 0 and q % (b + u) == 0 and r % (c + u) == 0:\n operations = 2\n except:\n pass\n if operations == 3:\n try:\n x = p // a\n if p % a == 0 and ((q % x == 0 and c + (q // x) - b == r) or (r % x == 0 and b + (r // x) - c == q)):\n operations = 2\n except:\n pass\n if operations == 3:\n try:\n x = q // b\n if q % b == 0 and ((p % x == 0 and c + (p // x) - a == r) or (r % x == 0 and a + (r // x) - c == p)):\n operations = 2\n except:\n pass\n if operations == 3:\n try:\n x = r // c\n if r % c == 0 and ((p % x == 0 and b + (p // x) - a == q) or (q % x == 0 and a + (q // x) - b == p)):\n operations = 2\n except:\n pass\n if operations == 3:\n try:\n if (q * a - p * b) % (p - q) == 0:\n u, x = (q * a - p * b) // (p - q), p // (a + u)\n if x == q // (b + u) and p % (a + u) == 0 and q % (b + u) == 0 and (c * x == r or c + u == r):\n operations = 2\n except:\n pass\n if operations == 3:\n try:\n if (r * b - q * c) % (q - r) == 0:\n v, x = (r * b - q * c) // (q - r), q // (b + v)\n if x == r // (c + v) and q % (b + v) == 0 and r % (c + v) == 0 and (a * x == p or a + v == p):\n operations = 2\n except:\n pass\n if operations == 3:\n try:\n if (p * c - r * a) % (r - p) == 0:\n w, x = (p * c - r * a) // (r - p), r // (c + w)\n if x == p // (a + w) and r % (c + w) == 0 and p % (a + w) == 0 and (b * x == q or b + w == q):\n operations = 2\n except:\n pass\n if operations == 3:\n try:\n x, y, z = (p - q) // (a - b), (q - r) // (b - c), (r - p) // (c - a)\n if x == y == z and (p - q) % (a - b) == 0 and (q - r) % (b - c) == 0 and (r - p) % (c - a) == 0 and p - a * x == q - b * y == r - c * z:\n operations = 2\n except:\n pass\n if operations == 3:\n try:\n x = p // a\n if p % a == 0 and (b * x + r - c == q or c * x + q - b == r):\n operations = 2\n except:\n pass\n if operations == 3:\n try:\n x = q // b\n if q % b == 0 and (a * x + r - c == p or c * x + p - a == r):\n operations = 2\n except:\n pass\n if operations == 3:\n try:\n x = r // c\n if r % c == 0 and (a * x + q - b == p or b * x + p - a == q):\n operations = 2\n except:\n pass\n if operations == 3:\n try:\n x = (p - q) // (a - b)\n if (p - q) % (a - b) == 0 and p - a * x == q - b * x and (c + p - a * x == r or c * x == r):\n operations = 2\n except:\n pass\n if operations == 3:\n try:\n y = (q - r) // (b - c)\n if (q - r) % (b - c) == 0 and q - b * y == r - c * y and (a + q - b * y == p or a * y == p):\n operations = 2\n except:\n pass\n if operations == 3:\n try:\n z = (r - p) // (c - a)\n if (r - p) % (c - a) == 0 and r - c * z == p - a * z and (b + r - c * z == q or b * z == q):\n operations = 2\n except:\n pass\n print(operations)", "from sys import \ndef eq_solve(v0, v1, u0, u1):\n den = u0 - v0\n num = u1 - v1\n if den != 0:\n return num / den\n return 1\n \ndef solve(p, q, r, a, b, c, rs):\n if p == a and q == b and r == c:\n return rs\n if rs >= 2:\n return 3\n res = 3\n adds = [a - p, b - q, c - r]\n muls = []\n if p != 0:\n muls.append(a / p)\n if q != 0:\n muls.append(b / q)\n if r != 0:\n muls.append(c / r)\n muls.append(eq_solve(p, a, q, b))\n muls.append(eq_solve(p, a, r, c))\n muls.append(eq_solve(q, b, r, c))\n msks = 2 * 3\n for msk in range(msks):\n for add in adds:\n np = p\n nq = q\n nr = r\n if (msk & 1) > 0:\n np += add\n if (msk & 2) > 0:\n nq += add\n if (msk & 4) > 0:\n nr += add\n res = min(res, solve(np, nq, nr, a, b, c, rs + 1))\n for mul in muls:\n np = p\n nq = q\n nr = r\n if (msk & 1) > 0:\n np = mul\n if (msk & 2) > 0:\n nq = mul\n if (msk & 4) > 0:\n nr = mul\n res = min(res, solve(np, nq, nr, a, b, c, rs + 1))\n return res\n \nt = int(stdin.readline())\nwhile t > 0:\n p,q,r = map(int,stdin.readline().split())\n a,b,c = map(int,stdin.readline().split())\n print(solve(p,q,r,a,b,c,0))\n t -= 1", "def eq_solve(v0, v1, u0, u1):\n den = u0 - v0\n num = u1 - v1\n if den != 0:\n return num / den\n return 1\n \ndef solve(p, q, r, a, b, c, rs):\n if p == a and q == b and r == c:\n return rs\n if rs >= 2:\n return 3\n res = 3\n adds = [a - p, b - q, c - r]\n muls = []\n if p != 0:\n muls.append(a / p)\n if q != 0:\n muls.append(b / q)\n if r != 0:\n muls.append(c / r)\n muls.append(eq_solve(p, a, q, b))\n muls.append(eq_solve(p, a, r, c))\n muls.append(eq_solve(q, b, r, c))\n msks = 2 * 3\n for msk in range(msks):\n for add in adds:\n np = p\n nq = q\n nr = r\n if (msk & 1) > 0:\n np += add\n if (msk & 2) > 0:\n nq += add\n if (msk & 4) > 0:\n nr += add\n res = min(res, solve(np, nq, nr, a, b, c, rs + 1))\n for mul in muls:\n np = p\n nq = q\n nr = r\n if (msk & 1) > 0:\n np = mul\n if (msk & 2) > 0:\n nq = mul\n if (msk & 4) > 0:\n nr = mul\n res = min(res, solve(np, nq, nr, a, b, c, rs + 1))\n return res\n \n \n \nt = int(input())\n \nwhile t > 0:\n p, q, r = map(int, input().split())\n a, b, c = map(int, input().split())\n print(solve(p, q, r, a, b, c, 0))\n t -= 1 ", "import sys\r\ndef fop(s,end='\\n'): sys.stdout.write(str(s)+end)\r\ndef fip(): return sys.stdin.readline().strip()\r\nfintinp = lambda : int(fip()) \r\ndef flistinp(func= int): return list(map(func,fip().split())) \r\ndef fnsepline(n,func=str): return [func(fip()) for _ in range(n)]\r\nfrom functools import lru_cache\r\n#-------------------code------------------------\r\n@lru_cache(maxsize=1<<10)\r\ndef byeqs(pqr, abc):\r\n # f_ans = 3\r\n p,q,r = pqr\r\n a,b,c = abc\r\n # zeq = a(r-q) + b(p-r) + c(q-p)\r\n # m=n=None # for y = mx + n\r\n muls = [] \r\n # if zeq==0:\r\n try:\r\n if p!=q:\r\n m_ = (a-b)//(p-q)\r\n muls.append(m_)\r\n except: pass\r\n try:\r\n if p!=r:\r\n m_ = (a-c)//(p-r)\r\n muls.append(m_)\r\n except: pass\r\n try:\r\n if q!=r:\r\n m_ = (b-c)//(q-r)\r\n muls.append(m_)\r\n except: pass\r\n return muls\r\n\r\n@lru_cache(maxsize=1<<10)\r\ndef recSolver(pqr, abc, ans = 0):\r\n if pqr == abc: return ans \r\n if ans>=2: return 3\r\n adds = [abc[i]-pqr[i] for i in range(3)]\r\n muls = [abc[i]//pqr[i] if pqr[i]!=0 else 0 for i in range(3)] + byeqs(pqr, abc)\r\n f_ans = 3 \r\n for ss in range(8):\r\n for a in adds:\r\n pqr_copy = list(pqr)\r\n for i in [1,2,4]:\r\n if ss&i:\r\n pqr_copy[i>>1]+=a \r\n f_ans = min(f_ans, recSolver(tuple(pqr_copy), tuple(abc), ans+1))\r\n \r\n for m in muls:\r\n pqr_copy = list(pqr)\r\n for i in [1,2,4]:\r\n if ss&i:\r\n pqr_copy[i>>1]=m \r\n f_ans = min(f_ans, recSolver(tuple(pqr_copy), tuple(abc), ans+1))\r\n return f_ans\r\n \r\nfor _ in range(fintinp()):\r\n pqr = flistinp()\r\n abc = flistinp()\r\n fop(recSolver(tuple(pqr), tuple(abc), 0))", "import sys\r\ndef fop(s,end='\\n'): sys.stdout.write(str(s)+end)\r\ndef fip(): return sys.stdin.readline().strip()\r\nfintinp = lambda : int(fip()) \r\ndef flistinp(func= int): return list(map(func,fip().split())) \r\ndef fnsepline(n,func=str): return [func(fip()) for _ in range(n)]\r\nfrom functools import lru_cache\r\n#-------------------code------------------------\r\n@lru_cache(maxsize=1<<20)\r\ndef byeqs(pqr, abc):\r\n # f_ans = 3\r\n p,q,r = pqr\r\n a,b,c = abc\r\n # zeq = a(r-q) + b(p-r) + c(q-p)\r\n # m=n=None # for y = mx + n\r\n muls = [] \r\n # if zeq==0:\r\n try:\r\n if p!=q:\r\n m_ = (a-b)//(p-q)\r\n muls.append(m_)\r\n except: pass\r\n try:\r\n if p!=r:\r\n m_ = (a-c)//(p-r)\r\n muls.append(m_)\r\n except: pass\r\n try:\r\n if q!=r:\r\n m_ = (b-c)//(q-r)\r\n muls.append(m_)\r\n except: pass\r\n return muls\r\n\r\n@lru_cache(maxsize=1<<20)\r\ndef recSolver(pqr, abc, ans = 0):\r\n if pqr == abc: return ans \r\n if ans>=2: return 3\r\n adds = [abc[i]-pqr[i] for i in range(3)]\r\n muls = [abc[i]//pqr[i] if pqr[i]!=0 else 0 for i in range(3)] + byeqs(pqr, abc)\r\n f_ans = 3 \r\n for ss in range(8):\r\n for a in adds:\r\n pqr_copy = list(pqr)\r\n for i in [1,2,4]:\r\n if ss&i:\r\n pqr_copy[i>>1]+=a \r\n f_ans = min(f_ans, recSolver(tuple(pqr_copy), tuple(abc), ans+1))\r\n \r\n for m in muls:\r\n pqr_copy = list(pqr)\r\n for i in [1,2,4]:\r\n if ss&i:\r\n pqr_copy[i>>1]=m \r\n f_ans = min(f_ans, recSolver(tuple(pqr_copy), tuple(abc), ans+1))\r\n return f_ans\r\n \r\nfor _ in range(fintinp()):\r\n pqr = flistinp()\r\n abc = flistinp()\r\n fop(recSolver(tuple(pqr), tuple(abc), 0))", "import sys\r\ndef fop(s,end='\\n'): sys.stdout.write(str(s)+end)\r\ndef fip(): return sys.stdin.readline().strip()\r\nfintinp = lambda : int(fip()) \r\ndef flistinp(func= int): return list(map(func,fip().split())) \r\ndef fnsepline(n,func=str): return [func(fip()) for _ in range(n)]\r\n#-------------------code------------------------\r\ndef byeqs(pqr, abc):\r\n # f_ans = 3\r\n p,q,r = pqr\r\n a,b,c = abc\r\n # zeq = a(r-q) + b(p-r) + c(q-p)\r\n # m=n=None # for y = mx + n\r\n muls = [] \r\n # if zeq==0:\r\n try:\r\n if p!=q:\r\n m_ = (a-b)//(p-q)\r\n muls.append(m_)\r\n except: pass\r\n try:\r\n if p!=r:\r\n m_ = (a-c)//(p-r)\r\n muls.append(m_)\r\n except: pass\r\n try:\r\n if q!=r:\r\n m_ = (b-c)//(q-r)\r\n muls.append(m_)\r\n except: pass\r\n return muls\r\n\r\ndef recSolver(pqr, abc, ans = 0):\r\n if pqr == abc: return ans \r\n if ans>=2: return 3\r\n adds = [abc[i]-pqr[i] for i in range(3)]\r\n muls = [abc[i]//pqr[i] if pqr[i]!=0 else 0 for i in range(3)] + byeqs(pqr, abc)\r\n f_ans = 3 \r\n for ss in range(8):\r\n for a in adds:\r\n pqr_copy = list(pqr)\r\n for i in [1,2,4]:\r\n if ss&i:\r\n pqr_copy[i>>1]+=a \r\n f_ans = min(f_ans, recSolver(pqr_copy, abc, ans+1))\r\n \r\n for m in muls:\r\n pqr_copy = list(pqr)\r\n for i in [1,2,4]:\r\n if ss&i:\r\n pqr_copy[i>>1]=m \r\n f_ans = min(f_ans, recSolver(pqr_copy, abc, ans+1))\r\n return f_ans\r\n \r\nfor _ in range(fintinp()):\r\n pqr = flistinp()\r\n abc = flistinp()\r\n fop(recSolver(pqr, abc, 0))", "T = int(input())\r\nfor tc in range(T):\r\n p, q, r = map(int, input().split())\r\n a ,b, c = map(int, input().split())\r\n p_diff = a - p\r\n q_diff = b - q\r\n r_diff = c - r\r\n flag = 0\r\n \r\n # GCD of Three Numbers\r\n def gcd(a,b):\r\n if b == 0:\r\n return a\r\n else:\r\n return gcd(b, a%b)\r\n\r\n g_c_d = gcd(a,gcd(b,c))\r\n \r\n def factors(x):\r\n # We will store all factors in `result`\r\n result = []\r\n i = 2\r\n # This will loop from 1 to int(sqrt(x))\r\n while ii <= x:\r\n # Check if i divides x without leaving a remainder\r\n if x % i == 0:\r\n result.append(i)\r\n # Handle the case explained in the 4th\r\n if x//i != i: # In Python, // operator performs integer/floored division\r\n result.append(x//i)\r\n i += 1\r\n # Return the list of factors of x\r\n return result\r\n listi = factors(g_c_d)\r\n \r\n try:\r\n p_rem = a / p\r\n except:\r\n p_rem = 1\r\n try:\r\n q_rem = b / q\r\n except:\r\n q_rem = 1\r\n try:\r\n r_rem = c / r\r\n except:\r\n r_rem = 1\r\n \r\n if a == p and b == q and c == r:\r\n print(\"0\")\r\n flag = 1\r\n continue\r\n elif p_rem == q_rem == r_rem != 1:\r\n print(\"1\")\r\n flag = 1\r\n continue\r\n elif p_diff == q_diff == r_diff:\r\n print(\"1\")\r\n flag = 1\r\n continue\r\n elif p == a and q == b:\r\n print(\"1\")\r\n flag = 1\r\n continue\r\n elif p == a and r == c:\r\n print(\"1\")\r\n flag = 1\r\n continue\r\n elif q == b and r == c:\r\n print(\"1\")\r\n continue\r\n elif p == a:\r\n if q_diff == r_diff:\r\n print(\"1\")\r\n flag = 1\r\n continue\r\n elif q_rem == r_rem != 1:\r\n print(\"1\")\r\n flag = 1\r\n continue\r\n else:\r\n print(\"2\")\r\n flag = 1\r\n continue\r\n elif q == b:\r\n if p_diff == r_diff:\r\n print(\"1\")\r\n flag = 1\r\n continue\r\n elif p_rem == r_rem != 1:\r\n print(\"1\")\r\n flag = 1\r\n continue\r\n else:\r\n print(\"2\")\r\n flag = 1\r\n continue\r\n elif r == c:\r\n if q_diff == p_diff:\r\n print(\"1\")\r\n flag = 1\r\n elif q_rem == p_rem != 1:\r\n print(\"1\")\r\n flag = 1\r\n continue\r\n else:\r\n print(\"2\")\r\n flag = 1\r\n elif p_diff == 0:\r\n if q_diff == r_diff:\r\n print(\"1\")\r\n flag = 1\r\n continue\r\n elif q_rem == r_rem:\r\n print(\"1\")\r\n flag = 1\r\n continue\r\n else:\r\n print(\"2\")\r\n flag = 1\r\n continue\r\n elif q_diff == 0:\r\n if p_diff == r_diff:\r\n print(\"1\")\r\n flag = 1\r\n continue\r\n elif p_rem == r_rem:\r\n print(\"1\")\r\n flag = 1\r\n continue\r\n else:\r\n print(\"2\")\r\n flag = 1\r\n continue\r\n elif r_diff == 0:\r\n if p_diff == q_diff:\r\n print(\"1\")\r\n flag = 1\r\n continue\r\n elif p_rem == q_rem:\r\n print(\"1\")\r\n flag = 1\r\n continue\r\n else:\r\n print(\"2\")\r\n flag = 1\r\n continue\r\n elif r_diff - p_diff == q_diff:\r\n print(\"2\")\r\n continue\r\n elif r_diff - q_diff == p_diff:\r\n print(\"2\")\r\n continue\r\n elif q_diff - r_diff == p_diff:\r\n print(\"2\")\r\n continue\r\n elif q_diff - p_diff == r_diff:\r\n print(\"2\")\r\n continue\r\n elif p_diff - q_diff == r_diff:\r\n print(\"2\")\r\n continue\r\n elif p_diff - r_diff == q_diff:\r\n print(\"2\")\r\n continue\r\n \r\n elif p_diff == q_diff:\r\n print(\"2\")\r\n flag = 1\r\n continue\r\n elif q_diff == r_diff:\r\n print(\"2\")\r\n flag = 1\r\n continue\r\n elif p_diff == r_diff:\r\n print(\"2\")\r\n flag = 1\r\n continue\r\n elif p_rem == q_rem and r_rem != 1:\r\n print(\"2\")\r\n flag = 1\r\n continue\r\n elif p_rem == r_rem and q_rem != 1:\r\n print(\"2\")\r\n flag = 1\r\n continue\r\n elif q_rem == r_rem and p_rem != 1:\r\n print(\"2\")\r\n flag = 1\r\n continue\r\n elif ((a // g_c_d) - p) == ((b // g_c_d) - q) == ((c // g_c_d) - r):\r\n print(\"2\")\r\n flag = 1\r\n continue\r\n if flag == 0:\r\n try:\r\n if (r_diff - b) / q == (r_diff - a) / p:\r\n print(\"2\")\r\n flag = 1\r\n continue\r\n except:\r\n if (r_diff - b) / 1 == (r_diff - a) / 1:\r\n print(\"2\")\r\n flag = 1\r\n continue\r\n try:\r\n if (q_diff - c) / r == (q_diff - a) / p:\r\n print(\"2\")\r\n flag = 1\r\n continue\r\n except:\r\n if (q_diff - c) / 1 == (q_diff - a) / 1:\r\n print(\"2\")\r\n flag = 1\r\n continue\r\n try:\r\n if (p_diff - c) / r == (p_diff - b) / q:\r\n print(\"2\")\r\n flag = 1\r\n continue\r\n except:\r\n if (p_diff - c) / 1 == (p_diff - b) / 1:\r\n print(\"2\")\r\n flag = 1\r\n continue\r\n try:\r\n if (b/ r_rem) - q == a - p:\r\n print(\"2\")\r\n flag = 1\r\n continue\r\n except:\r\n if (b/ 1) - q == a - p:\r\n print(\"2\")\r\n flag = 1\r\n continue\r\n try: \r\n if (a / r_rem) - p == b - q:\r\n print(\"2\")\r\n flag = 1\r\n continue\r\n except:\r\n if (a / 1) - p == b - q:\r\n print(\"2\")\r\n flag = 1\r\n continue\r\n try:\r\n if (b / p_rem) - q == c - r:\r\n print(\"2\")\r\n flag = 1\r\n continue\r\n except:\r\n if (b / 1) - q == c - r:\r\n print(\"2\")\r\n flag = 1\r\n continue\r\n try:\r\n if (c / p_rem) - r == b - q:\r\n print(\"2\")\r\n flag = 1\r\n continue\r\n except:\r\n if (c / 1) - r == b - q:\r\n print(\"2\")\r\n flag = 1\r\n continue\r\n try:\r\n if (c / q_rem) - r == a - p:\r\n print(\"2\")\r\n flag = 1\r\n continue\r\n except:\r\n if (c / 1) - r == a - p:\r\n print(\"2\")\r\n flag = 1\r\n continue\r\n try:\r\n if (a / q_rem) - p == c - r:\r\n print(\"2\")\r\n flag = 1\r\n continue\r\n except:\r\n if (a / 1) - p == c - r:\r\n print(\"2\")\r\n flag = 1\r\n continue\r\n \r\n if flag == 0:\r\n try:\r\n if (b - (c-r)) / q == p_rem:\r\n print(\"2\")\r\n flag = 1\r\n continue\r\n except:\r\n x = 1\r\n if (b - (c-r)) / x == p_rem:\r\n print(\"2\")\r\n flag = 1\r\n continue\r\n try:\r\n if (b - (a-p)) / q == r_rem:\r\n print(\"2\")\r\n flag = 1\r\n continue\r\n except:\r\n x = 1\r\n if (b - (a-p)) / x == r_rem:\r\n print(\"2\")\r\n flag = 1\r\n continue\r\n \r\n try:\r\n if (a - (b-q)) / p == r_rem:\r\n print(\"2\")\r\n flag = 1\r\n continue\r\n except:\r\n x = 1\r\n if (a - (b-q)) / x == r_rem:\r\n print(\"2\")\r\n flag = 1\r\n continue\r\n try:\r\n if (a - (c-r)) / p == q_rem:\r\n print(\"2\")\r\n flag = 1\r\n continue\r\n \r\n except:\r\n x = 1\r\n if (a - (c-r)) / x == q_rem:\r\n print(\"2\")\r\n flag = 1\r\n continue\r\n try:\r\n if (c - (b-q)) / r == p_rem:\r\n print(\"2\")\r\n flag = 1\r\n continue\r\n except:\r\n x = 1\r\n if (c - (b-q)) / x == p_rem:\r\n print(\"2\")\r\n flag = 1\r\n continue\r\n try:\r\n if (c - (a-p)) / r == q_rem:\r\n print(\"2\")\r\n flag = 1\r\n continue\r\n except:\r\n x = 1\r\n if (c - (a-p)) / x == q_rem:\r\n print(\"2\")\r\n flag = 1\r\n continue\r\n try:\r\n if (b / r_rem) / q == p_rem:\r\n print(\"2\")\r\n flag = 1\r\n continue\r\n except:\r\n x = 1\r\n if (b / x) / x == p_rem:\r\n print(\"2\")\r\n flag = 1\r\n continue\r\n try:\r\n if (a / r_rem) / p == q_rem:\r\n print(\"2\")\r\n flag = 1\r\n continue\r\n except:\r\n x = 1\r\n if (a / x) / x == q_rem:\r\n print(\"2\")\r\n flag = 1\r\n continue\r\n try:\r\n if (b / p_rem) / q == r_rem:\r\n print(\"2\")\r\n flag = 1\r\n continue\r\n except:\r\n x = 1\r\n if (b / x) / x == r_rem:\r\n print(\"2\")\r\n flag = 1\r\n continue\r\n try:\r\n if (c / p_rem) / r == q_rem:\r\n print(\"2\")\r\n flag = 1\r\n continue\r\n except:\r\n x = 1\r\n if (c / x) / x == q_rem:\r\n print(\"2\")\r\n flag = 1\r\n continue\r\n try:\r\n if (a / q_rem) / p == r_rem:\r\n print(\"2\")\r\n flag = 1\r\n continue\r\n except:\r\n x = 1\r\n if (a / x) / x == r_rem:\r\n print(\"2\")\r\n flag = 1\r\n continue\r\n try:\r\n if (c / q_rem) / r == p_rem:\r\n print(\"2\")\r\n flag = 1\r\n continue\r\n except:\r\n x = 1\r\n if (c / x) / x == p_rem:\r\n print(\"2\")\r\n flag = 1\r\n continue\r\n \r\n if flag == 0:\r\n try:\r\n if b / (q + (c-r)) == a / (p +(c-r)):\r\n print(\"2\")\r\n flag = 1\r\n continue\r\n except:\r\n rem1 = 1\r\n rem2 = 1\r\n if b / rem1 == a / rem2:\r\n print(\"2\")\r\n flag = 1\r\n continue\r\n \r\n try:\r\n if c / (r + (b-q)) == a / (p +(b-q)):\r\n print(\"2\")\r\n flag = 1\r\n continue\r\n except:\r\n rem1 = 1\r\n rem2 = 1\r\n if c / rem1 == a / rem2:\r\n print(\"2\")\r\n flag = 1\r\n continue\r\n \r\n try:\r\n if b / (q + (a-p)) == c / (r +(a-p)):\r\n print(\"2\")\r\n flag = 1\r\n continue\r\n except:\r\n rem1 = 1\r\n rem2 = 1\r\n if b / rem1 == c / rem2:\r\n print(\"2\")\r\n flag = 1\r\n continue\r\n \r\n \r\n if flag == 0:\r\n if(p-q != 0):\r\n rem = (a-b)/(p-q)\r\n diff = a - (prem)\r\n if(rem%1 == 0 and diff%1 == 0 and (rrem+diff)==c):\r\n print(\"2\")\r\n flag = 1\r\n if flag == 0:\r\n if len(listi) > 0:\r\n for x in listi:\r\n if ((a // x) - p) == ((b // x) - q) == ((c // x) - r):\r\n print(\"2\")\r\n flag = 1\r\n if flag == 0:\r\n if a - (q_rem * p) == c - (q_rem * r):\r\n print(\"2\")\r\n flag = 1\r\n continue\r\n elif a - (r_rem * p) == b - (r_rem * q):\r\n print(\"2\")\r\n flag = 1\r\n continue\r\n elif c - (p_rem * r) == b - (p_rem * q):\r\n print(\"2\")\r\n flag = 1\r\n continue\r\n if flag == 0:\r\n print(\"3\")", "intput = lambda: [int(i) for i in input().split()]\n# Write your code here\nfrom sys import stdout\nsol = \"3332323313233322223333\"\nsubsets = ['100', '010', '001', '110', '101', '011', '111']\neq = lambda x, y: abs(x - y) < 1e-6\ndef check(x):\n if x == [9, 7, 4]:\n print(\"Debug\")\n if x == y:\n return 0\n d, q, f = [], [], []\n for i in range(3):\n d.append(y[i] - x[i])\n q.append(0.5 if x[i] == 0 else y[i] / x[i])\n f.append(q[i] % 1 == 0)\n for i in range(3):\n j, k = (i + 1) % 3, (i + 2) % 3\n if x[j] == y[j] and x[k] == y[k]:\n return 1\n if x[i] == y[i] and (d[j] == d[k] or (f[j] and eq(q[j], q[k]))):\n return 1\n if (d[0] == d[1] and d[0] == d[2]) or (f[0] and eq(q[0], q[1]) and eq(q[0], q[2])):\n return 1\n return 2\ndef move(subset, oper, d):\n res = x.copy()\n for i in range(3):\n if subset[i] == '1':\n res[i] = res[i] + d if oper else res[i] * d\n return res\nfor tc in range(int(input())):\n x = list(map(int, input().split()))\n y = list(map(int, input().split()))\n a = check(x)\n if a < 2:\n print(a)\n continue\n d, q, f = [], [], []\n for i in range(3):\n d.append(y[i] - x[i])\n q.append(0.5 if x[i] == 0 else y[i] / x[i])\n f.append(q[i] % 1 == 0)\n flag = False\n for subset in subsets:\n for i in range(3):\n a = check(move(subset, True, d[i]))\n if a < 2:\n print(2)\n flag = True\n break\n if f[i]:\n a = check(move(subset, False, q[i]))\n if a < 2:\n print(2)\n flag = True\n break\n if flag:\n break\n if flag:\n continue\n for i in range(3):\n j, k = (i + 1) % 3, (i + 2) % 3\n if x[j] != 0 and x[k] != 0 and eq((y[j] - d[i]) / x[j], (y[k] - d[i]) / x[k]) and ((y[j] - d[i]) / x[j]) % 1 == 0:\n print(2)\n flag = True\n break\n if flag:\n continue\n if x[0] != x[1] and x[0] != x[2] and eq((y[0] - y[1]) / (x[0] - x[1]), (y[0] - y[2]) / (x[0] - x[2])):\n print(2)\n continue\n print(3)", "intput = lambda: [int(i) for i in input().split()]\n# Write your code here\nfrom sys import stdout\nsol = \"3332323313233322223333\"\nsubsets = ['100', '010', '001', '110', '101', '011', '111']\neq = lambda x, y: abs(x - y) < 1e-6\ndef check(x):\n if x == [9, 7, 4]:\n print(\"Debug\")\n if x == y:\n return 0\n d, q, f = [], [], []\n for i in range(3):\n d.append(y[i] - x[i])\n q.append(0.5 if x[i] == 0 else y[i] / x[i])\n f.append(q[i] % 1 == 0)\n for i in range(3):\n j, k = (i + 1) % 3, (i + 2) % 3\n if x[j] == y[j] and x[k] == y[k]:\n return 1\n if x[i] == y[i] and (d[j] == d[k] or (f[j] and eq(q[j], q[k]))):\n return 1\n if (d[0] == d[1] and d[0] == d[2]) or (f[0] and eq(q[0], q[1]) and eq(q[0], q[2])):\n return 1\n return 2\ndef move(subset, oper, d):\n res = x.copy()\n for i in range(3):\n if subset[i] == '1':\n res[i] = res[i] + d if oper else res[i] * d\n return res\nfor tc in range(int(input())):\n x = list(map(int, input().split()))\n y = list(map(int, input().split()))\n a = check(x)\n if a < 2:\n print(a)\n continue\n d, q, f = [], [], []\n for i in range(3):\n d.append(y[i] - x[i])\n q.append(0.5 if x[i] == 0 else y[i] / x[i])\n f.append(q[i] % 1 == 0)\n flag = False\n for subset in subsets:\n for i in range(3):\n a = check(move(subset, True, d[i]))\n if a < 2:\n print(2)\n flag = True\n break\n if f[i]:\n a = check(move(subset, False, q[i]))\n if a < 2:\n print(2)\n flag = True\n break\n if flag:\n break\n if flag:\n continue\n for i in range(3):\n j, k = (i + 1) % 3, (i + 2) % 3\n if x[j] != 0 and x[k] != 0 and eq((y[j] - d[i]) / x[j], (y[k] - d[i]) / x[k]) and ((y[j] - d[i]) / x[j]) % 1 == 0:\n print(2)\n flag = True\n break\n if flag:\n continue\n if x[0] != x[1] and eq((y[0] - y[1]) / (x[0] - x[1]), (y[0] - y[2]) / (x[0] - x[2])):\n print(2)\n continue\n print(3)", "def d1d2(p,q,r,a,b,c):\r\n if p == 0 or q == 0 or r == 0:\r\n return False\r\n if a%p == 0 and b % q == 0:\r\n d1 = a//p\r\n d2 = b//q\r\n if c == r * d1 * d2:\r\n return True\r\n return False\r\n return False\r\n \r\ndef e1e2(p,q,r,a,b,c):\r\n e1 = a - p\r\n e2 = b - q\r\n return c == r + e1 + e2\r\n \r\ndef d3e3(p,q,r,a,b,c):\r\n delta = [0, 0, 0]\r\n delta[0] = p - q\r\n# print(f'1.{delta=}')\r\n if delta[0] == 0:\r\n return False\r\n # explanation:\r\n # for infinite no of sols a = b; but q = p(delta[0] == 0) sol 2 same case (already handled) not considering here\r\n delta[1] = a - b\r\n delta[2] = pb - qa\r\n# print(f'2.{delta=}')\r\n if delta[1] % delta[0] == 0 and delta[2] % delta[0] == 0:\r\n val_d = delta[1]//delta[0]\r\n val_e = delta[2]//delta[0]\r\n return c == r * val_d + val_e\r\n \r\n else:\r\n #e and d are not integer solutions\r\n return False\r\n \r\ndef d3e2(p,q,r,a,b,c):\r\n #assuming a,b eq has same form\r\n delta = [0, 0, 0]\r\n delta[0] = p - q\r\n if delta[0] == 0:\r\n return False\r\n # explanation:\r\n # for infinite no of sols a = b; but q = p(delta[0] == 0) sol 2 same case (already handled) not considering here\r\n delta[1] = a - b\r\n delta[2] = pb - qa\r\n# print(f'\u03940 = {delta[0]} \u03941 = {delta[1]} \u03942 = {delta[2]}')\r\n if delta[1] % delta[0] == 0 and delta[2] % delta[0] == 0:\r\n val_d = delta[1]//delta[0]\r\n val_e = delta[2]//delta[0]\r\n# print(f'd = {val_d} e = {val_e}')\r\n return c == r * val_d\r\n \r\n else:\r\n #e and d are not integer solutions\r\n return False\r\n \r\ndef d2e3(p,q,r,a,b,c):\r\n #assuming a,b eq has same form\r\n \r\n delta = [0, 0, 0]\r\n delta[0] = p - q\r\n if delta[0] == 0:\r\n return False\r\n # explanation:\r\n # for infinite no of sols a = b; but q = p(delta[0] == 0) sol 2 same case (already handled) not considering here\r\n delta[1] = a - b\r\n delta[2] = pb - qa\r\n\r\n if delta[1] % delta[0] == 0 and delta[2] % delta[0] == 0:\r\n val_d = delta[1]//delta[0]\r\n val_e = delta[2]//delta[0]\r\n return c == r + val_e\r\n \r\n else:\r\n #e and d are not integer solutions\r\n return False\r\n \r\n'''\r\ntwo case: 1. a = pd + e, b = qd + e, c = r (already handled 1 same)\r\n2. a = pd + e, b = qd, c = r + e\r\n'''\r\ndef d2e2(p,q,r,a,b,c):\r\n if q != 0 and b % q == 0:\r\n d = b//q\r\n e = c - r\r\n assert e != 0, \"already checked, one same\"\r\n return a == pd + e\r\n return False\r\n\r\ndef e3d2(p,q,r,a,b,c):\r\n assert c!=r, \"1 same\"\r\n e = c - r\r\n if p != -e and q !=-e and a % (p + e) == 0 and b % (q + e) == 0:# p + e != 0 as then a = 0 and 1 difference case or no soln\r\n d1 = a//(p + e)\r\n d2 = b//(q + e)\r\n return d1 != 1 and d1 == d2\r\n return False\r\n \r\ndef e2d2(p,q,r,a,b,c):\r\n if r != 0 and c % r == 0:\r\n d = c//r\r\n e = b - q\r\n assert d != 1 and e != 0, '1 or 2 same'\r\n return a == (p + e) d\r\n return False\r\n \r\ndef modified(src, dst):\r\n p,q,r = src\r\n a,b,c = dst\r\n # print(p,q,r), '-->',(a,b,c)\r\n \r\n #case 1: some are same\r\n #case 1.0: all are same then 0 chances:\r\n if p == a and q == b and r == c:\r\n print(0)\r\n return\r\n #case 1.1:if two are same\r\n # p,q\r\n if p == a and q == b:\r\n if r != c:\r\n print(1)\r\n return\r\n assert True, \"Should not have come here1\"\r\n # q,r\r\n if q == b and r == c:\r\n if p != a:\r\n print(1)\r\n return\r\n assert True, \"Should not have come here2\"\r\n # r,p\r\n if r == c and p == a:\r\n if q != b:\r\n print(1)\r\n return\r\n assert True, \"Should not have come here3\"\r\n \r\n #case 1.3 any one is same\r\n # p\r\n if p == a:\r\n if b - q == c - r:\r\n print(1)\r\n return\r\n if q != 0 and r != 0 and b%q == 0 and b%q == c%r and b//q == c//r:\r\n print(1)\r\n return\r\n print(2)\r\n return\r\n if q == b:\r\n if c - r == a - p:\r\n print(1)\r\n return\r\n if p != 0 and r != 0 and a%p == 0 and a%p == c%r and a//p == c//r:\r\n print(1)\r\n return\r\n print(2)\r\n return\r\n \r\n if r == c:\r\n if b - q == a - p:\r\n print(1)\r\n return\r\n if p != 0 and q != 0 and a%p == 0 and a%p == b%q and a//p == b//q:\r\n print(1)\r\n return\r\n print(2)\r\n return \r\n #case 2: all are different\r\n #case 2.1: all are at same difference : 2 same ratio/ difference\r\n if p-a == q-b and q-b == r-c:\r\n print(1)\r\n return\r\n #or at same ratio\r\n if p!=0 and q!= 0 and r!=0:\r\n if a%p == 0 and a%p == b%q and b%q == c%r:\r\n if a//p == b//q and b//q == c//r:\r\n print(1)\r\n return\r\n #if any two has same difference or ratio\r\n #case 2.2: 1 same ratio/difference\r\n # p,q\r\n if p-a == q-b :\r\n print(2)\r\n return\r\n if p!=0 and q!=0 and a%p == 0 and a%p == b%q and a//p == b//q:\r\n print(2)\r\n return\r\n # q,r\r\n if r-c == q-b :\r\n print(2)\r\n return\r\n if r!=0 and q!=0 and c%r == 0 and c%r == b%q and c//r == b//q:\r\n print(2)\r\n return \r\n \r\n # r,p\r\n if p-a == r-c :\r\n print(2)\r\n return\r\n if p!=0 and r!=0 and a%p == 0 and a%p == c%r and a//p == c//r:\r\n print(2)\r\n return\r\n \r\n \r\n #case 3: nothing is same no two has same difference or ration\r\n #case 3.0: pd1 qd2 rd1d2 form\r\n if d1d2(p,q,r,a,b,c) or d1d2(q,r,p,b,c,a) or d1d2(r,p,q,c,a,b):\r\n print(2)\r\n return\r\n #case 3.1: p + e1 q + e2 r + e1 + e2 form\r\n if e1e2(p,q,r,a,b,c) or e1e2(q,r,p,b,c,a) or e1e2(r,p,q,c,a,b):\r\n print(2)\r\n return\r\n #case 3.2: pd + e forms\r\n #case 3.2.1: 3d3e\r\n if d3e3(p,q,r,a,b,c):\r\n print(2)\r\n return\r\n #case 3.2.2: 3d2e\r\n if d3e2(p,q,r,a,b,c) or d3e2(q,r,p,b,c,a) or d3e2(r,p,q,c,a,b):\r\n print(2)\r\n return\r\n \r\n #case 3.2.3: 2d3e\r\n if d2e3(p,q,r,a,b,c) or d2e3(q,r,p,b,c,a) or d2e3(r,p,q,c,a,b):\r\n print(2)\r\n return\r\n if d2e2(p,q,r,a,b,c) or d2e2(q,r,p,b,c,a) or d2e2(r,p,q,c,a,b) or d2e2(p,r,q,a,c,b) or d2e2(q,p,r,b,a,c) or d2e2(r,q,p,c,b,a):\r\n print(2)\r\n return\r\n if e3d2(p,q,r,a,b,c) or e3d2(q,r,p,b,c,a) or e3d2(r,p,q,c,a,b):\r\n print(2)\r\n return\r\n if e2d2(p,q,r,a,b,c) or e2d2(q,r,p,b,c,a) or e2d2(r,p,q,c,a,b) or e2d2(p,r,q,a,c,b) or e2d2(q,p,r,b,a,c) or e2d2(r,q,p,c,b,a):\r\n print(2)\r\n return\r\n print(3)\r\n \r\nfor _ in range(int(input())):\r\n src = tuple(map(int, input().split()))\r\n dst = tuple(map(int, input().split()))\r\n modified(src, dst)\r\n # print(modified(src, dst))", "def aa22(p,q,r,a,b,c):\n if(q+a-p+c-r == b):\n return 1\n else:\n return 0\ndef aa21(p,q,r,a,b,c):\n if(p-q==a-b):\n return 1\n else:\n return 0\ndef as22(p,q,r,a,b,c):\n if((p+b-c+r-q)==a):\n return 1\n else:\n return 0\ndef am22(p,q,r,a,b,c):\n if(r!=0 and c!=0 and c%r==0 and (br)%c==0 and ((br)//c)-q==(a-p)):\n return 1\n else:\n return 0\ndef am21(p,q,r,a,b,c):\n if((r!=0) and c%r==0 and (p-q)==(a-b)):\n return 1\n else:\n return 0\ndef am23(p,q,r,a,b,c):\n if((r!=0) and (c!=0) and (c%r)==0 and (br)%c==0 and (ar)%c==0 and ((ar)//c)-p==((br)//c)-q):\n return 1\n else:\n return 0\ndef am32(p,q,r,a,b,c):\n if((q+c-r)!=0 and (p+c-r)!=0 and (b//(q+c-r))==(a//(p+c-r)) and b%(q+c-r)==0 and a%(p+c-r)==0):\n return 1\n else:\n return 0\ndef ma33(p,q,r,a,b,c):\n if((p-q)!=0 and ((bp)-(aq))%(p-q)==0 and (q-r)!=0 and p!=0 and ((cq)-(br))%(q-r)==0 and ((bp)-(aq))//(p-q)==((cq)-(br))//(q-r) and (a-(((bp)-(aq))//(p-q)))%p==0):\n return 1\n else:\n return 0\ndef am33(p,q,r,a,b,c):\n if((a-b)!=0 and ((bp)-(aq))%(a-b)==0 and (b-c)!=0 and ((cq)-(br))%(b-c)==0 and ((bp)-(aq))//(a-b)==((cq)-(br))//(b-c) and (p+(((bp)-(aq))//(a-b)))!=0 and a%(p+(((bp)-(aq))//(a-b)))==0):\n return 1\n else:\n return 0\ndef ma22(p,q,r,a,b,c):\n if((p!=0) and q!=0 and (a%p)==0 and (b-c+r)%q==0 and (a//p)==((b-c+r)//q)):\n return 1\n else:\n return 0\ndef ma21(p,q,r,a,b,c):\n if((p!=0) and (q!=0) and (a%p)==0 and (b%q)==0 and (a//p)==(b//q)):\n return 1\n else:\n return 0\ndef ma23(p,q,r,a,b,c):\n if((q!=0) and (p!=0) and (b-c+r)%q==0 and (a-c+r)%p==0 and ((b-c+r)//q)==((a-c+r)//p)):\n return 1\n else:\n return 0\ndef ma32(p,q,r,a,b,c):\n if(r!=0 and (qc)%r==0 and (pc)%r==0 and b-((qc)//r)==a-((pc)//r) and (c%r)==0):\n return 1\n else:\n return 0\ndef ms22(p,q,r,a,b,c):\n if((q!=0) and (p!=0) and ((b+r-c)%q)==0 and (a%p)==0 and ((b+r-c)//q)==(a//p)):\n return 1\n else:\n return 0\ndef mm22(p,q,r,a,b,c):\n if((qc)!=0 and (br)%(qc)==0 and (p!=0) and a%p==0 and (a//p)==((br)//(qc))):\n return 1\n else:\n return 0\ndef mm21(p,q,r,a,b,c):\n if((r!=0) and (c%r==0) and (q!=0) and (p!=0) and (b//q)==(a//p) and (b%q)==0 and (a%p)==0):\n return 1\n else:\n return 0\ndef sa22(p,q,r,a,b,c):\n if((q-b+c-r)==(p-a)):\n return 1\n else:\n return 0\ndef sa21(p,q,r,a,b,c):\n if((p-a)==(q-b)):\n return 1\n else:\n return 0\ndef sm32(p,q,r,a,b,c):\n if((q-r+c)!=0 and (p-r+c)!=0 and (b//(q-r+c))==(a//(p-r+c)) and b%(q-r+c)==0 and a%(p-r+c)==0):\n return 1\n else:\n return 0\ndef as2(q,r,b,c):\n if((q-r) == (b-c)):\n return 1\n else:\n return 0\ndef m2(q,r,b,c):\n if(r!=0 and q!=0 and (b//q)==(c//r) and (b%q)==0 and (c%r)==0):\n return 1\n else:\n return 0\ndef as3(p,q,r,a,b,c):\n if(p-q == a-b and q-r == b-c and p-r == a-c):\n return 1\n else:\n return 0\ndef m3(p,q,r,a,b,c):\n if(q!=0 and r!=0 and p!=0 and (a//p)==(b//q) and (b//q)==(c//r) and (a%p)==0 and (b%q)==0 and c%r==0):\n return 1\n else:\n return 0\nt=int(input())\nwhile(t>0):\n p,q,r=map(int,input().split())\n a,b,c=map(int,input().split())\n l=[]\n d=[]\n l3=[]\n l.append(p)\n l.append(q)\n l.append(r)\n l.append(p)\n l.append(r)\n l.append(q)\n l.append(q)\n l.append(p)\n l.append(r)\n l.append(q)\n l.append(r)\n l.append(p)\n l.append(r)\n l.append(p)\n l.append(q)\n l.append(r)\n l.append(q)\n l.append(p)\n l3.append(a)\n l3.append(b)\n l3.append(c)\n l3.append(a)\n l3.append(c)\n l3.append(b)\n l3.append(b)\n l3.append(a)\n l3.append(c)\n l3.append(b)\n l3.append(c)\n l3.append(a)\n l3.append(c)\n l3.append(a)\n l3.append(b)\n l3.append(c)\n l3.append(b)\n l3.append(a)\n l2=[]\n l4=[]\n if(p==a):\n l2.append(q)\n l2.append(r)\n l4.append(b)\n l4.append(c)\n if(q==b):\n l2.append(p)\n l2.append(r)\n l4.append(a)\n l4.append(c)\n if(r==c):\n l2.append(p)\n l2.append(q)\n l4.append(a)\n l4.append(b)\n sol=0\n ans=0\n cnt=(p==a)+(q==b)+(r==c)\n if(p==a and q==b and r==c):\n ans=4\n elif(cnt==2):\n ans=1\n else:\n if(cnt==1):\n for i in range(0,2,2):\n sol=as2(l2[i],l2[i+1],l4[i],l4[i+1])\n if(sol==1):\n break\n sol=m2(l2[i],l2[i+1],l4[i],l4[i+1])\n if(sol==1):\n break\n if(sol==1):\n ans=1\n sol=0\n else:\n ans=2\n elif(cnt==0 and ans==0):\n sol=as3(p,q,r,a,b,c)\n if(sol==1):\n ans=1\n sol=m3(p,q,r,a,b,c)\n if(sol==1):\n ans=1\n sol=0\n for i in range(0,16,3):\n if(ans!=0):\n break\n sol=aa22(l[i],l[i+1],l[i+2],l3[i],l3[i+1],l3[i+2])\n if(sol==1):\n break\n sol=aa21(l[i],l[i+1],l[i+2],l3[i],l3[i+1],l3[i+2])\n if(sol==1):\n break\n sol=as22(l[i],l[i+1],l[i+2],l3[i],l3[i+1],l3[i+2])\n if(sol==1):\n break\n sol=am22(l[i],l[i+1],l[i+2],l3[i],l3[i+1],l3[i+2])\n if(sol==1):\n break\n sol=am21(l[i],l[i+1],l[i+2],l3[i],l3[i+1],l3[i+2])\n if(sol==1):\n break\n sol=am23(l[i],l[i+1],l[i+2],l3[i],l3[i+1],l3[i+2])\n if(sol==1):\n break\n sol=am32(l[i],l[i+1],l[i+2],l3[i],l3[i+1],l3[i+2])\n if(sol==1):\n break\n sol=ma33(l[i],l[i+1],l[i+2],l3[i],l3[i+1],l3[i+2])\n if(sol==1):\n break\n sol=am33(l[i],l[i+1],l[i+2],l3[i],l3[i+1],l3[i+2])\n if(sol==1):\n break\n sol=ma22(l[i],l[i+1],l[i+2],l3[i],l3[i+1],l3[i+2])\n if(sol==1):\n break\n sol=ma21(l[i],l[i+1],l[i+2],l3[i],l3[i+1],l3[i+2])\n if(sol==1):\n break\n sol=ma23(l[i],l[i+1],l[i+2],l3[i],l3[i+1],l3[i+2])\n if(sol==1):\n break\n sol=ma32(l[i],l[i+1],l[i+2],l3[i],l3[i+1],l3[i+2])\n if(sol==1):\n break\n sol=ms22(l[i],l[i+1],l[i+2],l3[i],l3[i+1],l3[i+2])\n if(sol==1):\n break\n sol=mm22(l[i],l[i+1],l[i+2],l3[i],l3[i+1],l3[i+2])\n if(sol==1):\n break\n sol=mm21(l[i],l[i+1],l[i+2],l3[i],l3[i+1],l3[i+2])\n if(sol==1):\n break\n sol=sa22(l[i],l[i+1],l[i+2],l3[i],l3[i+1],l3[i+2])\n if(sol==1):\n break\n sol=sm32(l[i],l[i+1],l[i+2],l3[i],l3[i+1],l3[i+2])\n if(sol==1):\n break\n if(sol==1 and ans==0):\n ans=2\n elif(ans==0 and sol!=1):\n ans=3\n if(ans==4):\n print(\"0\")\n else:\n print(ans)\n t=t-1", "def checkpoint1(p,q,r,a,b,c):\r\n if p==a and b-q==c-r :\r\n return True\r\n if q==b and a-p==c-r :\r\n return True\r\n if c==r and a-p==b-q:\r\n return True\r\n if p==a and q==b :\r\n return True\r\n if p==a and c==r :\r\n return True\r\n if c==r and b==q :\r\n return True\r\n if a-p==b-q and a-p==c-r :\r\n return True\r\n if q!=0 and r!=0 and b%q==0 and c%r==0 and p==a and b/q==c/r :\r\n return True\r\n if p!=0 and r!=0 and a%p==0 and c%r==0 and q==b and a/p==c/r :\r\n return True\r\n if p!=0 and q!=0 and a%p==0 and b%q==0 and c==r and a/p==b/q :\r\n return True \r\n if p!=0 and q!=0 and r!=0 and a%p==0 and b%q==0 and c%r==0 and a/p==b/q and a/p==c/r:\r\n return True \r\n return False\r\ndef checkpoint2(p,q,r,a,b,c):\r\n x1=a-p\r\n y1=b-q\r\n z1=c-r\r\n if p==a or q==b or r==c :\r\n return True\r\n if a-p==b-q or b-q==c-r or c-r==a-p :\r\n return True\r\n if p!=0 and q!=0 and ( a%p==0 and b%q==0 ) and ( a/p==b/q ) :\r\n return True\r\n if p!=0 and r!=0 and ( a%p==0 and c%r==0 ) and ( a/p==c/r ) :\r\n return True\r\n if q!=0 and r!=0 and ( b%q==0 and c%r==0 ) and ( b/q==c/r ) :\r\n return True\r\n if p!=0 and q!=0 and r!=0 and a%p==0 and b%q==0 and c%r==0 and ( a/pb/q==c/r or a/pc/r==b/q or b/qc/r==a/p ) :\r\n return True\r\n if x1+y1==z1 or x1+z1==y1 or y1+z1==x1 :\r\n return True\r\n if (q+x1)!=0 and r!=0 and b%(q+x1)==0 and c%r==0 and b/(q+x1)==c/r :\r\n return True\r\n if p!=0 and a%p==0 and b-(qa/p)==c-r :\r\n return True\r\n if (q+z1)!=0 and p!=0 and b%(q+z1)==0 and a%p==0 and b/(q+z1)==a/p:\r\n return True\r\n if r!=0 and c%r==0 and b-(qc/r)==a-p :\r\n return True\r\n if (p+y1)!=0 and r!=0 and a%(p+y1)==0 and c%r==0 and a/(p+y1)==c/r :\r\n return True\r\n if q!=0 and b%q==0 and a-(pb/q)==c-r :\r\n return True\r\n if (p+z1)!=0 and q!=0 and a%(p+z1)==0 and b%q==0 and a/(p+z1)==b/q :\r\n return True\r\n if r!=0 and c%r==0 and a-(pc/r)==b-q :\r\n return True\r\n if (r+y1)!=0 and p!=0 and c%(r+y1)==0 and a%p==0 and c/(r+y1)==a/p :\r\n return True\r\n if q!=0 and b%q==0 and c-(rb/q )==a-p :\r\n return True\r\n if (r+x1)!=0 and q!=0 and c%(r+x1)==0 and b%q==0 and c/(r+x1)==b/q :\r\n return True\r\n if p!=0 and a%p==0 and c-(ra/p)==b-q :\r\n return True\r\n if (p+z1)!=0 and (q+z1)!=0 and a%(p+z1)==0 and b%(q+z1)==0 and a/(p+z1)==b/(q+z1) :\r\n return True\r\n if r!=0 and c%r==0 and a-(pc/r)==b-(qc/r) :\r\n return True\r\n if (p+y1)!=0 and (r+y1)!=0 and a%(p+y1)==0 and c%(r+y1)==0 and a/(p+y1)==c/(r+y1) :\r\n return True\r\n if q!=0 and b%q==0 and a-(pb/q)==c-(rb/q) :\r\n return True\r\n if (q+x1)!=0 and (r+x1)!=0 and b%(q+x1)==0 and c%(r+x1)==0 and b/(q+x1)==c/(r+x1) :\r\n return True\r\n if p!=0 and a%p==0 and b-(qa/p)==c-(ra/p) :\r\n return True\r\n if r!=0 and c%r==0 and c/r!=0 and a%(c/r)==0 and b%(c/r)==0 and a/(c/r)-p==b/(c/r)-q :\r\n return True\r\n if p!=0 and q!=0 and (a-z1)%p==0 and (b-z1)%q==0 and (a-z1)/p==(b-z1)/q :\r\n return True\r\n if q!=0 and b%q==0 and b/q!=0 and a%(b/q)==0 and c%(b/q)==0 and a/(b/q)-p==c/(b/q)-r : \r\n return True\r\n if p!=0 and r!=0 and (a-y1)%p==0 and (c-y1)%r==0 and (a-y1)/p==(c-y1)/r :\r\n return True\r\n if p!=0 and a%p==0 and a/p!=0 and b%(a/p)==0 and c%(a/p)==0 and b/(a/p)-q==c/(a/p)-r : \r\n return True\r\n if q!=0 and r!=0 and (b-x1)%q==0 and (c-x1)%r==0 and (b-x1)/q==(c-x1)/r :\r\n return True \r\n if (q-p)!=0 and (r-q)!=0 and (b-a)%(q-p)==0 and (c-b)%(r-q)==0 and (b-a)/(q-p)==(c-b)/(r-q):\r\n return True\r\n return False\r\ntest=int(input())\r\nfor _ in range(test):\r\n x1,y1,z1=[int(x) for x in input().split()]\r\n a,b,c=[int(x) for x in input().split()]\r\n if a==x1 and b==y1 and c==z1:\r\n print(0)\r\n elif checkpoint1(x1,y1,z1,a,b,c):\r\n print(1)\r\n elif checkpoint2(x1,y1,z1,a,b,c):\r\n print(2)\r\n else:\r\n print(3)", "def checkpoint1(p,q,r,a,b,c):\r\n if p==a and b-q==c-r :\r\n return True\r\n if q==b and a-p==c-r :\r\n return True\r\n if c==r and a-p==b-q:\r\n return True\r\n if p==a and q==b :\r\n return True\r\n if p==a and c==r :\r\n return True\r\n if c==r and b==q :\r\n return True\r\n if a-p==b-q and a-p==c-r :\r\n return True\r\n if q!=0 and r!=0 and b%q==0 and c%r==0 and p==a and b/q==c/r :\r\n return True\r\n if p!=0 and r!=0 and a%p==0 and c%r==0 and q==b and a/p==c/r :\r\n return True\r\n if p!=0 and q!=0 and a%p==0 and b%q==0 and c==r and a/p==b/q :\r\n return True \r\n if p!=0 and q!=0 and r!=0 and a%p==0 and b%q==0 and c%r==0 and a/p==b/q and a/p==c/r:\r\n return True \r\n return False\r\ndef checkpoint2(p,q,r,a,b,c):\r\n x1=a-p\r\n y1=b-q\r\n z1=c-r\r\n if p==a or q==b or r==c :\r\n return True\r\n if a-p==b-q or b-q==c-r or c-r==a-p :\r\n return True\r\n if p!=0 and q!=0 and ( a%p==0 and b%q==0 ) and ( a/p==b/q ) :\r\n return True\r\n if p!=0 and r!=0 and ( a%p==0 and c%r==0 ) and ( a/p==c/r ) :\r\n return True\r\n if q!=0 and r!=0 and ( b%q==0 and c%r==0 ) and ( b/q==c/r ) :\r\n return True\r\n if p!=0 and q!=0 and r!=0 and a%p==0 and b%q==0 and c%r==0 and ( a/pb/q==c/r or a/pc/r==b/q or b/qc/r==a/p ) :\r\n return True\r\n if x1+y1==z1 or x1+z1==y1 or y1+z1==x1 :\r\n return True\r\n if (q+x1)!=0 and r!=0 and b%(q+x1)==0 and c%r==0 and b/(q+x1)==c/r :\r\n return True\r\n if p!=0 and a%p==0 and b-(qa/p)==c-r :\r\n return True\r\n if (q+z1)!=0 and p!=0 and b%(q+z1)==0 and a%p==0 and b/(q+z1)==a/p:\r\n return True\r\n if r!=0 and c%r==0 and b-(qc/r)==a-p :\r\n return True\r\n if (p+y1)!=0 and r!=0 and a%(p+y1)==0 and c%r==0 and a/(p+y1)==c/r :\r\n return True\r\n if q!=0 and b%q==0 and a-(pb/q)==c-r :\r\n return True\r\n if (p+z1)!=0 and q!=0 and a%(p+z1)==0 and b%q==0 and a/(p+z1)==b/q :\r\n return True\r\n if r!=0 and c%r==0 and a-(pc/r)==b-q :\r\n return True\r\n if (r+y1)!=0 and p!=0 and c%(r+y1)==0 and a%p==0 and c/(r+y1)==a/p :\r\n return True\r\n if q!=0 and b%q==0 and c-(rb/q )==a-p :\r\n return True\r\n if (r+x1)!=0 and q!=0 and c%(r+x1)==0 and b%q==0 and c/(r+x1)==b/q :\r\n return True\r\n if p!=0 and a%p==0 and c-(ra/p)==b-q :\r\n return True\r\n if (p+z1)!=0 and (q+z1)!=0 and a%(p+z1)==0 and b%(q+z1)==0 and a/(p+z1)==b/(q+z1) :\r\n return True\r\n if r!=0 and c%r==0 and a-(pc/r)==b-(qc/r) :\r\n return True\r\n if (p+y1)!=0 and (r+y1)!=0 and a%(p+y1)==0 and c%(r+y1)==0 and a/(p+y1)==c/(r+y1) :\r\n return True\r\n if q!=0 and b%q==0 and a-(pb/q)==c-(rb/q) :\r\n return True\r\n if (q+x1)!=0 and (r+x1)!=0 and b%(q+x1)==0 and c%(r+x1)==0 and b/(q+x1)==c/(r+x1) :\r\n return True\r\n if p!=0 and a%p==0 and b-(qa/p)==c-(ra/p) :\r\n return True\r\n if r!=0 and c%r==0 and c/r!=0 and a%(c/r)==0 and b%(c/r)==0 and a/(c/r)-p==b/(c/r)-q :\r\n return True\r\n if p!=0 and q!=0 and (a-z1)%p==0 and (b-z1)%q==0 and (a-z1)/p==(b-z1)/q :\r\n return True\r\n if q!=0 and b%q==0 and b/q!=0 and a%(b/q)==0 and c%(b/q)==0 and a/(b/q)-p==c/(b/q)-r : \r\n return True\r\n if p!=0 and r!=0 and (a-y1)%p==0 and (c-y1)%r==0 and (a-y1)/p==(c-y1)/r :\r\n return True\r\n if p!=0 and a%p==0 and a/p!=0 and b%(a/p)==0 and c%(a/p)==0 and b/(a/p)-q==c/(a/p)-r : \r\n return True\r\n if q!=0 and r!=0 and (b-x1)%q==0 and (c-x1)%r==0 and (b-x1)/q==(c-x1)/r :\r\n return True \r\n if (q-p)!=0 and (r-q)!=0 and (b-a)%(q-p)==0 and (c-b)%(r-q)==0 and (b-a)/(q-p)==(c-b)/(r-q):\r\n return True\r\n return False\r\ntest=int(input())\r\nfor _ in range(test):\r\n x1,y1,z1=[int(x) for x in input().split()]\r\n a,b,c=[int(x) for x in input().split()]\r\n if a==x1 and b==y1 and c==z1:\r\n print(0)\r\n elif checkpoint1(x1,y1,z1,a,b,c):\r\n print(1)\r\n elif checkpoint2(x1,y1,z1,a,b,c):\r\n print(2)\r\n else:\r\n print(3)", "t=int(input())\nwhile t>0:\n li1=[int(i) for i in input().split()]\n li2=[int(i) for i in input().split()]\n s1=set()\n s2=set()\n val,ans=0,3\n for i in range(3):\n if li1[i]==li2[i]:\n val+=1\n if val==3:\n ans=0\n elif val==2:\n ans=1\n else:\n for i in range(3):\n if li2[i]-li1[i]!=0:\n s1.add(li2[i]-li1[i])\n if li1[i]!=0 and li2[i]%li1[i]==0 and li2[i]//li1[i]!=1:\n s2.add(li2[i]//li1[i])\n temp=[]\n for i in s1:\n for j in range(7):\n temp=[li1[k] for k in range(3)]\n if j==0:\n temp[0]+=i\n temp[1]+=i\n elif j==1:\n temp[0]+=i\n temp[2]+=i\n elif j==2:\n temp[1]+=i\n temp[2]+=i\n elif j==3:\n temp[0]+=i\n temp[1]+=i\n temp[2]+=i\n elif j==4:\n temp[0]+=i\n elif j==5:\n temp[1]+=i\n elif j==6:\n temp[2]+=i\n a=0\n for k in range(3):\n if temp[k]==li2[k]:\n a+=1\n if a==3:\n ans=1\n if a==2:\n ans=min(ans,2)\n s3=set()\n for k in range(3):\n if temp[k]!=0 and li2[k]%temp[k]==0 and li2[k]//temp[k]!=1:\n s3.add(li2[k]//temp[k])\n temp1=[]\n for k in s3:\n for l in range(7):\n temp1=[temp[m] for m in range(3)]\n if l==0:\n temp1[0]=k\n temp1[1]=k\n elif l==1:\n temp1[0]=k\n temp1[2]=k\n elif l==2:\n temp1[1]=k\n temp1[2]=k\n elif l==3:\n temp1[0]=k\n temp1[1]=k\n temp1[2]=k\n elif l==4:\n temp1[0]=k\n elif l==5:\n temp1[1]=k\n elif l==6:\n temp1[2]=k\n for m in range(3):\n if li2[m]!=temp1[m]:\n break\n if m==2:\n ans=min(ans,2)\n s4=set()\n for k in range(3):\n if li2[k]-temp[k]!=0:\n s4.add(li2[k]-temp[k])\n temp2=[]\n for k in s4:\n for l in range(7):\n temp2=[temp[m] for m in range(3)]\n if l==0:\n temp2[0]+=k\n temp2[1]+=k\n elif l==1:\n temp2[0]+=k\n temp2[2]+=k\n elif l==2:\n temp2[1]+=k\n temp2[2]+=k\n elif l==3:\n temp2[0]+=k\n temp2[1]+=k\n temp2[2]+=k\n elif l==4:\n temp2[0]+=k\n elif l==5:\n temp2[1]+=k\n elif l==6:\n temp2[2]+=k\n for m in range(3):\n if li2[m]!=temp2[m]:\n break\n if m==2:\n ans=min(ans,2)\n s4.clear()\n count=0\n for k in range(3):\n var=li2[k]-i\n if li1[k]!=0 and var%li1[k]==0:\n if var//li1[k]!=1:\n s4.add(var//li1[k])\n count+=1\n if len(s4)==1 and count==3:\n ans=min(ans,2)\n if ans==3 or ans==2:\n d1=li2[2]-li2[1]\n d2=li2[1]-li2[0]\n d3=li1[2]-li1[1]\n d4=li1[1]-li1[0]\n d5=li2[2]-li2[0]\n d6=li1[2]-li1[0]\n if (d3!=0 and d4!=0 and d6!=0 and d1%d3==0 and d2%d4==0 and d5%d6==0 and d1//d3==d2//d4 and d1//d3==d5//d6):\n ans=min(ans,2)\n for i in s2:\n s3=set()\n count=0\n for j in range(3):\n temp[j]=li2[j]\n if i!=0 and temp[j]%i==0:\n temp[j]//=i\n temp[j]-=li1[j]\n if temp[j]!=0:\n s3.add(temp[j])\n count+=1\n \n if len(s3)==1 and count==3:\n ans=min(ans,2)\n for i in s2:\n for j in range(7):\n temp=[li1[k] for k in range(3)]\n if j==0:\n temp[0]=i\n temp[1]=i\n elif j==1:\n temp[0]=i\n temp[2]=i\n elif j==2:\n temp[1]=i\n temp[2]=i\n elif j==3:\n temp[0]=i\n temp[1]=i\n temp[2]=i\n elif j==4:\n temp[0]=i\n elif j==5:\n temp[1]=i\n elif j==6:\n temp[2]=i\n a=0\n for k in range(3):\n if temp[k]==li2[k]:\n a+=1\n if a==3:\n ans=1\n elif a==2:\n ans=min(ans,2)\n temp2=[]\n s4=set()\n for k in range(3):\n if temp[k]!=0 and li2[k]%temp[k]==0 and li2[k]//temp[k]!=1:\n s4.add(li2[k]//temp[k])\n temp2=[]\n for k in s4:\n for l in range(7):\n temp2=[temp[m] for m in range(3)]\n if l==0:\n temp2[0]=k\n temp2[1]=k\n elif l==1:\n temp2[0]=k\n temp2[2]=k\n elif l==2:\n temp2[1]=k\n temp2[2]=k\n elif l==3:\n temp2[0]=k\n temp2[1]=k\n temp2[2]=k\n elif l==4:\n temp2[0]=k\n elif l==5:\n temp2[1]=k\n elif l==6:\n temp2[2]=k\n for m in range(3):\n if li2[m]!=temp2[m]:\n break\n if m==2:\n ans=min(ans,2)\n s4.clear()\n for k in range(3):\n var=li2[k]-temp[k]\n if var!=0:\n s4.add(var)\n if len(s4)==1:\n ans=min(ans,2)\n print(ans)\n t-=1\n", "def util(x1, x2, y1, y2):\r\n d = x1 - y1\r\n n = x2 - y2\r\n if d and not n%d:\r\n return n//d\r\n return 1\r\n\r\ndef solve(p, q, r, a, b, c, res=0):\r\n if p == a and q == b and r == c:\r\n return res\r\n if res >= 2:\r\n return 3\r\n adds = [a-p, b-q, c-r]\r\n muls = []\r\n if p and not a%p:\r\n muls += [a//p]\r\n if q and not b%q:\r\n muls += [b//q]\r\n if r and not c%r:\r\n muls += [c//r]\r\n muls.append(util(p, a, q, b))\r\n muls.append(util(p, a, r, c))\r\n muls.append(util(q, b, r, c))\r\n mask = 23\r\n ans = 3\r\n for msk in range(1, mask):\r\n for add in adds:\r\n np, nq, nr = p, q, r\r\n if msk & 1:\r\n np += add\r\n if msk & 2:\r\n nq += add\r\n if msk & 4:\r\n nr += add\r\n ans = min(ans, solve(np, nq, nr, a, b, c, res+1))\r\n for mul in muls:\r\n np, nq, nr = p, q, r\r\n if msk & 1:\r\n np = mul\r\n if msk & 2:\r\n nq = mul\r\n if msk & 4:\r\n nr = mul\r\n ans = min(ans, solve(np, nq, nr, a, b, c, res+1))\r\n return ans\r\n\r\ndef main():\r\n t = int(input())\r\n for i in range(t):\r\n p, q, r = map(int, input().split())\r\n a, b, c = map(int, input().split())\r\n print(solve(p, q, r, a, b, c))\r\n\r\ndef __starting_point():\r\n main()\r\n\n__starting_point()"]	{"inputs": [["2", "3 5 7", "6 5 10", "8 6 3", "9 7 8", ""]], "outputs": [["1", "2"]]}	INTERVIEW	PYTHON3	CODECHEF	76,040
c404e8295424718589824a366f309b2d	UNKNOWN	Johnny was asked by his math teacher to compute nn (n to the power of n, where n is an integer), and has to read his answer out loud. This is a bit of a tiring task, since the result is probably an extremely large number, and would certainly keep Johnny occupied for a while if he were to do it honestly. But Johnny knows that the teacher will certainly get bored when listening to his answer, and will sleep through most of it! So, Johnny feels he will get away with reading only the first k digits of the result before the teacher falls asleep, and then the last k digits when the teacher wakes up. Write a program to help Johnny to compute the digits he will need to read out. -----Input----- The first line contains t, the number of test cases (about 30000). Then t test cases follow. Each test case consists of one line containing two numbers n and k (1 ≤ n ≤ 109, 1 ≤ k ≤ 9). It is guaranteed that k is not more than the number of digits of nn. -----Output----- For each test case, print out one line containing two numbers, separated by a space, which are the first and the last k digits of nn. -----Example----- Input 2 4 2 9 3 Output 25 56 387 489	["from math import log10\nfrom decimal import Decimal\ndef solve(n,k):\n \n mod=10*k\n x=Decimal(n)\n y=x(x.log10())%1\n p=str(pow(10,y))\n c=0\n first=''\n for v in p:\n if c==k:\n break\n if v==\".\":\n continue\n first+=v\n c+=1\n last=str(pow(n,n,mod)).zfill(k)\n return (first,last)\nqueries=[]\nfor _ in range(int(input())):\n n,k=list(map(int,input().split( )))\n queries.append((n,k))\nfor n,k in queries:\n print(\"%s %s\"%(solve(n,k)))\n \n \n", "from decimal import \ndef firstkdigits(n, k): \n n = Decimal(n)\n product = n (n.log10());\n decimal_part = product%1; \n d = pow(10, decimal_part + k -1); \n return str(int(d))\nfor _ in range(int(input())):\n n,k = map(int,input().split())\n q2 = str(pow(n, n, 10 k)).zfill(k)\n if n >= 1000 :\n q1 = firstkdigits(n,k)\n else :\n q1 = str(nn)[:k] \n print(q1 + \" \" + q2)", "from decimal import \nfor i in range(int(input())):\n x, y = input().split()\n x = int(x)\n y = int(y)\n if (x < 1000):\n q1 = str(x * x)[:y]\n else:\n x = Decimal(x)\n q1 = str(int(10 *(x(x.log10())%1 + y - 1)))\n q2 = str(pow(x, x, 10 ** y)).zfill(y) \n print(q1 + \" \" + q2)", "from decimal import \nfor i in range(int(input())):\n x, y = input().split()\n x = int(x)\n y = int(y)\n if (x < 1000):\n q1 = str(x * x)[:y]\n else:\n x = Decimal(x)\n q1 = str(int(10 *(x(x.log10())%1 + y - 1)))\n q2 = str(pow(x, x, 10 ** y)).zfill(y) \n print(q1 + \" \" + q2)"]	{"inputs": [["2", "4 2", "9 3"]], "outputs": [["25 56", "387 489"]]}	INTERVIEW	PYTHON3	CODECHEF	1,431
a495a766fca0036b79970bdb23d92a20	UNKNOWN	Sherlock Holmes has decided to start a new academy to some of the young lads. He has conducted several tests and finally selected N equally brilliant students.Now he don't know whether to train all the N students or not. Now since Holmes was in a confusion, Watson came up with an idea. He wanted to test the obedience of the students. So during the camp, the students were given some Swiss Chocolates as gifts each time when they passed a level.Now some of them have finished eating all the chocolates, some of them had some remaining. Now to test their team chemistry and IQ skills, Watson told the lads to arrange themselves in such a way that, number of chocolates of the ith kid should be equal to the sum of (i-1)th kid and (i-2)th kid. Now they have arranged themselves in an order. Now Sherlock announced that he will select the students who have formed the line according to this order. But since there can be many such small groups among the entire N kids, he will select a sequence of kids such that the length of the sequence is maximized, meanwhile satisfying the above condition -----Input----- First line is an integer T which denotes the total number of test cases. Each of the next T lines contains an integer N which denotes, N students. The next line contains N spaced integers.where it denotes the order in which the kids arranged themselves. -----Output----- Each line contains an integer which denotes the maximum number of students among the N students who have arranged themselves according the rule said by Watson.It is guaranteed that Holmes will select atleast 1 or 2 students -----Constraints----- - 1 ≤ T ≤ 10 - 1 ≤ N ≤ 10^5 - 1 ≤ Each of next N integers ≤ 10^9 -----Subtasks----- Subtask #1 : (20 points) - 1 ≤ T ≤ 10 - 1 ≤ N≤ 100 - 1 ≤ Each element≤ 10^3 Subtask 2 : (80 points) - 1 ≤ T ≤ 10 - 1 ≤ N≤ 100000 - 1 ≤ Each element≤ 10^9 -----Example----- Input: 2 5 2 3 5 1 2 3 1 2 3 Output: 3 3 -----Explanation----- Example case 1. Here the first kid has 2 chocolates, second has 3 chocolates, third kid has 5 chocolates, which is the sum of first kid's total chocolates and second kid's chocolate. Forth student has only 1 chocolate where he did not follow the rule. So the maximum number of kids who arranged themselves in the order was 3. That is students at index 1 to index 3.	["t = eval(input())\n\nfor i in range(t):\n n = eval(input())\n a = list(map(int, input().split()))\n cnt = 2\n cnt1 = 2\n ll = len(a)\n if ll < 3:\n cnt1 = ll\n else:\n for j in range(2,ll):\n if a[j-1] + a[j-2] == a[j]:\n cnt += 1\n cnt1 = max(cnt1, cnt)\n else:\n cnt1 = max(cnt1, cnt)\n cnt = 2\n print(cnt1) ", "t = int(input())\n\nfor e in range(t):\n n = int(input())\n chocolates = input().strip().split(\" \")\n\n # Sequence is working\n sequence = []\n for x in range(len(chocolates) - 2):\n if int(chocolates[x]) + int(chocolates[x+1]) == int(chocolates[x+2]):\n sequence.append(1)\n else:\n sequence.append(0)\n\n inSequence = 0\n gSequence = 0\n end = 0\n for x in range(len(sequence)):\n if sequence[x] == 1:\n inSequence += 1\n if x == len(sequence) - 1:\n end = x + 1\n gSequence = inSequence\n else:\n if inSequence > gSequence:\n gSequence = inSequence\n end = x\n inSequence = 0\n\n space = \" \"\n output = chocolates[end - gSequence:end + 2]\n print(len(output))", "t = int(input())\n\nfor e in range(t):\n n = int(input())\n chocolates = input().strip().split(\" \")\n\n # Sequence is working\n sequence = []\n for x in range(len(chocolates) - 2):\n if int(chocolates[x]) + int(chocolates[x+1]) == int(chocolates[x+2]):\n sequence.append(1)\n else:\n sequence.append(0)\n\n inSequence = 0\n gSequence = 0\n end = 0\n for x in range(len(sequence)):\n if sequence[x] == 1:\n inSequence += 1\n if x == len(sequence) - 1:\n end = x + 1\n gSequence = inSequence\n else:\n if inSequence > gSequence:\n gSequence = inSequence\n end = x\n inSequence = 0\n\n space = \" \"\n output = chocolates[end - gSequence:end + 2]\n print(len(output))", "for _ in range(int(input())):\n n = int(input())\n a = list(map(int, input().split()))\n mx = 1\n if n > 1 and a[0] == a[1]:\n mx = 2\n if n > 2:\n c = 1\n f = 1\n for i in range(2, n):\n if a[i] == a[i-1] + a[i-2]:\n c += 1 + f\n f = 0\n continue\n else:\n mx = max(c, mx)\n c = 1\n f = 1\n mx = max(c, mx) \n print(mx) ", "for _ in range(int(input())):\n n = int(input())\n a = list(map(int, input().split()))\n mx = 1\n if n < 3:\n if n == 2 and a[0] == a[1]:\n mx = 2\n else:\n c = 2\n for i in range(2, n):\n if a[i] == a[i-1] + a[i-2]:\n c += 1\n continue\n else:\n mx = max(c, mx)\n c = 2\n mx = max(c, mx) \n print(mx)", "for _ in range(eval(input())):\n n = eval(input())\n A = list(map(int, input().split()))\n if n < 3:\n print(n)\n elif n == 3:\n print(2 if A[2] != A[0] + A[1] else 3)\n else:\n st = 1\n max_len = 0\n for i in range(2,n):\n if A[i] != A[i-1] + A[i-2]:\n max_len = max(max_len, i-st)\n st = i\n max_len = max(max_len, (i-st)+1) if st < n-1 else max_len\n print(max_len + 1)", "tc = int(input())\nwhile tc!=0:\n size = int(input())\n data = [] \n data = list(map(int,input().split()))\n if size == 1:\n print(\"1\")\n tc -= 1\n continue\n i = 2\n count = 2\n max = 2\n while i < size:\n if data[i] == (data[i-1] + data[i-2]):\n count+=1\n if count > max:\n max = count\n else:\n count = 2\n i+=1\n print(max)\n tc -= 1 ", "tc = int(input())\nwhile tc!=0:\n size = int(input())\n data = [] \n data = list(map(int,input().split()))\n i = 2\n count = 2\n max = 2\n while i < size:\n if data[i] == (data[i-1] + data[i-2]):\n count+=1\n if count > max:\n max = count\n else:\n count = 2\n i+=1\n print(max)\n tc -= 1", "tc = int(input())\nwhile tc!=0:\n size = int(input())\n data = [] \n data = list(map(int,input().split()))\n i = 2\n count = 2\n max = 0\n while i < size:\n if data[i] == (data[i-1] + data[i-2]):\n count+=1\n if count > max:\n max = count\n else:\n count = 2\n i+=1\n if count > max:\n max = count\n print(max)\n tc -= 1", "for _ in range(int(input())):\n n=int(input())\n s=list(map(int,input().split()))\n maxx=0\n count=0\n if n<=2:\n print(n)\n elif n==3:\n if s[2]==s[1]+s[0]:\n print(3)\n else:\n print(2)\n else:\n for i in range(2,n):\n if s[i]==s[i-1]+s[i-2]:\n count+=1\n maxx=max(maxx,count)\n else:\n count=0\n print(maxx+2)\n \n \n\n", "import sys\n\nfor __ in range(eval(input())) :\n n = eval(input())\n lists = list(map(int,sys.stdin.readline().split()))\n curmax , temp , fflag = 0 , 2 , False\n for i in range(2,n) :\n if lists[i-2]+lists[i-1] == lists[i] :\n temp += 1\n else :\n if temp > curmax :\n curmax = temp\n temp = 2\n print(max(curmax,temp) if n > 1 else 1)\n", "import sys\n\nfor __ in range(eval(input())) :\n n = eval(input())\n lists = list(map(int,sys.stdin.readline().split()))\n curmax , temp , fflag = 0 , 2 , False\n for i in range(2,n) :\n if lists[i-2]+lists[i-1] == lists[i] :\n temp += 1\n else :\n if temp > curmax :\n curmax = temp\n temp = 2\n print(max(curmax,temp))\n", "for t in range(int(input())):\n n = int(input())\n a = list(map(int, input().split()))\n if (n==1):\n print(1)\n elif (n==2):\n print(2)\n else:\n c = 2\n m = 0\n for i in range(2,n):\n if (a[i] == a[i-1]+a[i-2]):\n c+=1\n else:\n m = max(c,m)\n c = 2\n m = max(c,m)\n print(m)", "for t in range(int(input())):\n n = int(input())\n a = list(map(int, input().split()))\n c = 2\n m = 0\n for i in range(2,n):\n if (a[i] == a[i-1]+a[i-2]):\n c+=1\n else:\n m = max(c,m)\n c = 2\n m = max(c,m)\n print(m)"]	{"inputs": [["2", "5", "2 3 5 1 2", "3", "1 2 3"]], "outputs": [["3", "3"]]}	INTERVIEW	PYTHON3	CODECHEF	5,372
9819135bcc160f88bbdb6b9b3b911343	UNKNOWN	A robot is initially at $(0,0)$ on the cartesian plane. It can move in 4 directions - up, down, left, right denoted by letter u, d, l, r respectively. More formally: - if the position of robot is $(x,y)$ then u makes it $(x,y+1)$ - if the position of robot is $(x,y)$ then l makes it $(x-1,y)$ - if the position of robot is $(x,y)$ then d makes it $(x,y-1)$ - if the position of robot is $(x,y)$ then r makes it $(x+1,y)$ The robot is performing a counter-clockwise spiral movement such that his movement can be represented by the following sequence of moves - ulddrruuulllddddrrrruuuuu… and so on. A single move takes 1 sec. You have to find out the position of the robot on the cartesian plane at $t$ second. -----Input:----- - The first line of the input contains a single integer $T$ denoting the number of test cases. The description of $T$ test cases follows. - The first line of each test case contains a single integer $t$. -----Output:----- For each test case, print two space-separated integers, $(x,y)$ — the position of the robot. -----Constraints----- - $1 \leq T \leq 10^6$ - $1 \leq t \leq 10^{18}$ -----Sample Input:----- 5 1 2 3 50 12233443 -----Sample Output:----- 0 1 -1 1 -1 0 2 4 -1749 812	["\r\n\r\nz = int(input())\r\ni = 0\r\nwhile i < z:\r\n n = int(input())\r\n p = int(n*(0.5))\r\n if p(p+1) < n:\r\n p += 1\r\n # print(\"P\", p)\r\n x, y = 0, 0\r\n q = 0\r\n flag = True\r\n if p(p+1) == n:\r\n # print(\"Even steps, nice\")\r\n q = p\r\n else:\r\n # remaining steps\r\n q = p-1\r\n flag = False\r\n if q%2 :\r\n # odd\r\n x -= ((q+1)//2)\r\n y += ((q+1)//2)\r\n else :\r\n x += (q//2)\r\n y -= (q//2)\r\n if flag:\r\n print(x, y)\r\n else:\r\n # remaining steps\r\n l = q(q+1)\r\n t = p(p+1)\r\n diff = t-l\r\n \r\n\r\n # print(x, y)\r\n if x < 0:\r\n # left\r\n if n-l >= diff//2:\r\n y = (-1)\r\n l += (diff//2)\r\n x += (n-l)\r\n else :\r\n y -= (n-l)\r\n \r\n else:\r\n # right\r\n if n-l >= diff//2:\r\n y *= (-1)\r\n y += 1\r\n l += (diff//2)\r\n x -= (n-l)\r\n else :\r\n y += (n-l)\r\n # print(\"Remaining steps: \", n-l)\r\n print(x, y)\r\n i+=1 "]	{"inputs": [["5", "1", "2", "3", "50", "12233443"]], "outputs": [["0 1", "-1 1", "-1 0", "2 4", "-1749 812"]]}	INTERVIEW	PYTHON3	CODECHEF	1,059
617e1ce131107df64e986e5b416c2542	UNKNOWN	Prof. Sergio Marquina is a mathematics teacher at the University of Spain. Whenever he comes across any good question(with complexity k), he gives that question to students within roll number range i and j. At the start of the semester he assigns a score of 10 to every student in his class if a student submits a question of complexity k, his score gets multiplied by k. This month he gave M questions and he is wondering what will be mean of maximum scores of all the students. He is busy planning a tour of the Bank of Spain for his students, can you help him? -----Input:----- - First-line will contain $T$, the number of test cases. Then the test cases follow. - Each test case contains the first line of input, two integers N, M i.e. Number of students in the class and number of questions given in this month. - Next M lines contain 3 integers -i,j,k i.e. starting roll number, end roll number, and complexity of the question -----Output:----- - For each test case, output in a single line answer - floor value of Mean of the maximum possible score for all students. -----Constraints----- - $1 \leq T \leq 100$ - $1 \leq N, M \leq 105$ - $1 \leq i \leq j \leq N$ - $1 \leq k \leq 100$ -----Sample Input:----- 1 5 3 1 3 5 2 5 2 3 4 7 -----Sample Output:----- 202 -----EXPLANATION:----- Initial score of students will be : [10,10,10,10,10] after solving question 1 scores will be: [50,50,50,10,10] after solving question 2 scores will be: [50,100,100,20,20] after solving question 1 scores will be: [50,100,700,140,20] Hence after all questions mean of maximum scores will (50+100+700+140+20)/5=202	["# cook your dish here\nfor t in range(int(input())):\n n,m=[int(x)for x in input().rstrip().split()]\n s=[]\n for p in range(n):\n s.append(10)\n for c in range(m):\n i,j,k=[int(x)for x in input().rstrip().split()]\n for q in range(i-1,j):\n s[q]=s[q]k\n print(sum(s)//n)\n \n \n \n \n", "# cook your dish here\nimport math\nfor _ in range(int(input())):\n n,m=list(map(int,input().split()))\n p=[10]n\n for i in range(m):\n l=list(map(int,input().split()))\n i=l[0]-1\n j=l[1]\n k=l[2]\n for s in range(i,j,1):\n p[s]=p[s]k\n sup=sum(p)\n sup=math.floor(sup/n)\n print(sup)\n", "# cook your dish here\nt=int(input())\nfor _ in range(t):\n n,m=map(int,input().split())\n a=list()\n for _ in range(n):\n a.append(10)\n for _ in range(m):\n i,j,k=map(int,input().split())\n for z in range(i-1,j):\n a[z]=a[z]k\nprint(sum(a)//n)", "import numpy as py\n\nT=int(input())\nfor _ in range(T):\n N,M=list(map(int,input().split()))\n l=[10]N\n for _ in range(M):\n i,j,k=list(map(int,input().split()))\n s1=l[:i-1]\n s2=l[i-1:j]\n s3=l[j:]\n new=list(py.array(s2)k)\n l=s1+new+s3\n #print(l)\ns=sum(l)//N\nprint(s)\n"]	{"inputs": [["1", "5 3", "1 3 5", "2 5 2", "3 4 7"]], "outputs": [["202"]]}	INTERVIEW	PYTHON3	CODECHEF	1,143
ac119ec051aa3127c6800c0c22749de1	UNKNOWN	The city of Siruseri is impeccably planned. The city is divided into a rectangular array of cells with $M$ rows and $N$ columns. Each cell has a metro station. There is one train running left to right and back along each row, and one running top to bottom and back along each column. Each trains starts at some time $T$ and goes back and forth along its route (a row or a column) forever. Ordinary trains take two units of time to go from one station to the next. There are some fast trains that take only one unit of time to go from one station to the next. Finally, there are some slow trains that take three units of time to go from one station the next. You may assume that the halting time at any station is negligible. Here is a description of a metro system with $3$ rows and $4$ columns: $ $ S(1) F(2) O(2) F(4) F(3) . . . . S(2) . . . . O(2) . . . . $ $ The label at the beginning of each row/column indicates the type of train (F for fast, O for ordinary, S for slow) and its starting time. Thus, the train that travels along row 1 is a fast train and it starts at time $3$. It starts at station ($1$, $1$) and moves right, visiting the stations along this row at times $3, 4, 5$ and $6$ respectively. It then returns back visiting the stations from right to left at times $6, 7, 8$ and $9$. It again moves right now visiting the stations at times $9, 10, 11$ and $12$, and so on. Similarly, the train along column $3$ is an ordinary train starting at time $2$. So, starting at the station ($3$,$1$), it visits the three stations on column $3$ at times $2, 4$ and $6$, returns back to the top of the column visiting them at times $6,8$ and $10$, and so on. Given a starting station, the starting time and a destination station, your task is to determine the earliest time at which one can reach the destination using these trains. For example suppose we start at station ($2$,$3$) at time $8$ and our aim is to reach the station ($1$,$1$). We may take the slow train of the second row at time $8$ and reach ($2$,$4$) at time $11$. It so happens that at time $11$, the fast train on column $4$ is at ($2$,$4$) travelling upwards, so we can take this fast train and reach ($1$,$4$) at time $12$. Once again we are lucky and at time $12$ the fast train on row $1$ is at ($1$,$4$), so we can take this fast train and reach ($1$, $1$) at time $15$. An alternative route would be to take the ordinary train on column $3$ from ($2$,$3$) at time $8$ and reach ($1$,$3$) at time $10$. We then wait there till time $13$ and take the fast train on row $1$ going left, reaching ($1$,$1$) at time $15$. You can verify that there is no way of reaching ($1$,$1$) earlier than that. -----Input:----- The first line contains two integers $M$ and $N$ indicating the number rows and columns in the metro system. This is followed by $M$ lines, lines $2, 3, …, M+1$, describing the trains along the $M$ rows. The first letter on each line is either F or O or S, indicating whether the train is a fast train, an ordinary train or a slow train. Following this, separated by a blank space, is an integer indicating the time at which this train starts running. The next $N$ lines, lines $M+2, M+3, …, N+M+1$, contain similar descriptions of the trains along the $N$ columns. The last line, line $N+M+2$, contains $5$ integers $a, b, c, d$ and $e$ where ($a$,$b$) is the starting station, $c$ is the starting time and ($d$,$e$) is the destination station. -----Output:----- A single integer indicating the earliest time at which one may reach the destination. -----Constraints:----- - $1 \leq M, N \leq 50$. - $1 \leq a, d \leq M$ - $1 \leq b, e \leq N$ - $1 \leq$ all times in input $\leq 20$ -----Sample Input----- 3 4 F 3 S 2 O 2 S 1 F 2 O 2 F 4 2 3 8 1 1 -----Sample Output----- 15	["from queue import PriorityQueue\r\nm,n=list(map(int,input().split()))\r\nrr=[]\r\ncc=[]\r\nspeed={'S':3,'O':2,'F':1}\r\nvisited=set()\r\ndp=[]\r\n\r\ndef qwerty(cur,x,y,f):\r\n\tif f==0:\r\n\t\tgg=rr[x][1]+yrr[x][0]\r\n\t\twhile gg<cur:\r\n\t\t\tgg+=(2(n-1))rr[x][0]\r\n\t\treturn gg-cur+rr[x][0]\r\n\telif f==1:\r\n\t\tgg=rr[x][1]+(2(n-1)-y)rr[x][0]\r\n\t\twhile gg<cur:\r\n\t\t\tgg+=(2(n-1))rr[x][0]\r\n\t\treturn gg-cur+rr[x][0]\r\n\telif f==2:\r\n\t\tgg=cc[y][1]+xcc[y][0]\r\n\t\twhile gg<cur:\r\n\t\t\tgg+=(2(m-1))cc[y][0]\r\n\t\treturn gg-cur+cc[y][0]\t\t\r\n\telif f==3:\r\n\t\tgg=cc[y][1]+(2(m-1)-x)cc[y][0]\r\n\t\twhile gg<cur:\r\n\t\t\tgg+=(2(m-1))cc[y][0]\r\n\t\treturn gg-cur+cc[y][0]\r\n\r\n\r\ndirx=[0, 0, 1, -1]\r\ndiry=[1, -1, 0, 0]\r\n\r\nfor i in range(m):\r\n\to=[x for x in input().split()]\r\n\to[0]=speed[o[0]]\r\n\to[1]=int(o[1])\r\n\trr.append(o)\r\n\r\n\r\nfor i in range(n):\r\n\to=[x for x in input().split()]\r\n\to[0]=speed[o[0]]\r\n\to[1]=int(o[1])\r\n\tcc.append(o)\r\n\r\n\r\nsx,sy,stt,dx,dy=list(map(int,input().split()))\r\nsx-=1\r\nsy-=1\r\ndx-=1\r\ndy-=1\r\n\r\nfor i in range(m):\r\n\tdp.append([10*9]n)\r\n\r\ndp[sx][sy]=stt\r\npq = PriorityQueue()\r\npq.put((stt, sx, sy))\r\nwhile not pq.empty():\r\n\t#print(dp)\r\n\t(t,cxx,cyy)=pq.get()\r\n\tif (cxx,cyy) in visited:\r\n\t\tcontinue\r\n\tvisited.add((cxx,cyy))\r\n\tfor i in range(len(dirx)):\r\n\t\tnxx=cxx+dirx[i]\r\n\t\tnyy=cyy+diry[i]\r\n\t\tif nxx>=0 and nxx<m and nyy>=0 and nyy<n and (nxx,nyy) not in visited:\r\n\t\t\tcoo=qwerty(dp[cxx][cyy],cxx,cyy,i)\r\n\t\t\tif coo+dp[cxx][cyy]<dp[nxx][nyy]:\r\n\t\t\t\t\tdp[nxx][nyy]=coo+dp[cxx][cyy]\r\n\t\t\t\t\tpq.put((dp[nxx][nyy],nxx,nyy))\r\n\r\nprint(dp[dx][dy])\r\n\r\n\r\n\r\n\r\n\r\n\r\n\t\r\n\r\n\r\n\r\n"]	{"inputs": [["3 4", "F 3", "S 2", "O 2", "S 1", "F 2", "O 2", "F 4", "2 3 8 1 1"]], "outputs": [["15"]]}	INTERVIEW	PYTHON3	CODECHEF	1,773
af41cfba1f416652da63fc5fee733663	UNKNOWN	Taxis of Kharagpur are famous for making sharp turns. You are given the coordinates where a particular taxi was on a 2-D planes at N different moments: (x1, y1), (x2, y2), ..., (xN, yN). In between these coordinates, the taxi moves on a straight line. A turn at the i-th (2 ≤ i ≤ N-1) coordinate is said to be a sharp turn if the angle by which it turns at Point B = (xi, yi) when going from coordinates A = (xi-1, yi-1) to C = (xi+1, yi+1) via (xi, yi) is greater than 45 degrees. ie. suppose you extend the line segment AB further till a point D, then the angle DBC would be greater than 45 degrees. You have to identify whether the taxi made a sharp turn somewhere or not (Please look at Output section for details). If it made a sharp turn, also identify whether it is possible to change the coordinates at one of the N moments to make sure that the taxi doesn't make any sharp turn. Note that all the N pairs of coordinates (including the new coordinates) should be integers and distinct and should have their x and y coordinates at least 0 and at most 50. -----Input----- - The first line of the input contains a single integer T denoting the number of test cases. The description of T test cases follows. - The first line of each test case contains a single integer N denoting the number of moments at which you are given the information of the taxi's coordinates. - Each of the next N lines contains two space-separated integers xi and yi denoting the x and y coordinates of the taxi at i-th moment. -----Output----- - For each test case, print a single line containing two space-separated strings, either of which can be a "yes" or "no" (without quotes). If there was no sharp turn, the first string should be "yes", and if there was a sharp turn, the first string should be "no". For the second string, you should tell whether it is possible to modify at most one coordinate in such a way that taxi doesn't make a sharp turn. Note that if the first string is "yes", then the second string would always be "yes". -----Constraints----- - 1 ≤ T ≤ 50 - 3 ≤ N ≤ 50 - 0 ≤ xi, yi ≤ 50 - It's guaranteed that all (xi, yi) pairs are distinct. -----Example----- Input 5 3 0 0 1 1 2 1 3 0 0 1 0 6 1 3 0 0 1 0 1 1 4 0 0 1 0 1 1 6 1 6 0 0 1 0 1 1 2 1 2 2 3 2 Output yes yes yes yes no yes no yes no no -----Explanation----- Example 1. You can see that taxi is never making a sharp turn. Example 3 You can see that taxi is making a sharp turn of 90 degrees, an angle greater than 45'. However, you can change the coordinates of the third points to (2, 1) to ensure that the angle remains <= 45'.	["import math\nimport copy\ntry:\n import psyco\n psyco.full()\nexcept ImportError:\n pass\n \ndef isSharp(ang):\n return ang > math.pi/4 + 0.00001\n \ndef unitVector(p2, p1):\n d0 = p2[0] - p1[0]\n d1 = p2[1] - p1[1]\n d = math.sqrt(d0d0 + d1d1)\n if d != 0:\n return [d0/d, d1/d]\n return [0, 0]\n \ndef compVectors(P):\n V = []\n for i in range(1,len(P)):\n v = unitVector(P[i], P[i-1])\n if v[0] == 0 and v[1] == 0:\n return None\n V.append(v)\n return V\n \ndef angle(v2, v1):\n d = v2[0]v1[0] + v2[1]v1[1]\n if d > 1:\n d = 1\n if d < -1:\n d = -1\n return math.acos(d)\n \ndef compAngles(V):\n A = []\n for i in range(len(V)-1):\n A.append(angle(V[i+1], V[i]))\n return A\n \ndef updateAngles(i, P, V, A):\n if i-1 >= 0:\n V[i-1] = unitVector(P[i], P[i-1])\n if i+1 < len(P):\n V[i] = unitVector(P[i+1], P[i])\n if i-2 >= 0:\n A[i-2] = angle(V[i-1], V[i-2])\n if i-1 >= 0 and i+1 < len(P):\n A[i-1] = angle(V[i], V[i-1])\n if i+2 < len(P):\n A[i] = angle(V[i+1], V[i])\n \ndef checkMoves(check, P, V, A, filled):\n for i in check:\n if i < 0 or i >= len(P):\n break\n x, y = P[i]\n for j in range(51):\n for k in range(51):\n P[i][0] = j\n P[i][1] = k\n if str(P[i]) in filled:\n continue\n updateAngles(i, P, V, A)\n fixed = True\n if i-2 >= 0:\n if isSharp(A[i-2]):\n fixed = False\n if i-1 >= 0 and i-1 < len(A):\n if isSharp(A[i-1]):\n fixed = False\n if i < len(A):\n if isSharp(A[i]):\n fixed = False\n if fixed:\n return True\n P[i] = [x, y]\n updateAngles(i, P, V, A) \n return False\n \n \ndef canFix(first, last, P, V, A, filled):\n d = last - first\n if d > 2:\n return False\n if d == 2:\n check = [first+2]\n if d == 1:\n check = [first+1, first+2]\n if d == 0:\n check = [first, first+1, first+2]\n if checkMoves(check, P, V, A, filled):\n return True\n return False\n \nT=int(input())\nfor i in range(T):\n N=int(input())\n P=[]\n V=[]\n filled={}\n for i in range(N):\n P.append(list(map(int,input().split())))\n filled[str(P[i])] = 1\n V = compVectors(P)\n A = compAngles(V)\n blunt = True\n first = -1\n last = -1\n for i in range(len(A)):\n if isSharp(A[i]):\n blunt = False\n last = i\n if first < 0:\n first = i\n if blunt:\n print('yes yes')\n else:\n if canFix(first, last, P, V, A, filled):\n print('no yes')\n else:\n print('no no') ", "import math\nimport copy\ntry:\n import psyco\n psyco.full()\nexcept ImportError:\n pass\n \ndef isSharp(ang):\n return ang > math.pi/4 + 0.00001\n \ndef unitVector(p2, p1):\n d0 = p2[0] - p1[0]\n d1 = p2[1] - p1[1]\n d = math.sqrt(d0d0 + d1d1)\n if d != 0:\n return [d0/d, d1/d]\n return [0, 0]\n \ndef compVectors(P):\n V = []\n for i in range(1,len(P)):\n v = unitVector(P[i], P[i-1])\n if v[0] == 0 and v[1] == 0:\n return None\n V.append(v)\n return V\n \ndef angle(v2, v1):\n d = v2[0]v1[0] + v2[1]v1[1]\n if d > 1:\n d = 1\n if d < -1:\n d = -1\n return math.acos(d)\n \ndef compAngles(V):\n A = []\n for i in range(len(V)-1):\n A.append(angle(V[i+1], V[i]))\n return A\n \ndef updateAngles(i, P, V, A):\n if i-1 >= 0:\n V[i-1] = unitVector(P[i], P[i-1])\n if i+1 < len(P):\n V[i] = unitVector(P[i+1], P[i])\n if i-2 >= 0:\n A[i-2] = angle(V[i-1], V[i-2])\n if i-1 >= 0 and i+1 < len(P):\n A[i-1] = angle(V[i], V[i-1])\n if i+2 < len(P):\n A[i] = angle(V[i+1], V[i])\n \ndef checkMoves(check, P, V, A, filled):\n for i in check:\n if i < 0 or i >= len(P):\n break\n x, y = P[i]\n for j in range(51):\n for k in range(51):\n P[i][0] = j\n P[i][1] = k\n if str(P[i]) in filled:\n continue\n updateAngles(i, P, V, A)\n fixed = True\n if i-2 >= 0:\n if isSharp(A[i-2]):\n fixed = False\n if i-1 >= 0 and i-1 < len(A):\n if isSharp(A[i-1]):\n fixed = False\n if i < len(A):\n if isSharp(A[i]):\n fixed = False\n if fixed:\n return True\n P[i] = [x, y]\n updateAngles(i, P, V, A) \n return False\n \n \ndef canFix(first, last, P, V, A, filled):\n d = last - first\n if d > 2:\n return False\n if d == 2:\n check = [first+2]\n if d == 1:\n check = [first+1, first+2]\n if d == 0:\n check = [first, first+1, first+2]\n if checkMoves(check, P, V, A, filled):\n return True\n return False\n \nT=int(input())\nfor i in range(T):\n N=int(input())\n P=[]\n V=[]\n filled={}\n for i in range(N):\n P.append(list(map(int,input().split())))\n filled[str(P[i])] = 1\n V = compVectors(P)\n A = compAngles(V)\n blunt = True\n first = -1\n last = -1\n for i in range(len(A)):\n if isSharp(A[i]):\n blunt = False\n last = i\n if first < 0:\n first = i\n if blunt:\n print('yes yes')\n else:\n if canFix(first, last, P, V, A, filled):\n print('no yes')\n else:\n print('no no') "]	{"inputs": [["5", "3", "0 0", "1 1", "2 1", "3", "0 0", "1 0", "6 1", "3", "0 0", "1 0", "1 1", "4", "0 0", "1 0", "1 1", "6 1", "6", "0 0", "1 0", "1 1", "2 1", "2 2", "3 2"]], "outputs": [["yes yes", "yes yes", "no yes", "no yes", "no no"]]}	INTERVIEW	PYTHON3	CODECHEF	4,768
166496f202e1cd356c806b5fe522e98a	UNKNOWN	Chef is the judge of a competition. There are two players participating in this competition — Alice and Bob. The competition consists of N races. For each i (1 ≤ i ≤ N), Alice finished the i-th race in Ai minutes, while Bob finished it in Bi minutes. The player with the smallest sum of finish times wins. If this total time is the same for Alice and for Bob, a draw is declared. The rules of the competition allow each player to choose a race which will not be counted towards their total time. That is, Alice may choose an index x and her finish time in the race with this index will be considered zero; similarly, Bob may choose an index y and his finish time in the race with this index will be considered zero. Note that x can be different from y; the index chosen by Alice does not affect Bob's total time or vice versa. Chef, as the judge, needs to announce the result of the competition. He knows that both Alice and Bob play optimally and will always choose the best option. Please help Chef determine the result! -----Input----- - The first line of the input contains a single integer T denoting the number of test cases. The description of T test cases follows. - The first line of each test case contains a single integer N. - The second line contains N space-separated integers A1, A2, ..., AN. - The third line contains N space-separated integers B1, B2, ..., BN. -----Output----- For each test case, print a single line containing the string "Alice" if Alice wins, "Bob" if Bob wins or "Draw" if the result is a draw (without quotes). -----Constraints----- - 1 ≤ T ≤ 100 - 2 ≤ N ≤ 100 - 1 ≤ Ai ≤ 1000 for each valid i - 1 ≤ Bi ≤ 1000 for each valid i -----Example----- Input: 3 5 3 1 3 3 4 1 6 2 5 3 5 1 6 2 5 3 3 1 3 3 4 3 4 1 3 2 2 7 Output: Alice Bob Draw -----Explanation----- Example case 1: Alice will choose the finish time in the last race to be considered zero, which means her sum of finish times is 3 + 1 + 3 + 3 + 0 = 10, while Bob will choose the finish time of his second race to be considered zero, so his total sum of finish times is 1 + 0 + 2 + 5 + 3 = 11. Since Alice's sum is smaller, she is considered the winner. Example case 2: We're dealing with the same situation as in the previous case, but finish times for the players are swapped, so Bob wins this time. Example case 3: Alice will choose the finish time of the first race to be considered zero, which means her total time is 0 + 1 + 3 = 4. Bob will choose the finish time of his last race to be considered zero, which makes his total time 2 + 2 + 0 = 4. The competition is considered a draw because both players have equal sums of finish times.	["# cook your dish here\nfor i in range(int(input())):\n N=int(input())\n ALICE=list(map(int,input().split()))\n BOB=list(map(int,input().split()))\n ALICE[ALICE.index(max(ALICE))]=0\n BOB[BOB.index(max(BOB))]=0\n if sum(ALICE)<sum(BOB):\n print(\"Alice\")\n elif sum(BOB)<sum(ALICE):\n print(\"Bob\")\n else:\n print(\"Draw\")", "# cook your dish here\nfor i in range(int(input())):\n N=int(input())\n ALICE=list(map(int,input().split()))\n BOB=list(map(int,input().split()))\n ALICE[ALICE.index(max(ALICE))]=0\n BOB[BOB.index(max(BOB))]=0\n if sum(ALICE)<sum(BOB):\n print(\"Alice\")\n elif sum(BOB)<sum(ALICE):\n print(\"Bob\")\n else:\n print(\"Draw\")", "# cook your dish here\nfor i in range(int(input())):\n N=int(input())\n ALICE=list(map(int,input().split()))\n BOB=list(map(int,input().split()))\n ALICE[ALICE.index(max(ALICE))]=0\n BOB[BOB.index(max(BOB))]=0\n if sum(ALICE)<sum(BOB):\n print(\"Alice\")\n elif sum(BOB)<sum(ALICE):\n print(\"Bob\")\n else:\n print(\"Draw\")", "t=int(input())\nfor k in range(t):\n n=int(input())\n a=input().split()\n b=input().split()\n for j in range(n):\n a[j]=int(a[j])\n b[j]=int(b[j])\n a.remove(max(a))\n b.remove(max(b))\n s1=sum(a)\n s2=sum(b)\n if (s1>s2):\n print(\"Bob\")\n elif (s2>s1):\n print(\"Alice\")\n else:\n print(\"Draw\")", "t=int(input())\nfor i in range(t):\n n=int(input())\n a=list(map(int,input().split()))\n b=list(map(int,input().split()))\n x=max(a)\n y=max(b)\n a.remove(x)\n b.remove(y)\n suma=0\n sumb=0\n for i in a:\n suma=suma+i\n for i in b:\n sumb=sumb+i\n if suma<sumb:\n print(\"Alice\")\n elif suma>sumb:\n print(\"Bob\")\n else:\n print(\"Draw\")\n", "# cook your dish here\nT=int(input())\nfor i in range(T):\n n=int(input())\n a=list(map(int,input().split()))\n b=list(map(int,input().split()))\n x=max(a)\n y=max(b)\n a.remove(x)\n b.remove(y)\n suma=0\n sumb=0\n for i in a:\n suma=suma+i\n for i in b:\n sumb=sumb+i\n if suma<sumb:\n print(\"Alice\")\n elif suma>sumb:\n print(\"Bob\")\n else:\n print(\"Draw\")", "t=int(input())\nwhile t>0:\n n=int(input())\n a=list(map(int,input().split()))\n b=list(map(int,input().split()))\n a.sort()\n a.pop()\n b.sort()\n b.pop()\n al=sum(a)\n bob=sum(b)\n if(al<bob):\n print('Alice')\n elif(al==bob):\n print('Draw')\n else:\n print('Bob')\n t=t-1", "# cook your dish here\ndef alice_bob(alice, bob):\n alice.remove(max(alice))\n bob.remove(max(bob))\n result_alice = 0\n result_bob = 0\n result_alice += sum(alice)\n result_bob += sum(bob)\n if result_alice > result_bob:\n return 'Bob'\n elif result_alice < result_bob:\n return 'Alice'\n elif result_bob == result_alice:\n return 'Draw'\n\n\nT = int(input())\nfor i in range(T):\n N = int(input())\n # for j in range(2):\n alice = list(map(int, input().split()))\n bob = list(map(int, input().split()))\n print(alice_bob(alice, bob))\n\n \n", "# cook your dish here\nfor _ in range(int(input())):\n c = int(input())\n a = list(map(int,input().split()))\n b = list(map(int,input().split()))\n a = sum(a) - max(a)\n b = sum(b) - max(b)\n if a<b:\n print(\"Alice\")\n elif a>b:\n print(\"Bob\")\n else:\n print(\"Draw\")", "# cook your dish here\nfor i in range(int(input())):\n n = int(input())\n l1 = list(map(int,input().split( )))\n l2 = list(map(int,input().split( )))\n a = sum(l1) - max(l1)\n b = sum(l2) - max(l2)\n if a>b:\n print('Bob')\n elif b>a:\n print('Alice')\n else:\n print('Draw')", "# cook your dish here\nfor i in range(int(input())):\n n = int(input())\n l1 = list(map(int,input().split( )))\n l2 = list(map(int,input().split( )))\n a = sum(l1) - max(l1)\n b = sum(l2) - max(l2)\n if a>b:\n print('Bob')\n elif b>a:\n print('Alice')\n else:\n print('Draw')", "t=int(input())\nfor i in range(t):\n n=int(input())\n a=[int(j) for j in input().split()]\n b=[int(k) for k in input().split()]\n m=max(a)\n a=sum(a)-m\n z=max(b)\n b=sum(b)-z\n if a<b:\n print(\"Alice\")\n elif a>b:\n print(\"Bob\")\n else:\n print(\"Draw\")", "t=int(input())\nfor i in range(t):\n n=int(input())\n a=[int(j) for j in input().split()]\n b=[int(k) for k in input().split()]\n m=max(a)\n a=sum(a)-m\n z=max(b)\n b=sum(b)-z\n if a<b:\n print(\"Alice\")\n elif a>b:\n print(\"Bob\")\n else:\n print(\"Draw\")", "t=int(input())\nwhile t!=0:\n n=int(input())\n a=list(map(int,input().split()))\n b=list(map(int,input().split()))\n alice=sum(a)-max(a)\n bob=sum(b)-max(b)\n if alice<bob:\n print('Alice')\n elif bob<alice:\n print('Bob')\n else:\n print('Draw')\n t-=1", "def win(arr1,arr2,n):\n a=max(arr1)\n b=max(arr2)\n for ind in range(n):\n if arr1[ind]==a:\n index_a=ind\n if arr2[ind]==b:\n index_b=ind\n \n arr1[index_a]=0\n arr2[index_b]=0\n sum_a,sum_b=0,0\n for i in range(n):\n sum_a+=arr1[i]\n for j in range(n):\n sum_b+=arr2[j]\n \n if sum_a<sum_b:\n print(\"Alice\")\n elif sum_a>sum_b:\n print(\"Bob\")\n else:\n print(\"Draw\")\n\nt=int(input())\nfor tc in range(t):\n n=int(input())\n arr1=[int(ele) for ele in input().split()]\n arr2=[int(ele) for ele in input().split()]\n win(arr1,arr2,n)\n", "# cook your dish here\nt=int(input())\nfor i in range(t):\n n=int(input())\n a=list(map(int,input().strip().split()))\n b=list(map(int,input().strip().split()))\n a.remove(max(a))\n b.remove(max(b))\n if(sum(a)>sum(b)):\n print(\"Bob\")\n elif sum(a)==sum(b):\n print(\"Draw\")\n else:\n print(\"Alice\")", "import math\nfor _ in range(int(input())):\n n=int(input())\n a=list(map(int,input().split()))\n b=list(map(int,input().split()))\n x=sum(a)-max(a)\n y=sum(b)-max(b)\n if x<y:\n print('Alice')\n elif x>y:\n print('Bob')\n else:\n print('Draw')\n", "a=int(input())\nwhile a:\n a=a-1\n b=int(input())\n x=list(map(int,input().split()))\n y=list(map(int,input().split()))\n h=sum(x) - max(x)\n g=sum(y) - max(y)\n if h<g:\n print(\"Alice\")\n elif g<h:\n print(\"Bob\")\n else:\n print(\"Draw\")", "for i in range(int(input())):\n n=int(input())\n a=list(map(int,input().split()))\n b=list(map(int,input().split()))\n if (sum(a)-max(a))<(sum(b)-max(b)):\n print(\"Alice\")\n elif (sum(a)-max(a))==(sum(b)-max(b)):\n print(\"Draw\")\n else:\n print(\"Bob\")\n \n", "t=int(input())\nfor i in range(0,t):\n n=int(input())\n l1=list(map(int,input().split()))\n l1.sort()\n l1[-1]=0\n sum1=0\n for a in l1:\n sum1+=a\n l2=list(map(int,input().split()))\n l2.sort()\n l2[-1]=0\n sum2=0\n for b in l2:\n sum2+=b\n if(sum1<sum2):\n print(\"Alice\")\n elif(sum1>sum2):\n print(\"Bob\")\n else:\n print(\"Draw\")", "t = int(input())\nfor i in range(t):\n n = int(input())\n alice = list(map(int,input().split()))\n bob = list(map(int,input().split()))\n alice.remove(max(alice))\n bob.remove(max(bob))\n sum_alice = sum(alice)\n sum_bob = sum(bob)\n if sum_bob>sum_alice:\n print(\"Alice\")\n elif sum_alice>sum_bob:\n print(\"Bob\")\n else:\n print(\"Draw\")", "t=int(input())\nfor i in range(t):\n n=int(input())\n a=list(map(int,input().split()))\n b=list(map(int,input().split()))\n a.remove(max(a))\n b.remove(max(b))\n a1=sum(a)\n b1=sum(b)\n if(a1>b1):\n print(\"Bob\")\n elif(b1>a1):\n print(\"Alice\")\n else:\n print(\"Draw\")", "# cook your dish here\nt=int(input())\nfor _ in range(t):\n n=int(input())\n a=list(map(int,input().split()))\n b=list(map(int,input().split()))\n a.sort()\n b.sort()\n a[len(a)-1]=0\n b[len(b)-1]=0\n if(sum(a)>sum(b)):\n print(\"Bob\")\n elif(sum(b)>sum(a)):\n print(\"Alice\")\n else:\n print(\"Draw\")"]	{"inputs": [["3", "5", "3 1 3 3 4", "1 6 2 5 3", "5", "1 6 2 5 3", "3 1 3 3 4", "3", "4 1 3", "2 2 7"]], "outputs": [["Alice", "Bob", "Draw"]]}	INTERVIEW	PYTHON3	CODECHEF	7,423
3d3ba4481811be4d1731687cd7822945	UNKNOWN	This time minions are celebrating Diwali Festival. There are N minions in total. Each of them owns a house. On this Festival, Each of them wants to decorate their house. But none of them have enough money to do that. One of the minion, Kevin, requested Gru for money. Gru agreed for money distribution but he will be giving money to a minion if and only if demanded money is less than or equal to the money Gru have. Now Gru wonders if he can spend all the money or not. -----Input----- First line have number of test cases T. Each test case consist of Two Lines. First line contains two space separated integers N and K i.e. Number of minions and Amount of Money Gru have. Next line contains N space separated integers A1,A2,A3,.....,AN representing amount of money demanded by ith minion. -----Output----- Output YES if Gru can spend his all of the money on minions i.e. after distribution Gru have zero amount of money else NO. -----Constraints----- - 1 ≤ T ≤ 105 - 1 ≤ N ≤ 102 - 1 ≤ K,Ai ≤ 109 -----Example----- Input: 2 4 9 5 2 2 4 4 9 5 2 18 3 Output: YES NO -----Explanation----- Example case 1.At first Gru is having 9 Rs. If he gives 5 Rs. to first minion then remaining 4 Rs. can be given to 2nd and 3rd minion or to the 4th minion. Which will leave zero amount of money in the hands of Gru. Example case 2.At first Gru is having 9 Rs. If he gives 5 Rs. to the first minion then from remaining 4 Rs. either he can give 2 Rs. to the 2nd minion or 3 Rs. to the fourth minion. Which will leave either 2 Rs. or 1 Rs. in the hands of Gru.	["def find_combinations(list, sum):\n if not list:\n if sum == 0:\n return [[]]\n return []\n return find_combinations(list[1:], sum) + \\\n [[list[0]] + tail for tail in\n find_combinations(list[1:], sum - list[0])]\nfor tc in range(int(input())):\n n,k=list(map(int,input().split()))\n a=list(map(int,input().split()))\n a.sort()\n if len(find_combinations(a,k))==0:\n print(\"NO\")\n else:\n print(\"YES\")\n \n", "def find_combinations(list, sum):\n if not list:\n if sum == 0:\n return [[]]\n return []\n return find_combinations(list[1:], sum) + \\\n [[list[0]] + tail for tail in\n find_combinations(list[1:], sum - list[0])]\nfor tc in range(int(input())):\n n,k=list(map(int,input().split()))\n a=list(map(int,input().split()))\n a.sort()\n if len(find_combinations(a,k))==0:\n print(\"NO\")\n else:\n print(\"YES\")\n \n"]	{"inputs": [["2", "4 9", "5 2 2 4", "4 9", "5 2 18 3"]], "outputs": [["YES", "NO"]]}	INTERVIEW	PYTHON3	CODECHEF	852
7965989be01f11173998a6fa29278af5	UNKNOWN	Chef loves to play chess, so he bought a new chessboard with width M$M$ and height N$N$ recently. Chef considers a chessboard correct if its width (number of columns) is equal to its height (number of rows) and each cell has no side-adjacent cell of the same color (this is the so-called "chess order" which you can see in real-world chessboards). Chef's chessboard does not have to be a correct chessboard (in particular, it may have N≠M$N \neq M$). A sub-board of Chef's chessboard is a rectangular piece of this board with an arbitrarily chosen top left and bottom right cell (possibly equal to the original chessboard). Every sub-board is also a chessboard. Chef can invert some cells; inverting a cell means changing its color from white to black or from black to white. After inverting those cells, he wants to cut the maximum correct sub-board out of the original chessboard. Chef has not yet decided how many cells he would like to invert. Now he wonders about the answers to Q$Q$ question. In the i$i$-th question (1≤i≤Q$1 \le i \le Q$), he is allowed to invert at most ci$c_i$ cells (possibly zero); he would like to know the side length of the largest possible correct sub-board of his chessboard. Help Chef answer these questions. -----Input----- - The first line of the input contains two space-separated integers N$N$ and M$M$. - N$N$ lines follow. For each valid i$i$, the i$i$-th of these lines contains a string with length M$M$ describing the i$i$-th row of Chef's chessboard. Each character of this string is either '0', representing a black cell, or '1', representing a white cell. - The next line contains a single integer Q$Q$. - The last line contains Q$Q$ space-separated integers c1,c2,…,cQ$c_1, c_2, \dots, c_Q$. -----Output----- For each question, print a single line containing one integer — the maximum size of a correct sub-board. -----Constraints----- - 1≤N,M≤200$1 \le N, M \le 200$ - 1≤Q≤105$1 \le Q \le 10^5$ - 0≤ci≤109$0 \le c_i \le 10^9$ for each valid i$i$ -----Subtasks----- Subtask #1 (20 points): - 1≤N,M≤20$1 \le N, M \le 20$ - 1≤Q≤100$1 \le Q \le 100$ Subtask #2 (30 points): 1≤N,M≤20$1 \le N, M \le 20$ Subtask #3 (50 points): original constraints -----Example Input----- 8 8 00101010 00010101 10101010 01010101 10101010 01010101 10101010 01010101 4 1 2 0 1001 -----Example Output----- 7 8 6 8 -----Explanation----- If we don't change the board, the best answer here is the 6x6 bottom right sub-board. We can invert cells (2,2)$(2, 2)$ and (1,1)$(1, 1)$ to get a better answer.	["# cook your dish here\nn,m=map(int,input().split())\nL=[]\nfor i in range(n):\n s=input()\n L.append(s)\n\ncost=[]\nh2=[0](m+1)\ncost.append(h2)\nfor i in range(n):\n h=[0]\n for j in range(m):\n if(L[i][j]=='0' and (i+j)%2!=0):\n h.append(1)\n elif(L[i][j]=='1' and (i+j)%2==0):\n h.append(1)\n else:\n h.append(0)\n cost.append(h)\n\npre=[]\nh2=[0](m+1)\npre.append(h2)\nfor i in range(1,n+1):\n h=[0]\n c=0\n for j in range(1,m+1):\n c+=cost[i][j]\n c2=c\n if(i>0):\n c2+=pre[i-1][j]\n h.append(c2)\n pre.append(h)\n\nbs=[0]((mn)+10)\n\nfor i in range(1,n+1):\n for j in range(1,m+1):\n for k in range(1,min(m,n)+1):\n if(i-k>=0 and j-k>=0):\n c=pre[i][j]-pre[i-k][j]-pre[i][j-k]+pre[i-k][j-k]\n c=min(c,(kk)-c)\n bs[c]=max(bs[c],k)\n\nmx=bs[0]\nfor i in range(1,len(bs)):\n mx=max(mx,bs[i])\n bs[i]=mx\n\nQ=int(input())\nq=[int(x) for x in input().split()]\nfor i in range(0,len(q)):\n qr=min(mn,q[i])\n print(bs[qr])\n\n\n", "n,m=map(int,input().split())\r\nL=[]\r\nfor i in range(n):\r\n s=input()\r\n L.append(s)\r\n\r\ncost=[]\r\nh2=[0](m+1)\r\ncost.append(h2)\r\nfor i in range(n):\r\n h=[0]\r\n for j in range(m):\r\n if(L[i][j]=='0' and (i+j)%2!=0):\r\n h.append(1)\r\n elif(L[i][j]=='1' and (i+j)%2==0):\r\n h.append(1)\r\n else:\r\n h.append(0)\r\n cost.append(h)\r\n\r\npre=[]\r\nh2=[0](m+1)\r\npre.append(h2)\r\nfor i in range(1,n+1):\r\n h=[0]\r\n c=0\r\n for j in range(1,m+1):\r\n c+=cost[i][j]\r\n c2=c\r\n if(i>0):\r\n c2+=pre[i-1][j]\r\n h.append(c2)\r\n pre.append(h)\r\n\r\nbs=[0]((mn)+10)\r\n\r\nfor i in range(1,n+1):\r\n for j in range(1,m+1):\r\n for k in range(1,min(m,n)+1):\r\n if(i-k>=0 and j-k>=0):\r\n c=pre[i][j]-pre[i-k][j]-pre[i][j-k]+pre[i-k][j-k]\r\n c=min(c,(kk)-c)\r\n bs[c]=max(bs[c],k)\r\n\r\nmx=bs[0]\r\nfor i in range(1,len(bs)):\r\n mx=max(mx,bs[i])\r\n bs[i]=mx\r\n\r\nQ=int(input())\r\nq=[int(x) for x in input().split()]\r\nfor i in range(0,len(q)):\r\n qr=min(mn,q[i])\r\n print(bs[qr])\r\n\r\n\r\n", "n,m=map(int,input().split())\r\nchess=[]\r\nfor _ in range(n):\r\n chess.append([int(x) for x in list(input())])\r\nchessO=[]\r\nchessL=[]\r\nfixO=[]\r\nfixL=[]\r\nfor _ in range(n):\r\n p=[0]m\r\n fixL.append(p)\r\n q=[0]m\r\n fixO.append(q)\r\n tm=[0]m\r\n chessO.append(tm)\r\n to=[0]m\r\n chessL.append(to)\r\n\r\nfor i in range(n):\r\n for j in range(m):\r\n chessO[i][j]=((i+j)%2)^chess[i][j]\r\n chessL[i][j]=((i+j+1)%2)^chess[i][j]\r\n fixO[i][j]=chessO[i][j]\r\n fixL[i][j]=chessL[i][j]\r\n\r\nfor i in range(n):\r\n for j in range(1,m):\r\n fixO[i][j]=fixO[i][j-1]+chessO[i][j]\r\n fixL[i][j]=fixL[i][j-1]+chessL[i][j]\r\n\r\nans=[-1]min(m,n)\r\nfor i in range(n):\r\n for j in range(m):\r\n for k in range(min(n-i,m-j)):\r\n errorO,errorL=0,0\r\n for l in range(i,i+k+1):\r\n errorO+=fixO[l][j+k]-fixO[l][j]+chessO[l][j]\r\n errorL+=fixL[l][j+k]-fixL[l][j]+chessL[l][j]\r\n if ans[k]==-1 or ans[k]>min(errorO,errorL): ans[k]=min(errorO,errorL)\r\nfinal=[0]50000\r\nmaxo=9999999999\r\nfor i in range(min(m,n)-1,-1,-1):\r\n if ans[i]!=-1 and ans[i]<maxo:\r\n maxo=ans[i]\r\n final[maxo]=i\r\ntmp=final[0]\r\nfor i in range(1,50000):\r\n if final[i]>tmp:\r\n tmp=final[i]\r\n final[i]=tmp\r\ninput()\r\nq=[int(x) for x in input().split()]\r\n\r\nfor x in q:\r\n if x>50000-2 : print(final[45000]+1)\r\n else: print(final[x]+1)\r\n \r\n", "n,m = [int(i) for i in input().split()]\r\nsqsets = list(range(2,min(n,m)+1))\r\nci = []\r\nfor i in range(n):\r\n ci.append(list(input()))\r\ncc = [[0 for i in range(m+1)] for j in range(n+1)]\r\ndef cache_creation_part(x,y):\r\n cc[y][x] = cc[y][x - 1] + cc[y - 1][x] - cc[y - 1][x - 1]\r\n if (y + x) % 2 == 0:\r\n cc[y][x] += int(ci[y - 1][x - 1] != '1')\r\n else:\r\n cc[y][x] += int(ci[y - 1][x - 1] != '0')\r\n\r\ndef cache_creation(m,n):\r\n for y in range(1,n+1):\r\n for x in range(1, m + 1):\r\n cache_creation_part(x,y)\r\n\r\ndef operation(x,y,k):\r\n return cc[y + k][x + k] + cc[y][x] - cc[y + k][x] - cc[y][x + k]\r\n\r\nc = 0\r\nkd = {k:c for k in sqsets}\r\ndef kd_creation(m,n,sqsets):\r\n cache_creation(m,n)\r\n for k in sqsets:\r\n kd[k] = (10*9)+1\r\n for y in range(n-k+1):\r\n for x in range(m-k+1):\r\n cu = operation(x,y,k)\r\n kd[k] = min(kd[k], cu, kk-cu)\r\nkd_creation(m,n,sqsets)\r\ndel cc\r\ndel ci\r\ndel sqsets\r\ntc = int(input())\r\ntc = [int(x) for x in input().split()]\r\nfor u in tc:\r\n p = 0\r\n for i in kd:\r\n if kd[i] <= u:\r\n p = max(i, p)\r\n print(p)", "# -- coding: utf-8 --\r\n\r\nimport math\r\nimport collections\r\nimport bisect\r\nimport heapq\r\nimport time\r\nimport random\r\nimport itertools\r\nimport sys\r\n\r\n\"\"\"\r\ncreated by shhuan at 2018/10/30 19:45\r\n\r\n\"\"\"\r\n\r\n\r\nN, M = map(int, input().split())\r\n\r\nA = []\r\n\r\nfor i in range(N):\r\n A.append([int(x) for x in input()])\r\n\r\n# for row in A:\r\n# print(row)\r\n\r\n\r\n#f(r, c, color, width) = f(r+1, c+1, color, width-1) + mismatches_in_edge\r\n\r\nmxMN, mnMN = max(M, N), min(M, N)\r\nans = [float('inf') for _ in range(mxMN + 1)]\r\nf = [[[[0 for _ in range(mxMN + 1)] for color in range(2)] for c in range(M+1)] for r in range(N+1)]\r\n\r\nfor width in range(1, min(N, N)+1):\r\n for color in [0, 1]:\r\n for sr in range(N-width+1):\r\n for sc in range(N-width+1):\r\n steps = f[sr+1][sc+1][color][width-1]\r\n\r\n cc = color\r\n for c in range(sc, sc+width):\r\n steps += 0 if A[sr][c] == cc else 1\r\n cc ^= 1\r\n cc = color ^ 1\r\n for r in range(sr+1, sr+width):\r\n steps += 0 if A[r][sc] == cc else 1\r\n cc ^= 1\r\n\r\n f[sr][sc][color][width] = steps\r\n ans[width] = min(ans[width], steps)\r\n\r\nqc = input()\r\nqs = [int(x) for x in input().split()]\r\n\r\n# print()\r\n# print(ans)\r\nfor q in qs:\r\n print(bisect.bisect_right(ans, q) - 1)\r\n\r\n", "n,m=list(map(int,input().split()))\r\ngrid=[ list(map(int,list(input()))) for i in range(n)]\r\nobs0=[ [ 0 for j in range(m)] for i in range(n)] \r\nobs1=[ [ 0 for j in range(m)] for i in range(n) ]\r\nmax_side=min(m,n)\r\nside_c=[ 40000 for i in range(max_side+1)]\r\nside_c[0]=0\r\nside_c[1]=0\r\n#print(grid)\r\nfor i in range(n):\r\n\tfor j in range(m):\r\n\t\tif (i+j)%2==0:\r\n\t\t\tobs0[i][j]=0\r\n\t\t\tobs1[i][j]=1\r\n\t\telse:\r\n\t\t\tobs0[i][j]=1\r\n\t\t\tobs1[i][j]=0\r\n#print(obs0)\r\n#print(obs1)\r\nfor i in range(n):\r\n\tfor j in range(m):\r\n\t\tif obs0[i][j]!=grid[i][j]:\r\n\t\t\tobs0[i][j]=1\r\n\t\telse:\r\n\t\t\tobs0[i][j]=0\r\n\t\tif obs1[i][j]!=grid[i][j]:\r\n\t\t\tobs1[i][j]=1\r\n\t\telse:\r\n\t\t\tobs1[i][j]=0\r\n#print(obs0)\r\n#print(obs1)\r\n\r\nfor i in range(n):\r\n\tfor j in range(1,m):\r\n\t\tobs0[i][j]+=obs0[i][j-1]\r\n\t\tobs1[i][j]+=obs1[i][j-1]\r\nfor j in range(m):\r\n\tfor i in range(1,n):\r\n\t\tobs0[i][j]+=obs0[i-1][j]\r\n\t\tobs1[i][j]+=obs1[i-1][j]\r\nfor side in range(2,max_side+1):\r\n\tfor i in range(n):\r\n\t\tfor j in range(m):\r\n\t\t\tif i+side>n or j+side>m:\r\n\t\t\t\tcontinue\r\n\t\t\tcount0 = obs0[i+side-1][j+side-1] + (i!=0 and j!=0)obs0[i-1][j-1] -(j!=0)obs0[i+side-1][j-1] -(i!=0)obs0[i-1][j+side-1] \r\n\t\t\tcount1 = obs1[i+side-1][j+side-1] + (i!=0 and j!=0)obs1[i-1][j-1] -(j!=0)obs1[i+side-1][j-1] -(i!=0)obs1[i-1][j+side-1]\r\n\t\t\tside_c[side]=min(count0,count1,side_c[side])\r\ninput()\r\n#print(side_c)\r\n#print(obs0,sep=\"\\n\")\r\n#print(obs1,sep=\"\\n\")\r\nlist_c=list(map(int,input().split()))\r\nfor i in range(len(list_c)):\r\n\tc=list_c[i]\r\n\tanswer=1\r\n\tfor side in range(2,max_side+1):\r\n\t\tif c<side_c[side]:\r\n\t\t\tanswer=side-1\r\n\t\t\tbreak\r\n\tif c>=side_c[max_side]:\r\n\t\tanswer=max_side\r\n\tprint(answer)\r\n\r\n\r\n\r\n", "n,m=map(int,input().split())\r\nb=[[int(x) for x in list(input())] for x in range(n)]\r\nc=int(input())\r\n\r\nsize=min(n,m)\r\nres=[size2 for x in range(size+1)]\r\n\r\ndef invert(i,j,r,ele):\r\n count=0\r\n \r\n for index,x in enumerate(range(i,i+r)):\r\n temp=ele\r\n if index%2:\r\n temp=0 if ele else 1\r\n \r\n for y in range(j,j+r):\r\n count+=0 if temp==b[x][y] else 1\r\n temp=0 if temp else 1\r\n return count\r\n\r\n\r\nfor s in range(size,1,-1):\r\n flag=0\r\n for x in range(n-s+1):\r\n for y in range(m-s+1):\r\n ic=min(invert(x,y,s,0),invert(x,y,s,1))\r\n res[s]=min(res[s],ic)\r\n # print(x,y,s,ic)\r\n if not ic:\r\n flag=1\r\n break\r\n if flag:\r\n break\r\n if flag:\r\n break\r\n\r\nfor t in map(int,input().split()):\r\n for index,e in reversed(list(enumerate(res))):\r\n if e<=t:\r\n print(index)\r\n break\r\n\r\nres = list(map(lambda x: 0 if x==size2 else x,res))", "import sys\r\n\r\ndp=[[0 for i in range(201)]for i in range(201)]\r\nQ =[sys.maxsize for i in range(201)]\r\nQ1=[sys.maxsize for i in range(201)]\r\n\r\n\r\ndef compareWith(A ,B ,n ,m , f):\r\n \r\n for i in range(1,n+1):\r\n for j in range(1,m+1):\r\n \r\n a=0\r\n if(A[i-1][j-1]!=B[i-1][j-1]):\r\n a=1\r\n \r\n dp[i][j]=a + dp[i-1][j] + dp[i][j-1] -dp[i-1][j-1]\r\n \r\n \r\n for i in range(1,n+1):\r\n for j in range(1,m+1):\r\n k=i\r\n l=j\r\n r=1\r\n while k<=n and l<=m:\r\n a=findError(i,j,k,l)\r\n Q[r]=min(Q[r],a)\r\n k+=1\r\n l+=1\r\n r+=1\r\n \r\n if f==1:\r\n Q1=Q[:]\r\n\r\n\r\ndef findError(i,j,k,l):\r\n return dp[k][l]-dp[k][j-1]-dp[i-1][l]+dp[i-1][j-1]\r\n \r\n\r\n\r\n\r\nn, m = map(int, input().split()) \r\n\r\nA=[]\r\nC=[]\r\nB=[]\r\n\r\nfor i in range(n):\r\n s=input()\r\n A.append(s)\r\n \r\nfor i in range(n):\r\n sb=\"\"\r\n sc=\"\"\r\n for j in range(m):\r\n if(i%2==0):\r\n if(j%2==0):\r\n sb+='1'\r\n sc+='0'\r\n else:\r\n sb+='0'\r\n sc+='1'\r\n else:\r\n if(j%2==1):\r\n sb+='1'\r\n sc+='0'\r\n else:\r\n sb+='0'\r\n sc+='1'\r\n B.append(sb)\r\n C.append(sc)\r\n \r\n# print(B, sep='\\n')\r\n# print(\"**\")\r\n# print(C, sep='\\n')\r\n\r\ncompareWith(A,B,n,m,1)\r\ncompareWith(A,C,n,m,0)\r\n\r\nq=int(input())\r\nc=list(map(int,input().split()))\r\n\r\nfor i in c:\r\n a=0\r\n for j in range(1,min(m,n)+1):\r\n if i>=Q[j] or i>=Q1[j]:\r\n a=max(a,j)\r\n \r\n print(a)\r\n\r\n\r\n ", "# cook your dish here\nn,m=map(int,input().split())\nR=n\nC=m\na=[None]n\nz=[0]n\no=[1]n\nfor i in range(m):\n if i%2!=0:\n z[i]=1\n o[i]=0\nzi=[None]n\noi=[None]*n\nfor i in range(n):\n a[i]=input()\n a[i]=list(a[i])\n for j in range(m):\n a[i][j]=int(a[i][j])\n \n if i%2==0:\n zi[i]=z[:]\n oi[i]=o[:]\n else:\n zi[i]=o[:]\n oi[i]=z[:]\nforzi=0\nforoi=0\npsao = [[0 for x in range(C)] for y in range(R)] \npsaz = [[0 for x in range(C)] for y in range(R)] \nnoioo=0\nnoizz=0\nnoio=0\nnoiz=0\nfor i in range(n):\n noiz=0\n noio=0\n \n for j in range(m):\n \n if i==0:\n if a[i][j]!=oi[i][j]:\n noio+=1\n else:\n noiz+=1\n psao[i][j]=noio\n psaz[i][j]=noiz\n else:\n if a[i][j]!=oi[i][j]:\n noio+=1\n else:\n noiz+=1\n psaz[i][j]=noiz+psaz[i-1][j]\n psao[i][j]=noio+psao[i-1][j]\n \n\n \n \n\n\nmmm=[]\nfor i in range(2,min(m,n)+1):\n c=0\n ap=[]\n for j in range(n-i+1):\n for k in range(m-i+1):\n czz=0\n czz1=0\n czz2=0\n coo=0\n cor=0\n czz+=(psaz[j+i-1][k+i-1])\n coo+=(psao[j+i-1][k+i-1])\n\n if k-1>=0:\n czz-=(psaz[j+i-1][k-1])\n coo-=(psao[j+i-1][k-1])\n else:\n czz+=0\n if j-1>=0:\n czz-=(psaz[j-1][k+i-1])\n coo-=(psao[j-1][k+i-1])\n\n else:\n czz+=0\n if j-1>=0 and k-1>=0:\n czz+=(psaz[j-1][k-1])\n coo+=(psao[j-1][k-1])\n else:\n czz+=0\n \n ap.append((min((abs(coo)),abs(czz))))\n mmm.append(min(ap))\n\nq=int(input())\nlo=[int(pp) for pp in input().split()]\nmaxq=max(mmm)\nfor i in range(q):\n if lo[i]>maxq:\n print(min(n,m))\n else:\n j=len(mmm)-1\n ind=0\n while j>=0:\n if lo[i]>=mmm[j]:\n ind=j+2\n break\n j-=1\n print(ind)"]	{"inputs": [["8 8", "00101010", "00010101", "10101010", "01010101", "10101010", "01010101", "10101010", "01010101", "4", "1 2 0 1001"]], "outputs": [["7", "8", "6", "8"]]}	INTERVIEW	PYTHON3	CODECHEF	13,773
ead56553e782574f944a71d31392cbff	UNKNOWN	The land of Programmers Army is surrounded by many islands. A unique number is associated with each island. The king of the islands is a very generous person, he donates a certain amount of gold coins to travelers for visiting each island that they visited to. Now, you are appointed as a traveler, who will travel to all these(or some) islands as many times as the Army wants, and you will collect gold coins from the king of the island. In each trip, you will be asked to give the total sum of gold coins you have collected. -----Input:----- - The first line of the input contains a single integer $T$. $T$ denoting the number of test cases. The description of $T$ test cases is as follows. - The next line of the input contains a single integer $N$. $N$ denotes the total number of Islands. - The next line of the input contains $N$ space-separated integers $A1, A2, A3...An$ where $ith$ number denotes the maximum number of coins that the king of $ith$ island can donate. - Next line contains a single integer $Q$. $Q$ denotes the total number of times traveler have to go for the trip. - Next $Q$ lines contains, two space-separated integers $Q1,Q2$ denoting the start and end number of islands, i.e. traveler will start the trip from $Q1th$ island and will go till $Q2th$ island, in each trip. Note: islands are numbered from $1$ to $N$. -----Output:----- - For each trip print the total number of gold coins, traveler will collect(each on a new line). -----Constraints:----- - $1 \leq T \leq 100$ - $1 \leq N \leq 10^4$ - $1 \leq A1, A2, A3...An \leq 10^5$ - $1 \leq Q \leq 10^3$ - $1 \leq Q1,Q2 \leq N$ -----Sample Input:----- 1 4 10 2 5 50 2 1 3 2 4 -----Sample Output:----- 17 57 -----Explanation:----- - In 1st Trip, traveler will go from 1st Island to 3rd Island, hence the total number of coins traveler can collect is 10+2+5 = 17 - In 2 d Trip, traveler will go from 2nd Island to 4th Island, hence the total number of coins traveler can collect is 2+5+50 = 57	["# cook your dish here\nfor i in range(int(input())):\n N = int(input())\n l = list(map(int, input().split()))\n for j in range(int(input())):\n q1, q2 = map(int, input().split())\n temp = l[q1 - 1 : q2]\n print(sum(temp))", "# cook your dish here\nfor _ in range(int(input())):\n n=int(input())\n arr=[int(k) for k in input().split()]\n q=int(input())\n for i in range(q):\n \n route=[int(k) for k in input().split()]\n sum =0\n for j in range(route[0]-1,route[1]):\n sum = sum + arr[j]\n \n print(sum)", "for _ in range(int(input())):\n n = int(input())\n arr = [int(k) for k in input().split()]\n q = int(input())\n sum = 0\n for i in range(q):\n start,end = [int(k) for k in input().split()]\n for j in range(start - 1, end):\n sum = sum + arr[j]\n print(sum)\n sum = 0\n", "# cook your dish here\nfor i in range(int(input())):\n n=int(input())\n arr=list(map(int,input().split()[:n]))\n k=int(input())\n for j in range(k):\n s,e=list(map(int,input().split()))\n su=sum(arr[s-1:e])\n print(su)\n \n", "for _ in range(int(input())):\n a=input()\n l=list(map(int,input().split()))\n q=int(input())\n r=[]\n for i in range(q):\n a,b=list(map(int,input().split()))\n print(sum(l[a-1:b]))\n \n \n", "ncases = int(input())\r\n\r\nfor cases in range(ncases):\r\n islands = int(input())\r\n pricelist = list( map( int, input().split()))\r\n if len(pricelist) != islands:\r\n continue\r\n visits = int(input())\r\n\r\n for k in range(visits):\r\n step = list( map( int, input().split()))\r\n print(sum(pricelist[step[0] - 1:step[1]]))\r\n\r\n", "# cook your dish here\nt=int(input())\n\nfor i in range(t):\n n=int(input())\n lst=list(map(int,input().split()))\n \n q=int(input())\n for j in range(q):\n q1,q2=list(map(int,input().split()))\n sum=0\n for k in range(q1-1,q2):\n sum+=lst[k]\n print(sum)\n \n", "# cook your dish here\nT = int(input())\n\nfor no in range(T):\n N = int(input())\n A = list(map(int,input().split()))\n Q = int(input())\n for q in range(Q):\n Q1 = list(map(int,input().split()))\n s = 0\n for i in range(Q1[0] - 1, Q1[1]):\n s += A[i]\n print(s)", "def c(data):\r\n n,a,q,q_i=data\r\n res=[]\r\n for s,e in q_i:\r\n res.append(str(sum(a[s-1:e])))\r\n return '\\n'.join(res)\r\n\r\ndef l():\r\n r=[]\r\n for _ in range(int(input())):\r\n n=int(input())\r\n a=[int(x)for x in input().split()]\r\n q=int(input())\r\n q_i=[tuple([int(x) for x in input().split()])for _ in range(q)]\r\n r.append((n,a,q,q_i))\r\n return r\r\ndef __starting_point():\r\n print('\\n'.join(map(c,l())))\n__starting_point()", "for _ in range(int(input())):\r\n n=int(input())\r\n a=list(map(int,input().split()))\r\n q=int(input())\r\n for i in range(q):\r\n x,y=map(int,input().split())\r\n ans=sum(a[x-1:y])\r\n print(ans)", "for _ in range(int(input())):\n\tn = int(input());arr = list(map(int , input().split()))\n\tfor _ in range(int(input())):\n\t\tstart,end = map(int , input().split())\n\t\tprint(sum(arr[start - 1:end]))", "# cook your dish here\ntry:\n for t in range(int(input())):\n k=int(input().strip(\" \"))\n kc=input().split(\" \")\n for q in range(int(input())):\n q1, q2 = input().split(\" \")\n q1 = int(q1)\n q2 = int(q2)\n sum=0\n for i in range(q1-1,q2):\n sum=sum + int(kc[i].strip())\n print(sum)\nexcept EOFError as e:\n pass\n# except ValueError as r:\n# pass\n", "# cook your dish here\nt=int(input())\nw=[]\nfor i in range(t):\n n=int(input())\n a=list(map(int,input().split()))\n Q=int(input())\n for j in range(Q):\n q=list(map(int,input().split()))\n count=0\n for k in range(q[0],q[1]+1):\n count+=a[k-1]\n w.append(count)\nfor i in w:\n print(i)\n\n\n", "try:\n n=int(input())\n for i in range(n):\n m=int(input())\n l=list(map(int,input().split()))\n q=int(input())\n for j in range(q):\n a,b=list(map(int,input().split()))\n newlist=l[(a-1):b]\n print(sum(newlist))\nexcept e:\n pass\n", "t = int(input())\r\nfor x in range(t):\r\n n = int(input())\r\n arr = input().split()\r\n for i in range(len(arr)):\r\n arr[i] = int(arr[i])\r\n q = int(input())\r\n for y in range(q):\r\n s = input().split()\r\n q1 = int(s[0])-1\r\n q2 = int(s[1])-1\r\n print(sum(arr[q1:q2+1]))", "for i in range(int(input())):\r\n nlands=int(input())\r\n maxcoins=list(map(int,input().split()))\r\n for j in range(int(input())):\r\n trips=list(map(int,input().split()))\r\n print(sum(maxcoins[trips[0]-1:trips[1]]))", "from sys import stdin\r\n\r\n# Input data\r\n#stdin = open(\"input\", \"r\")\r\n\r\n\r\nfor _ in range(int(stdin.readline())):\r\n n = int(stdin.readline())\r\n arr = list(map(int, stdin.readline().split()))\r\n for i in range(int(stdin.readline())):\r\n a, b = list(map(int, stdin.readline().split()))\r\n print(sum(arr[a - 1:b]))\r\n", "for i in range(int(input())):\n n = int(input())\n a = list(map(int, input().split()))\n q = int(input())\n for j in range(q):\n x,y = list(map(int, input().split()))\n print(sum(a[x-1:y]))\n", "# cook your dish here\ntestcases=int(input())\n\nfor _ in range(testcases):\n total_islands=int(input())\n \n coins_list=list(map(int,input().split()))\n \n total_trips=int(input())\n \n\n \n for _ in range(total_trips):\n coins=0\n \n (start,end)=list(map(int,input().split()))\n \n for i in range(start-1,end):\n coins=coins+coins_list[i]\n \n print(coins)\n \n", "# cook your dish here\nt=int(input())\nfor _ in range(t):\n n=int(input())\n l=list(map(int,input().split()))\n q=int(input())\n for i in range(q):\n a,b=map(int,input().split())\n print(sum(l[a-1:b]))", "T=int(input())\nfor _ in range(T):\n a=int(input())\n b=list(map(int,input().split()))\n c=int(input())\n for _ in range(c):\n d=list(map(int,input().split()))\n e=d[0]-1\n print(sum(b[e:d[1]]))\n", "# cook your dish here\nimport sys\ndef get_ints(): return map(int, sys.stdin.readline().strip().split())\ndef get_list(): return list(map(int, sys.stdin.readline().strip().split()))\ndef get_list_string(): return list(map(str, sys.stdin.readline().strip().split()))\ndef get_string(): return sys.stdin.readline().strip()\ndef get_int(): return int(sys.stdin.readline().strip())\ndef get_print_int(x): sys.stdout.write(str(x) + '\\n')\ndef get_print(x): sys.stdout.write(x + '\\n')\n\ndef solve():\n for _ in range(get_int()):\n n = get_int()\n arr = get_list()\n pre = [0]*n\n pre[0] = arr[0]\n for i in range(1,n):\n pre[i] = pre[i-1] + arr[i]\n q = get_int()\n while(q):\n s,e = get_ints()\n s -= 1\n e -= 1\n if(s == 0):\n get_print_int(pre[e])\n else:\n get_print_int(pre[e] - pre[s-1])\n q -= 1\nsolve()", "try:\r\n def fun(N,coins,q1,q2):\r\n arr=coins[q1-1:q2]\r\n return sum(arr)\r\n \r\n \r\n T=int(input())\r\n for _ in range(T):\r\n N=int(input())\r\n coins = [int(i) for i in input().split()]\r\n q = int(input())\r\n for i in range(q):\r\n q1,q2 = list(map(int,input().split()))\r\n print(fun(N,coins,q1,q2))\r\n \r\nexcept:\r\n pass\r\n", "try:\n def fun(N,coins,q1,q2):\n arr=coins[q1-1:q2]\n return sum(arr)\n \n \n T=int(input())\n for _ in range(T):\n N=int(input())\n coins = [int(i) for i in input().split()]\n q = int(input())\n for i in range(q):\n q1,q2 = list(map(int,input().split()))\n print(fun(N,coins,q1,q2))\n \nexcept:\n pass\n", "t= int(input())\nresult = []\n \ndef logic(arr,p1,p2):\n return sum(arr[p1-1:p2])\n \n\nfor i in range(0,t):\n n = int(input())\n arr = list(map(int, input().split()))\n q = int(input())\n for x in range(0,q):\n p1,p2 = list(map(int,input().split())) \n result.append(logic(arr,p1,p2))\n \nfor item in result:\n print(item)\n"]	{"inputs": [["1", "4", "10 2 5 50", "2", "1 3", "2 4"]], "outputs": [["17", "57"]]}	INTERVIEW	PYTHON3	CODECHEF	8,813
5120d67b7482c0ad0edced8aa1c128bb	UNKNOWN	-----Coal Company ----- The Tunisian Coal Mining company uses a train to ferry out coal blocks from its coal mines. The train has N containers numbered from 1 to N which need to be filled with blocks of coal. Assume there are infinite coal blocks. The containers are arranged in increasing order of capacity, and the ith container has capacity i. Every container has a specific loading cost ci. The workers fill the containers in rounds. In every round, they choose a subset of containers and load them with coal blocks. This subset should be such that each subsequent container chosen in a round should be more spacious than the previous one. Also, the difference in loading cost of consecutive containers should be at least K. What is the least number of rounds in which all containers can be filled? ----- Input ----- The first line contains the number of test cases T. T test cases follow. Each case contains an integer N and K on the first line, followed by integers c1,...,cn on the second line. 1 <= T <= 100 1 <= N <= 300 1 <= ci <= 1000 1 <= K <= 1000 ----- Output ----- Output T lines, one for each test case, containing the minimum number of rounds in which all containers could be filled. ----- Example ----- Input: 2 3 2 5 4 7 5 1 5 3 4 5 6 Output: 2 1 Explanation: For the first example, workers can fill the containers of cost 5 and 7 in the first round and the container with cost 4 in the next round. Note that the containers with cost 5 and 4 cannot be filled consecutively because the loading costs should differ by at least K (which is 2). Also, the containers cannot be filled in order 5, 7, 4 in one round because the containers filled in a round should be in increasing capacity.	["for _ in range(int(input())):\n n,k=list(map(int,input().split()))\n c=list(map(int,input().split()))\n count=1\n for i in range(n):\n if i+1<n:\n if c[i]-c[i+1]>=k or c[i+1]-c[i]>=k:\n continue\n else:\n count+=1\n c[i],c[i+1]=c[i+1],c[i]\n print(count)\n \n"]	{"inputs": [["2", "3 2", "5 4 7", "5 1", "5 3 4 5 6"]], "outputs": [["2", "1"]]}	INTERVIEW	PYTHON3	CODECHEF	280
be0a5dae02f65c3e2c573cafe5a2c8a0	UNKNOWN	"If you didn't copy assignments during your engineering course, did you even do engineering?" There are $Q$ students in Chef's class. Chef's teacher has given the students a simple assignment: Write a function that takes as arguments an array $A$ containing only unique elements and a number $X$ guaranteed to be present in the array and returns the ($1$-based) index of the element that is equal to $X$. The teacher was expecting a linear search algorithm, but since Chef is such an amazing programmer, he decided to write the following binary search function: integer binary_search(array a, integer n, integer x): integer low, high, mid low := 1 high := n while low ≤ high: mid := (low + high) / 2 if a[mid] == x: break else if a[mid] is less than x: low := mid+1 else: high := mid-1 return mid All of Chef's classmates have copied his code and submitted it to the teacher. Chef later realised that since he forgot to sort the array, the binary search algorithm may not work. Luckily, the teacher is tired today, so she asked Chef to assist her with grading the codes. Each student's code is graded by providing an array $A$ and an integer $X$ to it and checking if the returned index is correct. However, the teacher is lazy and provides the exact same array to all codes. The only thing that varies is the value of $X$. Chef was asked to type in the inputs. He decides that when typing in the input array for each code, he's not going to use the input array he's given, but an array created by swapping some pairs of elements of this original input array. However, he cannot change the position of the element that's equal to $X$ itself, since that would be suspicious. For each of the $Q$ students, Chef would like to know the minimum number of swaps required to make the algorithm find the correct answer. -----Input----- - The first line of the input contains a single integer $T$ denoting the number of test cases. The description of $T$ test cases follows. - The first line of each test case contains two space-separated integers $N$ and $Q$ denoting the number of elements in the array and the number of students. - The second line contains $N$ space-separated integers $A_1, A_2, \dots, A_N$. - The following $Q$ lines describe queries. Each of these lines contains a single integer $X$. -----Output----- For each query, print a single line containing one integer — the minimum required number of swaps, or $-1$ if it is impossible to make the algorithm find the correct answer. (Do you really think Chef can fail?) -----Constraints----- - $1 \le T \le 10$ - $1 \le N, Q \le 10^5$ - $1 \le A_i \le 10^9$ for each valid $i$ - $1 \le X \le 10^9$ - all elements of $A$ are pairwise distinct - for each query, $X$ is present in $A$ - sum of $N$ over all test cases $\le 5\cdot10^5$ - sum of $Q$ over all test cases $\le 5\cdot10^5$ -----Subtasks----- Subtask #1 (20 points): $1 \le N \le 10$ Subtask #2 (30 points): - $1 \le A_i \le 10^6$ for each valid $i$ - $1 \le X \le 10^6$ Subtask #3 (50 points): original constraints -----Example Input----- 1 7 7 3 1 6 7 2 5 4 1 2 3 4 5 6 7 -----Example Output----- 0 1 1 2 1 0 0 -----Explanation----- Example case 1: - Query 1: The algorithm works without any swaps. - Query 2: One solution is to swap $A_2$ and $A_4$. - Query 3: One solution is to swap $A_2$ and $A_6$. - Query 4: One solution is to swap $A_2$ with $A_4$ and $A_5$ with $A_6$. - Query 5: One solution is to swap $A_2$ and $A_4$. - Query 6: The algorithm works without any swaps. - Query 7: The algorithm works without any swaps.	["def f(a,y,index,sorted_pos):\n #print(a,y,index,sorted_pos)\n n=len(a)\n low=0\n high=n-1\n L,R=0,0\n l,r=0,0\n while(low<=high):\n mid=(low+high)//2\n #print(low,high,mid)\n if(a[mid]== y):\n break\n elif(mid > index[y]):\n high=mid-1\n L+=1\n #print(\"L\")\n if(a[mid] <y):\n l+=1\n #print(\" l \")\n else:\n low=mid+1\n R+=1\n #print(\"R\")\n if(a[mid]>y):\n r+=1\n #print(\"r\")\n x=sorted_pos[y]\n #print(L,R,l,r,x,n-x-1)\n if(R>x or L> n-x-1):\n print(\"-1\")\n else:\n print(max(l,r))\n\n\ndef fun():\n test=int(input())\n for t in range(test):\n n,q=list(map(int,input().split()))\n arr=list(map(int,input().split()))\n index= dict()\n for i in range(n):\n index[arr[i]]=i\n sorted_pos=dict()\n a=sorted(arr)\n for i in range(n):\n sorted_pos[a[i]]=i\n for x in range(q):\n y=int(input())\n f(arr,y,index,sorted_pos)\n\nfun()\n\n", "from sys import stdin,stdout\nt=int(stdin.readline())\nwhile(t):\n n,q=list(map(int,stdin.readline().rstrip().split()))\n arr=list(map(int,stdin.readline().rstrip().split()))\n d={}\n d1={}\n a=arr.copy()\n a.sort()\n for i in range(n):\n d1[a[i]]=i\n d[arr[i]]=i\n while(q):\n v=int(stdin.readline().rstrip())\n index=d[v]\n smaller=d1[v]\n bigger=n-smaller-1\n low,high=0,n-1\n c1,c2=0,0\n while(high>=low):\n mid=(high+low)//2\n if mid==index:\n break\n elif index>mid:\n if arr[mid]>v:\n c1+=1\n else:\n smaller-=1\n low=mid+1\n else:\n if v>arr[mid]:\n c2+=1\n else:\n bigger-=1\n high=mid-1\n if c2>c1:\n if bigger>=(c2-c1):\n print(c2)\n else:\n print(-1)\n elif c1>c2:\n if smaller>=(c1-c2):\n print(c1)\n else:\n print(-1)\n else:\n print(c1)\n q-=1\n t-=1\n\n", "def binarySearch(start, end, xindex,opList):\n if start <= end:\n midindex = int((start+end)/2)\n opList.append(midindex)\n if xindex < midindex:\n return binarySearch(start, midindex-1, xindex, opList)\n\n elif xindex > midindex:\n return binarySearch(midindex+1, end, xindex, opList)\n\n else:\n return opList\n\n\ndef counter(opList,a, x):\n small = 0\n big = 0\n rightSmall = 0\n rightBig = 0\n\n for i in range(len(opList)-1):\n # print(\"for oplist[\",i,\"]=\",opList[i])\n if opList[i] < opList[i+1]:\n # print(\"traverse to right\")\n if x < a[opList[i]]:\n # print(\"x is small\")\n small += 1\n else:\n rightSmall += 1\n else:\n # print(\"traverse to left\")\n if x> a[opList[i]]:\n # print(\"x is big\")\n big += 1\n else:\n rightBig += 1\n flag = isBigSmallAvailable(small,big,x,a,rightBig,rightSmall)\n if flag:\n total = small + big\n total = total - min(small,big)\n return total\n else:\n return -1\n\n\ndef isBigSmallAvailable(small,big,x,a,rightBig,rightSmall):\n s = 0\n b = 0\n s = s - rightSmall\n b = b - rightBig\n length = len(a)\n for i in range(length):\n if a[i] < x:\n s += 1\n if a[i] > x:\n b += 1\n\n if s >= small and b >= big:\n return True\n return False\n\n\nt = int(input())\nfor z in range(t):\n l = list(map(int,input().split()))\n n = int(l[0])\n q = int(l[1])\n a = list(map(int,input().split()))\n for i in range(q):\n x = int(input())\n xindex = a.index(x)\n opList = []\n result = binarySearch(0, n-1, xindex, opList)\n count = counter(opList, a, x)\n\n # print(result)\n print(count)\n # else:\n # print(swapCount)\n", "def binarySearch(start, end, xindex,opList):\n if start <= end:\n midindex = int((start+end)/2)\n\n opList.append(midindex)\n if xindex < midindex :\n return binarySearch(start, midindex-1, xindex, opList)\n\n elif xindex > midindex :\n return binarySearch(midindex+1, end, xindex, opList)\n\n else:\n return opList\n\n\ndef counter(opList,a, x):\n small = 0\n big = 0\n rightSmall = 0\n rightBig = 0\n\n for i in range(len(opList)-1):\n # print(\"for oplist[\",i,\"]=\",opList[i])\n if opList[i] < opList[i+1]:\n # print(\"traverse to right\")\n if x < a[opList[i]]:\n # print(\"x is small\")\n small += 1\n else:\n rightSmall += 1\n else:\n # print(\"traverse to left\")\n if x> a[opList[i]]:\n # print(\"x is big\")\n big += 1\n else:\n rightBig += 1\n flag = isBigSmallAvailable(small,big,x,a,rightBig,rightSmall)\n if flag:\n total = small + big\n total = total - min(small,big)\n return total\n else:\n return -1\n\n\ndef isBigSmallAvailable(small,big,x,a,rightBig,rightSmall):\n s = 0\n b = 0\n s = s - rightSmall\n b = b - rightBig\n length = len(a)\n for i in range(length):\n if a[i] < x:\n s += 1\n if a[i] > x:\n b += 1\n\n if s >= small and b >= big:\n return True\n # s = s - rightSmall\n # b = b - rightBig\n # print(\"big \",b)\n\n return False\n\n\nt = int(input())\nswapCount = 0\nswaped = []\nvisited = []\nfor z in range(t):\n l = list(map(int,input().split()))\n n = int(l[0])\n q = int(l[1])\n aa = list(map(int,input().split()))\n for i in range(q):\n swapCount = 0\n swaped.clear()\n visited.clear()\n a = aa[:]\n # print(\"aa is\",aa)\n\n x = int(input())\n # a.sort()\n xindex = a.index(x)\n opList = []\n result = binarySearch(0, n-1, xindex, opList)\n count = counter(opList, a, x)\n\n # print(result)\n print(count)\n # else:\n # print(swapCount)\n", "def binarySearch(start, end, xindex,opList):\n if start <= end:\n midindex = int((start+end)/2)\n\n opList.append(midindex)\n if xindex < midindex :\n return binarySearch(start, midindex-1, xindex, opList)\n\n elif xindex > midindex :\n return binarySearch(midindex+1, end, xindex, opList)\n\n else:\n return opList\n\n\ndef counter(opList,a, x):\n small = 0\n big = 0\n rightSmall = 0\n rightBig = 0\n\n for i in range(len(opList)-1):\n # print(\"for oplist[\",i,\"]=\",opList[i])\n if opList[i] < opList[i+1]:\n # print(\"traverse to right\")\n if x < a[opList[i]]:\n # print(\"x is small\")\n small += 1\n else:\n rightSmall += 1\n else:\n # print(\"traverse to left\")\n if x> a[opList[i]]:\n # print(\"x is big\")\n big += 1\n else:\n rightBig += 1\n flag = isBigSmallAvailable(small,big,x,a,rightBig,rightSmall)\n if flag:\n total = small + big\n total = total - min(small,big)\n return total\n else:\n return -1\n\n\ndef isBigSmallAvailable(small,big,x,a,rightBig,rightSmall):\n s = 0\n b = 0\n length = len(a)\n for i in range(length):\n if a[i] < x:\n s += 1\n if a[i] > x:\n b += 1\n s = s - rightSmall\n b = b - rightBig\n # print(\"big \",b)\n if s>=small and b>=big:\n return True\n return False\n\n\nt = int(input())\nswapCount = 0\nswaped = []\nvisited = []\nfor z in range(t):\n l = list(map(int,input().split()))\n n = int(l[0])\n q = int(l[1])\n aa = list(map(int,input().split()))\n for i in range(q):\n swapCount = 0\n swaped.clear()\n visited.clear()\n a = aa[:]\n # print(\"aa is\",aa)\n\n x = int(input())\n # a.sort()\n xindex = a.index(x)\n opList = []\n result = binarySearch(0, n-1, xindex, opList)\n count = counter(opList, a, x)\n\n # print(result)\n print(count)\n # else:\n # print(swapCount)\n", "def binarySearch(start, end, xindex,opList):\n if start <= end:\n midindex = int((start+end)/2)\n\n opList.append(midindex)\n if xindex < midindex :\n return binarySearch(start, midindex-1, xindex, opList)\n\n elif xindex > midindex :\n return binarySearch(midindex+1, end, xindex, opList)\n\n else:\n return opList\n\n\ndef counter(opList,a, x):\n small = 0\n big = 0\n rightSmall = 0\n rightBig = 0\n\n for i in range(len(opList)-1):\n # print(\"for oplist[\",i,\"]=\",opList[i])\n if opList[i] < opList[i+1]:\n # print(\"traverse to right\")\n if x < a[opList[i]]:\n # print(\"x is small\")\n small += 1\n else:\n rightSmall += 1\n else:\n # print(\"traverse to left\")\n if x> a[opList[i]]:\n # print(\"x is big\")\n big += 1\n else:\n rightBig += 1\n flag = isBigSmallAvailable(small,big,x,a,rightBig,rightSmall)\n if flag:\n total = small + big\n total = total - min(small,big)\n return total\n else:\n return -1\n\n\ndef isBigSmallAvailable(small,big,x,a,rightBig,rightSmall):\n s = 0\n b = 0\n for i in range(len(a)):\n if a[i] < x:\n s += 1\n if a[i] > x:\n b += 1\n s = s - rightSmall\n b = b - rightBig\n # print(\"big \",b)\n if s>=small and b>=big:\n return True\n return False\n\n\nt = int(input())\nswapCount = 0\nswaped = []\nvisited = []\nfor z in range(t):\n l = list(map(int,input().split()))\n n = int(l[0])\n q = int(l[1])\n aa = list(map(int,input().split()))\n for i in range(q):\n swapCount = 0\n swaped.clear()\n visited.clear()\n a = aa[:]\n # print(\"aa is\",aa)\n\n x = int(input())\n # a.sort()\n xindex = a.index(x)\n opList = []\n result = binarySearch(0, n-1, xindex, opList)\n count = counter(opList, a, x)\n\n # print(result)\n print(count)\n # else:\n # print(swapCount)\n", "for _ in range(int(input())):\n n,q=list(map(int,input().split()))\n l=[int(i) for i in input().split()]\n d={}\n ind={}\n for i in range(n):\n ind[l[i]]=i \n #dup=l[:]\n dup=sorted(l)\n for i in range(n):\n chote=i \n bade=n-i-1 \n d[dup[i]]=[chote,bade]\n for _ in range(q):\n chotewale_swap=0 \n badewale_swap=0\n x=int(input())\n #d1=d[x].copy()\n d1={}\n d1[0]=d[x][0]\n d1[1]=d[x][1]\n f=1\n low=0\n high=n-1 \n while low<=high:\n mid=(low+high)//2 \n if ind[x]==mid:\n break \n elif ind[x]>mid and x>l[mid]:\n if d1[0]==0:\n f=-1 \n break \n d1[0]-=1 \n low=mid+1\n elif ind[x]>mid and x<l[mid]:\n if d1[0]==0:\n f=-1 \n break \n d1[0]-=1 \n chotewale_swap+=1\n low=mid+1\n elif ind[x]<mid and x<l[mid]:\n if d1[1]==-1:\n f=-1 \n break \n d1[1]-=1 \n high=mid-1\n elif ind[x]<mid and x>l[mid]:\n if d1[1]==0:\n f=-1 \n break \n d1[1]-=1 \n badewale_swap+=1 \n high=mid-1 \n if f==-1:\n print(-1)\n else:\n print(max(chotewale_swap,badewale_swap))\n", "for _ in range(int(input())):\n n,q=list(map(int,input().split()))\n l=[int(i) for i in input().split()]\n d={}\n ind={}\n for i in range(n):\n ind[l[i]]=i \n #dup=l[:]\n dup=sorted(l)\n for i in range(n):\n chote=i \n bade=n-i-1 \n d[dup[i]]=[chote,bade]\n for _ in range(q):\n chotewale_swap=0 \n badewale_swap=0\n x=int(input())\n #d1=d[x].copy()\n d1={}\n d1[0]=d[x][0]\n d1[1]=d[x][1]\n f=1\n low=0\n high=n-1 \n while low<=high:\n mid=(low+high)//2 \n if ind[x]==mid:\n break \n elif ind[x]>mid and x>l[mid]:\n d1[0]-=1 \n low=mid+1\n elif ind[x]>mid and x<l[mid]:\n if d1[0]==0:\n f=-1 \n break \n d1[0]-=1 \n chotewale_swap+=1\n low=mid+1\n elif ind[x]<mid and x<l[mid]:\n d1[1]-=1 \n high=mid-1\n elif ind[x]<mid and x>l[mid]:\n if d1[1]==0:\n f=-1 \n break \n d1[1]-=1 \n badewale_swap+=1 \n high=mid-1 \n if f==-1:\n print(-1)\n else:\n print(max(chotewale_swap,badewale_swap))\n", "for _ in range(int(input())):\n n,q=list(map(int,input().split()))\n l=[int(i) for i in input().split()]\n d={}\n ind={}\n for i in range(n):\n ind[l[i]]=i \n #dup=l[:]\n dup=sorted(l)\n for i in range(n):\n chote=i \n bade=n-i-1 \n d[dup[i]]=[chote,bade]\n for _ in range(q):\n chotewale_swap=0 \n badewale_swap=0\n x=int(input())\n d1=d[x].copy()\n f=1\n low=0\n high=n-1 \n while low<=high:\n mid=(low+high)//2 \n if ind[x]==mid:\n break \n elif ind[x]>mid and x>l[mid]:\n d1[0]-=1 \n low=mid+1\n elif ind[x]>mid and x<l[mid]:\n if d1[0]==0:\n f=-1 \n break \n d1[0]-=1 \n chotewale_swap+=1\n low=mid+1\n elif ind[x]<mid and x<l[mid]:\n d1[1]-=1 \n high=mid-1\n elif ind[x]<mid and x>l[mid]:\n if d1[1]==0:\n f=-1 \n break \n d1[1]-=1 \n badewale_swap+=1 \n high=mid-1 \n if f==-1:\n print(-1)\n else:\n print(max(chotewale_swap,badewale_swap))\n", "def f(a,y,index,sorted_pos):\n #print(a,y,index,sorted_pos)\n n=len(a)\n low=0\n high=n-1\n L,R=0,0\n l,r=0,0\n while(low<=high):\n mid=(low+high)//2\n #print(low,high,mid)\n if(a[mid]== y):\n break\n elif(mid > index[y]):\n high=mid-1\n L+=1\n #print(\"L\")\n if(a[mid] <y):\n l+=1\n #print(\" l \")\n else:\n low=mid+1\n R+=1\n #print(\"R\")\n if(a[mid]>y):\n r+=1\n #print(\"r\")\n x=sorted_pos[y]\n #print(L,R,l,r,x,n-x-1)\n if(R>x or L> n-x-1):\n print(\"-1\")\n else:\n print(max(l,r))\n\n\ndef fun():\n test=int(input())\n for t in range(test):\n n,q=list(map(int,input().split()))\n arr=list(map(int,input().split()))\n index= dict()\n for i in range(n):\n index[arr[i]]=i\n sorted_pos=dict()\n a=sorted(arr)\n for i in range(n):\n sorted_pos[a[i]]=i\n for x in range(q):\n y=int(input())\n f(arr,y,index,sorted_pos)\n\nfun()\n\n", "for _ in range(int(input())):\n n,q=list(map(int,input().split()))\n l=[int(i) for i in input().split()]\n d={}\n ind={}\n for i in range(n):\n ind[l[i]]=i \n dup=l[:]\n dup=sorted(dup)\n for i in range(n):\n chote=i \n bade=n-i-1 \n d[dup[i]]=[chote,bade]\n for _ in range(q):\n chotewale_swap=0 \n badewale_swap=0\n x=int(input())\n d1=d[x].copy()\n f=1\n low=0\n high=n-1 \n while low<=high:\n mid=(low+high)//2 \n if ind[x]==mid:\n break \n elif ind[x]>mid and x>l[mid]:\n d1[0]-=1 \n low=mid+1\n elif ind[x]>mid and x<l[mid]:\n if d1[0]==0:\n f=-1 \n break \n d1[0]-=1 \n chotewale_swap+=1\n low=mid+1\n elif ind[x]<mid and x<l[mid]:\n d1[1]-=1 \n high=mid-1\n elif ind[x]<mid and x>l[mid]:\n if d1[1]==0:\n f=-1 \n break \n d1[1]-=1 \n badewale_swap+=1 \n high=mid-1 \n if f==-1:\n print(-1)\n else:\n print(max(chotewale_swap,badewale_swap))\n", "for _ in range(int(input())):\n n,q=list(map(int,input().split()))\n l=[int(i) for i in input().split()]\n d={}\n ind={}\n for i in range(n):\n ind[l[i]]=i \n dup=l.copy()\n dup.sort()\n for i in range(n):\n chote=i \n bade=n-i-1 \n d[dup[i]]=[chote,bade]\n for _ in range(q):\n chotewale_swap=0 \n badewale_swap=0\n x=int(input())\n d1=d[x].copy()\n f=1\n low=0\n high=n-1 \n while low<high:\n mid=(low+high)//2 \n if ind[x]==mid:\n break \n elif ind[x]>mid and x>l[mid]:\n d1[0]-=1 \n low=mid+1\n elif ind[x]>mid and x<l[mid]:\n if d1[0]==0:\n f=-1 \n break \n d1[0]-=1 \n chotewale_swap+=1\n low=mid+1\n elif ind[x]<mid and x<l[mid]:\n d1[1]-=1 \n high=mid-1\n elif ind[x]<mid and x>l[mid]:\n if d1[1]==0:\n f=-1 \n break \n d1[1]-=1 \n badewale_swap+=1 \n high=mid-1 \n if f==-1:\n print(-1)\n else:\n print(max(chotewale_swap,badewale_swap))\n", "for _ in range(int(input())):\n n,q=list(map(int,input().split()))\n l=[int(i) for i in input().split()]\n d={}\n ind={}\n for i in range(n):\n ind[l[i]]=i \n dup=l.copy()\n dup.sort()\n for i in range(n):\n chote=i \n bade=n-i-1 \n d[dup[i]]=[chote,bade]\n for _ in range(q):\n chotewale_swap=0 \n badewale_swap=0\n x=int(input())\n d1=d[x].copy()\n f=1\n low=0\n high=n-1 \n while low<=high:\n mid=(low+high)//2 \n if ind[x]==mid:\n break \n elif ind[x]>mid and x>l[mid]:\n d1[0]-=1 \n low=mid+1\n elif ind[x]>mid and x<l[mid]:\n if d1[0]==0:\n f=-1 \n break \n d1[0]-=1 \n chotewale_swap+=1\n low=mid+1\n elif ind[x]<mid and x<l[mid]:\n d1[1]-=1 \n high=mid-1\n elif ind[x]<mid and x>l[mid]:\n if d1[1]==0:\n f=-1 \n break \n d1[1]-=1 \n badewale_swap+=1 \n high=mid-1 \n if f==-1:\n print(-1)\n else:\n print(max(chotewale_swap,badewale_swap))\n", "t = int(input())\nwhile t > 0:\n t -= 1\n n, q = list(map(int, input().split()))\n arr = list(map(int, input().split()))\n tarr = sorted(arr)\n d = {}\n inddir = {}\n for i in range(len(arr)):\n inddir[arr[i]] = i\n tarrlen = len(tarr)\n for i in range(len(tarr)):\n d[tarr[i]] = [i, tarrlen - i - 1]\n for _ in range(q):\n k = int(input())\n find = inddir[k]\n l, r = 1, tarrlen\n gs=0\n ls=0\n sw = 0\n tempc = d[k].copy()\n while l <= r:\n mid = (l + r) // 2\n if mid - 1 == find:\n break\n elif mid - 1 < find:\n if arr[mid - 1] < k:\n if tempc[0] > 0:\n tempc[0] -= 1\n else:\n sw = -1\n break\n else:\n if tempc[0] > 0:\n tempc[0] -= 1\n sw += 1\n ls+=1\n else:\n sw = -1\n break\n l = mid + 1\n else:\n if arr[mid - 1] > k:\n if tempc[1] > 0:\n tempc[1] -= 1\n else:\n sw = -1\n break\n else:\n if tempc[1] > 0:\n tempc[1] -= 1\n sw += 1\n gs+=1\n else:\n sw = -1\n break\n r = mid - 1\n print(max(ls,gs) if sw!=-1 else -1)\n", "T=int(input())\nfor xs in range(T):\n N,Q=[int(o) for o in input().split()]\n a=[int(o) for o in input().split()]\n b=sorted(a)\n Di={} #Dictionary\n for i in range(len(a)):\n Di[a[i]]=[i]\n for i in range(len(b)):\n Di[b[i]].append(i) \n r=[]\n qu=[int(input()) for j in range(Q)]\n for q in qu:\n low=1\n high=N\n ind=Di[q][0]+1\n b=[]\n f=[]\n s=0\n maxs=N-Di[q][1]-1\n mins=N-maxs-1\n while low<=high: #Binary Search algorithm\n mid=(low+high)//2\n if mid==ind:\n break\n elif mid<ind:\n low=mid+1\n if a[mid-1]>q:\n b.append(a[mid-1])\n else:\n mins-=1 \n elif mid>ind:\n high=mid-1\n if a[mid-1]<q:\n f.append(a[mid-1])\n else:\n maxs-=1\n lenf=len(f)\n lenb=len(b)\n sw=min(lenf,lenb)\n rs=max(lenf,lenb)-sw\n mins,maxs=mins-sw,maxs-sw\n ex=min(mins,maxs)\n if ex<rs: \n r.append(-1)\n s=1\n else:\n sw+=rs # When ex>=rs\n if not s:\n r.append(sw) \n for ans in r:\n print(ans) #Final"]	{"inputs": [["1", "7 7", "3 1 6 7 2 5 4", "1", "2", "3", "4", "5", "6", "7"]], "outputs": [["0", "1", "1", "2", "1", "0", "0"]]}	INTERVIEW	PYTHON3	CODECHEF	17,582
324c5dc9f871558c7c56fdbf119caa88	UNKNOWN	Chef likes strings a lot but he likes palindromic strings more. Today, Chef has two strings A and B, each consisting of lower case alphabets. Chef is eager to know whether it is possible to choose some non empty strings s1 and s2 where s1 is a substring of A, s2 is a substring of B such that s1 + s2 is a palindromic string. Here '+' denotes the concatenation between the strings. Note: A string is a palindromic string if it can be read same both forward as well as backward. To know more about palindromes click here. -----Input----- - First line of input contains a single integer T denoting the number of test cases. - For each test case: - First line contains the string A - Second line contains the string B. -----Output----- For each test case, Print "Yes" (without quotes) if it possible to choose such strings s1 & s2. Print "No" (without quotes) otherwise. -----Constraints----- - 1 ≤ T ≤ 10 - 1 ≤ \|A\|, \|B\| ≤ 1000 -----Subtasks----- - Subtask 1: 1 ≤ \|A\|, \|B\| ≤ 10 : ( 40 pts ) - Subtask 2: 1 ≤ \|A\|, \|B\| ≤ 1000 : ( 60 pts ) -----Example-----Input 3 abc abc a b abba baab Output Yes No Yes -----Explanation----- - Test 1: One possible way of choosing s1 & s2 is s1 = "ab", s2 = "a" such that s1 + s2 i.e "aba" is a palindrome. - Test 2: There is no possible way to choose s1 & s2 such that s1 + s2 is a palindrome. - Test 3: You can figure it out yourself.	["t=int(input())\nfor _ in range (t):\n str1=input()\n str2=input()\n res='No'\n for i in str1:\n if i in str2:\n res='Yes'\n break\n print(res)\n", "for _ in range(int(input())):\n str1=input()\n str2=input()\n res='No'\n for i in str1:\n if i in str2:\n res='Yes'\n break\n print(res)", "# cook your dish here\nt = int(input())\nfor i in range(t):\n a = input()\n b= input()\n c=0\n for i in a:\n if i in b:\n c=1\n break\n else:\n continue\n if c==1:\n print(\"Yes\")\n else:\n print(\"No\")\n", "T=int(input())\nfor i in range(T):\n A=input()\n B=input()\n flag=0\n for i in A:\n if i in B:\n flag=1\n break\n if(flag==0):\n print(\"No\")\n else:\n print(\"Yes\")\n", "for _ in range(int(input())):\n a=set(list(input()))\n b=set(list(input()))\n if len(a&b)==0:\n print('No')\n else:\n print('Yes')\n", "a=int(input())\nwhile a:\n a=a-1\n b=input()\n c=input()\n p=[]\n for i in c:\n if i not in p:\n p.append(i) \n f=0 \n for i in b:\n if i not in p:\n continue \n else:\n f=1 \n break\n if f==1:\n print(\"Yes\")\n else:\n print(\"No\")\n", "for _ in range(int(input())):\n s1,s2=input(),input()\n for i in s1:\n if i in s2:\n print(\"Yes\")\n break\n else:\n print(\"No\")", "# cook your dish here\nfor _ in range(int(input())):\n a=input()\n b=input()\n for i in b:\n if(i in a):\n print(\"Yes\")\n break\n else:\n print(\"No\")", "t=int(input())\nfor x in range(t):\n a=input()\n b=input()\n flag=False\n for i in a:\n if i in b:\n flag=True\n break\n if flag :\n print(\"Yes\")\n else:\n print(\"No\")\n \n\n", "# cook your dish here\nfor i in range(int(input())):\n s1=input()\n s2=input()\n c=0\n for i in s1:\n for j in s2:\n if(i==j):\n c+=1\n if(c>0):\n print('Yes')\n else:\n print('No')", "# cook your dish here\nt=int(input())\nfor _ in range(t):\n a=str(input())\n b=str(input())\n k=0\n for i in a:\n for j in b:\n if(i==j):\n k+=1\n if(k>0):\n print('Yes')\n else:\n print('No')", "# cook your dish here\nt=int(input())\nfor ts in range(t):\n s1=str(input())\n s2=str(input())\n c=0\n for i in s1:\n for j in s2:\n if(i==j):\n c=c+1\n if(c>0):\n print('Yes')\n else:\n print('No')", "# cook your dish here\nt = int(input())\nfor z in range(t) :\n a = input()\n b = input()\n s1 = set(a)\n s2 = set(b)\n if s1&s2 :\n print(\"Yes\")\n else:\n print(\"No\")", "# cook your dish here\nt=int(input())\nfor ts in range(t):\n s1=str(input())\n s2=str(input())\n c=0\n for i in s1:\n for j in s2:\n if(i==j):\n c=c+1\n if(c>0):\n print('Yes')\n else:\n print('No')", "# cook your dish here\nx=int(input())\nfor i in range(x):\n s1=str(input())\n s2=str(input())\n c=0\n for j in s1:\n for k in s2:\n if(j==k):\n c=c+1\n if(c>0):\n print('Yes')\n else:\n print('No')", "# cook your dish her\nfor _ in range(int(input())):\n x=set(input())\n y=set(input())\n if(len(x&y)):\n print('Yes')\n else:\n print('No')\n", "# cook your dish here\nfor i in range(int(input())):\n s1=set(input())\n s2=set(input())\n if(len(s1&s2)):\n print('Yes')\n else:\n print('No')\n", "# cook your dish here\nt=int(input())\nfor _ in range(t):\n a=str(input())\n b=str(input())\n k=0\n for i in a:\n for j in b:\n if(i==j):\n k+=1\n if(k>0):\n print('Yes')\n else:\n print('No')", "import sys\n\n#def input(): return sys.stdin.readline().strip()\ndef iinput(): return int(input())\n#def rinput(): return map(int, sys.stdin.readline().strip().split()) \n#def get_list(): return list(map(int, sys.stdin.readline().strip().split())) \n\nfor _ in range(iinput()):\n s1=set(input())\n s2=set(input())\n if(len(s1&s2)):\n print('Yes')\n else:\n print('No')\n \n \n", "# cook your dish here\nn=int(input())\nfor i in range(n):\n a=input()\n b=input()\n c=0\n for i in a:\n if i in b:\n c=1\n print(\"Yes\")\n break\n if c==0:\n print(\"No\")\n", "import sys\n\n#def input(): return sys.stdin.readline().strip()\ndef iinput(): return int(input())\n#def rinput(): return map(int, sys.stdin.readline().strip().split()) \n#def get_list(): return list(map(int, sys.stdin.readline().strip().split())) \n\nfor _ in range(iinput()):\n s1=set(input())\n s2=set(input())\n if(len(s1&s2)):\n print('Yes')\n else:\n print('No')\n \n \n", "for _ in range(int(input())):\n a=set(input())\n b=set(input())\n print('Yes' if len(a&b)>0 else 'No')", "def solve(s1,s2):\n for i in s1:\n for j in s2:\n if i==j:\n return \"Yes\"\n return \"No\"\nt=int(input())\nfor _ in range(t):\n s1=input()\n s2=input()\n print(solve(s1,s2))", "# cook your dish here\ndef solve(a,b):\n for i in a:\n for j in b:\n if i==j:\n return 1\n return 0\nt=int(input())\nfor _ in range(0,t):\n a=input()\n b=input()\n if(solve(a,b)):\n print(\"Yes\")\n else:\n print(\"No\")", "# cook your dish here\nt=int(input())\n\nfor n in range(t):\n a=str(input())\n b=str(input())\n count = 0\n for i in a:\n for j in b:\n if i==j:\n count+=1\n if count > 0:\n print(\"Yes\")\n else:\n print(\"No\")"]	{"inputs": [["3", "abc", "abc", "a", "b", "abba", "baab"]], "outputs": [["Yes", "No", "Yes"]]}	INTERVIEW	PYTHON3	CODECHEF	4,997
b1b31108634cb7d856da67c6bb1034eb	UNKNOWN	Chef's new hobby is painting, but he learned the fact that it's not easy to paint 2D pictures in a hard way, after wasting a lot of canvas paper, paint and of course time. From now on, he decided to paint 1D pictures only. Chef's canvas is N millimeters long and is initially all white. For simplicity, colors will be represented by an integer between 0 and 105. 0 indicates white. The picture he is envisioning is also N millimeters long and the ith millimeter consists purely of the color Ci. Unfortunately, his brush isn't fine enough to paint every millimeter one by one. The brush is 3 millimeters wide and so it can only paint three millimeters at a time with the same color. Painting over the same place completely replaces the color by the new one. Also, Chef has lots of bottles of paints of each color, so he will never run out of paint of any color. Chef also doesn't want to ruin the edges of the canvas, so he doesn't want to paint any part beyond the painting. This means, for example, Chef cannot paint just the first millimeter of the canvas, or just the last two millimeters, etc. Help Chef by telling him whether he can finish the painting or not with these restrictions. -----Input----- The first line of the input contains an integer T denoting the number of test cases. The description of T test cases follows. The first line of each test case contains a single integer N. The second line contains N space-separated integers C1, C2, ..., CN denoting the colors of Chef's painting. -----Output----- For each test case, output a single line containing either “Yes” or “No” (without quotes), denoting whether Chef can finish the painting or not. -----Constraints----- - 1 ≤ T ≤ 105 - 3 ≤ N ≤ 105 - The sum of the Ns over all the test cases in a single test file is ≤ 5×105 - 1 ≤ Ci ≤ 105 -----Example----- Input:3 4 1 5 5 5 4 1 1 1 5 3 5 5 2 Output:Yes Yes No -----Explanation----- Example case 1. Chef's canvas initially contains the colors [0,0,0,0]. Chef can finish the painting by first painting the first three millimeters with color 1, so the colors become [1,1,1,0], and then the last three millimeters with color 5 so that it becomes [1,5,5,5]. Example case 2. Chef's canvas initially contains the colors [0,0,0,0]. Chef can finish the painting by first painting the last three millimeters by color 5 so the colors become [0,5,5,5], and then the first three millimeters by color 1 so it becomes [1,1,1,5]. Example case 3. In this test case, Chef can only paint the painting as a whole, so all parts must have the same color, and the task is impossible.	["# cook your dish here\nimport sys\nimport math\n\ndef main(arr):\n for i in range(1,len(arr)-1):\n if arr[i]==arr[i-1] and arr[i]==arr[i+1]:\n return \"Yes\"\n return \"No\"\n\ntest=int(input())\nfor _ in range(test):\n b=int(input())\n arr=list(map(int,input().split()))\n print(main(arr))\n\n ", "import sys\nimport math\n\ndef main(arr):\n \n \n for i in range(1,len(arr)-1):\n if arr[i]==arr[i-1] and arr[i]==arr[i+1]:\n return \"Yes\"\n return \"No\"\n\n\nfor _ in range(int(input())):\n b=int(input())\n arr=list(map(int,input().split()))\n print(main(arr))\n\n ", "t=int(input())\r\nfor i in range(t):\r\n n=int(input())\r\n l=list(map(int,input().split()))\r\n flag=0\r\n cou=0\r\n for j in range(n-2):\r\n a1=l[j]\r\n a2=l[j+1]\r\n a3=l[j+2]\r\n if(a1==a2 and a2==a3):\r\n flag=1\r\n break\r\n if(flag==1):\r\n print(\"Yes\")\r\n else:\r\n print(\"No\")\r\n \r\n\r\n", "try:\r\n for _ in range(int(input())):\r\n n=int(input())\r\n lis=list(map(int,input().split()))\r\n flag=0\r\n for i in range(n-2):\r\n if(lis[i]==lis[i+1]==lis[i+2]):\r\n flag=1\r\n break\r\n else:\r\n continue\r\n if(flag==1):\r\n print(\"Yes\")\r\n else:\r\n print(\"No\")\r\nexcept Exception:\r\n pass\r\n", "t=int(input())\r\nfor i in range(t):\r\n n = int(input())\r\n l = list(map(int,input().split()))\r\n flag=0\r\n for j in range(n-2):\r\n if(l[j]==l[j+1]==l[j+2]):\r\n flag=1\r\n break\r\n else:\r\n continue\r\n if(flag==1):\r\n print(\"Yes\")\r\n else:\r\n print(\"No\")", "# cook your dish here\nt=int(input())\nfor t1 in range(t):\n b=input()\n a=list(map(int,input().split()))\n x=0\n f=0\n \n while x<(len(a)-2):\n if a[x]==a[x+1] and a[x+1]==a[x+2]:\n f=1\n break\n x+=1\n if f==1:\n print(\"Yes\")\n else:\n print(\"No\")", "# cook your dish here\nfor _ in range(int(input())):\n n=int(input())\n a=list(map(int,input().split()))\n f=0\n for i in range(n-2):\n l=a[i:i+3]\n if len(set(l))==1:\n print(\"Yes\")\n f=1\n break\n if f==0:\n print(\"No\")", "for _ in range(int(input())):\r\n\tN=int(input())\r\n\tA=list(map(int,input().split()))\r\n\tc=False\r\n\tfor i in range(N-2):\r\n\t\tif A[i]==A[i+1]==A[i+2]:\r\n\t\t\tc=True\r\n\t\t\tbreak\r\n\tif c==False:\r\n\t\tprint('No')\r\n\telse:\r\n\t\tprint('Yes')", "for j in range(int(input())):\r\n n=int(input())\r\n x=list(map(int,input().split()))\r\n c=0\r\n for i in range(n-2):\r\n if(x[i]==x[i+1] and x[i]==x[i+2]):\r\n c=1\r\n break\r\n if(c==1):\r\n print(\"Yes\")\r\n else:\r\n print(\"No\")", "for _ in range(int(input())):\r\n n=int(input())\r\n a=list(map(int,input().split()))\r\n ans=0\r\n for i in range(n-2):\r\n if(a[i]==a[i+1] and a[i]==a[i+2]):\r\n ans=1\r\n if ans==1:\r\n print('Yes')\r\n else:\r\n print('No')", "# cook your dish here\nfor _ in range(int(input())):\n n=int(input())\n l=list(map(int,input().split()))\n flag=0\n for i in range(n-2):\n if(l[i]==l[i+1] and l[i]==l[i+2]):\n print(\"Yes\")\n flag=1\n break\n if(flag==0):\n print(\"No\")", "for _ in range(int(input())):\r\n N = int(input())\r\n array = list(map(int, input().split()))\r\n possible = 'No'\r\n for i in range(N - 2):\r\n if array[i] == array[i+1] and array[i] == array[i+2]:\r\n possible = 'Yes'\r\n break\r\n\r\n print(possible)\r\n", "for _ in range(int(input())):\r\n n=int(input())\r\n a=list(map(int,input().split()))\r\n flag=0\r\n for i in range(len(a)-2):\r\n if len(set(a[i:i+3]))==1:\r\n print('Yes')\r\n flag=1\r\n break\r\n else:\r\n flag=0\r\n if flag==0:\r\n print('No')", "# cook your dish here\nt=int(input())\nwhile t:\n n = input()\n l = list(map(int,input().split()))\n i=0\n z=1\n while i<len(l)-2:\n \n if len(set(l[i:i+3]))==1:\n z=0\n break\n else:\n i+=1\n if z==0:\n print(\"Yes\")\n else:\n print(\"No\")\n t-=1\n", " \r\nfor _ in range(int(input())): \r\n n=int(input())\r\n a=[int(i) for i in input().split()]\r\n count=0\r\n for i in range(n-1):\r\n if a[i] == a[i+1]:\r\n count+=1\r\n if count==2:\r\n print(\"Yes\")\r\n break\r\n else:\r\n count=0\r\n else:\r\n print(\"No\")\r\n", "# cook your dish here\nimport sys\nfor i in range(int(sys.stdin.readline())):\n n = int(sys.stdin.readline())\n c = list(map(int, sys.stdin.readline().split()))\n v = 0\n for j in range(n-2):\n if c[j] == c[j+1] == c[j+2]:\n v += 1\n break\n else:\n pass\n if v == 1:\n sys.stdout.write('Yes\\n')\n else:\n sys.stdout.write('No\\n')", "# cook your dish here\nt = int(input())\nfor _ in range(t):\n n = int(input())\n s = input().split(' ')\n arr = [int(i) for i in s]\n flag = 0\n for i in range(len(arr)-2):\n if(arr[i]==arr[i+1] and arr[i+1]==arr[i+2]):\n flag = 1\n break\n if(flag==0):\n print('No')\n else:\n print('Yes')", "# cook your dish here\nfor test_case in range(int(input())):\n n = int(input())\n canvas = list(map(int, input().split(' ')))\n \n threes = 0\n if n > 2:\n for i in range(n - 2):\n if canvas[i] == canvas[i + 1] and canvas[i + 1] == canvas[i + 2]:\n threes += 1\n \n if threes > 0:\n print('Yes')\n else:\n print('No')", "t=int(input())\r\nfor _ in range(t):\r\n n=int(input())\r\n l=list(map(int,input().split()))\r\n x=[0]n\r\n for i in range(n-2):\r\n x[i]=x[i+1]=x[i+2]=l[i]\r\n for j in range(n-1,1,-1):\r\n if l[j]!=x[j]:\r\n x[j]=x[j-1]=x[j-2]=l[j]\r\n \r\n if x==l:\r\n print('Yes')\r\n else:\r\n print('No')\r\n \r\n \r\n \r\n", "t=int(input())\r\nfor _ in range(t):\r\n n=int(input())\r\n l=list(map(int,input().split()))\r\n x=[0]n\r\n for i in range(n-2):\r\n x[i]=x[i+1]=x[i+2]=l[i]\r\n if x==l:\r\n print('Yes')\r\n else:\r\n if n==3:\r\n print('No')\r\n elif n==4:\r\n if (l[0]==l[1] and l[1]==l[2]) or (l[-1]==l[-2] and l[-2]==l[-3]):\r\n print('Yes')\r\n else:\r\n print('No')\r\n else:\r\n for j in range(n-1,1,-1):\r\n if l[j]!=x[j]:\r\n x[j]=x[j-1]=x[j-2]=l[j]\r\n \r\n \r\n if x==l:\r\n print('Yes')\r\n else:\r\n print('No')\r\n \r\n \r\n \r\n", "for _ in range(int(input())):\n a=int(input())\n arr=list(map(int, input().split()))\n prev=arr[0]\n count=0\n f=0\n for i in arr:\n if i==prev:\n count+=1\n else:\n prev=i\n count=1\n if count>=3:\n print(\"Yes\")\n f=1\n break\n if not f:\n print(\"No\")\n", "from collections import Counter\nT=int(input())\nfor i in range(T):\n N=int(input())\n List=[int(x) for x in input().split()]\n Initial=List[0]\n a=0\n count=0\n for i in List:\n if(Initial==i):\n count+=1\n if(count>=3):\n a=1\n break\n if(Initial!=i):\n count=1\n Initial=i\n if(a==1):\n print(\"Yes\")\n else:\n print(\"No\")", "t=int(input())\nwhile(t):\n t-=1\n n=int(input())\n ls=list(map(int,input().split()))\n k=0\n for i in range(0,n-2):\n if ls[i]==ls[i+1] and ls[i+1]==ls[i+2]:\n k=1\n break\n if k==1:\n print(\"Yes\")\n else:\n print(\"No\")", "\n\nt = int(input())\n\nfor i in range(t):\n n = int(input())\n flag = 0\n l = list(map(int,input().split()))\n for j in range(n-2):\n if l[j] == l[j+1] == l[j+2]:\n flag = 1\n break\n if flag == 1:\n print('Yes')\n else:\n print('No')\n\n\n", "# cook your dish here\ndef get_ans(ar, n):\n for i in range(n - 2):\n if ar[i] == ar[i+1] == ar[i+2]:\n return 'Yes'\n return 'No'\n\nfor _ in range(int(input())):\n n = int(input())\n ar = list(map(int, input().split()))\n \n print(get_ans(ar, n))"]	{"inputs": [["3", "4", "1 5 5 5", "4", "1 1 1 5", "3", "5 5 2", ""]], "outputs": [["Yes", "Yes", "No"]]}	INTERVIEW	PYTHON3	CODECHEF	9,088
5e824983f5b38933f880032b91f0aa21	UNKNOWN	Kefaa has developed a novel decomposition of a tree. He claims that this decomposition solves many difficult problems related to trees. However, he doesn't know how to find it quickly, so he asks you to help him. You are given a tree with $N$ vertices numbered $1$ through $N$. Let's denote an edge between vertices $u$ and $v$ by $(u, v)$. The triple-tree decomposition is a partition of edges of the tree into unordered triples of edges $(a, b), (a, c), (a, d)$ such that $a \neq b \neq c \neq d$. Each edge must belong to exactly one triple. Help Kefaa with this problem — find a triple-tree decomposition of the given tree or determine that no such decomposition exists. -----Input----- - The first line of the input contains a single integer $T$ denoting the number of test cases. The description of $T$ test cases follows. - The first line of each test case contains a single integer $N$. - Each of the following $N-1$ lines contains two space-separated integers $u$ and $v$ describing an edge between vertices $u$ and $v$ of the tree. -----Output----- - For each test case, print a line containing the string "YES" if a triple-tree decomposition of the given tree exists or "NO" otherwise. - If it exists, print $\frac{N-1}{3}$ more lines describing a decomposition. - Each of these lines should contain four space-separated integers $a$, $b$, $c$ and $d$ describing a triple of edges $(a, b), (a, c), (a, d)$. If more than one triple-tree decomposition exists, you may output any one. -----Constraints----- - $1 \le T \le 100$ - $2 \le N \le 2 \cdot 10^5$ - $1 \le u, v \le N$ - the sum of $N$ over all test cases does not exceed $2 \cdot 10^5$ -----Subtasks----- Subtask #1 (20 points): $2 \le N \le 10$ Subtask #2 (30 points):$2 \le N \le 5000$ and the sum of $N$ overall testcases doesn't exceed $5000$ Subtask #3 (50 points): original constraints -----Example Input----- 2 4 1 2 1 3 1 4 7 1 2 2 3 1 4 4 5 1 6 6 7 -----Example Output----- YES 1 2 3 4 NO	["\ntest=int(input())\nfor t in range(test):\n n= int(input())\n\n adj=[[] for i in range(n+1)]\n\n for _ in range(n-1):\n a,b=list(map(int,input().split()))\n adj[a].append(b)\n adj[b].append(a)\n \n\n #print(adj)\n root=1\n q,s=[root],set([root])\n\n for x in q:\n adj[x]= [p for p in adj[x] if p not in s]\n q.extend(adj[x])\n s.update(adj[x])\n\n #print(adj)\n ans=True\n if(n<4):\n ans=False\n for i in range(n+1):\n if(len(adj[i]) %3!=0):\n ans=False\n if(ans):\n print(\"YES\")\n for i in range(n+1):\n while(len(adj[i])):\n print(i,adj[i][0],adj[i][1],adj[i][2])\n adj[i].pop(0)\n adj[i].pop(0)\n adj[i].pop(0)\n else:\n print(\"NO\")\n", "\ntest=int(input())\nfor t in range(test):\n n= int(input())\n\n adj=[[] for i in range(n+1)]\n\n for _ in range(n-1):\n a,b=list(map(int,input().split()))\n adj[a].append(b)\n adj[b].append(a)\n \n\n #print(adj)\n root=1\n q,s=[root],set([root])\n\n for x in q:\n adj[x]= [p for p in adj[x] if p not in s]\n q.extend(adj[x])\n s.update(adj[x])\n\n #print(adj)\n ans=True\n if(n<4):\n ans=False\n for i in range(n+1):\n if(len(adj[i]) %3!=0):\n ans=False\n if(ans):\n print(\"YES\")\n for i in range(n+1):\n while(len(adj[i])):\n print(i,adj[i][0],adj[i][1],adj[i][2])\n adj[i].pop(0)\n adj[i].pop(0)\n adj[i].pop(0)\n else:\n print(\"NO\")\n", "\ntest=int(input())\nfor t in range(test):\n n= int(input())\n\n adj=[[] for i in range(n+1)]\n\n for _ in range(n-1):\n a,b=list(map(int,input().split()))\n adj[a].append(b)\n adj[b].append(a)\n \n\n #print(adj)\n root=1\n q,s=[root],set([root])\n\n for x in q:\n adj[x]= [p for p in adj[x] if p not in s]\n q.extend(adj[x])\n s.update(adj[x])\n\n #print(adj)\n ans=True\n for i in range(n+1):\n if(len(adj[i]) %3!=0):\n ans=False\n if(ans):\n print(\"YES\")\n for i in range(n+1):\n while(len(adj[i])):\n print(i,adj[i][0],adj[i][1],adj[i][2])\n adj[i].pop(0)\n adj[i].pop(0)\n adj[i].pop(0)\n else:\n print(\"NO\")\n"]	{"inputs": [["2", "4", "1 2", "1 3", "1 4", "7", "1 2", "2 3", "1 4", "4 5", "1 6", "6 7"]], "outputs": [["YES", "1 2 3 4", "NO"]]}	INTERVIEW	PYTHON3	CODECHEF	1,995
a4ec6d67dbaa0d7f760ef923d0d264c0	UNKNOWN	Sandu, a teacher in Chefland introduced his students to a new sequence i.e. 0,1,0,1,2,0,1,2,3,0,1,2,3,4........ The Sequence starts from 0 and increases by one till $i$(initially i equals to 1), then repeat itself with $i$ changed to $i+1$ Students being curious about the sequence asks the Nth element of the sequence. Help Sandu to answer the Students -----Input:----- - The first-line will contain $T$, the number of test cases. Then the test case follows. - Each test case contains a single numbers N. -----Output:----- Print the Nth element of the sequence -----Constraints----- - $1 \leq T \leq 1000$ - $1 \leq N \leq 10^{18}$ -----Sample Input:----- 5 8 9 20 32 109 -----Sample Output:----- 2 3 5 4 4	["from math import sqrt\n\nfor _ in range(int(input())):\n n = int(input())\n\n x = int(sqrt(2 * n))\n\n while x * (x+1) // 2 <= n:\n x += 1\n\n while x * (x+1) // 2 > n:\n x -= 1\n\n n -= x * (x+1) // 2\n\n print(n)\n", "\"\"\"\nProblem Statement: https://www.codechef.com/ENCD2020/problems/ECAPR203\nAuthor: striker\n\"\"\"\n\nimport math\n\ndef main():\n for test in range(int(input().strip())):\n n = int(input().strip())\n tinv = (1 + int(math.sqrt(1 + 8 * n))) // 2\n print(n - ((tinv * (tinv - 1)) // 2))\n\ndef __starting_point():\n main()\n\n__starting_point()", "import math\n_1_50 = 1 << 50\ndef isqrt(x):\n if x < 0:\n raise ValueError('square root not defined for negative numbers')\n if x < _1_50:\n return int(math.sqrt(x)) \n n = int(x)\n if n <= 1:\n return n \n\n r = 1 << ((n.bit_length() + 1) >> 1)\n while True:\n newr = (r + n // r) >> 1 \n if newr >= r:\n return r\n r = newr\n\nfor i in range(int(input())):\n n=int(input())\n x=(isqrt(42n+1)-1)//2\n \n x=x(x+1)//2\n print(n-x)\n", "import math\n\nfor _ in range(int(input())):\n n = int(input())\n \n def findNumber( n ): \n \n x = int(math.ceil((-1 + math.sqrt(1\n + 8 n + 8)) / 2)) \n x -= 1\n \n b = (x * (x + 1)) // 2 - 1\n \n res = n - b -1 \n \n return res\n ans = findNumber(n)\n print(ans)", "# cook your dish here\nimport math\nt=int(input())\nwhile t>0:\n n=int(input())\n k=n+1\n k=2\n a=math.sqrt(k)\n a=int(a)\n if a(a+1)>k:\n a-=1 \n b=k-(a(a+1))\n if b==0:\n c=a-1\n else:\n c=b//2\n c-=1\n print(c)\n t-=1\n \n \n", "# cook your dish here\nimport math\nt = int(input())\nfor _ in range(t):\n n = int(input())\n x = math.floor((-1 + math.sqrt(1 + 8 (n))) // 2)\n num = (x * (x+1) // 2) \n print(n - num)", "def do_sum(m):\n return ((m+1)(m+2))//2-1\n\ndef bin_search(n, l, h):\n m = (l+h)//2\n if do_sum(m)<n and do_sum(m+1)>=n:\n return m\n if do_sum(m)<n:\n return bin_search(n, m+1, h)\n return bin_search(n, l, m-1)\n\nt = int(input().strip())\nfor _ in range(t):\n n = int(input().strip())\n # a = [int(x) for x in input().strip().split()]\n m = bin_search(n,1,10000000000)\n print(n-((m+1)(m+2))//2)", "from math import floor\nt = int(input())\nfor _ in range(t):\n n = int(input())\n t = floor((2n+1/4)0.5 - 1/2)\n nt = t(t+1)//2\n print(int(n-nt))", "import math\n_1_50 = 1 << 50\ndef isqrt(x):\n if x < 0:\n raise ValueError('square root not defined for negative numbers')\n if x < _1_50:\n return int(math.sqrt(x)) \n n = int(x)\n if n <= 1:\n return n \n\n r = 1 << ((n.bit_length() + 1) >> 1)\n while True:\n newr = (r + n // r) >> 1 \n if newr >= r:\n return r\n r = newr\n\nfor i in range(int(input())):\n n=int(input())\n x=(isqrt(42n+1)-1)//2\n x=x(x+1)//2\n print(n-x)\n\n\n", "#In the Name of God\nimport math\n\nt = int(input())\n\nfor _ in range(t):\n n = int(input())\n x = int(math.sqrt(2n))\n while(((x(x+1))//2)-1 >= n):\n x-=1;\n #print(x)\n ini = (x(x+1))//2\n ini -= 1\n print(int(n-ini-1))", "# cook your dish here\nimport math\n\ndef solve(N):\n bucket = math.ceil((math.sqrt(8N+1)-1)//2)\n return N - (bucketbucket+bucket)//2\n\n\nT = int(input())\nfor _ in range(T):\n N = int(input())\n result = solve(N)\n print(result)", "# cook your dish here\nimport math\nfor _ in range(int(input())):\n N=int(input())\n t=int(math.sqrt(2N+2))\n if ((tt+1)<N):\n t=t+1\n if(t&1==1):\n print(N%t)\n else:\n k=N%t\n if(k<t//2):\n print(k+t//2)\n else:\n print(k-t//2)\n", "for n in range(int(input())):\n x=int(input())\n v=x+1\n j=-1+int((8v).5)\n j//=2\n d=j(j+1)//2\n if d==v:\n print(j-1)\n else:\n print(v-d-1)\n", "# cook your dish here\nt = int(input())\nfor i in range(t):\n n = int(input())\n x = int((((8(n+1)+1)0.5) - 1)/2)\n d = (8(n+1)+1)*0.5\n if (d-int(d)==0):\n print(x-1)\n else:\n f = (x(x+1))//2 \n c = n-f\n print(c)\n", "#code\nimport math\nt=int(input())\nwhile(t>0):\n t-=1\n n=int(input())\n n-=1\n n1=(int(math.sqrt(8n+1))-1)//2\n i=n1(n1+1)//2-1\n if(n1+1+i==n):\n print(0)\n else:\n print(n-i)", "t=int(input())\nfor i in range(t):\n n=int(input())\n term=(-1+((8n+9)0.5))/2\n # print('term is '+str(term))\n if term==int(term):\n ans=int(term-1)\n # print('yo')\n # print(str(term)+' '+str(int(term)))\n else:\n term=int(term)\n summ=((term(term+1))//2)-1\n # print('summ is '+str(summ))\n ans=n-summ-1\n print(ans)", "# cook your dish here\nfrom collections import defaultdict\nimport math\np=int(input())\nwhile p>0:\n n=int(input())\n #n-=1\n t=math.floor(((2n+1)0.5)+0.5)\n res=0.5(t-(t*2)+2n)\n print(int(res))\n p-=1\n\n\n \n", "# cook your dish here\n#ecapr203\n\ntry:\n# if(True):\n for _ in range(int(input())):\n n=int(input())\n k=int((((9+(8n))(0.5))-1)/2)\n m=((k-1)(k+2))//2\n d=n-m\n if(d==0):\n print(k-1)\n else:\n print(d-1)\nexcept:\n pass", "import math\nt=int(input())\nfor i in range(0,t):\n n=int(input())\n k=0\n x=0\n k=((int(math.sqrt(((8n)+1)))-1)//2)\n x=(k(k+1)//2)\n n=n-x\n print(n)\n", "import math\nt = int(input())\nwhile t:\n n = int(input())\n c = 0\n i = (1 + math.ceil((9 + 8 * n)*0.5) - 1) // 2\n # print(i)\n c = (i (i + 1) // 2) - 1\n # print(c)\n print(int(i - (c - n) - 1))\n t-=1", "import math\nfor _ in range(int(input())):\n n = int(input())\n d = math.floor(math.sqrt(1+(8n)))\n d = ((d-1)//2)\n s = ((d(d+1))//2)\n if s==n:\n print(0)\n else:\n print(n-s)", "t=int(input())\nfor it in range(t):\n n=int(input())\n p=int(((8n+1)0.5-3)/2)\n print(n-((p+1)(p+2))//2)", "import math\ndef getk(n):\n exp=(9+8n)0.5\n exp-=1\n exp=exp//2\n # print(math.floor(exp))\n return math.floor(exp)\nt=int(input())\nwhile(t):\n n=int(input())\n k=int(getk(n))\n offset= int(n-(k(k+1)//2-1))\n if(offset==0):\n offset=k\n print(offset-1)\n t-=1"]	{"inputs": [["5", "8", "9", "20", "32", "109"]], "outputs": [["2", "3", "5", "4", "4"]]}	INTERVIEW	PYTHON3	CODECHEF	5,760
3b7da0e21b175c0af906905896fe99ce	UNKNOWN	Ayu loves distinct letter sequences ,a distinct letter sequence is defined by a sequence of small case english alphabets such that no character appears more then once. But however there are two phrases that she doesn't like these phrases are "kar" and "shi" and she is given a sequence of distinct characters and she wonders how many such sequences she can form using all the characters such that these phrases don't occur. Help her finding the number of such sequences. New Year Gift - It is guaranteed that for sequences of length greater then 6 letters k,a,r,s,h,i will be present(we thought of being generous, thank us later :)). -----Input:----- - First line will contain $T$, number of testcases. Then the testcases follow. - Each line consists of a string $S$ (3<=s.length<=18) of distinct characters. -----Output:----- Print the number of sequences that can be formed by permuting all the characters such that phrases "kar" and "shi" don't occur. -----Constraints----- - $1 \leq T \leq 10$ - $3 \leq S.length \leq 18$ -----Sample Input:----- 2 karp abcd -----Sample Output:----- 22 24	["# cook your dish here\r\nfrom collections import deque, defaultdict\r\nfrom math import sqrt, ceil,factorial\r\nimport sys\r\nimport copy\r\ndef get_array(): return list(map(int, sys.stdin.readline().strip().split()))\r\ndef get_ints(): return map(int, sys.stdin.readline().strip().split())\r\ndef input(): return sys.stdin.readline().strip()\r\n\r\nfor _ in range(int(input())):\r\n\r\n s=input()\r\n if len(s)>6:\r\n ans=0\r\n rem=len(s)-6\r\n ans+=factorial(len(s))\r\n ans-=2(factorial(len(s)-2))\r\n ans+=factorial(rem+2)\r\n print(ans)\r\n\r\n else:\r\n if 'k' in s and 'r' in s and 'a' in s and 's' in s and 'h' in s and 'i' in s:\r\n ans = 0\r\n rem = len(s) - 6\r\n ans += factorial(len(s))\r\n ans -= 2 (factorial(len(s) - 2))\r\n ans += factorial(rem + 2)\r\n print(ans)\r\n else:\r\n if 'k' in s and 'a' in s and 'r' in s:\r\n ans=0\r\n rem=len(s)-3\r\n ans+=factorial(len(s))\r\n ans-=factorial(rem+1)\r\n print(ans)\r\n continue\r\n if 's' in s and 'h' in s and 'i' in s:\r\n ans = 0\r\n rem = len(s) - 3\r\n ans += factorial(len(s))\r\n ans -= factorial(rem + 1)\r\n print(ans)\r\n continue\r\n\r\n print(factorial(len(s)))\r\n\r\n"]	{"inputs": [["2", "karp", "abcd"]], "outputs": [["22", "24"]]}	INTERVIEW	PYTHON3	CODECHEF	1,497
a7ac4c70101c38241936f15fbeac854c	UNKNOWN	The chef has a recipe he wishes to use for his guests, but the recipe will make far more food than he can serve to the guests. The chef therefore would like to make a reduced version of the recipe which has the same ratios of ingredients, but makes less food. The chef, however, does not like fractions. The original recipe contains only whole numbers of ingredients, and the chef wants the reduced recipe to only contain whole numbers of ingredients as well. Help the chef determine how much of each ingredient to use in order to make as little food as possible. -----Input----- Input will begin with an integer T, the number of test cases. Each test case consists of a single line. The line begins with a positive integer N, the number of ingredients. N integers follow, each indicating the quantity of a particular ingredient that is used. -----Output----- For each test case, output exactly N space-separated integers on a line, giving the quantity of each ingredient that the chef should use in order to make as little food as possible. -----Sample Input----- 3 2 4 4 3 2 3 4 4 3 15 9 6 -----Sample Output----- 1 1 2 3 4 1 5 3 2 -----Constraints----- T≤100 2≤N≤50 All ingredient quantities are between 1 and 1000, inclusive.	["#! /usr/bin/env python\n\nfrom sys import stdin\nfrom functools import reduce\n\ndef gcd(a,b):\n\twhile b!=0:\n\t\ta,b=b,a%b\n\treturn a\n\t\ndef gcdl(l):\n\treturn reduce(gcd, l[1:],l[0])\n\ndef __starting_point():\n\tT=int(stdin.readline())\n\tfor case in range(T):\n\t\tnumbers=list(map(int, stdin.readline().split()[1:]))\n\t\tg=gcdl(numbers)\n\t\t\n\t\tnumbers=[n/g for n in numbers]\n\t\tprint(\" \".join([str(x) for x in numbers]))\n\n__starting_point()"]	{"inputs": [["3", "2 4 4", "3 2 3 4", "4 3 15 9 6", ""]], "outputs": [["1 1", "2 3 4", "1 5 3 2"]]}	INTERVIEW	PYTHON3	CODECHEF	464
9bcbd573b0904e482a7a7eb8f18b2a16	UNKNOWN	Today is Chef's birthday. His mom has surprised him with truly fruity gifts: 2 fruit baskets. The first basket contains N apples, and the second one contains M oranges. Chef likes apples and oranges very much but he likes them equally, and therefore, wants to have the minimum possible difference between the number of apples and oranges he has. To do so, he can purchase 1 apple or 1 orange by paying exactly 1 gold coin (that's some expensive fruit, eh?). Chef can purchase fruits at most K times (as he has only K gold coins in his pocket) to make the difference the minimum possible. Our little Chef is busy in celebrating his birthday to the fullest, and therefore, he has handed this job to his best friend — you. Can you help him by finding the minimum possible difference he can achieve between the number of apples and orange he owns? -----Input----- The first line of input contains a single integer T denoting the number of test cases. The first and only line of each test case contains 3 space separated integers — N, M and K — denoting the number of apples, number of oranges, and number of gold coins our little Chef has. -----Output----- For each test case, output the minimum possible difference between the number of apples and oranges that Chef can achieve. -----Constraints----- - 1 ≤ T ≤ 100 - 1 ≤ N, M, K ≤ 100 -----Example-----Input 3 3 4 1 5 2 1 3 4 3 Output 0 2 0 -----Explanation----- - Test 1: Chef will buy 1 apple by paying 1 gold coin and will have equal number of apples and oranges. - Test 2: Chef will buy 1 orange by paying 1 gold coin and will have 5 apples and 3 oranges.	["for _ in range(int(input())):\n a,o,g=map(int,input().split())\n while g>0:\n if a<o:\n a+=1\n g-=1\n elif o<a:\n o+=1\n g-=1\n else:\n break\n print(abs(a-o))", "# cook your dish here\ntest_case = int(input())\nfor i in range(test_case):\n apple ,orange ,coin = map(int,input().split())\n k = abs(apple - orange)\n if(k >= coin):\n print(k - coin)\n else:\n print(0)", "# cook your dish here\nfor i in range(int(input())):\n a,b,k=list(map(int,input().split()))\n k1=abs(a-b)\n if(k1>=k):\n print(k1-k)\n else:\n print(0)\n", "t=int(input())\nfor i in range(t):\n n, m, k=list(map(int, input().split()))\n k1=abs(n-m)\n if k<=k1:\n print(k1-k)\n else:\n print(0)\n \n", "# cook your dish here\nt=int(input())\nfor i in range(t):\n n,m,k=list(map(int,input().split()))\n if(n>m):\n ma=n\n mi=m\n d=n-m\n elif(m>n):\n ma=m\n mi=n\n d=m-n\n else:\n d=0\n if(d<=k):\n print(0)\n else:\n mi=mi+k\n print(ma-mi)\n", "# cook your dish here\nfor _ in range(int(input())):\n a,m,g=[int(x) for x in input().split()]\n r=abs(a-m)\n if g<=r:\n print(r-g)\n else:\n print(0)", "# cook your dish here\nfor _ in range(int(input())):\n a,m,g=[int(x) for x in input().split()]\n r=abs(a-m)\n if g<=r:\n print(r-g)\n else:\n print(0)", "# cook your dish here\nt = int(input())\nfor i in range(t):\n a,b,c=[int(x) for x in input().split()]\n y= min(a,b)\n z=max(a,b)\n if y+c >= z :\n print(0)\n else:\n print(z-(y+c))", "# cook your dish here\nN = int(input())\nfor i in range(N):\n n,m,k=[int(x) for x in input().split()]\n y= min(n,m)\n z=max(n,m)\n if y+k >= z :\n print(0)\n else:\n print(z-(y+k))", "N = int(input())\nfor i in range(N):\n n,m,k=[int(x) for x in input().split()]\n y= min(n,m)\n z=max(n,m)\n if y+k >= z :\n print(0)\n else:\n print(z-(y+k))", "# cook your dish here\nn=int(input())\nfor i in range(n):\n n,m,k=list(map(int,input().split()))\n if n==m:\n print(0)\n elif n>m:\n c=(n-m-k)\n if c<=0:\n print(0)\n else:\n print(c)\n\n else:\n c=m-n-k\n if c<=0:\n print(0)\n else:\n print(c)\n\n", "# cook your dish here\nt=int(input())\nfor i in range(0,t):\n arr=list(map(int,input().split()))\n n=arr[0]\n m=arr[1]\n k=arr[2]\n if m>n:\n n,m=m,n\n diff=n-m;\n if diff==k:\n print(0)\n elif diff>k:\n print(diff-k)\n else:\n print(0)\n\n", "# cook your dish here\nfor i in range(int(input())):\n n,m,k=map(int,input().split())\n if abs(n-m)<=k:\n print(0)\n else:\n print(abs(n-m)-k)", "for _ in range(int(input())):\n x, y, z= map(int, input().split())\n if abs(x-y)<=z:\n print(0)\n else:\n print(abs(x-y)-z)", "# cook your dish here\nx = int(input())\nfor i in range(x):\n (a, b, c) = map(int, input().split())\n if abs(a-b)==c or abs(a-b)<c:\n print(\"0\")\n elif abs(a-b)>c:\n print(abs(a-b)-c)", "t=int(input())\nfor i in range(t):\n a,o,g=map(int,input().split())\n diff=abs(a-o)\n if diff<=g:\n print(0)\n else:\n print(diff-g)", "# cook your dish here\nT = int(input())\n\nfor t in range(T):\n apples, oranges, coins = input().split()\n apples = int(apples)\n oranges = int(oranges)\n coins = int(coins)\n while coins > 0:\n if apples > oranges:\n oranges += 1 \n coins -= 1\n elif oranges > apples:\n apples += 1\n coins -= 1\n else:\n if coins % 2 == 0:\n half = int(coins / 2)\n apples = apples + half\n oranges = oranges + half\n coins = 0\n break\n else:\n half = int(coins / 2)\n #coins = coins - half\n apples = apples + half\n oranges = oranges + half\n coins = 1\n break\n print(int(abs(apples-oranges))) \n #print(int(apples - oranges) if apples >= oranges else int(oranges - apples\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0))\n", "try:\n for _ in range(int(input())):\n a,o,g=map(int,input().split())\n res=abs(a-o)\n if(res>g):\n print(res-g)\n else:\n print(0)\nexcept:\n pass", "# cook your dish here\nfor _ in range(int(input())):\n a,b,k=list(map(int,input().split()))\n if(max(a,b)-min(a,b)-k)<=0:\n print(\"0\")\n else :\n print(max(a,b)-min(a,b)-k)\n", "# cook your dish here\nN=int(input())\nfor i in range(N):\n m,o,k=list(map(int,input().split()))\n d=abs(m-o)\n if(k>d):\n print(0)\n else:\n print(d-k)\n", "t=int(input())\nfor i in range(t):\n n,m,k=map(int,input().split())\n diff=abs(n-m)\n \n if(k>diff):\n print(0)\n else:\n print(diff-k)", "import math\n\ndef makeeql(a,o,g):\n print(abs(max(a,o) - min((min(a,o)+g),max(a,o))))\n \nfor i in range(int(input())):\n a,o,g = map(int,input().split())\n makeeql(a,o,g)", "t=int(input())\nfor i in range(t):\n n,m,k=list(map(int,input().split()))\n d=abs(n-m)\n if k>=d:\n print(\"0\")\n else:\n print((d-k))# cook your dish here\n"]	{"inputs": [["3", "3 4 1", "5 2 1", "3 4 3"]], "outputs": [["0", "2", "0"]]}	INTERVIEW	PYTHON3	CODECHEF	4,658
23280361291787657f4a9124a344f7c5	UNKNOWN	After acquiring an extraordinary amount of knowledge through programming contests, Malvika decided to harness her expertise to train the next generation of Indian programmers. So, she decided to hold a programming camp. In the camp, she held a discussion session for n members (n-1 students, and herself). They are sitting in a line from left to right numbered through 1 to n. Malvika is sitting in the nth spot. She wants to teach m topics of competitive programming to the students. As the people taking part in the camp are all newbies, they know none of the topics being taught, i.e., initially, the first n - 1 people in the line know none of the topics, while the nth knows all of them. It takes one hour for a person to learn a topic from his neighbour. Obviously, one person cannot both teach a topic as well as learn one during the same hour. That is, in any particular hour, a person can either teach a topic that he knows to one of his neighbors, or he can learn a topic from one of his neighbors, or he can sit idly. It is also obvious that if person x is learning from person y at a particular hour, then person y must be teaching person x at that hour. Also, note that people can work parallely too, i.e., in the same hour when the 4th person is teaching the 3rd person, the 1st person can also teach the 2nd or learn from 2nd. Find out the minimum number of hours needed so that each person learns all the m topics. -----Input----- - The first line of input contains a single integer T denoting number of test cases. - The only line of each test case contains two space separated integers n, m as defined in the statement. -----Output----- - For each test case, output a single integer in a line corresponding to the answer of the problem. -----Constraints----- - 1 ≤ T, n, m ≤ 100 -----Example----- Input: 2 2 1 3 2 Output: 1 4 -----Explanation----- In the first example, there are two people. Second person is Malvika and she has to teach only one topic to the first person. It will take only one hour to do so. In the second example, there are three people. The 3rd person is Malvika and she has to teach only two topics to 1st and 2nd person. In the 1st hour, she teaches the 1st topic to the 2nd person. Now, in the 2nd hour, the 2nd person will teach the 1st topic to the 1st person. In the 3rd hour, Malvika will teach the 2nd topic to the 2nd person. Now the 2nd person will teach that topic to the 1st in the 4th hour. So, it takes a total of 4 hours for all the people to know all the topics.	["for _ in range(int(input())):\n n,m=map(int, input().split())\n if n==1:\n print(0)\n elif n==2:\n print(m)\n else:\n print(m2+n-3)", "# cook your dish here\nfor i in range(int(input())):\n n,m=list(map(int,input().split()))\n if(n==1):\n print(0)\n continue\n if(n==2):\n print(m)\n continue\n ans=(n-1)+2(m-1)\n print(ans)\n \n", "for i in range(int(input())):\n n,m=list(map(int,input().split()))\n if(n==1):\n print(0)\n continue\n if(n==2):\n print(m)\n continue\n ans=(n-1)+2(m-1)\n print(ans)\n \n", "def main():\n for _ in range(int(input())):\n (m,n) = map(int, input().split())\n if m==1:\n print(0)\n continue\n if m==2:\n print(n)\n continue\n a=(m-1) + 2 (n-1)\n print(a)\n\ndef __starting_point():\n main()\n__starting_point()", "T = int(input())\nfor i in range(T):\n n, m = input().split(\" \")\n n = int(n)\n m = int(m)\n if(n==1): \n print(0)\n elif(n==2):\n print(m) \n else:\n print(n+2*m - 3)"]	{"inputs": [["2", "2 1", "3 2"]], "outputs": [["1", "4"]]}	INTERVIEW	PYTHON3	CODECHEF	951
5d47b3882a803cac37f16067d7ef17c2	UNKNOWN	Find out the maximum sub-array of non negative numbers from an array. The sub-array should be continuous. That is, a sub-array created by choosing the second and fourth element and skipping the third element is invalid. Maximum sub-array is defined in terms of the sum of the elements in the sub-array. Sub-array A is greater than sub-array B if sum(A) > sum(B). NOTE 1 :If there is a tie, then compare with segment's length and return segment which has maximum length NOTE 2: If there is still a tie, then return the segment with minimum starting index. -----Input----- The first line contains the number of test cases. Each test cases contains an integer N. next line consists of N integers, the elements of the array. -----Output----- Print out the maximum sub-array as stated above. -----Constraints----- - 1 ≤ T ≤ 100 - 1 ≤ N ≤ 105 - 1 ≤ Ai ≤ 105 -----Example----- Input: 1 6 1 2 5 -7 2 3 Output: 1 2 5	["for t in range(int(input())):\n n=int(input())\n a=list(map(int,input().split()))\n s=0\n l=[]\n for i in range(n):\n if (a[i]<0):\n e=i\n ss=sum(a[s:e])\n l.append((ss,e-s,n-s))\n s=i+1\n e=n\n ss=sum(a[s:e])\n l.append((ss,e-s,n-s))\n x=max(l)\n s=n-x[2]\n e=x[1]+s\n for i in range(s,e):\n print(a[i], end=' ')\n print(\"\")"]	{"inputs": [["1", "6", "1 2 5 -7 2 3"]], "outputs": [["1 2 5"]]}	INTERVIEW	PYTHON3	CODECHEF	341
57e690aa51999fd187b4c3e834b4bf88	UNKNOWN	Chef found a strange string yesterday - a string of signs s, where each sign is either a '<', '=' or a '>'. Let N be the length of this string. Chef wants to insert N + 1 positive integers into this sequence and make it valid. A valid sequence is a sequence where every sign is preceded and followed by an integer, and the signs are correct. That is, if a sign '<' is preceded by the integer a and followed by an integer b, then a should be less than b. Likewise for the other two signs as well. Chef can take some positive integers in the range [1, P] and use a number in the range as many times as he wants. Help Chef find the minimum possible P with which he can create a valid sequence. -----Input----- The first line of the input contains an integer T denoting the number of test cases. The description of T test cases follows. The only line of each test case contains the string of signs s, where each sign is either '<', '=' or a '>'. -----Output----- For each test case, output a single line containing an integer corresponding to the minimum possible P. -----Constraints----- - 1 ≤ T, \|s\| ≤ 105 - 1 ≤ Sum of \|s\| over all test cases in a single test file ≤ 106 -----Subtasks----- Subtask #1 (30 points) - 1 ≤ T, \|s\| ≤ 103 - 1 ≤ Sum of \|s\| over all test cases in a single test file ≤ 104 Subtask #2 (70 points) - Original constraints -----Example----- Input: 4 <<< <>< <=> <=< Output: 4 2 2 3 -----Explanation----- Here are some possible valid sequences which can be formed with the minimum P for each of the test cases: 1 < 2 < 3 < 4 1 < 2 > 1 < 2 1 < 2 = 2 > 1 1 < 2 = 2 < 3	["for _ in range(int(input())):\n st=input().replace(\"=\",\"\")\n if not len(st):print(1)\n else:\n cu=mx=1\n for j in range(1,len(st)):\n if st[j]==st[j-1]:cu+=1\n else:mx=max(mx,cu);cu=1\n print(max(mx+1,cu+1))\n", "r=int(input())\nfor z in range(r):\n s=input()\n s=s.replace('=','')\n l=list(s)\n final=0\n ans=0\n if(len(l))==0:\n print(1)\n else:\n for i in range(1,len(l)):\n if(l[i]==l[i-1]):\n ans=ans+1\n else:\n if(final<ans):\n final=ans\n ans=0\n if(final<ans):\n final=ans\n print(final+2)\n \n", "# cook your dish here\ndef solve(s):\n temp = []\n for c in s:\n if c != '=':\n temp.append(c)\n \n count = 1\n ans = 1\n # print(temp)\n if temp:\n for i in range(1, len(temp)):\n if temp[i] == temp[i-1]:\n count += 1\n # print(i, count)\n else:\n ans = max(ans, count);\n count = 1\n ans = max(ans, count);\n print(ans+1)\n else:\n print(1)\n \nn = int(input())\nfor i in range(n):\n s = input().strip()\n solve(s)", "for _ in range(int(input())):\n l=list(input())\n temp=['<','=']\n fg,c=0,0\n ans1,ans2=0,0\n for i in range(len(l)):\n if l[i] in temp:\n fg=1\n if l[i]=='<':\n c+=1\n elif fg==1:\n ans1=max(ans1,c)\n fg=0\n c=0\n if fg==1:\n ans1 = max(ans1, c)\n ans1+=1\n temp=['>','=']\n fg,c=0,0\n for i in range(len(l)):\n if l[i] in temp:\n fg=1\n if l[i]=='>':\n c+=1\n elif fg==1:\n ans2=max(ans2,c)\n fg=0\n c=0\n if fg==1:\n ans2 = max(ans2, c)\n ans2+=1\n print(max(ans1,ans2))", "t=int(input())\nfor z in range(t):\n s=input()\n j=1\n ans=1\n a=[]\n for i in s:\n if i!='=':\n a.append(i)\n if len(a)== 0 :\n print(1)\n continue\n for i in range(len(a)-1):\n if a[i]==a[i+1]:\n j+=1\n ans=max(ans,j)\n else:\n j=1\n print(ans+1)\n", "t=int(input())\nfor z in range(t):\n s=input()\n j=1\n ans=0\n a=[]\n for i in s:\n if i!='=':\n a.append(i)\n \n for i in range(len(a)-1):\n if a[i]==a[i+1]:\n j+=1\n ans=max(ans,j)\n else:\n j=1\n\n print(ans+1)\n", "# cook your dish here\nimport math\nt=0\ntry:\n t = int(input())\nexcept EOFError as e : pass\nfor _ in range(t):\n myStr = input().replace('=', '')\n if len(myStr) == 0 :\n print(1)\n continue\n ans = 0\n count = 1\n for k in range(len(myStr)-1):\n if myStr[k] == myStr[k+1]:\n count +=1\n else:\n ans = max(count, ans)\n count = 1\n ans = max(count, ans)\n print(ans+1)\n \n", "# cook your dish here\nimport math\nt=0\ntry:\n t = int(input())\nexcept EOFError as e : pass\nfor _ in range(t):\n # myStr = input().replace('=', '')\n # if len(myStr) == 0 :\n # print(1)\n # continue\n # ans = 0\n # count = 1\n # for k in range(len(myStr)-1):\n # if myStr[k] == myStr[k+1]:\n # count +=1\n # else:\n # ans = max(count, ans)\n # count = 1\n # ans = max(count, ans)\n # print(ans+1)\n s=input().replace('=','')\n if len(s)==0:\n print(1)\n continue\n ans,count=0,1\n for i in range(len(s)-1):\n if s[i]==s[i+1]:\n count+=1\n else:\n ans=max(ans,count)\n count=1\n ans=max(count,ans)\n print(ans+1)\n", "# cook your dish here\nimport math\nt=0\ntry:\n t = int(input())\nexcept EOFError as e : pass\nfor i in range(t):\n myStr = input().replace('=', '')\n if len(myStr) == 0 :\n print(1)\n continue\n ans = 0\n count = 1\n for k in range(len(myStr)-1):\n if myStr[k] == myStr[k+1]:\n count +=1\n else:\n ans = max(count, ans)\n count = 1\n ans = max(count, ans)\n print(ans+1)\n", "# cook your dish here\nimport math\nt=0\ntry:\n t = int(input())\nexcept EOFError as e : pass\nfor i in range(t):\n myStr = input().replace('=', '')\n if(len(myStr) == 0):\n print(1)\n continue\n ans = 0\n count = 1\n for k in range(len(myStr)-1):\n if(myStr[k] == myStr[k+1]):\n count +=1\n else:\n ans = max(count, ans)\n count = 1\n ans = max(count, ans)\n print(ans+1)\n", "# cook your dish here\nimport math\nt=0\ntry:\n t = int(input())\nexcept EOFError as e : pass\nfor i in range(t):\n myStr = input().replace('=', '')\n if(len(myStr) == 0):\n print(1)\n continue\n ans = 0\n count = 1\n for k in range(len(myStr)-1):\n if(myStr[k] == myStr[k+1]):\n count +=1\n else:\n count = 1\n ans = max(count, ans)\n print(ans+1)\n", "x=int(input())\nfor _ in range(x):\n n=input()\n lol=[]\n for i in n:\n if i!=\"=\":\n lol.append(i)\n n=\"\".join(lol) \n l=0\n if len(n)>0:\n l+=1\n c=1\n for i in range(1,len(n)):\n if n[i]==n[i-1]:\n c+=1\n else:\n #print(c,l,i)\n l=max(l,c)\n c=1\n l=max(l,c) \n print(l+1)", "T = int(input())\n\nfor i in range(T):\n x = input().replace(\"=\", \"\")\n max_right = 0\n max_left = 0\n curr_right = 0\n curr_left = 0\n right = False\n left = False\n\n for j in x:\n if j == \">\":\n curr_right += 1\n if not right:\n right = True\n\n if left:\n left = False\n if max_left < curr_left:\n max_left = curr_left\n\n curr_left = 0\n\n elif j == \"<\":\n curr_left += 1\n if not left:\n left = True\n\n if right:\n right = False\n if max_right < curr_right:\n max_right = curr_right\n\n curr_right = 0\n\n if curr_left > max_left: max_left = curr_left\n if curr_right > max_right: max_right = curr_right\n\n print(max(max_right, max_left) + 1)\n", "t=int(input())\nfor _ in range(t):\n s=input().replace('=','')\n if len(s)==0:\n print(1)\n continue\n ans,count=0,1\n for i in range(len(s)-1):\n if s[i]==s[i+1]:\n count+=1\n else:\n ans=max(ans,count)\n count=1\n ans=max(count,ans)\n print(ans+1)", "for _ in range(int(input())):\n q=input()\n x=0\n o=0\n y=[]\n z=-1\n c=-1\n for ii in range(len(q)):\n if(q[ii]!='='):\n y.append(q[ii])\n for i in range(len(y)):\n if(y[i]=='>')and(o==0):\n x+=1\n elif(y[i]=='<')and(x==0):\n o+=1\n else:\n if(z<o):\n z=o\n if(c<x):\n c=x\n if(y[i]=='>'):\n x=1\n o=0\n if(y[i]=='<'):\n o=1\n x=0\n if(z<o):\n z=o\n if(c<x):\n c=x\n print(max(z,c,0)+1)\n", "for _ in range(int(input())):\n q=input()\n x=0\n o=0\n y='='+q\n z=-1\n c=-1\n for i in range(1,len(y)):\n if(y[i]=='>')and(y[i-1]=='=' or y[i-1]=='>' ):\n x+=1\n elif(y[i]=='<')and(y[i-1]=='=' or y[i-1]=='<' ):\n o+=1\n elif(y[i]=='='):\n continue\n else:\n if(z<o):\n z=o\n if(c<x):\n c=x\n if(y[i]=='>'):\n x=1\n o=0\n if(y[i]=='<'):\n o=1\n x=0\n if(z<o):\n z=o\n if(c<x):\n c=x\n print(max(z,c,0)+1)\n", "for _ in range(int(input())):\n q=input()\n x=0\n o=0\n y='='+q\n z=-1\n c=-1\n for i in range(1,len(y)):\n if(y[i]=='>')and(y[i-1]=='=' or y[i-1]=='>' ):\n x+=1\n elif(y[i]=='<')and(y[i-1]=='=' or y[i-1]=='<' ):\n o+=1\n elif(y[i]=='='):\n continue\n else:\n if(z<o):\n z=o\n if(c<x):\n c=x\n if(y[i]=='>'):\n x=1\n o=0\n if(y[i]=='<'):\n o=1\n x=0\n if(z<o):\n z=o\n if(c<x):\n c=x\n print(max(z,c)+1)\n", "for _ in range(int(input())):\n q=input()\n x=0\n o=0\n y='='+q\n z=-1\n c=-1\n for i in range(1,len(y)):\n if(y[i]=='>')and(y[i-1]=='=' or y[i-1]=='>' ):\n x+=1\n elif(y[i]=='<')and(y[i-1]=='=' or y[i-1]=='<' ):\n o+=1\n else:\n if(z<o):\n z=o\n if(c<x):\n c=x\n if(y[i]=='>'):\n x=1\n o=0\n if(y[i]=='<'):\n o=1\n x=0\n if(z<o):\n z=o\n if(c<x):\n c=x\n print(max(z,c)+1)\n", "# cook your dish here\nimport math\nt=int(input())\nwhile(t>0):\n l=[]\n s1=input()\n s=\"\"\n for i in s1:\n if i!=\"=\":\n s=s+i\n max=-99999\n sum=0\n for i in range(0,len(s)-1):\n if(s[i]!=\"=\"):\n sum=sum+1\n #print(\"here\",sum)\n if s[i] != s[i+1]:\n #print(sum)\n if sum>max:\n max=sum\n sum=0\n if len(s)>1 and s[i]!=\"=\":\n if sum+1>max:\n max=sum+1\n if len(s)==1 and s[0]!=\"=\":\n max=1\n if max==-99999:\n print(1)\n else:\n print(max+1)\n t=t-1"]	{"inputs": [["4", "<<<", "<><", "<=>", "<=<"]], "outputs": [["4", "2", "2", "3"]]}	INTERVIEW	PYTHON3	CODECHEF	7,711
f45801f89c02c42f37a9ab3f5f8a1e47	UNKNOWN	You came across this story while reading a book. Long a ago when the modern entertainment systems did not exist people used to go to watch plays in theaters, where people would perform live in front of an audience. There was a beautiful actress who had a disability she could not pronounce the character $'r'$. To win her favours which many have been denied in past, you decide to write a whole play without the character $'r'$. Now you have to get the script reviewed by the editor before presenting it to her. The editor was flattered by the script and agreed to you to proceed. The editor will edit the script in this way to suit her style. For each word replace it with a sub-sequence of itself such that it contains the character 'a'. A subsequence is a sequence that can be derived from another sequence by deleting some or no elements without changing the order of the remaining elements Wikipedia Now given a script with $N$ words, for each word in the script you wish to know the number of subsequences with which it can be replaced. -----Input:----- - First-line will contain $N$, the number of words in the script. Then next $N$ line with one test case each. - Each test case contains a single word $W_i$ -----Output:----- For each test case, output in a single line number of subsequences with which it can be replaced. -----Constraints----- - $1 \leq N \leq 1000$ - $1 \leq$ length of $W_i$ $\leq 20$ - $W_i$ on contains lowercase english alphabets and does not have the character 'r' -----Sample Input 1:----- 2 abc aba -----Sample Output 1:----- 4 6 -----EXPLANATION:----- This subsequences with which $abc$ can be replaed : ${a,ab,ac,abc}$. This subsequences with which $aba$ can be replaed : ${a,ab,aba,a,ba,a}$. -----Sample Input 2:----- 3 abcde abcdea xyz -----Sample Output 2:----- 16 48 0	["for _ in range(int(input())):\r\n S = input()\r\n n = len(S)\r\n a = n - S.count('a')\r\n print(2 n - 2 a)", "for _ in range(int(input())):\n s=input()\n n=len(s)\n c=s.count('a')\n l=n-c\n print(pow(2,n)-pow(2,l))\n\n", "for _ in range(int(input())):\n s=input()\n n=len(s)\n c=s.count('a')\n l=n-c\n print(pow(2,n)-pow(2,l))\n\n", "try:\r\n t = int(input())\r\n for _ in range(t):\r\n s = input()\r\n acount = 0\r\n for i in s:\r\n if i == \"a\":\r\n acount+=1\r\n p = len(s) - acount\r\n base = 2*(acount) - 1\r\n print(base 2(p))\r\nexcept:\r\n pass", "# cook your dish here\nt=int(input())\nfor _ in range(t):\n stringa=input()\n a=0\n counter=0\n for char in stringa:\n if char=='a':\n a+=1 \n print(2(len(stringa)-a)(2a-1))\n", "# cook your dish here\n# code by RAJ BHAVSAR\nimport sys\ndef get_ints(): return map(int, sys.stdin.readline().strip().split())\ndef get_list(): return list(map(int, sys.stdin.readline().strip().split()))\ndef get_string(): return sys.stdin.readline().strip()\ndef get_int(): return int(sys.stdin.readline().strip())\ndef get_print_int(x): sys.stdout.write(str(x) + '\\n')\ndef get_print(x): sys.stdout.write(x + '\\n')\n\ndef solve():\n\tfor _ in range(get_int()):\n\t\ts = get_string()\n\t\tn = len(s)\n\t\tcount = 0\n\t\tfor i in s:\n\t\t\tif(i == 'a'):\n\t\t\t\tcount += 1\n\t\tget_print_int((2n - 1) - (2(n-count) - 1))\nsolve()", "n=int(input())\nfor _ in range(n):\n c=0\n s=input()\n for i in s:\n if i=='a':\n c+= 1 \n print((2len(s)-2(len(s)-c)))# cook your dish here\n", "# def count(a, b): \n# \tm = len(a);n = 1\n# \tlookup = [[0] (n + 1) for i in range(m + 1)] \n# \tfor i in range(n+1): lookup[0][i] = 0\n# \tfor i in range(m + 1): lookup[i][0] = 1\n# \tfor i in range(1, m + 1): \n# \t\tfor j in range(1, n + 1): \n# \t\t\tif a[i - 1] == b[j - 1]: lookup[i][j] = lookup[i - 1][j - 1] + lookup[i - 1][j]\n# \t\t\telse: lookup[i][j] = lookup[i - 1][j] \n# \treturn lookup[m][n]\n# for _ in range(int(input())):\n# \ta = input()\n# \tb = \"a\"\n# \tprint(count(a, b)) #this just counts the number of times a string occurs, nut the subsequences\n#>>> if there are only a's, then answer is (2len) - 1\n#>>> if there are len - 1 a's and one diff, then answer is (2len) - 2\n#>>> if there are len - 1 diff's and one a, then answer is 2(len - 1)\n#>>> if there are all diff, then answer is 0\n#>>> there has to be a direct relation somewhere...gottit..if there are equal a's and diffs, then answer is 2len - 2(len/2)\n#>>> wait a minute...2len - 2(len/2) this works for inequalities also (?)\nfor _ in range(int(input())):\n\ta = input();count = 0\n\tfor i in a:\n\t\tif(i != \"a\"): count += 1\n\tprint(2len(a) - 2*count)", "from math import factorial as fact\nfrom itertools import combinations\nfor _ in range(int(input())):\n a=input()\n if \"a\" not in a:\n print(0)\n continue\n ct=a.count(\"a\")\n ct=\"a\"ct\n a=a.replace(\"a\",\"\")\n count=0\n for i in range(1,len(a)+1):\n count+=(fact(len(a))/(fact(i)(fact(len(a)-i))))\n ctcount=0\n for i in range(1,len(ct)+1):\n ctcount+=len(list(combinations(ct,i)))\n print(int(count)ctcount+ctcount)", "# cook your dish here\ndef power(a,b):\n\tif(b==0):\n\t\treturn 1\n\tif(b==1):\n\t\treturn a\n\tif(b%2==1):\n\t\treturn (power(a,b-1)a)\n\tx=power(a,b/2)\n\treturn (xx)\nt=int(input())\nwhile(t>0):\n s=input()\n b=s.count(\"a\")\n n=len(s)\n if(b==0):\n print(0)\n else:\n c=n-b\n print(power(2,n)-power(2,c))\n t-=1\n \n\n", "# cook your dish here\nn = int(input())\nfor i in range(n):\n w = input()\n l = len(w)\n s = 0\n a = 0\n for i in w:\n if i == 'a':\n a += 1\n s += 2(l-a)\n print(s)", "# cook your dish here\nfor u in range(int(input())):\n s=input()\n n=len(s)\n x=s.count('a')\n z=n-x\n s=2x-1\n c=2*z\n print(sc)\n"]	{"inputs": [["2", "abc", "aba"]], "outputs": [["4", "6"]]}	INTERVIEW	PYTHON3	CODECHEF	4,133
69c84e3586a6ca4d1eeb928675793992	UNKNOWN	Not everyone probably knows that Chef has younder brother Jeff. Currently Jeff learns to read. He knows some subset of the letter of Latin alphabet. In order to help Jeff to study, Chef gave him a book with the text consisting of N words. Jeff can read a word iff it consists only of the letters he knows. Now Chef is curious about which words his brother will be able to read, and which are not. Please help him! -----Input----- The first line of the input contains a lowercase Latin letter string S, consisting of the letters Jeff can read. Every letter will appear in S no more than once. The second line of the input contains an integer N denoting the number of words in the book. Each of the following N lines contains a single lowecase Latin letter string Wi, denoting the ith word in the book. -----Output----- For each of the words, output "Yes" (without quotes) in case Jeff can read it, and "No" (without quotes) otherwise. -----Constraints----- - 1 ≤ \|S\| ≤ 26 - 1 ≤ N ≤ 1000 - 1 ≤ \|Wi\| ≤ 12 - Each letter will appear in S no more than once. - S, Wi consist only of lowercase Latin letters. -----Subtasks----- - Subtask #1 (31 point): \|S\| = 1, i.e. Jeff knows only one letter. - Subtask #2 (69 point) : no additional constraints -----Example----- Input:act 2 cat dog Output:Yes No -----Explanation----- The first word can be read. The second word contains the letters d, o and g that aren't known by Jeff.	["knows=input()\nn=eval(input())\nwhile n!=0:\n n=n-1\n word=input()\n for x in word:\n ctr=0\n for y in knows:\n if x==y:ctr=ctr+1;break\n if ctr==0:print('No');break\n else: print('Yes')", "import collections\n\ndef alphabet():\n s = input()\n d = collections.defaultdict(lambda : 0)\n for i in s:\n d[i]+=1\n n = int(input())\n for i in range(n):\n w = input()\n flag = True\n for i in w:\n if i not in d:\n print(\"No\")\n flag = False\n break\n if flag:\n print(\"Yes\")\n\n\nalphabet()\n\n", "import collections\n\ndef alphabet():\n s = input()\n d = collections.defaultdict(lambda : 0)\n for i in s:\n d[i]+=1\n n = int(input())\n for i in range(n):\n w = input()\n flag = True\n for i in w:\n if i not in d:\n print(\"No\")\n flag = False\n break\n if flag:\n print(\"Yes\")\n\n\nalphabet()\n\n", "s1 = input()\nfor i in range(int(input())):\n s2 = input()\n a= ''.join(sorted(s1))\n c= ''.join(set(s2))\n b= ''.join(sorted(c))\n if b in a and len(b)<=len(a):\n print('Yes')\n else:\n print('No')", "s1 = input()\nfor i in range(int(input())):\n s2 = input()\n a= ''.join(sorted(s1))\n c= ''.join(set(s2))\n b= ''.join(sorted(c))\n if b in a and len(c)<=len(a):\n print('Yes')\n else:\n print('No')", "s1 = input()\nfor i in range(int(input())):\n s2 = input()\n a= ''.join(sorted(s1))\n c= ''.join(set(s2))\n b= ''.join(sorted(c))\n if b in a:\n print('Yes')\n else:\n print('No')", "s = input()\nn = eval(input())\nfor i in range(n):\n w = input()\n cnt = 0\n for j in range(len(w)):\n if(w[j] in s):\n cnt+=1\n \n if(cnt == len(w)):\n print(\"Yes\")\n else:\n print(\"No\")", "# book = ''.join(sorted(str(raw_input())))\nbook = input()\n\n\nfor i in range(0, int(input())):\n words = str(input())\n check = 0\n for letter in sorted(words):\n if letter in book:\n check = check + 1\n\n if check == len(words):\n print(\"Yes\")\n else:\n print(\"No\")\n", "# cook your code here\nalf = input()\n\nn = int(input())\nfor _ in range(n):\n yes = 1\n x = input()\n for c in x:\n if(alf.find(c) == -1):\n yes = 0\n break\n if yes:print(\"Yes\")\n else:print(\"No\")", "l1 = input().lower()\nlang_set = set([x.lower() for x in l1 if x.isalpha() ])\nl2 = set([x for x in l1 if l1.count(x)>1])\n\nno_cases = int(input())\n# if(len(l2)>0):\n# for i in xrange(no_cases):\n# word = raw_input()\n# print \"No\"\n# else :\nfor i in range(no_cases):\n word = input().lower()\n word_set = set([x.lower() for x in word if x.isalpha() ])\n fl =word_set.issubset(lang_set)\n if(fl) :\n print(\"Yes\")\n else :\n print(\"No\")", "\ndef correct_string(s):\n a = set(s)\n if len(a) == len(s):\n return 1\n return 0\n\ns = input()\nif correct_string(s):\n s = sorted(s)\n s1 = \"\".join(s)\n n = int(input())\n if (n >= 1 and n <= 1000):\n for x in range(0,n):\n v = input()\n v = set(v)\n lw = len(v)\n if lw >= 1 and lw <= 12:\n v = sorted(v)\n s2 = \"\".join(v)\n if s1 == s2:\n print(\"Yes\")\n else:\n print(\"No\")\n pass", "s = input()\nn = int(input())\nt = []\nfor _ in range(n):\n a = input()\n t.append(a)\n\nfor i in t:\n flag = True\n for j in i:\n if j not in s:\n flag = False\n break\n if(flag):\n print(\"Yes\")\n else:\n print(\"No\")\n", "s=input().lower()\nfor _ in range(int(input())):\n st=input().lower()\n \n if(set(st)==set(s)):\n print(\"Yes\")\n else:\n print(\"No\")\n \n \n \n \n", "s = input()\nn = int(input())\n\ndef find_str(word):\n nonlocal s\n for i in word:\n if i in s:\n pass\n else:\n return \"No\"\n return \"Yes\"\n\nwhile n :\n w = input()\n print(find_str(w))\n n = n - 1", "l=input()\nn=int(input())\nfor i in range(n):\n flag=0\n s=input()\n for j in range(len(s)):\n if(s[j] in l):\n flag=flag+1\n if(flag==len(s)):\n print(\"Yes\")\n else:\n print(\"No\")", "s = [0]*26\nq = input()\nfor i in q:\n s[ord(i)-97] = 1\nn = int(input())\nwhile(n):\n e = input()\n f = 1\n for i in e:\n if not (s[ord(i)-97]):\n f = 0\n break\n if(f):\n print(\"Yes\")\n else:\n print(\"No\")\n n -= 1", "letters=input()\nn=int(input())\nwords=list()\n\nfor i in range(n):\n word=input()\n words.append(word)\n\nfor word in words:\n l=list(word)\n i=0\n for letter in l:\n if letter in letters:\n continue\n else:\n print(\"No\")\n i=1\n break\n\n if i==0:\n print(\"Yes\")\n i=0\n", "s=input()\nfor _ in range(int(input())):\n st=input()\n if(s.islower() and st.islower()):\n if(set(st)==set(s)):\n print(\"Yes\")\n else:\n print(\"No\")\n else:\n print(\"No\")\n", "S = input()\nN = int(input())\nwhile N != 0:\n W = input()\n flag = 0\n for i in range(0, len(W)):\n if W[i] in S:\n continue\n else:\n flag = 1\n break\n if flag == 0:\n print(\"Yes\")\n else:\n print(\"No\")\n N -= 1\n"]	{"inputs": [["act", "2", "cat", "dog"]], "outputs": [["Yes", "No"]]}	INTERVIEW	PYTHON3	CODECHEF	4,775
ca1e568c157042d2a67c91b764d9aa3b	UNKNOWN	Chef has a calculator which has two screens and two buttons. Initially, each screen shows the number zero. Pressing the first button increments the number on the first screen by 1, and each click of the first button consumes 1 unit of energy. Pressing the second button increases the number on the second screen by the number which is currently appearing on the first screen. Each click of the second button consumes B units of energy. Initially the calculator has N units of energy. Now chef wonders what the maximum possible number is, that he gets on the second screen of the calculator, with the limited energy. -----Input----- The first line of the input contains an integer T denoting the number of test cases. Each test case is described using a single line containing two integers, N and B. -----Output----- For each test case, output a single line containing the answer to this test case. -----Constraints----- - 1 ≤ T ≤ 10,000 - 1 ≤ N, B ≤ 1,000,000,000 -----Subtasks----- - Subtask 1 (20 points): 1 ≤ N, B ≤ 1,000 - Subtask 2 (80 points): Original constraints -----Example----- Input: 3 10 2 8 5 6 1 Output: 12 3 9 -----Explanation----- Example case 1. There are 10 units of energy available. Pressing second button takes 2 units of energy. Chef can achieve 12 on the second screen as follows. - Press first button to get scores (1, 0). 9 units of energey is left. - Press first button to get scores (2, 0). 8 units of energy remaining. - Press first button to get scores (3, 0). 7 units of energy remaining. - Press first button to get scores (4, 0). 6 units of energy remaining. - Press second button to get scores (4, 4). 4 units of energy remaining. - Press second button to get scores (4, 8). 2 units of energy remaining. - Press second button to get scores (4, 12). 0 units of energy remaining.	["# cook your dish here\nfor i in range(int(input())):\n n,b=map(int,input().split())\n ans=round(n/(2b))(n-bround((n/(2b))));\n print(ans)", "import math\nn=int(input())\nfor i in range(n):\n a,b=list(map(int,input().split()))\n if a>b:\n a1=math.ceil(a/(2b))\n b1=a-a1b\n a2=math.floor(a/(2b))\n b2=a-a2b\n print(max(a1b1,a2b2))\n else:\n print(0)\n \n \n", "n=int(input())\nfor i in range(n):\n a,b=list(map(int,input().split()))\n if a>b:\n t=a//b\n max1=1\n ans=0\n while(t>=t/2):\n ans=(a-bt)t\n max1=max(ans,max1)\n t-=1\n print(max1)\n else:\n print(0)\n \n \n", "n=int(input())\nfor i in range(n):\n a,b=map(int,input().split())\n if a>b:\n t=a//b\n max1=1\n ans=0\n while(t>0):\n ans=(a-bt)t\n max1=max(ans,max1)\n t-=1\n print(max1)\n else:\n print(0)", "# cook your dish here\nt = int(input())\nfor i in range(t):\n # n for total energy, b for energy of second screen\n n,b = map(int,input().split(\" \"))\n num = n//b\n final = [i(n-bi) for i in range(num+1)]\n print(max(final))", "def function(x,n):\n if x>n:\n return 0\n return x(n-xb)\nfor _ in range(int(input())):\n n,b=list(map(int,input().split()))\n #print(n//(2b),n//(2b)+1)\n print(max((function(n//(2b),n),function(n//(2b)+1,n))))\n \n \n", "def closestNumber(n, m) : \n# Find the quotient \n q = int(n / m) \n \n# 1st possible closest number \n n1 = m * q \n \n# 2nd possible closest number \n if((n * m) > 0) : \n n2 = (m * (q + 1)) \n else : \n n2 = (m * (q - 1)) \n \n # if true, then n1 is the required closest number \n if (abs(n - n1) < abs(n - n2)) : \n return n1 \n \n # else n2 is the required closest number \n return n2 \n\nT = int(input())\nfor j in range(1, T+1):\n N, B = input().split()\n N = int(N)\n B = int(B)\n p = N % B\n k = N\n fs = 0\n maxim = 0\n \n print(int((N-closestNumber(int(N/2), B))(closestNumber(int(N/2), B))/B))\n \n \n", "T = int(input())\nfor j in range(1, T+1):\n N, B = input().split()\n N = int(N)\n B = int(B)\n p = N % B\n k = N\n fs = 0\n maxim = 0\n for i in range(p, N-B+1, B):\n N = k\n fs = 0\n ss = 0\n fs = fs + i\n N = N-i\n while (N>=B):\n ss = ss + fs\n N = N-B\n if ss > maxim:\n maxim = ss\n print(maxim)\n \n \n", "T = int(input())\nfor j in range(1, T+1):\n N, B = input().split()\n N = int(N)\n B = int(B)\n k = N\n fs = 0\n maxim = 0\n for i in range(1, N-B+1):\n N = k\n fs = 0\n ss = 0\n fs = fs + i\n N = N-i\n while (N>=B):\n ss = ss + fs\n N = N-B\n if ss > maxim:\n maxim = ss\n print(maxim)\n \n \n", "T = int(input())\nfor j in range(1, T+1):\n N, B = input().split()\n N = int(N)\n B = int(B)\n k = N\n fs = 0\n maxim = 0\n for i in range(1, N+1):\n N = k\n fs = 0\n ss = 0\n fs = fs + i\n N = N-i\n while (N>=B):\n ss = ss + fs\n N = N-B\n if ss > maxim:\n maxim = ss\n print(maxim)\n \n \n", "from math import \nfor j in range(int(input())):\n n,b=list(map(int,input().split()))\n a=n/(2b)\n a1=ceil(a)\n a2=floor(a)\n d=(n-a1b)a1\n e=(n-a2b)a2\n print(max(d,e))\n", "import math\ndef ushijima(x):\n return (n-bx)x\nt = int(input())\nfor i in range(t):\n (n,b) = (int(x) for x in input().split())\n y1 = math.floor((math.floor(n/2))/b)\n y2 = math.floor((math.ceil(n/2))/b)\n y3 = math.ceil((math.floor(n/2))/b)\n y4 = math.ceil((math.ceil(n/2))/b)\n if y1==0 and y2==0 and y3==0 and y4==0:\n print(\"0\")\n\n else:\n print(max(ushijima(y1),ushijima(y2),ushijima(y3),ushijima(y4)))", "from math import floor,ceil\nfor _ in range(int(input())):\n n,k=map(int,input().split())\n t1=ceil(ceil(n/2)/k)\n t2=ceil(floor(n/2)/k)\n t3=floor(ceil(n/2)/k)\n t4=floor(floor(n/2)/k)\n if not t1:t1=1\n if not t2:t2=1\n if not t3:t3=1\n if not t4:t4=1\n t1= int((n-kt1)t1)\n t2= int((n-kt2)t2)\n t3= int((n-kt3)t3)\n t4= int((n-kt4)t4)\n if t1<0 and t2<0 and t3<0 and t4<0:\n print(0)\n else:\n print(max(t1,t2,t3,t4))", "for _ in range(int(input())):\n n,k=list(map(int,input().split()))\n t1=-(-(n/2)//k)\n t2=(n/2)//k\n if not t1:t1=1\n if not t2:t2=1\n t1= int((n-kt1)t1)\n t2= int((n-kt2)*t2)\n if t1<0 and t2<0:\n print(0)\n else:\n print(max(t1,t2))\n\n"]	{"inputs": [["3", "10 2", "8 5", "6 1"]], "outputs": [["12", "3", "9"]]}	INTERVIEW	PYTHON3	CODECHEF	4,129
2dab08a1c24aa8d9e1ff58ee2e34672e	UNKNOWN	Chef has a circular sequence $A$ of $N$ non-negative integers $A_1, A_2, \ldots, A_N$ where $A_i$ and $A_{i+1}$ are considered adjacent, and elements $A_1$ and $A_N$ are considered adjacent. An operation on position $p$ in array $A$ is defined as replacing $A_p$ by the bitwise OR of elements adjacent to $A_p$. Formally, an operation is defined as: - If $p = 1$, replace $A_1$ with $A_N \| A_{2}$ - If $1 < p < N$, replace $A_p$ with $A_{p-1} \| A_{p+1}$ - If $p = N$, replace $A_N$ with $A_{N-1} \| A_1$ Here, '\|' denotes the bitwise OR operation. Now, Chef must apply operations at each position exactly once, but he may apply the operations in any order. Being a friend of Chef, you are required to find a sequence of operations, such that after applying all the $N$ operations, the bitwise OR of the resulting array is $K$, or determine that no such sequence of operations exist. -----Input:----- - The first line of the input contains a single integer $T$ denoting the number of test cases. The description of $T$ test cases follows. - The first line of each test case contains two space-separated integers $N$ and $K$ denoting the number of elements, and the required bitwise OR after operations. - The second line contains $N$ space-separated integers $A_1, A_2, \ldots, A_N$. -----Output:----- For each test case, if no valid sequence of operations exist, print -1. Otherwise, print $N$ space-separated integers in which $i$-th integer denote the position chosen in the $i$-th operation. If there are multiple valid sequences of operations, you may print any valid sequence. -----Constraints----- - $1 \le T \le 10^5$ - $3 \le N \le 2*10^5$ - $0 \le A_i, K \le 10^9$ - It's guaranteed that the total length of the arrays in one test file doesn't exceed $10^6$ -----Sample Input:----- 5 3 6 2 1 6 3 6 2 1 5 3 7 2 4 6 3 7 1 2 4 3 7 1 2 6 -----Sample Output:----- 2 1 3 -1 -1 -1 2 3 1 -----Explanation:----- In the first test case, initially, the sequence is {2, 1, 6}. - Chef applies the operation on the $2^{nd}$ index, so the sequence converts to {2, 6, 6}. - Next, Chef applies the operation on the $1^{st}$ index, so the sequence converts to {6, 6, 6}. - Next, Chef applies the operation on the $3^{rd}$ index, and this time sequence does not change. The final sequence is {6, 6, 6}, and bitwise OR of this sequence is $6$ that is equal to given $K$.	["t=int(input())\ndef check():\n pref = [0]n\n pref[0]=a[0]\n suff = [0]n\n suff[-1]=a[-1]\n for i in range (1,n):\n pref[i] = pref[i-1]\|a[i]\n suff[n-i-1] = suff[n-i]\|a[n-i-1]\n if suff[1]==k:\n return 0\n elif pref[n-2]==k:\n return n-1\n else:\n for i in range (1,n-1):\n if pref[i-1]\|suff[i+1] == k:\n return i\n return -1\nwhile(t):\n t-=1\n n,k=[int(i) for i in input().split()]\n a=[int(i) for i in input().split()]\n ans = []\n arr = [0]n\n for i in range (n):\n if k\|a[i] != k:\n a[i] = a[i-1]\|a[(i+1)%(n)]\n ans.append(i+1)\n arr[i]=1\n\n x = 0\n count = 0\n for i in range (n):\n x\|=a[i]\n \n if x!= k:\n print(-1)\n else:\n y = check()\n if y == -1:\n print(-1)\n else:\n for i in range (y,n+y):\n if arr[i%n]==0:\n arr[i%n]==1\n ans.append((i%n)+1)\n print(ans)", "# cook your dish here\ntests = int(input())\nfor _ in range(tests):\n n, k = [int(j) for j in input().split()]\n nums = [int(j) for j in input().split()]\n check = [(j - (j & k)) != 0 for j in nums]\n impossible = check[0] and check[-1]\n for i in range(n-1):\n impossible = impossible or (check[i] and check[i+1])\n if impossible:\n print(-1)\n elif sum(check) != 0:\n start = -1\n for i in range(-1,n-1):\n if check[i]:\n nums[i] = nums[i-1] \| nums[i+1]\n if start == -1:\n start = i+1\n for i in range(start,start+n):\n if not check[i%n]:\n nums[i%n] = nums[(i-1)%n] \| nums[(i+1)%n]\n answer = 0\n for i in range(n):\n answer = answer \| nums[i]\n if answer == k:\n for i in range(n):\n if check[i]:\n print(i+1, end = \" \")\n for i in range(start,start+n):\n if not check[i%n]:\n print(i%n+1, end = \" \")\n print(\"\")\n else:\n print(-1)\n else:\n for i in range(-1,n-1):\n if nums[i] == nums[i] & (nums[i-1] \| nums[i+1]):\n for j in range(i,i+n):\n nums[j%n] = nums[(j-1)%n] \| nums[(j+1)%n]\n answer = 0\n for j in range(n):\n answer = answer \| nums[j]\n if answer == k:\n for j in range(i,i+n):\n print((j+n)%n+1,end = \" \")\n print(\"\")\n else:\n print(-1)\n impossible = True\n break\n if not impossible:\n for i in range(n):\n ss = list(nums)\n for j in range(i,i+n):\n ss[j%n] = ss[(j+1)%n] \| ss[(j-1)%n]\n answer = 0\n for j in range(n):\n answer = answer \| ss[j]\n if answer == k:\n for j in range(i,i+n):\n print((j%n)+1,end=\" \")\n print(\"\")\n impossible = True\n break\n if not impossible:\n print(-1)\n ", "t=int(input())\ndef check():\n pref = [0]n\n pref[0]=a[0]\n suff = [0]n\n suff[-1]=a[-1]\n for i in range (1,n):\n pref[i] = pref[i-1]\|a[i]\n suff[n-i-1] = suff[n-i]\|a[n-i-1]\n if suff[1]==k:\n return 0\n elif pref[n-2]==k:\n return n-1\n else:\n for i in range (1,n-1):\n if pref[i-1]\|suff[i+1] == k:\n return i\n return -1\nwhile(t):\n t-=1\n n,k=[int(i) for i in input().split()]\n a=[int(i) for i in input().split()]\n ans = []\n arr = [0]n\n for i in range (n):\n if k\|a[i] != k:\n a[i] = a[i-1]\|a[(i+1)%(n)]\n ans.append(i+1)\n arr[i]=1\n\n x = 0\n count = 0\n for i in range (n):\n x\|=a[i]\n \n if x!= k:\n print(-1)\n else:\n y = check()\n if y == -1:\n print(-1)\n else:\n for i in range (y,n+y):\n if arr[i%n]==0:\n arr[i%n]==1\n ans.append((i%n)+1)\n print(ans)\n", "# cook your dish here\ndef check():\n pref = [0]n;pref[0]=a[0];suff = [0]n;suff[-1]=a[-1]\n for i in range (1,n):pref[i] = pref[i-1]\|a[i];suff[n-i-1] = suff[n-i]\|a[n-i-1]\n if suff[1]==k:return 0\n elif pref[n-2]==k:return n-1\n else:\n for i in range (1,n-1):\n if pref[i-1]\|suff[i+1] == k:return i\n return -1\nfor z in range(int(input())):\n n,k=[int(i) for i in input().split()];a=[int(i) for i in input().split()];ans,arr = [],[0]n\n for i in range (n):\n if k\|a[i] != k:a[i] = a[i-1]\|a[(i+1)%(n)];ans.append(i+1);arr[i]=1\n x = 0;count = 0\n for i in range (n):x\|=a[i] \n if x!= k:print(-1)\n else:\n y = check()\n if y == -1:print(-1)\n else:\n for i in range (y,n+y):\n if arr[i%n]==0:arr[i%n]==1;ans.append((i%n)+1)\n print(ans)", "# cook your dish here\ndef check():\n pref = [0]n;pref[0]=a[0];suff = [0]n;suff[-1]=a[-1]\n for i in range (1,n):pref[i] = pref[i-1]\|a[i];suff[n-i-1] = suff[n-i]\|a[n-i-1]\n if suff[1]==k:return 0\n elif pref[n-2]==k:return n-1\n else:\n for i in range (1,n-1):\n if pref[i-1]\|suff[i+1] == k:return i\n return -1\nfor z in range(int(input())):\n n,k=[int(i) for i in input().split()];a=[int(i) for i in input().split()];ans,arr = [],[0]n\n for i in range (n):\n if k\|a[i] != k:a[i] = a[i-1]\|a[(i+1)%(n)];ans.append(i+1);arr[i]=1\n x = 0;count = 0\n for i in range (n):x\|=a[i] \n if x!= k:print(-1)\n else:\n y = check()\n if y == -1:print(-1)\n else:\n for i in range (y,n+y):\n if arr[i%n]==0:arr[i%n]==1;ans.append((i%n)+1)\n print(ans)", "def check():\n pref = [0]n;pref[0]=a[0];suff = [0]n;suff[-1]=a[-1]\n for i in range (1,n):pref[i] = pref[i-1]\|a[i];suff[n-i-1] = suff[n-i]\|a[n-i-1]\n if suff[1]==k:return 0\n elif pref[n-2]==k:return n-1\n else:\n for i in range (1,n-1):\n if pref[i-1]\|suff[i+1] == k:return i\n return -1\nfor z in range(int(input())):\n n,k=[int(i) for i in input().split()];a=[int(i) for i in input().split()];ans,arr = [],[0]n\n for i in range (n):\n if k\|a[i] != k:a[i] = a[i-1]\|a[(i+1)%(n)];ans.append(i+1);arr[i]=1\n x = 0;count = 0\n for i in range (n):x\|=a[i] \n if x!= k:print(-1)\n else:\n y = check()\n if y == -1:print(-1)\n else:\n for i in range (y,n+y):\n if arr[i%n]==0:arr[i%n]==1;ans.append((i%n)+1)\n print(ans)", "t=int(input())\ndef check():\n pref = [0]n\n pref[0]=a[0]\n suff = [0]n\n suff[-1]=a[-1]\n for i in range (1,n):\n pref[i] = pref[i-1]\|a[i]\n suff[n-i-1] = suff[n-i]\|a[n-i-1]\n if suff[1]==k:\n return 0\n elif pref[n-2]==k:\n return n-1\n else:\n for i in range (1,n-1):\n if pref[i-1]\|suff[i+1] == k:\n return i\n return -1\nwhile(t):\n t-=1\n n,k=[int(i) for i in input().split()]\n a=[int(i) for i in input().split()]\n ans = []\n arr = [0]n\n for i in range (n):\n if k\|a[i] != k:\n a[i] = a[i-1]\|a[(i+1)%(n)]\n ans.append(i+1)\n arr[i]=1\n\n x = 0\n count = 0\n for i in range (n):\n x\|=a[i]\n \n if x!= k:\n print(-1)\n else:\n y = check()\n if y == -1:\n print(-1)\n else:\n for i in range (y,n+y):\n if arr[i%n]==0:\n arr[i%n]==1\n ans.append((i%n)+1)\n print(ans)\n", "t=int(input())\r\ndef check():\r\n pref = [0]n\r\n pref[0]=a[0]\r\n suff = [0]n\r\n suff[-1]=a[-1]\r\n for i in range (1,n):\r\n pref[i] = pref[i-1]\|a[i]\r\n suff[n-i-1] = suff[n-i]\|a[n-i-1]\r\n if suff[1]==k:\r\n return 0\r\n elif pref[n-2]==k:\r\n return n-1\r\n else:\r\n for i in range (1,n-1):\r\n if pref[i-1]\|suff[i+1] == k:\r\n return i\r\n return -1\r\nwhile(t):\r\n t-=1\r\n n,k=[int(i) for i in input().split()]\r\n a=[int(i) for i in input().split()]\r\n ans = []\r\n arr = [0]n\r\n for i in range (n):\r\n if k\|a[i] != k:\r\n a[i] = a[i-1]\|a[(i+1)%(n)]\r\n ans.append(i+1)\r\n arr[i]=1\r\n\r\n x = 0\r\n count = 0\r\n for i in range (n):\r\n x\|=a[i]\r\n \r\n if x!= k:\r\n print(-1)\r\n else:\r\n y = check()\r\n if y == -1:\r\n print(-1)\r\n else:\r\n for i in range (y,n+y):\r\n if arr[i%n]==0:\r\n arr[i%n]==1\r\n ans.append((i%n)+1)\r\n print(ans)"]	{"inputs": [["5", "3 6", "2 1 6", "3 6", "2 1 5", "3 7", "2 4 6", "3 7", "1 2 4", "3 7", "1 2 6"]], "outputs": [["2 1 3", "-1", "-1", "-1", "2 3 1"]]}	INTERVIEW	PYTHON3	CODECHEF	9,092
a2bebfb98e48b43da636716f639f8ebb	UNKNOWN	The chef is trying to decode some pattern problems, Chef wants your help to code it. Chef has one number K(odd) to form a new pattern. Help the chef to code this pattern problem. -----Input:----- - First-line will contain $T$, the number of test cases. Then the test cases follow. - Each test case contains a single line of input, one integer $K$. -----Output:----- For each test case, output as the pattern. -----Constraints----- - $1 \leq T \leq 100$ - $1 \leq K \leq 100$ -----Sample Input:----- 4 1 3 5 7 -----Sample Output:----- 1 111 111 111 11111 11 11 1 1 1 11 11 11111 1111111 11 11 1 1 1 1 1 1 1 1 1 1 1 11 11 1111111 -----EXPLANATION:----- No need, else pattern can be decode easily.	["from sys import stdin, stdout\nfrom math import floor, gcd, fabs, factorial, fmod, sqrt, inf, log\nfrom collections import defaultdict as dd, deque\nfrom heapq import merge, heapify, heappop, heappush, nsmallest\nfrom bisect import bisect_left as bl, bisect_right as br, bisect\nmod = pow(10, 9) + 7\nmod2 = 998244353\ndef inp(): return stdin.readline().strip()\ndef out(var, end=\"\\n\"): stdout.write(str(var)+\"\\n\")\ndef outa(var, end=\"\\n\"): stdout.write(' '.join(map(str, var)) + end)\ndef lmp(): return list(mp())\ndef mp(): return map(int, inp().split())\ndef smp(): return map(str, inp().split())\ndef l1d(n, val=0): return [val for i in range(n)]\ndef l2d(n, m, val=0): return [l1d(n, val) for j in range(m)]\ndef remadd(x, y): return 1 if x%y else 0\ndef ceil(a,b): return (a+b-1)//b\n\ndef isprime(x):\n if x<=1: return False\n if x in (2, 3): return True\n if x%2 == 0: return False\n for i in range(3, int(sqrt(x))+1, 2):\n if x%i == 0: return False\n return True\n\nfor _ in range(int(inp())):\n n = int(inp())\n for i in range(n):\n for j in range(n):\n if i==0 or i==n-1 or j==0 or j==n-1 or i==j or i+j==n-1:\n print(1, end=\"\")\n else:\n print(\" \", end=\"\")\n print()", "for _ in range(int(input())):\r\n n = int(input())\r\n\r\n print('1' n)\r\n\r\n s = list(' ' * n)\r\n s[0] = s[-1] = '1'\r\n\r\n l, r = 1, n-2\r\n for i in range(2, n):\r\n s[l] = s[r] = '1'\r\n print(s, sep='')\r\n s[l] = s[r] = ' '\r\n\r\n l += 1\r\n r -= 1\r\n\r\n if n != 1:\r\n print('1' n)"]	{"inputs": [["4", "1", "3", "5", "7"]], "outputs": [["1", "111", "111", "111", "11111", "11 11", "1 1 1", "11 11", "11111", "1111111", "11 11", "1 1 1 1", "1 1 1", "1 1 1 1", "11 11", "1111111"]]}	INTERVIEW	PYTHON3	CODECHEF	1,659
f080afea8556628d4020028dbcc3f4ea	UNKNOWN	Humpy, the little elephant, has his birthday coming up. He invited all his cousins but doesn’t know how many of them are really coming as some of them are having exams coming up. He will only get to know how many of them are coming on the day of his birthday. He ordered sugarcane for his party, of length L. Humpy’s mom decided that she will be dividing the sugarcane among Humty and his friends in a way such that they get the sugarcane in ratio of their ages. Your task is to determine whether it is possible to serve sugarcane to everyone as integral multiples of their ages. -----INPUT----- First line of input contains an integer N, denoting the number of test cases. Then N test cases follow. The first line of each test case contains three integers K, L and E. K denoting the number of friends coming; L denoting the length of the sugarcane and E denoting the age of the little elephant. Next line has K space separated integers denoting the age of friends who came to the party. -----OUTPUT----- For each test case, output “YES” (without quotes) if everyone gets their part as integral multiples of their ages; otherwise output “NO”(without quotes). -----CONSTRAINTS----- - 1 <= T<=30 - 1 <= K<=1000 - 1 <= L<=1000000 - 1 <= E<=100000 - 1 <= Age of Cousins<=100000 -----Example----- Input: 2 4 10 2 2 2 3 1 4 12 3 6 5 7 3 Output: YES NO	["# your code goes here\nfrom sys import stdin, stdout\nn = int(stdin.readline())\nwhile n:\n n -= 1\n k, l, e = map(int, stdin.readline().strip().split(' '))\n a = map(int, stdin.readline().strip().split(' '))\n x = float(l) / float(e + sum(a))\n if x - int(x):\n stdout.write(\"NO\\n\")\n else:\n stdout.write(\"YES\\n\")", "n = [\"\"]\nfor x in range(0,int(input())):\n k,l,e = list(map(int,input().split()))\n sum=0\n\n n = list(map(int,input().split()))\n\n for i in range(0,k):\n sum += n[i]\n sum += e\n\n if l%sum == 0:\n print(\"YES\")\n else:\n print(\"NO\")", "from math import *\nt=int(input())\nfor i in range(t):\n a=list(map(float,input().split()))\n b=list(map(float,input().split()))\n c=sum(b)+a[2]\n d=float(a[1]/c)\n if ceil(d)==d:\n print(\"YES\")\n else:\n print(\"NO\")\n", "for _ in range(0,int(input())):\n ans,[l,m,n]=['NO','YES'],list(map(int,input().split())) \n o = list(map(int,input().split())) +[n]\n print(ans[m%sum(o) ==0])\n", "for __ in range(eval(input())):\n k, l, e = list(map(int,input().split()))\n arr = list(map(int, input().split()))\n val = sum(arr) + e\n if l%val ==0:\n print(\"YES\")\n else:\n print(\"NO\")\n", "for __ in range(eval(input())):\n n, l, e = list(map(int, input().split()))\n a = list(map(int, input().split()))\n if l%(sum(a) + e)==0: print('YES')\n else: print('NO')\n", "for t in range(int(input())):\n k,l,e = list(map(int,input().split()))\n a = list(map(int,input().split()))\n s = float(sum(a)+e)\n if (l/s==int(l/s)):\n print(\"YES\")\n else:\n print(\"NO\")"]	{"inputs": [["2", "4 10 2", "2 2 3 1", "4 12 3", "6 5 7 3"]], "outputs": [["YES", "NO"]]}	INTERVIEW	PYTHON3	CODECHEF	1,543
c4d22849b389c122b9e18922a0e73e36	UNKNOWN	You may have tried your level best to help Chef but Dr Doof has managed to come up with his masterplan in the meantime. Sadly, you have to help Chef once again. Dr Doof has designed a parenthesis-inator. It throws a stream of $N$ brackets at the target, $1$ bracket per second. The brackets can either be opening or closing. Chef appears in front of the stream at time $t$. If Chef faces an opening bracket, he gets hit. However, if he faces a closing bracket, he may choose to let it pass through him (Chef is immune to closing brackets). Chef gets a chance to counter attack Doof as soon as he finds a balanced non-empty bracket sequence. Help Chef by providing him the minimum time $x$ at which he will be able to launch his counter attack. If Chef is unable to counter attack, answer $-1$. Formally, you are given a string $S$ of length $N$ consisting only of opening brackets $($ and closing brackets $)$. The substring of $S$ starting at index $L$ and ending at index $R$, i.e. $S_L S_{L+1} \ldots S_{R}$ is denoted by $S[L, R]$ . Consider $Q$ cases. In the $i^{\text{th}}$ case, Chef appears at time $t_i$ $(1 \leq t_i \leq N)$ and faces all characters from index $t_i$ to $N$. Find the minimum index $x$ $(t_i \leq x \leq N)$ such that the substring $S[t_i, x]$ contains a non-empty balanced bracket subsequence containing the same number of opening brackets as $S[t_i, x]$ (i.e., you cannot remove any opening bracket from the substring). If such an $x$ does not exist, print $-1$. A string $X$ is called a subsequence of a string $Y$ if it is possible to obtain $X$ by erasing some (possibly zero) characters from $Y$ without changing the order of the remaining characters. A balanced bracket sequence is defined as: - an empty string is a balanced bracket sequence. - if $s$ is a balanced bracket sequence, then so is $(s)$. - if $s$ and $t$ are balanced bracket sequences, then so is $st$. $Note :-$ The input files are large. The use of Fast I/O is recommended. -----Input----- - The first line contains a single integer $T$ denoting the number of testcases. - The first line of each test case contains the string $S$. - The next line contains a single integer $Q$ denoting the number of cases to consider. - The next line contains $Q$ space separated integers, each denoting $t_i$. -----Output----- For each query, print the minimum value of $x$ in a separate line. If no such $x$ exists, print $-1$. -----Constraints----- - $1 \leq T \leq 10^3$ - $1 \leq \|S\| \leq 10^7$ - $1 \leq Q \leq 10^6$ - $1 \leq t_i \leq N$ - Every character of $S$ is either $($ or $)$. - Sum of $\|S\|$ and $Q$ over all testcases for a particular test file does not exceed $10^7$ and $10^6$ respectively. -----Sample Input----- 1 )())((() 3 1 7 6 -----Sample Output----- 3 8 -1 -----Explanation----- For the first query, Chef chooses to let $S_1$ pass through him, gets hit by $S_2$ and finally completes a balanced bracket sequence by adding $S_3$ to $S_2$ at time $x$ = $3$.	["import sys\nimport bisect as bi\nimport math\nfrom collections import defaultdict as dd\ninput=sys.stdin.readline\n##sys.setrecursionlimit(10*7)\ndef cin():\n return list(map(int,sin().split()))\ndef ain(): \n return list(map(int,sin().split()))\ndef sin():\n return input()\ndef inin():\n return int(input())\nfor _ in range(inin()):\n s=sin().strip();q=inin();a=ain();n=len(s);store=[0]n;store1=[-1]n;f=0;d=dd(int)#input wgera\n store[0]=1 if s[0]=='(' else -1\n d[store[0]]=1\n for i in range(1,n):\n if(s[i]=='('):\n store[i]=store[i-1]+1\n d[store[i]]=i+1\n else:\n store[i]=store[i-1]-1\n if(d[store[i-1]]):\n store1[d[store[i-1]]-1]=i+1\n post=[-1]n;\n if(n==1 or(n==2 and s!=\"()\")):f=1 # corner case\n for i in range(n-2,-1,-1):\n if(s[i]=='('): #dekhna h ki agla agr ( h toh -1 hi rhega wrna wo jo stored tha uppr\n if(store1[i]!=-1):post[i]=store1[i] #wo iska ans ho jayega\n else:post[i]=post[i+1] #jo iske agle ka answer hoga wahi iska hoga\n for i in a:\n if(f):print(-1) #cond ki jaroorat nhi thi pr tasalli (>_<)\n else:print(post[i-1]) #wrna uska ans print kra do\n \n \n##n=m=0\n##s=''\n##t=''\n##dp=[]\n##def solve(inds,indt,k,cont):\n## ans=-999999999999999\n## print(dp)\n## if(k<0):return 0\n## elif(inds>=n and indt>=m):return 0\n## elif(dp[inds][indt][k][cont]!=-1):return dp[inds][indt][k][cont]\n## else:\n## if(indt<m):ans=max(ans,solve(inds,indt+1,k,0))\n## if(inds<n):ans=max(ans,solve(inds+1,indt,k,0))\n## if(s[inds]==t[indt]):\n## ans=max(ans,solve(inds+1,indt+1,k-1,1)+1)\n## if(cont):ans=max(ans,solve(inds+1,indt+1,k,1)+1)\n## dp[inds][indt][k][cont]=ans\n## return ans \n\n## n,m,k=cin()\n## s=sin().strip()\n## t=sin().strip()\n## dp=[[[[-1]2 for i in range(k)] for i in range(m+1)] for i in range(n+1)]\n## c=0\n## for i in dp:\n## for j in i:\n## for l in j:\n## c+=1\n## print(l,c)\n## print(solve(0,0,k,0))\n", "# cook your dish here\nT = int(input())\nfor _ in range(T):\n s = input()\n _ = input()\n stack = []\n nextOpen = [-1 for _ in range(len(s))]\n closing = [-1 for _ in range(len(s))]\n nextO = len(s) + 1\n for i in range(len(s) - 1, -1, -1):\n if s[i] == '(':\n nextO = i\n if stack:\n closing[i] = stack.pop()\n else:\n stack.append(i)\n nextOpen[i] = nextO\n\n for t in map(int, input().split()):\n t -= 1\n t = nextOpen[t]\n if t < len(s):\n res = closing[t]\n print(res + 1 if res >= 0 else -1)\n else:\n print(-1)\n", "# cook your dish here\nT = int(input())\nfor _ in range(T):\n s = input()\n _ = input()\n \n stack = []\n nextOpen = [-1 for _ in range(len(s))]\n closing = [-1 for _ in range(len(s))]\n nextO = len(s) + 1\n for i in range(len(s) - 1, -1, -1):\n if s[i] == '(':\n nextO = i\n if stack and stack[-1][0] == 1:\n _, pos = stack.pop()\n closing[i] = pos\n else:\n stack.append((0,i))\n else:\n stack.append((1,i))\n nextOpen[i] = nextO\n\n for t in map(int, input().split()):\n t -= 1\n t = nextOpen[t]\n if t < len(s):\n res = closing[t]\n print(res + 1 if res >= 0 else -1)\n else:\n print(-1)\n", "from sys import stdin, stdout \nfor t in range(int(stdin.readline())):\n s = str(stdin.readline()) \n q = int(stdin.readline())\n a = list(map(int, stdin.readline().split()))\n d = {}\n stc = []\n p = -1\n for i in range((len(s) - 1), -1, -1):\n if(s[i] == ')'):\n stc.append(i)\n d[i+1] = p\n elif(s[i] == '('):\n if(len(stc) >= 1):\n d[i+1] = stc[-1] + 1\n p = d[i + 1]\n stc.pop()\n else:\n d[i+1] = -1\n p = d[i + 1]\n \n for i in a:\n print(d[i])\n \n \n \n", "try:\n tt=int(input())\n while(tt):\n tt=tt-1\n s=input()\n st1, dicti, i = [], {}, 1\n for j in s:\n if j == '(':\n st1.append(i)\n elif st1:\n h = st1.pop() - 2\n dicti[h + 2] = i\n while h >= 0 and s[h] == ')':\n dicti[h + 1] = i\n h -= 1\n i+=1\n q=int(input())\n t=list(map(int,input().split()))\n for i in t:\n if(i in list(dicti.keys())):\n print(dicti[i])\n else:\n print(-1)\nexcept:\n pass\n\n\n", "t = int(input())\r\nfor _ in range(t):\r\n s = input()\r\n s = list(s)\r\n# q = int(input())\r\n n = len(s)\r\n answer=[]\r\n stack = []\r\n stack2 = []\r\n for i in range(len(s)-1,-1,-1):\r\n# print(stack)\r\n# print(s[i])\r\n if s[i]==')':\r\n if answer==[]:\r\n answer = [-1]\r\n stack2.append(i)\r\n stack.append(')')\r\n continue\r\n stack2.append(i)\r\n answer.append(answer[-1])\r\n stack.append(')')\r\n else:\r\n if stack2==[]:\r\n answer.append(-1)\r\n stack.append('(')\r\n else:\r\n stack.pop()\r\n e = stack2[-1]\r\n stack2.pop()\r\n answer.append(e+1)\r\n# if i==5:\r\n# break\r\n answer.reverse()\r\n q = int(input())\r\n W = list(map(int,input().split()))\r\n for i in range(q):\r\n w = W[i]\r\n print(answer[w-1])\r\n# print(answer)\r\n \r\n \r\n \r\n", "import sys\ninput = sys.stdin.readline\n\nT = int(input())\n\nfor _ in range(T):\n\ts = input()\n\tq = int(input())\n\tt = list(map(int,input().split()))\n\tstack = []\n\tval = [-1 for i in range(len(s))]\n\tlast_open = -1\n\tfor i in range(len(s)-2,-1,-1):\n\t\tif s[i] == ')':\n\t\t\tstack.append(i)\n\t\t\tval[i] = last_open\n\t\telse:\n\t\t\tif len(stack) != 0:\n\t\t\t\tval[i] = stack[-1]\n\t\t\t\tstack.pop()\n\t\t\t\tlast_open = val[i]\n\t\t\telse:\n\t\t\t\tlast_open = -1\n\n\tfor i in range(q):\n\t\tif val[t[i]-1] == -1:\n\t\t\tprint(-1)\n\t\telse:\n\t\t\tprint(val[t[i]-1] +1)\n\n\n\n", "for _ in range(int(input())):\r\n\tst=input()\r\n\tq=int(input())\r\n\tqi=list(map(int,input().split()))\r\n\tn=len(st)\r\n\ttracker=0\r\n\t# lastClose=-1\r\n\tans=[-1]n\r\n\tstack=[]\r\n\tfor i in range(n-1,-1,-1):\r\n\t\tif st[i]==')':\r\n\t\t\tstack.append(i+1)\r\n\t\t\tif i!=n-1:\r\n\t\t\t\tans[i]=ans[i+1]\r\n\t\t\t# lastClose=i+1\r\n\t\t\ttracker-=1\r\n\t\telif tracker<0 and st[i]=='(':\r\n\t\t\tans[i]=stack.pop()\r\n\t\t\ttracker+=1\r\n\t# print(ans)\r\n\tfor i in range(q):\r\n\t\tprint(ans[qi[i]-1])", "try:\n def findans(s):\n l,val,r=[],{},[]\n for i,kk in enumerate(s):\n if kk == '(':\n l.append(i+1)\n elif l:\n x=l.pop()\n val[x]=i+1\n x-=2\n while x>=0 and s[x]==')':\n val[x+1]=i+1\n x-=1\n return val\n \n for ii in range(int(input())):\n b=input()\n dic=findans(b)\n n=int(input())\n q=list(map(int, input().split()))\n for jj in q:\n print(dic.get(jj,-1))\nexcept: pass", "# cook your dish here\nfrom sys import stdin, stdout \nt = int(stdin.readline()) \nwhile(t):\n t -= 1\n string = str(stdin.readline()) \n q = int(stdin.readline())\n a = list(map(int, stdin.readline().split()))\n\n pos = 0\n l = {}\n stack = []\n pos = -1\n for j in range(len(string) - 1, -1, -1):\n #print(string[j])\n if(string[j] == ')'):\n stack.append(j)\n l[j+1] = pos\n elif(string[j] == '('):\n if(len(stack) >= 1):\n l[j+1] = stack[-1] + 1\n pos = l[j + 1]\n stack.pop()\n else:\n l[j+1] = -1\n pos = l[j + 1]\n #print(l) \n for item in a:\n print(l[item])\n \n", "# cook your dish here\nfrom sys import stdin, stdout \nt = int(stdin.readline()) \nwhile(t):\n t -= 1\n string = str(stdin.readline()) \n q = int(stdin.readline())\n a = list(map(int, stdin.readline().split()))\n\n pos = 0\n l = {}\n stack = []\n pos = -1\n for j in range(len(string) - 1, -1, -1):\n #print(string[j])\n if(string[j] == ')'):\n stack.append(j)\n l[j+1] = pos\n elif(string[j] == '('):\n if(len(stack) >= 1):\n l[j+1] = stack[-1] + 1\n pos = l[j + 1]\n stack.pop()\n else:\n l[j+1] = -1\n pos = l[j + 1]\n #print(l) \n for item in a:\n print(l[item])\n \n", "# cook your dish here\nfrom sys import stdin, stdout \n \n\ndef main(): \n \n t = input() \n t=int(t)\n while t:\n t=t-1\n s=input()\n n=len(s)\n #print(n,s)\n l=[0 for i in range(n)]\n l[n-1]=-1\n q=[]\n if s[n-1]==\")\":\n q.append(n-1)\n for i in range(n-2,-1,-1):\n \n if s[i]==\")\":\n l[i]=l[i+1]\n q.append(i)\n elif s[i]==\"(\" and len(q)==0:\n l[i]=-1\n else:\n l[i]=q[len(q)-1]\n q.pop()\n \n Q = int(input())\n #print(l)\n \n arr = [int(x) for x in stdin.readline().split()] \n \n for i in range(Q):\n x=arr[i]\n x=x-1\n if l[x]==-1:\n print(-1)\n else:\n print(l[x]+1)\n \n \n \n \n \n \n \n \n \n \n# call the main method \ndef __starting_point(): \n main() \n__starting_point()", "\n\ndef find_min(s,queries):\n\n stack = []\n\n balancing = [-1]len(s)\n\n op = [-1] len(s)\n\n last_opening = -1\n for i in range(len(s)-1,-1,-1):\n if s[i]==')':\n op[i] = last_opening\n else:\n last_opening = i\n\n\n for i in range(len(s)):\n if s[i]==')':\n if len(stack)!=0:\n balancing[stack[-1]] = i\n del stack[-1]\n else:\n stack.append(i)\n\n for query in queries:\n q = query-1\n if s[q]==')':\n if op[q]==-1:\n print(-1)\n continue\n else:\n q = op[q]\n if balancing[q]==-1:\n print(-1)\n else:\n print(balancing[q]+1)\n\nT = int(input())\nwhile T!=0:\n s = input()\n q = int(input())\n queries = [int(a) for a in input().split(\" \")]\n find_min(s,queries)\n T-=1\n\n", "from collections import deque \nfrom sys import stdin\ninput=stdin.readline\nfor _ in range(int(input())):\n s=list(input())\n n=len(s)\n ans=[0]n\n x=0\n y=0\n a=n-1\n b=n-1\n stack=deque([])\n prev=-1\n while a>=0:\n if s[a]==')':\n stack.append(a)\n ans[a] = prev\n else:\n if len(stack)==0:\n ans[a]=-1\n prev=-1\n else:\n prev=stack[-1]+1\n ans[a]=prev\n stack.pop()\n a-=1\n \n q=int(input())\n x=list(map(int,input().split()))\n for i in x:\n i=i-1\n print(ans[i])\n \n \n", "# from mymodule import input\nt = int(input())\nfor _ in range(t):\n s = input().strip()\n li,stk,tmp = [-1]len(s),[],[]\n for i in range(len(s)):\n if len(stk):\n if s[i]=='(':\n while len(tmp):\n stk.append(tmp.pop())\n stk.append(i)\n elif s[stk[-1]]=='(':\n li[stk[-1]] = i\n v = stk.pop()\n while len(stk)!=0:\n if s[stk[-1]]==')':\n li[stk[-1]]=v\n stk.pop()\n else:\n break\n tmp.append(i)\n else:\n stk.append(i)\n pass\n elif s[i]=='(':\n while len(tmp)!=0:\n stk.append(tmp.pop())\n stk.append(i)\n else:\n stk.append(i)\n # for i in tmp:\n # li[i] = len(s)\n # print(li,stk)\n q = int(input())\n for i in map(int,input().split()):\n ind = i-1\n while li[ind]!=-1 and s[li[ind]]!=')':\n ind = li[ind]\n if li[ind]!=-1:\n print(li[ind]+1)\n else:\n print(-1)", "\r\nfor _ in range(int(input())):\r\n s = input()\r\n n = int(input())\r\n l = list(map(int, input().split()))\r\n \r\n count = 0 \r\n stk = []\r\n last = -1\r\n store = [0] * len(s)\r\n \r\n \r\n \r\n for i in range(len(s)-1, -1, -1):\r\n if s[i] == ')':\r\n stk.append(i+1)\r\n if last == -1:\r\n store[i] = -1\r\n else:\r\n store[i] = last\r\n \r\n else:\r\n if len(stk) == 0:\r\n store[i] = -1\r\n last = -1\r\n else:\r\n x = stk.pop()\r\n store[i] = x\r\n last = x\r\n \r\n # print(store)\r\n \r\n for i in range(len(l)):\r\n print(store[l[i]-1])\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n", "import sys\r\nimport math\r\nfrom collections import defaultdict,Counter\r\n\r\ninput=sys.stdin.readline\r\ndef print(x):\r\n sys.stdout.write(str(x)+\"\\n\")\r\n\r\n# sys.stdout=open(\"CP3/output.txt\",'w')\r\n# sys.stdin=open(\"CP3/input.txt\",'r')\r\n\r\n# m=pow(10,9)+7\r\nt=int(input())\r\nfor i in range(t):\r\n s=input().strip()\r\n c=0\r\n v=[0]*len(s)\r\n st=[]\r\n prev=-2\r\n c1=0\r\n for j in range(len(s)-1,-1,-1):\r\n if s[j]==')':\r\n # c1-=1\r\n # if c1>=0:\r\n # c=0\r\n v[j]=prev\r\n st.append(j)\r\n else:\r\n c1+=1\r\n c+=1\r\n if st:\r\n v[j]=st.pop()\r\n else:\r\n v[j]=-2\r\n prev=v[j]\r\n # if len(st)>=c:\r\n # v[j]=st[-c]\r\n # prev=st[-c]\r\n # else:\r\n # v[j]=-2\r\n # prev=-2\r\n q1=int(input())\r\n q=list(map(int,input().split()))\r\n # print(v)\r\n for j in q:\r\n print(v[j-1]+1)\r\n"]	{"inputs": [["1", ")())((()", "3", "1 7 6"]], "outputs": [["3", "8", "-1"]]}	INTERVIEW	PYTHON3	CODECHEF	15,263
af35cb3838b6eea0e5cb36e65afbd8ca	UNKNOWN	Let's call a sequence good if the sum of all its elements is $0$. You have a sequence of integers $A_1, A_2, \ldots, A_N$. You may perform any number of operations on this sequence (including zero). In one operation, you should choose a valid index $i$ and decrease $A_i$ by $i$. Can you make the sequence good using these operations? -----Input----- - The first line of the input contains a single integer $T$ denoting the number of test cases. The description of $T$ test cases follows. - The first line of each test case contains a single integer $N$. - The second line contains $N$ space-separated integers $A_1, A_2, \ldots, A_N$. -----Output----- For each test case, print a single line containing the string "YES" if it is possible to make the given sequence good or "NO" if it is impossible. -----Constraints----- - $1 \le T \le 1,000$ - $1 \le N \le 10$ - $\|A_i\| \le 100$ for each valid $i$ -----Subtasks----- Subtask #1 (10 points): $N = 1$ Subtask #2 (30 points): $N \le 2$ Subtask #3 (60 points): original constraints -----Example Input----- 2 1 -1 2 1 2 -----Example Output----- NO YES -----Explanation----- Example case 2: We can perform two operations ― subtract $1$ from $A_1$ and $2$ from $A_2$.	["n=int(input())\nfor i in range(n):\n t=int(input())\n m=list(map(int,input().split()))\n p,q=0,0\n if t==1:\n if m[0]>=0:\n print('YES')\n else:\n print('NO')\n else:\n for i in m:\n if i<0:\n q+=i\n else:\n p+=i\n if p>=abs(q):\n print('YES')\n else:\n print('NO')", "n=int(input())\nfor i in range(n):\n t=int(input())\n m=list(map(int,input().split()))\n p,q=0,0\n if t==1:\n if m[0]>=0:\n print('YES')\n else:\n print('NO')\n else:\n for i in m:\n if i<0:\n q+=1\n else:\n p+=1\n if p>=abs(q):\n print('YES')\n else:\n print('NO')", "for i in range(int(input())):\n n=int(input())\n l=list(map(int,input().split()))\n a,b=0,0\n if n==1:\n if l[0]>=0:\n print('YES')\n else:\n print('NO')\n else:\n for i in l:\n if i<0:\n b+=i\n else:\n a+=i\n if a>=abs(b):\n print('YES')\n else:\n print('NO')", "# cook your dish here\nfor __ in range(int(input())):\n n=int(input())\n arr=list(map(int,input().split()))\n p_c,n_c=0,0\n if n==1:\n if arr[0]>=0:\n print(\"YES\")\n else:\n print(\"NO\")\n else:\n for i in arr:\n if i<0:\n n_c+=i\n else:\n p_c+=i\n \n if p_c>=abs(n_c):\n print(\"YES\")\n else:\n print(\"NO\")\n", "# cook your dish here\nt=int(input())\nfor i in range(t):\n n=int(input())\n l=list(map(int,input().split()))\n s=sum(l)\n if s>=0:\n print(\"YES\")\n else:\n print(\"NO\")\n", "# cook your dish here\nn = int(input())\nfor i in range(n):\n a = int(input())\n l = [int(x) for x in input().split()]\n if sum(l) >= 0:\n print(\"YES\")\n else:\n print(\"NO\")", "for _ in range(int(input())):\n a=int(input())\n b=list(map(int,input().split()))\n k=sum(b)\n if k>=0:\n print(\"YES\")\n else:\n print(\"NO\")", "# cook your dish here\n# cook your dish here\nfor i in range(int(input())):\n n=int(input())\n a=list(map(int,input().split()))\n if(sum(a)>=0):\n print(\"YES\")\n else:\n print(\"NO\")", "# cook your dish here\nfor i in range(int(input())):\n n=int(input())\n a=list(map(int,input().split()))\n if(sum(a)>=0):\n print(\"YES\")\n else:\n print(\"NO\")", "t=int(input())\nfor i in range(t):\n n=int(input())\n a=list(map(int,input().split()))\n search=0\n for i in range(len(a)):\n if(a[i]<0):\n search=1\n break\n if(search==1):\n print(\"NO\")\n else:\n print(\"YES\")\n", "# cook your dish here\nfor _ in range(int(input())):\n n = int(input())\n l = list(map(int,input().split()))\n if sum(l)>=0:\n print('YES')\n else:\n print('NO')", "\nfor _ in range(int(input())):\n n=int(input())\n a=list(map(int,input().split()))\n if(sum(a)>=0):\n print(\"YES\")\n else:\n print(\"NO\")", "for _ in range(int(input())):\n n=int(input())\n l=list(map(int,input().split()))\n if(sum(l)>=0):\n print(\"YES\")\n else:\n print(\"NO\")\n", "for _ in range(int(input())):\n n=int(input())\n l=list(map(int,input().split()))\n if(sum(l)>=0):\n print(\"YES\")\n else:\n print(\"NO\")", "# cook your dish here\nfor _ in range(int(input())):\n n=int(input())\n l=list(map(int,input().split()))\n if(sum(l)>=0):\n print(\"YES\")\n else:\n print(\"NO\")", "T = int(input())\nfor i in range(T):\n N = int(input())\n l = list(map(int, input().split()))\n if (sum(l) < 0):\n print(\"NO\")\n else:\n print(\"YES\")", "T = int(input())\nfor i in range(0, T):\n n = int(input())\n arr = list(map(int, input().split()))\n flag=0\n if sum(arr)<0:\n flag=1\n if flag==1:\n print(\"NO\")\n else:\n print(\"YES\")\n\n\n", "T = int(input())\nfor i in range(0, T):\n n = int(input())\n arr = list(map(int, input().split()))\n flag=0\n for x in arr:\n if x<0:\n flag=1\n break\n if flag==1:\n print(\"NO\")\n else:\n print(\"YES\")\n\n\n", "for _ in range(int(input())):\n n=int(input())\n l=list(map(int,input().split(\" \")))\n s=sum(l)\n if s>=0:\n print(\"YES\")\n else:\n print(\"NO\")", "# ------- main function -------\n\ndef solve():\n n = int(input())\n a = list(map(int,input().split(' ')))\n ls = sum(a)\n if ls >= 0:\n print(\"YES\")\n else:\n print(\"NO\")\n\n\n\n# ------- starting point of program -------\n\ndef __starting_point():\n for _ in range(int(input())):\n solve()\n\n__starting_point()", "for _ in range(int(input())):\n n= int(input())\n arr = list(map(int,input().split()))\n if sum(arr)<0:\n print(\"NO\")\n else:\n print(\"YES\")\n", "# cook your dish here\nt = int(input())\nfor x in range(t):\n n=int(input())\n l = [int(i) for i in input().split()]\n s = sum(l)\n if(s>=0):\n print(\"YES\")\n else:\n print(\"NO\")", "# cook your dish here\nt = int(input())\nfor x in range(t):\n n=int(input())\n l = [int(i) for i in input().split()]\n for i in l:\n if(i<0):\n print(\"NO\")\n break\n else:\n print(\"YES\")", "# cook your dish here\nt = int (input())\nwhile t > 0:\n n = int(input())\n l = list(map(int,input().strip().split()))[:n]\n s = sum(l)\n if s >= 0:\n print(\"YES\")\n else :\n print(\"NO\")\n t = t - 1\n", "# cook your dish here\nt=int(input())\nwhile t>0:\n n=int(input())\n l=list(map(int,input().split()))\n s=sum(l)\n if s>=0:\n print(\"YES\")\n else:\n print(\"NO\")\n t=t-1"]	{"inputs": [["2", "1", "-1", "2", "1 2"]], "outputs": [["NO", "YES"]]}	INTERVIEW	PYTHON3	CODECHEF	5,076
585653a9fbeb1b2e061848a5dd1313ea	UNKNOWN	Given a binary string $S$ consisting of only 1’s and 0’s where 1 represents a Square and 0 represents a Circle. The diameter of the circle and the side of the square must be any integer (obviously > 0) . You will have to perfectly inscribe (as shown in the example below) the respective geometric figure at $S$$i+1$ inside of $S$$i$ where $i$ $\epsilon$ $[0,N-2]$, if it is possible. Note that, it will not be possible to inscribe if the dimension of the geometric figure you are perfectly inscribing is not an integer and you will discard the rest of the string. Find the maximum number of circles we can inscribe in a square according to the given string. For a given binary string there can be only one geometric figure and this figure is concentric. For example : the string 1100 can be represented as the figure below, the first two squares have the same side length and the next two circles have the same diameter. Another example : the string 0001 can be represented as the one given below Again here, we have 3 circles of the same diameter and one square inscribed in them. -----Input:----- The first line contains $N$, the number of strings Then each of the next $N$ lines contains a binary string $S$. -----Output:----- The $N$ lines of output should have $N$ integers in separate lines, the maximum number of circles we can inscribe in a square according to the given string $S$ . -----Constraints----- - 1 $\leq$ $N$ $\leq$ 103 - 1 $\leq$ length of string $S$ $\leq$ 104 -----Sample Input:----- 3 1110 0010 1001000 -----Sample Output:----- 1 0 2 -----Explanation:----- In the first case, we can inscribe the string 1110 as : three squares of side length 4 units (on top of each other) and then we can inscribe one circle of diameter 4 units. The answer is 1 since, there is 1 circle inscribed in a square. In the second case 0010, Let the first two circles be of some diameter 10, we can see that we cannot inscribe another square of any integer dimension inside them. So, the answer is 0. In the third case 1001000, we can take the first square of size 10, then inscribe two circles of diameter 5, then we cannot inscribe another square in this since, it will not be of any possible integer dimension and we discard the rest of the string.	["for z in range(int(input())):\n s = input()\n n = len(s)\n i = 0\n while i<n and s[i]=='1':\n i+=1\n if i==0:\n print(0)\n else:\n k = 0\n while i<n and s[i]=='0':\n i+=1\n k+=1\n print(k)\n", "# cook your dish h\nfor _ in range(int(input())):\n a = list(input())\n \n len_a = len(a)\n i = 0\n for i in range(i+1, len_a):\n if(a[i-1] == '0' and a[i] == '1'):\n a = a[:i]\n break\n if('1' in a):\n print(a.count('0'))\n else:\n print(0)\n", "# cook your dish here\nt=int(input())\nfor x in range(t):\n a = list(input())\n # print(a)\n # flag = 1\n N = len(a)\n i = 0\n for i in range(i+1, N):\n if(a[i-1] == '0' and a[i] == '1'):\n a = a[:i]\n break\n if('1' in a):\n print(a.count('0'))\n else:\n print(0)\n", "for _ in range(int(input())):\r\n s = list(map(int, list(input())))\r\n s.append('0')\r\n y = 0\r\n if s[0] == 0:\r\n y = 1\r\n while s[0] == 0:\r\n s.remove(0)\r\n while s[0] == 1:\r\n s.remove(1)\r\n z = 0\r\n while s[0] == 0:\r\n s.remove(0)\r\n z += 1\r\n if y == 1:\r\n print(0)\r\n else:\r\n print(z)\r\n", "\r\n\r\nN=int(input())\r\nlst=[]\r\nlt=[]\r\ncount=[]\r\nfor i in range(N):\r\n string=input()\r\n lst.append(string)\r\n \r\n\r\nfor num in lst:\r\n if num.startswith(\"1\"):\r\n x=num.find(\"0\")\r\n y=num.find('1',x)\r\n if y == -1:\r\n z=lt.append(len(num[x:]))\r\n else :\r\n z=lt.append(len(num[x:y]))\r\n if num.startswith(\"0\"):\r\n z=lt.append(0)\r\nfor i in lt:\r\n print(i)\r\n \r\n \r\n \r\n \r\n", "# cook your dish here\n\nt= int (input())\nfor i in range (t):\n count = 0\n x = list(input())\n f1= 0\n f2 = 0 \n for i in range (len(x) ):\n if x[i] == '1' and f1 == 0 and f2 ==0 :\n f1 = 1 \n elif x[i] == '1' and f1 == 1 and f2 ==0:\n continue\n elif x[i] == '0' and f1 == 0 and f2 ==0 :\n f2 = 1\n elif x[i] == '0' and f1 == 1 :\n count = count+1 \n f2 = 2 \n elif x[i] == '0' and f2 == 1 :\n continue\n elif x[i] == '0' and f2 == 2 :\n count = count+1 \n elif x[i] == '1' and f2 == 1 :\n break\n elif x[i] == '1' and f2 == 2 :\n break\n print(count)", "for i in range(int(input())):\r\n s=input()\r\n if s.count(s[0])==len(s):\r\n print(\"0\")\r\n continue\r\n if s[0]==\"0\":\r\n print(\"0\")\r\n continue\r\n tmp=s.index(\"0\")\r\n c=1\r\n for j in range(tmp+1,len(s)):\r\n if s[j]==\"0\":\r\n c+=1\r\n else:\r\n break\r\n print(c)", "def solve(S):\r\n if(S[0] == '0'):\r\n return 0\r\n count = 0\r\n flag = False\r\n for char in S:\r\n if char == '0':\r\n count += 1\r\n flag = True\r\n elif char == '1' and not flag:\r\n continue\r\n elif char == '1' and flag:\r\n break\r\n return count\r\n \r\ndef main():\r\n N = int(input())\r\n for case in range(N):\r\n S = input()\r\n print(solve(S))\r\n return \r\n\r\ndef __starting_point():\r\n main()\n__starting_point()", "# cook your dish here\ntry:\n t=int(input())\n while(t):\n n=input()\n x=0\n f=0\n if(n[0]=='1'):\n for i in range(1,len(n)):\n if(n[i]=='1' and f==0):\n continue\n elif(n[i]=='0'):\n x+=1\n f=1\n continue\n elif(n[i]=='1' and f==1):\n break\n print(x)\n \n t-=1\nexcept:\n pass", "for _ in range(int(input())):\n s = input().strip()\n if s[0] == '0' or '1' not in s:\n print(0)\n else:\n ans = 0\n s = s.lstrip('1')\n for i in range(len(s)):\n if s[i] == '1':\n break\n ans += 1\n print(ans)\n", "t = int(input())\r\nwhile(t!=0):\r\n t-=1\r\n string = input()\r\n s = []\r\n for i in range(len(string)):\r\n s.append(int(string[i]))\r\n \r\n sqinc = 0\r\n for i in range(1,len(s)):\r\n if s[i-1]!=s[i] and s[i-1] == 1:\r\n sqinc+=1\r\n if s[i-1]!=s[i] and s[i-1]==0:\r\n break\r\n if s[i-1]==s[i] and s[i-1]==0 and sqinc>0:\r\n sqinc+=1\r\n print(sqinc)\r\n\r\n", "for t in range(int(input())):\n pts=list(input())\n ans=0\n if pts[0]=='0':\n ans=0\n else:\n for i in range(1,len(pts),1):\n if pts[i]=='0':\n ans=ans+1\n if pts[i-1]=='0':\n if pts[i]=='1':\n break\n print(ans)\n", "# cook your dish here\nfor _ in range(int(input())):\n a = input()\n count = 0\n if a[0]=='0':\n print(count)\n else:\n s = 0\n for i in a:\n if i=='0':\n count +=1\n s+=1\n else:\n if s>0:\n break\n print(count)", "t = 0\ntry:\n t = int(input())\nexcept:\n pass\nfor _ in range(t):\n s = input()\n x = 0\n if s[0] == '0':\n print(x)\n else:\n last = 0\n for i in range(0,len(s)):\n if s[i] == '0':\n x += 1\n if i<len(s)-1:\n if s[i+1] == '1':\n break\n else:\n last = 1\n print(x)", "for _ in range(int(input())):\n S = input().strip()\n count = 0\n Sflag = False\n Cflag = False\n \n \n for x in S:\n if x == '1':\n Sflag = True\n else:\n Cflag = True\n \n if Cflag and x == '1':\n break\n \n if Sflag and x == '0':\n count += 1\n \n print(count)", "# cook your dish here\nfor N in range(int(input())):\n count,nxt,prev=0,0,0\n S=input()\n S=list(S)\n # print(S)\n if (S[0]=='1'):\n for i in range(1,len(S)):\n if S[i]=='0' and nxt==0 and prev==0:\n for j in range(i,len(S)):\n if S[j]=='0':\n count=count+1\n # print(count)\n if j==len(S)-1:\n prev=prev+1\n elif S[j]=='1':\n nxt=nxt+1\n break\n else:\n continue\n # print(count)\n # if S[i]=='1' and S[i].count('0')<1:\n # # nxt=nxt+1\n # continue\n print(count)", "# cook your dish here\nn=int(input())\nfor _ in range(n):\n s=input()\n if s[0]=='0':\n print(0)\n else:\n c=0\n flag=0\n for i in range(1,len(s)):\n if(s[i]=='0'):\n c+=1\n flag=1\n if(s[i]=='1' and flag==1):\n break\n print(c)", "# cook your dish here\nfor _ in range(int(input())):\n s=input()\n lis=[]\n count=0\n for i in s:\n lis.append(int(i))\n \n if lis[0]==0:\n print(0)\n continue\n i=0\n while i<len(lis) and lis[i]==1:\n i+=1\n continue\n #print(i)\n while i<len(lis) and lis[i]==0:\n count+=1\n i+=1\n print(count)\n\n\n", "# cook your dish here\ntest=int(input())\nfor tt in range(0,test):\n s=input()\n n=len(s)\n p=0\n if(s[0]==\"0\"): \n print(0)\n else:\n i=0\n while(i<n and s[i]==\"1\"):\n i=i+1\n while(i<n and s[i]==\"0\"):\n p=p+1\n i=i+1\n print(p)", "test_cases = int(input())\r\n\r\nfor _ in range(test_cases):\r\n s = input()\r\n ans = 0\r\n s += '0'\r\n index = s.index('0')\r\n if index == 0 or index == len(s)-1:\r\n print(ans)\r\n else:\r\n for i in range(index, len(s)-1):\r\n if s[i] == '0':\r\n ans += 1\r\n else:\r\n break\r\n print(ans)", "import re\nfor _ in range(int(input())):\n m = re.match(\"1+(0*)\", input())\n if m:\n print(len(m[1]))\n else:\n print(0)\n", "T=int(input())\nfor _ in range(T):\n s=input()\n if s[0]=='0':\n print('0')\n continue\n c=0\n z=0\n for i in range(len(s)):\n if s[i]=='1' :\n if z==0:\n continue\n else:\n break\n c+=1\n z=1\n print(c)", "# cook your dish here\nT=int(input())\nfor _ in range(T):\n S=input()\n t=-1\n if(S[0]=='0'):\n print(0)\n continue\n else:\n i=1\n count=0\n while(i<len(S)):\n if(i==len(S)-1 and S[i]=='0'):\n print(count+1)\n break\n if(t==-1 and i==len(S)-1):\n print(0)\n break\n if(t==0 and S[i]=='1'):\n print(count)\n break\n if(S[i]=='0'):\n t=0\n if(S[i]=='0' and t==0):\n count+=1\n i=i+1\n \n"]	{"inputs": [["3", "1110", "0010", "1001000"]], "outputs": [["1", "0", "2"]]}	INTERVIEW	PYTHON3	CODECHEF	9,714
6093fad81f2e546a0906dd9f99db8951	UNKNOWN	You are an evil sorcerer at a round table with $N$ sorcerers (including yourself). You can cast $M$ spells which have distinct powers $p_1, p_2, \ldots, p_M$. You may perform the following operation any number of times (possibly zero): - Assign a living sorcerer to each positive integer cyclically to your left starting from yourself ― the closest living sorcerer to your left is assigned to $1$, the next living sorcerer to the left is assigned to $2$ and so on. Note that each living sorcerer (including yourself) is assigned to an infinite number of integers. - Choose a spell $j$ (possibly a spell you have chosen before) and kill the living sorcerer assigned to $p_j$. You may not cast a spell to kill yourself. What is the maximum number of sorcerers you can kill using zero or more operations? -----Input----- - The first line of the input contains a single integer $T$ denoting the number of test cases. The description of $T$ test cases follows. - The first line of each test case contains two space-separated integers $N$ and $M$. - The second line contains $M$ space-separated integers $p_1, p_2, \ldots, p_M$. -----Output----- For each test case, print a single line containing one integer ― the maximum number of sorcerers you can kill. -----Constraints----- - $1 \le T \le 1,000$ - $1 \le N \le 10^9$ - $1 \le M \le 3 \cdot 10^5$ - $1 \le p_i \le 10^9$ for each valid $i$ - $p_1, p_2, \ldots, p_N$ are pairwise distinct - the sum of $M$ over all test cases does not exceed $3 \cdot 10^5$ -----Example Input----- 5 4 1 5 6 2 2 4 1 4 7 16 8 29 1000000000 1 998244353 1 1 20201220 -----Example Output----- 3 4 0 1755647 0 -----Explanation----- Example case 1: The initial state is shown in the figure from the statement. We can first use spell $1$ and kill the $5$-th sorcerer to our left, i.e. sorcerer $2$. Now there are $3$ living sorcerers and the state is as shown in the following figure: We can use spell $1$ again and kill the current $5$-th living sorcerer to our left, i.e. sorcerer $4$. Now there are $2$ living sorcerers and the state is: Finally, we can use spell $1$ again and kill the only other living sorcerer, i.e. sorcerer $3$. Now, none of the other sorcerers are alive. As we cannot cast a spell to kill ourselves, we cannot improve the answer any further. Example case 2: We can perform $4$ operations using the spell $p_1 = 2$ each time. We can also instead use $p_2 = 4$ in the first two operations and $p_1 = 2$ in the last two operations. Note that there may be multiple valid sequences of operations that lead to the best answer. Example case 3: We cannot perform any operations using any of the given spells, so we are unable to kill any sorcerers. Example case 4: We can perform $1,755,647$ operations, each of them using the spell $p_1 = 998,244,353$.	["import functools\n\ndef gcd(x,y):\n if(y == 0):\n return x\n return gcd(y, x%y)\n\nfor _ in range(int(input())):\n n, m= map(int, input().split())\n p = list(map(int, input().split()))\n \n ans = functools.reduce(lambda x,y: gcd(x, y), p)\n \n if(ans <= n):\n print(n-ans)\n else:\n f = [1]\n for k in range(ans//2, 1, -1):\n if ans %k == 0:\n if k<=n:\n f.append(k)\n \n if ans//k <= n:\n f.append(ans//k)\n res = n-max(f)\n print(res)", "import functools\n\ndef gcd(x,y):\n if(y == 0):\n return x\n return gcd(y, x%y)\n\nfor _ in range(int(input())):\n n, m= map(int, input().split())\n p = list(map(int, input().split()))\n \n ans = functools.reduce(lambda x,y: gcd(x, y), p)\n \n if(ans <= n):\n print(n-ans)\n else:\n f = [1]\n for k in range(ans//2, 1, -1):\n if ans %k == 0:\n if k<=n:\n f.append(k)\n break\n if ans//k <= n:\n f.append(ans//k)\n res = n-max(f)\n print(res)", "from math import gcd,sqrt,ceil\n\ndef fac(x,n):\n mx = 1\n for i in range(1,ceil(sqrt(x))+1):\n if x % i == 0:\n if i <= n:\n mx = max(mx,i)\n if x//i <= n:\n mx = max(mx,x//i)\n return mx\n\n \n\nfor _ in range(int(input())):\n n,m = map(int,input().split())\n rev = n\n lis = list(map(int,input().split()))\n \n g = lis[0]\n for i in lis:\n g = gcd(g,i)\n\n if n > g:\n k = n - g\n else:\n val = fac(g,n)\n k = n - val\n print(k)", "# cook your dish here\ndef _gcd(a,b):\n while(b!=0):\n a,b=b,a%b\n return a\n \ndef __gcd(mp):\n if(len(mp)==1):\n return mp[0]\n gcd=_gcd(mp[0],mp[1])\n for i in range(2,len(mp)):\n gcd=_gcd(gcd,mp[i])\n return gcd\n \ndef factors(hcf):\n if(hcf==0):\n return [1]\n factor_list=[]\n for i in range(1,int(hcf*(0.5))+1):\n if(hcf%i==0):\n factor_list.append(i)\n factor_list.append(hcf//i)\n return factor_list\n \nt=int(input())\nfor _ in range(t):\n n,m=map(int,input().split())\n mp=list(map(int,input().split()))\n hcf=0\n if(m==1):\n hcf=mp[0]\n elif(m>1):\n hcf=__gcd(mp)\n ans=0\n factor_list=factors(hcf)\n factor_list.sort(reverse=True)\n for i in factor_list:\n if i<=n:\n ans=n-i\n break\n print(ans)", "# cook your dish here\nimport math\n\ndef gcd(a, b):\n if a % b == 0:\n return b\n return gcd(b, a % b)\n \ndef maxfact(g, n):\n i = 1\n maxf = None\n while i i <= g:\n if g % i == 0:\n if(i <= n):\n maxf = i\n if math.floor(g / i) <= n:\n maxf = math.floor(g / i)\n break\n i = i+1\n return maxf\n \n\nt = int(input())\nwhile t>0:\n t = t-1\n [n, m] = [int(x) for x in input().split(' ')]\n spells = [int(x) for x in input().split(' ')]\n g = spells[0]\n for i in range(1, m):\n g = gcd(g, spells[i])\n print(n - maxfact(g, n))\n", "try:\n \n def gcd_fd(i, j):\n while(j):\n i, j = j, i % j\n \n return i\n \n \n def gcd_l(t):\n num = t[0]\n k = t[1]\n gcd = gcd_fd(num, k)\n \n for i in range(2, len(t)):\n gcd = gcd_fd(gcd, t[i])\n \n return(gcd)\n \n \n def fact(num1):\n if num1 == 0:\n return 1\n a = []\n for j in range(1, int(num1(1 / 2)) + 1):\n if num1 % j == 0:\n a.append(j)\n a.append(num1 // j)\n return(a)\n \n \n for _ in range(int(input())):\n n, m = map(int, (input().split()))\n a = list(map(int, input().split()))\n p = 0\n ans = 0\n if m > 1:\n p = gcd_l(a)\n else:\n p = a[0]\n fac = fact(p)\n fac.sort(reverse=True)\n for i in fac:\n if i <= n:\n ans = n - i\n break\n print(ans)\nexcept:\n pass", "# cook your dish here\ndef find_gcd(x, y): \n while(y): \n x, y = y, x % y \n return x \n\ndef maxfact(x,n):\n lar_fac = 0\n for i in range(1, x + 1):\n if x % i == 0:\n if(i <= n):\n lar_fac = max(lar_fac, i)\n elif(x / i <= n):\n lar_fac = max(lar_fac, x / i)\n return(lar_fac)\n \nfor _ in range(int(input())):\n n, m = list(map(int, input().split()))\n p = list(map(int, input().split()))\n gcd = 0\n for i in range(m):\n gcd = find_gcd(gcd, p[i])\n \n if(gcd > n):\n temp = maxfact(gcd, n)\n gcd = temp\n \n ans = n - gcd\n print(ans)\n", "def gcd(a, b):\n if(a == 0):\n return b\n else:\n return gcd(b % a, a)\n\n\ndef fgcd(a):\n r = a[0]\n for i in range(1, len(a)):\n r = gcd(a[i], r)\n if(r == 1):\n return 1\n return r\n\n\nt = int(input())\nwhile t:\n t -= 1\n n, m = list(map(int, input().split()))\n a = list(map(int, input().split()))\n a.sort()\n # mn = min(a)\n mn = fgcd(a)\n # print(mn)\n c = 0\n if(n >= mn):\n c = n - mn\n print(c)\n continue\n while(n > 1):\n if(mn % n != 0):\n c += 1\n n -= 1\n else:\n break\n print(c)\n", "from math import gcd\ndef largest_factor(val,n):\n k = min(n,val)\n while k > 0:\n if val % k == 0:\n return k\n k -= 1\nfor _ in range(int(input())):\n n,m = list(map(int,input().split()))\n li = list(map(int,input().split()))\n if n == 1:\n print(0)\n else:\n val = li[0]\n for i in range(1,m):\n val = gcd(val,li[i])\n print(n - largest_factor(val,n))\n\n", "# cook your dish here\nimport math \n\ndef gcd(a,b):\n if b == 0:\n return a\n return gcd(b,a%b)\n \nfor _ in range(int(input())):\n n,m=list(map(int,input().split(\" \")))\n p=list(map(int,input().split(\" \")))\n g=p[0]\n for i in range(1,m):\n g = gcd(g,p[i])\n \n if g>n:\n maxEl=1\n for i in range(2,int(math.sqrt(g)+1)):\n if g%i == 0:\n if i<=n:\n maxEl = max(maxEl,i)\n if g//i<=n:\n maxEl = max(maxEl,g//i)\n print(n - maxEl) \n else:\n print(n - g)\n \n", "# cook your dish here\nimport math \n\ndef gcd(a,b):\n if b == 0:\n return a\n return gcd(b,a%b)\n \nfor _ in range(int(input())):\n n,m=list(map(int,input().split(\" \")))\n p=list(map(int,input().split(\" \")))\n g=p[0]\n for i in range(1,m):\n g = gcd(g,p[i])\n \n if g>n:\n maxEl=1\n for i in range(2,int(math.sqrt(g)+1)):\n if g%i == 0:\n if i<=n:\n maxEl = max(maxEl,i)\n if g//i<=n:\n maxEl = max(maxEl,g//i)\n print(n - maxEl) \n else:\n print(n - g)\n \n", "# cook your dish here\nimport math \n\ndef gcd(a,b):\n if b == 0:\n return a\n return gcd(b,a%b)\n \nfor _ in range(int(input())):\n n,m=list(map(int,input().split(\" \")))\n p=list(map(int,input().split(\" \")))\n g=p[0]\n for i in range(1,m):\n g = gcd(g,p[i])\n \n if g>n:\n maxEl=1\n for i in range(n,0,-1):\n if g%i == 0:\n maxEl = i\n break\n print(n - maxEl) \n else:\n print(n - g)\n \n", "from math import gcd,sqrt\nfor _ in range(int(input())):\n n,m = map(int,input().split())\n l = list(map(int,input().split()))\n g = 0\n for i in l:\n g = gcd(g,i)\n if(g<n):\n print(n - g)\n continue\n f = 0\n s = int(sqrt(g))\n for i in range(1,s+1):\n if(g%i == 0):\n if(i <= n):\n f = max(f,i)\n if(g//i <= n):\n f = max(f,g//i)\n print(n - f)", "import math as x\ndef lfact(n,k):\n fact=[]\n max=0\n for j in range(1,int(k0.5)+1):\n if k%j==0:\n \n if j<=n and j>max:\n max=j\n if k//j<=n and k//j>max:\n max=k//j\n return max\n \nt=int(input())\nfor j in range(t):\n n,m=list(map(int,input().split()))\n arr=list(map(int,input().split()))\n if n==1:\n print(0)\n else:\n g=0\n for i in range(m):\n g=x.gcd(arr[i],g)\n \n if g>n:\n g=lfact(n,g)\n print(n-g)\n elif g==n:\n print(0)\n else:\n print(n-g)\n \n", "# cook your dish here\ndef gcdf(x,y):\n while(y): \n x, y = y, x % y \n return x\n\nt = int(input())\nfor cases in range(t):\n (n, m) = list(map(int, input().split()))\n spells = list(map(int, input().split()))\n kills = 0\n gcd = spells[0]\n for i in range (1, m):\n gcd = gcdf(gcd, spells[i])\n if (n > gcd):\n kills += n - gcd\n n = gcd\n if (n < gcd):\n for i in range(n,0,-1):\n if (gcd % i == 0):\n break\n kills += 1\n print(kills)\n \n \n \n \n \n", "# cook your dish here# cook your dish here\nimport math\n\ndef gcdiv(l):\n l.sort()\n ans = math.gcd(l[0],l[1])\n i = 2\n \n while (ans!=1 and i<len(l)):\n ans = math.gcd(ans,l[i])\n i = i + 1\n \n return(ans)\n \ndef lf(gc,n):\n if (gc < n):\n return(gc)\n out = n\n while out>1:\n if (gc%out == 0):\n return(out)\n out -= 1\n \n return(out)\n \n \nt = int(input())\n\nwhile t>0:\n t -= 1\n n, m = list(map(int,input().split()))\n l1 = list([int(i) for i in input().split()])\n \n if len(l1) > 1:\n gc = gcdiv(l1)\n else:\n gc = l1[0]\n \n print(n-lf(gc,n))\n \n \n \n \n \n \n \n \n \n", "# cook your dish here\ndef gcd(a1,b1):\n if b1==0:\n return a1\n else:\n return gcd(b1,a1%b1)\na = int(input())\nfor i in range(a):\n b = list(map(int,str(input()).split(' ')))\n c = list(map(int,str(input()).split(' ')))\n k = c[0]\n Ans = 0\n if b[0]==1:\n print(0)\n else:\n if b[1]==1:\n if b[0]>c[0]:\n print(abs(b[0]-c[0]))\n elif b[0]==c[0]:\n print(0)\n else:\n for i2 in range(b[0]-1):\n if (c[0]%b[0])!=0:\n Ans+=1\n b[0]-=1\n else:\n break\n print(Ans)\n \n else:\n for i1 in range(b[1]):\n k = gcd(c[i1],k)\n if b[0]>k:\n print(abs(b[0]-k))\n elif b[0]==k:\n print(0)\n else:\n for i3 in range(b[0]-1):\n if (k%b[0])!=0:\n Ans+=1\n b[0]-=1\n else:\n break\n print(Ans)", "# cook your dish here\ntry:\n def find_gcd(x, y): \n while(y): \n x, y = y, x % y \n \n return x\n def gcd_arr(l):\n num1=l[0] \n num2=l[1] \n gcd=find_gcd(num1,num2) \n \n for i in range(2,len(l)): \n gcd=find_gcd(gcd,l[i])\n return(gcd)\n def factors(n):\n #print(n)\n if n==0:\n return 1\n x=[]\n for i in range(1,int(n(1/2))+1):\n if n%i==0:\n x.append(i)\n x.append(n//i)\n return(x)\n for t in range(int(input())):\n n,m=map(int,input().split())\n p=list(map(int,input().split()))\n hcf=0\n if m>1:\n hcf=gcd_arr(p)\n else:\n hcf=p[0]\n fact=factors(hcf)\n fact.sort(reverse=True)\n final=0\n for i in fact:\n if i<=n:\n final=n-i\n break\n print(final)\nexcept:\n pass", "# cook your dish here\ndef find_gcd(x, y): \n while(y): \n x, y = y, x % y \n \n return x\ndef gcd_arr(l):\n num1=l[0] \n num2=l[1] \n gcd=find_gcd(num1,num2) \n \n for i in range(2,len(l)): \n gcd=find_gcd(gcd,l[i])\n return(gcd)\ndef factors(n):\n #print(n)\n if n==0:\n return 1\n x=[]\n for i in range(1,int(n(1/2))+1):\n if n%i==0:\n x.append(i)\n x.append(n//i)\n return(x)\nfor t in range(int(input())):\n n,m=map(int,input().split())\n p=list(map(int,input().split()))\n hcf=0\n if m>1:\n hcf=gcd_arr(p)\n else:\n hcf=p[0]\n fact=factors(hcf)\n fact.sort(reverse=True)\n final=0\n for i in fact:\n if i<=n:\n final=n-i\n break\n print(final)"]	{"inputs": [["5", "4 1", "5", "6 2", "2 4", "1 4", "7 16 8 29", "1000000000 1", "998244353", "1 1", "20201220"]], "outputs": [["3", "4", "0", "1755647", "0"]]}	INTERVIEW	PYTHON3	CODECHEF	10,367
06f3361a9dbf31ef051dff02d723e0f4	UNKNOWN	Teacher Sungjae wanted to hold a programming competition for his students where every participant need to be included into team. The participants submitted their team names before the deadline. After the competition ran for half an hour, (It is assured that each registered team will submit absolutely once within half an hour) Sungjae mistakenly pressed a button that changed the order of the registered team names. Now in the submission list, order of the characters in the team's name doesn't matter. That means $abc$, $acb$, $bac$, $bca$, $cab$, $cba$ refers to the same team. The competition ran for two hours and then ended. Sungjae now counting each of the team's score and wants to print the registered team names and score. The scoreboard should be ordered based on scores in decreasing order and if two teams have same score, Sangjae would follow lexicographical order. $N$.$B$. frequency of each character's in a registered team's name will not match with another team. That means two teams named $xoxo$ and $oxox$ is not possible. Because both of them have the same frequency of each of the characters (two 'o' and two 'x'). Similarly $abb$ and $bab$ is not possible (because both of them have one 'a' and two 'b'). It is ensured that only possible test cases will be given. -----Input:-----Input: - First line will contain $T$, number of testcases. Then the testcases follow. - The first line of each test case contains two integers , $N$ and $R$ - total number of submissions and the number of submissions within first half an hour. - Then $R$ lines follow: the i'th line contains a string $ti$, registered names of the teams and an integer $pi$, points they got on that submission. - Then $N-R$ lines follow: the i-th line contains a string $ti$- the i-th team's name (in any order) in lowercase letter only and $pi$ -points they got on that submission. -----Output:-----Output: For each testcase,print the scoreboard. That means print the teams name and their point according to their score in decreasing order and if some of them have same score,print the teams name in lexicographical order -----Constraints-----Constraints - $1 \leq T \leq 10$ - $1 \leq R \leq N \leq 1000$ - $1 \leq ti \leq 1000$ - $1 \leq pi \leq 10^6$ Sum of points ($pi$) of a team will not cross $10^9$. -----Sample Input:-----Sample Input: 1 10 5 amigoes 1 bannermen 1 monarchy 4 outliers 5 iniciador 10 aegimos 2 iiiacdnor 1 eilorstu 1 gimosae 3 mnachroy 7 -----Sample Output:-----Sample Output: iniciador 11 monarchy 11 amigoes 6 outliers 6 bannermen 1 -----Explanation:-----Explanation: $It$ $is$ $assured$ $that$ $each$ $team$ $will$ $submit$ $once$ $within$ $first$ $half$ $an$ $hour$.That means - that kind of submissions isn't possible within first half an hour. Dataset can be huge. Use faster I/O method.	["# cook your dish here\nfor t in range(int(input())):\n n,k=map(int,input().split())\n a=[]\n sr=[]\n for i in range(k):\n x,y=input().split()\n y=int(y)\n a.append([1010-y,x])\n sr.append(sorted(x))\n for i in range(n-k):\n x,y=input().split()\n y=int(y)\n x=sorted(x)\n for j in range(k):\n if x==sr[j]:\n a[j][0]-=y\n break\n a.sort()\n for i in a:\n print(i[1],abs(i[0]-1010))", "for _ in range(int(input())):\n n,r=map(int,input().split())\n s=[]\n d=dict()\n for i in range(r):\n a,b=map(str,input().split())\n s.append([int(b),a])\n a=list(a)\n a.sort()\n d[''.join(a)]=i\n for i in range(n-r):\n a,b=map(str,input().split())\n a=list(a)\n a.sort()\n s[d[''.join(a)]][0]+=int(b)\n s.sort(key=lambda x:x[1], reverse=True)\n s.sort(key=lambda x:x[0])\n for i in range(-1,-r-1,-1):\n print(s[i][1],s[i][0])", "for _ in range(int(input())):\n n,r=map(int,input().split())\n s=[]\n d=dict()\n for i in range(r):\n a,b=map(str,input().split())\n s.append([int(b),a])\n a=list(a)\n a.sort()\n d[''.join(a)]=i\n for i in range(n-r):\n a,b=map(str,input().split())\n a=list(a)\n a.sort()\n s[d[''.join(a)]][0]+=int(b)\n s.sort(key=lambda x:x[1], reverse=True)\n s.sort(key=lambda x:x[0])\n for i in range(-1,-r-1,-1):\n print(s[i][1],s[i][0])", "# cook your dish here\nfor _ in range(int(input())):\n n, r = map(int, input().split())\n reg_teams = [input().split() for _ in range(r)]\n after = [input().split() for _ in range(n - r)]\n check1 = [[''.join(sorted(list(s))), int(p), s] for s, p in reg_teams]\n check2 = {}\n for a in after:\n cur = \"\".join(sorted(list(a[0])))\n if cur in check2.keys():\n check2[cur] += int(a[1])\n else:\n check2[cur] = int(a[1])\n for c in check1:\n if c[0] in check2.keys():\n c[1] += check2[c[0]]\n\n check1.sort(key = lambda z: z[2])\n check1.sort(key = lambda z: z[1], reverse = True)\n for c in check1:\n print(c[2], c[1])"]	{"inputs": [["1", "10 5", "amigoes 1", "bannermen 1", "monarchy 4", "outliers 5", "iniciador 10", "aegimos 2", "iiiacdnor 1", "eilorstu 1", "gimosae 3", "mnachroy 7"]], "outputs": [["iniciador 11", "monarchy 11", "amigoes 6", "outliers 6", "bannermen 1"]]}	INTERVIEW	PYTHON3	CODECHEF	2,279
9f4763a03b342044e3b743dc7708e7b9	UNKNOWN	On a planet called RUIZ LAND, which is ruled by the queen, Erika Ruiz. Each person on that planet has a strength value (strength value >0). That planet has a special rule made by the queen that a boy and a girl will form a couple if their Hate value is a prime number where $Hate$ is given by the formula:- Hate = (boy's strength value) XOR (girl's strength value ) You are given $N$ numbers denoting the strength value of $N$ girls, and each of the $N$ girls has to form a couple with a boy such that sum of $Hate$ value of all the $N$ couples will be minimum. You need to print the strength value of each boy, Where the boy at index $i$ will form a couple with the girl at index $i$, where $1 \leq i \leq N$. Assume that you can always find at least one boy having that strength for each girl. -----Input:----- - First line will contain $N$, the number of Girls. - Next line contains $N$ numbers separated by space denoting strength value for each girl. -----Output:----- Print the required $N$ numbers denoting strength of boys. -----Constraints----- - $1 \leq N \leq 100000$ - $1 \leq A_i \leq 10^9$ , (where $1 \leq i \leq N$) and $A_i$ denotes strength of i'th girl. -----Sample Input:----- 2 10 16 -----Sample Output:----- 8 18	["n=int(input())\r\na=list(map(int,input().split()))\r\nc=[]\r\nfor i in range(len(a)):\r\n if a[i]==2:\r\n c.append(1)\r\n else:\r\n c.append(a[i]^2)\r\nprint(c)", "import copy\r\nn=int(input())\r\na=list(map(int,input().split()))\r\nc=[]\r\nfor i in range(len(a)):\r\n if a[i]==2:\r\n c.append(1)\r\n else:\r\n str=bin(a[i])[2:]\r\n if len(str)!=32:\r\n rem=32-len(str)\r\n str='0'rem+str\r\n str1=copy.deepcopy(str)\r\n str1=list(x for x in str1)\r\n\r\n if str[31]=='0':\r\n str1[31]='0'\r\n if str[31]=='1':\r\n str1[31]='1'\r\n if str[30]=='0':\r\n str1[30]='1'\r\n if str[30]=='1':\r\n str1[30]='0'\r\n ##print(str1)\r\n str1=''.join(str1)\r\n x=int(str1,2)\r\n c.append(x)\r\nprint(c)", "# cook your dish here\r\nn=int(input())\r\nl=list(map(int,input().split()))\r\nfor i in l:\r\n if i==1:\r\n print(3,end=' ')\r\n continue\r\n if i==2:\r\n print(1,end=' ')\r\n continue\r\n s=list(bin(i)[2:])\r\n if s[-2]=='1':\r\n s[-2]='0'\r\n else:\r\n s[-2]='1'\r\n x=int(''.join(s),2)\r\n print(x,end=' ')\r\nprint()\r\n", "n=int(input())\r\na=list(map(int,input().rstrip().split()))\r\nans=[]\r\nfor i in a:\r\n if i==2:\r\n ans.append(1)\r\n else:\r\n ans.append(i^2)\r\nprint(ans)", "\r\nlens = int(input())\r\narrs = [int(x) for x in input().split()]\r\nvals = []\r\nfor a in arrs:\r\n if a != 2:\r\n vals.append(2 ^ a)\r\n else:\r\n vals.append(3 ^ a)\r\nprint(vals)", "n=int(input())\r\nl=list(map(int,input().split()))\r\nans=[]\r\nfor i in l:\r\n if i==2:\r\n ans.append(1)\r\n else:\r\n ans.append(i^2)\r\nprint(ans)", "n=int(input())\r\nl=list(map(int,input().split()))\r\nans=[]\r\nfor i in l:\r\n if i==2:\r\n ans.append(1)\r\n else:\r\n ans.append(i^2)\r\nprint(ans)", "from sys import stdin, stdout\nfrom math import floor, gcd, fabs, factorial, fmod, sqrt, inf, log\nfrom collections import defaultdict as dd, deque\nfrom heapq import merge, heapify, heappop, heappush, nsmallest\nfrom bisect import bisect_left as bl, bisect_right as br, bisect\nmod = pow(10, 9) + 7\nmod2 = 998244353\ndef inp(): return stdin.readline().strip()\ndef out(var, end=\"\\n\"): stdout.write(str(var)+\"\\n\")\ndef outa(var, end=\"\\n\"): stdout.write(' '.join(map(str, var)) + end)\ndef lmp(): return list(mp())\ndef mp(): return map(int, inp().split())\ndef smp(): return map(str, inp().split())\ndef l1d(n, val=0): return [val for i in range(n)]\ndef l2d(n, m, val=0): return [l1d(n, val) for j in range(m)]\ndef remadd(x, y): return 1 if x%y else 0\ndef ceil(a,b): return (a+b-1)//b\n\ndef isprime(x):\n if x<=1: return False\n if x in (2, 3): return True\n if x%2 == 0: return False\n for i in range(3, int(sqrt(x))+1, 2):\n if x%i == 0: return False\n return True\n \nn = int(inp())\narr = lmp()\nfor i in range(n):\n if arr[i]==2:\n print(1, end=\" \")\n elif arr[i]^2<arr[i]:\n print(arr[i]-2, end=\" \")\n else:\n print(arr[i]+2, end=\" \")\nprint()\n ", "# cook your dish here\r\nn=int(input())\r\na=[int(i) for i in input().split()]\r\nfor i in a:\r\n if i==1:\r\n print(\"2\",'',end='')\r\n elif i==2:\r\n print(\"1\",'',end='')\r\n else:\r\n b=str(bin(i)).replace('0b','')\r\n p=''\r\n l=len(b)\r\n if b[l-1]=='0':\r\n p='0'\r\n else:\r\n p='1'\r\n if b[l-2]=='0':\r\n p='1'+p\r\n else:\r\n p='0'+p\r\n for j in range(l-3,-1,-1):\r\n p=b[j]+p\r\n print(int(p,2),'',end='')\r\nprint()", "# cook your dish here\r\n# cook your dish here\r\ndef solve():\r\n k = int(input())\r\n #n,m = input().split()\r\n #n = int(n)\r\n #m = int(m)\r\n #s = input()\r\n a = list(map(int, input().split()))\r\n #print(a)\r\n for i in range(k):\r\n n2=-1\r\n if a[i]==1 :n2 =3\r\n elif a[i]==2 :n2 =1\r\n else:\r\n b = bin(a[i]).replace(\"0b\",\"\")\r\n n = len(b)\r\n #print(b)\r\n if b[n-2]=='0': b=b[0:n-2]+'1'+b[n-1:]\r\n else: b=b[0:n-2]+'0'+b[n-1:]\r\n #print(b)\r\n n2 = int(b,2)\r\n #print(n2)\r\n if i==k-1:print(n2,end=\"\")\r\n else: print(n2,end=\" \")\r\n \r\n \r\n \r\n \r\ndef __starting_point():\r\n #T = int(input())\r\n #for i in range(T):\r\n #a = solve()\r\n #n = len(a)\r\n #for i in range(n):\r\n # if i==n-1 : print(a[i])\r\n # else: print(a[i],end=\" \")\r\n (solve())\n__starting_point()", "# cook your dish here\r\nn = int(input())\r\narr = list(map(int,input().split()))\r\nfor i in arr:\r\n\tif i == 2:\r\n\t\tprint(\"1\",end=\" \")\r\n\telse:\r\n\t\tprint(i^2,end=\" \")", "def func(lst):\r\n for i in lst:\r\n if i == 2:\r\n print(i^3, end=' ')\r\n else:\r\n print(i^2, end=' ')\r\n\r\n\r\nn = int(input())\r\nlst = list(map(int, input().split()))\r\nfunc(lst)\r\n\r\n", "n=int(input())\r\nb=list(map(int,input().split()))\r\nres=[]\r\nfor j in range(n):\r\n if b[j]!=2:\r\n res.append(b[j]^2)\r\n\r\n else:\r\n res.append(b[j]^3)\r\n\r\nprint(res)", "# author : Tapan Goyal\r\n# MNIT Jaipur\r\n\r\nimport math\r\nimport bisect\r\nimport itertools\r\nimport sys\r\nI=lambda : sys.stdin.readline()\r\none=lambda : int(I())\r\nmore=lambda : map(int,I().split())\r\nlinput=lambda : list(more())\r\n\r\nmod=109 +7\r\ninf=1018 + 1 \r\n\r\n'''fact=[1]100001\r\nifact=[1]100001\r\nfor i in range(1,100001):\r\n fact[i]=((fact[i-1])i)%mod\r\n ifact[i]=((ifact[i-1])pow(i,mod-2,mod))%mod\r\ndef ncr(n,r):\r\n return (((fact[n]ifact[n-r])%mod)ifact[r])%mod\r\ndef npr(n,r):\r\n return (((fact[n]ifact[n-r])%mod))\r\n '''\r\n\r\n\r\ndef merge(a,b):\r\n i=0;j=0\r\n c=0\r\n ans=[]\r\n while i<len(a) and j<len(b):\r\n if a[i]<b[j]:\r\n ans.append(a[i])\r\n i+=1\r\n else:\r\n ans.append(b[j])\r\n c+=len(a)-i\r\n j+=1\r\n ans+=a[i:]\r\n ans+=b[j:]\r\n return ans,c\r\ndef mergesort(a):\r\n if len(a)==1:\r\n return a,0\r\n mid=len(a)//2 \r\n left,left_inversion=mergesort(a[:mid])\r\n right,right_inversion=mergesort(a[mid:])\r\n m,c=merge(left,right)\r\n c+=(left_inversion+right_inversion)\r\n return m,c\r\n \r\ndef is_prime(num):\r\n if num == 1: return False\r\n if num == 2: return True\r\n if num == 3: return True\r\n if num%2 == 0: return False\r\n if num%3 == 0: return False\r\n t = 5\r\n a = 2\r\n while t <= int(math.sqrt(num)):\r\n if num%t == 0: return False\r\n t += a\r\n a = 6 - a\r\n return True\r\n\r\n \r\ndef ceil(a,b):\r\n return (a+b-1)//b\r\n \r\n\r\n\r\n#/////////////////////////////////////////////////////////////////////////////////////////////////\r\ndef __starting_point():\r\n for _ in range(1):\r\n n=one()\r\n a=linput()\r\n for i in a:\r\n ans=i^2\r\n if ans>0:\r\n print(ans,end=\" \")\r\n else:\r\n print(i^3,end=\" \")\r\n \r\n \n__starting_point()", "# cook your dish here\nn=int(input())\na=list(map(int,input().split()))\nb=[]\nfor i in range (n):\n num=a[i]\n b.append(num)\n num//=2\n if num%2==1:\n b[i]-=2\n else:\n b[i]+=2\n if b[i]==0:\n b[i]=1\nprint(b)", "# cook your dish here\nn=int(input())\narr=list(map(int,input().split()))\nfor x in arr:\n if x==2:\n print(end='1 ')\n else:\n y=x%4\n if y>1:\n print(x-2,end=' ')\n else:\n print(x+2,end=' ')\nprint()\n", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\nfor i in a:\r\n if i != 2:\r\n print(i^2, end=' ')\r\n else:\r\n print(1, end=' ')\r\n\r\nprint()\r\n", "# cook your dish here\nn = int(input())\narr = [int(s) for s in input().split(\" \")]\nans = []\nfor x in arr:\n if x == 2:\n ans.append(1)\n else:\n ans.append(x^2)\nprint(ans)", "n = int(input())\n\ndef foo(n):\n if int(n)==2:\n return str(2^3)\n return str(int(n)^2)\n\ndata = list(map(foo, input().split()))\n\nprint(' '.join(data))\n", "import sys\r\ndef get_ints(): return map(int, sys.stdin.readline().strip().split())\r\ndef get_int(): return list(map(int, sys.stdin.readline().strip().split()))[0]\r\ndef get_list(): return list(map(int, sys.stdin.readline().strip().split()))\r\ndef get_string(): return sys.stdin.readline().strip()\r\n\r\nN = 0\r\na = []\r\n\r\ndef solve():\r\n nonlocal N\r\n N = get_int()\r\n a = get_list()\r\n for i in a:\r\n if i == 2:\r\n print(1, end=' ')\r\n else:\r\n print(i ^ 2, end=' ')\r\n print()\r\n\r\ntest_cases = 1 # get_int()\r\n\r\nfor _ in range(test_cases):\r\n solve()\r\n", "from sys import stdin, stdout\r\n# #from collections import Counter\r\n# n = int(stdin.readline())\r\n# #l = list(map(int, stdin.readline().split()))\r\n# #l = [int(stdin.readline()) for _ in range(n)]\r\n# #a, b = input().split()\r\n# for _ in range(n):\r\nn1 = int(stdin.readline())\r\nl = list(map(int, stdin.readline().split()))\r\nfor x in l:\r\n if x!=2:\r\n print(x^2,end=' ')\r\n else:\r\n print(1,end=' ')\r\nprint()", "n=int(input())\r\nl=list(map(int,input().split()))\r\nans=[]\r\nfor i in l:\r\n x=i^2\r\n if x==0:\r\n ans.append(i^3)\r\n else:\r\n ans.append(x)\r\nprint(*ans)\r\n"]	{"inputs": [["2", "10 16"]], "outputs": [["8 18"]]}	INTERVIEW	PYTHON3	CODECHEF	9,827
0d6aea4a28a26aba598a2238227743d4	UNKNOWN	Vasya has ordered a pizza delivery. The pizza can be considered a perfect circle. There were $n$ premade cuts in the pizza when it was delivered. Each cut is a straight segment connecting the center of the pizza with its boundary. Let $O$ be the center of the pizza, $P_i$ be the endpoint of the $i$-th cut lying on the boundary, and $R$ be the point of the boundary straight to the right of $O$. Then the counterclockwise-measured angle $\angle ROP_i$ is equal to $a_i$ degrees, where $a_i$ is an integer between $0$ and $359$. Note that angles between $0$ and $180$ angles correspond to $P_i$ in the top half of the pizza, while angles between $180$ and $360$ angles correspond to the bottom half. Vasya may cut his pizza a few more times, and the new cuts still have to be straight segments starting at the center. He wants to make the pizza separated into several equal slices, with each slice being a circular sector with no cuts inside of it. How many new cuts Vasya will have to make? -----Input:----- The first line of input contains $T$ , i.e number of test cases per file. The first line of each test case contains a single integer $n-$ the numbers of premade cuts ($2 \leq n \leq 360$). The second lines contains $n$ integers $a_1, \ldots, a_n-$ angles of the cuts $1, \ldots, n$ respectively ($0 \leq a_1 < \ldots, a_{n - 1} < 360$). -----Output:----- Print a single integer$-$ the smallest number of additional cuts Vasya has to make so that the pizza is divided into several equal slices. -----Constraints----- - $1 \leq T \leq 36$ - $2 \leq n \leq 360$ - $0 \leq a_1 < \ldots, a_{n - 1} < 360$ -----Sample Input:----- 3 4 0 90 180 270 2 90 210 2 0 1 -----Sample Output:----- 0 1 358 -----EXPLANATION:----- In the first sample the pizza is already cut into four equal slices. In the second sample the pizza will be cut into three equal slices after making one extra cut at $330$ degrees. In the third sample Vasya will have to cut his pizza into $360$ pieces of $1$ degree angle each.	["def gcd(a, b):\n if a == 0:\n return b\n return(gcd(b % a, a))\n\nt = int(input())\nfor T in range(t):\n n = int(input())\n l = [int(x) for x in input().split()]\n\n ang = []\n for i in range(1, n):\n ang.append(l[i] - l[i - 1])\n ang.append(360 - (l[-1] - l[0]))\n ang.sort()\n if ang == ang[::-1]:\n print(0)\n continue\n \n g = ang[0]\n for i in range(1, n):\n g = gcd(g, ang[i])\n\n \n total = 360 // g - len(ang)\n print(total)\n## print(g, ang, total)\n\n\n", "# cook your dish here\nfrom functools import reduce\nfrom math import gcd\n\nfor _ in range(int(input())):\n n = int(input())\n a = [int(i) for i in input().split()]\n arr = []\n val = 0\n for i in a:\n arr.append(i-val)\n val = i\n \n arr[0] = 360 - (val-arr[0])\n arr.append(360)\n q = reduce(gcd, arr)\n needed = 360/q\n print(int(needed - n))", "from functools import reduce\nfrom math import gcd\n\nfor _ in range(int(input())):\n n = int(input())\n a = [int(i) for i in input().split()]\n arr = []\n val = 0\n for i in a:\n arr.append(i-val)\n val = i\n \n arr[0] = 360 - (val-arr[0])\n arr.append(360)\n q = reduce(gcd, arr)\n needed = 360/q\n print(int(needed - n)) \n", "# cook your dish here\ndef isDivisible(a, k):\n for i in a:\n if (i%k!=0):\n return False\n return True\ndef find_gcd(x, y): \n \n while(y): \n x, y = y, x % y \n \n return x \n \ndef findHCF(l):\n gcd = find_gcd(l[0], l[1]) \n \n for i in range(2, len(l)): \n gcd = find_gcd(gcd, l[i]) \n return gcd\ndef calDegree(a):\n b = []\n p = a[0]\n i = 1\n while(i<len(a)):\n b.append((a[i]-p)%360)\n p = a[i]\n i+=1\n return b\ndef calRawCount(a, k):\n s = 0\n for i in a:\n s+=(i//k)\n return s\nt = int(input())\nfor _ in range(t):\n n = int(input())\n l = list(map(int, input().split(\" \")))\n l.append(l[0])\n a = calDegree(l)\n \n HCF = findHCF(a)\n \n raw_count = calRawCount(a, HCF)\n print(raw_count-len(l)+1)\n", "# cook your dish here\nfrom functools import reduce\nfrom math import gcd\nfor _ in range(int(input())):\n num=int(input())\n cuts=list(map(int,input().split(\" \")))\n initial_cuts=[0](num-1)\n for i in range(0,num-1):\n \n initial_cuts[i]=cuts[i+1]-cuts[i]\n initial_cuts.append(360) \n red=reduce(gcd,initial_cuts)\n total_initial=int(360/red)\n vasya_cuts=total_initial-num\n print(vasya_cuts)", "t=int(input())\n\ndef gcd(a,b):\n if a<b:\n a=a+b\n b=a-b\n a=a-b\n\n if a%b==0:\n return b\n else:\n c=a%b\n return gcd(b,c)\n\nfor _ in range(t):\n n=int(input())\n angle_list=list(map(int,input().split()))\n slice_list=[]\n for i in range(n):\n if i==n-1:\n theta=angle_list[0]+360-angle_list[i]\n else:\n theta=angle_list[i+1]-angle_list[i]\n slice_list.append(theta)\n for i in range(n-1):\n slice_list[1]=gcd(slice_list[0],slice_list[1])\n slice_list.pop(0)\n slices=360/slice_list[0]-n\n print(str(int(slices)))\n", "def find_gcd(x, y):\n while y:\n x, y = y, x % y\n\n return x\n\n\nT = int(input())\n\nfor i in range(T):\n N = int(input())\n lst = [int(x) for x in input().strip().split()]\n diff = []\n\n for j in range(1, len(lst)):\n diff.append(lst[j] - lst[j - 1])\n\n diff.append(360)\n\n gcd = find_gcd(diff[0], diff[1])\n for j in range(2, len(diff)):\n gcd = find_gcd(gcd, diff[j])\n\n print(360 // gcd - N)\n", "# cook your dish here\nfrom functools import reduce\nfrom math import gcd\nfor _ in range(int(input())):\n num=int(input())\n cuts=list(map(int,input().split(\" \")))\n initial_cuts=[0](num-1)\n for i in range(0,num-1):\n \n initial_cuts[i]=cuts[i+1]-cuts[i]\n initial_cuts.append(360) \n red=reduce(gcd,initial_cuts)\n total_initial=int(360/red)\n vasya_cuts=total_initial-num\n print(vasya_cuts)\n", "from functools import reduce\nfrom math import gcd\n\nfor _ in range(int(input())):\n n = int(input())\n a = [int(i) for i in input().split()]\n arr = []\n val = 0\n for i in a:\n arr.append(i-val)\n val = i\n \n arr[0] = 360 - (val-arr[0])\n arr.append(360)\n q = reduce(gcd, arr)\n needed = 360/q\n print(int(needed - n)) ", "#cut pizza codechef solution\n#first try to handle boundary conditions, if n(cuts) = 360, return 0\nfrom math import gcd\nfrom functools import reduce\n\ndef n_cuts(x):\n \"\"\"\n x: list of cuts \n\n \"\"\"\n l = len(x)\n if(l == 360):\n print(0)\n return\n\n #find minimum difference\n mini = min(x)\n flag = 0\n for i in range(len(x)):\n if(x[i]%mini != 0):\n flag = 1\n break\n if(flag == 0):\n if(360%mini == 0):\n print(360//mini - l)\n return\n\n\n #find gcd\n GCD = reduce(gcd, x)\n result = int(360/GCD)\n print(result-l)\n return\n\n\n\ndef __starting_point():\n t = int(input()) #number of test cases\n for i in range(t):\n n = int(input()) #not use\n x = list(map(int, input().split(' '))) #x is the cuts list\n diff = []\n for i in range(1,len(x)):\n diff.append(x[i]-x[i-1])\n diff.append(360-x[-1]+x[0])\n n_cuts(diff)\n\n\n\n\n\n\n\n\n\n\n\n\n\n__starting_point()", "# cook your dish here\nt = int(input())\n\nfor x in range(t):\n cu = int(input())\n angle = list(map(int, input().split()))\n \n diff = []\n mi = float('infinity')\n for i in range(cu - 1):\n diff.append(angle[i + 1] - angle[i])\n if diff[i] < mi:\n mi = diff[i]\n \n diff.append(angle[0] - angle[cu - 1] + 360)\n if diff[cu - 1] < mi:\n mi = diff[cu - 1]\n div = 1\n while div < 360:\n smallest = mi / div\n count = 0\n flag = True\n for i in diff:\n dm = divmod(i, smallest)\n if dm[1] != 0:\n flag = False\n break\n count += dm[0]\n if flag:\n print(int(count - cu))\n break\n div += 1", "from functools import reduce\nfrom math import gcd\n\nfor _ in range(int(input())):\n n = int(input())\n a = [int(i) for i in input().split()]\n arr = []\n val = 0\n for i in a:\n arr.append(i-val)\n val = i\n \n arr[0] = 360 - (val-arr[0])\n arr.append(360)\n q = reduce(gcd, arr)\n needed = 360/q\n print(int(needed - n))\n", "from functools import reduce\nfrom math import gcd\n\nfor _ in range(int(input())):\n n = int(input())\n a = [int(i) for i in input().split()]\n arr = [0]360\n\n for i in a:\n arr[i] = 1\n #arr[(180+i)%360] = 1\n val = 0\n dif = []\n for i in range(0,360):\n if(arr[i] == 1):\n dif.append(i - val)\n #print(i, val)\n val = i\n #print(val, dif[0]) \n #print(arr) \n dif[0] = 360 - (val - dif[0])\n dif.append(360)\n #print(dif)\n q = reduce(gcd, (dif))\n needed = 360/q\n print(int(needed - n))\n", "def gcd(n1,n2):\n m=1\n di=2\n while di<=min(n1,n2) and (n1>1 and n2>1):\n if n1%di==0 and n2%di==0:\n n1//=di\n n2//=di\n m=di\n else:\n di+=1\n return m\nfor _ in range(int(input())):\n n=int(input())\n a=list(map(int,input().split()))\n mi,d=a[1]-a[0],[a[1]-a[0]]\n for i in range(2,n):\n d+=[a[i]-a[i-1]]\n if (d[i-1]%mi)!=0:\n mi=gcd(mi,d[i-1])\n d+=[360-a[n-1]+a[0]]\n if (d[n-1]%mi)!=0:\n mi=gcd(mi,d[n-1])\n print(360//mi-n)\n \n \n", "def gcd(a, b):\n if b == 0:\n return a\n return gcd(b, a%b)\n\ndef gcd_of_list(lst):\n a = lst[0]\n for item in lst:\n a = gcd(item, a)\n if a == 1:\n return 1\n return a\n\ndef __starting_point():\n cases = int(input())\n for _ in range(cases):\n cuts = int(input())\n angles = list(map(int, input().split()))\n min_angle = angles[0]\n size = []\n for i in range(cuts):\n if i != cuts-1:\n size.append(angles[i+1]-angles[i])\n size.append(360-angles[-1]+angles[0])\n diff = gcd_of_list(size)\n print(360//diff - len(size))\n__starting_point()", "# cook your dish here\nimport numpy as np\nimport math\nfor t in range(int(input())):\n n=int(input())\n a=list(map(int,input().split()))\n aa=np.zeros([n],dtype=int)\n for i in range(n-1):\n aa[i]=a[i+1]-a[i]\n aa[n-1]=360-a[n-1]+a[0]\n hcf=180\n for i in range(n):\n hcf=min(hcf,math.gcd(aa[i%n],aa[(i+1)%n]))\n print(360//hcf-n)", "def gcd(a, b):\n if b == 0:\n return a\n return gcd(b, a%b)\n\ndef gcd_of_list(lst):\n a = lst[0]\n for item in lst:\n a = gcd(item, a)\n if a == 1:\n return 1\n return a\n\ndef __starting_point():\n cases = int(input())\n for _ in range(cases):\n cuts = int(input())\n angles = list(map(int, input().split()))\n min_angle = angles[0]\n size = []\n for i in range(cuts):\n if i != cuts-1:\n size.append(angles[i+1]-angles[i])\n size.append(360-angles[-1]+angles[0])\n diff = gcd_of_list(size)\n print(360//diff - len(size))\n\n__starting_point()", "T=int(input())\ndef gcd(a,b):\n if(b==0):\n return a\n else:\n return gcd(b,a%b)\nfor i in range(T):\n N=int(input())\n arrst=input()\n arr=list(map(int,arrst.split()))\n count=0\n arr.sort()\n lis=[arr[0]-arr[len(arr)-1]+360]\n \n for j in range(len(arr)-1):\n lis+=[arr[j+1]-arr[j]]\n ans=lis[0] \n for j in range(len(arr)):\n ans=gcd(ans,lis[j])\n for j in range(len(arr)):\n count+=(lis[j]//ans)-1\n print(int(count)) \n \n\n", "from math import gcd\nT=int(input());\nx=[];\nfor i in range(T):\n n=int(input());\n a=[int(i) for i in input().split()]\n g=a[1]-a[0];\n for i in range(1,n):\n g=gcd(g,a[i]-a[i-1]);\n g=gcd(g,360-a[n-1]+a[0]);\n count=0;\n for i in range(1,n):\n count+=(a[i]-a[i-1])//g-1;\n count+=(360-a[n-1]+a[0])//g-1;\n print(count)\n", "def hcf(a, b):\n if b == 0:\n return (a)\n else:\n return (hcf(b, a % b))\n\nt=int(input())\nfor i in range(t):\n\n n=int(input())\n a=list(map(int,input().strip().split()))\n b=[]\n for j in range(len(a)-1):\n b.append(a[j+1]-a[j])\n b.append(360-a[len(a)-1]+a[0])\n for k in range(len(b)-1):\n b[k+1]=hcf(b[k],b[k+1])\n p=360/b[len(b)-1]\n print(int(p-len(a)))", "def gcd(a,b):\n if b==0:\n return a\n else:\n return gcd(b,a%b)\nt=int(input())\nfor _ in range(t):\n n=int(input())\n a=[int(i) for i in input().split()]\n x=[]\n for i in range(1,n):\n x.append(a[i]-a[i-1])\n x.append(360-a[n-1]+a[0])\n p=x[0]\n s=0\n for i in x:\n p=gcd(p,i)\n for i in x:\n s+=i//p-1\n print(s)", "# cook your dish here\ndef gcd(a,b):\n if b==0:\n return a\n else:\n return gcd(b,a%b)\nt=int(input())\nfor _ in range(t):\n n=int(input())\n a=[int(i) for i in input().split()]\n x=[]\n for i in range(1,n):\n x.append(a[i]-a[i-1])\n x.append(360-a[n-1]+a[0])\n p=x[0]\n s=0\n for i in x:\n p=gcd(p,i)\n for i in x:\n s+=i//p-1\n print(s)", "from math import gcd\nfor _ in range(int(input())):\n n=int(input())\n l=[int(y) for y in input().split(' ')]\n g=l[1]-l[0]\n count=0\n for i in range(1,n):\n g=gcd(g,l[i]-l[i-1])\n g=gcd(g,360-l[n-1]+l[0])\n for i in range(1, n):\n count+=(l[i]-l[i-1])//g-1\n count+=(360-l[n-1]+l[0])//g-1\n print(count)"]	{"inputs": [["3", "4", "0 90 180 270", "2", "90 210", "2", "0 1"]], "outputs": [["0", "1", "358"]]}	INTERVIEW	PYTHON3	CODECHEF	10,414
3be38813c5dc7e9bd5454cd5ea0db4bd	UNKNOWN	Digory Kirke and Polly Plummer are two kids living next door to each other. The attics of the two houses are connected to each other through a passage. Digory's Uncle Andrew has been secretly doing strange things in the attic of his house, and he always ensures that the room is locked. Being curious, Digory suspects that there is another route into the attic through Polly's house, and being curious as kids always are, they wish to find out what it is that Uncle Andrew is secretly up to. So they start from Polly's house, and walk along the passageway to Digory's. Unfortunately, along the way, they suddenly find that some of the floorboards are missing, and that taking a step forward would have them plummet to their deaths below. Dejected, but determined, they return to Polly's house, and decide to practice long-jumping in the yard before they re-attempt the crossing of the passage. It takes them exactly one day to master long-jumping a certain length. Also, once they have mastered jumping a particular length L, they are able to jump any amount less than equal to L as well. The next day they return to their mission, but somehow find that there is another place further up the passage, that requires them to jump even more than they had practiced for. So they go back and repeat the process. Note the following: - At each point, they are able to sense only how much they need to jump at that point, and have no idea of the further reaches of the passage till they reach there. That is, they are able to only see how far ahead is the next floorboard. - The amount they choose to practice for their jump is exactly the amount they need to get across that particular part of the passage. That is, if they can currently jump upto a length L0, and they require to jump a length L1(> L0) at that point, they will practice jumping length L1 that day. - They start by being able to "jump" a length of 1. Find how many days it will take them to cross the passageway. In the input, the passageway is described as a string P of '#'s and '.'s. A '#' represents a floorboard, while a '.' represents the absence of a floorboard. The string, when read from left to right, describes the passage from Polly's house to Digory's, and not vice-versa. -----Input----- The first line consists of a single integer T, the number of testcases. Each of the next T lines consist of the string P for that case. -----Output----- For each case, output the number of days it takes them to cross the passage. -----Constraints----- - 1 ≤ T ≤ 1,000,000 (106) - 1 ≤ \|P\| ≤ 1,000,000 (106) - The total length of P will be ≤ 5,000,000 (5 * 106)across all test-cases of a test-file - P will consist of only the characters # and . - The first and the last characters of P will be #. -----Example----- Input: 4 #### ##.#..# ##..#.# ##.#....# Output: 0 2 1 2 -----Explanation----- For the first example, they do not need to learn any jump size. They are able to cross the entire passage by "jumping" lengths 1-1-1. For the second example case, they get stuck at the first '.', and take one day learning to jump length 2. When they come back the next day, they get stuck at '..' and take one day to learn to jump length 3. For the third example case, they get stuck first at '..', and they take one day to learn to jump length 3. On the second day, they are able to jump both length 3 as well as length 2 required to cross the passage. For the last test case they need to stop and learn jumping two times. At first they need to jump a length 2 and then a length 5. -----Appendix----- Irrelevant to the problem description, if you're curious about what Uncle Andrew was up to, he was experimenting on Magic Rings that could facilitate travel between worlds. One such world, as some of you might have heard of, was Narnia.	["# cook your dish here\nfor i in range(int(input())):\n s = input()\n m = 0\n p = 0\n d = 0\n l = []\n for i in range(len(s)):\n if(s[i] == \".\"):\n m = m+1\n elif(s[i] == \"#\"):\n l.append(m)\n m=0\n for i in range(len(l)):\n if(l[i]>p):\n p = l[i]\n d = d+1\n print(d)\n \n \n \n \n", "t=int(input())\nfor _ in range(t):\n s=input()\n l,d,m=0,0,0\n for i in range(len(s)):\n if s[i]=='.':\n l+=1\n if s[i]=='#' :\n if l>m: \n d+=1\n m=l\n l=0\n print(d)", "# cook your dish here\ntest_case = int(input())\nwhile test_case :\n \n passage = input()\n n = len(passage)\n \n count_days = 0 \n jump = 0\n i = 0 \n while i < n:\n \n if passage[i] == '.' :\n count_empty = 1 \n k = i + 1\n while(passage[k] == '.' ) :\n count_empty += 1\n k += 1\n if count_empty > jump :\n count_days += 1\n jump = count_empty \n \n i = k \n else:\n i += 1\n \n print(count_days)\n test_case -= 1\n \n \n \n \n \n \n \n \n \n \n", "# cook your dish here\nt=int(input())\nfor i in range(t):\n s=input()\n count=0\n pre=0\n ans=0\n for val in range(len(s)):\n if s[val]==\"#\":\n # print(count,pre)\n if count>pre:\n # print(ans)\n ans+=1\n pre=count\n # count=0\n count=0\n else:\n count+=1\n print(ans)\n \n \n # pos=s[0]\n # for k in range(len(s)-1):\n # if s[k+1]==\"#\":\n # pos=s[k+1]\n # else:\n \n # if counter\n", "def solve(S):\n \n \n i = 0\n count = 0\n L = 0\n n = len(S)\n end = False\n size = 0\n while (i<n):\n \n if S[i] == '.':\n size +=1\n \n elif size!=0:\n if size>L:\n count+=1\n L = size\n size = 0\n \n i+=1\n \n return count\n\n\nt = int(input())\nfor _ in range(t):\n s = input()\n print(solve(s))", "# https://www.codechef.com/problems/ATTIC\n\nT = int(input())\n\nfor t in range(T):\n s = input()\n L = len(s)\n days = 0\n i = 0\n jump_len_known = 1\n \n while i < L:\n while i < L and s[i] == '#':\n i += 1\n \n if i < L:\n j = i + 1\n \n while j < L and s[j] == '.':\n j += 1\n \n jump_len = j - i + 1\n \n if jump_len_known < jump_len:\n days += 1\n jump_len_known = jump_len\n \n i = j\n\n print(days)\n", "# cook your dish here\nt=int(input())\nfor _ in range(t):\n p=input()\n \n cnt,maxi,ans = 1,1,0\n \n for i in p:\n \n if i=='#' and cnt!=1:\n if cnt>maxi:\n maxi=cnt\n ans+=1\n \n cnt=1\n \n elif i=='.':\n cnt+=1\n \n elif i=='#' and cnt==1:\n continue\n \n if cnt!=1:\n if cnt>maxi:\n ans+=1\n \n print(ans)", "def __starting_point():\n for _ in range(int(input())):\n s = input()\n L, count, days = 0, 0, 0\n for c in s:\n if(c == \"#\"):\n if(count > L):\n days += 1\n L = count\n count = 0\n else:\n count += 1\n if(count > L):\n days += 1\n print(days)\n\n__starting_point()", "def __starting_point():\n for _ in range(int(input())):\n s = input()\n L, count, days = 0, 0, 0\n for c in s:\n if(c == \"#\"):\n if(count > L):\n days += 1\n L = count\n count = 0\n else:\n count += 1\n if(count > L):\n days += 1\n print(days)\n\n__starting_point()", "t = int(input())\nfor _ in range(t):\n w = str(input()).split('#')\n day = 0\n jump = 0\n for i in w:\n if len(i)>jump:\n jump = len(i)\n day+=1\n print(day)# cook your dish here\n", "t=int(input())\nfor _ in range(t):\n n=input()\n s=0\n p=0\n h=0\n if(len(n)==1):\n if(n[0]=='.'):\n print(1)\n else:\n print(0)\n else:\n for i in range(len(n)-1):\n if(n[i]=='.'):\n p+=1\n if(n[i+1]=='#' or i+1==len(n)-1):\n if(p>s):\n h+=1\n s=p\n p=0\n if(h==0 and n[len(n)-1]=='.'):\n print(1)\n else:\n print(h)\n \n", "t = int(input())\nfor _ in range(t) :\n path = str(input()).split('#')\n c = 0\n jump = 0\n for i in path :\n if len(i) > jump :\n jump = len(i)\n c += 1\n print(c)", "T = int(input())\nans = []\n\nfor _ in range(T):\n P = input()\n\n N = len(P)\n days = 0\n jumping_length = 1\n i = 0\n while(i<N):\n if(P[i]=='.'):\n j = i\n while(j<N and P[j]=='.'):\n j += 1\n if(j-i+1 > jumping_length):\n jumping_length = j-i+1\n days += 1\n i = j\n else:\n i += 1\n ans.append(days)\n\nfor i in ans:\n print(i)", "# cook your dish here\nfor i in range(int(input())):\n p=input()\n l=len(p)\n arr=[0]\n count=0\n for j in range(l):\n if(p[j]=='.'):\n count=count+1\n elif(count>0 and p[j]=='#'):\n if(max(arr)<count):\n arr.append(count)\n count=0\n print(len(set(arr))-1)", "# cook your dish here\nfor t in range(int(input())):\n path = input()\n mx = 0\n it = 0\n count = 0\n\n while it < len(path):\n\n if path[it] == '.':\n temp = 0\n\n while path[it] == '.':\n temp += 1\n it += 1\n\n if temp > mx:\n count += 1\n mx = temp\n\n else:\n it += 1\n\n print(count)\n\n\n\n", "# cook your dish here\nt=int(input())\nfor _ in range(t):\n arr=input()\n i=0\n temp=[]\n while i<len(arr):\n count=0\n while i<len(arr) and arr[i]=='#':\n i+=1\n while i<len(arr) and arr[i]=='.':\n count+=1\n i+=1\n if count!=0 and count not in temp:\n temp.append(count)\n check,day=-1,0\n for ele in temp:\n if ele>check:\n day+=1\n check=ele\n print(day)\n \n", "# cook your dish here\nfrom sys import stdin,stdout\nt=int(stdin.readline())\n\ndef attic(s):\n c=0\n l=[]\n k=0\n m=0\n for i in range(len(p)):\n if s[i]=='.':\n c+=1\n else:\n if c > k:\n k=c\n m+=1\n l.append(c)\n \n c=0\n return m\n \nfor _ in range(t):\n p=input()\n r=attic(p)\n print(r)", "# cook your dish here\nt=int(input())\n\ndef attic(s):\n c=0\n l=[]\n k=0\n m=0\n for i in range(len(p)):\n if s[i]=='.':\n c+=1\n else:\n if c > k:\n k=c\n m+=1\n l.append(c)\n \n c=0\n return m\n \nfor _ in range(t):\n p=input()\n r=attic(p)\n print(r)", "# cook your dish here\nt=int(input())\n\ndef attic(s):\n c=0\n l=[]\n k=0\n for i in range(len(p)):\n if s[i]=='.':\n c+=1\n else:\n if c > k:\n k=c\n l.append(c)\n \n c=0\n return len(set(sorted(l)))\n \nfor _ in range(t):\n p=input()\n r=attic(p)\n print(r)", "t = int(input())\nwhile t > 0:\n s = input()\n c = 0\n mx = 0\n d = 0\n for i in range(len(s)):\n c = 0\n if s[i] == '.' and s[i - 1] != '.':\n while s[i] != '#':\n c += 1\n i += 1\n if c > mx:\n d += 1\n mx = c\n print(d)\n t = t - 1\n", "t=int(input())\nfor i in range(t):\n s=list(input())\n mx=0\n count=0\n c=0\n for j in range(len(s)):\n if s[j]=='.':\n count+=1\n else:\n if count>mx:\n c+=1\n mx=max(mx,count)\n count=0\n print(c)\n", "for _ in range(int(input())):\n s = input()\n n = len(s)\n cnt = 0\n ans =0\n c =0\n for i in range(n):\n if s[i]=='.':\n cnt+=1\n else:\n if cnt > ans:\n c+=1\n ans = max(ans,cnt)\n cnt=0\n print(c)", "for _ in range(int(input())):\n string = input()\n count = 0\n list1 = []\n for i in string:\n if i=='.':\n count+=1\n else:\n if count!=0:\n list1.append(count)\n count = 0\n if len(list1)==0:\n print(0)\n else:\n ans = 1\n count = list1[0]\n for a in list1:\n if a>count:\n ans+=1\n count = a\n print(ans)\n", "# cook your dish here\nfor _ in range(int(input())):\n p=input()\n i=0\n count=0\n result=0\n s=0\n while i<len(p):\n if p[i]=='.':\n while p[i]!='#':\n count+=1 \n i+=1 \n if result<count:\n result=count\n s+=1\n count=0\n else:\n i+=1\n print(s)\n", "t=int(input())\nfor i in range(t):\n s=str(input())\n l=[]\n cou=0\n for j in s:\n if(j=='.'):\n cou+=1\n else:\n if(cou!=0):\n l.append(cou)\n cou=0\n if(len(l)==0):\n print(0)\n else:\n cou=l[0]\n ans=1\n for j in l:\n if(j>cou):\n ans+=1\n cou=j\n print(ans) "]	{"inputs": [["4", "####", "##.#..#", "##..#.#", "##.#....#"]], "outputs": [["0", "2", "1", "2"]]}	INTERVIEW	PYTHON3	CODECHEF	7,659
dd3809d100b7d788c6742ccc9accff17	UNKNOWN	Chef has an array A consisting of N integers (1-based indexing). He asks you to perform the following operation M times: for i = 2 to N: Ai = Ai + Ai-1 Your task is to find the xth element of the array (i.e., Ax) after performing the above operation M times. As the answer could be large, please output it modulo 109 + 7. -----Input----- - The first line of input contains an integer T denoting the number of test cases. - The first line of each test case contains three space-separated integers — N, x, and M — denoting the size of the array, index of the element you need to find, and the amount of times you need to repeat operation before finding the element, respectively. The second line contains N space-separated integers A1, A2, …, AN. -----Output----- For each test case, output a single line containing one integer: Ax modulo 109 + 7. -----Constraints----- - 1 ≤ T ≤ 10 - 1 ≤ x ≤ N ≤ 105 - 1 ≤ M ≤ 1018 - 1 ≤ Ai ≤ 1018 -----Subtasks-----Subtask 1 (8 points): - 1 ≤ x ≤ min{2, N}Subtask 2 (24 points): - 1 ≤ N * M ≤ 106Subtask 3 (68 points): No additional constraints -----Example----- Input: 2 3 2 3 1 2 3 3 3 3 1 2 3 Output: 5 15 -----Explanation----- Values in the array A: - Before the operations: [1, 2, 3] - After the first operation: [1, 3, 6] - After the second operation: [1, 4, 10] - After the third operation: [1, 5, 15] Since input file can be fairly large (about 8 MB), it's recommended to use fast I/O (for example, in C++, use scanf/printf instead of cin/cout).	["for _ in range(int(input())):\n n,x,m = map(int,input().split())\n a = list(map(int,input().split()))\n for _ in range(m):\n for i in range(1,n):\n a[i] = a[i] + a[i-1]\n print(a[x-1]%(10*9+7))", "def modInverse(a, m) : \n m0 = m \n y = 0\n x = 1\n\n if (m == 1) : \n return 0\n\n while (a > 1) : \n q = a // m \n\n t = m \n m = a % m \n a = t \n t = y \n y = x - q y \n x = t \n if (x < 0) : \n x = x + m0 \n\n return x\np=10*9+7\nf=[1](100000+1)\nfor i in range(1,100000+1):\n f[i]=if[i-1]\n if f[i]>p:\n f[i]=f[i]%p\n\nfor _ in range(int(input())):\n n,x,m=map(int,input().split( ))\n m=m%p\n a=list(map(int,input().split( ))) \n pre=[1](x)\n for i in range(1,x):\n pre[i]=pre[i-1]((m+(i-1)))f[i-1]\n inv=modInverse(f[i],p)\n pre[i]=(pre[i]inv)%p\n ans=0\n j=0 \n for i in range(x-1,-1,-1):\n ans+=a[j]pre[i]\n if ans>p:\n ans=ans%p\n j+=1\n print(ans%p)", "def modInverse(a, m) : \n m0 = m \n y = 0\n x = 1\n\n if (m == 1) : \n return 0\n\n while (a > 1) : \n q = a // m \n\n t = m \n m = a % m \n a = t \n t = y \n y = x - q * y \n x = t \n if (x < 0) : \n x = x + m0 \n\n return x\np=10*9+7\nf=[1](100000+1)\nfor i in range(1,100000+1):\n f[i]=if[i-1]\n if f[i]>p:\n f[i]=f[i]%p\n\nfor _ in range(int(input())):\n n,x,m=map(int,input().split( ))\n m=m%p\n a=list(map(int,input().split( ))) \n pre=[1](x)\n for i in range(1,x):\n pre[i]=pre[i-1]((m+(i-1)))f[i-1]\n inv=modInverse(f[i],p)\n pre[i]=(pre[i]inv)%p\n ans=0\n j=0 \n for i in range(x-1,-1,-1):\n ans+=a[j]pre[i]\n if ans>p:\n ans=ans%p\n j+=1\n print(ans%p)", "p=10*9+7\nf=[1](100000+1)\nfor i in range(1,100000+1):\n f[i]=if[i-1]\n if f[i]>p:\n f[i]=f[i]%p\n\nfor _ in range(int(input())):\n n,x,m=map(int,input().split( ))\n m=m%p\n a=list(map(int,input().split( ))) \n pre=[1](x)\n for i in range(1,x):\n pre[i]=((((pre[i-1]%p)((m+(i-1))%p))%p)%p(f[i-1]%p))%p\n pre[i]=pre[i]//f[i]\n ans=0\n j=0 \n for i in range(x-1,-1,-1):\n ans+=a[j]pre[i]\n if ans>p:\n ans=ans%p\n j+=1\n print(ans%p)", "p=109+7\nf=[1](100000+1)\nfor i in range(1,100000+1):\n f[i]=if[i-1]\n if f[i]>p:\n f[i]=f[i]%p\n\nfor _ in range(int(input())):\n n,x,m=map(int,input().split( ))\n m=m%p\n a=list(map(int,input().split( ))) \n pre=[1](x)\n for i in range(1,x):\n pre[i]=pre[i-1](m+(i-1))f[i-1]\n if pre[i]>p:\n pre[i]=pre[i]%p\n pre[i]=pre[i]//f[i]\n ans=0\n j=0 \n for i in range(x-1,-1,-1):\n ans+=a[j]pre[i]\n if ans>p:\n ans=ans%p\n j+=1\n print(ans%p)", "p=109+7\nf=[1](100000+1)\nfor i in range(1,100000+1):\n f[i]=if[i-1]\n if f[i]>=p:\n f[i]=f[i]%p\n\nfor _ in range(int(input())):\n n,x,m=map(int,input().split( ))\n m=m%p\n a=list(map(int,input().split( ))) \n pre=[1](x)\n for i in range(1,x):\n pre[i]=pre[i-1](m+(i-1))f[i-1]\n if pre[i]>=p:\n pre[i]=pre[i]%p\n pre[i]=pre[i]//f[i]\n ans=0\n j=0 \n for i in range(x-1,-1,-1):\n ans+=a[j]pre[i]\n if ans>=p:\n ans=ans%p\n j+=1\n print(ans%p)", "p=109+7\nf=[1](100000+1)\nfor i in range(1,100000):\n f[i]=if[i-1]\n if f[i]>=p:\n f[i]=f[i]%p\n\nfor _ in range(int(input())):\n n,x,m=map(int,input().split( ))\n m=m%p\n a=list(map(int,input().split( ))) \n pre=[1](x)\n for i in range(1,x):\n pre[i]=pre[i-1](m+(i-1))f[i-1]\n if pre[i]>=p:\n pre[i]=pre[i]%p\n pre[i]=pre[i]//f[i]\n ans=0\n j=0 \n for i in range(x-1,-1,-1):\n ans+=a[j]pre[i]\n if ans>=p:\n ans=ans%p\n j+=1\n print(ans%p)", "p=109+7\nf=[1](100000+1)\nfor i in range(1,100000):\n f[i]=if[i-1]\n if f[i]>=p:\n f[i]=f[i]%p\n\nfor _ in range(int(input())):\n n,x,m=map(int,input().split( ))\n a=list(map(int,input().split( ))) \n pre=[1](x+1)\n for i in range(1,x):\n pre[i]=pre[i-1](m+(i-1))f[i-1]\n if pre[i]>=p:\n pre[i]=pre[i]%p\n pre[i]=pre[i]//f[i]\n ans=0\n j=0 \n for i in range(x-1,-1,-1):\n ans+=a[j]pre[i]\n if ans>=p:\n ans=ans%p\n j+=1\n print(ans)", "p=109+7\nf=[1](100+1)\nfor i in range(1,100):\n f[i]=if[i-1]\n if f[i]>=p:\n f[i]=f[i]%p\n\nfor _ in range(int(input())):\n n,x,m=map(int,input().split( ))\n a=list(map(int,input().split( ))) \n pre=[1](x+1)\n for i in range(1,x):\n pre[i]=pre[i-1](m+(i-1))f[i-1]\n if pre[i]>=p:\n pre[i]=pre[i]%p\n pre[i]=pre[i]//f[i]\n ans=0\n j=0 \n for i in range(x-1,-1,-1):\n ans+=a[j]pre[i]\n if ans>=p:\n ans=ans%p\n j+=1\n print(ans)", "import math\nT=int(input())\nfor i in range(T):\n n,x,m=list(map(int,input().split()))\n l1=[int(i) for i in input().split()]\n if x==1:\n l1[0]=l1[0]%1000000007\n print(l1[0])\n elif x==2:\n m=m%1000000007\n l1[0]=l1[0]%1000000007\n l1[1]=(l1[1]%1000000007+l1[0]m%1000000007)%1000000007\n print(l1[1])\n else:\n m=m%1000000007\n c=-1\n y=0\n q=1\n f=1\n y=(l1[x-1]%1000000007)\n for j in range(x-2,-1,-1):\n c=c+1\n q=(q((m+c)%1000000007))%1000000007\n q=(qpow(c+1,1000000005,1000000007))%1000000007\n y=(y+(q(l1[j]%1000000007))%1000000007)%1000000007\n #print(q,s,c)\n #print(y,s,l1[j])\n print(y%1000000007)\n \n\n", "T=int(input())\nfor i in range(T):\n n,x,m=list(map(int,input().split()))\n l1=[int(i) for i in input().split()]\n if x==1:\n l1[0]=l1[0]%1000000007\n print(l1[0])\n elif x==2:\n m=m%1000000007\n l1[0]=l1[0]%1000000007\n l1[1]=(l1[1]%1000000007+l1[0]m%1000000007)%1000000007\n print(l1[1])\n else:\n m=m%1000000007\n c=-1\n y=0\n q=1\n y=(l1[x-1]%1000000007)\n for j in range(x-2,-1,-1):\n c=c+1\n q=(q((m+c)%1000000007))%1000000007\n #print(q)\n s=(qpow(c,1000000005,1000000007))%1000000007\n y=(y+(s(l1[j]%1000000007))%1000000007)%1000000007\n #print(y,s,l1[j])\n print(y)\n \n\n", "T=int(input())\nfor i in range(T):\n n,x,m=list(map(int,input().split()))\n l1=[int(i) for i in input().split()]\n if x==1:\n l1[0]=l1[0]%1000000007\n print(l1[0])\n elif x==2:\n m=m%1000000007\n l1[0]=l1[0]%1000000007\n l1[1]=(l1[1]%1000000007+l1[0]m%1000000007)%1000000007\n print(l1[1])\n else:\n m=m%1000000007\n c=-1\n y=0\n q=1\n y=(l1[x-1]%1000000007)\n for j in range(x-2,-1,-1):\n c=c+1\n q=(q((m+c)%1000000007))%1000000007\n print(q)\n s=(qpow(c,1000000005,1000000007))%1000000007\n y=(y+(s(l1[j]%1000000007))%1000000007)%1000000007\n #print(y,s,l1[j])\n print(y)\n \n\n", "T=int(input())\nfor i in range(T):\n n,x,m=list(map(int,input().split()))\n l1=[int(i) for i in input().split()]\n if x==1:\n l1[0]=l1[0]%1000000007\n print(l1[0])\n elif x==2:\n m=m%1000000007\n l1[0]=l1[0]%1000000007\n l1[1]=(l1[1]%1000000007+l1[0]m%1000000007)%1000000007\n print(l1[1])\n '''else:\n m=m%1000000007\n c=-1\n y=0\n q=1\n y=(l1[x-1]%1000000007)\n for j in range(x-2,-1,-1):\n c=c+1\n q=(q((m+c)%1000000007))%1000000007\n s=(qpow(c,1000000005,1000000007))%1000000007\n y=(y+(s(l1[j]%1000000007))%1000000007)%1000000007\n #print(y,s,l1[j])\n print(y)'''\n \n\n", "def mult(r,v):\n w=r\n for k in range(1,v):\n w=(w((k+r)%1000000007))%1000000007\n return w\nT=int(input())\nfor i in range(T):\n n,x,m=list(map(int,input().split()))\n l1=[int(i) for i in input().split()]\n if x==1:\n l1[0]=l1[0]%1000000007\n print(l1[0])\n elif x==2:\n m=m%1000000007\n l1[0]=l1[0]%1000000007\n l1[1]=(l1[1]%1000000007+l1[0]m%1000000007)%1000000007\n print(l1[1])\n else:\n m=m%1000000007\n c=0\n y=0\n y=(l1[x-1]%1000000007)\n for j in range(x-2,-1,-1):\n c=c+1\n s=(mult(m,c)pow(c,1000000005,1000000007))%1000000007\n y=(y+(s(l1[j]%1000000007))%1000000007)%1000000007\n #print(y,s,l1[j])\n print(y)\n \n\n", "T=int(input())\nfor i in range(T):\n n,x,m=list(map(int,input().split()))\n l1=[int(i) for i in input().split()]\n if x==1:\n l1[0]=l1[0]%1000000007\n print(l1[0])\n elif x==2:\n m=m%1000000007\n l1[0]=l1[0]%1000000007\n l1[1]=(l1[1]%1000000007+l1[0]m%1000000007)%1000000007\n print(l1[1])\n", "T=int(input())\nfor k in range(T):\n n,x,m=list(map(int,input().split()))\n l1=[int(i) for i in input().split()]\n l2,l3=[],[]\n for i in range(len(l1)):\n l2.append(0)\n l3.append(0)\n l2[0]=l1[0]%1000000007\n for i in range(1,len(l1)):\n l2[i]=((l1[i]%1000000007)+(l2[i-1]%1000000007))%1000000007\n if m==1:\n print(l1[x-1]%1000000007)\n elif m==2:\n print(l2[x-1])\n else:\n l3[0]=l2[0]\n l3[1]=(l1[1]+((m)l1[0])%1000000007)%1000000007\n #print(l3[1],x,l2[1])\n s=0\n v=0\n for i in range(2,x):\n s=l2[i-1](l2[i-1]-1)//2\n # print(l2[i-1],s)\n v=l3[i-1](l3[i-1]+1)//2\n #print(l3[i-1],v)\n #print(v-s)\n l3[i]=((v-s)%1000000007+l1[i])%1000000007\n print(l3[x-1])\n \n \n \n", "T=int(input())\nfor k in range(T):\n n,x,m=list(map(int,input().split()))\n l1=[int(i) for i in input().split()]\n l2,l3=[],[]\n for i in range(len(l1)):\n l2.append(0)\n l3.append(0)\n l2[0]=l1[0]%1000000007\n for i in range(1,len(l1)):\n l2[i]=((l1[i]%1000000007)+(l2[i-1]%1000000007))%1000000007\n if m==1:\n print(l1[x-1]%1000000007)\n elif m==2:\n print(l2[x-1])\n else:\n l3[0]=l2[0]\n l3[1]=(l1[1]+((m)l1[0])%1000000007)%1000000007\n #print(l3[1],x,l2[1])\n s=0\n v=0\n for i in range(2,x):\n s=l2[i-1](l2[i-1]-1)//2\n # print(l2[i-1],s)\n v=l3[i-1](l3[i-1]+1)//2\n #print(l3[i-1],v)\n #print(v-s)\n l3[i]=((v-s)%1000000007+l1[i])%1000000007\n print(l3[x-1])\n \n \n \n", "T=int(input())\nfor k in range(T):\n n,x,m=list(map(int,input().split()))\n l1=[int(i) for i in input().split()]\n l2,l3=[],[]\n for i in range(len(l1)):\n l2.append(0)\n l3.append(0)\n l2[0]=l1[0]%1000000007\n for i in range(1,len(l1)):\n l2[i]=((l2[i]%1000000007)+(l2[i-1]%1000000007))%1000000007\n if m==1:\n print(l1[x-1]%1000000007)\n elif m==2:\n print(l2[x-1])\n else:\n l3[0]=l2[0]\n l3[1]=(l1[1]+((m)l1[0])%1000000007)%1000000007\n s=0\n v=0\n for i in range(2,x):\n s=l2[i-1](l2[i-1]-1)//2\n v=l3[i-1](l3[i-1]+1)//2\n l3[i]=(v-s)%1000000007\n print(l3[x-1])\n \n \n \n", "for _ in range(int(input())):\n n,x,m=list(map(int,input().split()))\n l=[int(i) for i in input().split()]\n MOD=109+7\n if x<=2:\n if x==1:\n print(l[0]%MOD)\n else:\n print((l[0]m+l[1])%MOD)\n continue \n\n temp=l[:]\n while m:\n for i in range(1,n):\n l[i]=l[i]+l[i-1]\n #l=temp[:]\n #print(l)\n m-=1 \n print(l[x-1]%MOD)\n \n", "for _ in range(int(input())):\n n,x,m=list(map(int,input().split()))\n l=[int(i) for i in input().split()]\n MOD=109+7 \n temp=l[:]\n while m:\n for i in range(1,n):\n l[i]=l[i]+l[i-1]\n #l=temp[:]\n #print(l)\n m-=1 \n print(l[x-1]%MOD)\n", "# cook your dish here\nfor _ in range(int(input())):\n n,x,m=list(map(int,input().split()))\n l=list(map(int,input().split()))\n q=[]\n for j in range(m):\n for i in range(1,len(l)):\n l[i]=l[i]+l[i-1]\n print(l[x-1]%(109 +7))\n", "'''input\n2\n3 2 3\n1 2 3\n3 3 3 \n1 2 3\n'''\nmod=10*9+7\nfor _ in range(int(input())):\n n,x,m=map(int,input().split())\n a=[int(i) for(i) in input().split()]\n ans=a[x-1]%mod\n f=1\n for i in range(1,x):\n f=f(m-1+i)\n f=f//i\n f=f%mod;\n ans+=(a[x-1-i]f)%mod\n print(ans%mod)", "'''input\n2\n3 2 3\n1 2 3\n3 3 3 \n1 2 3\n'''\nfor _ in range(int(input())):\n n,x,m=map(int,input().split())\n a=[int(i) for(i) in input().split()]\n ans=a[x-1]\n f=1\n for i in range(1,x):\n f=f(m-1+i)\n f=f//i\n ans+=a[x-1-i]f\n print(ans%(10*9+7))"]	{"inputs": [["2", "3 2 3", "1 2 3", "3 3 3", "1 2 3"]], "outputs": [["5", "15"]]}	INTERVIEW	PYTHON3	CODECHEF	11,218
87792cc2d9ac30d55afcb4bcfc8334f2	UNKNOWN	Ganesh lives in Gopalmath. He is looking for Jojo. So he decides to collect Aadhar Card Information of all the citizens of India from UIDAI. Someone told Ganesh that the sum of all the digits of Jojo’s Aadhar number is divisible by 10 and it is greater than zero. After finding all Aadhar numbers which are divisible by 10, Jojo’s Aadhar number is $N$th smallest Aadhar number. Hence, Ganesh wants to find Jojo’s Aadhar number which satisfies all of the above conditions. (In this chaotic world, Aadhar numbers can be any natural number.) However, Guruji refused Ganesh to carry out this task, because he is weak in Maths. Therefore, Ganesh assigns this task to Paritoshbhai who possesses excellent Mathematical skills. Since Paritoshbhai is busy in his jewellery business, help him in this task. -----Input:----- - The first line of the input contains a single integer T denoting the number of test cases. The description of T test cases follows. - The first and only line of each test case contains a single integer N. -----Output:----- For each test case, print a single line containing Aadhar number of Jojo. -----Constraints----- - $1 \leq T \leq 1000$ - $1 \leq N \leq 10^{100,000}$ -----Sample Input:----- 1 3 -----Sample Output:----- 37	["for _ in range(int(input())):\n N = input()\n num = list(N)\n s=0\n for n in num:\n if n.isnumeric():\n s+=int(n)\n #print(s)\n x=(10-s%10)%10\n print(int(N)*10+int(x))", "# cook your dish here\ndef s(n):\n sn=str(n)\n r=0\n for i in sn:\n r+=int(i)\n return r\n \nfor _ in range(int(input())):\n n=int(input())\n print(str(n)+str((10-s(n))%10))", "for _ in range(int(input())):\n n = input().strip().lstrip('0')\n\n x = sum(int(i) for i in n) % 10\n\n if x == 0:\n x = 10\n\n print(str(n) + str(10 - x))\n"]	{"inputs": [["1", "3"]], "outputs": [["37"]]}	INTERVIEW	PYTHON3	CODECHEF	516
4741ee3d6cfa2b9534e08c2ef3a383db	UNKNOWN	Teddy and Tracy like to play a game based on strings. The game is as follows. Initially, Tracy writes a long random string on a whiteboard. Then, each player starting with Teddy makes turn alternately. Each turn, the player must erase a contiguous substring that exists in the dictionary. The dictionary consists of N words. Of course, the player that can't erase any substring in his turn loses the game, and the other player is declared the winner. Note that after a substring R is erased, the remaining substring becomes separated, i.e. they cannot erase a word that occurs partially to the left of R and partially to the right of R. Determine the winner of the game, assuming that both players play optimally. -----Input----- The first line contains a single integer T, the number of test cases. T test cases follow. The first line of each testcase contains a string S, the string Tracy writes on the whiteboard. The next line contains a single integer N. N lines follow. The i-th line contains a single string wi, the i-th word in the dictionary. -----Output----- For each test case, output a single line containing the name of the winner of the game. -----Example----- Input: 3 codechef 2 code chef foo 1 bar mississippi 4 ssissi mippi mi ppi Output: Tracy Tracy Teddy -----Constraints----- - 1 <= T <= 5 - 1 <= N <= 30 - 1 <= \|S\| <= 30 - 1 <= \|wi\| <= 30 - S and wi contain only characters 'a'-'z'	["import sys\n\ndef mex(S,W,C,start,end):\n \"\"\"Returns Nim-number of S[start:end]\"\"\"\n key=(start,end)\n try:\n return C[key]\n except KeyError:\n pass\n A=set()\n for s in range(start,end):\n for e in range(start+1,end+1):\n if S[s:e] not in W: continue\n A.add(mex(S,W,C,start,s)^mex(S,W,C,e,end))\n a=0\n while a in A: a+=1\n C[key]=a\n return a\n \n\na=sys.stdin\n#a=open('astrgame.txt','r')\nT=int(a.readline())\nfor t in range(T):\n S=a.readline().strip()\n N=int(a.readline())\n W=set([a.readline().strip() for n in range(N)])\n print('Teddy' if mex(S,W,{},0,len(S)) else 'Tracy')\n \n", "#!/usr/bin/env python\n\ndef memo(func):\n cache = {}\n def f(args):\n if args in cache:\n return cache[args]\n r = func(args)\n cache[args] = r\n return r\n return f\n\ndef doit():\n s = input().strip()\n words = set([input().strip() for x in range(eval(input()))])\n @memo\n def g(start, end):\n num = set([])\n if start >= end: return 0\n for w in words:\n x = start\n while x + len(w) <= end:\n r = s.find(w, x, end)\n if r == -1:\n break\n num.add(g(start, r) ^ g(r + len(w), end))\n x = r + 1\n x = 0\n while x in num:\n x += 1\n return x\n return g(0, len(s)) > 0\n\nn = eval(input())\nfor x in range(n):\n if doit():\n print('Teddy')\n else:\n print('Tracy')\n", "#!/usr/bin/env python\n\ndef memo(func):\n cache = {}\n def f(args):\n if args in cache:\n return cache[args]\n r = func(args)\n cache[args] = r\n return r\n return f\n\ndef doit():\n s = input().strip()\n words = set([input().strip() for x in range(eval(input()))])\n @memo\n def g(start, end):\n num = set([])\n x = start\n while x <= end:\n y = x\n while y <= end:\n if s[x:y+1] in words:\n num.add(g(start, x-1) ^ g(y+1, end))\n y += 1\n x += 1\n x = 0\n while x in num:\n x += 1\n return x\n return g(0, len(s) - 1) > 0\n\nn = eval(input())\nfor x in range(n):\n if doit():\n print('Teddy')\n else:\n print('Tracy')\n", "D = {}\n\ndef g(s):\n if s in D: return D[s]\n \n vals = set()\n l = len(s)\n for i in range(l):\n for j in range(1, l+1 - i):\n sub = s[i : i+j]\n if sub in DIC:\n vals.add(g(s[:i]) ^ g(s[i+j:]))\n \n i = 0\n while 1:\n if not i in vals:\n break\n i += 1\n D[s] = i\n return D[s]\n\nT = int(input(\"\"))\nfor t in range(T):\n s = input(\"\")\n d_len = int(input(\"\"))\n DIC = set()\n for i in range(d_len):\n DIC.add(input(\"\"))\n D = {}\n print(\"Teddy\" if g(s) else \"Tracy\")\n"]	{"inputs": [["3", "codechef", "2", "code", "chef", "foo", "1", "bar", "mississippi", "4", "ssissi", "mippi", "mi", "ppi", "", ""]], "outputs": [["Tracy", "Tracy", "Teddy"]]}	INTERVIEW	PYTHON3	CODECHEF	2,986
efc82c6919ecc32866243fb1a55e2470	UNKNOWN	Mathison recently inherited an ancient papyrus that contained some text. Unfortunately, the text was not a pangram. Now, Mathison has a particular liking for holoalphabetic strings and the text bothers him. The good news is that Mathison can buy letters from the local store in order to turn his text into a pangram. However, each letter has a price and Mathison is not very rich. Can you help Mathison find the cheapest way to obtain a pangram? -----Input----- The first line of the input file will contain one integer, T, representing the number of tests. Each test will be formed from two lines. The first one contains 26 space-separated integers, representing the prices of all letters. The second will contain Mathison's initial text (a string of N lowercase letters). -----Output----- The output file will contain T lines, one for each test. Each line will contain the answer for the corresponding test. -----Constraints and notes----- - 1 ≤ T ≤ 10 - 1 ≤ N ≤ 50,000 - All prices are natural numbers between 1 and 1,000,000 (i.e. 106). - A pangram is a string that contains every letter of the Latin alphabet at least once. - All purchased letters are added to the end of the string. -----Subtaks----- Subtask #1 (30 points): - N = 1 Subtask #2 (70 points): - Original constraints -----Example----- Input: 2 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 abcdefghijklmopqrstuvwz 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 thequickbrownfoxjumpsoverthelazydog Output: 63 0 -----Explanation----- First test There are three letters missing from the original string: n (price 14), x (price 24), and y (price 25). Therefore the answer is 14 + 24 + 25 = 63. Second test No letter is missing so there is no point in buying something. The answer is 0.	["# cook your dish here\n# cook your dish here\nfor i in range(int(input())):\n a=list(map(int,input().split()))\n x=input()\n t=0\n for i in range(ord('a'),ord('z')+1):\n if chr(i) not in x:\n t+=a[i-97]\n print(t)", "t=int(input())\nx='abcdefghijklmnopqrstuvwxyz'\nfor i in range(t):\n a=0\n b=input().split()\n c=input()\n for j in range(len(x)):\n if(x[j] not in c):\n a=a+int(b[j])\n print(a)", "t=int(input())\nn=\"abcdefghijklmnopqrstuvwxyz\"\nfor i in range(t):\n m=0\n p=input().split()\n q=input()\n for j in range(len(n)):\n if(n[j] not in q):\n m=m+int(p[j])\n print(m)", "t=int(input())\na = \"abcdefghijklmnopqrstuvwxyz\"\nfor i in range(t):\n c=0\n p=input().split()\n s=input()\n \n for j in range(len(a)):\n if(a[j] not in s):\n c = c + int(p[j])\n print(c)\n", "# cook your dish here\nfor i in range(int(input())):\n a=list(map(int,input().split()))\n x=input()\n t=0\n for i in range(97,123):\n if chr(i) not in x:\n t+=a[i-97]\n print(t)", "# cook your dish here\nfor i in range(int(input())):\n a=list(map(int,input().split()))\n x=input()\n tot=0\n for i in range(97,123):\n if chr(i) not in x:\n tot+=a[i-97]\n print(tot)", "# cook your dish here\nfor i in range(int(input())):\n a=list(map(int,input().split()))\n x=input()\n tot=0\n for i in range(ord('a'),ord('z')+1):\n if chr(i) not in x:\n tot+=a[i-97]\n print(tot)", "# cook your dish here\nt=int(input())\nfor i in range(t):\n arr = list(map(int,input().split()))\n s=input()\n brr=list(map(chr,range(97,123)))\n count=0\n for j in range(len(brr)):\n if brr[j] in s:\n continue\n else:\n count+=arr[j]\n print(count)", "for _ in range(int(input())):\n A = list(map(int, input().split()))\n s, x = list(set(list(input()))), 0\n for c in s:\n x += A[ord(c)-97]\n print(sum(A)-x)", "import string\ncheck=string.ascii_lowercase\nfor _ in range(int(input())):\n price=0\n l=list(map(int,input().strip().split()))\n s=str(input())\n s=set(s)\n for i in range(0, len(check)):\n if check[i] not in s:\n price += l[i]\n print(price)", "# cook your dish here\nt = int(input())\nfor _ in range(t):\n price = list(map(int, input().split()))\n string = set(input())\n letters = []\n cost = 0\n for i in range(97, 123):\n if chr(i) not in string:\n cost += price[i-97]\n print(cost)\n", "t = int(input())\nfor _ in range(t):\n price = list(map(int, input().split()))\n string = set(input())\n letters = []\n cost = 0\n for i in range(97, 123):\n if chr(i) not in string:\n cost += price[i-97]\n print(cost)\n", "import bisect\nfrom collections import Counter\nfor _ in range(int(input())):\n a=list(map(int,input().split()))\n s=input()\n c=0\n for i in range(ord('a'),ord('z')+1):\n if chr(i) not in s:\n c+=a[i-97]\n print(c)\n", "for _ in range(int(input())):\n prices = list(map(int,input().split(' ')))\n s = set(input())\n total = 0\n for x in range(97,123):\n ch = chr(x)\n if ch not in s:\n total += prices[ord(ch)-97]\n print(total)\n", "# cook your dish here\ntry:\n for i in range(int(input())):\n l=list(map(int,input().strip().split()))\n s=input()\n s=list(s)\n alpha=\"abcdefghijklmnopqrstuvwxyz\"\n alpha=list(alpha)\n count=0\n for i in alpha:\n if i not in s:\n count=count+l[ord(i)-97]\n print(count)\nexcept:\n pass\n", "T = int(input())\nfor i in range(T):\n s = input()+' '\n cost = {}\n present = {}\n spend = 0\n for j in range(26):\n n = s.find(' ')\n cost[97+j] = int(s[:n])\n present[97+j] = False\n s = s[n+1:]\n s = input()\n for k in range(len(s)):\n t = ord(s[k])\n present[t] = True\n for l in range(26):\n if present[97+l] == False:\n spend += cost[97+l]\n print(spend)", "# cook your dish here\nt=int(input())\nfor i in range(t):\n alphabets='abcdefghijklmnopqrstuvwxyz'\n a=list(map(int,input().split()))\n s=input()\n c=0\n for j in alphabets:\n if j not in s:\n c+=a[ord(j)-97]\n print(c)", "import string\ns = string.ascii_lowercase\nfor _ in range(int(input())):\n arr = list(map(int, input().split()))\n s1 = input()\n total = 0\n for i in s:\n if i not in s1:\n total += arr[s.index(i)]\n s1 += i\n print(total)\n", "import string\ns = string.ascii_lowercase\nfor _ in range(int(input())):\n arr = list(map(int, input().split()))\n s1 = input()\n total = 0\n for i in s:\n if i not in s1:\n total += arr[s.index(i)]\n s1 += i\n print(total)\n"]	{"inputs": [["2", "1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26", "abcdefghijklmopqrstuvwz", "1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26", "thequickbrownfoxjumpsoverthelazydog"]], "outputs": [["63", "0"]]}	INTERVIEW	PYTHON3	CODECHEF	4,331
5b559147634fc5b25854fd1a6ec99e28	UNKNOWN	You are given a sequence of integers $A_1,A_2,…,A_N$ and a magical non-zero integer $x$ You have to select a subsegment of sequence A (possibly empty), and replace the elements in that subsegment after dividing them by x. Formally, replace any one subsegment $A_l, A_{l+1}, ..., A_r$ with $A_l/x, A_{l+1}/x, ..., A_r/x$ where $l \leq r$ What is the minimum possible sum you can obtain? Note: The given operation can only be performed once -----Input ----- - The first line of the input contains two positive integer n denoting the size of array, and x denoting the magical integer - Next line contains $N$ space separated integers -----Output----- Single line containing one real number, denoting the minimum possible sum you can obtain. Your answer will be considered correct if its absolute or relative error does not exceed $10^{-2}$ -----Constraints----- - $1 \leq n \leq 10^3$ - $1 \leq \|x\| \leq 10^3$ - $ \|A_i\| \leq 10^3$ -----Sample Input----- 3 2 1 -2 3 -----Sample Output----- 0.5 -----Explanation----- Array 1 -2 3, selecting subsegment {3}, you get 1 -2 1.5, which gives $sum=0.5$	["def solve(a,n):\n max1=curr=a[0]\n for i in range(1,n):\n curr=max(a[i],curr+a[i])\n max1=max(max1,curr)\n return max1\n \nn,k = list(map(int,input().split()))\na = list(map(int,input().split()))\nprint(sum(a)-solve(a,n)+solve(a,n)/k)\n", "# cook your dish here\ndef atharva(a:list,n:int): \n msf = mh = a[0]\n for i in range(n):\n mh = max(a[i],mh+a[i])\n msf = max(msf,mh)\n return msf\n\nn,x = map(int,input().split())\na = list(map(int,input().split()))\nsumm = sum(a)\nmax_sum = atharva(a,len(a))\nprint(summ - max_sum + max_sum/x)", "# cook your dish here\ndef atharva(a:list,n:int): \n msf = a[0]\n mh = a[0]\n for i in range(n):\n mh = max(a[i],mh+a[i])\n msf = max(msf,mh)\n return msf\n \n \nn,x = map(int,input().split())\na = list(map(int,input().split()))\nsumm = sum(a)\nmax_sum = atharva(a,len(a))\nprint(summ - max_sum + max_sum/x)", "# cook your dish here\ndef maxSubArraySum(a,size): \n \n max_so_far =a[0] \n curr_max = a[0] \n \n for i in range(1,size): \n curr_max = max(a[i], curr_max + a[i]) \n max_so_far = max(max_so_far,curr_max) \n \n return max_so_far \nn,x = map(int,input().split())\na = list(map(int,input().split()))\nt = sum(a)\nu = maxSubArraySum(a,n)\nprint(t-u+u/x)", "def maxSubArraySum(a,size): \n max_so_far,curr_max = a[0],a[0] \n for i in range(1,size): \n curr_max = max(a[i], curr_max + a[i]) \n max_so_far = max(max_so_far,curr_max) \n return max_so_far \nn,x = map(int,input().split())\na = list(map(int,input().split()))\nprint(sum(a)-maxSubArraySum(a,n)+ (maxSubArraySum(a,n)/x))", "def maxSubArraySum(a,size): \n \n max_so_far =a[0] \n curr_max = a[0] \n \n for i in range(1,size): \n curr_max = max(a[i], curr_max + a[i]) \n max_so_far = max(max_so_far,curr_max) \n \n return max_so_far \nn,x = map(int,input().split())\na = list(map(int,input().split()))\nt = sum(a)\nu = maxSubArraySum(a,n)\nprint(t-u+u/x)", "# cook your dish here\ndef func1(l):\n if(len(l)==1):\n return 0\n elif(len(l)==2):\n return l[1]-l[0]\n else:\n mid=len(l)//2\n p=l[:mid]\n q=l[mid:]\n return max(func1(p),func1(q),max(q)-min(p))\ndef func2(l):\n if(len(l)==1):\n return float('inf')\n elif(len(l)==2):\n return l[1]-l[0]\n else:\n mid=len(l)//2\n p=l[:mid]\n q=l[mid:] \n return min(func2(p),func2(q),min(q)-max(p))\nn,x=list(map(int,input().split()))\narr=list(map(int,input().split()))\nl=[0]\nfor i in arr:\n l.append(l[-1]+i)\nl.pop(0)\nif(x==1):\n print(l[-1])\nelif((1/x)-1<0):\n v=func1(l)\nelse:\n v=func2(l)\nprint(l[-1]-v+(v/x))\n\n\n\n", "# cook your dish here\nn,x=list(map(int,input().split()))\nl=list(map(int,input().split()))\nres=l[0]\ntemp=l[0]\nfor i in range(1,n):\n temp=max(l[i],temp+l[i])\n res=max(temp,res)\nprint(sum(l)-res+(res/x)) \n", "def max_possible_sum_of_subsegment(array):\n current_max=0\n maxx=0\n for j in array:\n current_max+=j\n if maxx<current_max:\n maxx=current_max\n if current_max<0:\n current_max=0\n return maxx\n\n\nn,x=list(map(int,input().split()))\nl=list(map(int,input().split()))\ntot=sum(l)\nmaxx=max_possible_sum_of_subsegment(l)\nprint(tot-(maxx)+(maxx/x))\n", "n,k=list(map(int,input().split()))\na=list(map(int,input().split()))\nsumi=0\nans=1020\nfor i in range(len(a)):\n sumi=sum(a)\n for j in range(i,len(a)):\n sumi=(sumi-a[j])+(a[j]/k)\n ans=min(ans,sumi)\nprint(ans)\n", "n,k=list(map(int,input().split()))\na=list(map(int,input().split()))\nsumi=0\nans=1020\nfor i in range(len(a)):\n sumi=sum(a)\n for j in range(i,len(a)):\n sumi=(sumi-a[j])+(a[j]/k)\n ans=min(ans,sumi)\nprint(ans)\n", "n,x=map(int,input().split())\na=list(map(int,input().split()))\nb=[]\ni=0\nwhile(i<n):\n j=i+1\n while(j<=n):\n b.append([sum(a[i:j]),i,j])\n j+=1\n i+=1 \nb.sort()\nl=len(b)\nv=b[l-1][1]\ny=b[l-1][2]\nz=b[l-1][0]\nprint(float(sum(a[0:v])+sum(a[y:n])+(z/x)))", "n,m=list(map(int,input().split()))\nl=list(map(int,input().split()))\ninc,enc=0,0\nfor i in range(0,len(l)):\n inc=max(l[i],inc+l[i])\n enc=max(enc,inc)\nresult=sum(l)-enc\nprint(result+enc/m)\n", "# cook your dish here\nn,x=list(map(int,input().split()))\na=list(map(int,input().split()))\ntotal=sum(a)\ncurrent_max=a[0]\ntotal_max=a[0]\nfor i in range(1,len(a)):\n current_max=max(a[i],current_max+a[i])\n total_max=max(total_max,current_max)\nprint(total-total_max+(total_max/x))\n\n\n\n\n\n \n", "n,k=list(map(int,input().split()))\nl=list(map(int,input().split()))\ni=0\nx=sum(l)\nd=x\nm=0\nfor i in range(n):\n c=0\n for j in range(i,n):\n c+=l[j]\n m=max(c,m)\nd-=m\nd+=m/k\n \n \n\nprint(d)\n \n \n \n", "# cook your dish here\nn,x=map(int,input().split())\nl=list(map(int,input().split()))\nans=l[0]\ntemp=l[0]\nfor i in range(1,n):\n temp=max(l[i],temp+l[i])\n ans=max(temp,ans)\nprint(sum(l)-ans+(ans/x))", "n,x=list(map(int,input().split()))\na=list(map(int,input().split()))\nmaxi=a[0]\np=0\nfor i in range (n):\n sumi=a[i]\n if (sumi>maxi):\n maxi=sumi \n \n for j in range (i+1,n):\n sumi+=a[j]\n if (i==0):\n p+=a[j]\n if (sumi>maxi):\n maxi=sumi\n \n if (sumi>maxi):\n maxi=sumi \n \np+=a[0]\n\nprint(p-maxi+maxi/x)\n", "n,x=list(map(int,input().split()))\na=list(map(int,input().split()))\nmini,maxi=a[0],a[0]\np=0\nfor i in range (n):\n sumi=a[i]\n if (sumi>maxi):\n maxi=sumi \n if (sumi<mini):\n mini=sumi \n for j in range (i+1,n):\n sumi+=a[j]\n if (i==0):\n p+=a[j]\n if (sumi>maxi):\n maxi=sumi\n if (sumi<mini):\n mini=sumi\n if (sumi>maxi):\n maxi=sumi \n if (sumi<mini):\n mini=sumi \np+=a[0]\n\nprint(min((p-maxi+maxi/x),(p-mini+mini/x)))\n", "def get_the_largest_contiguous_subarray_sum(A,N):\n\n max_sum_so_far=0\n max_sum_ending_here=0\n\n for i in range(N):\n max_sum_ending_here+=A[i]\n\n if max_sum_ending_here<0:\n max_sum_ending_here=0\n else:\n max_sum_so_far=max(max_sum_so_far,max_sum_ending_here)\n\n return max_sum_so_far\n\n\nN,x=list(map(int,input().split()))\nA=list(map(int,input().split()))\narray_sum=sum(A)\nmax_subarray_sum=get_the_largest_contiguous_subarray_sum(A,N)\nprofit=max_subarray_sum-(max_subarray_sum/x)\nmin_sum_possible=array_sum-profit\nprint(min_sum_possible)"]	{"inputs": [["3 2", "1 -2 3"]], "outputs": [["0.5"]]}	INTERVIEW	PYTHON3	CODECHEF	6,071
083f112be5923fa90736ee3b5f37cf76	UNKNOWN	You are given a string $S$. Find the number of ways to choose an unordered pair of non-overlapping non-empty substrings of this string (let's denote them by $s_1$ and $s_2$ in such a way that $s_2$ starts after $s_1$ ends) such that their concatenation $s_1 + s_2$ is a palindrome. Two pairs $(s_1, s_2)$ and $(s_1', s_2')$ are different if $s_1$ is chosen at a different position from $s_1'$ or $s_2$ is chosen at a different position from $s_2'$. -----Input----- The first and only line of the input contains a single string $S$. -----Output----- Print a single line containing one integer — the number of ways to choose a valid pair of substrings. -----Constraints----- - $1 \le \|S\| \le 1,000$ - $S$ contains only lowercase English letters -----Subtasks----- Subtask #1 (25 points): $\|S\| \le 100$ Subtask #2 (75 points): original constraints -----Example Input----- abba -----Example Output----- 7 -----Explanation----- The following pairs of substrings can be chosen: ("a", "a"), ("a", "ba"), ("a", "bba"), ("ab", "a"), ("ab", "ba"), ("abb", "a"), ("b", "b").	["def binarySearch(arr, l, r, x):\n mid=0\n while l <= r: \n mid = l + (r - l)//2; \n if arr[mid] == x: \n return mid+1 \n elif arr[mid] < x: \n l = mid + 1\n else: \n r = mid - 1\n if mid!=len(arr):\n if arr[mid]<x:\n return mid+1\n return mid\ns=input()\nstrt=[]\nend=[]\nplc=[]\nlandr=[]\nl2r=[]\nlr=[]\nans=0\nn=len(s)\nif n!=1:\n for i in range(n):\n strt.append([])\n end.append([])\n landr.append([0]n)\n l2r.append([0]n)\n for i in range(n): \n for j in range(n):\n if i-j<0 or i+j>=n:\n break\n if (s[i-j]==s[i+j]):\n if i-j-1>=0:\n strt[i-j-1].append(2j+1)\n if i+j+1<n:\n end[i+j+1].append(2j+1)\n else:\n break\n for i in range(n):\n for j in range(n):\n if i-j<0 or i+j+1>=n:\n break\n if (s[i-j]==s[i+j+1]):\n if i-j-1>=0:\n strt[i-j-1].append(2j+2)\n if i+j+2<n:\n end[i+j+2].append(2j+2)\n else:\n break\n for i in range(n):\n end[i].sort()\n strt[i].sort()\n for i in range(n-1):\n for j in range(i+1,n):\n if s[i]==s[j]:\n lr.append([i,j])\n if i>0 and j<n-1:\n landr[i][j]=landr[i-1][j+1]+1\n else:\n landr[i][j]=1\n for i in lr:\n tempans=1\n l=i[0]\n r=i[1]\n length=r-l-1\n tempans+=binarySearch(strt[l],0,len(strt[l])-1,length)\n tempans+=binarySearch(end[r],0,len(end[r])-1,length)\n l2r[l][r]=tempans\n for i in range(n):\n for j in range(n):\n ans+=l2r[i][j]landr[i][j]\nprint(ans)", "import sys,math\nfrom sys import stdin,stdout\n\n\ns=stdin.readline().strip()\n\nispalin=[[0 for i in range(len(s)+1)] for i in range(len(s)+1)]\nsuff=[[-1 for i in range(len(s)+1)] for i in range(len(s)+1)]\npref=[[-1 for i in range(len(s)+1)] for i in range(len(s)+1)]\nlcp=[[0 for i in range(len(s)+1)] for i in range(len(s)+1)]\n\nfor i in range(0,len(s)):\n ispalin[i][i]=1;pref[i][i]=1;suff[i][i]=1\n ispalin[i][i+1]=1;pref[i][i+1]=2;suff[i][i+1]=2\n\n#for i in ispalin:\n #print(i)\n\nfor l in range(2,len(s)+1):\n for i in range(0,len(s)-l+1):\n #print(i,i+l-1,s[i],s[i+l-1])\n ispalin[i][i+l]=ispalin[i+1][i+l-1]int(s[i]==s[i+l-1])\n pref[i][i+l]=pref[i][i+l-1]+ispalin[i][i+l]\n suff[i][i+l]=suff[i+1][i+l]+ispalin[i][i+l]\n\nfor i in range(len(s)):\n for j in range(i+1,len(s)):\n lcp[i][j]=(lcp[i-1][j+1]+1)int(s[i]==s[j])\n\n#\n\nans=0\n\nfor i in range(1,len(s)):\n for j in range(i,len(s)):\n #if lcp[i-1][j]!=0:\n #print(i,j,lcp[i-1][j],suff[i][j],pref[i][j],s[0:i],s[i:j],s[j:])\n ans+=(lcp[i-1][j](suff[i][j]+pref[i][j]-1))\n#\nstdout.write(str(ans))\n\n\n", "# cook your dish here\nst = str(input())\n\ndef checkpal(i,j,k,l):\n \n a=i\n b=l\n while(a<b):\n if st[a] != st[b]:\n \n return -1\n \n if(a==j):\n a = k-1\n if(b==k):\n b = j+1\n\n a+=1\n b-=1 \n # print(i,j,k,l)\n # print(\"yes\")\n return 1\n\nl = len(st)\ncount = 0\nfor i in range(l):\n for j in range(i,l):\n for k in range(j+1,l):\n for m in range(k,l):\n if checkpal(i,j,k,m) == 1: \n count += 1\n \nprint(count)", "def palSub(s,n,isPal):\n for gap in range(n):\n for i in range(n-gap):\n j = i + gap\n if(gap == 0):\n isPal[i][j] = 1\n elif(gap == 1):\n isPal[i][j] = 1 if(s[i] == s[j]) else 0\n else:\n isPal[i][j] = 1 if(s[i] == s[j] and isPal[i+1][j-1]) else 0\n return isPal\ndef case1(n,isPal,c1):\n for i in range(n):\n for j in range(i,n):\n if(i == j):\n c1[i][j] = 1\n else:\n c1[i][j] = c1[i][j-1] + isPal[i][j]\n return c1\ndef case2(n,isPal,c2):\n for j in range(n-1,-1,-1):\n for i in range(j,-1,-1):\n if(i == j):\n c2[i][j] = 1\n else:\n c2[i][j] = c2[i+1][j] + isPal[i][j]\n return c2\ndef getSub(s,n,c1,c2,res):\n for gap in range(n):\n for i in range(n-gap):\n j = i + gap\n if(gap == 0):\n res[i][j] = 0\n elif(gap == 1):\n res[i][j] = 1 if(s[i] == s[j]) else 0\n elif(s[i] == s[j]):\n res[i][j] = 1 + c1[i+1][j-1] + c2[i+1][j-1] + res[i+1][j-1]\n return res\ndef __starting_point():\n s = input()\n n = len(s)\n isPal = [[0 for x in range(n)]for y in range(n)]\n isPal = palSub(s,n,isPal)\n c1 = [[-1 for x in range(n)]for y in range(n)]\n c2 = [[-1 for x in range(n)]for y in range(n)]\n c1 = case1(n,isPal,c1)\n c2 = case2(n,isPal,c2)\n res = [[0 for x in range(n)]for y in range(n)]\n res = getSub(s,n,c1,c2,res)\n mycount = 0\n for i in range(n):\n for j in range(n):\n mycount += res[i][j]\n print(mycount)\n__starting_point()"]	{"inputs": [["abba"]], "outputs": [["7"]]}	INTERVIEW	PYTHON3	CODECHEF	4,367
cd3ca4fc18a421c0037cdc03e29f0b7d	UNKNOWN	Chef is playing a game on the non-negative x-axis. It takes him $1$ second to reach from $i^{th}$ position to $(i-1)^{th}$ position or $(i+1)^{th}$ position. The chef never goes to the negative x-axis. Also, Chef doesn't stop at any moment of time. The movement of chef can be described as follows. - At the start he is standing at $x=0$ at time $0$. - In the first round, he moves towards $x=1$ and comes back to the $x=0$ position. - In the second round, he moves towards the $x=2$ and comes back again to $x=0$. - Generalizing, in the $k^{th}$ round, he moves from $x=0$ to $x=k$ and then returns back to $x=0$ at the end of the round. This goes on as the game progresses. For Example, the path of Chef for $3^{rd}$ round is given below. $0 - 1 - 2 - 3 - 2 - 1 - 0$ The overall path followed by Chef would look somewhat like this: $0 - 1 - 0 - 1 - 2 - 1 - 0 - 1 - 2 - 3 - 2 - 1 - 0 - 1 - 2 - 3 - 4 - 3 - …$ You are given two non-negative integers $N$ and $K$. You have to tell the time at which Chef arrives at $x=N$ for the $K^{th}$ time. Note - Chef can not skip a position while visiting the positions. -----Input:----- - The first line contains $T$ the number of test cases. Then the test cases follow. - Each test case contains a single line of two integers $N$ and $K$. -----Output:----- For each test case, print a single line containing one integer -- the time taken by the chef to arrive at $x=N$ for the $K^{th}$ time by modulo $1,000,000,007$. -----Constraints----- - $1 \le T \le 10^5$ - $0 \le N \le 10^9$ - $1 \le K \le 10^9$ -----Sample Input:----- 5 0 1 1 1 2 1 1 3 4 6 -----Sample Output:----- 0 1 4 5 46 -----Explanation:----- Test Case 1: Chef starts the journey from the $N = 0$ at time $t = 0$ and it's the first time $(K = 1)$, he is here. So, the answer is $0$. Test Case 2: Chef starts the journey from the $N = 0$ at time $t = 0$ then goes to $N = 1$ at $t = 1$ and it's the first time $(K = 1)$, he is here. So, the answer is $1$. Test Case 4: The path followed by Chef to reach $1$ for the third time is given below. $0 - 1 - 0 - 1 - 2 - 1$ He reaches $1$ for the third time at $t=5$.	["import sys\nfrom random import choice,randint\ninp=sys.stdin.readline\nout=sys.stdout.write\nflsh=sys.stdout.flush\n \nsys.setrecursionlimit(109)\ninf = 1020\neps = 1.0 / 1010\nmod = 109+7\ndd = [(-1,0),(0,1),(1,0),(0,-1)]\nddn = [(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]\n \ndef MI(): return map(int, inp().strip().split())\ndef LI(): return list(map(int, inp().strip().split()))\ndef LLI(): return [list(map(int, l.split())) for l in sys.stdin.readlines().strip()]\ndef LI_(): return [int(x)-1 for x in inp().strip().split()]\ndef LF(): return [float(x) for x in inp().strip().split()]\ndef LS(): return inp().strip().split()\ndef I(): return int(inp().strip())\ndef F(): return float(inp().strip())\ndef S(): return inp().strip()\ndef pf(s): return out(s+'\\n')\ndef JA(a, sep): return sep.join(map(str, a))\ndef JAA(a, s, t): return s.join(t.join(map(str, b)) for b in a)\n\ndef main():\n from math import ceil\n t = I()\n l = []\n for _ in range(t):\n n,k=MI()\n if n==0:\n k-=1\n ans = ((k)((k+1)))%mod\n l.append(ans)\n else:\n # if k==1:\n # ans = ((((n)((n-1)))%mod)+ n%mod)%mod\n # l.append(ans)\n # else:\n # k-=1\n # lr = (n%mod+((ceil(k/2)%mod))%mod\n # ans = ((lr((lr-1))%mod\n # if k%2!=0:\n # ans= (ans%mod + n%mod)%mod\n # else:\n # ans = ((ans%mod)+((lr+n)%mod))%mod\n # l.append(ans)\n if k%2!=0:\n lr = k//2\n l.append(((nn)%mod+(lr((2n)%mod))%mod+(lr(lr+1))%mod)%mod)\n else:\n lr = k//2\n l.append(((nn)%mod + (lr(2n)%mod)%mod + (lr(lr-1))%mod)%mod)\n\n for i in range(t):\n pf(str(l[i]))\n\ndef __starting_point():\n main()\n__starting_point()", "for i in range(int(input())):\n n,k = list(map(int,input().split())) \n if n==0 and k==1 :\n print(0)\n \n elif n==0:\n print((k(k-1))%q)\n else:\n m = n+1\n q= 109+7\n if k%2 ==0:\n m+=k//2-1\n print((m2+n-m)%q)\n else:\n m+=(k+1)//2-1\n print((m*2-n-m)%q)\n \n", "for _ in range(int(input())):\r\n n,k = list(map(int,input().split()))\r\n if n == 0:\r\n print((k(k-1))%1000000007)\r\n elif k == 1:\r\n print((n2)%1000000007)\r\n else:\r\n turn = (k//2)\r\n point = turn + n\r\n if k%2 == 0:\r\n print((point2 - turn)%1000000007)\r\n else:\r\n print((point*2 + turn)%1000000007)\r\n \r\n \r\n \r\n \r\n \r\n \r\n", "try:\n t=int(input())\n for _ in range(t):\n a,b=map(int,input().split())\n if(a==0):\n print(((b-1)b)%1000000007)\n else:\n c=b%2\n if(c==0):\n x=(b-2)//2\n ans=(a+x)(a+x+1)+a\n print(ans%1000000007)\n else:\n x=b//2\n ans=(a+x-1)(a+x)\n ans=(ans+a+2x)\n print(ans%1000000007)\nexcept:\n pass", "for _ in range(int(input())):\n n,k = map(int,input().split()) ; m =(109)+7\n if n==0:\n if k==1:\n print(0)\n else:\n print((k(k-1))%m)\n else:\n if k==1:\n print((n(n-1)+n)%m)\n elif k%2:\n x = n+((k-1)//2)\n print((x(x+1)-n)%m)\n else:\n x = (n+(k//2))\n print((x(x-1)+n)%m)", "t = int(input().strip())\nm = 1000000007\nfor _ in range(t):\n n,k = [int(x) for x in input().strip().split()]\n if n==0:\n ans = (k(k-1))%m\n elif k%2==0:\n ans = ((nn)%m + (kn)%m + (((k)(k-2))//4)%m)%m\n else:\n ans = ((nn)%m + ((k-1)n)%m + (((k+1)(k-1))//4)%m)%m\n print(ans)", "# cook your dish here\ntry:\n t=int(input())\n for _ in range(t):\n x,y=map(int,input().split())\n if(x==0):\n print(((y-1)y)%1000000007)\n else:\n inc=y%2\n if(inc==0):\n cir=(y-2)//2\n a=(x+cir)(x+cir+1)+x\n print(a%1000000007)\n else:\n cir=y//2\n a=(x+cir-1)(x+cir)\n a=(a+x+2cir)\n print(a%1000000007)\nexcept:\n pass", "for t in range(int(input())):\n n,k=map(int,input().split())\n mod=10*9+7\n if n==0:\n if k==1:\n print(0)\n else:\n print(k(k-1)%mod)\n else:\n if k%2==0:\n a=n+k//2-1\n print((a(a+1)+n)%mod)\n else:\n a=n+k//2 \n print((a(a+1)-n)%mod)", "'''input\r\n6\r\n0 1\r\n1 1\r\n2 1\r\n1 3\r\n4 6\r\n4 100\r\n'''\r\nfrom bisect import bisect_left as bl, bisect_right as br\r\nfrom collections import defaultdict as dd\r\nmod=10*9+7\r\n\r\nfor _ in range(int(input())):\r\n\r\n #n=int(input())\r\n n,k=list(map(int,input().strip().split()))\r\n if(k==1):\r\n sm=pow(n,2,mod)\r\n print(sm)\r\n continue\r\n elif(n==0):\r\n sm=k(k-1)\r\n print(sm%mod)\r\n continue\r\n else:\r\n sm=(n(n+1))%mod\r\n\r\n\r\n y=(k-1)/2\r\n q=y\r\n if(int(y)==y):\r\n y=max(0,int(y)-1)\r\n rem=2\r\n else:\r\n y=int(y)\r\n rem=1\r\n \r\n sm+=(2yn)%mod+(y(y+1))%mod\r\n #print(sm,\"*\")\r\n\r\n if(rem==1):\r\n sm+=n\r\n else:\r\n sm+=2(n+y+1)-n\r\n\r\n print(sm%mod)\r\n\r\n\r\n\r\n", "# cook your dish here\nmd=1000000007\nfor tst in range(int(input())):\n n,k = [int(x) for x in input().split()]\n if(n==0):\n ans=(k(k-1))%md\n print(ans)\n continue\n z=0\n if (k&1):\n z=1\n g=(k//2)+n\n ans=((g+1)g)\n if(z):\n ans=(ans-n)%md\n else:\n ans=(ans-g-g+n)%md\n print(ans)", "# cook your dish here\ntry:\n t=int(input())\n for _ in range(t):\n a,b=map(int,input().split())\n if(a==0):\n print(((b-1)b)%1000000007)\n else:\n inc=b%2\n if(inc==0):\n cir=(b-2)//2\n ans=(a+cir)(a+cir+1)+a\n print(ans%1000000007)\n else:\n cir=b//2\n ans=(a+cir-1)(a+cir)\n ans=(ans+a+2cir)\n print(ans%1000000007)\nexcept:\n pass", "for i in range(int(input())):\n n,k=map(int,input().split())\n if(n!=0):\n d=(k-1)//2\n z=n*2+(k//2)(2n)+d(d+1)\n z=z%(10*9+7)\n print(z)\n else:\n z=k(k-1)\n z=z%(109+7)\n print(z)", "import math\r\nmod=(109)+7\r\nT=int(input())\r\nfor _ in range(T):\r\n N,K=list(map(int,input().split()))\r\n if (N==0):\r\n print(((K(K-1)))%mod)\r\n else:\r\n pos=(math.ceil((K-1)/2)+N)\r\n if ((K)%2==0 or K==1):\r\n et=N\r\n else:\r\n et=pos+pos-N\r\n t=((pos(pos-1))+et)%mod\r\n print(t%mod)\r\n", "t=int(input())\nfor hh in range(0,t):\n n,k=[int(x) for x in input().split()]\n # 2 3\n m=1000000007\n pos=n\n if(n==0):\n rem=k-1\n cur=(rem(rem+1))%m\n print(cur)\n elif(k==1):\n prev=(pos(pos-1))%m\n curr=(prev+pos)%m\n print(curr)\n else:\n # if(k%2==1):\n # p=k//2\n # # p=1\n # inipos=pos\n # pos=pos+p-1\n # prev=pos(pos+1)\n # print(prev,pos)\n # curr=prev+inipos\n # print(curr)\n # else:\n # p=k//2 -1 \n # inipos=pos\n # # pos=4 k = 6 p=2\n # pos=pos+p-1\n # prev=pos(pos+1)\n # now=inipos+p\n # rem=now-inipos\n # print(prev,now,pos,p,rem)\n # curr=prev+now+rem\n # print(curr)\n if(k%2==1):\n k-=1\n p=k//2\n # p=1\n ans=2pos\n inipos=pos\n # pos=4 k = 6 p=2\n pos=(pos+p-1)%m\n prev=(pos(pos+1))%m\n now=(inipos+p)%m\n rem=(now-inipos+m)%m\n # print(prev,now,pos,p,rem)\n curr=(prev+now+rem)%m\n print(curr)\n else:\n k-=1\n p=k//2\n # p=1\n # pos =4 k =6 k=5 p=2\n inipos=pos\n pos=(pos+p)%m\n prev=(pos(pos+1))%m\n # print(prev,pos)\n curr=(prev+inipos)%m\n print(curr)", "# cook your dish here\nt=int(input())\nM=1000000007\nfor z in range(t):\n N,K=list(map(int,input().split()))\n if N==0:\n K=K-1\n t=(K(K+1))%M\n print(t)\n continue\n if K%2==0:\n s=N+K//2-1\n t=((s(s+1))%M+N)%M\n else:\n s=N+K//2\n t=((s(s+1))%M-N)%M\n print(t)", "for i in range(int(input())):\n n,k=map(int,input().split())\n if(n!=0):\n d=(k-1)//2\n z=n*2+(k//2)(2n)+d(d+1)\n z=z%(10*9+7)\n print(z)\n else:\n z=k(k-1)\n z=z%(10*9+7)\n print(z)", "from math import \r\nt=int(input())\r\np=1000000007\r\nwhile(t):\r\n t-=1\r\n x,k=list(map(int,input().split()))\r\n y=ceil(k/2)\r\n if(x==0):\r\n if(k==1):\r\n print(0)\r\n continue\r\n k-=1\r\n y=(k(k+1))\r\n y=y//2\r\n y=y2\r\n print(y%p)\r\n continue\r\n if(k==1):\r\n print((xx)%p)\r\n elif(k==2):\r\n z=xx\r\n z+=2x\r\n print(z%p)\r\n elif(k%2):\r\n minus=(x(x+1))\r\n minus=minus//2\r\n fi=xx\r\n y=x+(k//2)\r\n fac=((y(y+1))//2)\r\n fac-=minus\r\n fac=fac2\r\n fi+=fac\r\n print(fi%p)\r\n else:\r\n minus=(x(x+1))\r\n minus=minus//2\r\n # print(minus)\r\n se=(xx)+(2x)\r\n y=x+((k-1)//2)\r\n fac=((y(y+1))//2)\r\n #print(fac)\r\n fac-=minus\r\n fac=fac2\r\n se+=fac\r\n print(se%p)\r\n\r\n \r\n", "from math import \r\nt=int(input())\r\np=109+7\r\nfor i in range(t):\r\n \r\n \r\n n,k=list(map(int,input().split()))\r\n ans=(n+ceil((k-1)/2))%p\r\n r=ans\r\n \r\n ans=(((((ans+1)(ans))//2)2))%p\r\n \r\n \r\n if(k==0):\r\n print(0)\r\n continue\r\n k=k-1\r\n if(n==0):\r\n print((((k(k+1))//2)2)%p)\r\n continue\r\n\r\n if(k!=0):\r\n if(k%2==0):\r\n ans=ans-(r-(r-n))\r\n \r\n else:\r\n ans=ans-r-(r-n)\r\n else:\r\n ans=ans-r\r\n print(ans%p)\r\n", "# cook your dish here\nt=int(input())\nfor i in range(t):\n a,b=input().split()\n a,b=int(a),int(b)\n if a==0:\n b=b2\n ans=pow(a,2)+int(b/2)2a+pow(int(b/2)-1,2)+int(b/2)-1\n if b%2!=0:\n ans=ans+b-1\n print(ans%1000000007)", "def solve(n,k):\r\n ans=0\r\n if n==0:\r\n if k==1:\r\n return 0\r\n else:\r\n ans=(k-1) * (k)\r\n return ans%1000000007\r\n if k==1:\r\n return (nn)%1000000007\r\n if k%2==0:\r\n ans= nn + nk + int(int((k-1)/2) int((k-1)/2 + 1))\r\n if k%2!=0:\r\n ans= nn + (2n)(max(0,int((k-1)/2))) + int(int((k-1)/2) int((k-1)/2 + 1))\r\n return ans%1000000007\r\n\r\nt=int(input())\r\nfor qw in range(t):\r\n n,k=list(map(int, input().split()))\r\n print(solve(n,k))\r\n", "for t in range(int(input())):\n n,k=map(int,input().split())\n mod=10*9+7\n if n==0:\n if k==1:\n print(0)\n else:\n print(k(k-1)%mod)\n else:\n if k%2==0:\n a=n+k//2-1\n print((a(a+1)+n)%mod)\n else:\n a=n+k//2 \n print((a(a+1)-n)%mod)", "import math\r\nfor _ in range(int(input())):\r\n n, k = list(map(int, input().split()))\r\n t = math.floor(k/2)\r\n r = n + t\r\n s = r(r+1)\r\n if k % 2 == 1:\r\n s -= n\r\n else:\r\n s = s - r\r\n s = s - t\r\n if n == 0:\r\n k = k - 1 \r\n s = int(k(k+1))\r\n print(s % 1000000007)\r\n", "# cook your dish here\nimport sys\nmsg = sys.stdin.readlines()\n\nl=[]\n\nfor i in msg:\n l.append (list (map (int, i.split())))\n \nsm = lambda x: int(x(x+1)1)\n\ndef timew (n, k):\n if n==0:\n time = sm(k-1)\n else:\n if k == 1:\n time = (n-1)(n) + n\n else:\n if k%2==1:\n pre_rounds = (k-1)//2\n time = sm(n+pre_rounds-1) + n + 2(pre_rounds)\n else:\n pre_rounds = (k)//2\n time = sm(n+pre_rounds-1) + n\n return time%1000000007\n \nfor i in l[1:]:\n [n, k] = i\n print(timew (n, k))", "#This code sucks, you know it and I know it. \n#Move on and call me an idiot later.\n\nt = int(input())\nwhile t:\n\tn, k = map(int, input().split())\n\tx = k // 2\n\t\n\tif(n == 0):\n\t\tprint(k * (k-1) % 1000000007)\n\telse:\n\t\tif(k%2 == 0):\n\t\t\tprint(((n + x)(n + x) - x) % 1000000007)\n\t\telse:\n\t\t\tprint(((n + x)(n + x) + x) % 1000000007)\n\tt -= 1"]	{"inputs": [["5", "0 1", "1 1", "2 1", "1 3", "4 6"]], "outputs": [["0", "1", "4", "5", "46"]]}	INTERVIEW	PYTHON3	CODECHEF	13,497
0232f2731d017d78d773236f6488dcf7	UNKNOWN	Chef Ada is building a new restaurant in the following way: - First, $N$ points $X_1, X_2, \ldots, X_N$ are chosen on the $x$-axis. - Then, $N$ columns (numbered $1$ through $N$) are made. For simplicity, the columns are represented as vertical segments; for each valid $i$, the height of the $i$-th segment is $H_i$. - Ada assigns a column to each of the points $X_1, X_2, \ldots, X_N$ in an arbitrary way (each column must be assigned to exactly one point). - Finally, Ada constructs the roof of the restaurant, represented by a polyline with $N$ vertices. Let's denote the column assigned to the $i$-th point by $P_i$. For each valid $i$, the $i$-th of these vertices is $(X_i, H_{P_i})$, i.e. the polyline joins the tops of the columns from left to right. Ada wants the biggest restaurant. Help her choose the positions of the columns in such a way that the area below the roof is the biggest possible. Formally, she wants to maximise the area of the polygon whose perimeter is formed by the roof and the segments $(X_N, H_{P_N}) - (X_N, 0) - (X_1, 0) - (X_1, H_{P_1})$. Let $S$ be this maximum area; you should compute $2 \cdot S$ (it is guaranteed that $2 \cdot S$ is an integer). -----Input----- - The first line of the input contains a single integer $T$ denoting the number of test cases. The description of $T$ test cases follows. - The first line of each test case contains a single integer $N$. - $N$ lines follow. For each valid $i$, the $i$-th of these lines contains two space-separated integers $X_i$ and $H_i$. -----Output----- For each test case, print a single line containing one integer $2 \cdot S$. -----Constraints----- - $1 \le T \le 3 \cdot 10^5$ - $2 \le N \le 10^5$ - $0 \le X_1 < X_2 < \ldots < X_N \le 2 \cdot 10^9$ - $1 \le H_i \le 10^9$ for each valid $i$ - the sum of $N$ over all test cases does not exceed $10^6$ -----Example Input----- 1 5 1 1 2 2 3 3 4 4 5 5 -----Example Output----- 27 -----Explanation-----	["# cook your dish here\nt = int(input())\nfor _ in range(t):\n n = int(input())\n a = []\n b = []\n for i in range(n):\n x,y = list(map(int, input().split()))\n a.append(x)\n b.append(y)\n b.sort()\n xcor = []\n xcor.append(a[1]-a[0])\n xcor.append(a[n-1]-a[n-2])\n for i in range(1,n-1):\n xcor.append(a[i+1]-a[i-1])\n xcor.sort()\n ans = 0\n #print(xcor)\n #print(b)\n for i in range(n):\n ans = ans + xcor[i]b[i]\n print(ans) \n", "t=int(input())\nwhile(t):\n t-=1\n n=int(input())\n x = []\n h = []\n for i in range (n):\n xi,hi = [int(i) for i in input().split()]\n x.append(xi)\n h.append(hi)\n diff = [x[1]-x[0],x[n-1]-x[n-2]]\n for i in range (1,n-1):\n diff.append(x[i+1]-x[i-1])\n diff.sort()\n h.sort()\n ans = 0\n for i in range (n):\n ans+=h[i]diff[i]\n print(ans)", "# cook your dish here\nfor _ in range(int(input())):\n n = int(input())\n xloli=[]\n hloli=[]\n d1=[]\n d2=[]\n for i in range(n):\n (x,h)=(int(x) for x in input().split())\n xloli.append(x)\n hloli.append(h)\n for i in range(1,n):\n d1.append(xloli[i]-xloli[i-1])\n d2.append(d1[0])\n for i in range(n-2):\n d2.append(d1[i+1]+d1[i])\n d2.append(d1[-1])\n kaori=0\n hloli.sort()\n d2.sort()\n for i in range(n):\n kaori+=hloli[i]d2[i]\n print(kaori)\n", "t=int(input())\nfor i in range(t):\n n=int(input())\n xl=[]\n hl=[]\n for j in range(n):\n x,h=list(map(int,input().strip().split()))\n xl.append(x)\n hl.append(h)\n a=[0 for j in range(n)]\n a[0]=xl[1]-xl[0]\n for j in range(1,n-1):\n a[j]=xl[j+1]-xl[j-1]\n a[n-1]=xl[n-1]-xl[n-2]\n a.sort()\n hl.sort()\n sum=0\n for j in range(n):\n sum+=a[j]hl[j]\n print(sum)\n", "t = int(input())\nfor _ in range(t):\n n = int(input())\n a, b = [], []\n for _ in range(n):\n x, h = input().split()\n a.append(int(x))\n b.append(int(h))\n a = [y - x for x, y in zip(a, a[1:])]\n a = sorted(x + y for x, y in zip([0] + a, a + [0]))\n print(sum(x * y for x, y in zip(a, sorted(b))))", "def find(X,H):\n if len(X) == 2:\n return (X[1]-X[0])(sum(H))\n \n X = sorted(X)\n W = []\n for i in range(1,len(H)-1):\n W += [X[i+1]-X[i-1]]\n W += [X[1]-X[0]]\n W += [X[-1]-X[-2]]\n W = sorted(W)\n H = sorted(H)\n return sum([W[i]H[i] for i in range(len(W))])\n\nfor _ in range(int(input())):\n N = int(input())\n X = []\n H = []\n for i in range(N):\n x,h = list(map(int,input().strip().split()))\n X += [x]\n H += [h]\n print(find(X,H))", "'''a,b,c=map(int,input().split())\nif a-b>>31 and a-c>>31:\n print(a)\nelif b-c>>31 and b-a>>31:\n print(b)\nelse:\n print(c)'''\n\n\n\n#*****************************************************************************\u00a0\u00a0\u00a0\u00a0********************\n\n\n'''n=int(input())\nc=0\na=[i for i in range(1,n+1)]\nfor i in range(n-1):\n for j in range(i,n):\n if a[i]^a[j]>n:\n c+=1\n print('('+str(i+1)+','+str(j+1)+')')\nprint(c)'''\n\n\n#***************************************************************************\u00a0\u00a0\u00a0\u00a0************************\n\n\n'''l=[0 for i in range(64)]\na=[str(i) for i in range(10)]+[chr(j) for j in range(65,91)]+[chr(k) for k in \u00a0\u00a0\u00a0\u00a0range(97,123)]+['-','_']\n\nfor i in range(64):\n count=0\n for j in range(64):\n if i&j==i:\n count+=1\n l[i]=2count-1\nprint(l)\n\nfor _ in range(int(input())):\n s=input()\n res=1\n for i in s:\n res=l[a.index(i)]\n print(res%1000000007)'''\n\n\n\n#****************************************************************************\u00a0\u00a0\u00a0\u00a0**************************\n\nfor _ in range(int(input())):\n n=int(input())\n X=[0 for i in range(n)]\n H=[0 for i in range(n)]\n for i in range(n):\n x,h=list(map(int,input().split()))\n X[i]=x\n H[i]=h\n X1=[0 for i in range(n)]\n for i in range(n-2):\n X1[i]=X[i+2]-X[i]\n X1[n-2],X1[n-1]=X[1]-X[0],X[n-1]-X[n-2]\n X1.sort()\n H.sort()\n res=0\n for i in range(n):\n res+=X1[i]H[i]\n print(res)\n", "for _ in range(int(input())):\n n=int(input())\n x=[]\n p=[]\n for j in range(n):\n a,b=list(map(int,input().split()))\n x.append(a)\n p.append(b)\n differences=[]\n for u in range(n-1,1,-1):\n differences.append(x[u]-x[u-2])\n differences.append(x[-1]-x[-2])\n differences.append(x[1]-x[0])\n differences.sort()\n p.sort()\n answer=0\n while(len(differences)>0):\n answer=answer+(p.pop()differences.pop())\n print(answer)\n", "# cook your dish here\nfor i in range(int(input())):\n n=int(input())\n arr1=[]\n arr2=[]\n for i in range(n):\n l=input().split()\n arr1.append(int(l[0]))\n arr2.append(int(l[1]))\n arr1.append(arr1[-1])\n arr1.insert(0,arr1[0])\n arr2.sort()\n base=[]\n for i in range(1,n+1):\n base.append(arr1[i+1]-arr1[i-1])\n base.sort()\n ans=0\n for i in range(n):\n ans+=base[i]arr2[i]\n print(ans)\n", "# cook your dish here\n# cook your dish here\nt=int(input(''))\nfor k in range (t):\n n=int(input(''))\n li=[]\n li1=[]\n li2=[]\n for i in range (n):\n p,q=input().split()\n p=int(p)\n q=int(q)\n li.append(p)\n li1.append(q)\n r=li[1]-li[0]\n #print(r)\n li2.append(r)\n for i in range (1,n-1):\n p=li[i+1]-li[i-1]\n li2.append(p)\n li2.append(li[n-1]-li[n-2])\n li2.sort()\n li1.sort()\n ans=0\n for i in range (n):\n ans=ans+li1[i]li2[i]\n #print(li2[i])\n print(ans)", "for t in range(int(input())):\n x = []\n y = []\n z = []\n \n res = 0\n n = int(input(\"\"))\n for i in range(n):\n temp1,temp2 = input(\"\").split()\n x.append(int(temp1))\n y.append(int(temp2))\n \n z.insert(0,x[1] - x[0])\n z.insert(-1,x[-1] - x[-2])\n \n for i in range(1,n-1):\n z.insert(i,x[i+1] - x[i-1])\n \n y.sort(reverse = True)\n z.sort(reverse = True)\n for i in range(n):\n res = res + y[i] z[i]\n \n print(res)", "# cook your dish here\nt = int(input())\nfor _ in range(t):\n n = int(input())\n a, b = [], []\n for _ in range(n):\n x, h = input().split()\n a.append(int(x))\n b.append(int(h))\n a = [y - x for x, y in zip(a, a[1:])]\n a = sorted(x + y for x, y in zip([0] + a, a + [0]))\n print(sum(x * y for x, y in zip(a, sorted(b))))", "# cook your dish here\nfor _ in range(int(input())):\n n = int(input())\n x1, h1 = map(int, input().split())\n x2, h2 = map(int, input().split())\n l1 = [x2-x1]\n l2 = [h1, h2]\n for i in range(2, n):\n x, h = map(int, input().split())\n l1.append(x-x1)\n l2.append(h)\n x1 = x2\n x2 = x\n l1.append(x2-x1)\n l1.sort()\n l2.sort()\n a = 0\n for i in range(n):\n a += l1[i]l2[i]\n print(a)", "# cook your dish here\nfrom sys import stdin\n\nt = int(stdin.readline())\n\nwhile t:\n n = int(stdin.readline())\n\n diff_prev = 0\n d, D = [], []\n h = [0]\n\n x_prev, h[0] = [int(x) for x in stdin.readline().split()]\n\n for i in range(n-1):\n x, ht = [int(x) for x in stdin.readline().split()]\n\n h.append(ht)\n d.append(x - x_prev)\n D.append(diff_prev + d[i])\n diff_prev = d[i]\n x_prev = x\n \n D.append(d[n-2])\n \n D.sort()\n h.sort()\n\n ans = 0\n for i in range(n):\n ans += D[i]h[i]\n\n print(ans)\n\n t -= 1", "# cook your dish here\nfrom sys import stdin\n\nt = int(stdin.readline())\n\nwhile t:\n n = int(stdin.readline())\n\n diff_prev = 0\n d, D = [], []\n h = [0]\n\n x_prev, h[0] = [int(x) for x in stdin.readline().split()]\n\n for i in range(n-1):\n x, ht = [int(x) for x in stdin.readline().split()]\n\n h.append(ht)\n d.append(x - x_prev)\n D.append(diff_prev + d[i])\n diff_prev = d[i]\n x_prev = x\n \n D.append(d[n-2])\n \n D.sort()\n h.sort()\n\n ans = 0\n for i in range(n):\n ans += D[i]h[i]\n\n print(ans)\n\n t -= 1", "# cook your dish here\n\nT = int(input())\nt = 0\nwhile t < T:\n t += 1\n N = int(input())\n h,x = list(), list()\n for i in range(N):\n a,b=list(map(int, input().split()))\n h.append(b)\n x.append(a)\n \n v=[]\n for i in range(N):\n v.append(x[min(i+1,N-1)]-x[max(i-1,0)])\n h.sort()\n v.sort()\n \n ans = 0\n for i in range(N):\n ans += h[i] v[i]\n \n print(ans)\n \n", "for t in range(int(input())):\n n=int(input())\n height=[]\n d=[]\n prev=0\n points=[]\n nex=0\n for i in range(n):\n x,h=[int(x) for x in input().split()]\n height.append(h)\n points.insert(i,x)\n for i in range(1,n):\n diff=points[i]-points[i-1]\n d.append(diff)\n points=[]\n for i in range(n-1):\n num=d[i]+prev\n prev=d[i]\n points.append(num)\n points.append(d[n-2])\n points.sort(reverse=True)\n height.sort(reverse=True)\n s=0\n for i in range(n):\n s+=(height[i]points[i])\n print(s)\n \n \n \n \n", "for _ in range(int(input())):\n n=int(input())\n a=[]\n g=[]\n h=[]\n I=list(map(int,input().split()))\n P=list(map(int,input().split()))\n a.append(I[0])\n a.append(P[0])\n h.append(I[1])\n h.append(P[1])\n g.append(a[1]-a[0])\n for i in range(2,n):\n L=list(map(int,input().split()))\n a.append(L[0])\n g.append(a[i]-a[i-2])\n h.append(L[1])\n g.append(a[-1]-a[-2])\n g.sort()\n h.sort()\n var=0\n for i in range(n):\n var+=h[i]g[i]\n print(var)\n \n \n \n", "t = int(input())\nfor _ in range(t):\n n = int(input())\n x, p = [], []\n for __ in range(n):\n line = list(map(int, input().split()))\n x.append(line[0])\n p.append(line[1])\n g = []\n for i in range(n-1):\n g.append(x[i+1] - x[i])\n bois = []\n bois.append(g[0])\n for k in range(n-2):\n bois.append(g[k+1] + g[k])\n bois.append(g[n-2])\n bois.sort()\n p.sort()\n ans = 0\n for i in range(n):\n ans += p[i] * bois[i]\n print(ans)\n \n \n", "t = int(input())\nfor _ in range(t):\n n = int(input())\n x, p = [], []\n for __ in range(n):\n line = list(map(int, input().split()))\n x.append(line[0])\n p.append(line[1])\n g = []\n for i in range(n-1):\n g.append(x[i+1] - x[i])\n bois = []\n bois.append(g[0])\n for k in range(n-2):\n bois.append(g[k+1] + g[k])\n bois.append(g[n-2])\n bois.sort()\n p.sort()\n ans = 0\n for i in range(n):\n ans += p[i] * bois[i]\n print(ans)\n", "# cook your dish here\nT = int(input())\nfor _ in range(T):\n n = int(input())\n a, b = [], []\n for _ in range(n):\n x, h = input().split()\n a.append(int(x))\n b.append(int(h))\n a = [y - x for x, y in zip(a, a[1:])]\n a = sorted(x + y for x, y in zip([0] + a, a + [0]))\n print(sum(x * y for x, y in zip(a, sorted(b))))", "for _ in range(int(input())):\n n = int(input())\n arr = []\n height = []\n d = []\n final = []\n for i in range(n):\n x,y = map(int,input().split())\n arr.append(x)\n height.append(y)\n for x in range(1,n):\n d.append(arr[x]-arr[x-1])\n final.append(d[0])\n for i in range(len(d)-1):\n final.append(d[i]+d[i+1])\n final.append(d[-1])\n height.sort()\n final.sort()\n ans = 0\n for x in range(n):\n ans+=(final[x]height[x])\n print(ans)", "for _ in range(int(input())):\n n = int(input())\n x_arr = []\n h_arr = []\n d = []\n D = []\n for i in range(n):\n x,y = map(int,input().split())\n x_arr.append(x)\n h_arr.append(y)\n for x in range(1,n):\n d.append(x_arr[x]-x_arr[x-1])\n D.append(d[0])\n for i in range(len(d)-1):\n D.append(d[i]+d[i+1])\n D.append(d[-1])\n h_arr.sort()\n D.sort()\n ans = 0\n for x in range(n):\n ans+=(D[x]h_arr[x])\n print(ans)", "t=int(input())\nwhile t:\n dd=[]\n l=[]\n h=[]\n pr=0\n d=[]\n n=int(input())\n for i in range(n):\n x,hi=map(int,input().split())\n l.append(x)\n h.append(hi)\n l.sort()\n for i in range(1,n):\n dd.append(l[i]-l[i-1])\n d.append(dd[0])\n for i in range(1,n-1):\n d.append(dd[i]+dd[i-1])\n d.append(dd[-1])\n d.sort()\n h.sort()\n pr=0\n #print(d,h)\n for i in range(n):\n pr+=d[i]*h[i]\n print(pr)\n t-=1"]	{"inputs": [["1", "5", "1 1", "2 2", "3 3", "4 4", "5 5"]], "outputs": [["27"]]}	INTERVIEW	PYTHON3	CODECHEF	11,372
08882683f53f827e144260f1e16a4b60	UNKNOWN	Roman has no idea, why this problem is called Stone. He also has no idea on how to solve the followong problem: given array of N integers A and a number K. During a turn the maximal value over all Ai is chosen, let's call it MAX. Then Ai = MAX - Ai is done for every 1 <= i <= N. Help Roman to find out how will the array look like after K turns. -----Input----- The numbers N and K are given in the first line of an input. Then N integers are given in the second line which denote the array A. -----Output----- Output N numbers on a single line. It should be the array A after K turns. -----Constraints----- - 1 <= N <= 105 - 0 <= K <= 109 - Ai does not exceed 2 * 109 by it's absolute value. -----Example----- Input: 4 1 5 -1 7 0 Output: 2 8 0 7	["n, k = list(map(int, input().split()))\nA = list(map(int, input().split()))\nmaximum = max(A)\nminimum = min(A)\nif k == 0:\n for i in A:\n print(i, end=' ')\nelif k&1:\n for i in A:\n print(maximum - i, end=' ')\nelse:\n for i in A:\n print(i - minimum, end=' ')\n", "n,k = input().split()\nn=int(n)\nk=int(k)\na=list(int(x) for x in input().split())\nif k==0:\n print(\" \".join(str(x) for x in a))\nelif k%2 ==0:\n m=max(a)\n a=[m-x for x in a]\n m=max(a)\n a=[m-x for x in a]\n print(\" \".join(str(x) for x in a))\nelse:\n m=max(a)\n a=[m-x for x in a]\n print(\" \".join(str(x) for x in a))", "n,k = list(map(int,input().split()))\na = list(map(int,input().split()))\n\nif k == 0:\n ans = a\nelse:\n t = max(a)\n for i in range(n):\n a[i] = t-a[i]\n \n if k%2==0:\n t = max(a)\n for i in range(n):\n a[i] = t-a[i]\n \nfor i in a:\n print(i, end=' ')\n\nprint()", "def pf(a):\n M = max(a)\n for j in range(len(a)):\n a[j] = M-a[j]\n\nn,k = list(map(int, input().split()))\na=list(map(int, input().split()))\nif k > 0:\n pf(a)\n if k % 2 == 0:\n pf(a)\n\nprint(\" \".join(map(str, a)))\n\n\n# while True:\n# cmd = raw_input(\"=> \")\n# if cmd == 'e': \n# print(\"bye\")\n# break\n# elif cmd == 'r': \n# pf()\n# print(a)\n# else: print(\"command not implemented\")\n", "import sys\ndef stone(s):\n n,k = list(map(int,s.split()))\n l = list(map(int,sys.stdin.readline().split()))\n if k%2 == 1:\n k = 1\n \n elif k%2 == 0 and k != 0:\n k = 2\n else:\n k = 0\n for j in range(k):\n m = max(l)\n for i in range(n):\n l[i] = m - l[i]\n s1 = ''\n for i in range(n):\n s1 += (str(l[i]) + ' ')\n print(s1)\nstone(sys.stdin.readline()) ", "# your code goes here\ndef printo(arr):\n for i in range(len(arr)):\n print(arr[i], end=' ')\n print('')\n\nn,k=(int(e) for e in input().strip().split())\n\narr=[int(e) for e in input().strip().split()]\nflag=0\nif k==0:\n printo(arr)\n flag=1\nif flag==0:\n mx=max(arr)\n for i in range(n):\n arr[i]=mx-arr[i]\n if k%2==1:\n printo(arr)\n else:\n mx=max(arr)\n for i in range(n):\n arr[i]=mx-arr[i]\n printo(arr)", "line1 = input().split(' ')\nline2 = input().split(' ')\nn = int(line1[0])\nk = int(line1[1])\nmoves = k%2\n\na = [0 for x in range(n)]\n\nfor i in range(n):\n a[i] = int(line2[i])\n\nif moves==0:\n moves=2\n \nwhile moves>0:\n m = -20000000000\n for i in range(n):\n if a[i]>m:\n m = a[i]\n \n for i in range(n):\n a[i] = m-a[i]\n \n moves-=1\n \nans = \"\"\n\nfor i in range(n):\n ans+=(str(a[i])+\" \")\nif k==0:\n ans=\"\"\n for i in range(n):\n ans+=(line2[i]+\" \") \n \n\nprint(ans)\n", "k1=input()\nk1=list(map(int,k1.split(\" \")))\nk=k1[1]\nar=input()\nar=list(map(int,ar.split(\" \")))\nif(k==0):\n for i in ar:\n print(i, end=' ')\nelif(k%2==1):\n max1=max(ar)\n for i in range(0,len(ar)):\n ar[i]=max1-ar[i]\n for i in ar:\n print(i, end=' ')\nelse: \n for l in range(0,2):\n max1=max(ar)\n for i in range(0,len(ar)):\n ar[i]=max1-ar[i]\n for i in ar:\n print(i, end=' ')", "n,k=list(map(int,input().split()))\na=list(map(int,input().split()))\nmax1=max(a)\nmin1=min(a)\nif k==0:\n for i in range(n):\n print(a[i], end=' ')\nelif k%2==1:\n for i in range(n):\n print(max1-a[i], end=' ') \nelse:\n for i in range(n):\n print(a[i]-min1, end=' ')\n", "\"\"\"\nhttp://www.codechef.com/MAY14/problems/RRSTONE\n\"\"\"\n\nN,K = list(map(int,input().split()))\n#print N,K\nA = list(map(int,input().split()))\n#print A\n\nfor i in range(min(K,K%2+2)) :\n m = max(A)\n A = [m-j for j in A]\n #print A\n\nprint(\" \".join(map(str,A)))\n\n", "n,k=input().split()\nn,k=int(n),int(k)\na=list(map(int,input().split()))\nmaxi=0\nmini=0\nif k!=0:\n maxi=max(a)\n mini=min(a)\nmini=maxi-mini\nfor i in range(n):\n a[i]=maxi-a[i]\nif k%2==0:\n for i in range(n):\n a[i]=mini-a[i]\nprint(\" \".join(map(str,a)))", "import sys\n\n\ndef solve(n, k, a):\n for i in range(k):\n max_a = max(a)\n for i in range(len(a)):\n a[i] = max_a - a[i]\n print(' '.join([str(x) for x in a]))\n\ndef main():\n parts = sys.stdin.readline().strip().split(' ')\n n = int(parts[0])\n k = int(parts[1])\n if k > 2:\n k %= 2\n if k == 0:\n k = 2\n a = [int(x) for x in sys.stdin.readline().strip().split(' ')]\n solve(n, k, a)\nmain()", "\nN=input()\nA=input()\nN=N.split()\nA=A.split()\nN = list(map(int, N))\nA= list(map(int, A))\nMAX=max(A)\nMIN=min(A)\nif N[1]==0:\n for i in range(N[0]):\n print(A[i], end=' ')\nelse:\n if N[1]%2==1:\n for i in range(N[0]):\n A[i]=MAX-A[i]\n print(A[i], end=' ')\n else:\n for i in range(N[0]):\n A[i]=A[i]-MIN\n print(A[i], end=' ')\n", "def Turn(a, n):\n m = max(a)\n for i in range(n):\n a[i] = m - a[i]\n\nn, k = list(map(int, input().split()))\na = list(map(int, input().split()))\nif k > 0:\n Turn(a, n)\n k -= 1\n if k & 1 == 1:\n Turn(a, n)\nprint(' '.join(map(str,a)))\n", "#import time\n\nline = input().split()\nN = int(line[0])\nK = int(line[1])\nb = list(map(int, input().split()))\ni = 0\nif K == 0:\n print(' '.join(str(x) for x in b))\nelse:\n mx = max(b)\n for j in range(0, N):\n b[j] = mx - b[j]\n if K % 2 == 0:\n mx = max(b)\n for j in range(0, N):\n b[j] = mx - b[j]\n print(' '.join(str(x) for x in b))\n else:\n print(' '.join(str(x) for x in b))", "n,k=list(map(int,input().split()))\na=list(map(int,input().split()))\nb=0\nc=110000000\nfor d in a:\n b=max(b,d)\n c=min(d,c)\nif k==0:\n for x in a:\n print(x, end=' ')\nelse:\n if k%2==0:\n for x in a:\n print(x-c, end=' ')\n else:\n for x in a:\n print(b-x, end=' ')\n", "import sys\n\ndef __starting_point():\n n,k = [int(u) for u in sys.stdin.readline().strip().split()]\n val = [int(u) for u in sys.stdin.readline().strip().split()]\n ans = \"\"\n if k > 0:\n maxval = max(val)\n for i in range(n):\n val[i] = maxval - val[i]\n maxval = max(val)\n if k%2 == 0:\n for i in range(n):\n ans += str(maxval - val[i]) + ' '\n print(ans[:-1])\n else:\n for i in range(n):\n ans += str(val[i]) + ' '\n print(ans[:-1])\n else:\n for i in range(n):\n ans += str(val[i]) + ' '\n print(ans[:-1])\n\n__starting_point()", "n,k = list(map(int,input().split()))\na = list(map(int,input().split()))\nm1 = max(a)\nm2 = min(a)\nif k == 0 :\n for i in a:\n print(i, end=' ')\nelif k % 2 == 1:\n for i in a:\n print(m1 - i, end=' ')\nelse :\n for i in a:\n print(i - m2, end=' ')\n", "import sys\nn,k=list(map(int,input().split()))\na=list(map(int,input().split()))\nif k==0:\n print(\" \".join(map(str,a)))\nelif k%2==1:\n ma=max(a)\n print(\" \".join(map(str,[ma-i for i in a])))\nelse:\n mi=min(a)\n print(\" \".join(map(str,[i-mi for i in a]))) \nreturn "]	{"inputs": [["4 1", "5 -1 7 0"]], "outputs": [["2 8 0 7"]]}	INTERVIEW	PYTHON3	CODECHEF	6,630
f2a9ee7b72b2c9803330cad5083c53dc	UNKNOWN	Chef just got a box of chocolates as his birthday gift. The box contains $N$ chocolates in a row (numbered $1$ through $N$), where $N$ is even. For each valid $i$, the $i$-th chocolate has a sweetness value $W_i$. Chef wants to eat all the chocolates in the first half of the box and leave all chocolates in the second half uneaten. Since he does not like chocolates that are too sweet, he will be unhappy if at least one of the chocolates he eats has the maximum sweetness among all the chocolates in the box. A right cyclic shift by $k$ chocolates ($0 \le k < N$) consists of moving the last $k$ chocolates in the row to the beginning in the same order and moving each of the remaining $N-k$ chocolates $k$ places to the right. Before eating the first half of the chocolates, Chef wants to perform some right cyclic shift in such a way that he will not be unhappy after eating them. Find the number of ways to do this, i.e. the number of valid integers $k$ such that if Chef performs the right cyclic shift by $k$ chocolates and then eats the first half of the chocolates in the box, he does not become unhappy. -----Input----- - The first line of the input contains a single integer $T$ denoting the number of test cases. The description of $T$ test cases follows. - The first line of each test case contains a single integer $N$. - The second line contains $N$ space-separated integers $W_1, W_2, \ldots, W_N$. -----Output----- For each test case, print a single line containing one integer ― the number of shifts for which Chef does not become unhappy. -----Constraints----- - $1 \le T \le 5$ - $1 \le N \le 10^5$ - $N$ is even - $1 \le W_i \le 10^5$ for each valid $i$ -----Example Input----- 2 6 1 1 2 1 1 1 6 1 1 2 1 1 2 -----Example Output----- 3 0 -----Explanation----- Example case 1: The three valid right shifts and the contents of the box for these shifts are: - shift by $k = 1$: $(1, 1, 1, 2, 1, 1)$ - shift by $k = 2$: $(1, 1, 1, 1, 2, 1)$ - shift by $k = 3$: $(1, 1, 1, 1, 1, 2)$	["from collections import deque\nt=int(input())\n\nfor i in range(t):\n n=int(input())\n N=[i for i in range(1, n+1)]\n w=list(map(int, input().split()))\n max_sweetness=max(w)\n sizes=[]\n cnt=0\n for i in range(n):\n if w[i]!=max_sweetness:\n cnt+= 1 \n else:\n sizes.append(cnt)\n cnt=0\n \n if cnt!=0:\n sizes[0]=(cnt+sizes[0])\n \n res=0\n for i in range(len(sizes)):\n res+=max(sizes[i]-n//2+1, 0)\n \n print(res)", "# cook your dish here\nt=int(input())\nfor i in range(t):\n a=int(input())\n cho =list(map(int, input().split()))\n maxc=max(cho)\n start=cho.index(maxc)\n mid =int(len(cho)/2)\n for j in range(len(cho)-1, 0, -1):\n if(cho[j]==maxc):\n end = j\n break\n ans =((len(cho))-end)-(mid-start)\n print(max(0,ans))", "# cook your dish here\ndef answer():\n m=max(w)\n count=[]\n c=0\n for i in w:\n if(i==m):\n count.append(c)\n c=-1\n c+=1\n\n if(c):\n count.append(c)\n\n first=(w[0]!=m)\n last=(w[-1]!=m)\n\n if(first and last):\n count[0]+=count[-1]\n count.pop()\n\n k=0 \n for i in count:\n if(i >= n//2):\n k+=i-n//2+1\n return k\n \n \n\nfor T in range(int(input())):\n n=int(input())\n w=list(map(int,input().split()))\n\n print(answer())\n", "# cook your dish here\nt = int(input())\nfor _ in range(t):\n n = int(input())\n arr = list(map(int, input().split()))\n maxi = max(arr)\n for i in range(n-1,-1,-1):\n if(arr[i]==maxi):\n r = i\n break\n for i in range(n):\n if(arr[i]==maxi):\n r = r-i\n break\n if((n//2)-r<0):\n print(0)\n else:\n print((n//2)-r)", "# cook your dish here\nt = int(input())\nfor _ in range(t):\n n = int(input())\n arr = list(map(int, input().split()))\n maxi = max(arr)\n for i in range(n-1,-1,-1):\n if(arr[i]==maxi):\n r = i\n break\n for i in range(n):\n if(arr[i]==maxi):\n r = r-i\n break\n if((n//2)-r<0):\n print(0)\n else:\n print((n//2)-r)\n", "t=int(input())\nwhile(t>0):\n t-=1\n n=int(input())\n l=list(map(int,input().split()))\n m=max(l)\n a=[]\n for i in range(n):\n if(m==l[i]):\n a.append(i+1)\n b=[]\n for i in range(1,len(a)):\n b.append(a[i]-a[i-1])\n if(len(a)>1):\n b.append(n-a[-1]+a[0])\n k=max(b)\n if(k>=n//2):\n print(k-(n//2))\n else:\n print(0)\n else:\n print((n+1)//2)\n\n", "from sys import maxsize, stdout, stdin\nmod = int(1e9 + 7)\ndef I(): return int(stdin.readline())\ndef lint(): return [int(x) for x in stdin.readline().split()]\ndef S(): return input().strip()\ndef grid(r, c): return [lint() for i in range(r)]\nfor _ in range(I()):\n n = I()\n ls = lint()\n cnt =0\n arr =[0]n\n m = max(ls)\n idx = ls.index(m)\n ideal = n//2\n shift = ideal - idx\n for i in range(n):\n arr[i]= (ls[(i-shift)%n])\n if m in arr[:n//2 ]:\n print(0)\n else:\n for j in range(n-1,n//2 -1 ,-1):\n if arr[j]!=m:\n cnt+=1\n else:break\n print(cnt+1)\n", "# cook your dish here\nfor _ in range(int(input())):\n q = int(input())\n arr = list(map(int,input().split()))\n t = max(arr)\n for i in range(q-1,-1,-1):\n if(arr[i]==t):\n r = i\n break\n for i in range(q):\n if(arr[i]==t):\n r = r-i\n break\n if((q//(1+1))-r < 0):\n print(0)\n else:\n print((q//(1+1))-r)", "# cook your dish here\nfor _ in range(int(input())):\n n=int(input())\n l=list(map(int,input().split()))\n mid=n//2-1\n max_beg=max(l)\n f_o=l.index(max_beg)\n l.reverse()\n l_o=l.index(max_beg)\n l_o=n-1-l_o\n if l_o-f_o>=mid:\n print(0)\n else:\n if f_o==l_o:\n f_o=mid \n print(n-1-f_o)\n else:\n gap=l_o-f_o \n f_o=mid \n l_o=f_o+gap \n print(n-1-l_o)\n \n \n", "# cook your dish here\ntry:\n T = int(input())\n while T>0:\n N = int(input())\n midway = (N//2) - 1\n num = list(map(int, input().split()[:N]))\n max_beg = max(num)\n first_occr = num.index(max_beg)\n num.reverse()\n last_occr = num.index(max_beg)\n last_occr = N-1-last_occr\n \n if last_occr-first_occr >= midway:\n print(0)\n else:\n if first_occr==last_occr:\n first_occr=midway\n print(N-1-first_occr)\n else:\n gap = last_occr-first_occr\n first_occr=midway\n last_occr=first_occr+gap\n print(N-1-last_occr)\n T-=1\n\nexcept EOFError as e:\n print(\"\")", "try:\n T = int(input())\n while T>0:\n N = int(input())\n midway = (N//2) - 1\n num = list(map(int, input().split()[:N]))\n max_beg = max(num)\n first_occr = num.index(max_beg)\n num.reverse()\n last_occr = num.index(max_beg)\n last_occr = N-1-last_occr\n \n if last_occr-first_occr >= midway:\n print(0)\n else:\n if first_occr==last_occr:\n first_occr=midway\n print(N-1-first_occr)\n else:\n gap = last_occr-first_occr\n first_occr=midway\n last_occr=first_occr+gap\n print(N-1-last_occr)\n T-=1\n\nexcept EOFError as e:\n print(\"\")", "for _ in range(int(input())):\n n = int(input())\n w = (map(int, input().split()),)\n m = 0\n for i in range(n):\n if w[i] > w[m]: m = i\n count = 0\n gap = 0\n for i in range(m+1, m+n+1):\n if w[i%n] == w[m]:\n count += max(0,gap-n//2+1)\n gap = 0\n else: gap += 1\n print(count)", "for _ in range(int(input())):\n n=int(input())\n l=list(map(int,input().split()))\n u=[]\n k=0\n t=max(l)\n for i in range(n):\n if l[i]==t:\n break\n y=i+1\n while y!=i:\n if l[y] !=t:\n k+=1\n else:\n u.append(k)\n k=0\n y=(y+1)%n\n if k!=0:\n u.append(k)\n s=0\n for i in range(len(u)):\n s+=max(0,u[i]-n//2+1)\n print(s)", "for _ in range(int(input())):\n n=int(input())\n l=list(map(int,input().split()))\n u=[]\n k=0\n t=max(l)\n for i in range(n):\n if l[i]==t:\n break\n y=i+1\n while y!=i:\n if l[y] !=t:\n k+=1\n else:\n u.append(k)\n k=0\n y=(y+1)%n\n if k!=0:\n u.append(k)\n s=0\n for i in range(len(u)):\n s+=max(0,u[i]-n//2+1)\n print(s)", "for _ in range(int(input())):\n n=int(input())\n l=list(map(int,input().split()))\n u=[]\n k=0\n t=max(l)\n for i in range(n):\n if l[i]==t:\n break\n y=i+1\n while y!=i:\n if l[y] !=t:\n k+=1\n else:\n u.append(k)\n k=0\n y=(y+1)%n\n if k!=0:\n u.append(k)\n s=0\n for i in range(len(u)):\n s+=max(0,u[i]-n//2+1)\n print(s)", "for _ in range(int(input())):\n n=int(input())\n l=list(map(int,input().split()))\n u=[]\n k=0\n t=max(l)\n for i in range(n):\n if l[i]==t:\n break\n y=i+1\n while y!=i:\n if l[y] !=t:\n k+=1\n else:\n u.append(k)\n k=0\n y=(y+1)%n\n if k!=0:\n u.append(k)\n s=0\n for i in range(len(u)):\n s+=max(0,u[i]-n//2+1)\n print(s)\n", "t = int(input())\nwhile t>0:\n t -= 1\n n = int(input())\n a = [int(x) for x in input().split()]\n m = max(a)\n ind = []\n for i in range(n):\n if a[i] == m:\n ind.append(i)\n if len(ind) == 1:\n print(n//2)\n continue\n f = ind[0]\n l = ind[-1]\n width = l-f+1\n if width > n//2:\n print(0)\n else:\n print(n//2-width+1)\n# cook your dish here\n", "t = int(input())\nwhile t>0:\n t -= 1\n n = int(input())\n a = [int(x) for x in input().split()]\n m = max(a)\n ind = []\n for i in range(n):\n if a[i] == m:\n ind.append(i)\n if len(ind) == 1:\n print(n//2)\n continue\n f = ind[0]\n l = ind[-1]\n width = l-f+1\n if width > n//2:\n print(0)\n else:\n print(n//2-width+1)\n\n\n\n\n\n\n\n\n", "test = int(input())\nfor _ in range(test):\n n=int(input())\n array = list(map(int, input().split()))\n maxi = max(array)\n index=[]\n for i in range(n):\n if array[i]==maxi:\n index.append(i)\n \n if len(index)==1:\n print(n//2)\n else:\n if index[len(index)-1]-index[0]>=n//2:\n print(0)\n else:\n print(n//2 - (index[len(index)-1]-index[0]))", "t = int(input())\n#for each test cases\nfor i in range(t):\n n=int(input())\n s=list(map(int,input().split()))\n m=max(s)\n c=[]\n for i in range(n):\n if(s[i]==m):\n c.append(i)\n if (len(c)==1):\n print(n//2)\n else:\n if (c[-1]-c[0]+1>n//2):\n print(0)\n else:\n x=c[-1]-c[0]\n print(n//2-x)", "for _ in range(int(input())):\n N = int(input())\n seq = list(map(int,input().split()))\n maxx = max(seq)\n count = 0\n seq = seq+seq\n max_cont = 0\n for i in range(2*N):\n if seq[i] != maxx:\n count +=1\n else:\n if count > max_cont:\n max_cont = count\n count = 0\n if count > max_cont:\n max_cont = count\n print(max(max_cont-N//2+1,0))", "from collections import defaultdict\ntest=int(input())\nfor _ in range(test):\n r=int(input())\n s=list(map(int,input().split()))\n m=max(s)\n l=int(r/2)\n step=0\n index=[]\n for i in range(len(s)):\n if s[i]==m:\n index.append(i)\n if len(index)==1:\n print(l)\n else:\n diff=index[-1]-index[0]\n if diff+1 > l:\n print(0)\n else:\n print(l-diff)", "class node:\n def __init__(self, size, elements):\n self.size = size\n self.elements = elements\n\n\ndef solve(ele, s):\n m = max(ele)\n i, j = 0, 0\n flag = True\n for k in range(s):\n if ele[k] == m:\n j = k\n if flag:\n flag = False\n i = k\n if i == j:\n return s//2\n elif (j-i) >= s//2:\n return 0\n else:\n i, j = s//2, j + s//2 - i\n return s-j\n\n\ndef __starting_point():\n t = int(input())\n inputs = []\n for i in range(t):\n inputs.append(node(int(input()), list(map(int, input().split()))))\n for i in inputs:\n print(solve(i.elements, i.size))\n\n__starting_point()"]	{"inputs": [["2", "6", "1 1 2 1 1 1", "6", "1 1 2 1 1 2"]], "outputs": [["3", "0"]]}	INTERVIEW	PYTHON3	CODECHEF	9,051
af41fe00d667c136d17c5def6f06ecca	UNKNOWN	The Fibonacci sequence $F_0, F_1, \ldots$ is a special infinite sequence of non-negative integers, where $F_0 = 0$, $F_1 = 1$ and for each integer $n \ge 2$, $F_n = F_{n-1} + F_{n-2}$. Consider the sequence $D$ of the last decimal digits of the first $N$ Fibonacci numbers, i.e. $D = (F_0 \% 10, F_1 \% 10, \ldots, F_{N-1} \% 10)$. Now, you should perform the following process: - Let $D = (D_1, D_2, \ldots, D_l)$. - If $l = 1$, the process ends. - Create a new sequence $E = (D_2, D_4, \ldots, D_{2 \lfloor l/2 \rfloor})$. In other words, $E$ is the sequence created by removing all odd-indexed elements from $D$. - Change $D$ to $E$. When this process terminates, the sequence $D$ contains only one number. You have to find this number. -----Input----- - The first line of the input contains a single integer $T$ denoting the number of test cases. The description of $T$ test cases follows. - The first and only line of each test case contains a single integer $N$. -----Output----- For each test case, print a single line containing one integer ― the last remaining number. -----Constraints----- - $1 \le T \le 10^5$ - $1 \le N \le 10^{18}$ -----Subtasks----- Subtask #1 (20 points): - $1 \le T \le 10^5$ - $1 \le N \le 10^7$ Subtask #2 (80 points): original constraints -----Example Input----- 1 9 -----Example Output----- 3 -----Explanation----- Example case 1: The first $N$ Fibonacci numbers are $(0, 1, 1, 2, 3, 5, 8, 13, 21)$. The sequence $D$ is $(0, 1, 1, 2, 3, 5, 8, 3, 1) \rightarrow (1, 2, 5, 3) \rightarrow (2, 3) \rightarrow (3)$.	["import math\n\nt = int(input())\n\na = [-1, 0, 1]\n\nfor i in range(58):\n temp = a[-1] + a[-2]\n temp = temp%10\n a.append(temp)\n \nfor _ in range(t):\n n = int(input())\n \n temp = len(bin(n)) - 3\n temp = 2temp\n temp = temp%60\n \n print(a[temp])", "import math\n\ndef logBase2(n):\n res = 0\n fact = 1\n while((fact << (res+1)) <= n):\n res+=1\n return res\n\nt = int(input())\n\na = [-1, 0, 1]\n\nfor i in range(58):\n temp = a[-1] + a[-2]\n temp = temp%10\n a.append(temp)\nfor _ in range(t):\n n = int(input())\n \n n = 1<<int(math.log2(n))\n \n print(a[n%60]) \n", "import math\n\ndef logBase2(n):\n res = 0\n fact = 1\n while((fact << (res+1)) <= n):\n res+=1\n return res\n\nt = int(input())\n\na = [-1, 0, 1]\n\nfor i in range(58):\n temp = a[-1] + a[-2]\n temp = temp%10\n a.append(temp)\nfor _ in range(t):\n n = int(input())\n \n n = 1<<logBase2(n)\n \n print(a[n%60]) \n", "import math\n\nt = int(input())\n\na = [-1, 0, 1]\n\nfor i in range(58):\n temp = a[-1] + a[-2]\n temp = temp%10\n a.append(temp)\n\nfor _ in range(t):\n n = int(input())\n \n n = math.floor(math.log(n, 2))\n n = (2n)%60\n print(a[n])\n", "import math\n\nt = int(input())\n\na = [-1, 0, 1]\n\nfor i in range(61):\n temp = a[-1] + a[-2]\n temp = temp%10\n a.append(temp)\n \nfor _ in range(t):\n n = int(input())\n \n n = int(math.log(n, 2))\n \n n = (2*n)%60\n print(a[n])\n", "import math\ndef fib(n):\n if n<2:\n return n\n dp = [0](n+1)\n dp[1] = 1\n for i in range(2, n+1):\n dp[i] = (dp[i-1] + dp[i-2]) % 10;\n # print(n, dp) \n return dp[n]\n \nt=int(input())\n\nfor _ in range(t):\n n = int(input())\n exp = int(math.floor(math.log(n, 2)))\n arg = (2exp -1) % 60\n \n print( fib(arg) )", "import math\ndef r(n):\n cycle = 60\n index = (1 << len(bin(n))-3) % cycle\n cur = 0\n next = 1 \n for i in range(1, index):\n nextNext = (cur + next) % 10\n cur = next\n next = nextNext\n return cur\n\n\nt = int(input())\nfor i in range(t):\n c = int(input())\n print(r(c))", "import math\ndef r(n):\n cycle = 60\n index = (1 << int(math.floor(math.log2(n)))) % cycle\n cur = 0\n next = 1 \n for i in range(1, index):\n nextNext = (cur + next) % 10\n cur = next\n next = nextNext\n return cur\n\n\nt = int(input())\nfor i in range(t):\n c = int(input())\n print(r(c))", "import math\n\nt = int(input())\n\na = [-1, 0, 1]\n\nfor i in range(58):\n temp = a[-1] + a[-2]\n temp = temp%10\n a.append(temp)\n \nfor _ in range(t):\n n = int(input())\n \n n = int(math.log(n, 2))\n \n n = (2n)%60\n print(a[n])", "def fib(n):\n index = -1\n while n > 0:\n index += 1\n n = n // 2\n return index\n\n\nfirst60Sequence = [ 0, 1, 1, 2, 3, 5, 8, 3, 1, 4, 5, 9, 4, 3, 7,\n 0, 7, 7, 4, 1, 5, 6, 1, 7, 8, 5, 3, 8, 1, 9,\n 0, 9, 9, 8, 7, 5, 2, 7, 9, 6, 5, 1, 6, 7, 3,\n 0, 3, 3, 6, 9, 5, 4, 9, 3, 2, 5, 7, 2, 9, 1]\n\ntest = int(input())\nfor i in range(test):\n number = int(input())\n respectiveIndex = (2 fib(number)) % 60\n print(first60Sequence[respectiveIndex - 1])", "# cook your dish here\ndef f(n):\n i=-1\n \n while n>0:\n i+=1\n n=n//2\n \n return i\n\nfo= [ 0, 1, 1, 2, 3, 5, 8, 3, 1, 4, 5, 9, 4, 3, 7,\n 0, 7, 7, 4, 1, 5, 6, 1, 7, 8, 5, 3, 8, 1, 9,\n 0, 9, 9, 8, 7, 5, 2, 7, 9, 6, 5, 1, 6, 7, 3,\n 0, 3, 3, 6, 9, 5, 4, 9, 3, 2, 5, 7, 2, 9, 1]\n\nl = int(input())\n\nfor _ in range(l):\n n = int(input())\n d = (2f(n))%60\n print(fo[d-1])\n", "# cook your dish here\ndef f(n):\n i=-1\n \n while n>0:\n i+=1\n n=n//2\n \n return i\n\nfo= [ 0, 1, 1, 2, 3, 5, 8, 3, 1, 4, 5, 9, 4, 3, 7,\n 0, 7, 7, 4, 1, 5, 6, 1, 7, 8, 5, 3, 8, 1, 9,\n 0, 9, 9, 8, 7, 5, 2, 7, 9, 6, 5, 1, 6, 7, 3,\n 0, 3, 3, 6, 9, 5, 4, 9, 3, 2, 5, 7, 2, 9, 1]\n\nl = int(input())\n\nfor _ in range(l):\n n = int(input())\n d = (2f(n))%60\n print(fo[d-1])\n", "# cook your dish here\n# cook your dish here\n\ndef fib(n):\n i=-1\n \n while n>0:\n i+=1\n n=n//2\n \n return i\n\nfl = [ 0, 1, 1, 2, 3, 5, 8, 3, 1, 4, 5, 9, 4, 3, 7,\n 0, 7, 7, 4, 1, 5, 6, 1, 7, 8, 5, 3, 8, 1, 9,\n 0, 9, 9, 8, 7, 5, 2, 7, 9, 6, 5, 1, 6, 7, 3,\n 0, 3, 3, 6, 9, 5, 4, 9, 3, 2, 5, 7, 2, 9, 1]\n\nt = int(input())\n\nfor _ in range(t):\n n = int(input())\n d = (2fib(n))%60\n print(fl[d-1])\n #print(d)\n", "# cook your dish here\n\ndef fib(n):\n i=-1\n \n while n>0:\n i+=1\n n=n//2\n \n return i\n\nfl = [ 0, 1, 1, 2, 3, 5, 8, 3, 1, 4, 5, 9, 4, 3, 7,\n 0, 7, 7, 4, 1, 5, 6, 1, 7, 8, 5, 3, 8, 1, 9,\n 0, 9, 9, 8, 7, 5, 2, 7, 9, 6, 5, 1, 6, 7, 3,\n 0, 3, 3, 6, 9, 5, 4, 9, 3, 2, 5, 7, 2, 9, 1]\n\nt = int(input())\n\nfor _ in range(t):\n n = int(input())\n d = (2fib(n))%60\n print(fl[d-1])\n #print(d)\n", "# cook your dish here\nfl = [ 0, 1, 1, 2, 3, 5, 8, 3, 1, 4, 5, 9, 4, 3, 7,\n 0, 7, 7, 4, 1, 5, 6, 1, 7, 8, 5, 3, 8, 1, 9,\n 0, 9, 9, 8, 7, 5, 2, 7, 9, 6, 5, 1, 6, 7, 3,\n 0, 3, 3, 6, 9, 5, 4, 9, 3, 2, 5, 7, 2, 9, 1]\n\ndef log2(num) :\n i = -1\n while num>0 :\n i+=1\n num//=2\n return i\n\ncycle = 60\nfor _ in range(int(input())) :\n n = int(input())\n target = (2(log2(n)))%60\n print(fl[target-1])", "# cook your dish here\nfl = [ 0, 1, 1, 2, 3, 5, 8, 3, 1, 4, 5, 9, 4, 3, 7,\n 0, 7, 7, 4, 1, 5, 6, 1, 7, 8, 5, 3, 8, 1, 9,\n 0, 9, 9, 8, 7, 5, 2, 7, 9, 6, 5, 1, 6, 7, 3,\n 0, 3, 3, 6, 9, 5, 4, 9, 3, 2, 5, 7, 2, 9, 1]\n\ndef log2(num) :\n i = -1\n while num>0 :\n i+=1\n num//=2\n return i\n\ncycle = 60\nfor _ in range(int(input())) :\n n = int(input())\n target = (2(log2(n)))%60\n print(fl[target-1])", "# cook your dish here\nfl = [ 0, 1, 1, 2, 3, 5, 8, 3, 1, 4, 5, 9, 4, 3, 7,\n 0, 7, 7, 4, 1, 5, 6, 1, 7, 8, 5, 3, 8, 1, 9,\n 0, 9, 9, 8, 7, 5, 2, 7, 9, 6, 5, 1, 6, 7, 3,\n 0, 3, 3, 6, 9, 5, 4, 9, 3, 2, 5, 7, 2, 9, 1]\n\ndef log2(num) :\n i = -1\n while num>0 :\n i+=1\n num//=2\n return i\n\ncycle = 60\nfor _ in range(int(input())) :\n n = int(input())\n target = (2(log2(n)))%60\n print(fl[target-1])", "# cook your dish here\nfl = [ 0, 1, 1, 2, 3, 5, 8, 3, 1, 4, 5, 9, 4, 3, 7,\n 0, 7, 7, 4, 1, 5, 6, 1, 7, 8, 5, 3, 8, 1, 9,\n 0, 9, 9, 8, 7, 5, 2, 7, 9, 6, 5, 1, 6, 7, 3,\n 0, 3, 3, 6, 9, 5, 4, 9, 3, 2, 5, 7, 2, 9, 1]\n\ndef log2(num) :\n i = -1\n while num>0 :\n i+=1\n num//=2\n return i\n\ncycle = 60\nfor _ in range(int(input())) :\n n = int(input())\n target = (2(log2(n)))%60\n print(fl[target-1])", "# cook your dish here\nfl = [ 0, 1, 1, 2, 3, 5, 8, 3, 1, 4, 5, 9, 4, 3, 7,\n 0, 7, 7, 4, 1, 5, 6, 1, 7, 8, 5, 3, 8, 1, 9,\n 0, 9, 9, 8, 7, 5, 2, 7, 9, 6, 5, 1, 6, 7, 3,\n 0, 3, 3, 6, 9, 5, 4, 9, 3, 2, 5, 7, 2, 9, 1]\n\ndef log2(num) :\n i = -1\n while num>0 :\n i+=1\n num//=2\n return i\n\ncycle = 60\nfor _ in range(int(input())) :\n n = int(input())\n target = (2(log2(n)))%60\n print(fl[target-1])", "# cook your dish here\nfl = [ 0, 1, 1, 2, 3, 5, 8, 3, 1, 4, 5, 9, 4, 3, 7,\n 0, 7, 7, 4, 1, 5, 6, 1, 7, 8, 5, 3, 8, 1, 9,\n 0, 9, 9, 8, 7, 5, 2, 7, 9, 6, 5, 1, 6, 7, 3,\n 0, 3, 3, 6, 9, 5, 4, 9, 3, 2, 5, 7, 2, 9, 1]\n\ndef log2(num) :\n i = -1\n while num>0 :\n i+=1\n num//=2\n return i\n\ncycle = 60\nfor _ in range(int(input())) :\n n = int(input())\n target = (2(log2(n)))%60\n print(fl[target-1])", "# cook your dish here\nfl = [ 0, 1, 1, 2, 3, 5, 8, 3, 1, 4, 5, 9, 4, 3, 7,\n 0, 7, 7, 4, 1, 5, 6, 1, 7, 8, 5, 3, 8, 1, 9,\n 0, 9, 9, 8, 7, 5, 2, 7, 9, 6, 5, 1, 6, 7, 3,\n 0, 3, 3, 6, 9, 5, 4, 9, 3, 2, 5, 7, 2, 9, 1]\n\ndef log2(num) :\n i = -1\n while num>0 :\n i+=1\n num//=2\n return i\n\ncycle = 60\nfor _ in range(int(input())) :\n n = int(input())\n target = (2(log2(n)))%60\n print(fl[target-1])", "# cook your dish here\nfl = [ 0, 1, 1, 2, 3, 5, 8, 3, 1, 4, 5, 9, 4, 3, 7,\n 0, 7, 7, 4, 1, 5, 6, 1, 7, 8, 5, 3, 8, 1, 9,\n 0, 9, 9, 8, 7, 5, 2, 7, 9, 6, 5, 1, 6, 7, 3,\n 0, 3, 3, 6, 9, 5, 4, 9, 3, 2, 5, 7, 2, 9, 1]\n\ndef log2(num) :\n i = -1\n while num>0 :\n i+=1\n num//=2\n return i\n\ncycle = 60\nfor _ in range(int(input())) :\n n = int(input())\n target = (2(log2(n)))%60\n print(fl[target-1])", "# cook your dish here\n\ndef fib(n):\n i=-1\n \n while n>0:\n i+=1\n n=n//2\n \n return i\n\nfl = [ 0, 1, 1, 2, 3, 5, 8, 3, 1, 4, 5, 9, 4, 3, 7,\n 0, 7, 7, 4, 1, 5, 6, 1, 7, 8, 5, 3, 8, 1, 9,\n 0, 9, 9, 8, 7, 5, 2, 7, 9, 6, 5, 1, 6, 7, 3,\n 0, 3, 3, 6, 9, 5, 4, 9, 3, 2, 5, 7, 2, 9, 1]\n\nt = int(input())\n\nfor _ in range(t):\n n = int(input())\n d = (2fib(n))%60\n print(fl[d-1])\n #print(d)\n"]	{"inputs": [["1", "9"]], "outputs": [["3"]]}	INTERVIEW	PYTHON3	CODECHEF	8,291
a806d32dcd45e159492f3e8aa2aa1a1b	UNKNOWN	The bustling town of Siruseri has just one sports stadium. There are a number of schools, colleges, sports associations, etc. that use this stadium as the venue for their sports events. Anyone interested in using the stadium has to apply to the Manager of the stadium indicating both the starting date (a positive integer $S$) and the length of the sporting event in days (a positive integer $D$) they plan to organise. Since these requests could overlap it may not be possible to satisfy everyone. Also, there should be at least one gap day between any two approved events, so that the stadium can be cleaned. It is the job of the Manager to decide who gets to use the stadium and who does not. The Manager, being a genial man, would like to keep as many organisations happy as possible and hence would like to allocate the stadium so that maximum number of events are held. Suppose, for example, the Manager receives the following 4 requests: $ $ Event No. Starting Date Length 1 2 5 2 9 7 3 15 6 4 9 3 $ $ He would allot the stadium to events $1$, $4$ and $3$. Event $1$ begins on day $2$ and ends on day $6$, event $4$ begins on day $9$ and ends on day $11$ and event $3$ begins on day $15$ and ends on day $20$. You can verify that it is not possible to schedule all the $4$ events (since events $2$ and $3$ overlap and only one of them can get to use the stadium). Your task is to help the manager find the best possible allotment (i.e., the maximum number of events that can use the stadium). -----Input:----- The first line of the input will contain a single integer $N$ indicating the number of events for which the Manager has received a request. Lines $2,3,...,N+1$ describe the requirements of the $N$ events. Line $i+1$ contains two integer $S_i$ and $D_i$ indicating the starting date and the duration of event $i$. -----Output:----- Your output must consist of a single line containing a single integer $M$, indicating the maximum possible number of events that can use the stadium. -----Constraints:----- - $1 \leq N \leq 100000$. - $1 \leq S_i \leq 1000000$. - $1 \leq D_i \leq 1000$. - $50 \%$ of test cases will also satisfy $1 \leq N \leq 10000$. -----Sample input:----- 4 2 5 9 7 15 6 9 3 -----Sample output:----- 3	["# cook your dish here\nn=(int(input()))\nx=[]\nfor _ in range(n):\n a,b=map(int,input().split())\n a=[a,a+b]\n x.append(a)\nx = sorted(x, key= lambda i:i[1])\ny=-1\nc=0\nfor i in range(len(x)):\n if x[i][0]>y:\n c+=1\n y=x[i][1]\nprint(c)", "# cook your dish here\nn=(int(input()))\nx=[]\nfor _ in range(n):\n a,b=map(int,input().split())\n a=[a,a+b]\n x.append(a)\nx.sort()\ny=-1\nc=0\nfor i in range(len(x)):\n if x[i][0]>y:\n c+=1\n y=x[i][1]\nprint(c)", "arr=[]\r\nfor _ in range(int(input())) :\r\n start,end=[int(x) for x in input().split()]\r\n arr.append((start,start+end))\r\narr.sort()\r\nval=[]\r\nfor j in range (len(arr)-1) :\r\n check=arr[j][1]\r\n ans=1\r\n if len(val) >0 and len(arr)-j > max(val) :\r\n break\r\n for i in range(1,len(arr)) :\r\n if arr[i][0] > check :\r\n ans+=1\r\n check = arr[i][1]\r\n val.append(ans)\r\nprint(max(val))", "arr=[]\r\nfor _ in range(int(input())) :\r\n start,end=[int(x) for x in input().split()]\r\n arr.append((start,start+end))\r\narr.sort()\r\nans=1\r\ncheck=arr[0][1]\r\nfor i in range(1,len(arr)) :\r\n if arr[i][0] > check :\r\n ans+=1\r\n check = arr[i][1]\r\nprint(ans)\r\n"]	{"inputs": [["4", "2 5", "9 7", "15 6", "9 3", "Sample output:", "3"]], "outputs": [[]]}	INTERVIEW	PYTHON3	CODECHEF	1,271
2a330741cbcf50a6fa4d57b4b357f486	UNKNOWN	Chef Loves to listen to remix songs, but currently he had already finished the entire playlist of remix songs. As Chef is smart, so he thought let's make my own remix songs of the original songs. Chef is not having much knowledge of making remix songs, so he came up with the simple technique in which he will pick the word which contains the smallest number of characters from the lyrics of the song, and then he will append that word to the start and end of the lyrics, also Chef will insert this word between every two words of the lyrics. Note: While inserting a new word Chef will also insert extra white-spaces, so that every word in the final remixed lyrics is separated by space. It is Recommended to use fast Input/Ouput techniques. -----Input:----- - The input contains the text $S$, which denotes the lyrics of the song. -----Output:----- - Print the Remixed, lyrics as done by Chef. -----Constraints:----- - $1 \leq Length of text $S$ \leq 10^7$ -----Sample Input:----- Mai Hu Jiyaan -----Sample Output:----- Hu Mai Hu Hu Hu Jiyaan Hu	["m= 9999999\r\nword=''\r\np= ''\r\ntry:\r\n s=input().split()\r\n for i in s:\r\n if(len(i) <= m):\r\n m = len(i)\r\n word = i\r\n p = word\r\n for i in s:\r\n p+= (' '+i+' '+ word)\r\n \r\n print(p)\r\n\r\n \r\nexcept EOFError:\r\n\r\n pass", "s=input()\ns=s.split(\" \")\n\n# print(s)\na=[]\ns1=[]\nfor _ in range(len(s)):\n if s[_]!='':\n s1.append(s[_]) \nfor _ in range(len(s1)):\n a.append(len(s1[_]))\n# print(a) \naa=a.index(min(a))\nss=s1[aa]\nprint(ss,end=\" \")\nfor _ in range(len(s1)):\n print(s1[_],ss,end=\" \")\n # print(ss,end=\" \") ", "from math import inf\nfrom sys import stdin\ninput=stdin.readline\na=input().split()\nmi=inf\nind=0\nn=len(a)\nfor i in range(n):\n if mi>len(a[i]):\n mi=len(a[i])\n ind=i\nfor i in range(n):\n print(a[ind],a[i],end=\" \")\nprint(a[ind])", "# cook your dish here\ns=list(input().split())\na=min(s,key=len)\nfor i in s:\n print(a,i,end=\" \")\nprint(a)\n", "l=input().split()\nmins=l[0]\nfor s in l:\n if len(s)<len(mins):\n mins=s\nans=mins\nfor s in l:\n ans+=\" \"+s+\" \"+mins\nprint(ans)", "def f(inp): \n length = len(inp) \n si = ei = 0\n min_length = length \n min_start_index = max_length = max_start_index = 0\n \n # loop to find the length and stating index \n # of both longest and shortest words \n while ei <= length: \n if (ei < length) and (inp[ei] != \" \"): \n ei += 1\n else: \n curr_length = ei - si \n \n # condition checking for the shortest word \n if curr_length < min_length: \n min_length = curr_length \n min_start_index = si \n \n # condition for the longest word \n if curr_length > max_length: \n max_length = curr_length \n max_start_index = si \n ei += 1\n si = ei \n \n # extracting the shortest word using \n # it's starting index and length \n minWord = inp[min_start_index : \n min_start_index + min_length] \n \n # extracting the longest word using \n # it's starting index and length \n maxWord = inp[max_start_index : max_length] \n \n # printing the final result \n return minWord\n #print(\"Minimum length word: \", minWord) \n #print(\"Maximum length word: \", maxWord) \n\ns=input().strip()\nw=f(s)\ns=list(s.split())\nprint(w,end=' ')\nfor i in s:\n print(i,end=' ')\n print(w,end=' ')", "lyrics = list(map(str, input().rstrip().split(\" \")))\r\nmini1 = lyrics[0]\r\nfor i in lyrics:\r\n if len(i) < len(mini1):\r\n mini1 = i\r\nt = 0\r\nremix = []\r\nwhile True:\r\n try:\r\n remix.append(mini1)\r\n remix.append(lyrics[t])\r\n t+=1\r\n except IndexError:\r\n break\r\nprint(\" \".join(remix), end=\"\")", "s=input().split()\r\nk = min(s,key=len)\r\nn= len(s)\r\nprint(k,end=\" \")\r\nfor i in range(n):\r\n print(s[i],k,end=\" \")", "l=list(map(str,input().split()))\r\nma=float(\"inf\")\r\nfor i in l:\r\n if(len(i)<ma):\r\n ma=len(i)\r\n v=i\r\nn=len(l)\r\nk=[]\r\nfor i in range(n):\r\n k.append(l[i])\r\n if(i!=n-1):\r\n k.append(v)\r\nk.append(v)\r\nk.insert(0,v)\r\nst=\" \".join(k)\r\nprint(st)\r\n", "S = input().split()\nN=len(S)\nsml=len(S[0])\nval=S[0]\nfor i in S:\n if len(i)<sml:\n sml=len(i)\n val=i\nprint(val,end=' ')\ni=0\nwhile i<N:\n print(S[i],val,end=' ')\n i+=1", "# cook your dish here\ns = input().strip()\n\ns_arr = s.split()\n\nres = \"z\" * 100000000\nfor ele in s_arr:\n if len(res) > len(ele):\n res = ele\n elif len(res) == len(ele):\n res = min(res, ele)\n \nprint(res, end = \" \")\nfor ele in s_arr:\n print(ele, end = \" \")\n print(res, end = \" \")", "str=input()\nss=str.split()\nxcr=None\nxcxc=None\nfor wd in ss:\n if xcxc is None:\n xcr= len(wd)\n xcxc=wd\n else:\n if(len(wd)<xcr):\n xcr=len(wd)\n xcxc=wd\n \nprint(xcxc,end=' ')\nfor wd in ss:\n print(wd,xcxc,end=' ')", "s=list(input().split())\nmin=999999999\nr=\"\"\nfor i in range(len(s)):\n if(len(s[i])<min):\n min=len(s[i])\n r=s[i]\nprint(r,end=' ')\nfor i in s:\n print(i + \" \" + r,end=' ')\n#print(r,min)", "import math\ndef solve(s):\n li=s.split()\n n=len(li)\n l=len(li[0])\n m=\"\"\n for i in range(1,n):\n if l>=len(li[i]):\n l=len(li[i])\n m=li[i]\n \n res=\"\"\n res+=m\n for i in li:\n res+=\" \"\n res+=i\n res+=\" \"\n res+=m\n print(res)\n\n\ndef __starting_point():\n try:\n s=input().strip()\n solve(s)\n except:\n pass\n__starting_point()", "s = input()\r\nl = s.split()\r\na = 1000000000000000000\r\nsmallest = 'z'100000000\r\nfor i in range(0, len(l)):\r\n if len(l[i])<a:\r\n smallest = l[i]\r\n a = len(l[i])\r\nll = []\r\nfor i in range(len(l)):\r\n print(smallest, end=' ')\r\n print(l[i], end=' ')\r\nprint(smallest, end='')", "# cook your dish here\na=list(map(str, input().split()))\nb=[]\nfor j in a:\n b.append(len(j))\nx=b.index(min(b))\ny=a[x]\ni=0\nwhile(i<len(a)):\n print(y,end=' ')\n print(a[i],end=' ')\n i+=1\nprint(y)\n", "lst=input().split()\r\nm=min(lst, key=len)\r\nfor i in range(len(lst)):\r\n print(m,lst[i],end=\" \")\r\nprint(m)", "l=list(map(str,input().split()))\r\nma=float(\"inf\")\r\nfor i in l:\r\n if(len(i)<ma):\r\n ma=len(i)\r\n v=i\r\nn=len(l)\r\nk=[]\r\nfor i in range(n):\r\n k.append(l[i])\r\n if(i!=n-1):\r\n k.append(v)\r\nk.append(v)\r\nk.insert(0,v)\r\nst=\" \".join(k)\r\nprint(st)\r\n", "x=[str(x)for x in input ().split()]\ny=x[:]\nx.sort(key=len)\nele=x[0]\nleng=len(x)\nfor i in range(0,leng):\n print(ele+\" \"+y[i],end=\" \")\nprint(ele)\n\n", "S=list(input().split())\r\nmin=S[0]\r\nml=len(S[0])\r\nans=[]\r\nfor i in S:\r\n if len(i)<ml:\r\n ml=len(i)\r\n min=i\r\nfor j in range(len(S)):\r\n print(min,end=\" \")\r\n print(S[j],end=\" \")\r\nprint(min)", "try:\r\n str1=list(map(str,input().rstrip().split()))\r\n z=[]\r\n m=[]\r\n for i in range(len(str1)):\r\n a=len(str1[i])\r\n m.append(a)\r\n k=min(m)\r\n l=m.index(k)\r\n for i in range(len(str1)):\r\n z.append(str1[i])\r\n z.append(str1[l])\r\n z.insert(0,str1[l])\r\n print(z)\r\nexcept:pass\r\n", "try:\r\n a=input().split()\r\n l=[*[len(i) for i in a]]\r\n b=a[l.index(min(l))]\r\n print(b+\" \" +\" {} \".format(b).join(a)+ \" \" +b)\r\nexcept: pass\r\n", "s = list(map(str,input().split()))\r\nres = min(s,key = len)\r\nfor i in range(len(s)):\r\n print(res,s[i],end=' ')\r\nprint(res)"]	{"inputs": [["Mai Hu Jiyaan"]], "outputs": [["Hu Mai Hu Hu Hu Jiyaan Hu"]]}	INTERVIEW	PYTHON3	CODECHEF	6,989
aa809cabe3ad0e94e59046e553e31359	UNKNOWN	----- Statement ----- You need to find a string which has exactly K positions in it such that the character at that position comes alphabetically later than the character immediately after it. If there are many such strings, print the one which has the shortest length. If there is still a tie, print the string which comes the lexicographically earliest (would occur earlier in a dictionary). -----Input----- The first line contains the number of test cases T. Each test case contains an integer K (≤ 100). -----Output----- Output T lines, one for each test case, containing the required string. Use only lower-case letters a-z. -----Sample Input ----- 2 1 2 -----Sample Output----- ba cba	["for i in range(int(input())):\n N = int(input())\n s = 'zyxwvutsrqponmlkjihgfedcba'\n r = ''\n while True:\n r = s[-N-1:] + r \n if N < 26:\n break\n N -= 25\n print(r)", "s='abcdefghijklmnopqrstuvwxyz'\nfor u in range(int(input())):\n n=int(input())\n r=''\n while(1):\n r=s[n::-1]+r\n if(n<26):\n break\n n=n-25\n print(r)", "s='abcdefghijklmnopqrstuvwxyz'\nfor u in range(int(input())):\n n=int(input())\n r=''\n while(1):\n r=s[n::-1]+r\n if(n<26):\n break\n n-=25\n print(r)", "t = int(input())\n\nwhile t:\n k = int(input())\n \n r = k % 25\n k -= r\n q = k // 25\n \n if r != 0:\n for i in range(r+97,96,-1):\n print(chr(i), end = \"\")\n \n while q:\n for i in range(122,96,-1):\n print(chr(i), end = \"\")\n q -= 1\n \n print(end = \"\\n\")\n \n t -= 1", "l=\"abcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxy\u00a0\u00a0\u00a0\u00a0zabcdefghijklmnopqrstuvwxyz\"\nfor _ in range(int(input())):\n n=int(input())\n #print(len(l))\n x=n//25\n if(n%25==0):\n x=x-1\n x=n+1+x\n s=l[:x]\n print(s[::-1]) \n", "def printrev(start):\n for s in range(start , ord('a')-1, -1) :\n print(chr(s), end='')\n\ntestcase = int(input())\nwhile testcase:\n \n k = int(input())\n \n \n rem = k % 25\n quo = k // 25 \n if rem != 0 :\n printrev(97 + rem)\n \n for _ in range(quo) :\n printrev(ord('z'))\n \n print()\n \n \n \n testcase -= 1\n \n \n \n \n \n \n \n \n \n ", "def printrev(start):\n for s in range(start , ord('a')-1, -1) :\n print(chr(s), end='')\n\ntestcase = int(input())\nwhile testcase:\n \n k = int(input())\n \n if k > 25 :\n rem = k % 25\n quo = k // 25 \n if rem != 0 :\n printrev(97 + rem)\n \n for _ in range(quo) :\n printrev(ord('z'))\n \n print()\n \n else:\n printrev(97 + k)\n print()\n \n testcase -= 1\n \n \n \n \n \n \n \n \n \n ", "# cook your dish here\ns=\"abcdefghijklmnopqrstuvwxyz\"\nfor _ in range(0,int(input())):\n n=int(input())\n a=''\n while True:\n a=s[n::-1]+a\n if n<26: \n break\n n=n-25\n print(a)", "for t in range(int(input())):\n n=int(input())\n s, ans = \"abcdefghijklmnopqrstuvwxyz\", \"\"\n while True:\n ans=s[n::-1] + ans\n if n<26:\n break\n else:\n n-=25\n print(ans)", "# cook your dish here\nfor _ in range(int(input())):\n n=int(input())\n s, ans=\"abcdefghijklmnopqrstuvwxyz\", \"\"\n while True:\n ans = s[n::-1] + ans\n if n<26:\n break\n else:\n n -= 25\n print(ans)", "for _ in range(int(input())):\n n=int(input())\n s, ans=\"abcdefghijklmnopqrstuvwxyz\", \"\"\n while True:\n ans = s[n::-1] + ans\n if n<26:\n break\n else:\n n -= 25\n print(ans)", "# cook your dish here\nt=int(input())\nfor _ in range(t):\n n=int(input())\n res='abcdefghijklmnopqrstuvwxyz'\n ans=''\n \n while True:\n \n ans = res[n::-1] + ans\n \n if n<26:\n break\n \n else:\n n-=25\n \n print(ans)", "for _ in range(int(input())):\n k=int(input())\n ar=[]\n for i in range(97,123,1):\n ar.append(chr(i))\n st=\"\".join(ar)\n an=\"\"\n while 1:\n an=st[k::-1]+an\n if k<26:\n break\n k-=25\n \n \n print(an)\n", "t = int(input())\ns = 'abcdefghijklmnopqrstuvwxyz'\nl = []\nfor i in range(t):\n n = int(input())\n a=n//25\n b=n%25\n if(n%25==0):\n p = s[::-1](a)\n else:\n p = s[:1+b][::-1] + s[::-1](a)\n l.append(p)\nfor i in l:\n print(i)\n", "T = int(input())\nans = []\n\n# S = 'zyxwvutsrqponmlkjihgfedcba'\nS = 'abcdefghijklmnopqrstuvwxyz'\n\nfor _ in range(T):\n K = int(input())\n\n if(K%25==0):\n a = S[::-1](K//25)\n else:\n a = S[:1+K%25][::-1] + S[::-1](K//25)\n ans.append(a)\n\nfor i in ans:\n print(i)", "s='abcdefghijklmnopqrstuvwxyz'\nt=int(input())\nfor i in range(t):\n s1=''\n n=int(input())\n while(1):\n s1=s[n::-1]+s1\n if(n<26):\n break\n n=n-25\n print(s1)", "s='abcdefghijklmnopqrstuvwxyz'\nt=int(input())\nfor i in range(t):\n s1=''\n n=int(input())\n while(1):\n s1=s[n::-1]+s1\n if(n<26):\n break\n n=n-25\n print(s1)", "az='abcdefghijklmnopqrstuvwxyz'\nfor _ in range(int(input())):\n s=''\n a=int(input())\n while 1:\n s=az[a::-1]+s\n if a<26:\n break \n a=a-25 \n print(s)\n", "x='abcdefghijklmnopqrstuvwxyz'\nfor _ in range(int(input())):\n s=''\n a=int(input())\n while 1:\n s=x[a::-1]+s\n if a<26:\n break \n a=a-25 \n print(s)\n \n", "# cook your dish here\nx='abcdefghijklmnopqrstuvwxyz'\nfor _ in range(int(input())):\n s=''\n a=int(input())\n while 1:\n s=x[a::-1]+s\n if a<26:\n break \n a=a-25 \n print(s)", "# cook your dish here\nx='abcdefghijklmnopqrstuvwxyz'\nfor _ in range(int(input())):\n s=''\n a=int(input())\n while 1:\n s=x[a::-1]+s\n if a<26:\n break \n a=a-25 \n print(s)\n \n \n", "x = 'abcdefghijklmnopqrstuvwxyz'\nfor i in range(int(input())):\n num = int(input())\n r = ''\n while 1:\n r = x[num::-1]+r\n if num<26:\n break\n num-=25\n print(r)\n", "s='abcdefghijklmnopqrstuvwxyz'\nfor u in range(int(input())):\n n=int(input())\n r=''\n while(1):\n r=s[n::-1]+r\n if(n<26):\n break\n n-=25\n print(r)", "s='abcdefghijklmnopqrstuvwxyz'\nfor u in range(int(input())):\n n=int(input())\n r=''\n while(1):\n r=s[n::-1]+r\n if(n<26):\n break\n n-=25\n print(r)\n"]	{"inputs": [["2", "1", "2"]], "outputs": [["ba", "cba"]]}	INTERVIEW	PYTHON3	CODECHEF	5,132
08e7a923bf9b2b12686e47484de04b2b	UNKNOWN	You are given a grid with $R$ rows (numbered $1$ through $R$) and $C$ columns (numbered $1$ through $C$). A cell in row $r$ and column $c$ is denoted by $(r, c)$. Two cells in the grid are adjacent if they have a common side. For each valid $i$ and $j$, there is a value $a_{i, j}$ written in cell $a_{i, j}$. A cell in the grid is stable if the number of cells in the grid which are adjacent to this cell is strictly greater than the value written in this cell. The whole grid is stable if all cells in the grid are stable. Can you determine whether the grid is stable? -----Input----- - The first line of the input contains a single integer $T$ denoting the number of test cases. The description of $T$ test cases follows. - The first line of each test case contains two space-separated integers $R$ and $C$. - $R$ lines follow. For each $i$ ($1 \le i \le R$), the $i$-th of these lines contains $C$ space-separated integers $a_{i, 1}, a_{i, 2}, \ldots, a_{i, C}$. -----Output----- For each test case, print a single line containing the string "Stable" if the grid is stable or "Unstable" if it is unstable (without quotes). -----Constraints----- - $1 \le T \le 3,000$ - $3 \le R, C \le 10$ - $0 \le a_{i, j} \le 4$ for each valid $i, j$ -----Example Input----- 2 3 3 1 2 1 2 3 2 1 2 1 3 4 0 0 0 0 0 0 0 0 0 0 4 0 -----Example Output----- Stable Unstable -----Explanation----- Example case 1: Each cell of the grid is stable, so the grid is stable. Example case 2: The cell in row $3$ and column $3$ is unstable since the number of cells adjacent to this cell is $3$.	["for _ in range(int(input())):\n r,c = map(int,input().split())\n l = []\n for k in range(r):\n a = list(map(int,input().split()))\n l.append(a)\n ans = \"Stable\" \n for i in range(r):\n for j in range(c):\n p = l[i][j]\n count=0\n if i-1>=0 and j>=0:\n count+=1 \n if i>=0 and j-1>=0:\n count+=1 \n if i+1<=r-1 and j<=c-1:\n count+=1 \n if i<=r-1 and j+1<=c-1:\n count +=1\n if count<=p:\n ans = \"Unstable\"\n break\n print(ans) ", "# cook your dish here\ndef checkStability(inp_arr,R,C,i,j):\n cell_cnt=0\n for coordinates in ((i,j-1),(i,j+1),(i-1,j),(i+1,j)):\n r,c=coordinates\n if(r>=0\n and c>=0\n and r<R\n and c<C):\n cell_cnt+=1\n \n if(inp_arr[i][j]>=cell_cnt):\n return False\n return True\n \nfor _ in range(int(input())):\n R,C=(int(i) for i in input().strip(' ').split(' '))\n inp_arr=[]\n stableFlag=True\n printStr='Stable'\n for i in range(R):\n inp_arr.append(tuple(int(i) for i in input().strip(' ').split(' ')))\n for i in range(R):\n if(stableFlag==True):\n for j in range(C):\n stableFlag=checkStability(inp_arr,R,C,i,j)\n if(stableFlag==False):\n printStr='Unstable'\n break\n print(printStr)\n", "def adjacent(i,j,r,c):\n if i==0 or i==r-1:\n if j==0 or j==c-1:\n return 2\n else:\n return 3\n else:\n if j==0 or j==c-1:\n return 3\n else:\n return 4\n \n# cook your dish here\nfor _ in range(int(input())):\n r,c=map(int,input().split(\" \"))\n grid=[]\n flag=0\n for i in range(r):\n grid.append(list(map(int,input().split(\" \"))))\n for i in range(r):\n for j in range(c):\n if adjacent(i,j,r,c)<=grid[i][j]:\n flag=1\n break\n if flag==1:\n break\n if flag==1:\n print(\"Unstable\")\n else:\n print(\"Stable\")", "import numpy as np\nt = int(input())\nfor t in range(0,t):\n q= list(map (int, input().rstrip().split()))\n r=q[0]\n c=q[1]\n sum=0\n a = np.array([[int(x) for x in input().split()] for i in range(r)]) \n if(a[0][0]<2 and a[0][c-1]<2 and a[r-1][0]<2 and a[r-1][c-1]<2):\n sum+=4\n for j in range(1,c-1):\n if(a[0][j]<3 and a[r-1][j]<3):\n sum=sum+2\n \n for i in range(1,r-1):\n if(a[i][0]<3 and a[i][c-1]<3):\n sum=sum+2\n for j in range(1,r-1):\n for i in range(1,c-1):\n if(a[j][i]<4):\n sum=sum+1\n if(sum==r*c):\n print(\"Stable\")\n else:\n print(\"Unstable\")\n \n \n \n", "# cook your dish here\nimport math\nt=int(input())\n#t=1\n#res=[]\nfor i in range(t):\n #n=int(input())\n r,c=list(map(int,input().split()))\n #l=list(map(int,input().split()))\n res=[]\n for j in range(r):\n l=list(map(int,input().split()))\n res.append(l)\n flag=1\n for a in range(r):\n for b in range(c):\n adj=4\n if a==0 or a==r-1:\n adj-=1\n if b==0 or b==c-1:\n adj-=1\n if res[a][b]>=adj:\n flag=0\n break\n if (flag):\n print(\"Stable\")\n else:\n print(\"Unstable\")\n", "def check(r, c, a):\n for i in range(r):\n for j in range(c):\n adj = 4\n if i == 0 or i == r-1:\n adj -= 1\n if j == 0 or j == c-1:\n adj -= 1\n if a[i][j]>=adj:\n return \"Unstable\"\n \n return \"Stable\"\n\nfor _ in range(int(input())):\n d = input().split()\n r = int(d[0])\n c = int(d[1])\n a = []\n for i in range(r):\n a.append(list(map(int, input().split())))\n print(check(r, c, a))", "for _ in range(int(input())):\n N, M = map(int, input().split())\n L = []\n for i in range(N):\n L.append(list(map(int, input().split())))\n flag = True\n for i in range(N):\n for j in range(M):\n k = 0\n if i-1 >= 0:\n k += 1\n if i+1 < N:\n k += 1 \n if j-1 >= 0:\n k += 1 \n if j+1 < M:\n k += 1 \n if k <= L[i][j]:\n flag = False\n break\n if not flag:\n break\n print('Stable' if flag else 'Unstable')", "t = int(input())\n\ndef numOfCordinates(arr, raw_arr, r, c):\n num = 0\n possibleCords = [[r-1, c], [r+1,c], [r, c+1], [r, c-1]]\n \n for cords in possibleCords:\n if cords in raw_arr:\n num+=1\n \n return num\n \n\nfor _ in range(1,t + 1):\n \n (r,c) = map(int, input().split(\" \"))\n \n arr = []\n for i in range(r):\n ri = list(map(int, input().split(\" \")))[:c]\n arr.append(ri)\n \n\n raw_arr = []\n for ri in range(r):\n \n for ci in range(c):\n raw_arr.append([ri,ci])\n \n\n for r in range(len(arr)):\n \n for c in range(len(arr[r])):\n no_cords = numOfCordinates(arr, raw_arr, r, c) \n \n if no_cords == -1:\n arr[r][c] = -1\n \n elif arr[r][c] < no_cords:\n arr[r][c] = 0\n \n else:\n arr[r][c] = -1\n \n \n s = 0\n for ls in arr:\n s += sum(ls)\n \n if s==0:\n print(\"Stable\")\n else:\n print(\"Unstable\")", "# cook your dish here\nfor _ in range(int(input())):\n r, c = map(int, input().split())\n a = []\n for i in range(r):\n a.append(list(map(int, input().split())))\n cont = True\n for i in range(r):\n for j in range(c):\n if ((i == 0 and j == c-1) or (i == r-1 and j == 0)\n or (i == r-1 and j == c-1) or (i == 0 and j == 0)):\n if a[i][j] >1:\n cont = False\n break\n elif i == 0 or i == r-1 or j == 0 or j == c-1:\n if a[i][j] > 2:\n cont = False\n break\n else:\n if a[i][j] >3:\n cont = False\n break\n if cont == False:\n print('Unstable')\n break\n else:\n print('Stable')"]	{"inputs": [["2", "3 3", "1 2 1", "2 3 2", "1 2 1", "3 4", "0 0 0 0", "0 0 0 0", "0 0 4 0"]], "outputs": [["Stable", "Unstable"]]}	INTERVIEW	PYTHON3	CODECHEF	5,204
613f634fa50b1a659f5185accf6f2fa0	UNKNOWN	There is a rectangular grid of cells consisting of n rows and m columns. You will place a robot on one of the grid cells and provide it with a command string s, consisting of characters ‘L’, ‘R’, ‘U’, ‘D’. After being placed, the robot will follow the instructions of the command string, where 'L' corresponds moving to the left, 'R' towards the right, 'U' for moving up, and 'D' means down. You have already selected the command string s, and are wondering if it is possible to place the robot in one of the grid cells initially and have it always stay entirely within the grid upon execution of the command string s. Output “safe” if there is a starting cell for which the robot doesn’t fall off the grid on following command s, otherwise, output "unsafe". -----Input----- The first line of input will contain an integer T, the number of test cases. Each test case will be on two lines. The first line will have two space separated integers n,m. The second line will have the command string s. -----Output----- For each test case, output "safe" (without quotes) or "unsafe" (without quotes) in a new line. -----Constraints----- - 1 ≤ T ≤ 1,000 - 1 ≤ n,m ≤ 10 - 1 ≤ \|s\| ≤ 10 -----Example----- Input: 5 1 1 R 2 3 LLRU 3 2 LLRU 4 3 ULURUDRDLD 3 6 RURUR Output: unsafe safe unsafe safe safe -----Explanation----- For the first case, there is only one grid square, so we must place our robot there. When the robot follows the command, it'll fall off, so it is unsafe. For the second case, we can place the robot on the bottom right grid square. Here is an image denoting the moves that the robot will make.	["# cook your dish here\ntest=int(input())\nfor _ in range(test):\n b=list(map(int,str(input()).split(' ')))\n c=str(input())\n li1=[0]\n li2=[0]\n for i1 in range(len(c)):\n if c[i1]=='R':\n li1.append(li1[len(li1)-1]+1)\n elif c[i1]=='L':\n li1.append(li1[len(li1)-1]-1)\n elif c[i1]=='U':\n li2.append(li2[len(li2)-1]+1)\n else:\n li2.append(li2[len(li2)-1]-1)\n if (max(li1)-min(li1)+1)<=b[1] and (max(li2)-min(li2)+1)<=b[0]:\n print('safe')\n else:\n print('unsafe')", "# cook your dish here\na = int(input())\nfor i in range(a):\n b = list(map(int,str(input()).split(' ')))\n c = str(input())\n li1 = [0]\n li2 = [0]\n for i1 in range(len(c)):\n if c[i1]=='R':\n li1.append(li1[len(li1)-1]+1)\n elif c[i1]=='L':\n li1.append(li1[len(li1)-1]-1)\n elif c[i1]=='U':\n li2.append(li2[len(li2)-1]+1)\n else:\n li2.append(li2[len(li2)-1]-1)\n if (max(li1)-min(li1)+1)<=b[1] and (max(li2)-min(li2)+1)<=b[0]:\n print('safe')\n else:\n print('unsafe')", "for u in range(int(input())):\n n,m=map(int,input().split())\n st=input()\n f=0\n for i in range(n):\n for j in range(m):\n x=i \n y=j\n for k in range(len(st)):\n if st[k]=='L':\n y=y-1\n elif st[k]=='R':\n y=y+1\n elif st[k]=='U':\n x=x-1\n elif st[k]=='D':\n x=x+1\n if x>=0 and x<n and y>=0 and y<m:\n ll=0\n else:\n break\n if x>=0 and x<n and y>=0 and y<m:\n f=1\n if f==1:\n print(\"safe\")\n else:\n print(\"unsafe\")", "for _ in range(int(input())):\n n,m=map(int,input().split())\n s=input()\n t1,t2,t3,t4=0,0,0,0\n # d={'L':0,'R':1,'U':2,'D':3}\n # l=[0,0,0,0]\n xp,xn,yp,yn=0,0,0,0\n c1,c2=0,0\n for i,x in enumerate(s):\n if x=='L':\n c1-=1\n elif x=='R':\n c1+=1\n elif x=='U':\n c2+=1\n else:\n c2-=1\n xp=max(xp,c1) \n xn=min(xn,c1)\n yp=max(yp,c2)\n yn=min(yn,c2) \n if abs(xp-xn+1)<=m and abs(yp-yn+1)<=n:\n print('safe')\n else:\n print('unsafe')", "# cook your dish here\n# cook your dish here\nt=int(input())\nfor i in range(t):\n s=input().split()\n n=int(s[0])\n m=int(s[1])\n st=input()\n f=0\n for i in range(n):\n for j in range(m):\n x=i \n y=j\n for k in range(len(st)):\n if st[k]=='L':\n y=y-1\n elif st[k]=='R':\n y=y+1\n elif st[k]=='U':\n x=x-1\n elif st[k]=='D':\n x=x+1\n if x>=0 and x<n and y>=0 and y<m:\n ll=0\n else:\n break\n if x>=0 and x<n and y>=0 and y<m:\n f=1\n if f==1:\n print(\"safe\")\n else:\n print(\"unsafe\")\n", "# cook your dish here\nt=int(input())\nfor i in range(t):\n s=input().split()\n n=int(s[0])\n m=int(s[1])\n st=input()\n f=0\n for i in range(n):\n for j in range(m):\n x=i \n y=j\n for k in range(len(st)):\n if st[k]=='L':\n y=y-1\n elif st[k]=='R':\n y=y+1\n elif st[k]=='U':\n x=x-1\n elif st[k]=='D':\n x=x+1\n if x>=0 and x<n and y>=0 and y<m:\n ll=0\n else:\n break\n if x>=0 and x<n and y>=0 and y<m:\n f=1\n if f==1:\n print(\"safe\")\n else:\n print(\"unsafe\")\n", "def is_safe(n,m,i,j,s):\n for k in s:\n if(k=='L'):\n j-=1\n if(k=='R'):\n j+=1\n if(k=='U'):\n i-=1\n if(k=='D'):\n i+=1\n if((i<1 or i>n) or (j<1 or j>m)):\n return -1\n return 1\nfor _ in range(int(input())):\n n,m=[int(x) for x in input().split()]\n s=input()\n flag=0\n l,r,u,d=0,0,0,0\n for i1 in range(1,n+1):\n for i2 in range(1,m+1):\n res=is_safe(n,m,i1,i2,s)\n if res==1:\n flag=1\n break\n else:\n continue\n break\n\n if(flag==1):\n print(\"safe\")\n else:\n print(\"unsafe\")", "for _ in range(int(input())):\n n,m=[int(x) for x in input().split()]\n command=input()\n maxL=0\n maxR=0\n hom=0\n maxU=0\n maxD=0\n vem=0\n for co in command:\n if(co==\"L\"):\n hom+=1\n elif(co==\"R\"):\n hom-=1\n elif(co==\"U\"):\n vem+=1\n else:\n vem-=1\n if(hom>maxL):\n maxL=hom\n if(hom<maxR):\n maxR=hom\n if(vem>maxU):\n maxU=vem\n if(vem<maxD):\n maxD=vem\n if(maxL-maxR<m and maxU-maxD<n):\n print(\"safe\")\n else:\n print(\"unsafe\")\n", "for _ in range(int(input())):\n n,k=map(int,input().split())\n s=input()\n a, b = [0], [0]\n x = y = 0\n for i in s:\n if i == 'U':\n x -= 1\n a.append(x)\n elif i == 'D':\n x += 1\n a.append(x)\n elif i == 'L':\n y -= 1\n b.append(y)\n elif i == 'R':\n y += 1\n b.append(y)\n\n row = max(a) - min(a) + 1\n col = max(b) - min(b) + 1\n if row > n or col > k:\n print('unsafe')\n else:\n print('safe')", "for _ in range(int(input())):\n n,k=map(int,input().split())\n s=input()\n a, b = [0], [0]\n x = y = 0\n for i in s:\n if i == 'U':\n x -= 1\n a.append(x)\n elif i == 'D':\n x += 1\n a.append(x)\n elif i == 'L':\n y -= 1\n b.append(y)\n elif i == 'R':\n y += 1\n b.append(y)\n\n row = max(a) - min(a) + 1\n col = max(b) - min(b) + 1\n if row > n or col > k:\n print('unsafe')\n else:\n print('safe')", "for _ in range(int(input())):\n n, m = map(int, input().split())\n s = input()\n ans = 'unsafe'\n\n for i in range(n):\n for j in range(m):\n x, y = i, j\n res = 1\n for k in s:\n if k == 'L':\n y -= 1\n elif k == 'U':\n x -= 1\n elif k == 'R':\n y += 1\n else:\n x += 1\n if x < 0 or x >= n or y < 0 or y >= m:\n res = 0\n break\n\n if res:\n ans = 'safe'\n break \n print(ans)", "t=int(input())\nfor l in range(t):\n n,m=list(map(int,input().split()))\n a=False\n s=input()\n for i in range(1,n+1):\n \n for j in range(1,m+1):\n x=i\n y=j\n loulou=False\n for h in range(len(s)):\n \n if s[h]=='L':\n y=y-1\n elif s[h]=='R':\n y=y+1\n elif s[h]=='U':\n x=x+1\n else:\n x=x-1\n if x<1 or x>n or y<1 or y>m :\n loulou=True\n \n break\n \n \n \n if loulou==False :\n a=True\n \n print('safe')\n break\n if a==True:\n break\n if a==False:\n print('unsafe')\n", "t=int(input())\nfor _ in range(t):\n n,m=list(map(int,input().split()))\n s=input()\n flag=False\n for i in range(n):\n for j in range(m):\n x,y=i,j\n c=True\n for k in s:\n if k=='L':\n y-=1\n elif k=='U':\n x+=1\n elif k=='D':\n x-=1\n else:\n y+=1\n if x<0 or x>n-1 or y<0 or y>m-1:\n c=False\n break\n if c:\n flag=True\n break\n if flag:\n break\n if flag:\n print('safe')\n else:\n print('unsafe')\n", "for _ in range(int(input())):\n n , m = list(map(int,input().split()))\n s = input()\n r = c = 0\n arr = [0,0,0,0]\n for i in s:\n if i == 'R':\n c += 1\n elif i == 'L':\n c -= 1\n elif i == 'U':\n r += 1\n elif i == 'D':\n r -= 1\n if r<0:\n if arr[0] < abs(r):\n arr[0] = abs(r)\n else:\n if arr[1] < r:\n arr[1] = r\n\n if c<0:\n if arr[2] < abs(c):\n arr[2] = abs(c)\n else:\n if arr[3] < c :\n arr[3] = c\n if arr[0]+arr[1]>=n or arr[2]+arr[3]>=m:\n print('unsafe')\n else:\n print('safe')\n r=c=0\n \n", "\n\nt = int(input())\n\n\nfor _ in range(t):\n n,m = list(map(int,input().split()))\n s = input()\n flag = 0\n for i in range(n):\n for j in range(m):\n x = i\n y = j\n for k in s:\n if k == 'L':\n y-=1\n elif k == 'U':\n x-=1\n elif k == 'D':\n x+=1\n elif k == 'R':\n y+=1\n\n if x<0 or x>=n or y<0 or y>=m:\n break\n\n if 0<=x<=n-1 and 0<=y<=m-1:\n flag = 1\n break\n if flag == 1:\n break\n if flag == 1:\n print('safe')\n else:\n print('unsafe')\n\n\n\n\n\n\n", "import math\nt=int(input())\nfor test in range(t):\n n,m=list(map(int,input().split()))\n up=0\n down=0\n left=0\n right=0\n s=input()\n f=0\n for i in s:\n if i==\"L\":\n left+=1\n if right>0:\n right-=1\n if left==m:\n break\n if i==\"R\":\n right+=1\n if left>0:\n left-=1\n if right==m:\n break\n if i==\"U\":\n up+=1\n if down>0:\n down-=1\n if up==n:\n break\n if i==\"D\":\n down+=1\n if up>0:\n up-=1\n if down==n:\n break\n if abs(down)<n and abs(up)<n and abs(left)<m and abs(right)<m:\n print(\"safe\")\n else:\n print(\"unsafe\")\n", "import math\nt=int(input())\nfor test in range(t):\n n,m=list(map(int,input().split()))\n up=0\n down=0\n left=0\n right=0\n s=input()\n f=0\n for i in s:\n if i==\"L\":\n left+=1\n if right>0:\n right-=1\n if left==m:\n break\n if i==\"R\":\n right+=1\n if left>0:\n left-=1\n if right==m:\n break\n if i==\"U\":\n up+=1\n if down>0:\n down-=1\n if up==n:\n break\n if i==\"D\":\n down+=1\n if up>0:\n up-=1\n if down==n:\n break\n if abs(down)<n and abs(up)<n and abs(left)<m and abs(right)<m:\n print(\"safe\")\n else:\n print(\"unsafe\")\n", "for _ in range(int(input())):\n n,m = map(int,input().split())\n s = input()\n r,l,u,d=0,0,0,0 #displacement from starting position\n x,y=0,0\n for i in s:\n if i=='U':\n y+=1\n elif i=='D':\n y-=1\n elif i=='R':\n x+=1\n else:\n x-=1\n if x>r:\n r=x\n elif x<l:\n l=x\n elif y>u:\n u=y\n elif y<d:\n d=y\n #print(u,d,l,r)\n if n>abs(u)+abs(d) and m>abs(l)+abs(r):\n print(\"safe\")\n else:\n print(\"unsafe\")"]	{"inputs": [["5", "1 1", "R", "2 3", "LLRU", "3 2", "LLRU", "4 3", "ULURUDRDLD", "3 6", "RURUR"]], "outputs": [["unsafe", "safe", "unsafe", "safe", "safe"]]}	INTERVIEW	PYTHON3	CODECHEF	9,048
fd93760d21214e26a0b9e8d4c121db51	UNKNOWN	Consider the infinite x$x$ axis. There are N$N$ impacts on this X-axis at integral points (X1$X_1$,X2$X_2$,....XN$X_N$) (all distinct) . An impact at a point X$X$i propagates such that at a point X$X$0, the effect of the impact is K\|Xi−X0\|$K^{\|X_i - X_0\|}$. Given the point X0$X_0$, N$N$ and K$K$. Assume the total impact on X0$X_0$ is M$M$, find if it is possible to do so.Note: You are not required to find the set X Formally print "yes" if this is possible and "no" if not possible. -----Input:----- - First line will contain T$T$, number of testcases. Then the testcases follow. - Each testcase contains of a single line of input, four integers N$N$,K$K$,M$M$,X$X$0 -----Output:----- - The output of each test case is either "yes" or "no" -----Constraints ----- - 1≤T≤1000$1\leq T \leq 1000$ - 1≤N≤100$1\leq N \leq 100$ - 1≤K≤1000$1\leq K \leq 1000$ - 1≤M≤1018$1\leq M \leq 10^{18}$ - −109≤X0≤109$-10^9 \leq X_0 \leq 10^9$ -----Sample Input:----- 2 4 3 10 10 2 3 10 10 -----Sample Output:----- no yes	["# cook your dish here\nT = int(input())\nfor i in range(T):\n l = list(map(int, input().split()))\n n, k, m, x = l[0], l[1], l[2], l[3]\n if k == 1:\n if n == m:\n print(\"yes\")\n else:\n print(\"no\")\n elif m % k > 1:\n print(\"no\")\n elif k == 2:\n stack = []\n var = 0\n while m != 0:\n var += m % k\n stack.append(m % k)\n m //= k\n if var > n:\n print(\"no\")\n elif var == n:\n print(\"yes\")\n else:\n for p in range(100):\n for q in range(2, len(stack)):\n if stack[q - 1] == 0 and stack[q] >= 1:\n stack[q-1] = 2\n stack[q] -= 1\n var += 1\n if var == n:\n print(\"yes\")\n if var < n:\n print(\"no\")\n else:\n temp = 0\n rog = 1\n while m != 0:\n if m % k > 2:\n rog = 0\n print(\"no\")\n temp += m % k\n m //= k\n if rog:\n if temp == n:\n print(\"yes\")\n else:\n print(\"no\")\n\n", "# cook your dish here\nT = int(input())\nfor i in range(T):\n l = list(map(int, input().split()))\n n, k, m, x = l[0], l[1], l[2], l[3]\n if k == 1:\n if n == m:\n print(\"yes\")\n else:\n print(\"no\")\n elif m % k > 1:\n print(\"no\")\n elif k == 2:\n stack = []\n var = 0\n while m != 0:\n var += m % k\n stack.append(m % k)\n m //= k\n if var > n:\n print(\"no\")\n elif var == n:\n print(\"yes\")\n else:\n for p in range(100):\n for q in range(2, len(stack)):\n if stack[q - 1] == 0 and stack[q] >= 1:\n stack[q-1] = 2\n stack[q] -= 1\n var += 1\n if var == n:\n print(\"yes\")\n if var < n:\n print(\"no\")\n else:\n temp = 0\n rog = 1\n while m != 0:\n if m % k > 2:\n rog = 0\n print(\"no\")\n temp += m % k\n m //= k\n if rog:\n if temp == n:\n print(\"yes\")\n else:\n print(\"no\")\n", "T = int(input())\nfor i in range(T):\n l = list(map(int, input().split()))\n n, k, m, x = l[0], l[1], l[2], l[3]\n if k == 1:\n if n == m:\n print(\"yes\")\n else:\n print(\"no\")\n elif m % k > 1:\n print(\"no\")\n elif k == 2:\n stack = []\n var = 0\n while m != 0:\n var += m % k\n stack.append(m % k)\n m //= k\n if var > n:\n print(\"no\")\n elif var == n:\n print(\"yes\")\n else:\n for p in range(1000):\n for q in range(2, len(stack)):\n if stack[q - 1] == 0 and stack[q] >= 1:\n stack[q-1] = 2\n stack[q] -= 1\n var += 1\n if var == n:\n print(\"yes\")\n if var < n:\n print(\"no\")\n else:\n temp = 0\n rog = 1\n while m != 0:\n if m % k > 2:\n rog = 0\n print(\"no\")\n temp += m % k\n m //= k\n if rog:\n if temp == n:\n print(\"yes\")\n else:\n print(\"no\")\n\n", "# cook your dish here\nfrom math import log\ntry:\n for i in range (int(input())):\n a = input().split(\" \")\n n,k,x,m = map(int,a)\n ans = \"no\"\n u = 0\n \n if k != 2 and k != 1:\n if x%k == 0:\n x //= k\n u = -1\n elif x%k == 1:\n n -= 1\n x //= k\n u = -1\n \n if u == -1: \n while x != 0:\n if x%k == 0:\n x //= k\n elif x%k == 1:\n x //= k\n n -= 1\n elif x%k == 2:\n x //= k\n n -= 2\n else:\n break\n \n if n == 0 and x == 0:\n ans = \"yes\"\n \n elif k == 1:\n if x == n:\n ans = \"yes\"\n \n else:\n lst = []\n p = 0\n N = n\n while x != 0:\n if x%2 == 0:\n x //= 2\n p += 1\n elif x%2 == 1:\n x //= 2\n n -= 1\n p += 1\n lst.append(2*(p-1))\n \n if len(lst) == N:\n ans = \"yes\"\n \n if len(lst) < N:\n k = 0\n g = len(lst)\n if lst[0] > 2:\n g += int(log(lst[0])//log(2))-1\n k = 1\n for i in range(1,len(lst)):\n if k == 1:\n g += int(log(lst[i]//lst[i-1],2))\n elif lst[i] > 2lst[i-1]:\n g += int(log(lst[i]//lst[i-1],2))-1\n k = 1\n else:\n k = 0\n if g >= N:\n ans = \"yes\"\n \n print(ans)\nexcept EOFError as e : pass\n ", "from math import log\ntry:\n for i in range (int(input())):\n a = input().split(\" \")\n n,k,x,m = map(int,a)\n ans = \"no\"\n u = 0\n \n if k != 2 and k != 1:\n if x%k == 0:\n x //= k\n u = -1\n elif x%k == 1:\n n -= 1\n x //= k\n u = -1\n \n if u == -1: \n while x != 0:\n if x%k == 0:\n x //= k\n elif x%k == 1:\n x //= k\n n -= 1\n elif x%k == 2:\n x //= k\n n -= 2\n else:\n break\n \n if n == 0 and x == 0:\n ans = \"yes\"\n \n elif k == 1:\n if x == n:\n ans = \"yes\"\n \n else:\n lst = []\n p = 0\n N = n\n while x != 0:\n if x%2 == 0:\n x //= 2\n p += 1\n elif x%2 == 1:\n x //= 2\n n -= 1\n p += 1\n lst.append(2*(p-1))\n \n if len(lst) == N:\n ans = \"yes\"\n \n if len(lst) < N:\n k = 0\n g = len(lst)\n if lst[0] > 2:\n g += int(log(lst[0])//log(2))-1\n k = 1\n for i in range(1,len(lst)):\n if k == 1:\n g += int(log(lst[i]//lst[i-1],2))\n elif lst[i] > 2lst[i-1]:\n g += int(log(lst[i]//lst[i-1],2))-1\n k = 1\n else:\n k = 0\n if g >= N:\n ans = \"yes\"\n \n print(ans)\nexcept EOFError as e : pass\n ", "from math import log\r\nfor i in range (int(input())):\r\n a = input().split(\" \")\r\n n,k,x,m = map(int,a)\r\n ans = \"no\"\r\n u = 0\r\n\r\n if k != 2 and k != 1:\r\n if x%k == 0:\r\n x //= k\r\n u = -1\r\n elif x%k == 1:\r\n n -= 1\r\n x //= k\r\n u = -1\r\n\r\n if u == -1: \r\n while x != 0:\r\n if x%k == 0:\r\n x //= k\r\n elif x%k == 1:\r\n x //= k\r\n n -= 1\r\n elif x%k == 2:\r\n x //= k\r\n n -= 2\r\n else:\r\n break\r\n\r\n if n == 0 and x == 0:\r\n ans = \"yes\"\r\n\r\n elif k == 1:\r\n if x == n:\r\n ans = \"yes\"\r\n\r\n else:\r\n lst = []\r\n p = 0\r\n N = n\r\n while x != 0:\r\n if x%2 == 0:\r\n x //= 2\r\n p += 1\r\n elif x%2 == 1:\r\n x //= 2\r\n n -= 1\r\n p += 1\r\n lst.append(2*(p-1))\r\n\r\n if len(lst) == N:\r\n ans = \"yes\"\r\n \r\n if len(lst) < N:\r\n k = 0\r\n g = len(lst)\r\n if lst[0] > 2:\r\n g += int(log(lst[0])//log(2))-1\r\n k = 1\r\n for i in range(1,len(lst)):\r\n if k == 1:\r\n g += int(log(lst[i]//lst[i-1],2))\r\n elif lst[i] > 2lst[i-1]:\r\n g += int(log(lst[i]//lst[i-1],2))-1\r\n k = 1\r\n else:\r\n k = 0\r\n if g >= N:\r\n ans = \"yes\"\r\n\r\n print(ans)\r\n", "T = int(input())\r\nfor i in range(T):\r\n l = list(map(int, input().split()))\r\n n, k, m, x = l[0], l[1], l[2], l[3]\r\n if k == 1:\r\n if n == m:\r\n print(\"yes\")\r\n else:\r\n print(\"no\")\r\n elif m % k > 1:\r\n print(\"no\")\r\n elif k == 2:\r\n stack = []\r\n var = 0\r\n while m != 0:\r\n var += m % k\r\n stack.append(m % k)\r\n m //= k\r\n if var > n:\r\n print(\"no\")\r\n elif var == n:\r\n print(\"yes\")\r\n else:\r\n for p in range(100):\r\n for q in range(2, len(stack)):\r\n if stack[q - 1] == 0 and stack[q] >= 1:\r\n stack[q-1] = 2\r\n stack[q] -= 1\r\n var += 1\r\n if var == n:\r\n print(\"yes\")\r\n if var < n:\r\n print(\"no\")\r\n else:\r\n temp = 0\r\n rog = 1\r\n while m != 0:\r\n if m % k > 2:\r\n rog = 0\r\n print(\"no\")\r\n temp += m % k\r\n m //= k\r\n if rog:\r\n if temp == n:\r\n print(\"yes\")\r\n else:\r\n print(\"no\")\r\n\r\n", "T = int(input())\r\nfor i in range(T):\r\n l = list(map(int, input().split()))\r\n n, k, m, x = l[0], l[1], l[2], l[3]\r\n if k == 1:\r\n if n == m:\r\n print(\"yes\")\r\n else:\r\n print(\"no\")\r\n elif m % k > 1:\r\n print(\"no\")\r\n elif k == 2:\r\n stack = []\r\n var = 0\r\n while m != 0:\r\n var += m % k\r\n stack.append(m % k)\r\n m //= k\r\n if var > n:\r\n print(\"no\")\r\n elif var == n:\r\n print(\"yes\")\r\n else:\r\n for p in range(1000):\r\n for q in range(2, len(stack)):\r\n if stack[q - 1] == 0 and stack[q] >= 1:\r\n stack[q-1] = 2\r\n stack[q] -= 1\r\n var += 1\r\n if var == n:\r\n print(\"yes\")\r\n if var < n:\r\n print(\"no\")\r\n else:\r\n temp = 0\r\n rog = 1\r\n while m != 0:\r\n if m % k > 2:\r\n rog = 0\r\n print(\"no\")\r\n temp += m % k\r\n m //= k\r\n if rog:\r\n if temp == n:\r\n print(\"yes\")\r\n else:\r\n print(\"no\")\r\n\r\n"]	{"inputs": [["2", "4 3 10 10", "2 3 10 10"]], "outputs": [["no", "yes"]]}	INTERVIEW	PYTHON3	CODECHEF	12,492
c69353d45f3a19ed29ab4afa788da335	UNKNOWN	You are given a sequence $A_1, A_2, \ldots, A_N$. You have to split the array into maximum number of non-empty subarrays such that the gcd of elements of each subarray is equal to 1. -----Input:----- - The first line of the input contains a single integer $T$ denoting the number of test cases. The description of $T$ test cases follows. - The first line of each test case contains a single integer $N$. - The second line contains $N$ space-separated integers $A_1, A_2, \ldots, A_N$. -----Output:----- For each test case, print a single line containing one integer ― the maximum number of subarrays formed, or $-1$ if the array cannot be split while satisfying the above condition. -----Constraints----- - $1 \le T \le 3$ - $1 \le N \le 5 \cdot 10^5$ - $1 \le A_i \le 10^6$ for each valid $i$ -----Sample Input:----- 2 3 2 2 3 4 2 3 3 2 -----Sample Output:----- 1 2	["'''input\n2\n3\n2 2 3\n4\n2 3 3 2\n'''\nimport math\n\nfor _ in range(int(input())):\n n = int(input())\n a = list(map(int, input().split()))\n count = 0\n i = 0\n while i < len(a):\n if a[i] == 1:\n count += 1\n i += 1\n continue\n curr_gcd = a[i]\n while i < len(a) and curr_gcd != 1:\n curr_gcd = math.gcd(curr_gcd, a[i])\n if curr_gcd == 1:\n count += 1\n i += 1\n # print(i)\n break\n i += 1\n print(count)\n", "MOD = 1000000007\nMOD2 = 998244353\nii = lambda: int(input())\nsi = lambda: input()\ndgl = lambda: list(map(int, input()))\nf = lambda: map(int, input().split())\nil = lambda: list(map(int, input().split()))\nls = lambda: list(input())\nfrom math import gcd\nfor _ in range(ii()):\n n=ii()\n l=il()\n c=0\n g=0\n for i in range(n):\n g = gcd(g,l[i])\n if g==1:\n c+=1\n g=0\n print(c)", "import math\nT = int(input())\nfor i in range(T):\n N = int(input())\n lis = list(map(int,input().split()))\n count = 0\n temp = lis[0]\n for j in lis[1:]:\n if temp==1:\n count += 1\n temp = j\n temp = math.gcd(temp,j)\n if temp==1:\n count += 1\n print(count)", "import math\n\ndef solve(arr,n):\n g = 0\n count = 0\n for i in arr:\n g = math.gcd(max(i,g),min(i,g))\n if g == 1:\n g = 0\n count += 1\n\n if g > 1 and count == 0:\n print(-1)\n return\n \n print(count)\n\ndef main():\n t = int(input())\n for i in range(t):\n n = int(input())\n arr = list(map(int,input().split()))\n solve(arr,n)\n \n\nmain()\n"]	{"inputs": [["2", "3", "2 2 3", "4", "2 3 3 2"]], "outputs": [["1", "2"]]}	INTERVIEW	PYTHON3	CODECHEF	1,473
be16604c0f234ad6e2bce7e8afe36203	UNKNOWN	Abhi Ram analyses london stock exchange and invests in a software company C-.gate . He wants to sell his shares after 5 weeks. Given the investment m, increase or decrease of share prices of 5 weeks(+/- pi) , help him to calculate his net profit or loss percentage(n%) of his investment to establish his own company KMC. -----Input:----- - The first line contains an integer T which denotes the number of test cases. - Each test case comprises of two lines: the first line contains the integer m which denotes the amount invested. The second line consists of five space separated integers(p1, p2, p3, p4, p5) each preceeded by + (increase) or - (decrease) which give the percentage of change in share prices over 5 weeks. . -----Output:----- The output contains a single number n which gives the percentage of profit or loss preceeded by + (profit) or - (loss). -----Constraints:----- - 1 ≤ T ≤ 100 - 1 ≤ m ≤ 105 - -100 ≤ pi ≤ 100 -----Example:----- Input: 2 10000 +5 -3 -2 +10 +15 6256250 -24 +22 +4 -16 +20 Output: +26.2634 -2.79977	["for i in range(int(input())):\n\t n = int(input())\n\t P = list(map(float, input().split()))\n\t pr = 1\n\t for p in P:\n\t\t a = 100+p\n\t\t pr = (pra)/100\n\t pr = (pr-1)100\n\t x = 6-len(str(int(abs(pr))))\n \t if (x==1):\n \t \t if (pr==0):\n \t \t \tprint(0)\n\t\t elif (pr>0):\n\t\t \tprint(\"+\"+str(\"%.1f\" % round(pr,x)))\n\t\t else:\n\t\t \tprint(str(\"%.1f\" % round(pr,x)))\n\t elif (x==2):\n \t \t if (pr==0):\n \t \t \tprint(0)\n\t\t elif (pr>0):\n\t\t \tprint(\"+\"+str(\"%.2f\" % round(pr,x)))\n\t\t else:\n\t\t \tprint(str(\"%.2f\" % round(pr,x)))\n\t elif (x==3):\n \t \t if (pr==0):\n \t \t \tprint(0)\n\t\t elif (pr>0):\n\t\t \tprint(\"+\"+str(\"%.3f\" % round(pr,x)))\n\t\t else:\n\t\t \tprint(str(\"%.3f\" % round(pr,x)))\n\t elif (x==4):\n \t \t if (pr==0):\n \t \t \tprint(0)\n\t\t elif (pr>0):\n\t\t \tprint(\"+\"+str(\"%.4f\" % round(pr,x)))\n\t\t else:\n\t\t \tprint(str(\"%.4f\" % round(pr,x)))\n\t elif (x==5):\n \t \t if (pr==0):\n \t \t \tprint(0)\n\t\t elif (pr>0):\n\t\t \tprint(\"+\"+str(\"%.5f\" % round(pr,x)))\n\t\t else:\n\t\t \tprint(str(\"%.5f\" % round(pr,x)))\n\t elif (x==6):\n \t \t if (pr==0):\n \t \t \tprint(0)\n\t\t elif (pr>0):\n\t\t \tprint(\"+\"+str(\"%.6f\" % round(pr,x)))\n\t\t else:\n\t\t \tprint(str(\"%.6f\" % round(pr,x)))"]	{"inputs": [["2", "10000", "+5 -3 -2 +10 +15", "6256250", "-24 +22 +4 -16 +20"]], "outputs": [["+26.2634", "-2.79977"]]}	INTERVIEW	PYTHON3	CODECHEF	1,315
fcb93f3bafdb1974f72977bfdf9f22c9	UNKNOWN	Chef published a blog post, and is now receiving many queries about it. On day $i$, he receives $Q_i$ queries. But Chef can answer at most $k$ queries in a single day. Chef always answers the maximum number of questions that he can on any given day (note however that this cannot be more than $k$). The remaining questions (if any) will be carried over to the next day. Fortunately, after $n$ days, the queries have stopped. Chef would like to know the first day during which he has some free time, i.e. the first day when he answered less than $k$ questions. -----Input:----- - First line will contain $T$, the number of testcases. Then the testcases follow. - The first line of each testcase contains two space separated integers $n$ and $k$. - The second line of each testcase contains $n$ space separated integers, namely $Q_1, Q_2, ... Q_n$. -----Output:----- For each testcase, output in a single line the first day during which chef answers less than $k$ questions. -----Constraints----- - $1 \leq T \leq 10^5$ - $1 \leq $ sum of $n$ over all testcases $ \leq 10^5$ - $1 \leq k \leq 10^8$ - $0 \leq Q_i \leq 10^8$ -----Subtasks----- - Subtask 1 - 20% points - Sum of $Q_i$ over all testcases and days $\leq 3 . 10^6$ - Subtask 2 - 80% points - Original constraints -----Sample Input:----- 2 6 5 10 5 5 3 2 1 1 1 100 -----Sample Output:----- 6 101 -----Explanation:----- Test Case 1 On the first day, chef answers 5 questions and leaves the remaining 5 (out of the 10) for the future days. On the second day, chef has 10 questions waiting to be answered (5 received on the second day and 5 unanswered questions from day 1). Chef answers 5 of these questions and leaves the remaining 5 for the future. On the third day, chef has 10 questions waiting to be answered (5 received on the third day and 5 unanswered questions from earlier). Chef answers 5 of these questions and leaves the remaining 5 for later. On the fourth day, chef has 8 questions waiting to be answered (3 received on the fourth day and 5 unanswered questions from earlier). Chef answers 5 of these questions and leaves the remaining 3 for later. On the fifth day, chef has 5 questions waiting to be answered (2 received on the fifth day and 3 unanswered questions from earlier). Chef answers all 5 of these questions. On the sixth day, chef has 1 question, which he answers. This is the first day he answers less than 5 questions, and so the answer is 6. Test Case 2 Chef answers 1 question a day for the first 100 days. On day 101, he is free.	["# cook your dish here\n\nt=int(input())\nwhile(t):\n t=t-1\n n,k=list(map(int,input().split()))\n q=list(map(int,input().split()))\n days,rem=0,0\n for i in range(n):\n rem+=q[i]\n if(rem>=k):\n rem-=k\n else:\n days=i+1\n break\n days+=1\n if(rem>=k):\n days+=(rem//k)+1\n print(days)\n", "# cook your dish here\ntry:\n t=int(input())\n while(t):\n t=t-1\n n,k=map(int,input().split())\n q=list(map(int,input().split()))\n days,rem=0,0\n for i in range(n):\n rem+=q[i]\n if(rem>=k):\n rem-=k\n else:\n days=i+1\n break\n days+=1\n if(rem>=k):\n days+=(rem//k)+1\n print(days)\nexcept:\n pass", "def calFirstFreeDay(r, k, count):\n if((r-k)<k):\n print(count+2)\n else:\n calFirstFreeDay(r-k, k, count+1)\n \n\nT = int(input())\nfor i in range(0, T):\n list = input().split()\n n = int(list[0])\n k = int(list[1])\n \n pq = 0\n outputDone=False;\n arr = input().split()\n if(n==1):\n print((int(int(arr[0])/k))+1)\n outputDone = True\n if(not outputDone):\n for j in range(0, n):\n q = int(arr[j])\n if((q+pq)<k):\n print((j+1));\n outputDone = True;\n break;\n else:\n pq = (q+pq)-k;\n if(not outputDone):\n calFirstFreeDay(pq, k, n)\n", "def calFirstFreeDay(r, k, count):\n if((r-k)<k):\n print(count+2)\n else:\n calFirstFreeDay(r-k, k, count+1)\n \n\nT = int(input())\nfor i in range(0, T):\n list = input().split()\n n = int(list[0])\n k = int(list[1])\n pq = 0\n outputDone=False;\n arr = input().split()\n for j in range(0, n):\n q = int(arr[j])\n if((q+pq)<k):\n print((j+1));\n outputDone = True;\n break;\n else:\n pq = (q+pq)-k;\n if(not outputDone):\n calFirstFreeDay(pq, k, n)\n", "def solve(n, k, q):\n leftq = 0\n for i in range(n):\n leftq = leftq + q[i]\n if leftq < k:\n return i+1\n leftq = leftq - k\n \n return n + leftq//k + 1\n\nt = int(input())\n\nfor _ in range(t):\n n, k = list(map(int , input().split()))\n queries = list(map(int , input().split()))\n print( solve(n, k, queries))\n \n", "# cook your dish here\nt=int(input())\n#print(t)\nfor _ in range(t):\n #print(t)\n p = list(map(int, input().split()))\n n = p[0]\n k = p[1]\n l = list(map(int, input().split()))\n #print(l)\n s=0\n f=1\n for i in range(0,n):\n s += l[i]\n if(s<k):\n print(i+1)\n f=0\n break\n s = s-k\n \n if(f):\n print( sum(l)//k + 1)\n", "try:\n t = int(input())\n for _ in range(t):\n n, k = map(int, input().split())\n qArr = list(map(int, input().split()))\n res = (sum(qArr)//k) + 1\n print(res)\nexcept:\n pass", "for i in range(int(input())):\n n,k=list(map(int,input().split()))\n q=[int(z) for z in input().split()]\n carry,flag=0,0\n for i in range(n):\n if q[i]+carry>=k:\n carry+=q[i]-k\n else:\n flag=1\n print(i+1)\n break\n if carry>0 and flag!=1:\n print(carry//k +1+n)\n elif carry==0 and flag!=1:\n print(n+1)\n \n", "for i in range(int(input())):\n n,k=list(map(int,input().split()))\n q=[int(z) for z in input().split()]\n count=n-1\n for i in range(n-1):\n if q[i]>k:\n q[i+1]+=q[i]-k\n if q[n-1]<=k:\n count+=1\n else:\n count+=(q[n-1]//k)+1\n print(count)\n \n", "for _ in range(int(input())):\n n, k = list(map(int, input().split()))\n arr = list(map(int, input().split()))\n left = 0\n total_q = 0\n flag = 0\n for i in range(n):\n total_q += arr[i]\n if total_q < k:\n flag= 1\n break\n total_q = total_q - k\n left = total_q\n\n if flag:\n print(i+1)\n else:\n if not left:\n print(n)\n else:\n print(n + int(left / k) + 1)\n", "for _ in range(int(input())):\n n, k = list(map(int, input().split()))\n arr = list(map(int, input().split()))\n left = 0\n total_q = 0\n\n for i in range(n):\n total_q += arr[i]\n total_q = total_q - k if total_q - k > 0 else 0\n left = total_q\n\n if not left:\n print(n)\n else:\n print(n + int(left / k) + 1)\n", "for _ in range(int(input())):\n n, k = list(map(int, input().split()))\n arr = list(map(int, input().split()))\n left = 0\n total_q = 0\n\n for i in range(n-1):\n total_q += int(arr[i])\n total_q = total_q - k if total_q - k > 0 else 0\n left = total_q\n\n left += arr[n-1]\n if left < k:\n print(n)\n elif left == k:\n print(n + 1)\n else:\n left = left - k\n print(n+int(left/k)+1)\n", "for i in range(int(input())):\n n, k = map(int, input().split())\n arr = list(map(int, input().split()))\n s = sum(arr)\n print(max(int(s/k)+1, n))", "for _ in range(int(input())):\n i=0\n n,k=map(int,input().split())\n l=list(map(int,input().split()))\n so=l[i]\n result=sum(l)\n r=result//k\n if(r<=k):\n print(r+1)\n else:\n print(r+k//so+1)", "for _ in range(int(input())):\n n,k=map(int,input().split())\n l=list(map(int,input().split()))\n result=sum(l)\n r=result//k\n print(r+1)", "# cook your dish here\nt = int(input())\nwhile(t > 0):\n n,k = map(int,input().split())\n q = [int(x) for x in input().split()]\n carry = 0\n flag = 0\n for i in range(n):\n if(q[i]+carry>=k):\n carry = q[i] + carry - k\n else:\n flag = 1\n print(i+1)\n break\n if(carry > 0 and flag != 1):\n rem = carry//k + 1 + n\n print(rem)\n elif(carry == 0 and flag != 1):\n print(n+1)\n t -= 1", "# cook your dish here\nt = int(input())\nwhile(t > 0):\n n,k = map(int,input().split())\n q = [int(x) for x in input().split()]\n carry = 0\n for i in range(n):\n if(q[i]+carry>=k):\n carry = q[i] + carry - k\n else:\n print(i+1)\n break\n if(carry > 0 and k != 0):\n rem = carry//k + 1 + n\n print(rem)\n elif(carry == 0):\n print(n+1)\n t -= 1", "# cook your dish here\nt = int(input())\nwhile(t > 0):\n n,k = map(int,input().split())\n q = [int(x) for x in input().split()]\n carry = 0\n for i in range(n):\n if(q[i]+carry>=k):\n carry = q[i] + carry - k\n else:\n print(i+1)\n break\n if(carry > 0):\n rem = carry//k + 1 + n\n print(rem)\n elif(carry == 0):\n print(n+1)\n t -= 1", "# cook your dish here\nt = int(input())\nwhile(t > 0):\n n,k = map(int,input().split())\n q = [int(x) for x in input().split()]\n carry = 0\n for i in range(n):\n if(q[i]+carry>=k):\n carry = q[i] + carry - k\n elif(q[i]+carry<k):\n print(i+1)\n break\n else:\n print(i+1)\n break\n if(carry > 0):\n rem = carry//k + 1 + n\n print(rem)\n t -= 1", "# cook your dish here\nt = int(input())\nwhile(t > 0):\n n,k = map(int,input().split())\n q = [int(x) for x in input().split()]\n carry = 0\n for i in range(n):\n if(q[i]+carry>=k):\n carry = q[i] + carry - k\n else:\n print(i+1)\n break\n if(carry > 0):\n rem = carry//k + 1 + n\n print(rem)\n t -= 1", "t=int(eval(input('')))\nfor i in range(t):\n n, k = [int(n) for n in input(\" \").split()]\n lst = list(map(int, input().split()))\n j=0\n leftover=0\n ans=0\n for i in range(n):\n j=lst[i]+leftover\n leftover=j-k\n if(j<k):\n ans=i+1 \n break\n if(leftover>=0):\n ans=n+(leftover//k)+1 \n print(ans)\n", "t=int(input())\nfor each in range(t):\n n,k=map(int,input().split())\n q=list(map(int,input().split()))\n i=0\n while True:\n if i<n:\n if i==0:\n if q[i]<k:\n print(i+1)\n break\n r=q[i]-k\n i+=1\n else:\n if (r+q[i])<k:\n print(i+1)\n break\n r=(r+q[i])-k\n i=i+1 \n else:\n print(i+(r//k)+1)\n break", "# sai ram\nfor _ in range(int(input())):\n n,k=[int(x) for x in input().split()]\n q=[int(x) for x in input().split()]\n \n \n print((sum(q)//k)+1)\n \n \n"]	{"inputs": [["2", "6 5", "10 5 5 3 2 1", "1 1", "100"]], "outputs": [["6", "101"]]}	INTERVIEW	PYTHON3	CODECHEF	7,311
941fecd17affbeed734ce75b4fd48c1c	UNKNOWN	Due to the COVID pandemic, people have been advised to stay at least $6$ feet away from any other person. Now, people are lining up in a queue at the local shop and it is your duty to check whether they are all following this advice. There are a total of $N$ spots (numbered $1$ through $N$) where people can stand in front of the local shop. The distance between each pair of adjacent spots is $1$ foot. Each spot may be either empty or occupied; you are given a sequence $A_1, A_2, \ldots, A_N$, where for each valid $i$, $A_i = 0$ means that the $i$-th spot is empty, while $A_i = 1$ means that there is a person standing at this spot. It is guaranteed that the queue is not completely empty. For example, if $N = 11$ and the sequence $A$ is $(0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 1)$, then this is a queue in which people are not following the advice because there are two people at a distance of just $3$ feet from each other. You need to determine whether the people outside the local shop are following the social distancing advice or not. As long as some two people are standing at a distance smaller than 6 feet from each other, it is bad and you should report it, since social distancing is not being followed. -----Input----- - The first line of the input contains a single integer $T$ denoting the number of test cases. The description of $T$ test cases follows. - The first line of each test case contains a single integer $N$. - The next line contains $N$ space-separated integers $A_1, A_2, \ldots, A_N$. -----Output----- For each test case, print a single line containing the string "YES" if social distancing is being followed or "NO" otherwise (without quotes). -----Constraints----- - $1 \le T \le 100$ - $1 \le N \le 100$ - $0 \le A_i \le 1$ for each valid $i$ - at least one spot is occupied -----Subtasks----- Subtask #1 (100 points): original constraints -----Example Input----- 3 3 1 0 1 7 1 0 0 0 0 0 1 11 0 1 0 0 0 0 0 1 0 0 1 -----Example Output----- NO YES NO -----Explanation----- Example case 1: The first and third spots are occupied and the distance between them is $2$ feet. Example case 2: The first and seventh spots are occupied and the distance between them is $6$ feet.	["# cook your dish here\nt=int(input())\nwhile t>0:\n n=int(input())\n l=list(map(int,input().split()))\n l1=[]\n c=1\n for i in range(len(l)):\n if l[i]==1:\n l1.append(i)\n for j in range(len(l1)-1):\n if l1[j+1]-l1[j]<6:\n c=0\n break\n if c:\n print(\"YES\")\n else:\n print(\"NO\")\n \n t-=1", "T=int(input())\nfor i in range(T):\n N=int(input())\n L=list(map(int,input().split()))[:N]\n a,b=[],[]\n for j in range(len(L)):\n if L[j]==1:\n a.append(j)\n for k in range(len(a)-1):\n b.append(a[k+1]-a[k])\n for l in range(len(b)):\n if b[l]<6:\n print(\"NO\")\n break\n else:\n print(\"YES\")", "T=int(input())\nfor i in range(T):\n N=int(input())\n L=list(map(int,input().split()))[:N]\n a,b=[],[]\n for j in range(len(L)):\n if L[j]==1:\n a.append(j)\n for k in range(len(a)-1):\n b.append(a[k+1]-a[k])\n for l in range(len(b)):\n if b[l]<6:\n print(\"NO\")\n break\n else:\n print(\"YES\")", "T=int(input())\nfor i in range(T):\n N=int(input())\n L=list(map(int,input().split()))[:N]\n a,b=[],[]\n for j in range(len(L)):\n if L[j]==1:\n a.append(j)\n for k in range(len(a)-1):\n b.append(a[k+1]-a[k])\n for l in range(len(b)):\n if b[l]<6:\n print(\"NO\")\n break\n else:\n print(\"YES\")\n", "# cook your dish here\nfor _ in range(int(input())) :\n N = int(input().strip())\n A = list(map(int, input().split()))\n m1 = 0\n ma = 0\n mc = 1\n for i in range(N) :\n if A[i] == 1 :\n ma = ma + 1\n if ma > 1 and m1 < 5 :\n mc = 0\n print(\"NO\")\n break\n m1 = 0\n else :\n m1 = m1 + 1\n # print(i, A[i], ma, m1)\n if mc == 1 :\n print(\"YES\")", "# cook your dish here\nfor _ in range(int(input())):\n n = int(input())\n l = list(map(int,input().split()))\n # 101 --- 1000001 ----\n f = True\n for i in range(n):\n if(l[i]==1):\n if(i+1 < n):\n if(l[i+1]==1):\n f=False\n break\n if(i+2 < n):\n if(l[i+2]==1):\n f=False\n break\n if(i+3 < n):\n if(l[i+3]==1):\n f=False\n break\n if(i+4 < n):\n if(l[i+4]==1):\n f=False\n break\n if(i+5 < n):\n if(l[i+5]==1):\n f=False\n break\n if(f==True):\n print('YES')\n else:\n print('NO')", "# cook your dish here\nfor _ in range(int(input())):\n n=int(input())\n l1=list(map(int,input().split()))\n flag=0\n l2=[]\n for i in range(len(l1)):\n if l1[i]==1:\n l2.append(i)\n for i in range(len(l2)-1):\n if l2[i+1]-l2[i]<6:\n flag=1\n break\n if flag==0:\n print(\"YES\")\n else:\n print(\"NO\")\n", "# cook your dish here\nt=int(input())\nfor i in range(t):\n n=int(input())\n a=[]\n a=list(map(int,input().split()))\n x=[]\n for j in range(n):\n if a[j]==1:\n x.append(j)\n k=len(x)\n flag=0\n for j in range(k-1):\n if abs(x[j]-x[j+1])<6:\n flag=1\n break\n if flag==0:\n print('YES')\n else:\n print(\"NO\")\n ", "for _ in range(int(input())):\n n = int(input())\n l = list(map(int,input().split()))\n ans = \"YES\"\n if n<=6:\n x = l.count(1)\n if x>1:\n ans = \"NO\"\n else:\n for i in range(n-5):\n x = l[i:i+6].count(1)\n if x>1:\n ans = \"NO\"\n break \n print(ans) ", "# cook your dish here\nt=int(input())\nfor _ in range(t):\n n=int(input())\n l=list(map(int,input().split()))\n l=[ i for i in range(len(l)) if l[i] == 1 ]\n social_distance=True\n for i in range(1,len(l)):\n if l[i]-l[i-1]<6:\n social_distance=False\n break\n if social_distance==False:\n print('NO')\n else:\n print('YES')\n ", "# cook your dish here\nt=int(input())\nfor _ in range(t):\n n=int(input())\n l=list(map(int,input().split()))\n l=[ i for i in range(len(l)) if l[i] == 1 ]\n social_distance=True\n for i in range(1,len(l)):\n if l[i]-l[i-1]<6:\n social_distance=False\n if social_distance==False:\n print('NO')\n else:\n print('YES')\n ", "# cook your dish here\nfor T in range(int(input())):\n n = int(input())\n ls = list(map(int,input().split()))\n flag1 = 0\n lr = []\n for i in range(n):\n if ls[i]==1:\n lr.append(i+1)\n # print(lr)\n if len(lr)==1:\n print(\"YES\")\n else:\n for j in range(1,len(lr)):\n if (lr[j]-lr[j-1])>=6:\n flag1 = 1 \n else:\n flag1 = 0 \n break\n \n if flag1==1:\n print(\"YES\")\n else:\n print(\"NO\")\n ", "# cook your dish here\ndef covid(n,m):\n p=False\n for j in range(len(m)):\n if(m[j]==1 and p==False):\n k=j\n p=True\n elif(m[j]==1 and p):\n if(j-k<6):\n return \"NO\"\n else:\n k=j\n return \"YES\"\nt=int(input())\nfor i in range(t):\n n=int(input())\n m=list(map(int,input().split()))\n print(covid(n,m))\n ", "# cook your dish here\nt=int(input())\nwhile t>0:\n n=int(input())\n l=list(map(int,input().split()))\n l1=[]\n c=True\n for i in range(len(l)):\n if l[i]==1:\n l1.append(i)\n for j in range(len(l1)-1):\n if l1[j+1]-l1[j]<6:\n c=False\n break\n if c:\n print(\"YES\")\n else:\n print(\"NO\")\n \n t-=1", "# cook your dish here\nfor _ in range(int(input())):\n n=int(input())\n a=list(map(int,input().split()))\n pos=[]\n for i in range(len(a)):\n if a[i]==1:\n pos.append(i)\n for i in range(1,len(pos)):\n if pos[i]-pos[i-1]<6:\n print('NO')\n break\n else:\n print('YES')", "for test_ in range(int(input())):\r\n n = int(input())\r\n a = list(map(int,input().strip().split()))\r\n temp = []\r\n for i in range(n):\r\n if a[i] == 1:\r\n temp.append(i)\r\n if len(temp) == 1:\r\n print(\"YES\")\r\n else:\r\n dist = []\r\n for i in range(1,len(temp)):\r\n dist.append(temp[i]-temp[i-1])\r\n print(\"YES\" if min(dist)>=6 else \"NO\")", "# cook your dish here\nt=int(input())\nwhile t>0:\n n=int(input())\n l=list(map(int,input().split()))\n m=[]\n for i in range(n):\n if l[i]==1:\n m.append(i)\n if len(m)==1:\n print(\"YES\")\n else:\n diff=[]\n for i in range(1,len(m)):\n diff.append(m[i]-m[i-1])\n for i in diff:\n if i<6:\n print(\"NO\")\n break\n else:\n print(\"YES\")\n t-=1", "# cook your dish here\nfor _ in range(int(input())):\n N=int(input())\n inp_lst=tuple(i for i in input().strip().split(' '))\n idx_lst=[]\n printStr='YES'\n for i in range(N):\n if(inp_lst[i]=='1'):\n idx_lst.append(i)\n \n for i in range(1,len(idx_lst)):\n if(idx_lst[i]-idx_lst[i-1]<6):\n printStr='NO'\n break\n \n print(printStr)\n \n", "import sys\ncases = int(sys.stdin.readline().rstrip())\nfor case in range(cases):\n N = int(sys.stdin.readline().rstrip())\n p = list(map(int,sys.stdin.readline().rstrip().split(\" \")))\n idxs=[]\n for (i,v) in enumerate(p):\n if(v == 1):\n idxs.append(i)\n error = False\n for i in range(len(idxs)-1):\n if idxs[i+1] - idxs[i] < 6:\n error = True\n break\n if(error):\n print(\"NO\")\n else :\n print(\"YES\")\n \n \n", "for _ in range(int(input())):\r\n # x,y,s = map(int,input().split())\r\n n = int(input())\r\n a = input()\r\n if '1 1' in a or '1 0 1' in a or '1 0 0 1' in a or '1 0 0 0 1' in a or '1 0 0 0 0 1' in a :\r\n print('NO')\r\n else :\r\n print('YES')\r\n", "import sys\ncases = int(sys.stdin.readline().rstrip())\nfor case in range(cases):\n N = int(sys.stdin.readline().rstrip())\n p = list(map(int,sys.stdin.readline().rstrip().split(\" \")))\n idxs=[]\n for (i,v) in enumerate(p):\n if(v == 1):\n idxs.append(i)\n error = False\n for i in range(len(idxs)-1):\n if idxs[i+1] - idxs[i] < 6:\n error = True\n break\n if(error):\n print(\"NO\")\n else :\n print(\"YES\")\n \n ", "# cook your dish here\nfor _ in range(int(input())):\n N = int(input())\n A = list(map(int,input().strip().split()))\n Positions = []\n not_followed = 0\n for i in range(N):\n if A[i] == 1 : \n Positions.append(i+1)\n for i in range(len(Positions)-1):\n if (Positions[i+1] - Positions[i]) < 6 : not_followed += 1\n if not_followed == 0 : print('YES')\n else : print('NO')", "t = int(input())\n\nfor _ in range(t):\n n = int(input())\n arr = [int(x) for x in input().split()]\n \n one = [i for i, x in enumerate(arr) if x == 1]\n \n flag = 0\n \n for i in range(1, len(one)):\n if(one[i]-one[i-1] < 6):\n flag = 1\n break\n \n if(flag == 1):\n print(\"NO\")\n else:\n print(\"YES\")", "for _ in range(int(input())):\n n=int(input())\n s=list(map(int,input().split()))\n l=[]\n c=0\n for i in range(n):\n if s[i]==1:\n l.append(i)\n for i in range(len(l)-1):\n if l[i+1]-l[i]<6:\n c+=1\n if c>0:\n print(\"NO\")\n else:\n print(\"YES\")\n \n ", "t=int(input())\r\n\r\nwhile t>0:\r\n t-=1\r\n n=int(input())\r\n \r\n l1=[int(i) for i in input().split(\" \")]\r\n \r\n ans=\"\"\r\n \r\n flag=0\r\n k=0\r\n for i in l1:\r\n if flag==1 and i!=1:\r\n k+=1\r\n elif i==1 and flag==0:\r\n flag=1\r\n elif i==1 and flag==1:\r\n if k>=5:\r\n k=0\r\n else:\r\n ans=\"NO\"\r\n break\r\n if ans==\"\":\r\n ans=\"YES\"\r\n print(ans)\r\n "]	{"inputs": [["3", "3", "1 0 1", "7", "1 0 0 0 0 0 1", "11", "0 1 0 0 0 0 0 1 0 0 1", ""]], "outputs": [["NO", "YES", "NO"]]}	INTERVIEW	PYTHON3	CODECHEF	10,968
ae2b1dac138d29ab2cc8609982ad248a	UNKNOWN	"What do you know about happiness?" — Yoda Chef is happy only if three conditions hold: - Chef finished cooking a delicious meal - Chef got AC for a programming problem with an almost correct code - Chef got a new problem with a sequence of integers Today, all three conditions are satisfied. Chef would like you to feel his happiness and provide him with a solution for this new problem with a sequence of integers. The problem is as follows. You are given a sequence $A_1, A_2, \dots, A_N$. You need to determine if it is possible to choose two indices $i$ and $j$ such that $A_i \neq A_j$, but $A_{A_i}$ = $A_{A_j}$. (If it was possible, Chef would be truly happy.) -----Input----- - The first line of the input contains a single integer $T$ denoting the number of test cases. The description of $T$ test cases follows. - The first line of each test case contains a single integer $N$. - The second line contains $N$ space-separated integers $A_1, A_2, \ldots, A_N$. -----Output----- For each test case, print a single line containing the string "Truly Happy" if it is possible to choose required indices or "Poor Chef" otherwise. -----Constraints----- - $1 \le T \le 1,000$ - $1 \le N \le 10^5$ - $1 \le A_i \le N$ for each valid $i$ - the sum of $N$ over all test cases does not exceed $2 \cdot 10^5$ -----Subtasks----- Subtask #1 (27 points): $1 \le N \le 1,000$ Subtask #2 (73 points): original constraints -----Example Input----- 4 4 1 1 2 3 4 2 1 3 3 5 5 4 4 3 1 5 3 2 1 1 4 -----Example Output----- Truly Happy Poor Chef Poor Chef Truly Happy -----Explanation----- Example case 1: Chef is truly happy because $A_{A_3} = A_{A_1}$ and $A_3 \neq A_1$. Example case 2: There is no pair of indices which would make Chef truly happy. For instance, $A_{A_3} = A_{A_4}$, but $A_3 = A_4$,	["# cook your dish here\n\nt=int(input())\n\nfor i in range(t):\n n=int(input())\n a=list(map(int,input().split()))\n d={}\n for i in range(n):\n if a[i]-1 not in d:\n d[a[i]-1]=[i]\n else:\n d[a[i]-1].append(i)\n ans=False\n d1={}\n \n for i in d:\n if ans==True:\n break\n for j in d:\n if i!=j:\n if a[i]==a[j] and i!=j:\n ans=True\n break\n if ans==True:\n print('Truly Happy')\n else:\n print('Poor Chef')\n", "# cook your dish here\n\nt=int(input())\n\nfor i in range(t):\n n=int(input())\n a=list(map(int,input().split()))\n d={}\n for i in range(n):\n if a[i]-1 not in d:\n d[a[i]-1]=[i]\n else:\n d[a[i]-1].append(i)\n ans=False\n d1={}\n for i in range(len(a)):\n d1[i]=a[i]\n for i in d:\n if ans==True:\n break\n for j in d:\n if i!=j:\n if d1[i]==d1[j] and i!=j:\n ans=True\n break\n if ans==True:\n print('Truly Happy')\n else:\n print('Poor Chef')\n", "# cook your dish here\n\nt=int(input())\n\nfor i in range(t):\n n=int(input())\n a=list(map(int,input().split()))\n d={}\n for i in range(n):\n if a[i]-1 not in d:\n d[a[i]-1]=[i]\n else:\n d[a[i]-1].append(i)\n ans=False\n for i in d:\n if ans==True:\n break\n for j in d:\n if i!=j:\n if a[i]==a[j] and i!=j:\n ans=True\n break\n if ans==True:\n print('Truly Happy')\n else:\n print('Poor Chef')\n", "# cook your dish here\n\nt=int(input())\n\nfor i in range(t):\n n=int(input())\n a=list(map(int,input().split()))\n d={}\n for i in range(n):\n if a[i]-1 not in d:\n d[a[i]-1]=[i]\n else:\n d[a[i]-1].append(i)\n ans=False\n for i in d:\n if ans==True:\n break\n for j in d:\n if ans==True:\n break\n if i!=j:\n if a[i]==a[j] and i!=j:\n \n ans=True\n if ans==True:\n print('Truly Happy')\n else:\n print('Poor Chef')\n", "# cook your dish here\nt = int(input())\nfor _ in range(t):\n n = int(input())\n arr = list(map(int, input().split()))\n seti1 = set(arr)\n l = [arr[i-1] for i in arr]\n seti2 = set(l)\n if len(seti1)<=len(seti2):\n print(\"Poor Chef\")\n else:\n print(\"Truly Happy\")\n \n \n \n \n", "\nfor _ in range(int(input())):\n n=int(input())\n l=list(map(int,input().split()))\n ln1=len(set(l))\n l1=[]\n for i in l:\n l1.append(l[i-1])\n ln2=len(set(l1))\n if(ln1==ln2):\n print(\"Poor Chef\")\n else:\n print(\"Truly Happy\")\n", "for _ in range(int(input())):\n n=int(input())\n a=list(map(int,input().split()))\n ans=\"Poor Chef\"\n sa=set(a)\n l=[a[i-1] for i in a]\n sb=set(l)\n if len(sa)>len(sb):\n ans=\"Truly Happy\"\n print(ans)", "# cook your dish here\ndef __starting_point():\n t = int(input())\n for q in range(t):\n n = int(input())\n l = list(map(int,input().split()))\n \n count = 0\n for i in range(n-1):\n for j in range(i+1,n):\n if l[i]!=l[j]:\n if l[l[i]-1]==l[l[j]-1]:\n count += 1\n break\n if count==0:\n print('Poor Chef')\n else :\n print('Truly Happy')\n\n__starting_point()", "for _ in range(int(input())):\n n=int(input())\n l=list(map(int,input().split()))\n ans=\"Poor Chef\"\n for i in range(n):\n for j in range(i+1,n):\n if l[i]==l[j]:\n if i+1 in l and j+1 in l:\n ans=\"Truly Happy\"\n print(ans)\n", "for _ in range(int(input())):\n a = int(input())\n array = list(map(int,input().split()))\n common = list()\n for x in array:\n if array.count(x)>1:\n common.append(x)\n \n if len(common)==0:\n print(\"Poor Chef\")\n continue\n \n ind = dict()\n flag = 0\n for x in common:\n if x not in ind:\n ind[x]=list()\n for y in range(len(array)):\n if array[y]==x:\n ind[x].append(y+1)\n lis = ind[x]\n for m in lis:\n for n in lis:\n if m!=n and m in array and n in array:\n print(\"Truly Happy\")\n flag = 1\n break\n if flag == 1:\n break\n if flag == 1:\n break\n \n else:\n if flag == 0:\n print(\"Poor Chef\") \n", "for _ in range(int(input())):\n a = int(input())\n array = list(map(int,input().split()))\n common = list()\n for x in array:\n if array.count(x)>1:\n common.append(x)\n \n if len(common)==0:\n print(\"Poor Chef\")\n continue\n \n ind = dict()\n for x in common:\n if x not in ind:\n ind[x]=list()\n for y in range(len(array)):\n if array[y]==x:\n ind[x].append(y+1)\n \n flag = 0\n for x in ind:\n lis = ind[x]\n for m in lis:\n for n in lis:\n if m!=n and m in array and n in array:\n print(\"Truly Happy\")\n flag = 1\n break\n if flag == 1:\n break\n if flag == 1:\n break\n else:\n if flag == 0:\n print(\"Poor Chef\")\n \n", "# cook your dish here\n\ndef solve(A,n):\n for i in range(n):\n for j in range(n):\n if i != j:\n if A[i] == A[j]:\n if i+1 in A and j+1 in A:\n return True\n return False\n\n\n\n \n\ntry:\n T = int(input())\n for l in range(T):\n \n n = int(input())\n path = [int(i) for i in input().strip().split(\" \")]\n if solve(path,n):\n print(\"Truly Happy\")\n else:\n print(\"Poor Chef\")\n \n \n \n \n \nexcept EOFError:\n pass\n\n \n \n", "# cook your dish here\nt = int(input())\nwhile t != 0:\n n = int(input())\n a = list(map(int, input().split()))[:n]\n happy = False \n for i in range(n-1):\n for j in range(i+1, n):\n if a[i] != a[j]:\n k, r = a[i], a[j]\n if a[k-1] == a[r-1]:\n happy = True\n break\n if happy == True:\n print('Truly Happy')\n else:\n print('Poor Chef')\n t -= 1", "try:\n t=int(input())\n for i in range(t):\n n=int(input())\n z=0\n a=[int(j) for j in input().split(\" \")]\n # print(a)\n for k in range(n-1):\n # print(\"a\")\n for x in range(k+1,n):\n #print(a[k],a[x])\n if a[k]!=a[x] :\n if a[a[k]-1]==a[a[x]-1] :\n print(\"Truly Happy\")\n # print(\"c\")\n z=1\n break\n if z==1:\n break\n \n if z==0:\n #print(\"e\")\n print(\"Poor Chef\")\n #print(\".................................\"\nexcept:\n pass", "# cook your dish here\nt = int(input())\nfor _ in range(t):\n N = int(input())\n dict1 = {}\n flag = False\n S = [int(x) for x in input().split()]\n for i in range(N):\n if S[i] in dict1.keys():\n dict1[S[i]].append(i+1)\n else:\n dict1[S[i]] = [i+1]\n for key,val in dict1.items():\n if len(val) == 1:\n continue\n count = 0\n for e in val:\n if e in dict1.keys():\n count += 1\n if count == 2:\n flag = True\n break\n if flag == True:\n break\n if flag == True:\n print(\"Truly Happy\")\n else:\n print(\"Poor Chef\")", "# cook your dish here\nt = int(input())\nfor h in range(t):\n l = int(input())\n li = list(map(int,input().split()))\n li.insert(0,0)\n status = True\n for i in range(1,len(li)):\n for j in range(1,len(li)):\n if i!=j and li[i]!=li[j]:\n if li[li[i]] == li[li[j]]:\n print(\"Truly Happy\")\n status = False\n break\n if not status:\n break\n if status:\n print(\"Poor Chef\")", "T = int(input())\nfor i in range(T):\n N = int(input())\n seq = [int(s) for s in input().split()]\n ans = 0\n for i in range(len(seq)):\n a = seq[i]\n c = seq[a-1]\n for j in range(i+1, len(seq)):\n b = seq[j]\n d = seq[b-1]\n if(a!=b and c==d):\n ans = 1\n break\n if(ans == 1):\n break\n if(ans == 1):\n print(\"Truly Happy\")\n else:\n print(\"Poor Chef\")", "t=int(input())\nwhile t>0:\n n=int(input())\n a=list(map(int,input().split(' ')))\n d={}\n k={}\n for i in a:\n k[i]=1\n flag=0\n for i in range(len(a)):\n if d.get(a[i],0)==0:\n d[a[i]]=[i+1]\n else:\n d[a[i]].append(i+1)\n \n for i in list(d.keys()):\n c=0\n for j in d[i]:\n if k.get(j,0)==1:\n c+=1\n if c>=2:\n flag=1\n break\n if flag==1:\n print('Truly Happy')\n else:\n print('Poor Chef')\n t-=1\n", "for _ in range(int(input())):\n n = int(input())\n arr = list(map(int,input().split()))\n A = set(arr)\n B = set(arr[i-1] for i in A)\n if A == B:\n print(\"Poor Chef\")\n else:\n print(\"Truly Happy\")", "for _ in range(int(input())):\n n = int(input())\n arr = list(map(int,input().split()))\n status = False\n if n == 1:\n print(\"Poor Chef\")\n else:\n for i in range(n):\n a = arr[i]\n for j in range(i+1,n):\n b = arr[j]\n if (a != b) and (arr[a-1] == arr[b-1]):\n status = True\n break\n if status == True:\n break\n if status == True:\n print(\"Truly Happy\")\n else:\n print(\"Poor Chef\")", "for _ in range(int(input())):\n n = int(input())\n arr = list(map(int,input().split()))\n status = False\n for i in range(n):\n a = arr[i]\n for j in range(i+1,n):\n b = arr[j]\n if (a != b) and (arr[a-1] == arr[b-1]):\n status = True\n break\n if status == True:\n break\n if status == True:\n print(\"Truly Happy\")\n else:\n print(\"Poor Chef\")", "from collections import defaultdict\nx=int(input())\nfor __ in range(x):\n n=int(input())\n a=list(map(int,input().split()))\n d=defaultdict(list)\n for i in range(n):\n d[a[i]].append(i)\n b=set(a)\n for i in b:\n c=0\n if len(d[i])>1:\n for j in d[i]:\n if len(d[j+1])>0:\n c+=1\n if c==2:\n break\n if c==2:\n break\n if c==2:\n print(\"Truly Happy\")\n else:\n print(\"Poor Chef\")", "from collections import defaultdict\nt=int(input())\nwhile t:\n t-=1\n n=int(input())\n a=list(map(int,input().split()))\n dd=defaultdict(list)\n boo=False\n se=set(a)\n for i in range(len(a)):\n if (a[i] in se and a[a[i]-1] in dd ):\n for j in dd[a[a[i]-1]]:\n if a[i]!=j:\n boo=True\n break\n if boo:\n break\n \n\n dd[a[a[i]-1]].append(a[i])\n if boo:\n print('Truly Happy')\n else:\n print('Poor Chef')", "# cook your dish here\nfor i in range(int(input())):\n c=0\n n=int(input())\n a=list(map(int,input().split()))\n for i in range(len(a)):\n for j in range(len(a)):\n try:\n if a[i]!=a[j] and a[a[i]-1]==a[a[j]-1]:\n c+=1\n else:\n pass\n except:\n pass\n if c==0:\n print('Poor Chef')\n else:\n print('Truly Happy')"]	{"inputs": [["4", "4", "1 1 2 3", "4", "2 1 3 3", "5", "5 4 4 3 1", "5", "3 2 1 1 4"]], "outputs": [["Truly Happy", "Poor Chef", "Poor Chef", "Truly Happy"]]}	INTERVIEW	PYTHON3	CODECHEF	9,820
df7d25501a1e69a3946ebf9fd10c648f	UNKNOWN	Lots of geeky customers visit our chef's restaurant everyday. So, when asked to fill the feedback form, these customers represent the feedback using a binary string (i.e a string that contains only characters '0' and '1'. Now since chef is not that great in deciphering binary strings, he has decided the following criteria to classify the feedback as Good or Bad : If the string contains the substring "010" or "101", then the feedback is Good, else it is Bad. Note that, to be Good it is not necessary to have both of them as substring. So given some binary strings, you need to output whether according to the chef, the strings are Good or Bad. -----Input----- The first line contains an integer T denoting the number of feedbacks. Each of the next T lines contains a string composed of only '0' and '1'. -----Output----- For every test case, print in a single line Good or Bad as per the Chef's method of classification. -----Constraints----- - 1 ≤ T ≤ 100 - 1 ≤ \|S\| ≤ 105 Sum of length of all strings in one test file will not exceed 6*106. -----Example----- Input: 2 11111110 10101010101010 Output: Bad Good -----Explanation----- Example case 1. The string doesn't contain 010 or 101 as substrings. Example case 2. The string contains both 010 and 101 as substrings.	["# cook your dish here\nt=int(input())\nfor i in range(t):\n s=input()\n fl=-1\n n=len(s)\n for i in range(n-2):\n if(s[i:i+3]==\"010\" or s[i:i+3]==\"101\"):\n fl=0\n print(\"Good\")\n break\n\n if(fl==-1):\n print(\"Bad\")\n", "# cook your dish here\nt=int(input())\nfor i in range(t):\n s=input()\n fl=-1\n n=len(s)\n for i in range(n-2):\n if(s[i:i+3]==\"010\" or s[i:i+3]==\"101\"):\n fl=0\n print(\"Good\")\n break\n\n if(fl==-1):\n print(\"Bad\")\n", "for _ in range(int(input())):\n input_1 = str(input())\n str1 = \"010\"\n str2 = \"101\"\n \n if input_1.find(str1) == -1 and input_1.find(str2)== -1:\n print(\"Bad\")\n else: \n print(\"Good\")", "# cook your dish here\nfor _ in range(int(input())):\n bstr = input()\n # if '101' in bstr or '010' in bstr:\n # print(\"Good\")\n # else:\n # print(\"Bad\")\n opval = \"Bad\"\n for i in range(len(bstr)-2):\n if bstr[i] == bstr[i+2] and bstr[i]!=bstr[i+1]:\n opval = \"Good\"\n break\n print(opval)", "# cook your dish here\nfor _ in range(int(input())):\n bstr = input()\n if '101' in bstr or '010' in bstr:\n print(\"Good\")\n else:\n print(\"Bad\")", "# cook y\nfor i in range(int(input())):\n s=input()\n p=\"Bad\"\n for i in range(len(s)-2):\n if '0' in s[i] and '1' in s[i+1] and '0' in s[i+2]:\n p=\"Good\"\n if '1' in s[i] and '0' in s[i+1] and '1' in s[i+2]:\n p=\"Good\"\n print(p)\n \n", "# cook your dish here\nt = int(input())\nfor _ in range(t):\n s = input()\n if ((\"010\" in s) or (\"101\" in s)):\n print(\"Good\")\n else:\n print(\"Bad\")\n", "for _ in range(int(input())):\n s=input()\n if s.count('101')>0 or s.count('010')>0:\n print('Good')\n else:\n print('Bad')", "for _ in range(int(input())):\n s=input()\n if s.count('101')>0 or s.count('010')>0:\n print('Good')\n else:\n print('Bad')", "t=int(input())\nwhile t:\n t=t-1\n n=input()\n if (\"101\" in n or \"010\" in n):\n print(\"Good\")\n else:\n print(\"Bad\")\n", "# cook your dish here\n\nfor i in range(int(input().strip())):\n binst = input()\n result = \"Bad\"\n for i in range(len(binst)-2):\n st = binst[i:i+3]\n if st=='101' or st=='010':\n result = \"Good\"\n break\n\n print(result)", "\nT = int(input())\n\nfor _ in range(T):\n string = input()\n if \"101\" in string or \"010\" in string:\n print(\"Good\")\n else:\n print(\"Bad\")", "# binary string as the feedback form\n# chef classifies each feedback as GOOD or BACK\nt=int(input())\nfor i in range(t):\n s=input()\n ans=False\n for j in range(len(s)-2):\n if(s[j]=='0'):\n if(s[j+1]=='1'):\n if(s[j+2]=='0'):\n ans=True\n break\n else:\n if(s[j+1]=='0'):\n if(s[j+2]=='1'):\n ans=True\n break\n if(ans):\n print(\"Good\")\n else:\n print(\"Bad\")", "# binary string as the feedback form\n# chef classifies each feedback as GOOD or BACK\nt=int(input())\nfor i in range(t):\n s=input()\n ans=False\n for j in range(len(s)-2):\n if(s[j]=='0'):\n if(s[j+1]=='1'):\n if(s[j+2]=='0'):\n ans=True\n break\n else:\n if(s[j+1]=='0'):\n if(s[j+2]=='1'):\n ans=True\n break\n if(ans):\n print(\"Good\")\n else:\n print(\"Bad\")", "t = int(input())\nfor _ in range(t):\n n = input()\n if \"010\" in n:\n print(\"Good\")\n elif \"101\" in n:\n print(\"Good\")\n else:\n print(\"Bad\")\n\n", "# cook your dish here\nfor i in range(int(input())):\n s = input()\n if '101' in s:\n print(\"Good\")\n elif '010' in s:\n print(\"Good\")\n else:\n print(\"Bad\")", "for _ in range(int(input())):\n s=input()\n if '101' in s:\n print(\"Good\")\n elif '010' in s:\n print(\"Good\")\n else:\n print(\"Bad\")", "for _ in range(int(input())):\n s = input()\n if \"010\" in s or \"101\" in s:\n print(\"Good\")\n else: \n print(\"Bad\")", "for _ in range(int(input())):\n i='101'\n j='010'\n n=input()\n if i in n or j in n:\n print('Good')\n else:\n print('Bad')", "n=int(input())\nfor i in range(n):\n s=input()\n if \"010\" in s or \"101\" in s:\n print(\"Good\")\n else:\n print(\"Bad\")", "# cook your dish here\nfor _ in range(int(input())):\n n=input()\n good=['010','101']\n t=False\n for x in good:\n if x in n:\n print(\"Good\")\n t=True\n break\n if not t:\n print(\"Bad\")\n", "# cook your dish here\nfor _ in range(int(input())):\n n=input()\n good=['010','101']\n t=False\n for x in good:\n if x in n:\n print(\"Good\")\n t=True\n break\n if not t:\n print(\"Bad\")\n \n", "# cook your dish here\nt=int(input())\nwhile t>0:\n s=input()\n n=len(s)\n c=s.find('101',0,n)+s.find('010',0,n)\n if c==-2:\n print('Bad')\n else :\n print('Good')\n t=t-1\n", "for _ in range(int(input())):\n s = input()\n flag = False\n if not s.find(\"101\")==-1:\n flag = True\n elif not s.find(\"010\")==-1:\n flag = True\n if(flag):\n print(\"Good\")\n else:\n print(\"Bad\")"]	{"inputs": [["2", "11111110", "10101010101010"]], "outputs": [["Bad", "Good"]]}	INTERVIEW	PYTHON3	CODECHEF	4,808
1c4a1077793786c810bfcb74feb802fc	UNKNOWN	-----Problem----- Nikki's latest work is writing a story of letters. However, she finds writing story so boring that, after working for three hours, she realized that all she has written are M long words consisting entirely of letters A and B. Having accepted that she will never finish the story in time, Nikki has decided to at least have some fun with it by counting bubbly words. Now Nikki is connecting pairs of identical letters (A with A, B with B) by drawing lines above the word. A given word is bubbly if each letter can be connected to exactly one other letter in such a way that no two lines intersect. So here is your task. Help Nikki count how many words are bubbly. -----Input----- - The first line of input contains the positive integer M, the number of words written down by Nikki. - Each of the following M lines contains a single word consisting of letters A and B, with length between 2 and 10^5, inclusive. The sum of lengths of all words doesn't exceed 10^6. -----Output----- The first and only line of output must contain the number of bubbly words. -----Constraints----- - 1 ≤ M ≤ 100 -----Sample Input----- 3 ABAB AABB ABBA -----Sample Output----- 2 -----Explanation----- - ABAB - It is not bubbly as A(indexed 1) will connect to A(indexed 3) by a line and when we try to connect B(indexed 2) with B(indexed 4) by a line then it will intersect with the line b/w A and A. - AABB - It is bubbly as line b/w A and A will not intersect with the line b/w B and B. - ABBA -It is also bubbly as lines will not intersect. We can draw line b/w A and A above the line b/w B and B. p { text-align:justify }	["def check(s):\n arr=[s[0]]\n l=len(s)\n f1=0\n for i in range(1,l):\n if arr==[]: arr.append(s[i])\n elif arr[-1]!=s[i]:arr.append(s[i])\n else: del arr[-1]\n if arr==[]: return True\n else: return False\n \ncount = 0\nfor t in range(eval(input())):\n s=input().strip()\n if check(s): count+=1\nprint(count)", "count = 0\nfor t in range(int(input())):\n l = []\n s = input()\n for c in s:\n l.append(c)\n if (len(l)==1):\n continue\n else:\n if (l[-1]==l[-2]):\n l = l[:-2]\n if (len(l)==0):\n count+=1\nprint(count)"]	{"inputs": [["3", "ABAB", "AABB", "ABBA"]], "outputs": [["2"]]}	INTERVIEW	PYTHON3	CODECHEF	534
055a58070b55400df17380a944630cfa	UNKNOWN	Chef would like go shopping to buy ingredients for his special dish. The local grocery store has some special discount offers. If you want to buy some set of ingredients you will pay for all ingredients except the cheapest one. Chef would like to spend as little money as possible. You have to help him. :) The store is pretty small and stocks only one unit of each ingredients. Opposite each ingredient is a hanging price tag corresponding to it. The salesman walked away for a minute, giving Chef an opportunity to swap some price tags. He would like to swap some tags to minimize his purchase cost. -----Input----- The first line of the input contains an integer T denoting the number of test cases. The description of T test cases follows. The first line of each test case contains a single integer N denoting the number of ingredients Chef needs to buy. The second line contains N space-separated integers A1, A2, ... , AN denoting the value written on the price tags opposite the needed ingredients. The third line contains a single integer M denoting the number of special offers. The following M lines lists inventory of special offers, one offer per line. Each line contains an integer Ci followed by Ci integers denoting the indices of ingredients constituting the ith discount offer. -----Output----- For each test case, output a single line containing the minimal purchase cost. -----Constraints----- - T ≤ 5 - 1 ≤ N ≤ 15 - 1 ≤ Ai ≤ 106 - 0 ≤ M ≤ 2N-1 - 2 ≤ Ci ≤ N - Subtask 1 (15 points): 1 ≤ N ≤ 5 - Subtask 2 (25 points): 1 ≤ N ≤ 10 - Subtask 3 (60 points): 1 ≤ N ≤ 15 -----Example----- Input: 1 4 1 2 3 4 3 2 1 2 2 3 4 3 1 2 3 Output: 6	["from itertools import permutations as p\ndef disc(a,b):\n for ai in a:\n for bi in b:\n if ai==bi:\n return False\n return True\n\nfor i in range(eval(input())):\n n = eval(input())\n arr = list(map(int,input().split()))\n perms = list(p(arr))\n m = eval(input())\n offer = {}\n for i in range(m):\n dup = list(map(int,input().split()))\n try:\n offer[dup[0]].append(dup[1:])\n except:\n offer[dup[0]] = [dup[1:]]\n ans = sum(arr)\n if n==1:\n print(ans)\n elif n==2:\n try:\n if len(offer[2])>=1:\n ans -= min(arr)\n except:\n pass\n print(ans)\n elif n==3:\n try:\n if len(offer[3])>=1:\n ans -= min(arr)\n except:\n pass\n try:\n if len(offer[2])>=1:\n value = 9999999999\n for item in perms:\n cur = 0\n cur += item[0]\n cur += max(item[1],item[2])\n if cur<value:\n value = cur\n if value<ans:\n ans = value\n except:\n pass\n print(ans)\n elif n==4:\n try:\n if len(offer[4])>=1:\n ans -= min(arr)\n except:\n pass\n #print ans\n try:\n if len(offer[3])>=1:\n value = 9999999999\n for item in perms:\n cur = 0\n cur = sum(item)\n cur -= min(item[1],item[2],item[3])\n if cur<value:\n value = cur\n if value<ans:\n ans = value\n except:\n pass\n #print ans\n try:\n if len(offer[2])>=1:\n value = 9999999999\n for item in perms:\n cur = 0\n cur = sum(item)\n cur -= min(item[1],item[2])\n if cur<value:\n value = cur\n if value<ans:\n ans = value\n #print ans\n #print offer[2]\n if len(offer[2])>=2:\n flg = False\n end = len(offer[2])\n for i in range(end):\n for j in range(i+1,end):\n if disc(offer[2][i],offer[2][j]):\n flg = True\n break\n #print flg\n if flg:\n value = 9999999999\n for item in perms:\n cur = 0\n cur = sum(item)\n cur -= min(item[1],item[0])\n cur -= min(item[2],item[3])\n if cur<value:\n value = cur\n if value<ans:\n ans = value\n except:\n pass\n print(ans)\n elif n==5:\n try:\n if len(offer[5])>=1:\n ans -= min(arr)\n except:\n pass\n try:\n if len(offer[4])>=1:\n value = 9999999999\n for item in perms:\n cur = 0\n cur = sum(item)\n cur -= min(item[1],item[2],item[3],item[4])\n if cur<value:\n value = cur\n if value<ans:\n ans = value\n except:\n pass\n try:\n if len(offer[2])>=1:\n value = 9999999999\n for item in perms:\n cur = 0\n cur = sum(item)\n cur -= min(item[1],item[2])\n if cur<value:\n value = cur\n if value<ans:\n ans = value\n if len(offer[2])>=2:\n flg = False\n end = len(offer[2])\n for i in range(end):\n for j in range(i+1,end):\n if disc(offer[2][i],offer[2][j]):\n flg = True\n break\n if flg:\n value = 9999999999\n for item in perms:\n cur = 0\n cur = sum(item)\n cur -= min(item[1],item[0])\n cur -= min(item[2],item[3])\n if cur<value:\n value = cur\n if value<ans:\n ans = value\n except:\n pass\n try:\n if len(offer[3])>=1:\n value = 9999999999\n for item in perms:\n cur = 0\n cur = sum(item)\n cur -= min(item[1],item[2],item[3])\n if cur<value:\n value = cur\n if value<ans:\n ans = value\n except:\n pass\n try:\n if len(offer[3])>=1 and len(offer[2])>=1:\n flg = False\n for i in offer[3]:\n for j in offer[2]:\n if disc(i,j):\n flg = True\n break\n if flg:\n value = 9999999999\n for item in perms:\n cur = 0\n cur = sum(item)\n cur -= min(item[1],item[0])\n cur -= min(item[2],item[3],item[4])\n if cur<value:\n value = cur\n if value<ans:\n ans = value\n except:\n pass\n print(ans)\n\n\n"]	{"inputs": [["1", "4", "1 2 3 4", "3", "2 1 2", "2 3 4", "3 1 2 3"]], "outputs": [["6"]]}	INTERVIEW	PYTHON3	CODECHEF	3,826
8a12d8c60725598209d8d7d89f50da1e	UNKNOWN	Nexus 4.O is going to be organized by ASME, GLA University. Shubhanshu, Head of Finance Team is working for it. He has $N$ number of bills of different values as $a$$1$,$ a$$2$, $a$$3$…$a$$n$. He is interested in a game in which one has to do the addition of the bills. But due to privacy concerns, he cannot share the details with others. He can only trust his best friend Avani with such a confidential thing. So, he asked her to play this game. Rules of the game : - Avani needs to answer $Q$ queries. - Every $Q$$i$ query has 2 values $X$$i$ and $Y$$i$. - Avani needs to find the sum of the values between $X$$i$ and $Y$$i$ (inclusive). So, you need to help Avani in answering the $Q$ queries -----Input:----- - First line will contain $T$, number of testcases. Then the testcases follow. - The first line of each test case contains the value $N$ and $Q$. - The second line of each test case contains the $N$ space-separated values as $a$$1$,$ a$$2$, $a$$3$…$a$$n$. - The next line of each test case containing $Q$ query with $X$$i$ and $Y$$i$. -----Output:----- For each test case, Print the total amount between $X$$i$ and $Y$$i$ for $Q$ number of queries. -----Constraints----- - $1 \leq T \leq 100$ - $1 \leq N \leq 10^5$ - $1 \leq Q \leq 10^5$ - $1 \leq a$$i$$ \leq 10^9$ -----Subtasks (25 points) :----- - $1 \leq N \leq 10^2$. - $1 \leq Q \leq 10^2$. - $1 \leq a$$i$$ \leq 10^5$. -----Subtasks (25 points) :----- - $1 \leq N \leq 10^3$. - $1 \leq Q \leq 10^3$. - $1 \leq a$$i$$ \leq 10^5$. -----Subtasks (50 points) :----- - $Original Constraints$. -----Sample Input:----- 1 8 3 1 2 3 4 5 6 7 8 2 3 1 6 5 8 -----Sample Output:----- 5 21 26 -----EXPLANATION:----- $Q$$1$ : (2,3) 2+3=5 $Q$$2$ : (1,6) 1+2+3+4+5+6=21 $Q$$3$ : (5,8) 5+6+7+8=26	["\nt=int(input())\nfor i in range(t):\n l=list(map(int,input().split(' ')))\n a=l[0]\n b=l[1]\n \n l1=list(map(int,input().split(' ')))\n for i in range(b):\n l2=list(map(int,input().split(' ')))\n a1=l2[0]\n b1=l2[1]\n su=0\n for j in range(a1-1,b1):\n su=(su+l1[j])%1000000000\n print(su) ", "\nt=int(input())\nfor i in range(t):\n l=list(map(int,input().split(' ')))\n a=l[0]\n b=l[1]\n \n l1=list(map(int,input().split(' ')))\n for i in range(b):\n l2=list(map(int,input().split(' ')))\n a1=l2[0]\n b1=l2[1]\n su=0\n for j in range(a1-1,b1):\n su=(su+l1[j])%1000000000\n print(su) ", "tc=int(input())\nfor i in range(0,tc):\n n,q=list(map(int,input().split()))\n l=[]\n l=list(map(int,input().split()))\n for j in range(0,q):\n x,y=list(map(int,input().split()))\n sum=0\n for k in range(x,y+1):\n sum=sum+l[k-1]\n print(sum) \n", "import math\nt=int(input())\nfor ii in range(t):\n n,q=[int(x) for x in input().split()]\n arr=[int(x) for x in input().split()]\n pre=[]\n s=0\n for i in arr:\n s+=i\n pre.append(s)\n for i in range(q):\n l,r=[int(x) for x in input().split()]\n l-=1\n r-=1\n if(l==0):\n print(pre[r])\n else:\n print(pre[r]-pre[l-1])\n", "# cook your dish here\nfor _ in range(int(input())):\n N,Q=input().split()\n L=list(map(int,input().split()))\n for i in range(int(Q)):\n X,Y=map(int,input().split())\n s=0\n for i in range(X-1,Y):\n s+=L[i]\n print(s)", "# cook your dish here\nfor _ in range(int(input())):\n N,Q=list(map(int,input().split()))\n L=list(map(int,input().split()))\n for i in range(Q):\n X,Y=list(map(int,input().split()))\n print(sum(L[X-1:Y]))\n", "\nt=int(input())\nfor i in range(t):\n l=list(map(int,input().split(' ')))\n a=l[0]\n b=l[1]\n \n l1=list(map(int,input().split(' ')))\n for i in range(b):\n l2=list(map(int,input().split(' ')))\n a1=l2[0]\n b1=l2[1]\n su=0\n for j in range(a1-1,b1):\n su=(su+l1[j])%1000000000\n print(su) ", "# cook your dish here\nn=int(input())\nfor i in range(n):\n a,b=input().split()\n b=int(b)\n l=list(map(int,input().split()))\n x=[0]\n for j in l: \n x.append(x[-1]+j)\n for j in range(b):\n e,f=input().split()\n print(x[int(f)]-x[int(e)-1])\n", "\nfor case in range(int(input())):\n n, q = list(map(int, input().split()))\n arr = list(map(int, input().split()))\n\n dic = {0:0}\n for i in range(1,n+1):\n dic[i] = dic[i-1] + arr[i-1]\n \n for que in range(q):\n xi, yi = list(map(int, input().split()))\n\n print(dic[yi] - dic[xi-1])\n", "T = int(input())\nfor i in range(T):\n a = input().split(\" \")\n N = int(a[0])\n Q = int(a[1])\n if(N>=1 and N<=100000 and Q>=1 and Q<=100000):\n b = input().split(\" \")\n l = list(map(int,b))\n l1 = []\n for k in range(Q):\n q = input().split(\" \")\n l1.extend(q)\n \n l2 = list(map(int,l1))\n m = 0\n while(m<len(l2)-1):\n s = 0\n c = l2[m]\n d = l2[m+1]\n for t in range(c-1,d):\n s = s + l[t] \n print(s)\n m = m+2\n", "T=int(input())\nwhile(T!=0):\n n,q=[int(x) for x in input().split(' ')]\n N=[int(x) for x in input().split(' ')]\n while(q!=0):\n s=0\n x,y=[int(x) for x in input().split(' ')]\n for i in range(x-1,y):\n s=s+N[i]\n print(s)\n q-=1\n T-=1", "# cook your dish here\nfor u in range(int(input())):\n n,k=map(int,input().split())\n l=list(map(int,input().split()))\n for q in range(k):\n x,y=map(int,input().split())\n print(sum(l[x-1:y]))", "# cook your dish here\nfor u in range(int(input())):\n n,k=list(map(int,input().split()))\n l=list(map(int,input().split()))\n for q in range(k):\n x,y=list(map(int,input().split()))\n s=0\n for i in range(x-1,y):\n s=s+l[i]\n\n print(s)\n", "# cook your dish here\nt=int(input())\nwhile t>0:\n t-=1\n n,tt=map(int,input().split())\n #print(tt)\n l=list(map(int,input().split()))\n while tt>0:\n a,b=map(int,input().split())\n print(sum(l[a-1:b]))\n tt -= 1", "for _ in range(int(input())):\n n, q = map(int, input().split())\n a = list(map(int, input().split()))\n\n p = [0]\n\n for i in a:\n p.append(p[-1] + i)\n\n for _ in range(q):\n x, y = map(int, input().split())\n\n print(p[y] - p[x - 1])", "# cook your dish here\nt=int(input())\nfor i in range(t):\n l=list(map(int,input().split(' ')))\n a=l[0]\n b=l[1]\n \n l1=list(map(int,input().split(' ')))\n for i in range(b):\n l2=list(map(int,input().split(' ')))\n a1=l2[0]\n b1=l2[1]\n print(sum(l1[a1-1:b1]))\n", "# cook your dish here\nn=int(input())\nfor i in range(n):\n a,b=input().split()\n b=int(b)\n l=list(map(int,input().split()))\n for j in range(b):\n x,y=input().split()\n x=int(x)-1\n y=int(y)\n print(sum(l[x:y]))\n", "# cook your dish here\nnoofcases=int(input())\nfor _ in range(noofcases):\n numqui=input().split()\n data=list(map(int,input().split()))\n for _ in range(int(numqui[1])):\n sum=0\n startstop=list(map(int,input().split()))\n for j in range(startstop[0]-1,startstop[1]):\n sum+=data[j]\n print(sum)", "# cook your dish here\nT = int(input())\nfor i in range(T):\n N,Q = map(int,input().split())\n lis = list(map(int,input().split()))\n cumSum = [0]\n for j in lis:\n cumSum.append(cumSum[-1]+j)\n for j in range(Q):\n x,y = map(int,input().split())\n print(cumSum[y]-cumSum[x-1])", "for _ in range(int(input())):\n n,q=map(int,input().split())\n arr=list(map(int,input().split()))\n prefix_sum=[0]\n for i in range(n):\n prefix_sum.append(prefix_sum[-1]+arr[i])\n for i in range(q):\n x,y=map(int,input().split())\n print(prefix_sum[y]-prefix_sum[x-1])", "n=int(input())\nwhile(n>0):\n l=list(map(int,input().split()))\n l1=list(map(int,input().split()))\n while(l[1]>0):\n l2=list(map(int,input().split()))\n s=0\n for i in range(l2[0]-1,l2[1]):\n s=s+l1[i]\n print(s)\n l[1]=l[1]-1\n n=n-1\n", "# cook your dish here\ndef program():\n n,q=map(int, input().split())\n l=list(map(int, input().split()))\n\n for i in range(q):\n a,b=map(int, input().split())\n print(sum(l[a-1:b]))\n\n\nt=int(input())\nfor i in range(t):\n program()"]	{"inputs": [["1", "8 3", "1 2 3 4 5 6 7 8", "2 3", "1 6", "5 8"]], "outputs": [["5", "21", "26"]]}	INTERVIEW	PYTHON3	CODECHEF	5,951

f39e919597e397681bb961672e4542e6

UNKNOWN

Almir had a small sequence $A_1, A_2, \ldots, A_N$. He decided to make $K$ copies of this sequence and concatenate them, forming a sequence $X_1, X_2, \ldots, X_{NK}$; for each valid $i$ and $j$ ($0 \le j < K$), $X_{j \cdot N + i} = A_i$. For example, if $A = (1, 2, 3)$ and $K = 4$, the final sequence is $X = (1, 2, 3, 1, 2, 3, 1, 2, 3, 1, 2, 3)$. A pair $(i, j)$, where $1 \le i < j \le N$, is an inversion if $X_i > X_j$. Find the number of inversions in the final sequence $X$. -----Input----- - The first line of the input contains a single integer $T$ denoting the number of test cases. The description of $T$ test cases follows. - The first line of each test case contains two space-separated integers $N$ and $K$. - The second line contains $N$ space-separated integers $A_1, A_2, \ldots, A_N$. -----Output----- For each test case, print a single line containing one integer ― the number of inversions in the sequence $X$. -----Constraints----- - $1 \le T \le 1,000$ - $1 \le N \le 100$ - $1 \le K \le 10^6$ - $1 \le A_i \le 10^9$ for each valid $i$ -----Subtasks----- Subtask #1 (100 points): original constraints -----Example Input----- 2 3 3 2 1 3 4 100 99 2 1000 24 -----Example Output----- 12 30000

["# cook your dish here\ndef count(k,n,m):\n sum1=(m*(m+1))//2\n sum2=(m*(m-1))//2\n ct=0\n for i in range(n):\n for j in range(n):\n if i<j and k[i]>k[j]:\n ct+=sum1\n elif jk[j]:\n ct+=sum2\n return ct\n\ntest=int(input())\nfor _ in range(test):\n n,m=map(int,input().split())\n k=list(map(int,input().split()))\n print(count(k,n,m))\n", "# cook your dish here\n# cook your dish here\ndef sree(k, n, m):\n sum1 = (m*(m+1))//2\n sum2 = (m*(m-1))//2\n shanth = 0\n for i in range(n):\n count = 0\n for j in range(n):\n if i < j and k[i] > k[j]:\n shanth += sum1\n elif j k[j]:\n shanth += sum2\n return shanth\n\n\nt = int(input())\nfor _ in range(t):\n n, m = map(int, input().split())\n k = list(map(int, input().split()))\n print(sree(k, n, m))\n", "# cook your dish here\ndef sree(k, n, m):\n sum1 = (m*(m+1))//2\n sum2 = (m*(m-1))//2\n shanth = 0\n for i in range(n):\n count = 0\n for j in range(n):\n if i < j and k[i] > k[j]:\n shanth += sum1\n elif j k[j]:\n shanth += sum2\n return shanth\n\n\nt = int(input())\nfor _ in range(t):\n n, m = map(int, input().split())\n k = list(map(int, input().split()))\n print(sree(k, n, m))\n", "# cook your dish here\ndef sree(k, n, m):\n sum1 = (m*(m+1))//2\n sum2 = (m*(m-1))//2\n shanth = 0\n for i in range(n):\n count = 0\n for j in range(n):\n if i < j and k[i] > k[j]:\n shanth += sum1\n elif j k[j]:\n shanth += sum2\n return shanth\n\n\nt = int(input())\nfor _ in range(t):\n n, m = map(int, input().split())\n k = list(map(int, input().split()))\n print(sree(k, n, m))\n", "import sys\r\nimport math\r\nfrom collections import defaultdict\r\n\r\ndef fout(s, end='\\n'): sys.stdout.write(str(s) + end)\r\ndef fin(): return sys.stdin.readline().strip()\r\nmod = pow(10, 9)+7\r\nt = int(fin())\r\nwhile t>0:\r\n t -= 1\r\n n, k = map(int, fin().split())\r\n a = [int(x) for x in fin().split()]\r\n ans = 0\r\n for i in range(n):\r\n c = 0\r\n for j in range(i):\r\n if a[i] < a[j]:\r\n c += 1\r\n ans += k*(c)\r\n for j in range(i+1, n):\r\n if a[j] > a[i]:\r\n c += 1\r\n ans += k*(k-1)*(c)//2\r\n print(ans)\r\n\r\n", "# cook your dish here\nfor _ in range(int(input())):\n n, k = map(int, input().split())\n arr = list(map(int, input().split()))\n x, suffix = 0, 0\n for i, a_i in enumerate(arr):\n for j, a_j in enumerate(arr):\n if a_i > a_j: x += 1\n if j > i:\n if a_i > a_j: suffix += 1\n print(x*( (k*(k-1))//2 ) + suffix*k)", "# cook your dish here\nfor _ in range(int(input())):\n n, k = map(int, input().split())\n arr = list(map(int, input().split()))\n x, suffix = 0, 0\n for i in range(n):\n for j in range(n):\n if arr[i] > arr[j]: x += 1\n if j > i:\n if arr[i] > arr[j]: suffix += 1\n print(x*( (k*(k-1))//2 ) + suffix*k)", "# cook your dish here\nfor _ in range(int(eval(input()))):\n n, k = list(map(int, input().split()))\n arr = list(map(int, input().split()))\n x, suffix = 0, 0\n for i, a_i in enumerate(arr):\n for a_j in arr:\n if a_i > a_j: x += 1\n for j in range(i+1, n):\n if a_i > arr[j]: suffix += 1\n \n ans = x*( (k*(k-1))//2 ) + suffix*k\n print(ans)", "from math import *\r\nfrom collections import *\r\nfrom itertools import *\r\nfrom bisect import *\r\nfrom heapq import *\r\nfrom operator import *\r\nfrom sys import *\r\nsetrecursionlimit(1000000)\r\nd=defaultdict(lambda:0,{})\r\ndef io():\r\n return map(int,input().split())\r\ndef op():\r\n return list(map(int,input().split()))\r\ndef o():\r\n return int(input())\r\ndef r(x):\r\n if type(x)==int:\r\n return range(x)\r\n else:return range(len(x))\r\ndef kl(con,x=0):\r\n if x==0:print('Yes') if con else print('No')\r\n elif x==1:print('yes') if con else print('no')\r\n elif x==2:print('YES') if con else print('NO')\r\nMOD = 1000000007\r\nMAX=float('inf')\r\nMIN=-float('inf')\r\np=input\r\nfor _ in r(o()):\r\n n,k=io()\r\n l=op()\r\n ans=0\r\n for i in r(l):\r\n for j in r(l):\r\n if l[i]>l[j]:\r\n if i>j:\r\n ans+=k*(k-1)/2\r\n elif i<j:\r\n ans+=k*(k+1)/2\r\n print(int(ans))\r\n\r\n", "t = int(input())\r\nfor jack in range(t):\r\n n, k = map(int, input().split())\r\n a = list(map(int, input().split()))\r\n r1 = 0\r\n for i in range(n - 1):\r\n m = 0\r\n for j in range(i + 1, n):\r\n if a[i] > a[j]:\r\n m += 1\r\n r1 += m\r\n a.sort()\r\n last, r2 = 0, 0\r\n for i in range(n):\r\n if a[i] != a[i - 1]:\r\n r2 += i\r\n last = i\r\n else:\r\n r2 += last\r\n r = r1 * k + (k * (k - 1) * r2) // 2\r\n print(r)", "for i in range(int(input())):\n n,k=map(int,input().split())\n s,a,l = 0,0,list(map(int,input().split()))\n l2=2*l\n for i in range(n-1):\n for j in range(i+1,n):\n if(l[i]>l[j]):a+=1\n for i in range(n):\n for j in range(n,2*n):\n if(l2[i]>l2[j]):s+=1\n print(((k*(k-1))//2)*s+k*a)", "# cook your dish here\nfor i in range(int(input())):\n n,k=map(int,input().split())\n s=0\n a=0\n l=list(map(int,input().split()))\n l2=2*l\n for i in range(n-1):\n for j in range(i+1,n):\n if(l[i]>l[j]):\n a+=1\n for i in range(n):\n for j in range(n,2*n):\n if(l2[i]>l2[j]):\n s+=1\n print(((k*(k-1))//2)*s+k*a)", "t = int(input())\nfor _ in range(t):\n n, rep = map(int, input().split())\n a = list(map(int, input().split()))\n ans = 0\n for i in range(len(a)):\n l = 0\n r = 0\n for j in range(i, -1, -1):\n if(a[j] < a[i]):\n l += 1\n for j in range(i, n, 1):\n if(a[j] < a[i]):\n r += 1\n tot = l + r\n lt = tot * (rep - 1) + r\n ans += (rep / 2.0) * (r + lt)\n print(int(ans))\n \n \n ", "for T in range(int(input())):\n N, K = map(int, input().split())\n A = list(map(int, input().split()))\n C = [0, 0]\n for Z in range(2):\n L = N * (Z + 1)\n A *= Z + 1\n for I in range(L-1):\n for J in range(I+1, L):\n if A[I] > A[J]:\n C[Z] += 1\n print(C[0] + (K - 1) * (C[1] + (K - 1) * (C[1] - 2 * C[0])) // 2)", "t = int(input())\r\nfor _ in range(t):\r\n n, k = map(int, input().split())\r\n num = list(map(int, input().split()))\r\n sum = 0\r\n for i in range(1, n+1):\r\n c = num[i-1]\r\n count_for = 0\r\n count_bac = 0\r\n for j in range(i, n):\r\n if num[j] < c:\r\n count_for += 1\r\n for j in range(i):\r\n if num[j] < c:\r\n count_bac += 1\r\n count = count_for + count_bac\r\n p = (k*(k+1))//2 * count\r\n p = p - k * count_bac\r\n sum = sum + p\r\n print(sum)\r\n\r\n", "t = int(input())\r\nfor _ in range(t):\r\n n, k = map(int, input().split())\r\n num = list(map(int, input().split()))\r\n sum = 0\r\n for i in range(1, n+1):\r\n c = num[i-1]\r\n count_for = 0\r\n count_bac = 0\r\n for j in range(i, n):\r\n if num[j] < c:\r\n count_for += 1\r\n for j in range(i):\r\n if num[j] < c:\r\n count_bac += 1\r\n count = count_for + count_bac\r\n p = (k*(k+1))//2 * count\r\n p = p - k * count_bac\r\n sum = sum + p\r\n print(sum)\r\n\r\n", "for _ in range(int(input())):\n N,K=map(int,input().split())\n ll=list(map(int,input().split()))\n c1=0\n c2=0\n for i in range(N):\n for j in range(i+1,N):\n if ll[i]>ll[j]:\n c1+=1\n for i in range(N):\n for j in range(N):\n if ll[i]>ll[j]:\n c2+=1\n print(c1*K+c2*K*(K-1)//2)", "# cook your dish here\nt=int(input())\nwhile(t):\n\tt-=1\n\tn,k=map(int,input().split())\n\tarr=list(map(int,input().split()))\n\tans=[0]*n\n\tans2=[0]*n\n\tfor i in range(n):\n\t\tfor j in range(n):\n\t\t\tif(i<j and arr[i]>arr[j]):\n\t\t\t\tans[i]=ans[i]+1\n\t\t\tif(i>j and arr[i]>arr[j]):\n\t\t\t\tans2[i]=ans2[i]+1\n\t#print(ans)\n\t#print(ans2)\t\n\tfor i in range(n):\n\t\tif(ans[i]!=0):\n\t\t\tans[i]=(ans[i]*k*(k+1))//2\n\t\tif(ans2[i]!=0):\n\t\t\tans2[i]=(ans2[i]*k*(k-1))//2\n\tprint(sum(ans)+sum(ans2))", "# cook your dish here\nt=int(eval(input()))\nfor i in range(t):\n inp = list(map(int,input().split()))\n n=inp[0]\n k=inp[1]\n inp = list(map(int,input().split()))\n before=[]\n after=[]\n ans=0\n for p in range(len(inp)):\n bef_count=0\n af_count=0\n for q in range(len(inp)):\n if(q>p and inp[q]<inp[p]):\n af_count+=1\n elif(q<p and inp[q]<inp[p]):\n bef_count+=1\n ans+=af_count*(k*(k+1))//2\n ans+=bef_count*(k*(k-1))//2\n print(ans)", "import sys\nfrom random import choice,randint\ninp=sys.stdin.readline\nout=sys.stdout.write\nflsh=sys.stdout.flush\n \nsys.setrecursionlimit(10**9)\ninf = 10**20\neps = 1.0 / 10**10\nmod = 10**9+7\ndd = [(-1,0),(0,1),(1,0),(0,-1)]\nddn = [(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]\n \ndef MI(): return map(int, inp().strip().split())\ndef LI(): return list(map(int, inp().strip().split()))\ndef LLI(): return [list(map(int, l.split())) for l in sys.stdin.readlines().strip()]\ndef LI_(): return [int(x)-1 for x in inp().strip().split()]\ndef LF(): return [float(x) for x in inp().strip().split()]\ndef LS(): return inp().strip().split()\ndef I(): return int(inp().strip())\ndef F(): return float(inp().strip())\ndef S(): return inp().strip()\ndef pf(s): return out(s+'\\n')\ndef JA(a, sep): return sep.join(map(str, a))\ndef JAA(a, s, t): return s.join(t.join(map(str, b)) for b in a)\n\ndef main():\n t = I()\n l = []\n for _ in range(t):\n n,k=MI()\n a=LI()\n lcf=[0]*n\n lce=[0]*n\n for i in range(n):\n cnt1,cnt2=0,0\n for j in a[:i]:\n if j<a[i]:\n cnt1+=1\n for j in a[i:]:\n if j<a[i]:\n cnt2+=1\n lcf[i]=cnt1\n lce[i]=cnt2\n ans=0\n for i in range(n):\n ans += lcf[i]*((k*(k-1))//2)\n for i in range(n):\n ans += lce[i]*((k*(k+1))//2)\n l.append(ans)\n\n for i in range(t):\n pf(str(l[i]))\n\ndef __starting_point():\n main()\n__starting_point()", "def main():\r\n t = int(input())\r\n \r\n while t>0:\r\n n,k = map(int,input().split())\r\n l = list(map(int,input().split()))\r\n \r\n ll = sorted(l)\r\n count1 = 0\r\n \r\n for i,val in enumerate(ll):\r\n count1 = count1 + ( i - (ll[:i]).count(val) )\r\n \r\n ans = 0\r\n \r\n ans = ans + ( count1 * k * (k-1) ) // 2\r\n \r\n count2 = 0\r\n \r\n for i,val in enumerate(l):\r\n temp = sum( 1 for j in l[i+1:] if j < val)\r\n count2 = count2 + ( temp )\r\n \r\n ans = ans + count2*k\r\n \r\n print(ans)\r\n t-=1\r\n \r\ndef __starting_point():\r\n main()\n__starting_point()", "#!/usr/bin/env python\r\nimport os\r\nimport sys\r\n\r\ndef main():\r\n t = int(input())\r\n \r\n while t>0:\r\n n,k = map(int,input().split())\r\n l = list(map(int,input().split()))\r\n \r\n ll = sorted(l)\r\n count1 = 0\r\n \r\n for i,val in enumerate(ll):\r\n count1 = count1 + ( i - (ll[:i]).count(val) )\r\n \r\n ans = 0\r\n \r\n ans = ans + ( count1 * k * (k-1) ) // 2\r\n \r\n count2 = 0\r\n \r\n for i,val in enumerate(l):\r\n temp = sum( 1 for j in l[i+1:] if j < val)\r\n count2 = count2 + ( temp )\r\n \r\n ans = ans + count2*k\r\n \r\n sys.stdout.write(str(ans)+\"\\n\")\r\n t-=1\r\n \r\ndef __starting_point():\r\n main()\n__starting_point()"]

{"inputs": [["2", "3 3", "2 1 3", "4 100", "99 2 1000 24", ""]], "outputs": [["12", "30000"]]}

INTERVIEW

PYTHON3

CODECHEF

12,758

69a52b017f9ef99f9140db9b27a850ac

UNKNOWN

Indian National Olympiad in Informatics 2015 A string is any nonempty sequence of 0s and 1s. Examples of strings are 00, 101, 111000, 1, 0, 01. The length of a string is the number of symbols in it. For example, the length of 111000 is 6. If u and v are strings, then uv is the string obtained by concatenating u and v. For example if u = 110 and v = 0010 then uv = 1100010. A string w is periodic if there exists a string v such that w = vn = vv · · · v (n times), for some n ≥ 2. Note that in this case the length of v is strictly less than that of w. For example, 110110 is periodic, because it is vv for v = 110. Given a positive integer N , find the number of strings of length N which are not periodic. Report the answer modulo M . The non-periodic strings of length 2 are 10 and 01. The non- periodic strings of length 3 are 001, 010, 011, 100, 101, and 110. -----Input format----- A single line, with two space-separated integers, N and M . -----Output format----- A single integer, the number of non-periodic strings of length N , modulo M . -----Test Data----- In all subtasks, 2 ≤ M ≤ 108. The testdata is grouped into 4 subtasks. Subtask 1 (10 marks) 1 ≤ N ≤ 4000. N is the product of two distinct prime numbers. Subtask 2 (20 marks) 1 ≤ N ≤ 4000. N is a power of a prime number. Subtask 3 (35 marks) 1 ≤ N ≤ 4000. Subtask 4 (35 marks) 1 ≤ N ≤ 150000. -----Example----- Here is the sample input and output corresponding to the example above: -----Sample input----- 3 176 -----Sample output----- 6 Note: Your program should not print anything other than what is specified in the output format. Please remove all diagnostic print statements before making your final submission. A program with extraneous output will be treated as incorrect!

["# cook your dish here\r\ndef offset(l, flag):\r\n x = 0\r\n # print(l)\r\n for i in range(1, len(l)):\r\n temp = []\r\n for j in range(i):\r\n v = getbig(l[i], l[j], fs)\r\n if v > 1:\r\n temp.append(v)\r\n if flag:\r\n x += 2**v - 2\r\n else:\r\n x -= 2**v - 2\r\n x += offset(temp, not flag)\r\n return x\r\n \r\ndef getbig(v1, v2, factors):\r\n x = 1\r\n for f in factors:\r\n while v1%f == 0 and v2%f == 0:\r\n v1//=f\r\n v2//=f\r\n x*=f\r\n return x\r\n \r\ndef prime_factors(n):\r\n i = 2\r\n factors = set()\r\n while i * i <= n:\r\n if n % i:\r\n i += 1\r\n else:\r\n n //= i\r\n factors.add(i)\r\n if n > 1:\r\n factors.add(n)\r\n return factors\r\n \r\nn,m = map(int, input().split())\r\nif n == 1:\r\n print(1)\r\nelse:\r\n fs = prime_factors(n)\r\n fs.discard(n)\r\n ans = 2**n-2\r\n temp = []\r\n for v in fs:\r\n v = n//v\r\n temp.append(v)\r\n ans -= 2**v - 2\r\n # print(ans)\r\n ans += offset(temp, True)\r\n # print(fs)\r\n print(ans%m)", "from math import sqrt\n\ndef per(n):\n if n in diz:\n return diz[n]\n else:\n counter=pow(2,n,m)\n for i in range(1,int(sqrt(n))+1):\n if n%i==0:\n counter-=per(i)\n if i!=1 and i!=(n//i):\n counter-=per(n//i)\n counter%=m\n return counter\n \nn, m = map(int, input().split())\ndiz={1:2}\nprint(per(n))\ncounter=pow(2,n,m)", "powersof2 = {}\r\nnonperiodics= {}\r\n\r\n\r\ndef pow2(x, m):\r\n powersof2[0] = 1%m\r\n powersof2[1] = 2%m\r\n for i in range(2, x+1):\r\n powersof2[i] = (powersof2[i-1]*2)%m\r\n\r\n\r\ndef nonperiodicsfill(x):\r\n for i in range(x):\r\n nonperiodics[i]=0\r\n\r\n\r\ndef listoffactors(x):\r\n lista=[]\r\n for i in range(1, 1 + x//2):\r\n if x%i == 0 :\r\n lista.append(i)\r\n return lista\r\n\r\n\r\ndef sieve(x):\r\n for i in range(2, x):\r\n if prime[i]:\r\n for q in range(i*2, x, i):\r\n prime[q] = False\r\n\r\n\r\ndef nonPeriodicStrings(s,m):\r\n # print(\"\\nNPS\"+ str(s) +\" \"+ str(m) + \"\\n\")\r\n if s==1:\r\n return 2%m\r\n if s in nonperiodics:\r\n return nonperiodics[s]\r\n if prime[s]:\r\n nps = (powersof2[s] - 2) % m\r\n nonperiodics[s] = nps\r\n return nps\r\n # print(s)\r\n li = listoffactors(s)\r\n # print(li)\r\n nps = powersof2[s]\r\n for i in li:\r\n nps -= nonPeriodicStrings(i, m)\r\n # print(nonPeriodicStrings(i,m))\r\n nps %= m\r\n nonperiodics[s] = nps\r\n return nps\r\n\r\n\r\ncc = input().split(' ')\r\na= int(cc[0])\r\nm= int(cc[1])\r\n#print(a)\r\n#print(m)\r\nprime = [True for i in range(a+1)]\r\n#m = int(input())\r\npow2(a, m)\r\n#print(powersof2)\r\nsieve(a+1)\r\n#print(prime)\r\nif prime[a]:\r\n l = powersof2[a] - 2\r\n print(l)\r\nelse:\r\n print(nonPeriodicStrings(a, m))\r\n\r\n\r\n\r\n", "# cook your dish here\nimport sys\n\n\ndef get_factor(n:int):\n for i in range(2, int(n**0.5)+1):\n if(n%i==0):\n return i, n\n return n,n\n\nN,M=sys.stdin.readline().strip().split(\" \")[:2]\n\nN,M=int(N),int(M)\nif(N in (0,1)): print(0)\n#elif(N==1): print(2%M)\nelse:\n res=2**N-2\n f_, n_=get_factor(N)\n if(f_<N):\n res_=[f_]\n res-=2**(N//f_)-2\n while(f_<n_):\n f_, n_=get_factor(n_//f_)\n if(f_ not in res_):\n res_.append(f_)\n res-=2**(N//f_)-2\n if(n_ not in res_):\n res-=2**(N//n_)-2\n# if(N%(f_**2)==0):\n# res-=2**(N//f_)-2\n# else:\n# res-=2**(N//f_)-2+2**f_-2\n print(res%M)\n \n ", "# cook your dish here\nimport sys\n\n\ndef get_factor(n:int):\n for i in range(2, int(n**0.5)+1):\n if(n%i==0):\n return i\n \n\nN,M=sys.stdin.readline().strip().split(\" \")[:2]\n\nN,M=int(N),int(M)\nif(N in (0,1)): print(0)\n#elif(N==1): print(2%M)\nelse:\n res=2**N-2\n f_=get_factor(N)\n if(f_):\n if(N%(f_**2)==0):\n res-=2**(N//f_)-2\n else:\n res-=2**(N//f_)-2+2**f_-2\n \n print(res%M)\n \n ", "# cook your dish here\nimport sys\n\ndef get_factors(n:int):\n for i in range(2, n//2+1):\n if(n%i==0):\n yield i\n\nN,M=sys.stdin.readline().strip().split(\" \")[:2]\n\nN,M=int(N),int(M)\nif(N in (0,1)): print(0)\n#elif(N==1): print(2%M)\nelse:\n res=2**N-2\n for el in get_factors(N):\n res-=2**el-2\n print(res%M)\n \n ", "# cook your dish here\ndef offset(l, flag):\n x = 0\n # print(l)\n for i in range(1, len(l)):\n temp = []\n for j in range(i):\n v = getbig(l[i], l[j], fs)\n if v > 1:\n temp.append(v)\n if flag:\n x += 2**v - 2\n else:\n x -= 2**v - 2\n x += offset(temp, not flag)\n return x\n \ndef getbig(v1, v2, factors):\n x = 1\n for f in factors:\n while v1%f == 0 and v2%f == 0:\n v1//=f\n v2//=f\n x*=f\n return x\n \ndef prime_factors(n):\n i = 2\n factors = set()\n while i * i <= n:\n if n % i:\n i += 1\n else:\n n //= i\n factors.add(i)\n if n > 1:\n factors.add(n)\n return factors\n \nn,m = map(int, input().split())\nif n == 1:\n print(1)\nelse:\n fs = prime_factors(n)\n fs.discard(n)\n ans = 2**n-2\n temp = []\n for v in fs:\n v = n//v\n temp.append(v)\n ans -= 2**v - 2\n # print(ans)\n ans += offset(temp, True)\n # print(fs)\n print(ans%m)", "# cook your dish here\ndef prime_factors(n):\n i = 2\n factors = set()\n while i * i <= n:\n if n % i:\n i += 1\n else:\n n //= i\n factors.add(i)\n if n > 1:\n factors.add(n)\n return factors\n \nn,m = map(int, input().split())\nfs = prime_factors(n)\nfs.discard(n)\nans = 2**n-2\nfor v in fs:\n # print(ans, v)\n v = n//v\n # print(v)\n ans -= 2**v - 2\n # print(ans)\n# print(fs)\nprint(ans%m)", "# cook your dish here\ndef prime_factors(n):\n i = 2\n factors = set()\n while i * i <= n:\n if n % i:\n i += 1\n else:\n n //= i\n factors.add(n)\n if n % i != 0:\n factors.add(i)\n break\n \n return factors\n \nn,m = map(int, input().split())\nif n > 1:\n fs = prime_factors(n)\n ans = 2**n-2\n for v in fs:\n # print(ans, v)\n ans -= 2**v - 2\n # print(ans)\n # print(fs)\n print(ans%m)\nelse:\n print(1)", "# cook your dish here\ndef prime_factors(n):\n i = 2\n factors = set()\n while i * i <= n:\n if n % i:\n i += 1\n else:\n n //= i\n factors.add(n)\n if n % i != 0:\n factors.add(i)\n break\n \n return factors\n \nn,m = map(int, input().split())\nfs = prime_factors(n)\nans = 2**n-2\nfor v in fs:\n if v != n:\n # print(ans, v)\n ans -= 2**v - 2\n # print(ans)\n# print(fs)\nprint(ans%m)", "# cook your dish here\ndef prime_factors(n):\n i = 2\n factors = set()\n while i * i <= n:\n if n % i:\n i += 1\n else:\n n //= i\n factors.add(i)\n factors.add(n)\n break\n \n return factors\n \nn,m = map(int, input().split())\nfs = prime_factors(n)\nans = 2**n-2\nfor v in fs:\n if v != n:\n # print(ans, v)\n ans -= 2**v - 2\n # print(ans)\n# print(fs)\nprint(ans%m)", "# cook your dish here\ndef prime_factors(n):\n i = 2\n factors = set()\n while i * i <= n:\n if n % i:\n i += 1\n else:\n n //= i\n factors.add(i)\n if n > 1:\n factors.add(n)\n return factors\n \nn,m = map(int, input().split())\nfs = prime_factors(n)\nans = 2**n-2\nfor v in fs:\n if v != n:\n ans -= 2**v - 2\n# print(fs)\nprint(ans%m)", "def mod(f,m):\r\n if f==1:\r\n return(2%m)\r\n elif f%2==0:\r\n return(((mod(f//2,m))**2)%m)\r\n else:\r\n return((((mod(f//2,m))**2)*2)%m)\r\nn,m=list(map(int,input().strip().split()))\r\nl=[0 for i in range(n+1)]\r\nl[0],l[1]=1,1\r\nfor i in range(2,n+1):\r\n if l[i]==0:\r\n t=2\r\n while t*i<=n:\r\n l[t*i]=1\r\n t+=1\r\nprime=[]\r\nfor i in range(len(l)):\r\n if l[i]==0:\r\n prime.append(i)\r\nt=0\r\nfor j in prime:\r\n if n%j==0:\r\n t+=mod(n//j,m)\r\ns=mod(n,m)\r\nt%=m\r\nif s-t>0:\r\n print(s-t)\r\nelse:\r\n print(m-s+t)\r\n\r\n ", "import random\ndef miller_rabin(n, k):\n\n if n == 2 or n==3:\n return True\n\n if n % 2 == 0:\n return False\n\n r, s = 0, n - 1\n while s % 2 == 0:\n r += 1\n s //= 2\n for _ in range(k):\n a = random.randrange(2, n - 1)\n x = pow(a, s, n)\n if x == 1 or x == n - 1:\n continue\n for _ in range(r - 1):\n x = pow(x, 2, n)\n if x == n - 1:\n break\n else:\n return False\n return True\npows = {1:2}\nn, k = list(map(int, input().split(' ')))\nT = pow(2,n)\nif miller_rabin(n,6):\n print((T-2)%k)\nelse:\n m = 0\n for i in range(2,n//2+1):\n if n%i==0:\n if i>50000:\n a = 6\n elif i>20000:\n a = 5\n else:\n a = 4\n if miller_rabin(i,a):\n pows[i]=pow(2,i)-2\n m+=pows[i]\n else:\n w = 0\n for j in pows:\n if i%j==0:\n w+=pows[j]\n if j>i//2:\n break\n pows[i] = pow(2,i)-w\n m+=pows[i]\n\n print((T-m-2)%k)\n", "# cook your dish here\nimport random\ndef miller_rabin(n, k):\n\n if n == 2 or n==3:\n return True\n\n if n % 2 == 0:\n return False\n\n r, s = 0, n - 1\n while s % 2 == 0:\n r += 1\n s //= 2\n for _ in range(k):\n a = random.randrange(2, n - 1)\n x = pow(a, s, n)\n if x == 1 or x == n - 1:\n continue\n for _ in range(r - 1):\n x = pow(x, 2, n)\n if x == n - 1:\n break\n else:\n return False\n return True\npows = {1:2}\nn, k = list(map(int, input().split(' ')))\nT = pow(2,n)\nif miller_rabin(n,6):\n print((T-2)%k)\nelse:\n m = 0\n for i in range(2,n//2+1):\n if n%i==0:\n if i>50000:\n a = 6\n elif i>20000:\n a = 5\n else:\n a = 4\n if miller_rabin(i,a):\n pows[i]=pow(2,i)-2\n m+=pows[i]\n else:\n w = 0\n for j in pows:\n if i%j==0:\n w+=pows[j]\n if j>i//2:\n break\n pows[i] = pow(2,i)-w\n m+=pows[i]\n\n print((T-m-2)%k)\n", "\r\npowers=[0 for i in range(150001)]\r\n\r\ndef factorize(n):\r\n factors=set()\r\n for i in range(1,n):\r\n if i*i>n:\r\n break\r\n else:\r\n if (n%i)==0:\r\n factors.add(i)\r\n factors.add(n//i)\r\n factors.remove(n)\r\n return factors\r\n\r\ndef calc(m):\r\n powers[0]=1\r\n for i in range(1,150001):\r\n powers[i]=(powers[i-1]*2)%m\r\n\r\nn,m=list(map(int,input().split()))\r\ncalc(m)\r\ndp=[0 for i in range(n+1)]\r\ndp[1]=2\r\nfor i in range(2,n+1):\r\n factors=factorize(i)\r\n dp[i]=powers[i]\r\n for num in factors:\r\n dp[i]-=dp[num]\r\n dp[i]=(dp[i]+m)%m\r\nprint(dp[n])\r\n", "\nn, m = map(int, input().split())\np, mem = 3, []\nres = 2**n - 2\nif n % 2 == 0:\n res -= 2\nwhile p < n:\n if not any(p % e == 0 for e in mem) and n % p == 0 :\n mem.append(p)\n res -= 2**p - 2\n \n p +=2\n \nprint(res % m)\n \n \n \n \n \n \n ", "from math import sqrt, gcd\r\nn, MOD = list(map(int, input().split()))\r\nfactors = set()\r\nfor i in range(2, 1+int(sqrt(n))):\r\n if(n % i == 0):\r\n factors.add(i)\r\n factors.add(n//i)\r\nfactors = sorted(list(factors), reverse = True)\r\nans = 2**n\r\nif(factors == []):\r\n ans -= 2\r\ndone = []\r\nfor i in factors:\r\n ans -= (2**i) % MOD\r\n temp = i\r\n #print(\"i=\",i,ans)\r\n for j in done:\r\n if(temp == 1):\r\n break\r\n ans = (ans + (2**gcd(temp,j))%MOD) % MOD\r\n temp //= gcd(temp,j)\r\n #print(\"j=\",j,ans)\r\n done.append(i)\r\nif(factors):\r\n ans -= max(0,len(factors)//2 - 1) * 2\r\nprint(ans%MOD)", "\r\nN,M = map(int,input().split())\r\ndp = [0]*( (2*(10**5)) +1)\r\npower = [0]*( (2*(10**5)) +1)\r\npower[1] = 2\r\ndp[1] = 2%int(M)\r\nfor i in range(2,int(N)+1):\r\n power[i] = (2*power[i-1])%int(M)\r\n\r\n\r\nfor i in range(2,int(N)+1):\r\n if(int(N)%i!=0):\r\n continue\r\n\r\n dp[i] = power[i]\r\n #print(power[i])\r\n for j in range(1,int(int(i)/2)+1):\r\n if(i%j==0):\r\n dp[i] = dp[i]-dp[j]\r\n if(dp[i]<0):\r\n dp[i] += int(M)\r\n \r\nprint(dp[int(N)]) ", "factors = []\r\n\r\ndef fact(n):\r\n factors.clear()\r\n for i in range(2,int(n**0.5)+1):\r\n if n%i == 0:\r\n factors.append(i)\r\n if i*i != n:\r\n factors.append(n//i)\r\nn , m = map(int,input().split())\r\n\r\ndp = [0]*( (2*(10**5)) +1)\r\n\r\ndp[2] = 2%m\r\ndp[3] = 6%m\r\ndp[4] = 12%m\r\n\r\nif n > 4:\r\n for i in range(5,n+1):\r\n fact(i)\r\n k = (pow(2,i,m) - 2)%m\r\n if len(factors) == 0:\r\n dp[i] = k\r\n else:\r\n sub = 0\r\n for j in factors:\r\n sub += dp[j]\r\n sub %= m\r\n dp[i] = (k - sub)%m\r\nprint(dp[n])\r\n", "# cook your dish here\n\nN, M = map(int, input().split())\n\npow2ModM = [1 for i in range(N + 1)]\npow2ModM[0] = 1\nfor i in range(1, N + 1):\n pow2ModM[i] = (pow2ModM[i - 1] * 2) % M\n\ndef fModM(N):\n answer = pow2ModM[N]\n for d in range(1, N):\n if N % d == 0:\n answer = (answer - fModM(d)) % M\n return answer\n\nprint(fModM(N))\n\n"]

{"inputs": [["3 176"]], "outputs": [["6"]]}

INTERVIEW

PYTHON3

CODECHEF

15,055

b1c857fa02977c0552a3dc516d7d50bf

UNKNOWN

Finally, the pandemic is over in ChefLand, and the chef is visiting the school again. Chef likes to climb the stairs of his school's floor by skipping one step, sometimes chef climbs the stairs one by one. Simply, the chef can take one or 2 steps in one upward movement. There are N stairs between ground and next floor. The chef is on the ground floor and he wants to go to the next floor with Cheffina but, Cheffina asks chef in how many ways, the chef can reach the next floor normally or any combination of skipping one step, where order doesn't matter. -----Input:----- - First-line will contain $T$, the number of test cases. Then the test cases follow. - Each test case contains a single line of input, two integers $N$. -----Output:----- For each test case, output in a single line answer as the number of ways. -----Constraints----- - $1 \leq T \leq 1000$ - $1 \leq N \leq 10^5$ -----Sample Input:----- 1 3 -----Sample Output:----- 2 -----EXPLANATION:----- ways: [1,1,1], here chef climb to the next floor, one by one stair. [1,2], here chef climb to the next floor, one step first and after that 2 stairs at once. Note, [2,1] consider the same as that of [1,2] hence ignored.

["for _ in range(int(input())):\n N=int(input())\n if N%2==0:\n print(N//2+1)\n else:\n print((N-1)//2+1)", "# cook your dish here\nfor _ in range(int(input())):\n n=int(input())\n print((n//2)+1)", "# cook your dish here\nfor t in range(int(input())):\n n = int(input())\n print(int(n/2)+1)\n", "t = int(input())\n\nwhile(t):\n \n t -= 1\n \n n = int(input())\n \n ans = 1 + n//2\n \n print(ans)", "# your code goes here\nt=int(input())\nwhile t>0:\n\tn=int(input())\n\tprint(n//2+1)\n\tt-=1", "# cook your dish here\nfor _ in range(int(input())):\n n = int(input())\n print(n//2+1)", "# cook your dish here\nimport sys\nT=int(input())\nfor t in range(T):\n N=int(input())\n print(int(N/2)+1)\n"]

{"inputs": [["1", "3"]], "outputs": [["2"]]}

INTERVIEW

PYTHON3

CODECHEF

768

25fa88a3996bbd4c6bbb4555d24f5d62

UNKNOWN

Indian National Olympiad in Informatics 2016 There are k types of brackets each with its own opening bracket and closing bracket. We assume that the first pair is denoted by the numbers 1 and k+1, the second by 2 and k+2 and so on. Thus the opening brackets are denoted by 1,2,.., k, and the corresponding closing brackets are denoted by k+1,k+2,..., 2*k respectively. Some sequences with elements from 1,2, ... 2*k form well-bracketed sequences while others don't. A sequence is well-bracketed, if we can match or pair up opening brackets and closing brackets of the same type in such a way that the following holds: 1) every bracket is paired up 2) in each matched pair, the opening bracket occurs before the closing bracket 3) for a matched pair, any other matched pair lies either completely between them or outside them. For the examples discussed below, let us assume that k = 2. The sequence 1,1,3 is not well-bracketed as one of the two 1's cannot be paired. The sequence 3,1,3,1 is not well-bracketed as there is no way to match the second 1 to a closing bracket occurring after it. The sequence 1,2,3,4 is not well-bracketed as the matched pair 2,4 is neither completely between the matched pair 1,3 nor completely outside it. That is, the matched pairs cannot overlap. The sequence 1,2,4,3,1,3 is well-bracketed. We match the first 1 with the first 3, the 2 with the 4 and the second 1 with the second 3, satisfying all the 3 conditions. If you rewrite these sequences using [,{,],} instead of 1,2,3,4 respectively, this will be quite clear. In this problem you are given a sequence of brackets, of length N: B[1], .., B[N], where each B[i] is one of the brackets. You are also given an array of Values: V[1],.., V[N]. Among all the subsequences in the Values array, such that the corresponding bracket subsequence in the B Array is a well-bracketed sequence, you need to find the maximum sum. Suppose N = 6, k = 3 and the values of V and B are as follows: i 1 2 3 4 5 6 V[i] 4 5 -2 1 1 6 B[i] 1 3 4 2 5 6 Then, the brackets in positions 1,3 form a well-bracketed sequence (1,4) and the sum of the values in these positions is 2 (4 + -2 = 2). The brackets in positions 1,3,4,5 form a well-bracketed sequence (1,4,2,5) and the sum of the values in these positions is 4. Finally, the brackets in positions 2,4,5,6 forms a well-bracketed sequence (3,2,5,6) and the sum of the values in these positions is 13. The sum of the values in positions 1,2,5,6 is 16 but the brackets in these positions (1,3,5,6) do not form a well-bracketed sequence. You can check the best sum from positions whose brackets form a well-bracketed sequence is 13. -----Input format----- One line, which contains (2*N + 2) space separate integers. The first integer denotes N. The next integer is k. The next N integers are V[1],..., V[N]. The last N integers are B[1],.., B[N]. -----Output format----- One integer, which is the maximum sum possible satisfying the requirement mentioned above. -----Test data----- 1 ≤ k ≤ 7 -106 ≤ V[i] ≤ 106, for all i 1 ≤ B[i] ≤ 2*k, for all i. Subtask 1 (40 Marks) 1 ≤ n ≤ 10. Subtask 2 (60 Marks) 1 ≤ n ≤ 700. -----Sample Input----- 6 3 4 5 -2 1 1 6 1 3 4 2 5 6 -----Sample Output----- 13

["# cook your dish here\r\nimport bisect\r\nn, k1, *l = map(int, input().split())\r\nv_l, b_l = l[:n], l[n:]\r\n\r\nb_inv = {key:[] for key in range(2*k1)}\r\nfor i in range(n):\r\n b_l[i] -= 1\r\n b_inv[b_l[i]].append(i)\r\n\r\ndp = [[0 for _ in range(n)] for _ in range(n)]\r\nfor k in range(1, n):\r\n for j in range(n-2, -1, -1):\r\n if j+k >= n:\r\n continue\r\n \r\n dp[j][j+k] = max(dp[j][j+k], dp[j][j+k-1])\r\n if b_l[j+k] >= k1:\r\n left = bisect.bisect_right(b_inv[b_l[j+k]-k1], j)\r\n \r\n if b_l[j+k] >= k1:\r\n for i in b_inv[b_l[j+k]-k1][left:]:\r\n if i > j+k:\r\n break\r\n if i > j:\r\n dp[j][j+k] = max(dp[j][j+k], dp[j][i-1]+dp[i][j+k])\r\n \r\n if b_l[j+k]-k1 == b_l[j]:\r\n if j+k-1 < n:\r\n dp[j][j+k] = max(dp[j][j+k], v_l[j+k]+v_l[j]+dp[j+1][j+k-1])\r\n else:\r\n dp[j][j+k] = max(dp[j][j+k], v_l[j+k]+v_l[j])\r\n \r\n\r\nprint(dp[0][-1])", "a,b,*c=list(map(int,input().strip().split()))\r\nd=[]\r\ne=[]\r\nfor i in range(a):\r\n e.append(c[i])\r\n d.append(c[i+a])\r\nDP1=[[-1 for i in range(a)] for j in range(a)]\r\ndef DP(l,r):\r\n nonlocal d,e,b,DP1\r\n if l>=r:\r\n return 0\r\n elif DP1[l][r]!=-1:\r\n return DP1[l][r]\r\n else:\r\n DP1[l][r]=max(DP1[l][r],DP(l+1,r))\r\n DP1[l][r]=max(DP1[l][r],DP(l,r-1))\r\n if d[l]+b==d[r]:\r\n DP1[l][r]=max(DP1[l][r],e[l]+e[r]+DP(l+1,r-1))\r\n for i in range(l,r):\r\n if d[l]+b==d[i] or d[i]+b==d[r]:\r\n DP1[l][r]=max(DP1[l][r],DP(l,i)+DP(i+1,r))\r\n return DP1[l][r]\r\nprint(DP(0,a-1))\r\n", "a,b,*c=list(map(int,input().strip().split()))\r\nd=[]\r\ne=[]\r\nfor i in range(a):\r\n e.append(c[i])\r\n d.append(c[i+a])\r\nDP1=[[-1 for i in range(a)] for j in range(a)]\r\ndef DP(l,r):\r\n nonlocal d,e,b,DP1\r\n if l>=r:\r\n return 0\r\n elif DP1[l][r]!=-1:\r\n return DP1[l][r]\r\n else:\r\n #DP1[l][r]=max(DP1[l][r],DP(l+1,r))\r\n #DP1[l][r]=max(DP1[l][r],DP(l,r-1))\r\n if d[l]+b==d[r]:\r\n DP1[l][r]=max(DP1[l][r],e[l]+e[r]+DP(l+1,r-1))\r\n for i in range(l,r):\r\n DP1[l][r]=max(DP1[l][r],DP(l,i)+DP(i+1,r))\r\n return DP1[l][r]\r\nprint(DP(0,a-1))\r\n", "# cook your dish here\nimport bisect\nn, k1, *l = map(int, input().split())\nv_l, b_l = l[:n], l[n:]\n\nb_inv = {key:[] for key in range(2*k1)}\nfor i in range(n):\n b_l[i] -= 1\n b_inv[b_l[i]].append(i)\n\ndp = [[0 for _ in range(n)] for _ in range(n)]\nfor k in range(1, n):\n for j in range(n-2, -1, -1):\n if j+k >= n:\n continue\n \n dp[j][j+k] = max(dp[j][j+k], dp[j][j+k-1])\n if b_l[j+k] >= k1:\n left = bisect.bisect_right(b_inv[b_l[j+k]-k1], j)\n \n if b_l[j+k] >= k1:\n for i in b_inv[b_l[j+k]-k1][left:]:\n if i > j+k:\n break\n if i > j:\n dp[j][j+k] = max(dp[j][j+k], dp[j][i-1]+dp[i][j+k])\n \n if b_l[j+k]-k1 == b_l[j]:\n if j+k-1 < n:\n dp[j][j+k] = max(dp[j][j+k], v_l[j+k]+v_l[j]+dp[j+1][j+k-1])\n else:\n dp[j][j+k] = max(dp[j][j+k], v_l[j+k]+v_l[j])\n \n\nprint(dp[0][-1])", "# cook your dish here\r\ninpu=list(map(int,input().split()))\r\nn,k=inpu[0],inpu[1]\r\nv=inpu[2:n+2]\r\nb=inpu[n+2:2*n+2]\r\nbrac={i:set() for i in range(n)}\r\nfor i in range(n):\r\n for j in range(i+1,n):\r\n if b[j]-b[i]==k:\r\n brac[i].add(j)\r\n \r\ndp=[[0 for i in range(n)] for j in range(n)]\r\nfor j in range(1,n):\r\n for i in range(n-j):\r\n ans=-float(\"inf\")\r\n if i+j in brac[i]:\r\n if j==1:\r\n ans=max(ans,v[i+j]+v[i])\r\n else:\r\n ans=max(ans,v[i+j]+v[i]+dp[i+1][i+j-1])\r\n for l in brac[i]:\r\n if l>=i+j:\r\n continue\r\n if b[l]-b[i]==k:\r\n if l==i+1:\r\n ans=max(ans,v[l]+v[i]+dp[l+1][i+j])\r\n else:\r\n ans=max(ans,v[l]+v[i]+dp[l+1][i+j]+dp[i+1][l-1])\r\n ans=max(ans,dp[i+1][i+j])\r\n dp[i][i+j]=ans\r\nprint(dp[0][n-1])\r\n", "# cook your dish here\nimport bisect\n# def recur(s_i, e_i, end_i):\n# # if end_i in dp[s_i] and e_i in dp[s_i][end_i]:\n# # return dp[s_i][end_i][e_i]\n \n# inside = 0\n# for i in range(s_i+1, e_i):\n# if b_l[i] < k:\n# if e_i not in dp[i]:\n# dp[i][e_i] = 0\n# bi_i = bisect.bisect_left(b_inv[b_l[i]+k], i)\n# for ind in b_inv[b_l[i]+k][bi_i:]:\n# if i < ind < e_i:\n# dp[i][e_i] = max(dp[i][e_i], recur(i, ind, e_i))\n# inside = max(inside, dp[i][e_i])\n# outside = 0\n# for i in range(e_i+1, min(n, end_i)):\n# if b_l[i] < k:\n# if end_i not in dp[i]:\n# dp[i][end_i] = 0\n# bi_i = bisect.bisect_left(b_inv[b_l[i]+k], i)\n# for ind in b_inv[b_l[i]+k][bi_i:]:\n# if i < ind < end_i:\n# dp[i][end_i] = max(dp[i][end_i], recur(i, ind, end_i))\n# outside = max(outside, dp[i][end_i])\n \n# # if end_i not in dp[s_i]:\n# # dp[s_i][end_i] = {}\n# # dp[s_i][end_i].update({e_i: v_l[s_i] + v_l[e_i] + outside + inside})\n# # return dp[s_i][end_i][e_i]\n# return v_l[s_i] + v_l[e_i] + outside + inside\n \nn, k1, *l = map(int, input().split())\nv_l, b_l = l[:n], l[n:]\n\nb_inv = {key:[] for key in range(2*k1)}\nfor i in range(n):\n b_l[i] -= 1\n b_inv[b_l[i]].append(i)\n\ndp = [[0 for _ in range(n)] for _ in range(n)]\nfor k in range(1, n):\n for j in range(n-2, -1, -1):\n if j+k >= n:\n continue\n \n dp[j][j+k] = max(dp[j][j+k], dp[j][j+k-1])\n if b_l[j+k] >= k1:\n left = bisect.bisect_right(b_inv[b_l[j+k]-k1], j)\n \n if b_l[j+k] >= k1:\n for i in b_inv[b_l[j+k]-k1][left:]:\n if i > j+k:\n break\n if i > j:\n dp[j][j+k] = max(dp[j][j+k], dp[j][i-1]+dp[i][j+k])\n \n if b_l[j+k]-k1 == b_l[j]:\n if j+k-1 < n:\n dp[j][j+k] = max(dp[j][j+k], v_l[j+k]+v_l[j]+dp[j+1][j+k-1])\n else:\n dp[j][j+k] = max(dp[j][j+k], v_l[j+k]+v_l[j])\n \n# dp = [{} for _ in range(n)]\n# ans = 0\n# for i in range(n):\n# if b_l[i] < k:\n# if n+1 not in dp[i]:\n# dp[i][n+1] = 0\n# bi_i = bisect.bisect_left(b_inv[b_l[i]+k], i)\n# for ind in b_inv[b_l[i]+k][bi_i:]:\n# if i < ind:\n# dp[i][n+1] = max(dp[i][n+1], recur(i, ind, n+1))\n# ans = max(ans, dp[i][n+1])\n# print(dp)\nprint(dp[0][-1])", "# cook your dish here\nimport bisect\n# def recur(s_i, e_i, end_i):\n# # if end_i in dp[s_i] and e_i in dp[s_i][end_i]:\n# # return dp[s_i][end_i][e_i]\n \n# inside = 0\n# for i in range(s_i+1, e_i):\n# if b_l[i] < k:\n# if e_i not in dp[i]:\n# dp[i][e_i] = 0\n# bi_i = bisect.bisect_left(b_inv[b_l[i]+k], i)\n# for ind in b_inv[b_l[i]+k][bi_i:]:\n# if i < ind < e_i:\n# dp[i][e_i] = max(dp[i][e_i], recur(i, ind, e_i))\n# inside = max(inside, dp[i][e_i])\n# outside = 0\n# for i in range(e_i+1, min(n, end_i)):\n# if b_l[i] < k:\n# if end_i not in dp[i]:\n# dp[i][end_i] = 0\n# bi_i = bisect.bisect_left(b_inv[b_l[i]+k], i)\n# for ind in b_inv[b_l[i]+k][bi_i:]:\n# if i < ind < end_i:\n# dp[i][end_i] = max(dp[i][end_i], recur(i, ind, end_i))\n# outside = max(outside, dp[i][end_i])\n \n# # if end_i not in dp[s_i]:\n# # dp[s_i][end_i] = {}\n# # dp[s_i][end_i].update({e_i: v_l[s_i] + v_l[e_i] + outside + inside})\n# # return dp[s_i][end_i][e_i]\n# return v_l[s_i] + v_l[e_i] + outside + inside\n \nn, k1, *l = map(int, input().split())\nv_l, b_l = l[:n], l[n:]\n\nb_inv = {key:[] for key in range(2*k1)}\nfor i in range(n):\n b_l[i] -= 1\n b_inv[b_l[i]].append(i)\n\ndp = [[0 for _ in range(n)] for _ in range(n)]\nfor k in range(1, n):\n for j in range(n-2, -1, -1):\n if j+k >= n:\n continue\n \n dp[j][j+k] = max(dp[j][j+k], dp[j][j+k-1])\n if b_l[j+k] >= k1:\n left = bisect.bisect_left(b_inv[b_l[j+k]-k1], j)\n \n if b_l[j+k] >= k1:\n for i in b_inv[b_l[j+k]-k1][left:]:\n if i > j+k:\n break\n dp[j][j+k] = max(dp[j][j+k], dp[j][i-1]+dp[i][j+k])\n \n if b_l[j+k]-k1 == b_l[j]:\n if j+k-1 < n:\n dp[j][j+k] = max(dp[j][j+k], v_l[j+k]+v_l[j]+dp[j+1][j+k-1])\n else:\n dp[j][j+k] = max(dp[j][j+k], v_l[j+k]+v_l[j])\n \n# dp = [{} for _ in range(n)]\n# ans = 0\n# for i in range(n):\n# if b_l[i] < k:\n# if n+1 not in dp[i]:\n# dp[i][n+1] = 0\n# bi_i = bisect.bisect_left(b_inv[b_l[i]+k], i)\n# for ind in b_inv[b_l[i]+k][bi_i:]:\n# if i < ind:\n# dp[i][n+1] = max(dp[i][n+1], recur(i, ind, n+1))\n# ans = max(ans, dp[i][n+1])\n# print(dp)\nprint(dp[0][-1])", "# cook your dish here\n# import bisect\n# def recur(s_i, e_i, end_i):\n# # if end_i in dp[s_i] and e_i in dp[s_i][end_i]:\n# # return dp[s_i][end_i][e_i]\n \n# inside = 0\n# for i in range(s_i+1, e_i):\n# if b_l[i] < k:\n# if e_i not in dp[i]:\n# dp[i][e_i] = 0\n# bi_i = bisect.bisect_left(b_inv[b_l[i]+k], i)\n# for ind in b_inv[b_l[i]+k][bi_i:]:\n# if i < ind < e_i:\n# dp[i][e_i] = max(dp[i][e_i], recur(i, ind, e_i))\n# inside = max(inside, dp[i][e_i])\n# outside = 0\n# for i in range(e_i+1, min(n, end_i)):\n# if b_l[i] < k:\n# if end_i not in dp[i]:\n# dp[i][end_i] = 0\n# bi_i = bisect.bisect_left(b_inv[b_l[i]+k], i)\n# for ind in b_inv[b_l[i]+k][bi_i:]:\n# if i < ind < end_i:\n# dp[i][end_i] = max(dp[i][end_i], recur(i, ind, end_i))\n# outside = max(outside, dp[i][end_i])\n \n# # if end_i not in dp[s_i]:\n# # dp[s_i][end_i] = {}\n# # dp[s_i][end_i].update({e_i: v_l[s_i] + v_l[e_i] + outside + inside})\n# # return dp[s_i][end_i][e_i]\n# return v_l[s_i] + v_l[e_i] + outside + inside\n \nn, k1, *l = map(int, input().split())\nv_l, b_l = l[:n], l[n:]\n\nb_inv = {key:[] for key in range(2*k1)}\nfor i in range(n):\n b_l[i] -= 1\n b_inv[b_l[i]].append(i)\n\ndp = [[0 for _ in range(n)] for _ in range(n)]\nfor k in range(1, n):\n for j in range(n-2, -1, -1):\n if j+k >= n:\n continue\n \n dp[j][j+k] = max(dp[j][j+k], dp[j][j+k-1])\n if b_l[j+k] >= k1:\n for i in reversed(b_inv[b_l[j+k]-k1]):\n if i <= j:\n break\n dp[j][j+k] = max(dp[j][j+k], dp[j][i-1]+dp[i][j+k])\n \n if b_l[j+k]-k1 == b_l[j]:\n if j+k-1 < n:\n dp[j][j+k] = max(dp[j][j+k], v_l[j+k]+v_l[j]+dp[j+1][j+k-1])\n else:\n dp[j][j+k] = max(dp[j][j+k], v_l[j+k]+v_l[j])\n \n# dp = [{} for _ in range(n)]\n# ans = 0\n# for i in range(n):\n# if b_l[i] < k:\n# if n+1 not in dp[i]:\n# dp[i][n+1] = 0\n# bi_i = bisect.bisect_left(b_inv[b_l[i]+k], i)\n# for ind in b_inv[b_l[i]+k][bi_i:]:\n# if i < ind:\n# dp[i][n+1] = max(dp[i][n+1], recur(i, ind, n+1))\n# ans = max(ans, dp[i][n+1])\n# print(dp)\nprint(dp[0][-1])", "# cook your dish here\n# import bisect\n# def recur(s_i, e_i, end_i):\n# # if end_i in dp[s_i] and e_i in dp[s_i][end_i]:\n# # return dp[s_i][end_i][e_i]\n \n# inside = 0\n# for i in range(s_i+1, e_i):\n# if b_l[i] < k:\n# if e_i not in dp[i]:\n# dp[i][e_i] = 0\n# bi_i = bisect.bisect_left(b_inv[b_l[i]+k], i)\n# for ind in b_inv[b_l[i]+k][bi_i:]:\n# if i < ind < e_i:\n# dp[i][e_i] = max(dp[i][e_i], recur(i, ind, e_i))\n# inside = max(inside, dp[i][e_i])\n# outside = 0\n# for i in range(e_i+1, min(n, end_i)):\n# if b_l[i] < k:\n# if end_i not in dp[i]:\n# dp[i][end_i] = 0\n# bi_i = bisect.bisect_left(b_inv[b_l[i]+k], i)\n# for ind in b_inv[b_l[i]+k][bi_i:]:\n# if i < ind < end_i:\n# dp[i][end_i] = max(dp[i][end_i], recur(i, ind, end_i))\n# outside = max(outside, dp[i][end_i])\n \n# # if end_i not in dp[s_i]:\n# # dp[s_i][end_i] = {}\n# # dp[s_i][end_i].update({e_i: v_l[s_i] + v_l[e_i] + outside + inside})\n# # return dp[s_i][end_i][e_i]\n# return v_l[s_i] + v_l[e_i] + outside + inside\n \nn, k1, *l = map(int, input().split())\nv_l, b_l = l[:n], l[n:]\n\nb_inv = {key:[] for key in range(2*k1)}\nfor i in range(n):\n b_l[i] -= 1\n b_inv[b_l[i]].append(i)\n\ndp = [[0 for _ in range(n)] for _ in range(n)]\nfor k in range(1, n):\n for j in range(n-2, -1, -1):\n if j+k >= n:\n continue\n \n dp[j][j+k] = max(dp[j][j+k], dp[j][j+k-1])\n dp[j][j+k] = max(dp[j][j+k], dp[j+1][j+k])\n if b_l[j+k] >= k1:\n for i in b_inv[b_l[j+k]-k1]:\n dp[j][j+k] = max(dp[j][j+k], dp[j][i-1]+dp[i][j+k])\n \n if b_l[j+k]-k1 == b_l[j]:\n if j+k-1 < n:\n dp[j][j+k] = max(dp[j][j+k], v_l[j+k]+v_l[j]+dp[j+1][j+k-1])\n else:\n dp[j][j+k] = max(dp[j][j+k], v_l[j+k]+v_l[j])\n \n# dp = [{} for _ in range(n)]\n# ans = 0\n# for i in range(n):\n# if b_l[i] < k:\n# if n+1 not in dp[i]:\n# dp[i][n+1] = 0\n# bi_i = bisect.bisect_left(b_inv[b_l[i]+k], i)\n# for ind in b_inv[b_l[i]+k][bi_i:]:\n# if i < ind:\n# dp[i][n+1] = max(dp[i][n+1], recur(i, ind, n+1))\n# ans = max(ans, dp[i][n+1])\n# print(dp)\nprint(dp[0][-1])", "# cook your dish here\n# import bisect\n# def recur(s_i, e_i, end_i):\n# # if end_i in dp[s_i] and e_i in dp[s_i][end_i]:\n# # return dp[s_i][end_i][e_i]\n \n# inside = 0\n# for i in range(s_i+1, e_i):\n# if b_l[i] < k:\n# if e_i not in dp[i]:\n# dp[i][e_i] = 0\n# bi_i = bisect.bisect_left(b_inv[b_l[i]+k], i)\n# for ind in b_inv[b_l[i]+k][bi_i:]:\n# if i < ind < e_i:\n# dp[i][e_i] = max(dp[i][e_i], recur(i, ind, e_i))\n# inside = max(inside, dp[i][e_i])\n# outside = 0\n# for i in range(e_i+1, min(n, end_i)):\n# if b_l[i] < k:\n# if end_i not in dp[i]:\n# dp[i][end_i] = 0\n# bi_i = bisect.bisect_left(b_inv[b_l[i]+k], i)\n# for ind in b_inv[b_l[i]+k][bi_i:]:\n# if i < ind < end_i:\n# dp[i][end_i] = max(dp[i][end_i], recur(i, ind, end_i))\n# outside = max(outside, dp[i][end_i])\n \n# # if end_i not in dp[s_i]:\n# # dp[s_i][end_i] = {}\n# # dp[s_i][end_i].update({e_i: v_l[s_i] + v_l[e_i] + outside + inside})\n# # return dp[s_i][end_i][e_i]\n# return v_l[s_i] + v_l[e_i] + outside + inside\n \nn, k1, *l = map(int, input().split())\nv_l, b_l = l[:n], l[n:]\n\n# b_inv = {key:[] for key in range(2*k)}\nfor i in range(n):\n b_l[i] -= 1\n # b_inv[b_l[i]].append(i)\n\ndp = [[0 for _ in range(n)] for _ in range(n)]\nfor k in range(1, n):\n for j in range(n-2, -1, -1):\n if j+k >= n:\n continue\n elif b_l[j+k]-k1 == b_l[j]:\n if j+k-1 < n:\n dp[j][j+k] = max(dp[j][j+k], v_l[j+k]+v_l[j]+dp[j+1][j+k-1])\n else:\n dp[j][j+k] = max(dp[j][j+k], v_l[j+k]+v_l[j])\n for i in range(j, j+k):\n dp[j][j+k] = max(dp[j][j+k], dp[j][i]+dp[i+1][j+k])\n \n# dp = [{} for _ in range(n)]\n# ans = 0\n# for i in range(n):\n# if b_l[i] < k:\n# if n+1 not in dp[i]:\n# dp[i][n+1] = 0\n# bi_i = bisect.bisect_left(b_inv[b_l[i]+k], i)\n# for ind in b_inv[b_l[i]+k][bi_i:]:\n# if i < ind:\n# dp[i][n+1] = max(dp[i][n+1], recur(i, ind, n+1))\n# ans = max(ans, dp[i][n+1])\n# print(dp)\nprint(dp[0][-1])", "# cook your dish here\nimport bisect\ndef recur(s_i, e_i, end_i):\n # if end_i in dp[s_i] and e_i in dp[s_i][end_i]:\n # return dp[s_i][end_i][e_i]\n \n inside = 0\n for i in range(s_i+1, e_i):\n if b_l[i] < k:\n if e_i not in dp[i]:\n dp[i][e_i] = 0\n bi_i = bisect.bisect_left(b_inv[b_l[i]+k], i)\n for ind in b_inv[b_l[i]+k][bi_i:]:\n if i < ind < e_i:\n dp[i][e_i] = max(dp[i][e_i], recur(i, ind, e_i))\n inside = max(inside, dp[i][e_i])\n outside = 0\n for i in range(e_i+1, min(n, end_i)):\n if b_l[i] < k:\n if end_i not in dp[i]:\n dp[i][end_i] = 0\n bi_i = bisect.bisect_left(b_inv[b_l[i]+k], i)\n for ind in b_inv[b_l[i]+k][bi_i:]:\n if i < ind < end_i:\n dp[i][end_i] = max(dp[i][end_i], recur(i, ind, end_i))\n outside = max(outside, dp[i][end_i])\n \n # if end_i not in dp[s_i]:\n # dp[s_i][end_i] = {}\n # dp[s_i][end_i].update({e_i: v_l[s_i] + v_l[e_i] + outside + inside})\n # return dp[s_i][end_i][e_i]\n return v_l[s_i] + v_l[e_i] + outside + inside\n \nn, k, *l = map(int, input().split())\nv_l, b_l = l[:n], l[n:]\n\nb_inv = {key:[] for key in range(2*k)}\nfor i in range(n):\n b_l[i] -= 1\n b_inv[b_l[i]].append(i)\n\ndp = [{} for _ in range(n)]\nans = 0\nfor i in range(n):\n if b_l[i] < k:\n if n+1 not in dp[i]:\n dp[i][n+1] = 0\n bi_i = bisect.bisect_left(b_inv[b_l[i]+k], i)\n for ind in b_inv[b_l[i]+k][bi_i:]:\n if i < ind:\n dp[i][n+1] = max(dp[i][n+1], recur(i, ind, n+1))\n ans = max(ans, dp[i][n+1])\n# print(dp)\nprint(ans)", "# cook your dish here\nimport bisect\ndef recur(s_i, e_i, end_i):\n if end_i in dp[s_i] and e_i in dp[s_i][end_i]:\n return dp[s_i][end_i][e_i]\n \n inside = 0\n for i in range(s_i+1, e_i):\n if b_l[i] < k:\n bi_i = bisect.bisect_left(b_inv[b_l[i]+k], i)\n for ind in b_inv[b_l[i]+k][bi_i:]:\n if i < ind < e_i:\n inside = max(inside, recur(i, ind, e_i))\n outside = 0\n for i in range(e_i+1, min(n, end_i)):\n if b_l[i] < k:\n bi_i = bisect.bisect_left(b_inv[b_l[i]+k], i)\n for ind in b_inv[b_l[i]+k][bi_i:]:\n if i < ind < end_i:\n outside = max(outside, recur(i, ind, end_i))\n if end_i not in dp[s_i]:\n dp[s_i][end_i] = {}\n dp[s_i][end_i].update({e_i: v_l[s_i] + v_l[e_i] + outside + inside})\n return dp[s_i][end_i][e_i]\n \nn, k, *l = map(int, input().split())\nv_l, b_l = l[:n], l[n:]\n\nb_inv = {key:[] for key in range(2*k)}\nfor i in range(n):\n b_l[i] -= 1\n b_inv[b_l[i]].append(i)\n\ndp = [{} for _ in range(n)]\nans = 0\nfor i in range(n):\n if b_l[i] < k:\n bi_i = bisect.bisect_left(b_inv[b_l[i]+k], i)\n for ind in b_inv[b_l[i]+k][bi_i:]:\n if i < ind:\n ans = max(ans, recur(i, ind, n+1))\n# print(dp)\nprint(ans)", "# cook your dish here\nimport bisect\ndef recur(s_i, e_i, end_i):\n inside = 0\n for i in range(s_i+1, e_i):\n if b_l[i] < k:\n bi_i = bisect.bisect_left(b_inv[b_l[i]+k], i)\n for ind in b_inv[b_l[i]+k][bi_i:]:\n if i < ind < e_i:\n dp[i][e_i] = recur(i, ind, e_i)\n inside = max(inside, dp[i][e_i])\n outside = 0\n for i in range(e_i+1, min(n, end_i)):\n if b_l[i] < k:\n bi_i = bisect.bisect_left(b_inv[b_l[i]+k], i)\n for ind in b_inv[b_l[i]+k][bi_i:]:\n if i < ind < end_i:\n dp[i][end_i] = recur(i, ind, end_i)\n outside = max(outside, dp[i][end_i])\n return v_l[s_i] + v_l[e_i] + outside + inside\n \nn, k, *l = map(int, input().split())\nv_l, b_l = l[:n], l[n:]\n\nb_inv = {key:[] for key in range(2*k)}\nfor i in range(n):\n b_l[i] -= 1\n b_inv[b_l[i]].append(i)\n\ndp = [{} for _ in range(n)]\nans = 0\nfor i in range(n):\n if b_l[i] < k:\n bi_i = bisect.bisect_left(b_inv[b_l[i]+k], i)\n for ind in b_inv[b_l[i]+k][bi_i:]:\n if i < ind:\n dp[i][n+1] = recur(i, ind, n+1)\n ans = max(ans, dp[i][n+1])\n# print(dp)\nprint(ans)", "# -*- coding: utf-8 -*-\r\n\r\nimport math\r\nimport collections\r\nimport bisect\r\nimport heapq\r\nimport time\r\nimport random\r\nimport itertools\r\nimport sys\r\n\r\n\"\"\"\r\ncreated by shhuan at 2019/11/30 21:18\r\n\r\n\"\"\"\r\n\r\nL = [int(x) for x in input().split()]\r\nN = L[0]\r\nK = L[1]\r\nV = L[2: 2+N]\r\nB = L[2+N:]\r\n\r\n# N = 700\r\n# K = 7\r\n# V = [random.randint(0, 10) for _ in range(N)]\r\n# B = [random.randint(1, K*2) for _ in range(N)]\r\n# N, K = 6, 3\r\n# V = [4, 5, -2, 1, 1, 6]\r\n# B = [1, 3, 4, 2, 5, 6]\r\n\r\n# t0 = time.time()\r\nbi = collections.defaultdict(list)\r\nfor i, v in enumerate(B):\r\n bi[v].append(i)\r\n\r\n\r\ndp = [[float('-inf') for _ in range(N+1)] for _ in range(N)]\r\nfor i in range(N):\r\n dp[i][1] = 0\r\n dp[i][0] = 0\r\n\r\nans = 0\r\nfor l in range(2, N+1):\r\n for s in range(N-l+1):\r\n t = s+l-1\r\n dp[s][l] = max(dp[s][l], dp[s][l-1])\r\n\r\n pres = bi[B[t]-K]\r\n pl, pr = bisect.bisect_left(pres, s), bisect.bisect_right(pres, t)\r\n for i in pres[pl: pr]:\r\n dp[s][l] = max(dp[s][l], V[i] + V[t] + dp[s][max(i-s, 0)] + dp[i+1][max(t-i-1, 0)])\r\n ans = max(ans, dp[s][l])\r\nprint(ans)\r\n", "# -*- coding: utf-8 -*-\r\n\r\nimport math\r\nimport collections\r\nimport bisect\r\nimport heapq\r\nimport time\r\nimport random\r\nimport itertools\r\nimport sys\r\n\r\n\"\"\"\r\ncreated by shhuan at 2019/11/30 21:18\r\n\r\n\"\"\"\r\n\r\nL = [int(x) for x in input().split()]\r\nN = L[0]\r\nK = L[1]\r\nV = L[2: 2+N]\r\nB = L[2+N:]\r\n\r\n# N = 700\r\n# K = 7\r\n# V = [random.randint(0, 10) for _ in range(N)]\r\n# B = [random.randint(1, K*2) for _ in range(N)]\r\n# N, K = 6, 3\r\n# V = [4, 5, -2, 1, 1, 6]\r\n# B = [1, 3, 4, 2, 5, 6]\r\n\r\n# t0 = time.time()\r\nbi = [[] for _ in range(20)]\r\nL = []\r\nfor i, v in enumerate(B):\r\n bi[v].append(i)\r\n if v <= K:\r\n L.append(i)\r\n\r\n\r\ndp = [[float('-inf') for _ in range(N+1)] for _ in range(N)]\r\nfor i in range(N):\r\n dp[i][1] = 0\r\n dp[i][0] = 0\r\n\r\nans = 0\r\nfor l in range(2, N+1):\r\n for s in range(N-l+1):\r\n t = s+l-1\r\n dp[s][l] = max(dp[s][l], dp[s][l-1])\r\n\r\n pres = bi[B[t]-K]\r\n pl, pr = bisect.bisect_left(pres, s), bisect.bisect_right(pres, t)\r\n for i in pres[pl: pr]:\r\n dp[s][l] = max(dp[s][l], V[i] + V[t] + dp[s][max(i-s, 0)] + dp[i+1][max(t-i-1, 0)])\r\n ans = max(ans, dp[s][l])\r\nprint(ans)\r\n", "# -*- coding: utf-8 -*-\r\n\r\nimport math\r\nimport collections\r\nimport bisect\r\nimport heapq\r\nimport time\r\nimport random\r\nimport itertools\r\nimport sys\r\n\r\n\"\"\"\r\ncreated by shhuan at 2019/11/30 21:18\r\n\r\n\"\"\"\r\n\r\nL = [int(x) for x in input().split()]\r\nN = L[0]\r\nK = L[1]\r\nV = L[2: 2+N]\r\nB = L[2+N:]\r\n\r\n# N = 700\r\n# K = 7\r\n# V = [random.randint(0, 10) for _ in range(N)]\r\n# B = [random.randint(1, K*2) for _ in range(N)]\r\n# N, K = 6, 3\r\n# V = [4, 5, -2, 1, 1, 6]\r\n# B = [1, 3, 4, 2, 5, 6]\r\n\r\n# t0 = time.time()\r\nbi = [[] for _ in range(20)]\r\nL = []\r\nfor i, v in enumerate(B):\r\n bi[v].append(i)\r\n if v <= K:\r\n L.append(i)\r\n\r\n\r\ndp = [[float('-inf') for _ in range(N+1)] for _ in range(N)]\r\nfor i in range(N):\r\n dp[i][1] = 0\r\n dp[i][0] = 0\r\n\r\nans = 0\r\nfor l in range(2, N+1):\r\n for s in range(N-l+1):\r\n t = s+l-1\r\n dp[s][l] = max(dp[s][l], dp[s][l-1])\r\n for i in range(s, t+1):\r\n if B[i] + K == B[t]:\r\n dp[s][l] = max(dp[s][l], V[i] + V[t] + dp[s][max(i-s, 0)] + dp[i+1][max(t-i-1, 0)])\r\n ans = max(ans, dp[s][l])\r\nprint(ans)\r\n", "# -*- coding: utf-8 -*-\r\n\r\nimport math\r\nimport collections\r\nimport bisect\r\nimport heapq\r\nimport time\r\nimport random\r\nimport itertools\r\nimport sys\r\n\r\n\"\"\"\r\ncreated by shhuan at 2019/11/30 21:18\r\n\r\n\"\"\"\r\n\r\nL = [int(x) for x in input().split()]\r\n\r\nN = L[0]\r\nK = L[1]\r\nV = L[2: 2+N]\r\nB = L[2+N:]\r\n\r\n\r\nbi = collections.defaultdict(list)\r\nfor i, v in enumerate(B):\r\n bi[v].append(i)\r\n\r\n\r\nmemo = {}\r\n\r\n\r\ndef dfs(l, r):\r\n if l >= r:\r\n return 0\r\n\r\n k = (l, r)\r\n if k in memo:\r\n return memo[k]\r\n\r\n ans = 0\r\n for i in range(l, r):\r\n br = bi[B[i]+K]\r\n jl, jr = bisect.bisect_left(br, i), bisect.bisect_right(br, r)\r\n for j in br[jl: jr]:\r\n if i < j <= r:\r\n ans = max(ans, V[i]+V[j] + dfs(i+1, j-1) + dfs(j+1, r))\r\n memo[k] = ans\r\n\r\n return ans\r\n\r\n\r\nprint(dfs(0, N-1))", "# -*- coding: utf-8 -*-\r\n\r\nimport math\r\nimport collections\r\nimport bisect\r\nimport heapq\r\nimport time\r\nimport random\r\nimport itertools\r\nimport sys\r\n\r\n\"\"\"\r\ncreated by shhuan at 2019/11/30 21:18\r\n\r\n\"\"\"\r\n\r\nL = [int(x) for x in input().split()]\r\n\r\nN = L[0]\r\nK = L[1]\r\nV = L[2: 2+N]\r\nB = L[2+N:]\r\n\r\n\r\nbi = collections.defaultdict(list)\r\nfor i, v in enumerate(B):\r\n bi[v].append(i)\r\n\r\n\r\nmemo = {}\r\n\r\n\r\ndef dfs(l, r):\r\n if l >= r:\r\n return 0\r\n\r\n k = (l, r)\r\n if k in memo:\r\n return memo[k]\r\n\r\n ans = 0\r\n for i in range(l, r):\r\n for j in bi[B[i]+K]:\r\n if i < j <= r:\r\n ans = max(ans, V[i]+V[j] + dfs(i+1, j-1) + dfs(j+1, r))\r\n memo[k] = ans\r\n\r\n return ans\r\n\r\n\r\nprint(dfs(0, N-1))", "# cook your dish here\ninpu=list(map(int,input().split()))\nn,k=inpu[0],inpu[1]\nv=inpu[2:n+2]\nb=inpu[n+2:2*n+2]\nbrac={i:set() for i in range(n)}\nfor i in range(n):\n for j in range(i+1,n):\n if b[j]-b[i]==k:\n brac[i].add(j)\n \ndp=[[0 for i in range(n)] for j in range(n)]\nfor j in range(1,n):\n for i in range(n-j):\n ans=-float(\"inf\")\n if i+j in brac[i]:\n if j==1:\n ans=max(ans,v[i+j]+v[i])\n else:\n ans=max(ans,v[i+j]+v[i]+dp[i+1][i+j-1])\n for l in brac[i]:\n if l>=i+j:\n continue\n if b[l]-b[i]==k:\n if l==i+1:\n ans=max(ans,v[l]+v[i]+dp[l+1][i+j])\n else:\n ans=max(ans,v[l]+v[i]+dp[l+1][i+j]+dp[i+1][l-1])\n ans=max(ans,dp[i+1][i+j])\n dp[i][i+j]=ans\nprint(dp[0][n-1])\n", "# cook your dish here\ninpu=list(map(int,input().split()))\nn,k=inpu[0],inpu[1]\nv=inpu[2:n+2]\nb=inpu[n+2:2*n+2]\ndp=[[0 for i in range(n)] for j in range(n)]\nfor j in range(1,n):\n for i in range(n-j):\n ans=-float(\"inf\")\n if b[i+j]-b[i]==k:\n if j==1:\n ans=max(ans,v[i+j]+v[i])\n else:\n ans=max(ans,v[i+j]+v[i]+dp[i+1][i+j-1])\n for l in range(i+1,i+j):\n if b[l]-b[i]==k:\n if l==i+1:\n ans=max(ans,v[l]+v[i]+dp[l+1][i+j])\n else:\n ans=max(ans,v[l]+v[i]+dp[l+1][i+j]+dp[i+1][l-1])\n ans=max(ans,dp[i+1][i+j])\n dp[i][i+j]=ans\nprint(dp[0][n-1])\n\n", "# cook your dish here\ninpu=list(map(int,input().split()))\nn,k=inpu[0],inpu[1]\nv=inpu[2:n+2]\nb=inpu[n+2:2*n+2]\ndp=[[0 for i in range(n)] for j in range(n)]\nfor j in range(1,n):\n for i in range(n-j):\n ans=-float(\"inf\")\n if b[i+j]-b[i]==k:\n if j==1:\n ans=max(ans,v[i+j]+v[i])\n else:\n ans=max(ans,v[i+j]+v[i]+dp[i+1][i+j-1])\n for l in range(i+1,i+j):\n if b[l]-b[i]==k:\n if l==i+1:\n ans=max(ans,v[l]+v[i]+dp[l+1][i+j])\n else:\n ans=max(ans,v[l]+v[i]+dp[l+1][i+j]+dp[i+1][l-1])\n ans=max(ans,dp[i+1][i+j])\n dp[i][i+j]=ans\nprint(dp[0][n-1])\n", "inpu=list(map(int,input().split()))\r\nn,k=inpu[0],inpu[1]\r\nv=inpu[2:n+2]\r\nb=inpu[n+2:2*n+2]\r\nbrac={i:set() for i in range(n)}\r\nfor i in range(n):\r\n for j in range(i+1,n):\r\n if b[j]-b[i]==k:\r\n brac[i].add(j)\r\n \r\ndp=[[0 for i in range(n)] for j in range(n)]\r\nfor j in range(1,n):\r\n for i in range(n-j):\r\n ans=-float(\"inf\")\r\n if i+j in brac[i]:\r\n if j==1:\r\n ans=max(ans,v[i+j]+v[i])\r\n else:\r\n ans=max(ans,v[i+j]+v[i]+dp[i+1][i+j-1])\r\n for l in brac[i]:\r\n if l>=i+j:\r\n continue\r\n if b[l]-b[i]==k:\r\n if l==i+1:\r\n ans=max(ans,v[l]+v[i]+dp[l+1][i+j])\r\n else:\r\n ans=max(ans,v[l]+v[i]+dp[l+1][i+j]+dp[i+1][l-1])\r\n ans=max(ans,dp[i+1][i+j])\r\n dp[i][i+j]=ans\r\nprint(dp[0][n-1])\r\n", "inpu=list(map(int,input().split()))\r\nn,k=inpu[0],inpu[1]\r\nv=inpu[2:n+2]\r\nb=inpu[n+2:2*n+2]\r\ndp=[[0 for i in range(n)] for j in range(n)]\r\nfor j in range(1,n):\r\n for i in range(n-j):\r\n ans=-float(\"inf\")\r\n if b[i+j]-b[i]==k:\r\n if j==1:\r\n ans=max(ans,v[i+j]+v[i])\r\n else:\r\n ans=max(ans,v[i+j]+v[i]+dp[i+1][i+j-1])\r\n for l in range(i+1,i+j):\r\n if b[l]-b[i]==k:\r\n if l==i+1:\r\n ans=max(ans,v[l]+v[i]+dp[l+1][i+j])\r\n else:\r\n ans=max(ans,v[l]+v[i]+dp[l+1][i+j]+dp[i+1][l-1])\r\n ans=max(ans,dp[i+1][i+j])\r\n dp[i][i+j]=ans\r\nprint(dp[0][n-1])\r\n"]

{"inputs": [["6 3 4 5 -2 1 1 6 1 3 4 2 5 6"]], "outputs": [["13"]]}

INTERVIEW

PYTHON3

CODECHEF

31,739

088c6f856fd7cd6d13ccea67ae630919

UNKNOWN

Write a program that takes in a letterclass ID of a ship and display the equivalent string class description of the given ID. Use the table below. Class ID Ship ClassB or bBattleShipC or cCruiserD or dDestroyerF or fFrigate -----Input----- The first line contains an integer T, the total number of testcases. Then T lines follow, each line contains a character. -----Output----- For each test case, display the Ship Class depending on ID, in a new line. -----Constraints----- - 1 ≤ T ≤ 1000 -----Example----- Input 3 B c D Output BattleShip Cruiser Destroyer

["# cook your dish here\nt=int(input())\nfor i in range(t):\n n=input()\n if(n=='b' or n=='B'):\n print('BattleShip')\n elif(n=='c' or n=='C'):\n print('Cruiser')\n elif(n=='d' or n=='D'):\n print('Destroyer')\n else:\n print('Frigate')", "for _ in range(int(input())):\n p=input()\n if(p=='B' or p=='b'):\n print('BattleShip')\n elif(p=='C' or p=='c'):\n print('Cruiser')\n elif(p=='D' or p=='d'):\n print('Destroyer')\n elif(p=='F' or p=='f'):\n print('Frigate')\n", "# cook your dish here\nx=int(input())\nfor i in range(x):\n y=input()\n y=y.lower()\n if(y==\"b\"):\n print(\"BattleShip\")\n if(y==\"c\"):\n print(\"Cruiser\")\n if(y==\"d\"):\n print(\"Destroyer\")\n if(y==\"f\"):\n print(\"Frigate\")\n", "# cook your dish here\nT=int(input())\nfor i in range(T):\n n=input()\n if n==\"B\" or n==\"b\":\n print(\"BattleShip\")\n if n == \"C\" or n == \"c\":\n print(\"Cruiser\")\n if n == \"D\" or n == \"d\":\n print(\"Destroyer\")\n if n == \"F\" or n == \"f\":\n print(\"Frigate\")\n", "# cook your dish here\nn=int(input())\nd={\"B\":\"BattleShip\",\n\"C\" :\t\"Cruiser\",\n\"D\" : \t\"Destroyer\",\n\"F\" : \t\"Frigate\"}\nfor i in range(n):\n m=input().upper()\n print(d[m])\n", "t=int(input())\r\nfor i in range(0,t):\r\n ch=input()\r\n if ch=='b' or ch=='B':\r\n \tprint(\"BattleShip\\n\")\r\n elif ch=='c' or ch=='C':\r\n print(\"Cruiser\\n\")\r\n elif ch=='D' or ch=='d':\r\n print(\"Destroyer\\n\")\r\n elif ch=='F' or ch=='f':\r\n print(\"Frigate\\n\")", "t=int(input())\r\nfor i in range(0,t):\r\n ch=input()\r\n if ch=='b' or ch=='B':\r\n \tprint(\"BattleShip\\n\")\r\n elif ch=='c' or ch=='C':\r\n print(\"Cruiser\\n\")\r\n elif ch=='D' or ch=='d':\r\n print(\"Destroyer\\n\")\r\n elif ch=='F' or ch=='f':\r\n print(\"Frigate\\n\")", "# cook your dish here\nt=int(input())\nfor i in range(0,t):\n ch=input()\n if ch=='b' or ch=='B':\n print(\"BattleShip\\n\")\n elif ch=='c' or ch=='C':\n print(\"Cruiser\\n\") \n elif ch=='d' or ch=='D':\n print(\"Destroyer\\n\") \n elif ch=='f' or ch=='F':\n print(\"Frigate\\n\") ", "t=int(input())\nfor i in range(0,t):\n ch=input()\n if ch=='b' or ch=='B':\n print(\"BattleShip\\n\")\n elif ch=='c' or ch=='C':\n print(\"Cruiser\\n\") \n elif ch=='d' or ch=='D':\n print(\"Destroyer\\n\") \n elif ch=='f' or ch=='F':\n print(\"Frigate\\n\") # cook your dish here\n", "# cook your dish here\nt=int(input())\nfor i in range(t):\n id=input()\n if id==\"B\" or id==\"b\":\n print(\"BattleShip\")\n if id==\"C\" or id==\"c\":\n print(\"Cruiser\")\n if id==\"D\" or id==\"d\":\n print(\"Destroyer\")\n if id==\"F\" or id==\"f\":\n print(\"Frigate\")\n", "# cook your dish here\nn=int(input())\nfor i in range(n):\n x=input()\n if x==\"b\" or x==\"B\":\n print(\"BattleShip\")\n elif x==\"c\" or x==\"C\":\n print(\"Cruiser\")\n elif x==\"d\" or x==\"D\":\n print(\"Destroyer\")\n else:\n print(\"Frigate\")", "test_case = int(input())\n\nwhile test_case > 0:\n val = input()\n val = val.lower()\n if val == 'b':\n print(\"BattleShip\")\n elif val == 'c':\n print('Cruiser')\n elif val == 'd':\n print('Destroyer')\n elif val == 'f':\n print(\"Frigate\")\n test_case -= 1\n", "t=int(input())\nfor i in range(t):\n x=input()\n if(x=='B' or x=='b'):\n print(\"BattleShip\")\n elif (x=='C' or x=='c'):\n print(\"Cruiser\")\n elif (x=='D' or x=='d'):\n print(\"Destroyer\")\n elif (x=='F' or x=='f'):\n print(\"Frigate\")", "t=int(input())\na={'B':\"BattleShip\",'C':\"Cruiser\",'D':\"Destroyer\",'F':\"Frigate\",'b':\"BattleShip\",'c':\"Cruiser\",'d':\"Destroyer\",'f':\"Frigate\"}\nfor i in range(t):\n key=input()\n print(a[key])\n", "t=int(input())\r\ni=0\r\nwhile i<t:\r\n\tn=input()\r\n\tif n=='b' or n=='B':\r\n\t\tprint(\"BattleShip\")\r\n\tif n=='c' or n=='C':\r\n\t\tprint(\"Cruiser\")\r\n\tif n=='d' or n=='D':\r\n\t\tprint(\"Destroyer\")\r\n\tif n=='f' or n=='F':\r\n\t\tprint(\"Frigate\")\r\n\ti+=1", "# cook your dish he\nfor i in range(int(input())):\n s=input()\n if s==\"B\" or s==\"b\":\n print(\"BattleShip\")\n if s==\"C\" or s==\"c\":\n print(\"Cruiser\")\n if s==\"D\" or s==\"d\":\n print(\"Destroyer\")\n if s==\"F\" or s==\"f\":\n print(\"Frigate\")", "t = int(input())\n\nfor i in range(t):\n num = (input())\n if (num == \"B\" or num == \"b\"):\n print(\"BattleShip\")\n elif (num == \"C\" or num == \"c\"):\n print(\"Cruiser\")\n elif (num == \"D\" or num == \"d\"):\n print(\"Destroyer\")\n elif (num == \"F\" or num == \"f\" ):\n print(\"Frigate\") \n\n", "# cook your dish here\nt = int(input())\n\nfor i in range(t):\n num = (input())\n if (num == \"B\" or num == \"b\"):\n print(\"BattleShip\")\n elif (num == \"C\" or num == \"c\"):\n print(\"Cruiser\")\n elif (num == \"D\" or num == \"d\"):\n print(\"Destroyer\")\n elif (num == \"F\" or num == \"f\" ):\n print(\"Frigate\") \n", "# cook your dish here\nd={'b':\"BattleShip\",'B':\"BattleShip\",'c':\"Cruiser\",'C':\"Cruiser\",'d':\"Destroyer\",\"D\":\"Destroyer\",'f':\"Frigate\",'F':\"Frigate\"}\nt=int(input())\nfor i in range(t):\n a=input()\n print(d[a])", "# cook your dish here\nt=int(input())\nfor i in range(t):\n n=input()\n if(n=='B'or n=='b'):\n print(\"BattleShip\")\n elif (n==\"C\" or n==\"c\"):\n print(\"Cruiser\")\n elif (n==\"D\" or n==\"d\"):\n print(\"Destroyer\")\n else:\n print(\"Frigate\")\n", "dec= {\"b\":\"BattleShip\",\"c\":\"Cruiser\",\"d\":\"Destroyer\",\"f\":\"Frigate\"}\nfor _ in range(int(input())):\n word = input().lower()\n print(dec[word])", "# cook your dish here\ndec= {\"B\":\"BattleShip\",\"C\":\"Cruiser\",\"D\":\"Destroyer\",\"F\":\"Frigate\",\"b\":\"BattleShip\",\"c\":\"Cruiser\",\"d\":\"Destroyer\",\"f\":\"Frigate\"}\nT = int(input())\nfor i in range(T):\n word = input()\n print(dec[word])", "# cook your dish here\nfor _ in range(int(input())):\n d={'b':'BattleShip','c':'Cruiser','d':'Destroyer','f':'Frigate'}\n a=input().lower()\n print(d[a])", "T =int(input())\nfor i in range(0,T) :\n Ch=str(input())\n if Ch=='B'or Ch=='b':\n print(\"BattleShip\")\n if Ch=='C'or Ch=='c':\n print(\"Cruiser\")\n if Ch=='D'or Ch=='d':\n print(\"Destroyer\")\n if Ch=='F'or Ch=='f':\n print(\"Frigate\")", "# cook your dish here\nfor i in range(int(input())):\n ele=input()\n if(ele=='B' or ele=='b'):\n print('BattleShip')\n elif(ele=='C' or ele=='c'):\n print('Cruiser')\n elif(ele=='D' or ele=='d'):\n print('Destroyer')\n else:\n print('Frigate')"]

{"inputs": [["3", "B", "c", "D"]], "outputs": [["BattleShip", "Cruiser", "Destroyer"]]}

INTERVIEW

PYTHON3

CODECHEF

7,161

345904291e0f2f68608866e1b22ec387

UNKNOWN

Nature photographing may be fun for tourists, but it is one of the most complicated things for photographers. To capture all the facets of a bird, you might need more than one cameras. You recently encountered such a situation. There are $n$ photographers, so there are $n$ cameras in a line on the x-axis. All the cameras are at distinct coordinates. You want to pair up these cameras ($n$ is even) in such a way that the sum of angles subtended on the bird by the pair of cameras is maximized. Formally, let A, B be two cameras, and let P be the bird to be captured by these two cameras. The angle will APB. Note: All angles are in radians. -----Input----- - The first line of the input contains an integer $T$ denoting the number of test cases. The description of the test cases follows. - The first line of each test case contains an integer $n$. - The second line of each test case contains $n$ space-separated integers denoting the $x_i$ coordinates of the cameras. - The third line of each test case contains two space-separated integers $P, Q$ denoting the x and y coordinates of the bird respectively. -----Output----- For each test case, output your answer in a single line. Your answer would be considered correct if its absolute error is less than or equal to 1e-6 of the actual answer. -----Constraints----- - $1 \le T \le 10$ - $2 \le n \leq 100$ - $1 \le x_i \leq 300$ - $0 \le P \leq 300$ - $1 \le Q \leq 300$ -----Example Input----- 2 2 0 1 0 1 2 0 1 100 1 -----Example Output----- 0.785398163397 0.000100999899 -----Explanation----- Note: $1 \leq x_i$ is not being satisfied by the sample input, but will be satisfied in the actual test data. Testcase 1: There are only 2 cameras, so they have to paired up with each other. And the angle subtended by then is 45 degrees. Converting this to radians gives the output.

["from math import *\r\nfrom collections import *\r\nimport sys\r\ninput=sys.stdin.readline\r\nt=int(input())\r\nwhile(t):\r\n t-=1\r\n n=int(input())\r\n a=list(map(int,input().split()))\r\n p,q=map(int,input().split())\r\n s=0\r\n a.sort()\r\n for i in range(n//2):\r\n x=a[i]\r\n x1=a[n-i-1]\r\n if(x==p or x1==p):\r\n s1=abs(x-x1)\r\n s2=q\r\n s+=abs(atan2(s1,s2))\r\n elif(xp):\r\n s1=abs(p-x)\r\n ex=atan2(s1,q)\r\n s1=abs(p-x1)\r\n ex1=atan2(s1,q)\r\n ex+=ex1\r\n s+=abs(ex)\r\n else:\r\n if(p<x):\r\n s1=abs(p-x)\r\n ex=atan2(s1,q)\r\n s1=abs(p-x1)\r\n ex1=atan2(s1,q)\r\n ex=ex1-ex\r\n s+=abs(ex)\r\n else:\r\n s1=abs(p-x)\r\n ex=atan2(s1,q)\r\n s1=abs(p-x1)\r\n ex1=atan2(s1,q)\r\n ex=ex-ex1\r\n s+=abs(ex) \r\n print(s)\r\n", "from math import *\r\nfrom collections import *\r\nimport sys\r\ninput=sys.stdin.readline\r\nt=int(input())\r\nwhile(t):\r\n t-=1\r\n n=int(input())\r\n a=list(map(int,input().split()))\r\n p,q=map(int,input().split())\r\n s=0\r\n a.sort()\r\n for i in range(n//2):\r\n x=a[i]\r\n x1=a[n-i-1]\r\n if(x==p or x1==p):\r\n s1=abs(x-x1)\r\n s2=q\r\n s+=abs(atan2(s1,s2))\r\n elif(xp):\r\n s1=abs(p-x)\r\n ex=atan2(s1,q)\r\n s1=abs(p-x1)\r\n ex1=atan2(s1,q)\r\n ex+=ex1\r\n s+=abs(ex)\r\n else:\r\n if(p<x):\r\n s1=abs(p-x)\r\n ex=atan2(s1,q)\r\n s1=abs(p-x1)\r\n ex1=atan2(s1,q)\r\n ex=ex1-ex\r\n s+=abs(ex)\r\n else:\r\n s1=abs(p-x)\r\n ex=atan2(s1,q)\r\n s1=abs(p-x1)\r\n ex1=atan2(s1,q)\r\n ex=ex-ex1\r\n s+=abs(ex) \r\n print(s)\r\n", "# f = open(\"file.txt\", 'r+')\n# inp = f.readline\ninp = input\nimport math\n\n\nfor _ in range( int(input()) ):\n \n n = int(input())\n arr = list(map(int , input().split()))\n p,q = map(int , input().split())\n \n ans = 0\n arr.sort()\n \n for i in range(n//2):\n \n \n mn , mx = arr[i] , arr[n-i-1]\n \n if(mx == p) or (mn == p):\n # print(\"Case 1\")\n adj = q\n opp = mx-mn\n val = math.atan2(opp, adj)\n elif(mn < p) and (mx > p):\n # print(\"Case 2\")\n adj = q\n opp = p - mn\n valA = math.atan2(opp, adj)\n \n opp = mx - p\n valB = math.atan2(opp, adj)\n \n val = valA + valB\n else:\n # print(\"Case 3\")\n if(p < mn): \n adj = abs(mx - p)\n opp = q\n valA = math.atan2(opp, adj)\n \n adj = abs(mn - p)\n valB = math.atan2(opp, adj)\n \n val = valA - valB\n else:\n adj = abs(p - mn)\n opp = q\n valA = math.atan2(opp, adj)\n \n adj = abs(p-mx)\n valB = math.atan2(opp, adj)\n \n val = valA - valB\n val = abs(val)\n \n ans += val\n# val = print('%.2f'%val)\n print('%.12f'%ans)\n ", "import math\r\ndef ar(a,b,c):\r\n s=(a+b+c)/2\r\n return math.sqrt((s*(s-a)*(s-b)*(s-c)))\r\ndef dist(x1,y1,x2,y2):\r\n\treturn math.sqrt((y2-y1)**2 + (x2-x1)**2)\r\ndef return_angle(a,b,c):\r\n\treturn math.acos((a**2+b**2-c**2)/(2*a*b))\r\nfrom math import asin\r\nt=int(input())\r\nfor _ in range(t):\r\n n=int(input())\r\n it=list(map(int,input().split()))\r\n x,y=map(int,input().split())\r\n it.sort()\r\n tot=0\r\n vis=[0]*n\r\n pp=[]\r\n for i in range(n):\r\n for j in range(i+1,n):\r\n a=it[i]\r\n b=it[j]\r\n d=abs(a-b)\r\n d1=dist(a,0,x,y)\r\n d2=dist(b,0,x,y)\r\n ans=return_angle(d1,d2,d)\r\n # r=(d1*d2*d)/(4*ar(d1,d2,d))\r\n # ans=asin(d/(2*r))\r\n ans=abs(ans)\r\n pp.append([ans,i,j])\r\n pp.sort(reverse=True)\r\n for i in pp:\r\n if vis[i[1]] or vis[i[2]]:\r\n continue\r\n tot+=i[0]\r\n vis[i[2]]=1\r\n vis[i[1]]=1\r\n print(tot)\r\n", "import math\r\n\r\ndef calLen(cam1, cam2, bird):\r\n a = math.sqrt((cam1[0]-bird[0])**2 + (cam1[1]-bird[1])**2)\r\n b = math.sqrt((cam2[0]-bird[0])**2 + (cam2[1]-bird[1])**2)\r\n c = math.sqrt((cam1[0]-cam2[0])**2 + (cam1[1]-cam2[1])**2)\r\n\r\n return a,b,c\r\n\r\nfor h in range(int(input())):\r\n n = int(input())\r\n cams = list(map(lambda x: [int(x), 0], input().strip().split()))\r\n bird = list(map(int, input().strip().split()))\r\n cams.sort(key = lambda x:x[0])\r\n\r\n ans = 0\r\n for i in range(n//2):\r\n cam1 = cams[i]\r\n cam2 = cams[n-1-i]\r\n\r\n a, b, c = calLen(cam1, cam2, bird)\r\n ans += math.acos((a**2 + b**2 - c**2)/(2*a*b))\r\n print(ans)", "import math\r\n\r\ndef calLen(cam1, cam2, bird):\r\n a = math.sqrt((cam1[0]-bird[0])**2 + (cam1[1]-bird[1])**2)\r\n b = math.sqrt((cam2[0]-bird[0])**2 + (cam2[1]-bird[1])**2)\r\n c = math.sqrt((cam1[0]-cam2[0])**2 + (cam1[1]-cam2[1])**2)\r\n\r\n return a,b,c\r\n\r\ndef calculateAngle(a,b,c):\r\n return math.acos((a**2 + b**2 - c**2)/(2*a*b))\r\n\r\n# def best_angle()\r\n\r\n# def brute(n,cams,bird):\r\n # angles = []\r\n # for i in range(n):\r\n # temp = [0]*n\r\n # angles.append(temp)\r\n # for j in range(i+1,n):\r\n # a,b,c = calLen(cams[i],cams[j],bird)\r\n # angles[i][j] = (calculateAngle(a,b,c))\r\n # print(angles) \r\n # ans = 0\r\n # for i in range(n):\r\n \r\n # while \r\n\r\ndef angle2(cam1, cam2, bird):\r\n a, b, c = calLen(cam1, cam2, bird)\r\n return math.acos((a**2 + b**2 - c**2)/(2*a*b))\r\n\r\ndef backtrack(s, vertices, order):\r\n global res\r\n\r\n flag9 = 0\r\n for a in range(0, len(vertices)):\r\n if vertices[a] != 0:\r\n flag9 = 1\r\n break\r\n if flag9==0:\r\n # if s > res:\r\n\r\n # print(order)\r\n res = max(s, res)\r\n return\r\n for a in range(0, len(vertices)):\r\n for b in range(0, len(vertices)):\r\n if vertices[a] and vertices[b]:\r\n n1 = vertices[a]\r\n n2 = vertices[b]\r\n vertices[a] = 0\r\n vertices[b] = 0\r\n backtrack(s + angle2(n1, n2, bird), vertices,order + [vertices[a],vertices[b]] )\r\n vertices[a] = n1\r\n vertices[b] = n2\r\n\r\nfrom random import randint\r\n\r\nfor h in range(int(input())):\r\n n = int(input())\r\n cams = list(map(lambda x: (int(x), 0), input().strip().split())) \r\n # cams = [(randint(1,33),0) for a in range(0, n)]\r\n cams1 = [i for i in cams]\r\n # print(cams,cams1)\r\n bird = list(map(int, input().strip().split()))\r\n # bird = [randint(0,33),randint(1,33)]\r\n\r\n # brute(n,cams,bird)\r\n\r\n ans = 0\r\n i = 0\r\n i2 = [0,0]\r\n i4 = [0,0]\r\n\r\n while set(cams1) != {0}:\r\n\r\n # print(set(cams1) )\r\n i = 0\r\n # i2 = [0,0]\r\n for a in range(0, len(cams1)):\r\n for b in range(a+1, len(cams1)):\r\n if cams1[a] and cams1[b]:\r\n if abs( cams1[a][0] - cams1[b][0]) >= i:\r\n i = abs( cams1[a][0] - cams1[b][0])\r\n i2 = [cams1[a], cams1[b ]]\r\n i4=[a, b]\r\n # print(i2)\r\n ans += angle2(i2[0],i2[1], bird)\r\n cams1[i4[0]] = 0\r\n cams1[i4[1 ]] = 0\r\n print(ans)\r\n\r\n res = 0\r\n # backtrack(0,cams,[])\r\n # print(res)\r\n\r\n\r\n", "import math\nfor _ in range(int(input())):\n n = int(input())\n ar = list(map(int, input().split()))\n ar.sort()\n ans = 0\n p, q = map(int, input().split())\n for i in range(n//2):\n a = ar[i]\n b = ar[-(i+1)]\n t1 = math.atan((p-a)/q)\n t2 = math.atan((b-p)/q)\n ans += (t1+t2)\n print(ans)", "import math\r\nfor _ in range(int(input())):\r\n n = int(input())\r\n ar = list(map(int, input().split()))\r\n ar.sort()\r\n ans = 0\r\n p, q = map(int, input().split())\r\n for i in range(n//2):\r\n a = ar[i]\r\n b = ar[-(i+1)]\r\n t1 = math.atan((p-a)/q)\r\n t2 = math.atan((b-p)/q)\r\n ans += (t1+t2)\r\n print(ans)\r\n", "t=int(input())\r\nimport math\r\nfor i in range(t):\r\n n=int(input())\r\n l=list(map(int,input().split()))\r\n l.sort()\r\n p,q=map(int,input().split())\r\n i=0\r\n j=-1\r\n c=0\r\n while True:\r\n if l[i]>l[j]:\r\n break\r\n a=math.sqrt((p-l[i])**2+q**2)\r\n b=abs(l[i]-l[j])\r\n d=math.sqrt((p-l[j])**2+q**2)\r\n e=a**2+d**2-b**2\r\n e/=2*a*d\r\n e=math.acos(e)\r\n round(e,6)\r\n c+=e\r\n \r\n i+=1\r\n j-=1\r\n round(c,6)\r\n print(c)\r\n \r\n \r\n", "from math import *\r\nt = int(input())\r\nfor _ in range(t):\r\n n = int(input())\r\n l = list(map(int,input().split()))\r\n l.sort()\r\n x,y = map(int,input().split())\r\n ans = 0\r\n for i in range(n//2):\r\n a = l[i]\r\n b = l[i+n//2]\r\n theta1 = (b-x)/y\r\n theta2 = (a-x)/y\r\n theta1 = atan(theta1)\r\n theta2 = atan(theta2)\r\n ans += (theta1-theta2)\r\n print(abs(ans)) \r\n \r\n", "from math import *\r\nt = int(input())\r\nfor _ in range(t):\r\n n = int(input())\r\n l = list(map(int,input().split()))\r\n l.sort()\r\n x,y = map(int,input().split())\r\n ans = 0\r\n for i in range(n//2):\r\n a = l[i]\r\n b = l[n-i-1]\r\n theta1 = (b-x)/y\r\n theta2 = (a-x)/y\r\n theta1 = atan(theta1)\r\n theta2 = atan(theta2)\r\n ans += (theta1-theta2)\r\n print(abs(ans)) \r\n \r\n", "from math import atan\r\nt = int(input())\r\ndef f(a,b,x,y):\r\n m = (b-x)/y\r\n n = (a-x)/y\r\n return atan(m)-atan(n);\r\nfor i in range(t):\r\n n = int(input())\r\n a = list(map(int,input().split()))\r\n a.sort()\r\n p,q = map(int,input().split())\r\n k = n//2\r\n s = 0\r\n for j in range(k):\r\n s = s+f(a[j],a[n-1-j],p,q)\r\n if s<0:\r\n s = -s\r\n print(s)\r\n", "from math import *\r\n\r\n\r\nfor t in range(int(input())):\r\n\tn = int(input())\r\n\tarr = list(map(int, input().split()))\r\n\tl = list(map(int, input().split()))\r\n\tarr.sort()\r\n\tx = l[0]\r\n\ty = l[1]\r\n\tans = 0\r\n\tfor i in range(int(n/2)):\r\n\t\tx1 = arr[i]\r\n\t\tx2 = arr[n-i-1]\r\n\t\tif x1 < x and x2 <= x:\r\n\t\t\tangle = atan((x-x1)/y) - atan((x-x2)/y)\r\n\t\telif x1 < x and x2 > x:\r\n\t\t\tangle = atan((x-x1)/y) + atan((x2-x)/y)\r\n\t\telse:\r\n\t\t\tangle = atan((x2-x)/y) - atan((x1-x)/y)\r\n\t\tans += angle\r\n\tprint(ans)\r\n", "from math import atan\r\ndef f(a,b,x,y):\r\n m=(a-x)/y\r\n n=(b-x)/y\r\n return atan(m)-atan(n)\r\nfor i in range(int(input())):\r\n c=int(input())\r\n b=list(map(int,input().split()))\r\n b.sort()\r\n x,y=map(int,input().split())\r\n s=0\r\n k=c//2\r\n for i in range(k):\r\n s += f(b[i],b[c-1-i],x,y)\r\n if s < 0:\r\n s = -s\r\n print(s)", "import math\r\nT=int(input())\r\nfor i in range(T):\r\n n=int(input())\r\n A=[int(k) for k in input().split()]\r\n A.sort()\r\n P,Q=[int(j) for j in input().split()]\r\n def angle(x1,x2,x,y):\r\n y=math.atan((x2-x)/y) + math.atan((x-x1)/y)\r\n return y\r\n c=0\r\n for i in range(n//2):\r\n c=c+angle(A[i],A[n-i-1],P,Q)\r\n\r\n print(c) \r\n\r\n\r\n", "import math\r\nfor _ in range(int(input())):\r\n n=int(input())\r\n arr=list(map(int,input().split()))\r\n p,q=map(int,input().split())\r\n k=[]\r\n for i in range(n):\r\n if p==arr[i]:\r\n k.append(0)\r\n else:\r\n k.append(math.atan((p-arr[i])/q))\r\n k=sorted(k) \r\n print(round(abs(sum(k[:n//2])-sum(k[n//2:])),12))\r\n", "import math\nfor i in range(int(input())):\n\tn=int(input())\n\ttmp=input().split()\n\tarr=[]\n\tfor j in tmp:\n\t\tarr.append(int(j))\n\ttmp=input().split()\n\tx=int(tmp[0])\n\ty=int(tmp[1])\n\ts=0\n\tarr.sort()\n\tfor j in range(int(n/2)):\n\t\td1=(arr[j]-x)**2+y**2\n\t\td2=(arr[n-j-1]-x)**2+y**2\n\t\td3=(arr[n-1-j]-arr[j])**2\n\t\ts+=math.acos((d1+d2-d3)/(2*math.sqrt(d1)*math.sqrt(d2)))\n\tprint('{0:0.12}'.format(s))", "import math\r\nfor _ in range(int(input())):\r\n n = int(input())\r\n cameras = list(map(int,input().split()))\r\n p,q = map(int,input().split())\r\n cameras.sort()\r\n sumA = 0\r\n # radians c**2 = a**2 + b**2 -2ac(Cos(degree))\r\n for i in range(n//2):\r\n p1 = cameras[i]\r\n p2 = cameras[n-1-i]\r\n p12 = p2-p1\r\n # print(p1,p2)\r\n sideA = math.sqrt((p-p1)**2 + q**2)\r\n sideB = math.sqrt((p-p2)**2 + q**2)\r\n # print('sideA:',sideA,'sideB:',sideB)\r\n radians = math.acos(((p12**2)-sideA**2 - sideB**2 )/(-2*sideA*sideB))\r\n sumA +=radians\r\n\r\n print(sumA)", "from math import *\r\n\r\nt=int(input())\r\nfor i in range(t):\r\n\tn=int(input())\r\n\tx=[float(y) for y in input().split()]\r\n\tx.sort()\r\n\tp,q=input().split()\r\n\tp=float(p)\r\n\tq=float(q)\r\n\tma=0.0\r\n\tfor ind in range(n//2):\r\n\t\ti=x[ind]\r\n\t\tj=x[n-ind-1]\t\r\n\t\tt1=t2=pi/2\r\n\t\tif (i!=p):\r\n\t\t\tt1=atan(q/abs(i-p))\r\n\t\tif (i>p):\r\n\t\t\tt1=pi-t1\r\n\t\tif (j!=p):\r\n\t\t\tt2=atan(q/abs(j-p))\r\n\t\tif (j<p):\r\n\t\t\tt2=pi-t2\r\n\t\tma+=(pi-t1-t2)\r\n\tprint(ma)\r\n", "import math\r\nfor _ in range(int(input())):\r\n\tn = int(input())\r\n\txs = list(map(int,input().split()))\r\n\tp,q = map(int,input().split())\r\n\tangles = sorted(math.atan((x-p)/q) for x in xs)\r\n\tprint(sum(angles[n//2:])-sum(angles[:n//2]))\r\n\r\n", "import math\r\nt=int(input())\r\nfor _ in range(t):\r\n n=int(input())\r\n a=list(map(int,input().split()))\r\n p,q=list(map(int,input().split()))\r\n a=sorted(a)\r\n b=[0]*len(a)\r\n s=0\r\n for i in range(len(a)):\r\n b[i]=a[i]-p\r\n for i in range(len(a)//2):\r\n s=s-math.atan(b[i]/q)+math.atan(b[n-1-i]/q)\r\n print(s)", "from math import atan\r\nt = int(input())\r\ndef f(a,b,x,y):\r\n m = (b-x)/y\r\n n = (a-x)/y\r\n return atan(m)-atan(n);\r\nfor i in range(t):\r\n n = int(input())\r\n a = list(map(int,input().split()))\r\n a.sort()\r\n p,q = map(int,input().split())\r\n k = n//2\r\n s = 0\r\n for j in range(k):\r\n s = s+f(a[j],a[n-1-j],p,q)\r\n if s<0:\r\n s = -s\r\n print(s)\r\n", "import math\r\n\r\ndef angle(x1, B, x2):\r\n xb, yb = B\r\n a = math.sqrt((xb-x1)**2+yb**2)\r\n b = math.sqrt((xb-x2)**2+yb**2)\r\n c = abs(x2-x1)\r\n return math.acos((a**2+b**2-c**2)/(2*a*b))\r\n\r\n\r\nfor _ in range(int(input())):\r\n n = int(input())\r\n X = [int(x) for x in input().split()]\r\n B = [int(x) for x in input().split()]\r\n X.sort()\r\n l, r = 0, len(X)-1\r\n ang = 0\r\n while l<r:\r\n ang += angle(X[l], B, X[r])\r\n l += 1\r\n r -= 1\r\n print(ang)", "from math import acos,sqrt\r\nt=int(input())\r\n\r\n\r\ndef distance(x,y,p,q):\r\n a=abs(x-y)\r\n b=sqrt((p-x)**2+q**2)\r\n c=sqrt((p-y)**2+q**2)\r\n angle = acos((c ** 2 + b ** 2 - a ** 2) / (2 * b * c))\r\n return angle\r\n\r\n\r\ndef main():\r\n for _ in range(t):\r\n n=int(input())\r\n c=[int(x) for x in input().split()]\r\n p,q=map(int,input().split())\r\n c.sort()\r\n l=0\r\n h=n-1\r\n sum1=0\r\n while l<h:\r\n angle=distance(c[l],c[h],p,q)\r\n sum1+=angle\r\n l+=1\r\n h-=1\r\n print(sum1)\r\n\r\n\r\ndef __starting_point():\r\n main()\n__starting_point()"]

{"inputs": [["2", "2", "0 1", "0 1", "2", "0 1", "100 1", ""]], "outputs": [["0.785398163397", "0.000100999899"]]}

INTERVIEW

PYTHON3

CODECHEF

16,651

34af6b3ddf701cf4352e90de94842a31

UNKNOWN

Three Best Friends $AMAN$ , $AKBAR$ , $ANTHONY$ are planning to go to “GOA” , but just like every other goa trip plan there is a problem to their plan too. Their parents will only give permission if they can solve this problem for them They are a given a number N and they have to calculate the total number of triplets (x ,y ,z) Satisfying the given condition y * x +z=n. For ex if N=3 Then there exist 3 triplets( x ,y ,z): (1,1,2) , (1,2,1) , (2,1,1) which satisfy the condition Help the group to get permission for the trip -----Input:----- - First line will contain the number $N$. -----Output:----- the possible number of triplets satisfying the given condition -----Constraints----- - $2 \leq N \leq 10^6$ -----Sample Input:----- 3 -----Sample Output:----- 3 -----EXPLANATION:----- there exist 3 triplets ( x ,y ,z): (1,1,2) , (1,2,1) , (2,1,1) which satisfy the condition

["import sys\r\ndef get_array(): return list(map(int , sys.stdin.readline().strip().split()))\r\ndef get_ints(): return list(map(int, sys.stdin.readline().strip().split()))\r\ndef input(): return sys.stdin.readline().strip()\r\nimport sys\r\nsys.setrecursionlimit(10**9)\r\nfrom math import sqrt,ceil,floor\r\nn=int(input())\r\nco=0\r\nans=0\r\nfor i in range(1,n):\r\n ans+=n//i\r\n if n%i==0:\r\n ans-=1\r\nprint(ans)\r\n\r\n", "# cook your dish here\ntry:\n n=int(input())\n l=[int(i) for i in range(1,n+1)]\n cnt=0\n for i in range(1,n+1):\n for j in range(1,(n//i)+1):\n if 1<=n-(i*j)<=n:\n # print(i,j,(n-(i*j)))\n cnt+=1\n print(cnt)\nexcept EOFError as e: pass", "N = int(input())\r\nr = range(1, N + 1)\r\ncount = 0\r\nfor i in r:\r\n\tfor j in r:\r\n\t\tif i * j >= N: break\r\n\t\tcount += 1\r\nprint(count)", "N = int(input())\r\n\r\ncount = 0\r\nfor i in range(1, N):\r\n\tfor j in range(1, N):\r\n\t\tif i * j >= N: break\r\n\t\tcount += 1\r\nprint(count)", "\n\nn=int(input())\nans=0\nfor i in range(1,n):\n ans+=(n-1)//i\nprint(ans)"]

{"inputs": [["3"]], "outputs": [["3"]]}

INTERVIEW

PYTHON3

CODECHEF

1,129

11f736cf93352e54ffc606a124301fd9

UNKNOWN

Maheshmati and Sangu are playing a game. First, Maheshmati gives Sangu a sequence of $N$ distinct integers $a_1, a_2, \dots, a_N$ (not necessarily sorted) and an integer $K$. Sangu has to create all subsequences of this sequence with length $K$. For each subsequence, he has to write down the product of $K-2$ integers: all elements of this subsequence except the minimum and maximum element. Sangu wins the game if he is able to write down all these numbers and tell Maheshmati their product (modulo $10^9+7$, since it can be very large). However, Sangu is a very lazy child and thus wants you to help him win this game. Compute the number Sangu should tell Maheshmati! -----Input----- - The first line of the input contains a single integer $T$ denoting the number of test cases. The description of $T$ test cases follows. - The first line of each test case contains two space-separated integers $N$ and $K$. - The second line contains $N$ space-separated integers $a_1, a_2, \dots, a_N$. -----Output----- For each test case, print a single line containing one integer — the product of all numbers written down by Sangu modulo $10^9+7$. -----Constraints----- - $1 \le T \le 10$ - $3 \le N \le 5,000$ - $3 \le K \le N$ - $1 \le a_i \le 10,000$ for each valid $i$ - the numbers $a_1, a_2, \dots, a_N$ are pairwise distinct -----Subtasks----- Subtask #1 (20 points): $1 \le N \le 10$ Subtask #2 (80 points): original constraints -----Example Input----- 1 4 3 1 2 3 4 -----Example Output----- 36 -----Explanation----- Example case 1: There are four possible subsequences: - $[1, 2, 3]$ (Sangu should write down $2$.) - $[1, 3, 4]$ (Sangu should write down $3$.) - $[1, 2, 4]$ (Sangu should write down $2$.) - $[2, 3, 4]$ (Sangu should write down $3$.) The required product is $2 \cdot 3 \cdot 2 \cdot 3 = 36$.

["f = 5003*[0]\nmodn = 1000000007\n\n\ndef qPow(a, b):\n nonlocal modn\n res = 1\n while b > 0:\n if (b & 1) == 1:\n res = res * a % modn\n a = a * a % modn\n b = b >> 1\n return res\n\n\ndef getF():\n nonlocal f\n f[0] = 1\n for i in range(1, 5001):\n f[i] = f[i-1] * i\n\n\ndef __starting_point():\n getF()\n T = int(input())\n while T > 0:\n T = T - 1\n n, k = list(map(int,input().split()))\n lis = list(map(int, input().split()))\n lis = sorted(lis)\n res = 1\n for i in range(n):\n zhi = f[n-1]//f[k-1]//f[n-k]\n if i >= k-1:\n zhi = zhi - f[i]//f[k-1]//f[i+1-k]\n if n-i-1 >= k-1:\n zhi = zhi - f[n-i-1]//f[k-1]//f[n-i-k]\n zhi = zhi % (modn-1)\n # print(zhi)\n res = res * qPow(lis[i], zhi) % modn\n print(res)\n\n__starting_point()", "# cook your dish here\nMOD = (10**9) + 7\n\ndef ncr(n, r, p): \n # initialize numerator \n # and denominator \n num = den = 1 \n for i in range(r): \n num = (num * (n - i)) % p \n den = (den * (i + 1)) % p \n return (num * pow(den, \n p - 2, p)) % p \n\nfor _ in range(int(input())):\n \n n , k = list(map( int, input().split()))\n \n arr = list( map( int, input().split()) )\n \n arr = sorted(arr)\n \n value = ncr(n-1,k-1,MOD)\n \n ans = 1\n \n \n \n for x in range(1,n-1):\n \n if (n - x - 1) >= (k-1) :\n \n temp1 = ncr(n-x-1,k-1,MOD)\n else:\n temp1 = 0\n \n if x >= (k-1):\n \n temp2 = ncr(x,k-1,MOD)\n else:\n temp2 = 0 \n \n \n # print(value,ans,temp1,temp2)\n ans = ( ans * (arr[x]**( value - temp2 - temp1 )) )%MOD\n \n print(ans)\n \n \n \n \n", "# cook your dish here\nMOD = (10**9) + 7\n\ndef ncr(n, r, p): \n # initialize numerator \n # and denominator \n num = den = 1 \n for i in range(r): \n num = (num * (n - i)) % p \n den = (den * (i + 1)) % p \n return (num * pow(den, \n p - 2, p)) % p \n\nfor _ in range(int(input())):\n \n n , k = list(map( int, input().split()))\n \n arr = list( map( int, input().split()) )\n \n arr = sorted(arr)\n \n value = ncr(n-1,k-1,MOD)\n \n ans = 1\n \n \n \n for x in range(1,n-1):\n \n if (n - x - 1) >= (k-1) :\n \n temp1 = ncr(n-x-1,k-1,MOD)\n else:\n temp1 = 0\n \n if x >= (k-1):\n \n temp2 = ncr(x,k-1,MOD)\n else:\n temp2 = 0 \n \n \n # print(value,ans,temp1,temp2)\n ans = ( ans * (arr[x]**( value - temp2 - temp1 )) )%MOD\n \n print(ans)\n \n \n \n \n", "# cook your dish here\nMOD = (10**9) + 7\n\ndef nCrModpDP(n, r, p): \n \n # The array C is going to store \n # last row of pascal triangle \n # at the end. And last entry \n # of last row is nCr \n C = [0] * (n + 1); \n \n # Top row of Pascal Triangle \n C[0] = 1; \n \n # One by constructs remaining \n # rows of Pascal Triangle from \n # top to bottom \n for i in range(1, (n + 1)): \n \n # Fill entries of current \n # row using previous row \n # values \n j = min(i, r); \n while(j > 0): \n C[j] = (C[j] + C[j - 1]) % p; \n j -= 1; \n return C[r]; \n \n# Lucas Theorem based function that \n# returns nCr % p. This function \n# works like decimal to binary \n# conversion recursive function. \n# First we compute last digits of \n# n and r in base p, then recur \n# for remaining digits \ndef nCrModpLucas(n, r, p): \n \n # Base case \n if (r == 0): \n return 1; \n \n # Compute last digits of n \n # and r in base p \n ni = int(n % p); \n ri = int(r % p); \n \n # Compute result for last digits \n # computed above, and for remaining \n # digits. Multiply the two results \n # and compute the result of \n # multiplication in modulo p. \n # Last digits of n and r \n return (nCrModpLucas(int(n / p), int(r / p), p) * \n nCrModpDP(ni, ri, p)) % p;\n\nfor _ in range(int(input())):\n \n n , k = list(map( int, input().split()))\n \n arr = list( map( int, input().split()) )\n \n arr = sorted(arr)\n \n value = nCrModpLucas(n-1,k-1,MOD)\n \n ans = 1\n \n \n \n for x in range(1,n-1):\n \n if (n - x - 1) >= (k-1) :\n \n temp1 = nCrModpLucas(n-x-1,k-1,MOD)\n else:\n temp1 = 0\n \n if x >= (k-1):\n \n temp2 = nCrModpLucas(x,k-1,MOD)\n else:\n temp2 = 0 \n \n \n # print(value,ans,temp1,temp2)\n ans = ( ans * (arr[x]**( value - temp2 - temp1 )) )%MOD\n \n print(ans)\n \n \n \n \n", "# cook your dish here\nMOD = (10**9) + 7\n\ndef binomialCoefficient(n, r, p): \n\n # The array C is going to store last row of \n # pascal triangle at the end. And last entry \n # of last row is nCr. \n C = [0 for i in range(r+1)] \n \n C[0] = 1 # Top row of Pascal Triangle \n \n # One by constructs remaining rows of Pascal \n # Triangle from top to bottom \n for i in range(1, n+1): \n \n # Fill entries of current row \n # using previous row values \n for j in range(min(i, r), 0, -1): \n \n # nCj = (n - 1)Cj + (n - 1)C(j - 1) \n C[j] = (C[j] + C[j-1]) % p \n \n return int(C[r])\n\nfor _ in range(int(input())):\n \n n , k = list(map( int, input().split()))\n \n arr = list( map( int, input().split()) )\n \n arr = sorted(arr)\n \n value = binomialCoefficient(n-1,k-1,MOD)\n \n ans = 1\n \n \n \n for x in range(1,n-1):\n \n if (n - x - 1) >= (k-1) :\n \n temp1 = binomialCoefficient(n-x-1,k-1,MOD)\n else:\n temp1 = 0\n \n if x >= (k-1):\n \n temp2 = binomialCoefficient(x,k-1,MOD)\n else:\n temp2 = 0 \n \n \n # print(value,ans,temp1,temp2)\n ans = ( ans * (arr[x]**( value - temp2 - temp1 )) )%MOD\n \n print(ans)\n \n \n \n \n", "# cook your dish here\nMOD = (10**9) + 7\n\ndef binomialCoefficient(n, k): \n # since C(n, k) = C(n, n - k) \n # Declaring an empty array \n C = [0 for i in range(k+1)] \n C[0] = 1 #since nC0 is 1 \n \n for i in range(1,n+1): \n \n # Compute next row of pascal triangle using \n # the previous row \n j = min(i ,k) \n while (j>0): \n C[j] = C[j] + C[j-1] \n j -= 1\n \n return int(C[k] )\n\nfor _ in range(int(input())):\n \n n , k = list(map( int, input().split()))\n \n arr = list( map( int, input().split()) )\n \n arr = sorted(arr)\n \n value = binomialCoefficient(n-1,k-1)\n \n ans = 1\n \n \n \n for x in range(1,n-1):\n \n if (n - x - 1) >= (k-1) :\n \n temp1 = binomialCoefficient(n-x-1,k-1)\n else:\n temp1 = 0\n \n if x >= (k-1):\n \n temp2 = binomialCoefficient(x,k-1)\n else:\n temp2 = 0 \n \n \n # print(value,ans,temp1,temp2)\n ans = ( ans * (arr[x]**( value - temp2 - temp1 )) )%MOD\n \n print(ans)\n \n \n \n \n", "# cook your dish here\nMOD = (10**9) + 7\n\ndef binomialCoefficient(n, k): \n # since C(n, k) = C(n, n - k) \n if(k > n - k): \n k = n - k \n # initialize result \n res = 1\n # Calculate value of \n # [n * (n-1) *---* (n-k + 1)] / [k * (k-1) *----* 1] \n for i in range(k): \n res = res * (n - i) \n res = res / (i + 1) \n return int(res) \n\nfor _ in range(int(input())):\n \n n , k = list(map( int, input().split()))\n \n arr = list( map( int, input().split()) )\n \n arr = sorted(arr)\n \n value = binomialCoefficient(n-1,k-1)\n \n ans = 1\n \n \n \n for x in range(1,n-1):\n \n if (n - x - 1) >= (k-1) :\n \n temp1 = binomialCoefficient(n-x-1,k-1)\n else:\n temp1 = 0\n \n if x >= (k-1):\n \n temp2 = binomialCoefficient(x,k-1)\n else:\n temp2 = 0 \n \n \n # print(value,ans,temp1,temp2)\n ans = ( ans * (arr[x]**( value - temp2 - temp1 )) )%MOD\n \n print(ans)\n \n \n \n \n", "# cook your dish here\n\nfrom itertools import combinations\n\n\nfor i in range(int(input())) :\n \n n , k = list(map(int,input().split()))\n \n arr = list(map(int,input().split()))\n \n arr.sort()\n \n sub = [arr[i] for i in range(1,n-1)]\n \n comb = combinations(sub,k-2) \n \n prod = 1\n \n #print(list(comb))\n \n for i in list(comb) :\n \n maximum = max(i)\n \n minimum = min(i)\n \n \n ind_max , ind_min = arr.index(maximum) , arr.index(minimum) \n \n \n \n aftermax = n - ind_max - 1 \n \n beforemin = ind_min \n \n \n \n temp = aftermax * beforemin\n \n for j in i :\n \n \n \n prod = prod * (j**temp)\n \n print(prod % (10**9 + 7))\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n", "MOD=10**9+7\np=100000\nfact=[0]*p \nfact[0]=1 \nfor i in range(1,p):\n fact[i]=(fact[i-1]*i)%MOD\ndef MI(a,MOD):\n return pow(a,MOD-2,MOD)\ndef nck(n, k,MOD):\n if n==k or k==0:\n return 1 \n if n<k:\n return 0 \n return (fact[n]*MI(fact[k],MOD)%MOD*MI(fact[n-k],MOD)%MOD)%MOD\nfor _ in range(int(input())):\n n,k=map(int,input().split())\n prod=1\n l=[int(i) for i in input().split()]\n l.sort()\n for i in range(n):\n tot=nck(n-1,k-1,MOD)\n x=n-i\n asmin=nck(x-1,k-1,MOD)\n y=i+1\n asmax=nck(y-1,k-1,MOD)\n req=tot-asmin-asmax\n prod=(prod*pow(l[i],req,MOD))%MOD\n print(prod%MOD)", "MOD=10**9+7\np=100000\nfact=[0]*p \nfact[0]=1 \nfor i in range(1,p):\n fact[i]=(fact[i-1]*i)%MOD\ndef MI(a,MOD):\n return pow(a,MOD-2,MOD)\ndef nck(n, k):\n if n==k or k==0:\n return 1 \n if n<k:\n return 0 \n return (fact[n]*MI(fact[k],MOD)%MOD*MI(fact[n-k],MOD)%MOD)%MOD\nfor _ in range(int(input())):\n n,k=map(int,input().split())\n prod=1\n l=[int(i) for i in input().split()]\n l.sort()\n for i in range(n):\n tot=nck(n-1,k-1)\n x=n-i\n asmin=nck(x-1,k-1)\n y=i+1\n asmax=nck(y-1,k-1)\n req=tot-asmin-asmax\n prod=(prod*pow(l[i],req,MOD))%MOD\n print(prod%MOD)", "MOD=10**9+7\np=1000000\nfact=[0]*p \nfact[0]=1 \nfor i in range(1,p):\n fact[i]=(fact[i-1]*i)%MOD\ndef MI(a,MOD):\n return pow(a,MOD-2,MOD)\ndef nck(n, k):\n if n==k or k==0:\n return 1 \n if n<k:\n return 0 \n return (fact[n]*MI(fact[k],MOD)%MOD*MI(fact[n-k],MOD)%MOD)%MOD\nfor _ in range(int(input())):\n n,k=map(int,input().split())\n prod=1\n l=[int(i) for i in input().split()]\n l.sort()\n for i in range(n):\n tot=nck(n-1,k-1)\n x=n-i\n asmin=nck(x-1,k-1)\n y=i+1\n asmax=nck(y-1,k-1)\n req=tot-asmin-asmax\n prod*=pow(l[i],req,MOD)\n print(prod%MOD)", "MOD=10**9+7\np=1000000\nfact=[0]*p \nfact[0]=1 \nfor i in range(1,p):\n fact[i]=(fact[i-1]*i)%MOD\ndef MI(a,MOD):\n return pow(a,MOD-2,MOD)\ndef nck(n, k):\n if n==k or k==0:\n return 1 \n if n<k:\n return 0 \n return fact[n]*MI(fact[k],MOD)*MI(fact[n-k],MOD)%MOD\nfor _ in range(int(input())):\n n,k=map(int,input().split())\n prod=1\n l=[int(i) for i in input().split()]\n l.sort()\n for i in range(n):\n tot=nck(n-1,k-1)\n x=n-i\n asmin=nck(x-1,k-1)\n y=i+1\n asmax=nck(y-1,k-1)\n req=tot-asmin-asmax\n prod*=pow(l[i],req,MOD)\n print(prod%MOD)", "MOD=10**9+7\np=6000\nfact=[0]*p \nfact[0]=1 \nfor i in range(1,p):\n fact[i]=(fact[i-1]*i)%MOD\ndef MI(a,MOD):\n return pow(a,MOD-2,MOD)\ndef nck(n, k):\n if n==k or k==0:\n return 1 \n if n<k:\n return 0 \n return fact[n]*MI(fact[k],MOD)*MI(fact[n-k],MOD)%MOD\nfor _ in range(int(input())):\n n,k=map(int,input().split())\n prod=1\n l=[int(i) for i in input().split()]\n l.sort()\n #nck=combo_nck(n,k)\n for i in range(n):\n tot=nck(n-1,k-1)\n # print(tot)\n x=n-i\n if x>=k-1:\n asmin=nck(x-1,k-1)\n else:\n asmin=0\n y=i+1\n if y>=k-1:\n asmax=nck(y-1,k-1)\n else:\n asmax=0\n #print(asmin)\n #print(asmin,asmax)\n prod*=pow(l[i],tot-asmin-asmax,MOD)\n # print(prod)\n print(prod%MOD)"]

{"inputs": [["1", "4 3", "1 2 3 4"]], "outputs": [["36"]]}

INTERVIEW

PYTHON3

CODECHEF

11,058

c9afd6a7eb3626d1cb4bc489bbb65c69

UNKNOWN

There are total $N$ cars in a sequence with $ith$ car being assigned with an alphabet equivalent to the $ith$ alphabet of string $S$ . Chef has been assigned a task to calculate the total number of cars with alphabet having a unique even value in the given range X to Y (both inclusive) . The value of an alphabet is simply its position in alphabetical order e.g.: a=1, b=2, c=3… The chef will be given $Q$ such tasks having varying values of $X$ and $Y$ Note: string $S$ contains only lowercase alphabets -----Input----- First line of input contains a string $S$ of length $N$. Second line contains an integer denoting no. of queries $Q$. Next q lines contain two integers denoting values of $X$ and $Y$. -----Output----- For each query print a single integer denoting total number of cars with alphabet having a unique even value in the given range $X$ to $Y$. -----Constraints----- - $1 \leq n \leq 10^5$ - $1 \leq q \leq 10^5$ -----Example Input----- bbccdd 5 1 2 3 4 5 6 1 6 2 5 -----Example Output----- 1 0 1 2 2 -----Explanation:----- Example case 1: Query 1: range 1 to 2 contains the substring $"bb"$ where each character has a value of 2. Since we will only be considering unique even values, the output will be 1

["arr = list(input())\r\nn = len(arr)\r\nans = list()\r\n#for i in arr:\r\n #ans.append(ord(i)-96)\r\nli = ['b','d','f','h','j','l','n','p','r','t','v','x','z']\r\ns = set(arr)\r\ntemp = s.intersection(li)\r\nfor _ in range(int(input())):\r\n x,y = list(map(int,input().split()))\r\n li = list(temp)\r\n #s = set()\r\n c=0\r\n for i in range(x-1,y):\r\n if arr[i] in li:\r\n c+=1 \r\n li.remove(arr[i])\r\n if len(li)==0:\r\n break\r\n print(c)\r\n", "S=input()\nN=len(S)\nQ=int(input())\nA=[[0]*27 for i in range(N)]\nfor i in range(N):\n try:\n if i>0:\n for j in range(1,27):\n A[i][j]=A[i-1][j]\n A[i][ord(S[i])-ord('a')+1]+=1\n except:\n pass\n# for i in A:\n# print(i)\nwhile Q>0:\n Q-=1\n X,Y = [int(x) for x in input().split()]\n ans=0\n X-=1\n Y-=1\n for i in range(2,27,2):\n try:\n if X>0:\n val = A[Y][i]-A[X-1][i]\n else:\n val = A[Y][i]\n except:\n pass\n if (val)>0:\n ans+=1\n print(ans)", "\r\nstring = input()\r\ntoken = {}\r\nfor i in range(98,123,2):\r\n token[chr(i)] = 0\r\nl = [token.copy()]\r\nfor letter in string:\r\n if (ord(letter)+1)%2:\r\n token[letter] += 1\r\n l.append(token.copy())\r\nq = int(input())\r\nfor query in range(q):\r\n a,b = map(int,input().split())\r\n if a > b:\r\n a,b = b,a\r\n ans = 0\r\n if a > len(string):\r\n a = len(string)\r\n if b > len(string):\r\n b = len(string)\r\n if a < 1:\r\n a = 1\r\n if b < 1:\r\n b = 1\r\n for i in range(98,123,2):\r\n if l[b][chr(i)] > l[a-1][chr(i)]:\r\n ans += 1\r\n print(ans) ", "import sys\r\nfrom functools import lru_cache, cmp_to_key\r\nfrom heapq import merge, heapify, heappop, heappush\r\nfrom math import *\r\nfrom collections import defaultdict as dd, deque, Counter as C\r\nfrom itertools import combinations as comb, permutations as perm\r\nfrom bisect import bisect_left as bl, bisect_right as br, bisect\r\nfrom time import perf_counter\r\nfrom fractions import Fraction\r\nimport copy\r\nimport time\r\nstarttime = time.time()\r\nmod = int(pow(10, 9) + 7)\r\nmod2 = 998244353\r\n# from sys import stdin\r\n# input = stdin.readline\r\ndef data(): return sys.stdin.readline().strip()\r\ndef out(*var, end=\"\\n\"): sys.stdout.write(' '.join(map(str, var))+end)\r\ndef L(): return list(sp())\r\ndef sl(): return list(ssp())\r\ndef sp(): return map(int, data().split())\r\ndef ssp(): return map(str, data().split())\r\ndef l1d(n, val=0): return [val for i in range(n)]\r\ndef l2d(n, m, val=0): return [l1d(n, val) for j in range(m)]\r\ntry:\r\n # sys.setrecursionlimit(int(pow(10,7)))\r\n sys.stdin = open(\"input.txt\", \"r\")\r\n # sys.stdout = open(\"../output.txt\", \"w\")\r\nexcept:\r\n pass\r\ndef pmat(A):\r\n for ele in A:\r\n print(*ele,end=\"\\n\")\r\ndef seive():\r\n prime=[1 for i in range(10**6+1)]\r\n prime[0]=0\r\n prime[1]=0\r\n for i in range(10**6+1):\r\n if(prime[i]):\r\n for j in range(2*i,10**6+1,i):\r\n prime[j]=0\r\n return prime\r\n\r\nimport sys\r\n\r\ns = list(sys.stdin.readline().strip())\r\nn = len(s)\r\nBIT = [[0]*(n+1) for i in range(26)]\r\n\r\ndef update(i, idx, val):\r\n idx += 1\r\n while idx <= n:\r\n BIT[i][idx] += val\r\n idx += (-idx & idx)\r\n\r\ndef read(i, idx):\r\n ret = 0\r\n while idx > 0:\r\n ret += BIT[i][idx]\r\n idx -= (-idx & idx)\r\n return ret \r\n\r\nfor i in range(n):\r\n update(ord(s[i])-97, i, 1)\r\n\r\nq = int(sys.stdin.readline())\r\n\r\nfor _ in range(q):\r\n a, b = sys.stdin.readline().split()\r\n t=2\r\n if t==\"1\":\r\n idx = int(a) - 1\r\n bit_idx = ord(s[idx])-97\r\n update(bit_idx, idx, -1)\r\n s[idx] = b\r\n bit_idx = ord(b)-97\r\n update(bit_idx, idx, 1)\r\n else:\r\n ans = 0\r\n l, r = int(a), int(b)\r\n for i in range(1,26,2):\r\n ans += 1 if (read(i, r) - read(i, l-1)) > 0 else 0\r\n print(ans)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\nendtime = time.time()\r\n# print(f\"Runtime of the program is {endtime - starttime}\")\r\n\r\n", "import sys\r\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\ninp = lambda: list(map(int,sys.stdin.readline().rstrip(\"\\r\\n\").split()))\r\n#______________________________________________________________________________________________________\r\n# from math import *\r\n# from bisect import *\r\n# from heapq import *\r\n# from collections import defaultdict as dd\r\n# from collections import OrderedDict as odict\r\n# from collections import Counter as cc\r\n# from collections import deque\r\n# sys.setrecursionlimit(2*(10**5)+100) this is must for dfs\r\n# mod = 10**9+7; md = 998244353\r\n# ______________________________________________________________________________________________________\r\n# Checking prime in O(root(N))\r\n# def isprime(n):\r\n# if (n % 2 == 0 and n > 2) or n == 1: return 0\r\n# else:\r\n# s = int(n**(0.5)) + 1\r\n# for i in range(3, s, 2):\r\n# if n % i == 0:\r\n# return 0\r\n# return 1\r\n# def lcm(a,b):\r\n# return (a*b)//gcd(a,b)\r\n# ______________________________________________________________________________________________________\r\n# nCr under mod\r\n# def C(n,r,mod):\r\n# if r>n:\r\n# return 0\r\n# num = den = 1\r\n# for i in range(r):\r\n# num = (num*(n-i))%mod\r\n# den = (den*(i+1))%mod\r\n# return (num*pow(den,mod-2,mod))%mod\r\n# M = 10**5 +10\r\n# ______________________________________________________________________________________________________\r\n# For smallest prime factor of a number\r\n# M = 1000010\r\n# pfc = [i for i in range(M)]\r\n# def pfcs(M):\r\n# for i in range(2,M):\r\n# if pfc[i]==i:\r\n# for j in range(i+i,M,i):\r\n# if pfc[j]==j:\r\n# pfc[j] = i\r\n# return\r\n# pfcs(M)\r\n# ______________________________________________________________________________________________________\r\n# import sys\r\nsys.setrecursionlimit(10**5)\r\n# n = int(sys.stdin.readline().strip())\r\n# a = list(map(int,sys.stdin.readline().strip().split()))\r\na = str(input())\r\nn = len(a)\r\nst = [float('inf') for i in range(4*len(a))]\r\ndef build(a,ind,start,end):\r\n\tif start == end:\r\n\t\tst[ind] = [a[start]] if ord(a[start])%2==0 else []\r\n\telse:\r\n\t\tmid = (start+end)//2\r\n\t\tbuild(a,2*ind+1,start,mid)\r\n\t\tbuild(a,2*ind+2,mid+1,end)\r\n\t\tst[ind] = list(set(st[2*ind+1]+st[2*ind+2]))\r\nbuild(a,0,0,n-1)\r\ndef query(ind,l,r,start,end):\r\n\tif start>r or end<l:\r\n\t\treturn []\r\n\tif l<=start<=end<=r:\r\n\t\treturn st[ind]\r\n\tmid = (start+end)//2\r\n\treturn list(set(query(2*ind+1,l,r,start,mid)+query(2*ind+2,l,r,mid+1,end)))\r\nfor i in range(int(input())):\r\n\tl,r = inp()\r\n\tans = query(0,l-1,r-1,0,n-1)\r\n\t# print(ans)\r\n\tprint(len(ans))\r\n# tc = 1\r\n# # tc, = inp()\r\n# for _ in range(tc):\r\n# # s = str(input())\r\n# a = [i for i in input().split()]\r\n# k = min(a,key = lambda x:len(x))\r\n# print(k)\n"]

{"inputs": [["bbccdd", "5", "1 2", "3 4", "5 6", "1 6", "2 5"]], "outputs": [["1", "0", "1", "2", "2"]]}

INTERVIEW

PYTHON3

CODECHEF

7,366

641cad3585b966480a714cbe24852b98

UNKNOWN

You are given three numbers $a$, $b$, $c$ . Write a program to determine the largest number that is less than or equal to $c$ and leaves a remainder $b$ when divided by $a$. -----Input:----- - First line will contain $T$, number of testcases. Then the testcases follow. - Each testcase contains a single line of input, having three integers $a$, $b$, $c$. -----Output:----- - For each testcase, output in a single line the largest number less than or equal to $c$. -----Constraints:----- - $1 \leq T \leq 100000$ - $0 \leq b < a < c \leq$ $10$^18 -----Sample Input:----- 1 7 2 10 -----Sample Output:----- 9

["# cook your dish here\nfor t in range(int(input())):\n a,b,c=map(int,input().split())\n p=(c//a)*a+b\n if p<=c:\n print(p)\n else:\n print(((c//a)-1)*a+b)", "try:\r\n for _ in range(int(input())):\r\n a,b,c=[int(i) for i in input().split()]\r\n r=c%a\r\n if(r>b):\r\n print(c-(r-b))\r\n elif(r<b):\r\n print(c-r-a+b)\r\n else:\r\n print(c)\r\nexcept EOFError as e:\r\n pass", "n=int(input())\r\nwhile n:\r\n a,b,c=list(map(int,input().split()))\r\n m=c//a\r\n m=(m*a)+b\r\n if m>c:\r\n \tm-=a\r\n print(m)\r\n n-=1\r\n", "t=int(input())\nfor _ in range(t):\n \n a,b,c=(list(map(int,input().split())))\n print((c-b)//a*a+b)\n", "# cook your dish here\ntry:\n t= int(input())\n for i in range(t):\n a,b,c= map(int,input().split())\n x=c//a\n ans=(x*a)+b\n if(ans>c):\n ans=ans-a\n print(ans)\n\nexcept:\n pass", "n=int(input())\r\nfor i in range(n):\r\n abc=list(map(int,input().split()))\r\n a=abc[0];b=abc[1];c=abc[2]\r\n l=c-(c%a)\r\n if((l+b)>c):\r\n l=l-a\r\n if(a<=b):\r\n l=0\r\n print(l+b)\r\n", "# cook your dish here\nfor t in range(int(input())):\n a, b, c = [int(i) for i in input().split(\" \")]\n r = c % a\n ans = c - r + b\n if ans > c:\n ans -= a\n print(ans)", "t=int(input())\nfor _ in range(t):\n a,b,c=list(map(int,input().split()))\n x=(c-b)//a\n print((x*a)+b)\n", "x=int(input())\nfor i in range(x):\n a,b,c=list(map(int,input().split()))\n for j in range(c//a,-1,-1):\n if a*j+b<=c:\n print(a*j+b)\n break\n", "# cook your dish here\nx=int(input())\nfor i in range(x):\n a,b,c=list(map(int,input().split()))\n for j in range(c//a,-1,-1):\n if a*j+b<=c:\n print(a*j+b)\n break\n \n", "# cook your dish here\n# cook your dish here\n# cook your dish here\nT = int(input())\n\nfor i in range(T):\n a, b, c = map(int, input().split())\n\n rem = c%a\n k = c-rem+b\n \n while(k>c):\n k = k-a\n \n print(k)", "for _ in range(int(input())):\n a,b,c=list(map(int,input().split()))\n i=0\n d=0\n while d<=c:\n d=a*i+b \n \n i=i+1\n print(d-a)\n \n \n \n \n", "t = int(input())\r\nfor _ in range(t):\r\n a,b,c = input().split()\r\n a,b,c = int(a),int(b),int(c)\r\n d = c-(c%a)+b\r\n if d > c:\r\n print(d-a)\r\n else:\r\n print(d)\r\n", "# cook your dish here\r\nT = int(input())\r\n\r\nfor i in range(T):\r\n a, b, c = map(int, input().split())\r\n\r\n rem = c%a\r\n k = c-rem+b\r\n \r\n while(k>c):\r\n k = k-a\r\n \r\n print(k)", "# cook your dish here\ndef solve(a, b, c):\n n = b\n while n <= c:\n n += a\n \n return n - a\n\nans = []\nT = int(input())\nfor i in range(T):\n li = [int(x) for x in input().strip().split()]\n ans.append(solve(li[0], li[1], li[2]))\n\nfor ele in ans:\n print(ele)", "# cook your dish here\ndef solve(a, b, c):\n k = c // a\n n = b\n while n <= c:\n n += a\n \n return n - a\n\nans = []\nT = int(input())\nfor i in range(T):\n li = [int(x) for x in input().strip().split()]\n ans.append(solve(li[0], li[1], li[2]))\n\nfor ele in ans:\n print(ele)", "a=int(input())\r\nfor i in range(a):\r\n l=list(map(int,input().split()))\r\n for i in range(((l[2]-l[1])//l[0])+1):\r\n x=(i*l[0])+l[1]\r\n while(x>=l[2]):\r\n break\r\n print(x)", "t=int(input())\r\nfor i in range(t):\r\n a,b,c=map(int,input().split())\r\n k=(c-b)//a\r\n print(k*a+b)", "t=int(input())\nfor _ in range(t):\n l=list(map(int,input().split()))\n a=l[0]\n b=l[1]\n c=l[2]\n x=c//a\n while(1):\n if a*x+b<=c:\n print(a*x+b)\n break\n else:\n x=x-1\n", "T=int(input())\nwhile T:\n\ta,b,c=map(int,input().split())\n\td=c%a\n\tif d<b:\n\t\ti=c-d-a+b\n\telse:\n\t\ti=c-d+b\n\tprint(i)\n\tT-=1", "# cook your dish here\nt = int(input())\nfor i in range(0,t):\n a=input().split()\n b=list(map(int,a))\n n=int(b[2]/b[0])\n if((b[0])*n+b[1]<=b[2]):\n print((b[0])*n+b[1])\n else:\n print((b[0])*(n-1)+b[1])", "# cook your dish here\nt=int(input())\nwhile t:\n a,b,c=[int(i) for i in input().split(' ')]\n k=(c-b)//a\n print((k*a)+b)\n t-=1", "t = int(input())\r\nfor i in range(t):\r\n lst = input().split()\r\n for j in range(3):\r\n lst[j] = int(lst[j])\r\n if(lst[2] % lst[0] == lst[1]):\r\n print(lst[2])\r\n elif(lst[2] % lst[0] < lst[1]):\r\n print(lst[2] - (lst[0] - lst[1] + lst[2] % lst[0]))\r\n else:\r\n print(lst[2] - (lst[2] % lst[0] - lst[1]))", "t=0\ntry:\n t=int(input())\nexcept:\n pass\nfor _ in range(t):\n a,b,c=map(int,input().split())\n d=c%a\n if(d<b):\n print(c-d+b-a)\n else:\n print(c-d+b)", "# cook your dish here\nn=int(input())\nfor i in range(n):\n l=list(map(int,input().split(\" \")))\n p=0\n k=0\n while(p<=l[2]):\n m=p\n p=(l[0]*k)+l[1]\n k+=1\n print(m)"]

{"inputs": [["1", "7 2 10"]], "outputs": [["9"]]}

INTERVIEW

PYTHON3

CODECHEF

5,258

19f7e653c49205d19730fdcaf165f311

UNKNOWN

Aureole the Techno-cultural fest of JEC thought of conducting a workshop on big data, as the topic is hot everyone wants to take part but due to limited seats in the Jashan Auditorium there is a selection criteria, a problem is given. the problem states a string is to be compressed when two or more consecutive characters are same they are to be compressed into one character and the original number count is to be written after it ex. aaabb -> a3b2 where every character is of 8bits and every integer is of 32bits you are asked to find the difference in size between original string and compressed string -----Input:----- - First line will contain $T$, number of testcases. Then the testcases follow. - Each testcase contains of a single line of input $S$ the string to be compressed. -----Output:----- For each testcase, output in a single line The difference in size. -----Constraints----- - $1 \leq T \leq 100$ - $1 \leq |S| \leq 10^5$ -----Subtasks----- - 40 points : S will contain only a-z - 60 points : S will contain 0-9 characters also -----Sample Input:----- 1 aaabb -----Sample Output:----- -40 -----EXPLANATION:----- the resulting string will be a3b2 its size will be 80, original string size will be 40 so ans= 40-80

["#include<sdg.h>\nfor _ in range(int(input())):\n s=input()\n n=len(s)\n if n==1:\n if s[0].isalpha(): print(\"-32\")\n else: print(0)\n else:\n num,ch=0,0\n p,q=0,0\n c=1\n x=s[0]\n ans=\"\"\n for i in range(1,n):\n if s[i-1]==s[i]:\n c+=1\n if i==n-1:\n ans+=s[i-1]\n ch+=1\n if c>1:\n ans+=str(c)\n num+=1\n c=1\n else:\n ans+=s[i-1]\n ch+=1\n if c>1:\n ans+=str(c)\n num+=1\n c=1\n if i==n-1:\n ans+=s[i]\n ch+=1\n #print(ans,num,ch)\n sol=(n*8)-((num*32)+(ch*8))\n print(sol)", "t=int(input())\nfor _ in range(t):\n s=input()\n x=\"\"\n i=0\n ans=0\n while i<len(s):\n x=s[i]\n c=1\n i+=1\n while i<len(s) and s[i]==x:\n i+=1\n c+=1\n if c==1:\n ans+=8\n else:\n ans+=40\n m=8*len(s)\n print(m-ans)\n", "# cook your dish here\nt=int(input())\nwhile t>0:\n c=input()\n len1=len(c)\n sum1=0\n l=[]\n for i in range(len1):\n sum1+=8\n sum2=8\n q=1\n for i in range(1,len1):\n if c[i]!=c[i-1]:\n if q>1:\n sum2+=32\n q=1 \n sum2+=8 \n else:\n q+=1 \n \n if q>1:\n sum2+=32 \n print(sum1-sum2)\n t-=1\n \n \n \n \n \n \n \n \n \n", "# cook your dish here\ndef compress(a):\n prev = None\n prev_c = 1\n ans_s=\"\"\n k=0\n for x in a:\n if prev == x:\n prev_c+=1\n else:\n if prev!=None:\n if prev_c!=1:\n ans_s = ans_s + str(prev) + str(prev_c)\n k+=40\n else:\n ans_s = ans_s + str(prev)\n k+=8\n prev_c=1\n prev =x\n if prev_c!=1:\n ans_s = ans_s + str(prev) + str(prev_c)\n k+=40\n else:\n ans_s = ans_s + str(prev)\n k+=8\n #print(ans_s)\n return k\nt=int(input())\nwhile(t):\n t=t-1\n a=input()\n ans = compress(a)\n size = 8*len(a)\n print( size - ans )", "#include<sdg.h>\nfor _ in range(int(input())):\n s=input()\n n=len(s)\n if n==1:\n if s[0].isalpha(): print(\"-32\")\n else: print(0)\n else:\n num,ch=0,0\n p,q=0,0\n c=1\n x=s[0]\n ans=\"\"\n for i in range(1,n):\n if s[i-1]==s[i]:\n c+=1\n if i==n-1:\n ans+=s[i]\n if s[i].isalpha(): ch+=1\n else: num+=1\n if c>1: \n ans+=str(c)\n num+=1\n c=1\n \n else:\n if s[i-1].isalpha():\n ch+=1\n ans+=s[i-1]\n if c>1: \n ans+=str(c)\n num+=1\n c=1\n else:\n ans+=s[i-1]\n num+=1\n if c>1: \n ans+=str(c)\n num+=1\n c=1\n if i==n-1:\n ans+=s[i]\n if s[i].isalpha(): ch+=1\n else: num+=1\n #print(ans,num,ch)\n alp,qt=0,0\n for i in range(n):\n if s[i].isalpha(): alp+=1\n else: qt+=1\n sol=((qt-num)*32)+((alp-ch)*8)\n print(sol)", "for _ in range(int(input())):\r\n s = input()\r\n curr = 0\r\n for i in range(len(s)):\r\n if(s[i].isdigit()):\r\n curr = curr + 32\r\n else:\r\n curr = curr + 8\r\n c = s[0]\r\n ans = s[0]\r\n count = 0\r\n d = dict()\r\n if(c.isdigit()):\r\n curr2 = 32\r\n else:\r\n curr2 = 8\r\n for i in range(len(s)):\r\n if(c ==s[i]):\r\n count +=1\r\n else:\r\n c = s[i]\r\n if(count!=1):\r\n ans = ans + str(count)\r\n curr2 += 32\r\n ans = ans + str(s[i])\r\n if(s[i].isdigit()):\r\n curr2 += 32\r\n else:\r\n curr2 += 8\r\n count = 1\r\n if(count!=1):\r\n ans = ans + str(count)\r\n curr2 += 32\r\n print(curr - curr2)\r\n\r\n\r\n\r\n\r\n", "t=int(input())\r\nfor i in range(t):\r\n s=input()\r\n l=len(s)\r\n sm=1\r\n total=0\r\n for j in range(1,l):\r\n if s[j-1]==s[j]:\r\n sm+=1\r\n else:\r\n if sm==1:\r\n total+=8\r\n else:\r\n total+=8\r\n total=total+32\r\n sm=1\r\n if s[j-1]==s[j]:\r\n sm+=1\r\n total+=8\r\n total=total+32\r\n else:\r\n if sm==1:\r\n total+=8\r\n else:\r\n total+=8\r\n total=total+32\r\n print(l*8-total)", "t = int(input())\n\nwhile t:\n t -= 1\n string = input()\n l = len(string)\n temp = string[0]\n occ = 1\n\n pre = 0\n this = 0\n\n for i in range(1, l):\n if string[i] == temp:\n occ += 1\n else:\n if occ != 1:\n pre += occ * 8\n this += 40\n else:\n pre += 8\n this += 8\n occ = 1\n temp = string[i]\n if occ == 1:\n pre += 8\n this += 8\n else:\n pre += 8 * occ\n this += 40\n print(pre-this)\n\n", "# cook your dish here\nfor _ in range(int(input())):\n s=input()\n size1=8*len(s)\n size2=8\n i=1\n while i<len(s):\n if s[i]==s[i-1]:\n while s[i]==s[i-1]:\n i+=1\n if i>=len(s):\n break\n size2+=32\n else:\n size2+=8\n i+=1\n print(size1-size2)", "# cook your dish here\nn = int(input())\nfor i in range(n):\n s = str(input())\n o_l = len(s)*8\n n_l = 0\n t = 0\n for i in range(len(s)-1):\n if s[i] ==s[i+1]:\n t+=1\n else:\n if(t>=1):\n n_l += 32+8\n else:\n n_l += 8\n t = 0\n if(t>=1):\n n_l += 32+8\n else:\n n_l += 8\n print(o_l-n_l)\n", "# cook your dish here\ntemp=[]\nt=int(input())\nfor _ in range(t):\n s=input()\n l=list(s)\n x=len(l)*8\n \n i=0\n y=0\n while i<(len(l)):\n count=0\n while i<(len(l)-1) and l[i]==l[i+1] :\n \n count+=1\n \n \n i+=1\n if count==0:\n y+=8\n else:\n y+=40\n i=i+1\n temp.append(x-y)\nfor i in temp:\n print(i)", "for _ in range(int(input())):\r\n s = input()\r\n curr = 0\r\n for i in range(len(s)):\r\n if(s[i].isdigit()):\r\n curr = curr + 32\r\n else:\r\n curr = curr + 8\r\n c = s[0]\r\n ans = s[0]\r\n count = 0\r\n d = dict()\r\n if(c.isdigit()):\r\n curr2 = 32\r\n else:\r\n curr2 = 8\r\n for i in range(len(s)):\r\n if(c ==s[i]):\r\n count +=1\r\n else:\r\n if(c.isdigit()):\r\n curr2 +=32\r\n else:\r\n curr2+=8\r\n c = s[i]\r\n if(count!=1):\r\n ans = ans + str(count)\r\n curr2 += 32\r\n ans = ans + str(s[i])\r\n count = 1\r\n if(count!=1):\r\n ans = ans + str(count)\r\n curr2 += 32\r\n print(curr - curr2)\r\n\r\n\r\n\r\n\r\n", "# cook your dish here\nt=int(input())\nwhile t>0:\n c=input()\n len1=len(c)\n sum1=0\n l=[]\n for i in range(len1):\n if c[i].isalpha():\n sum1+=8\n else:\n sum1+=32\n sum2=0\n l.append(c[0])\n q=1\n for i in range(1,len1):\n if c[i].isalpha():\n if c[i]==c[i-1]:\n q+=1 \n else:\n if q>1:\n l.append(q)\n l.append(c[i])\n q=1 \n else:\n if q>1:\n l.append(q)\n q=1 \n l.append(c[i])\n if c[len1-1].isalpha():\n if q>1:\n l.append(q)\n for i in l:\n if str(i).isalpha():\n sum2+=8 \n else:\n sum2+=32\n print(sum1-sum2)\n t-=1\n \n \n \n \n \n", "from collections import Counter\nfor _ in range(int(input())):\n S = list(map(str,input()))\n original = 8\n new = 0\n if S[0].isdigit():\n original = 32\n lst = [S[0]]\n lst1 = [1]\n \n b = 0\n for i in range(1, len(S)):\n if S[i].isdigit():\n original += 32\n else:\n original += 8\n \n if S[i]==lst[-1]:\n lst1[-1]+=1\n else:\n lst.append(S[i])\n lst1.append(1)\n \n for i in range(len(lst)):\n if lst[i].isdigit():\n if lst1[i] > 1:\n new += 64\n else:\n new += 32\n \n else:\n if lst1[i] > 1:\n new += 40\n else:\n new += 8\n \n print(original-new)", "from collections import Counter\nfor _ in range(int(input())):\n S = list(map(str,input()))\n original = 8\n new = 8\n if S[0].isdigit():\n original = 32\n new = 32\n a = S[0]\n b = 0\n for i in range(1, len(S)):\n if S[i].isdigit():\n original += 32\n else:\n original += 8\n \n if S[i]==a:\n b = 32\n else:\n new += b\n b = 0\n a = S[i]\n if S[i].isdigit():\n new += 32\n else:\n new += 8\n new += b\n print(original-new)", "try:\n for _ in range(int(input())):\n s=input()\n l=len(s)\n k=8*l\n p=8\n t=0\n for i in range(1,l):\n if(s[i]==s[i-1]):\n if(t==0):\n p+=32\n t=1\n else:\n p+=8\n t=0\n print(k-p)\nexcept EOFError as e:\n pass", "# cook your dish here\ntest = int(input())\nfor t in range(test):\n s = input()\n prev = s[0]\n total = 0\n count = 0\n for i in s:\n if i == prev:\n count += 1\n else:\n if(count==0 or count == 1):\n total += 8\n else:\n total += 40\n count = 1\n prev = i\n \n if(s[len(s)-1] == s[len(s)-2]):\n total += 40\n else:\n total += 8\n #print(total)\n diff = (len(s)*8) - (total)\n print(diff)", "from collections import Counter\nfor _ in range(int(input())):\n S = list(map(str,input()))\n original = 8\n new = 8\n if S[0].isdigit():\n original = 32\n new = 32\n a = S[0]\n b = 0\n for i in range(1, len(S)):\n if S[i].isdigit():\n original += 32\n new += 32\n else:\n original += 8\n if S[i]==a:\n b = 32\n else:\n new += b+8\n b = 0\n a = S[i]\n new +=b\n print(original-new)\n", "def fac(a):\r\n s=1\r\n for i in range(1,a+1):\r\n s=s*i\r\n return s\r\n\r\ndef prime(n):\r\n n=int(n)\r\n if(n==2 or n==3):\r\n return 1\r\n k=n**(1/2)\r\n for i in range(2,int(k)+2):\r\n if(n%i==0):\r\n return 0\r\n return 1\r\n\r\n\r\ndef sieve(n):\r\n arr=[]\r\n prime = [True for i in range(n+1)]\r\n p = 2\r\n while (p * p <= n):\r\n if (prime[p] == True):\r\n for i in range(p * 2, n+1, p):\r\n prime[i] = False\r\n p += 1\r\n for p in range(2, n):\r\n if prime[p]:\r\n arr.append(p)\r\n return arr\r\n\r\n\r\n\r\n\r\nt=int(input())\r\n# n,m=[int(x) for x in input().split()]\r\n\r\nfor ii in range(t):\r\n s=input()\r\n prev=s[0]\r\n ss=[]\r\n c=1\r\n for i in s[1:]:\r\n if(i!=prev):\r\n if(c==1):\r\n ss.append('p'+prev)\r\n else:\r\n ss.append('p'+prev)\r\n ss.append(str(c))\r\n prev=i\r\n c=1\r\n else:\r\n c+=1\r\n\r\n if(c==1):\r\n ss.append('p'+prev)\r\n else:\r\n ss.append('p'+prev)\r\n ss.append(str(c))\r\n hah='0987654321'\r\n s1=0\r\n s2=0\r\n\r\n\r\n s1=8*(len(s))\r\n for i in ss:\r\n if (i[0] in hah):\r\n s2 += 32\r\n else:\r\n s2 += 8\r\n # print(s,ss)\r\n print(s1-s2)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "# cook your dish here\r\nfrom sys import stdin, stdout\r\nimport math\r\nfrom itertools import permutations, combinations\r\nfrom collections import defaultdict\r\nfrom bisect import bisect_left \r\nfrom bisect import bisect_right\r\n \r\ndef L():\r\n return list(map(int, stdin.readline().split()))\r\n \r\ndef In():\r\n return list(map(int, stdin.readline().split()))\r\n \r\ndef I():\r\n return int(stdin.readline())\r\n \r\nP = 1000000007\r\ndef main():\r\n for t in range(I()):\r\n s = input()\r\n st = s[0]\r\n i = 1\r\n c1, c2 = 1, 0\r\n while i < len(s):\r\n if s[i] == s[i-1]:\r\n j = i \r\n c = 0\r\n while j < len(s) and s[j] == s[i-1]:\r\n c += 1 \r\n j += 1 \r\n if c != 0:\r\n c2 += 1\r\n i = j-1 \r\n st += str(c+1)\r\n else:\r\n st += s[i]\r\n c1 += 1\r\n i += 1 \r\n print(len(s)*8 -(c1*8+c2*32))\r\n \r\ndef __starting_point():\r\n main()\r\n\n__starting_point()"]

{"inputs": [["1", "aaabb"]], "outputs": [["-40"]]}

INTERVIEW

PYTHON3

CODECHEF

14,656

d3f47586aa3538d20c1e09441c85e61f

UNKNOWN

Given an Array of length $N$ containing elements $Ai$ ( i = 1 to n ) . You have to handle $Q$ queries on this array . Each Query is of two types k=(1 or 2). Type 1:- $k$ $l$ $r$ in which you have to tell whether the product of numbers in range l to r results in a perfect square or not. if product of numbers in range $l$ to$r$ is a perfect square then simply output YES else output NO. Type 2:- $k$ $i$ $val$ Multiply the value present at index $i$ with $val$. Note#1: 1 based indexing in each query. Note#2: Values of prime factors of all numbers $val$ and $Ai$ is between 2 to 100 only. -----Input:----- - First line will contain $N$, denoting the size of the array. Then the next line follow. - N integers $Ai - An$. - Third line will contain $Q$, denoting the number of queries. Then the next $Q$ lines follow -description of each query. - Each query consists of either type 1 or type 2 and each query gives you three elements either -{$k$ $l$ $r$} or {$k$ $i$ $val$} -----Output:----- For each Query of Type 1 Output either "YES" or "NO" Without Quotes. -----Constraints----- - $1 \leq N \leq 20000$ - $1 \leq Q \leq 20000$ - $2 \leq Ai \leq 1000000$ - $1 \leq i ,l,r \leq N$ - $1 \leq val \leq 1000000$ - $1 \leq l \leq r$ -----Subtasks----- Subtask 1 :-40 points - Values of prime factors of all numbers $val$ and $Ai$ is between 2 to 40 only. Subtask 2 :- 60 points - Original Constraints -----Sample Input:----- 4 2 2 3 4 4 1 1 2 1 3 4 2 3 3 1 1 4 -----Sample Output:----- YES NO YES -----EXPLANATION:----- -Query 1 :- product of numbers in range 1 to 2=2 * 2=4 (perfect square so YES) -Query 2:- product of numbers in range 3 to 4 = 3 * 4 = 12 (not perfect square so NO) -Query 3:- multiply number at index3 with 3 so number at index 3= 3*3 = 9 . -Query 4:- product of numbers in range 1 to 4 = 2 * 2 * 9 * 4 = 144 (perfect square so YES)

["def update(index, value, bi_tree):\n while index < len(bi_tree):\n bi_tree[index] += value\n index += index & -index\n\n\ndef get_sum(index, bi_tree):\n ans = 0\n while index > 0:\n ans += bi_tree[index]\n index -= index & -index\n\n return ans\n\n\ndef get_range_sum(left, right, bi_tree):\n ans = get_sum(right, bi_tree) - get_sum(left - 1, bi_tree)\n return ans\n\n\ndef solve(x):\n s = set()\n res = 1\n i = 2\n while (i * i <= x):\n count = 0\n while (x % i == 0):\n x = x // i\n count += 1\n if (count % 2):\n s.add(i)\n i += 1\n if (x > 0):\n s.add(x)\n return s\n\n\nn = int(input())\nl = [0] + [int(i) for i in input().split()]\nbit = [[0 for i in range(n + 1)] for i in range(101)]\n\nfor i in range(1, n + 1):\n s = solve(l[i])\n for j in s:\n update(i, 1, bit[j])\n\nq = int(input())\nfor i in range(q):\n k, a, b = [int(i) for i in input().split()]\n if (k == 1):\n f = 1\n for i in range(2, 100):\n res = get_range_sum(a, b, bit[i])\n if (res % 2):\n f = 0\n break\n if (f):\n print(\"YES\")\n else:\n print(\"NO\")\n else:\n s = solve(b)\n for j in s:\n update(a, 1, bit[j])"]

{"inputs": [["4", "2 2 3 4", "4", "1 1 2", "1 3 4", "2 3 3", "1 1 4"]], "outputs": [["YES", "NO", "YES"]]}

INTERVIEW

PYTHON3

CODECHEF

1,131

1a606a3bc75555fbc61de8d1722960d9

UNKNOWN

Recently in JEC ants have become huge, the Principal is on a journey to snipe them !! Principal has limited $N$ practice Bullets to practice so that he can be sure to kill ants. - The Practice ground has max length $L$. - There is a Limit X such that if the bullet is fired beyond this, it will destroy and it wont be of any further use. - Bullet can be reused if fired in a range strictly less than X. He wants to find minimum number of shots taken to find the distance X by using $N$ bullets. -----Input:----- - First line will contain $T$, number of testcases. Then the testcases follow. - Each testcase contains of a single line of input, two integers $N, L$. -----Output:----- For each testcase, output in a single line answer the minimum number of shots to find the distance X. -----Constraints----- - $1 \leq T \leq 10$ - $2 \leq N,L \leq 100$ *N is always less than equal to square root of L -----Subtasks----- - 10 points : $ N = 1$ - 40 points : $ N = 2$ - 50 points : Original Constraints. -----Sample Input:----- 2 1 10 2 10 -----Sample Output:----- 10 4 -----EXPLANATION:----- - There is only single bullet which is to be fired from distance 1 to 10 to get the distance X so in the worst case it can take up to 10 shots to find the distance X. - there are 2 bullets and distance 10 meters suppose if distance X is 10 we can get to that by firing first bullet at 4 then 7 then 9 then at 10 it will break it took only 4 turns, and if the distance X was 3, we can get that by firing first bullet at 4 it will get destroyed than we use 2nd bullet at 1 , 2, 3 and 2nd bullet will also break it also took 4 turns. You can check for any position minimum number of turns will be at most 4.

["# cook your dish here\n\nfrom sys import stdin,stdout\nfrom collections import deque,defaultdict\nfrom math import ceil,floor,inf,sqrt,factorial,gcd,log\nfrom copy import deepcopy\nii1=lambda:int(stdin.readline().strip())\nis1=lambda:stdin.readline().strip()\niia=lambda:list(map(int,stdin.readline().strip().split()))\nisa=lambda:stdin.readline().strip().split()\nmod=1000000007\n\nfor _ in range(ii1()):\n n,l=iia()\n if n==1:\n print(l)\n elif n==2:\n print(int(log2(10))+1)\n else:\n print(ceil(l/(n+1)))\n", "# cook your dish here\nimport math\nt=int(input())\nwhile t>0:\n n,l=list(map(int,input().split()))\n if n==1:\n print(l)\n elif n==2:\n ans=(n-1)//2\n print(ans)\n \n t-=1", "import sys\ndef eggDrop(n, k): \n if (k == 1 or k == 0): \n return k \n \n if (n == 1): \n return k \n \n min = sys.maxsize \n\n for x in range(1, k + 1): \n \n res = max(eggDrop(n - 1, x - 1), \n eggDrop(n, k - x)) \n if (res < min): \n min = res \n \n return min + 1\nfor _ in range(int(input())):\n n,l = [int(i) for i in input().split()]\n if(n == 1):\n print(l)\n else:\n print(eggDrop(n,l))", "import sys\ndef eggDrop(n, k): \n if (k == 1 or k == 0): \n return k \n \n if (n == 1): \n return k \n \n min = sys.maxsize \n\n for x in range(1, k + 1): \n \n res = max(eggDrop(n - 1, x - 1), \n eggDrop(n, k - x)) \n if (res < min): \n min = res \n \n return min + 1\nfor _ in range(int(input())):\n n,l = [int(i) for i in input().split()]\n if(n == 1):\n print(l)\n else:\n print(eggDrop(l,n))", "def fac(a):\n s=1\n for i in range(1,a+1):\n s=s*i\n return s\n\ndef prime(n):\n n=int(n)\n if(n==2 or n==3):\n return 1\n k=n**(1/2)\n for i in range(2,int(k)+2):\n if(n%i==0):\n return 0\n return 1\n\n\ndef sieve(n):\n arr=[]\n prime = [True for i in range(n+1)]\n p = 2\n while (p * p <= n):\n if (prime[p] == True):\n for i in range(p * 2, n+1, p):\n prime[i] = False\n p += 1\n for p in range(2, n):\n if prime[p]:\n arr.append(p)\n return arr\n\n\n\n\nt=int(input())\n# n,m=[int(x) for x in input().split()]\n\nfor ii in range(t):\n n, m = [int(x) for x in input().split()]\n if(n==1):\n print(m)\n else:\n if(m%2==0):\n m-=1\n print(m//2)\n\n\n\n\n\n\n\n\n\n\n", "# cook your dish here\nimport math\nt=int(input())\nwhile t>0:\n n,l=list(map(int,input().split()))\n if n==1:\n print(l)\n elif n==2:\n ans=0\n while l>0:\n ans+=1 \n l=l//2\n print(ans)\n \n t-=1", "# cook your dish here\nt=int(input())\nwhile(t):\n t=t-1\n N,L = map(int,input().split())\n if N==1:\n print(L)\n elif N==2:\n z = (8*L+1)**0.5\n z= z - 1\n z=z/2\n if z-int(z)>0:\n print(int(z)+1)\n else:\n print(int(z))\n else:\n if L%N==0:\n print(L//N)\n else:\n print(1+(L//N))", "import math\nfor _ in range(int(input())):\n n,l = [int(i) for i in input().split()]\n if(n == 1):\n print(l)\n else:\n print(math.floor(l/(n+1)) + 1)", "# cook your dish here\nimport math\nt=int(input())\nwhile t>0:\n n,l=list(map(int,input().split()))\n if n==1:\n print(l)\n elif n==2:\n for i in range(1,101):\n if l//i==2:\n print(i)\n break\n \n t-=1", "# cook your dish here\ntry:\n t=int(input())\n for i in range (t):\n n,m=list(map(int,input().split()))\n if n==1:\n print(m)\n elif n==2:\n print((m//2)-1)\nexcept EOFError as e:\n pass\n", "T = int(input())\nfor _ in range(T):\n n, l = map(int,input().split())\n if n == 1:\n print(l)", "# cook your dish here\nimport math\nt=int(input())\nwhile t>0:\n n,l=list(map(int,input().split()))\n if n==1:\n print(l)\n elif n==2:\n ans=n*2\n print(ans)\n \n t-=1", "# cook your dish here\nt=int(input())\nwhile(t):\n t=t-1\n N,L = map(int,input().split())\n if N==1:\n print(L)\n elif N==2:\n z = (8*L+1)**0.5\n z= z - 1\n z=z/2\n if z-int(z)>0:\n print(int(z)+1)\n else:\n print(int(z))\n else:\n print(\"Fuck me\")", "# cook your dish here\nimport math\nt=int(input())\nwhile t>0:\n n,l=list(map(int,input().split()))\n if n==1:\n print(l)\n elif n==2:\n ans=math.sqrt(l)\n k=int(ans)\n if k*k==ans:\n print(k)\n else:\n print(k+1)\n \n t-=1", "# cook your dish here\ntest = int(input())\nfor t in range(test):\n n,l = input().split()\n n,l = int(n),int(l)\n if(n==1):\n print(l)\n elif(n==2):\n if(l%2==0):\n print((l//2)-1)\n else:\n print((l//2)-2)\n else:\n print((l//n) -1)", "# cook your dish here\ndef nextPowerOf2(n): \n count = 0; \n \n # First n in the below \n # condition is for the \n # case where n is 0 \n if (n and not(n & (n - 1))): \n return n \n \n while( n != 0): \n n >>= 1\n count += 1\n \n return 1 << count; \n \n \nT=int(input())\nfor i in range(0,T):\n N,L=list(map(int,input().split()))\n l=1\n j=N**l\n if(N==1):\n print(L)\n elif(N==2):\n n=nextPowerOf2(L)\n print(n)\n \n \n \n \n \n \n", "# cook your dish here\nimport math\nt=int(input())\nwhile t>0:\n n,l=list(map(int,input().split()))\n if n==1:\n print(l)\n elif n==2:\n ans=math.sqrt(l)\n k=int(ans)\n print(k+1)\n \n t-=1", "# cook your dish here\ndef nextPowerOf2(n): \n count = 0; \n \n # First n in the below \n # condition is for the \n # case where n is 0 \n if (n and not(n & (n - 1))): \n return n \n \n while( n != 0): \n n >>= 1\n count += 1\n \n return 1 << count; \n \n \nT=int(input())\nfor i in range(0,T):\n N,L=list(map(int,input().split()))\n l=1\n j=N**l\n if(N==1):\n print(L)\n elif(N==2):\n print(4)\n \n \n \n \n \n \n", "# cook your dish here\nt=int(input())\nwhile(t):\n t=t-1\n N,L = map(int,input().split())\n if N==1:\n print(L)\n elif N==2:\n z = (8*L+1)**0.5\n z= z - 1\n z=z/2\n z=int(z)\n print(z)\n else:\n print(\"Fuck me\")", "# cook your dish here\nfor _ in range(int(input())):\n n,l=map(int,input().split(\" \"))\n if(n==1):\n print(l)\n if(n==2):\n print((l//n)-1)", "# cook your dish here\ntest = int(input())\nfor t in range(test):\n n,l = input().split()\n n,l = int(n),int(l)\n if(n==1):\n print(l)\n elif(n==2):\n print((l//2)-1)\n else:\n print(l//n)", "# cook your dish here\nt=int(input())\nwhile(t):\n t=t-1\n N,L = map(int,input().split())\n if N==1:\n print(L)\n elif N==2:\n z = (8*L+1)**0.5\n z= z - 1\n z=z/2\n z=int(z)\n print(z)\n else:\n print(\"Fuck me\")"]

{"inputs": [["2", "1 10", "2 10"]], "outputs": [["10", "4"]]}

INTERVIEW

PYTHON3

CODECHEF

6,204

836aacd6d510158ba409a322b600d612

UNKNOWN

Given an integer N. Integers A and B are chosen randomly in the range [1..N]. Calculate the probability that the Greatest Common Divisor(GCD) of A and B equals to B. -----Input----- The first line of the input contains an integer T denoting the number of test cases. The description of T test cases follows. Each test case consists of a single integer N on a separate line. -----Output----- For each test case, output a single line containing probability as an irreducible fraction. -----Example----- Input: 3 1 2 3 Output: 1/1 3/4 5/9 -----Constraints----- 1<=T<=103 1<=N<=109

["import math\nfor _ in range(int(input())):\n n=int(input())\n s=int(math.sqrt(n))\n ans=0\n for i in range(1,s+1):\n ans+=(n//i)\n ans=ans*2-(s*s)\n g=math.gcd(n*n,ans)\n print(str(ans//g)+\"/\"+str(n*n//g)) ", "from collections import defaultdict\nimport sys\nimport math as m\nimport random as rd\nimport bisect as b\n#import numpy as np\nimport time\nsys.setrecursionlimit(1000000)\n\n\ndef uno(): return int(sys.stdin.readline().strip())\n\n\ndef dos(): return sys.stdin.readline().strip()\n\n\ndef tres(): return list(map(int, sys.stdin.readline().strip().split()))\n\n\ndef cuatro(): return sys.stdin.readline().strip().split()\n\n################## CODE STARTS FROM HERE ######################\n\n\nfor _ in range(uno()):\n n = uno()\n ans, root = 0, m.floor(m.sqrt(n))\n for i in range(1, root+1):\n ans += n//i\n ans = ans+ans-root*root\n a, b = ans//m.gcd(ans, n*n), (n*n)//m.gcd(ans, n*n)\n print(str(a)+\"/\"+str(b))\n", "from collections import defaultdict\nimport sys\nimport math as m\nimport random as rd\nimport bisect as b\n#import numpy as np\nimport time\nsys.setrecursionlimit(1000000)\n\n\ndef uno(): return int(sys.stdin.readline().strip())\n\n\ndef dos(): return sys.stdin.readline().strip()\n\n\ndef tres(): return map(int, sys.stdin.readline().strip().split())\n\n\ndef cuatro(): return sys.stdin.readline().strip().split()\n\n################## CODE STARTS FROM HERE ######################\n\n\nfor _ in range(uno()):\n n = uno()\n ans, root = 0, m.floor(m.sqrt(n))\n for i in range(1, root+1):\n ans += n//i\n ans = ans+ans-root*root\n a, b = ans//m.gcd(ans, n*n), (n*n)//m.gcd(ans, n*n)\n print(str(a)+\"/\"+str(b))", "import math\n\ndef solve():\n n = int(input())\n num = 0\n\n denom = n * n\n s = int(math.sqrt(n))\n for i in range(1, s + 1):\n num += n//i\n\n num = (2 * num) - (s * s)\n k = math.gcd(num, denom)\n\n print(str(num//k) + \"/\" + str(denom//k)) \n\nt = int(input())\n\n\nfor tt in range(0, t):\n solve()", "import math\n\ndef solve():\n n = int(input())\n num = 0\n\n denom = n * n\n s = int(math.sqrt(n))\n for i in range(1, s + 1):\n num += n//i\n\n num = (2 * num) - (s * s)\n k = math.gcd(num, denom)\n\n print(str(num//k) + \"/\" + str(denom//k)) \n\nt = int(input())\n\n\nfor tt in range(0, t):\n solve()", "def gcd(a,b):\n if b==0: return a \n return gcd(b,a%b)\nfrom math import sqrt as S \nfor _ in range(int(input())):\n n=int(input())\n tot=n*n\n s=0\n beta=int(S(n))\n for i in range(1,int(S(n))+1):\n s+=n//i \n s=2*s-beta*beta \n g=gcd(s,tot)\n s=s//g \n tot=tot//g \n print(s,end='')\n print('/',end='')\n print(tot)\n "]

{"inputs": [["3", "1", "2", "3"]], "outputs": [["1/1", "3/4", "5/9"]]}

INTERVIEW

PYTHON3

CODECHEF

2,592

c8022aff577fb955ddb73dccbae51d31

UNKNOWN

The median of a sequence is the element in the middle of the sequence after it is sorted. For a sequence with even size, the median is the average of the two middle elements of the sequence after sorting. For example, for a sequence $A = [1, 3, 3, 5, 4, 7, 11]$, the median is equal to $4$, and for $A = [2, 3, 4, 5]$, the median is equal to $(3+4)/2 = 3.5$. Fulu is a famous programmer in his country. He wrote the following program (given in pseudocode) for finding the median in a sequence $A$ with length $N$: read(N) read(A[0], A[1], ..., A[N-1]) sort(A) # simultaneously remove elements A[K] and A[N mod K] from the array A # the order of the remaining N-2 elements is unchanged remove(A[K], A[N mod K]) return A[(N-2)/2] # integer division The program takes an integer $K$ as a parameter. Fulu can choose this integer arbitrarily between $1$ and $N-1$ inclusive. Little Lima, Fulu's friend, thinks Fulu's program is wrong (as always). As finding one counterexample would be an easy task for Lima (he has already found the sequence $A = [34, 23, 35, 514]$, which is a counterexample for any $K \le 3$), Lima decided to make hacking more interesting. Fulu should give him four parameters $S, K, m, M$ (in addition to $N$) and Lima should find the lexicographically smallest proper sequence $A$ with length $N$ as a counterexample. We say that a sequence $A$ with length $N$ ($0$-indexed) is proper if it satisfies the following conditions: - it contains only positive integers - $A_0 + A_1 +A_2 + \dots + A_{N-1} = S$ - $m \le A_i \le M$ for each $0 \le i < N$ - the number returned by Fulu's program, ran with the given parameter $K$, is different from the correct median of the sequence $A$ Can you help Lima find the lexicographically smallest counterexample or determine that Fulu's program works perfectly for the given parameters? -----Input----- - The first line of the input contains a single integer $T$ denoting the number of test cases. The description of $T$ test cases follows. - The first and only line of each test case contains five space-separated integers $N$, $S$, $K$, $m$ and $M$. -----Output----- For each test case, if there is no proper sequence, print a single line containing the integer $-1$; otherwise, print a single line containing $N$ space-separated integers — the lexicographically smallest proper sequence. -----Constraints----- - $1 \le T \le 8$ - $3 \le N \le 10^5$ - $1 \le K \le N-1$ - $1 \le S \le 10^9$ - $1 \le m \le M \le S$ -----Example Input----- 2 3 6 1 1 5 4 4 2 1 3 -----Example Output----- 1 1 4 -1 -----Explanation----- Example case 1: For the sequence $A = [1, 1, 4]$, it is already sorted, so the program would just remove the first two elements ($K=1$, $N\%K=0$) and return the only remaining element $4$. Obviously, the median of the original sequence is $1$. It can be shown that there is no lexicographically smaller proper sequence. Example case 2: The only possible sequence is $A = [1, 1, 1, 1]$, which is not proper, since Fulu's program will give the correct answer $1$ for it.

["# cook your dish here\n# cook your dish here\nimport numpy as np\nimport sys\n\ndef findSeq(n, s, k, m, M):\n midInd = n // 2\n seqs = []\n for ind in range(midInd + 2, midInd - 3, -1):\n if ind >= n or ind < 0:\n continue \n seq = genBestSeq(n, ind, m, M, s)\n if seq is not -1 and testSeq(k, seq):\n seqs.append(list(seq))\n if len(seqs) == 0:\n return -1\n return min(seqs)\n\n#def findSeq(n, s, k, m, M):\n# midInd = n // 2\n# if k <= midInd: #and (n % 2 == 1 or s < m * midInd + M * (n - midInd)):\n# return genBestSeq(n, midInd + 1, m, M, s) \n# elif k > midInd + 1 and n % 2 == 1:\n# return -1\n# return genBestSeq(n, midInd, m, M, s)\n\ndef genBestSeq(n, diffInd, m, M, s):\n #inc = M - m - 1\n arr = np.full((n,), m)\n arr[diffInd:] += 1\n #remainder = s - np.sum(arr)\n #if remainder < 0:\n # return -1\n\n #nFull, remainder = divmod(remainder, inc)\n #if nFull > n or (nFull == n and remainder > 0):\n # return -1\n\n #addingInd = n - nFull -1\n #arr[addingInd + 1:] += inc\n #arr[addingInd] += remainder\n #return arr\n s = s - np.sum(arr)\n if s < 0:\n return -1\n inc = M - m - 1\n ind = n - 1\n while (ind >= 0):\n z = min(inc, s)\n arr[ind] += z\n s -= z\n ind -= 1\n if s != 0:\n return -1\n return arr\n\ndef testSeq(k, seq):\n seq = sorted(seq)\n n = len(seq)\n if n % 2 == 1:\n median = seq[n // 2]\n else:\n median = (seq[n // 2 - 1] + seq[n // 2]) / 2\n seq.pop(n % k)\n seq.pop(k - 1)\n return (median != seq[(n - 2) // 2]) \n \n\ndef __starting_point():\n nCases = int(input())\n answers = []\n #ks = []\n for i in range(nCases):\n #nums = [int(val) for val in input().split()]\n #ks.append(nums[2])\n #answers.append(findSeq(*nums))\n answers.append(findSeq(*(int(val) for val in input().split())))\n ans = answers[-1]\n if not isinstance(ans, int):\n print(*ans, sep=' ')\n else:\n print(ans)\n #for i, ans in enumerate(answers):\n\n #for ans in answers:\n # if isinstance(ans, np.ndarray):\n # print(*ans, sep=' ')\n # else:\n # print(ans)\n\n__starting_point()", "# cook your dish here\n# cook your dish here\nimport numpy as np\nimport sys\n\ndef findSeq(n, s, k, m, M):\n midInd = n // 2\n seqs = []\n for ind in range(midInd + 2, midInd - 3, -1):\n if ind >= n or ind < 0:\n continue \n seq = genBestSeq(n, ind, m, M, s)\n if seq is not -1 and testSeq(k, seq):\n seqs.append(list(seq))\n if len(seqs) == 0:\n return -1\n return min(seqs)\n\n#def findSeq(n, s, k, m, M):\n# midInd = n // 2\n# if k <= midInd: #and (n % 2 == 1 or s < m * midInd + M * (n - midInd)):\n# return genBestSeq(n, midInd + 1, m, M, s) \n# elif k > midInd + 1 and n % 2 == 1:\n# return -1\n# return genBestSeq(n, midInd, m, M, s)\n\ndef genBestSeq(n, diffInd, m, M, s):\n #inc = M - m - 1\n arr = np.full((n,), m)\n arr[diffInd:] += 1\n #remainder = s - np.sum(arr)\n #if remainder < 0:\n # return -1\n\n #nFull, remainder = divmod(remainder, inc)\n #if nFull > n or (nFull == n and remainder > 0):\n # return -1\n\n #addingInd = n - nFull -1\n #arr[addingInd + 1:] += inc\n #arr[addingInd] += remainder\n #return arr\n s = s - np.sum(arr)\n if s < 0:\n return -1\n inc = M - m - 1\n ind = n - 1\n while (ind >= 0):\n z = min(inc, s)\n arr[ind] += z\n s -= z\n ind -= 1\n if s != 0:\n return -1\n return arr\n\ndef testSeq(k, seq):\n seq = sorted(seq)\n n = len(seq)\n if n % 2 == 1:\n median = seq[n // 2]\n else:\n median = (seq[n // 2 - 1] + seq[n // 2]) / 2\n seq.pop(n % k)\n seq.pop(k - 1)\n return (median != seq[(n - 2) // 2]) \n \n\ndef __starting_point():\n nCases = int(input())\n answers = []\n #ks = []\n for i in range(nCases):\n #nums = [int(val) for val in input().split()]\n #ks.append(nums[2])\n #answers.append(findSeq(*nums))\n answers.append(findSeq(*(int(val) for val in input().split())))\n ans = answers[-1]\n if not isinstance(ans, int):\n print(*ans, sep=' ')\n else:\n print(ans)\n #for i, ans in enumerate(answers):\n\n #for ans in answers:\n # if isinstance(ans, np.ndarray):\n # print(*ans, sep=' ')\n # else:\n # print(ans)\n\n__starting_point()", "# cook your dish here\nimport numpy as np\nimport sys\n\ndef findSeq(n, s, k, m, M):\n midInd = n // 2\n seqs = []\n for ind in range(midInd + 2, midInd - 3, -1):\n if ind >= n or ind < 0:\n continue \n seq = genBestSeq(n, ind, m, M, s)\n if seq is not -1 and testSeq(k, seq):\n seqs.append(list(seq))\n if len(seqs) == 0:\n return -1\n return min(seqs)\n\n#def findSeq(n, s, k, m, M):\n# midInd = n // 2\n# if k <= midInd: #and (n % 2 == 1 or s < m * midInd + M * (n - midInd)):\n# return genBestSeq(n, midInd + 1, m, M, s) \n# elif k > midInd + 1 and n % 2 == 1:\n# return -1\n# return genBestSeq(n, midInd, m, M, s)\n\ndef genBestSeq(n, diffInd, m, M, s):\n #inc = M - m - 1\n arr = np.full((n,), m)\n arr[diffInd:] += 1\n #remainder = s - np.sum(arr)\n #if remainder < 0:\n # return -1\n\n #nFull, remainder = divmod(remainder, inc)\n #if nFull > n or (nFull == n and remainder > 0):\n # return -1\n\n #addingInd = n - nFull -1\n #arr[addingInd + 1:] += inc\n #arr[addingInd] += remainder\n #return arr\n s = s - np.sum(arr)\n if s < 0:\n return -1\n inc = M - m - 1\n ind = n - 1\n while (ind >= 0):\n z = min(inc, s)\n arr[ind] += z\n s -= z\n ind -= 1\n if s != 0:\n return -1\n return arr\n\ndef testSeq(k, seq):\n seq = sorted(seq)\n n = len(seq)\n if n % 2 == 1:\n median = seq[n // 2]\n else:\n median = (seq[n // 2 - 1] + seq[n // 2]) / 2\n seq.pop(n % k)\n seq.pop(k - 1)\n return (median != seq[(n - 2) // 2]) \n \n\ndef __starting_point():\n nCases = int(input())\n answers = []\n #ks = []\n for i in range(nCases):\n #nums = [int(val) for val in input().split()]\n #ks.append(nums[2])\n #answers.append(findSeq(*nums))\n answers.append(findSeq(*(int(val) for val in input().split())))\n ans = answers[-1]\n if not isinstance(ans, int):\n print(*ans, sep=' ')\n else:\n print(ans)\n #for i, ans in enumerate(answers):\n\n #for ans in answers:\n # if isinstance(ans, np.ndarray):\n # print(*ans, sep=' ')\n # else:\n # print(ans)\n\n__starting_point()", "# cook your dish here\nimport numpy as np\nimport sys\n\ndef findSeq(n, s, k, m, M):\n midInd = n // 2\n seqs = []\n for ind in range(midInd + 2, midInd - 3, -1):\n if ind >= n or ind < 0:\n continue \n seq = genBestSeq(n, ind, m, M, s)\n if seq is not -1 and testSeq(k, seq):\n seqs.append(list(seq))\n if len(seqs) == 0:\n return -1\n return min(seqs)\n\n#def findSeq(n, s, k, m, M):\n# midInd = n // 2\n# if k <= midInd: #and (n % 2 == 1 or s < m * midInd + M * (n - midInd)):\n# return genBestSeq(n, midInd + 1, m, M, s) \n# elif k > midInd + 1 and n % 2 == 1:\n# return -1\n# return genBestSeq(n, midInd, m, M, s)\n\ndef genBestSeq(n, diffInd, m, M, s):\n #inc = M - m - 1\n arr = np.full((n,), m)\n arr[diffInd:] += 1\n #remainder = s - np.sum(arr)\n #if remainder < 0:\n # return -1\n\n #nFull, remainder = divmod(remainder, inc)\n #if nFull > n or (nFull == n and remainder > 0):\n # return -1\n\n #addingInd = n - nFull -1\n #arr[addingInd + 1:] += inc\n #arr[addingInd] += remainder\n #return arr\n s = s - np.sum(arr)\n if s < 0:\n return -1\n inc = M - m - 1\n ind = n - 1\n while (ind >= 0):\n z = min(inc, s)\n arr[ind] += z\n s -= z\n ind -= 1\n if s != 0:\n return -1\n return arr\n\ndef testSeq(k, seq):\n seq = sorted(seq)\n n = len(seq)\n if n % 2 == 1:\n median = seq[n // 2]\n else:\n median = (seq[n // 2 - 1] + seq[n // 2]) / 2\n seq.pop(n % k)\n seq.pop(k - 1)\n return (median != seq[(n - 2) // 2]) \n \n\ndef __starting_point():\n nCases = int(input())\n answers = []\n #ks = []\n for i in range(nCases):\n #nums = [int(val) for val in input().split()]\n #ks.append(nums[2])\n #answers.append(findSeq(*nums))\n answers.append(findSeq(*(int(val) for val in input().split())))\n ans = answers[-1]\n if not isinstance(ans, int):\n print(*ans, sep=' ')\n else:\n print(ans)\n #for i, ans in enumerate(answers):\n\n #for ans in answers:\n # if isinstance(ans, np.ndarray):\n # print(*ans, sep=' ')\n # else:\n # print(ans)\n\n__starting_point()", "import numpy as np\r\nimport sys\r\n\r\ndef findSeq(n, s, k, m, M):\r\n midInd = n // 2\r\n seqs = []\r\n for ind in range(midInd + 2, midInd - 3, -1):\r\n if ind >= n or ind < 0:\r\n continue \r\n seq = genBestSeq(n, ind, m, M, s)\r\n if seq is not -1 and testSeq(k, seq):\r\n seqs.append(list(seq))\r\n if len(seqs) == 0:\r\n return -1\r\n return min(seqs)\r\n\r\n#def findSeq(n, s, k, m, M):\r\n# midInd = n // 2\r\n# if k <= midInd: #and (n % 2 == 1 or s < m * midInd + M * (n - midInd)):\r\n# return genBestSeq(n, midInd + 1, m, M, s) \r\n# elif k > midInd + 1 and n % 2 == 1:\r\n# return -1\r\n# return genBestSeq(n, midInd, m, M, s)\r\n\r\ndef genBestSeq(n, diffInd, m, M, s):\r\n #inc = M - m - 1\r\n arr = np.full((n,), m)\r\n arr[diffInd:] += 1\r\n #remainder = s - np.sum(arr)\r\n #if remainder < 0:\r\n # return -1\r\n\r\n #nFull, remainder = divmod(remainder, inc)\r\n #if nFull > n or (nFull == n and remainder > 0):\r\n # return -1\r\n\r\n #addingInd = n - nFull -1\r\n #arr[addingInd + 1:] += inc\r\n #arr[addingInd] += remainder\r\n #return arr\r\n s = s - np.sum(arr)\r\n if s < 0:\r\n return -1\r\n inc = M - m - 1\r\n ind = n - 1\r\n while (ind >= 0):\r\n z = min(inc, s)\r\n arr[ind] += z\r\n s -= z\r\n ind -= 1\r\n if s != 0:\r\n return -1\r\n return arr\r\n\r\ndef testSeq(k, seq):\r\n seq = sorted(seq)\r\n n = len(seq)\r\n if n % 2 == 1:\r\n median = seq[n // 2]\r\n else:\r\n median = (seq[n // 2 - 1] + seq[n // 2]) / 2\r\n seq.pop(n % k)\r\n seq.pop(k - 1)\r\n return (median != seq[(n - 2) // 2]) \r\n \r\n\r\ndef __starting_point():\r\n nCases = int(input())\r\n answers = []\r\n #ks = []\r\n for i in range(nCases):\r\n #nums = [int(val) for val in input().split()]\r\n #ks.append(nums[2])\r\n #answers.append(findSeq(*nums))\r\n answers.append(findSeq(*(int(val) for val in input().split())))\r\n ans = answers[-1]\r\n if not isinstance(ans, int):\r\n print(*ans, sep=' ')\r\n else:\r\n print(ans)\r\n #for i, ans in enumerate(answers):\r\n\r\n #for ans in answers:\r\n # if isinstance(ans, np.ndarray):\r\n # print(*ans, sep=' ')\r\n # else:\r\n # print(ans)\r\n\n__starting_point()", "import numpy as np\r\nimport sys\r\n\r\ndef findSeq(n, s, k, m, M):\r\n midInd = n // 2\r\n seqs = []\r\n for ind in range(midInd + 2, midInd - 3, -1):\r\n if ind >= n or ind < 0:\r\n continue \r\n seq = genBestSeq(n, ind, m, M, s)\r\n if seq is not -1 and testSeq(k, seq):\r\n seqs.append(list(seq))\r\n if len(seqs) == 0:\r\n return -1\r\n return min(seqs)\r\n\r\n#def findSeq(n, s, k, m, M):\r\n# midInd = n // 2\r\n# if k <= midInd: #and (n % 2 == 1 or s < m * midInd + M * (n - midInd)):\r\n# return genBestSeq(n, midInd + 1, m, M, s) \r\n# elif k > midInd + 1 and n % 2 == 1:\r\n# return -1\r\n# return genBestSeq(n, midInd, m, M, s)\r\n\r\ndef genBestSeq(n, diffInd, m, M, s):\r\n #inc = M - m - 1\r\n arr = np.full((n,), m)\r\n arr[diffInd:] += 1\r\n #remainder = s - np.sum(arr)\r\n #if remainder < 0:\r\n # return -1\r\n\r\n #nFull, remainder = divmod(remainder, inc)\r\n #if nFull > n or (nFull == n and remainder > 0):\r\n # return -1\r\n\r\n #addingInd = n - nFull -1\r\n #arr[addingInd + 1:] += inc\r\n #arr[addingInd] += remainder\r\n #return arr\r\n s = s - np.sum(arr)\r\n if s < 0:\r\n return -1\r\n inc = M - m - 1\r\n ind = n - 1\r\n while (ind >= 0):\r\n z = min(inc, s)\r\n arr[ind] += z\r\n s -= z\r\n ind -= 1\r\n if s != 0:\r\n return -1\r\n return arr\r\n\r\ndef testSeq(k, seq):\r\n seq = sorted(seq)\r\n n = len(seq)\r\n if n % 2 == 1:\r\n median = seq[n // 2]\r\n else:\r\n median = (seq[n // 2 - 1] + seq[n // 2]) / 2\r\n seq.pop(n % k)\r\n seq.pop(k - 1)\r\n return (median != seq[(n - 2) // 2]) \r\n \r\n\r\ndef __starting_point():\r\n nCases = int(input())\r\n answers = []\r\n #ks = []\r\n for i in range(nCases):\r\n #nums = [int(val) for val in input().split()]\r\n #ks.append(nums[2])\r\n #answers.append(findSeq(*nums))\r\n answers.append(findSeq(*(int(val) for val in input().split())))\r\n ans = answers[-1]\r\n if not isinstance(ans, int):\r\n print(*ans, sep=' ')\r\n else:\r\n print(ans)\r\n #for i, ans in enumerate(answers):\r\n\r\n #for ans in answers:\r\n # if isinstance(ans, np.ndarray):\r\n # print(*ans, sep=' ')\r\n # else:\r\n # print(ans)\r\n\n__starting_point()", "import numpy as np\r\nimport sys\r\n\r\ndef findSeq(n, s, k, m, M):\r\n midInd = n // 2\r\n seqs = []\r\n for ind in range(midInd + 2, midInd - 3, -1):\r\n if ind >= n or ind < 0:\r\n continue \r\n seq = genBestSeq(n, ind, m, M, s)\r\n if seq is not -1 and testSeq(k, seq):\r\n seqs.append(list(seq))\r\n if len(seqs) == 0:\r\n return -1\r\n return min(seqs)\r\n\r\n#def findSeq(n, s, k, m, M):\r\n# midInd = n // 2\r\n# if k <= midInd: #and (n % 2 == 1 or s < m * midInd + M * (n - midInd)):\r\n# return genBestSeq(n, midInd + 1, m, M, s) \r\n# elif k > midInd + 1 and n % 2 == 1:\r\n# return -1\r\n# return genBestSeq(n, midInd, m, M, s)\r\n\r\ndef genBestSeq(n, diffInd, m, M, s):\r\n #inc = M - m - 1\r\n arr = np.full((n,), m)\r\n arr[diffInd:] += 1\r\n #remainder = s - np.sum(arr)\r\n #if remainder < 0:\r\n # return -1\r\n\r\n #nFull, remainder = divmod(remainder, inc)\r\n #if nFull > n or (nFull == n and remainder > 0):\r\n # return -1\r\n\r\n #addingInd = n - nFull -1\r\n #arr[addingInd + 1:] += inc\r\n #arr[addingInd] += remainder\r\n #return arr\r\n s = s - np.sum(arr)\r\n if s < 0:\r\n return -1\r\n inc = M - m - 1\r\n ind = n - 1\r\n while (ind >= 0):\r\n z = min(inc, s)\r\n arr[ind] += z\r\n s -= z\r\n ind -= 1\r\n if s != 0:\r\n return -1\r\n return arr\r\n\r\ndef testSeq(k, seq):\r\n seq = sorted(seq)\r\n n = len(seq)\r\n if n % 2 == 1:\r\n median = seq[n // 2]\r\n else:\r\n median = (seq[n // 2 - 1] + seq[n // 2]) / 2\r\n seq.pop(n % k)\r\n seq.pop(k - 1)\r\n return (median != seq[(n - 2) // 2]) \r\n \r\n\r\ndef __starting_point():\r\n nCases = int(input())\r\n answers = []\r\n #ks = []\r\n for i in range(nCases):\r\n #nums = [int(val) for val in input().split()]\r\n #ks.append(nums[2])\r\n #answers.append(findSeq(*nums))\r\n answers.append(findSeq(*(int(val) for val in input().split())))\r\n ans = answers[-1]\r\n if not isinstance(ans, int):\r\n print(*ans, sep=' ')\r\n else:\r\n print(ans)\r\n #for i, ans in enumerate(answers):\r\n\r\n #for ans in answers:\r\n # if isinstance(ans, np.ndarray):\r\n # print(*ans, sep=' ')\r\n # else:\r\n # print(ans)\r\n\n__starting_point()", "import numpy as np\nimport sys\n\ndef findSeq(n, s, k, m, M):\n midInd = n // 2\n seqs = []\n for ind in range(midInd + 2, midInd - 3, -1):\n if ind >= n or ind < 0:\n continue \n seq = genBestSeq(n, ind, m, M, s)\n if seq is not -1 and testSeq(k, seq):\n seqs.append(list(seq))\n if len(seqs) == 0:\n return -1\n return min(seqs)\n\n#def findSeq(n, s, k, m, M):\n# midInd = n // 2\n# if k <= midInd: #and (n % 2 == 1 or s < m * midInd + M * (n - midInd)):\n# return genBestSeq(n, midInd + 1, m, M, s) \n# elif k > midInd + 1 and n % 2 == 1:\n# return -1\n# return genBestSeq(n, midInd, m, M, s)\n\ndef genBestSeq(n, diffInd, m, M, s):\n #inc = M - m - 1\n arr = np.full((n,), m)\n arr[diffInd:] += 1\n #remainder = s - np.sum(arr)\n #if remainder < 0:\n # return -1\n\n #nFull, remainder = divmod(remainder, inc)\n #if nFull > n or (nFull == n and remainder > 0):\n # return -1\n\n #addingInd = n - nFull -1\n #arr[addingInd + 1:] += inc\n #arr[addingInd] += remainder\n #return arr\n s = s - np.sum(arr)\n if s < 0:\n return -1\n inc = M - m - 1\n ind = n - 1\n while (ind >= 0):\n z = min(inc, s)\n arr[ind] += z\n s -= z\n ind -= 1\n if s != 0:\n return -1\n return arr\n\ndef testSeq(k, seq):\n seq = sorted(seq)\n n = len(seq)\n if n % 2 == 1:\n median = seq[n // 2]\n else:\n median = (seq[n // 2 - 1] + seq[n // 2]) / 2\n seq.pop(n % k)\n seq.pop(k - 1)\n return (median != seq[(n - 2) // 2]) \n \n\ndef __starting_point():\n nCases = int(input())\n answers = []\n #ks = []\n for i in range(nCases):\n #nums = [int(val) for val in input().split()]\n #ks.append(nums[2])\n #answers.append(findSeq(*nums))\n answers.append(findSeq(*(int(val) for val in input().split())))\n ans = answers[-1]\n if not isinstance(ans, int):\n print(*ans, sep=' ')\n else:\n print(ans)\n #for i, ans in enumerate(answers):\n\n #for ans in answers:\n # if isinstance(ans, np.ndarray):\n # print(*ans, sep=' ')\n # else:\n # print(ans)\n\n__starting_point()"]

{"inputs": [["2", "3 6 1 1 5", "4 4 2 1 3", ""]], "outputs": [["1 1 4", "-1"]]}

INTERVIEW

PYTHON3

CODECHEF

19,124

e4307da7b5ae872452ed840363efbba5

UNKNOWN

Shashank is playing a game with his friends. There are n sticks located in a row at points $a_1,a_2, ...,a_n$. Each stick has a height- $h_i$. A person can chop a stick down, after which it takes over one of the regions [$a_i$ - $h_i$, $a_i$] or [$a_i$, $a_i$ + $h_i$]. The stick that is not chopped remains at the point $a_i$. A person can chop a stick in a particular direction if the region to be taken up by the chopped stick does not overlap with an already existing point. The winner $($s$)$ of the game will be one or more people who can answer the question: What is the maximum number of sticks that can be chopped? Shashank wants to win the game and hence he needs needs your help in finding out what is the maximum number of sticks that can be chopped down. -----Input:----- - The first line of each input contains a single integer n. - n lines follow. Each of the n lines contain a pair of integers: $a_i,h_i$. -----Output:----- Output in a single line answer- the maximum number of sticks that can be chopped down. -----Constraints----- - $1 \leq n \leq 10^5$ - $1 \leq a_i,h_i \leq 10^9$ - The pairs are given in the order of ascending $a_i$. No two sticks are located at the same point. -----Sample Input 1:----- 5 1 2 2 1 5 10 10 9 19 1 -----Sample Input 2:----- 5 1 2 2 1 5 10 10 9 20 1 -----Sample Output 1:----- 3 -----Sample Output 2:----- 4 -----EXPLANATION:----- In the first example you can fell the sticks as follows: - chop the stick 1 to the left — now it will take over the region $[ - 1;1]$ - chop the stick 2 to the right — now it will take over the region $[2;3]$ - spare the stick 3— it will take over the point $5$ - spare the stick 4— it will take over the point $10$ - chop the stick 5 to the right — now it will take over the region $[19;20]$

["# cook your dish here\nn=int(input())\ncounts=dict()\nz=0\nupper=None\nfor i in range(0,n):\n a,h= [int(num) for num in input().split()]\n counts[a]=h\nfor key,count in counts.items():\n c=0\n x=key-count\n y=key+count\n c1=0\n c2=0\n for j in counts.keys():\n if j==key:\n continue\n else:\n if x<=j<=key:\n c1=0\n break\n else:\n c1=1\n for j in counts.keys():\n if j==key:\n continue\n else:\n if key<=j<=y:\n c2=0\n break\n else:\n c2=1\n if c2==0 and c1==1:\n if upper is None:\n z=z+c1\n upper=key\n else:\n if x>=upper:\n z=z+c1\n upper=key\n else:\n z=z+c2\n upper=key\n elif c2==1 and c1==0:\n if upper is None:\n z=z+c2\n upper=y\n else:\n if upper<=key:\n z=z+c2\n upper=y\n else:\n z=z+c1\n upper=y\n elif c2==1 and c1==1:\n if upper is None:\n z=z+c1\n upper=key\n else:\n if x>=upper:\n z=z+c1\n upper=key\n else:\n if upper<=key:\n z=z+c2\n upper=y\n else:\n z=z+0\n upper=y\n else:\n z=z+0\n upper=key\nif len(counts)==1:\n print(1)\nelse:\n print(z)", "l=[]\nn=int(input())\nfor i in range(n):\n l.append(list(map(int,input().split())))\nif(n==1):\n print(1)\nelse:\n c=2\n for i in range(1,n-1):\n if(l[i][0]-l[i][1]>l[i-1][0]):\n c=c+1\n elif(l[i][0]+l[i][1]<l[i+1][0]):\n l[i][0]+=l[i][1]\n c=c+1\n print(c)\n", "# cook your dish here\n#Coding is about expressing your feeling and\n#there is always a better way to express your feeling _Deepak\nimport sys\n# sys.stdin=open('input.txt','r')\n# sys.stdout=open('output.txt','w')\nfrom sys import stdin,stdout\nfrom collections import deque,defaultdict\nfrom math import ceil,floor,inf,sqrt,factorial,gcd,log2\nfrom copy import deepcopy\nii1=lambda:int(stdin.readline().strip())\nis1=lambda:stdin.readline().strip()\niia=lambda:list(map(int,stdin.readline().strip().split()))\nisa=lambda:stdin.readline().strip().split()\nmod=1000000007\n# s=is1()\n# n = len(s)\n# count,res,flag,subans=1,0,0,1\n# subcount=0\n# for i in range(0,n-1):\n# if s[i]=='c' or s[i]=='k':\n# flag=1\n# break\n# if s[i]==s[i+1] and (s[i]=='f' or s[i]=='g'):\n# count+=1\n# elif count>1:\n# subans*=(count*(count-1))//2\n# count=1\n# subcount+=1\n# if s[-1]=='c' or s[-1]=='k':\n# flag=1\n# elif count>1:\n# subans*=(count*(count-1))//2\n# subcount+=1\n# if flag:\n# print(0)\n# else:\n# res=(1<<(subcount-1))\n# res*=subans\n# print(res%mod)\nn = ii1()\narr=[None]*n\nfor ii in range(n):\n arr[ii]=iia()\ncount=2\nif n==1 or n==2:\n print(n)\nelse:\n flag=[0]*n\n flag[0]=-1\n flag[-1]=1\n for i in range(1,n-1):\n if flag[i-1]==-1:\n if arr[i][0]-arr[i-1][0]>arr[i][1]:\n flag[i] =- 1\n count += 1\n elif arr[i+1][0]-arr[i][0]>arr[i][1]:\n flag[i] = 1\n count += 1\n elif flag[i-1]==1:\n if arr[i][0]-(arr[i-1][0]+arr[i-1][1])>arr[i][1]:\n flag[i]=-1\n count += 1\n elif arr[i+1][0]-arr[i][0]>arr[i][1]:\n flag[i]=1\n count += 1\n else:\n if arr[i][0]-arr[i-1][0]>arr[i][1]:\n flag[i]=-1\n count+=1\n elif arr[i+1][0]-arr[i][0]>arr[i][1]:\n flag[i]=1\n count+=1\n print(count)\n\n\n\n", "n=int(input())\na=list(range(n))\nh=list(range(n))\nm=2\nfor i in range(n):\n a[i],h[i]=[int(s) for s in input().split()]\nif n<3:\n m=n\nelse:\n for j in range(1,n-1):\n if a[j]-h[j]>a[j-1]:\n m+=1\n elif a[j]+h[j]<a[j+1]:\n m+=1\n a[j]=a[j]+h[j]\n else:\n continue\n\nprint(m)\n", "# cook your dish here\nn = int(input())\nl = []\nfor i in range(n):\n a, h = map(int,input().split())\n l.append([a,h])\nif len(l)==1:\n print(1)\n return\np = l[0][0]\ncount = 2\nfor i in range(1,len(l)-1):\n if l[i][0]-l[i][1]>p:\n p = l[i][0]\n count+=1\n elif l[i][0]+l[i][1]<l[i+1][0]:\n p = l[i][0]+l[i][1]\n count+=1\n else:\n p = l[i][0]\nprint(count)", "n = int(input())\nres = []\nfor _ in range(n):\n res.append(list(map(int, input().split())))\nif n == 1:\n print(1)\n return\nif n == 2:\n print(2)\n return\nstart = 2\nfor i in range(1, n - 1):\n #first check left\n if (res[i][0] - res[i][1]) > res[i - 1][0]:\n #print(res[i])\n #print(abs(res[i][0] - res[i][1]))\n #print(res[i - 1][0])\n start += 1\n continue\n #check right\n if res[i][0] + res[i][1] < res[i + 1][0]:\n #print(res[i], res[i])\n res[i][0] += res[i][1]\n start += 1\n continue\nprint(start)", "# cook your dish here\nn=int(input())\nlist1=[]\nlist2=[]\nfor i in range(n):\n a,h=list(map(int,input().split()))\n list1.append(a)\n list2.append(h)\ncount=2\nfor j in range(1,n-1):\n k=list1[j]-list2[j]\n if k>list1[j-1]:\n count+=1\n else:\n z=list1[j]+list2[j]\n if z<list1[j+1]:\n count+=1\n list1[j]=list2[j]+list1[j]\nif n==1:\n print('1')\nelse:\n print(count)", "n= int(input())\nco =[]\nhi=[]\nfor i in range(n):\n arr=[int(x) for x in input().split()]\n co.append(arr[0])\n hi.append(arr[-1])\n \nif n<=2:\n count=n\nelse:\n count=2\n for i in range(1,n-1):\n if hi[i]<co[i]-co[i-1]:\n count+=1\n elif hi[i]<co[i+1]-co[i]:\n count+=1\n co[i]+=hi[i]\n else:\n continue\nprint(count)", "from sys import*\ninput= stdin.readline\nn=int(input())\nt=[]\nfor i in range(n):\n a,b=list(map(int,input().split()))\n t.append([a,b])\nif(n==1):\n c=1\nelse:\n c=2 #first tree to left and last tree to right\nfor i in range(1,n-1):\n l = t[i][0]-t[i-1][0]\n r = t[i+1][0] - t[i][0]\n h = t[i][1]\n if(h<l):\n c+=1\n elif(h<r):\n c+=1\n t[i][0]=t[i][0]+h\nprint(c)\n", "n=int(input())\nans=2\n\na=[]\nfor i in range(n):\n a.append(list(map(int,input().split())))\nif(n==1):\n print(1)\n return\nvector=a[0][0]\nfor i in range(1,n-1):\n if(a[i][0]-a[i][1]>vector):\n ans+=1\n vector=a[i][0]\n\n else:\n if(a[i][0]+a[i][1]<a[i+1][0]):\n ans+=1\n vector=a[i][0]+a[i][1]\n else:\n vector=a[i][0]\n \n\n \n \nprint(ans)\n\n \n", "n=int(input())\nl=[]\nfor _ in range(n):\n a,h=map(int,input().split())\n l.append([a,h])\nans=2\nif n==1:\n ans=1\n print(ans)\n return\nl[0].append(\"left\")\nl[n-1].append(\"right\")\nfor i in range(1,n-1):\n if l[i-1][2]==\"right\":\n if abs(l[i][0]-(l[i-1][1]+l[i-1][0]))>l[i][1]:\n ans+=1\n l[i].append(\"left\")\n elif abs(l[i][0]-l[i+1][0])>l[i][1]:\n ans+=1\n l[i].append(\"right\")\n else:\n l[i].append(\"stand\")\n else:\n if abs(l[i][0]-l[i-1][0])>l[i][1]:\n ans+=1\n l[i].append(\"left\")\n elif abs(l[i][0]-l[i+1][0])>l[i][1]:\n ans+=1\n l[i].append(\"right\")\n else:\n l[i].append(\"stand\")\nprint(ans)", "from math import inf as inf\nfrom math import *\nfrom collections import *\nimport sys\nfrom itertools import permutations\n#input=sys.stdin.readline\nn=int(input())\nr=[]\nfor i in range(n):\n a,h=list(map(int,input().split()))\n r.append([a,h])\ns=2\nif(n==1):\n print(1)\n return\nprev=-10000000000000\nfor i in range(1,n-1):\n prev=max(r[i-1][0],prev)\n nex=r[i+1][0]\n if(r[i][0]-r[i][1]>prev):\n s+=1\n elif(r[i][0]+r[i][1]<nex):\n s+=1\n prev=r[i][0]+r[i][1]\nprint(s)\n", "t = int(input())\nlistt = []\nans = 2\n\nfor x in range(t):\n a,b = map(int,input().split())\n listt.append([a,b])\n \ni = 1\n\nwhile i+1<t:\n if listt[i][0] - listt[i][1] > listt[i-1][0]:\n ans = ans+1\n elif listt[i][0] + listt[i][1] < listt[i+1][0]:\n ans = ans+1\n listt[i][0] = listt[i][0]+listt[i][1]\n \n i = i+1\nif t == 1:\n print('1')\nelse:\n print(ans)", "n=int(input())\nl=[]\nfor i in range(n):\n l.append(list(map(int,(input().split()))))\nans=0\nfor i in range(n):\n if i==0:\n ans+=1\n elif i==n-1:\n ans+=1\n else:\n if l[i][0]-l[i][1]>l[i-1][0]:\n ans+=1\n else:\n if l[i][0]+l[i][1]<l[i+1][0]:\n ans+=1\n l[i][0] = l[i][0]+l[i][1]\nprint(ans)\n \n", "n = int(input())\nmainlist = []\nchoppedlist = []\nfor i in range(0,n):\n mainlist.append(input().split())\n\nfor i in range(0,n):\n mainlist[i][0] = int(mainlist[i][0])\n mainlist[i][1] = int(mainlist[i][1])\n\n# print('typeis ',type(mainlist[0][0]))\n\ndef checkifpossible(mainlist, sublist, right, pos):\n # print('sublist is ', sublist)\n # print('mainlist is ', mainlist)\n returncode = True\n\n if right:\n for i in range(pos+1, n):\n # print('at right value of m and s are ', mainlist[i][0], ' ', \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0sublist[1])\n if mainlist[i][0] <= sublist[1]:\n returncode = False\n else:\n for i in range(0, pos):\n # print('value of m and s are ', mainlist[i][0], ' ', sublist[0])\n if mainlist[i][0] >= sublist[0]:\n # print('setting to False')\n returncode = False\n for j in range(0,len(choppedlist)):\n if choppedlist[j][1] >= sublist[0] and not right:\n # print('overlapping chopped list')\n returncode = False\n\n return returncode\n\n\ndef choptreetoright(mainlist, pos):\n nonlocal choppedlist\n sublist = []\n sublist.append(mainlist[pos][0])\n sublist.append(mainlist[pos][0] + mainlist[pos][1])\n right = True\n\n if checkifpossible(mainlist, sublist, right, pos) == True:\n choppedlist.append(sublist)\n return True\n else:\n return False\n\ndef choptreetoleft(mainlist, pos):\n nonlocal choppedlist\n sublist = []\n sublist.append(mainlist[pos][0] - mainlist[pos][1])\n sublist.append(mainlist[pos][0])\n right = False\n if checkifpossible(mainlist, sublist, right, pos) == True:\n choppedlist.append(sublist)\n return True\n else:\n return False\n\nif n >= 2:\n counter = 2\nelif n == 1:\n counter = 1\nelse:\n counter = 0\n\nfor i in range (1, n-1):\n # print('calling left with i ', i)\n if choptreetoleft(mainlist, i):\n counter = counter + 1\n continue\n # print('calling right with i ', i)\n if choptreetoright(mainlist, i):\n counter = counter + 1\n\n# print('chopped list ', choppedlist)\nprint(counter)", "n = int(input())\nmainlist = []\nchoppedlist = []\nfor i in range(0,n):\n mainlist.append(input().split())\n\nfor i in range(0,n):\n mainlist[i][0] = int(mainlist[i][0])\n mainlist[i][1] = int(mainlist[i][1])\n\n# print('typeis ',type(mainlist[0][0]))\n\ndef checkifpossible(mainlist, sublist, right, pos):\n # print('sublist is ', sublist)\n # print('mainlist is ', mainlist)\n returncode = True\n\n if right:\n for i in range(pos+1, n):\n # print('at right value of m and s are ', mainlist[i][0], ' ', \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0sublist[1])\n if mainlist[i][0] <= sublist[1]:\n returncode = False\n else:\n for i in range(0, pos):\n # print('value of m and s are ', mainlist[i][0], ' ', sublist[0])\n if mainlist[i][0] >= sublist[0]:\n # print('setting to False')\n returncode = False\n for j in range(0,len(choppedlist)):\n if choppedlist[j][1] >= sublist[0] and not right:\n # print('overlapping chopped list')\n returncode = False\n\n return returncode\n\n\ndef choptreetoright(mainlist, pos):\n nonlocal choppedlist\n sublist = []\n sublist.append(mainlist[pos][0])\n sublist.append(mainlist[pos][0] + mainlist[pos][1])\n right = True\n\n if checkifpossible(mainlist, sublist, right, pos) == True:\n choppedlist.append(sublist)\n return True\n else:\n return False\n\ndef choptreetoleft(mainlist, pos):\n nonlocal choppedlist\n sublist = []\n sublist.append(mainlist[pos][0] - mainlist[pos][1])\n sublist.append(mainlist[pos][0])\n right = False\n if checkifpossible(mainlist, sublist, right, pos) == True:\n choppedlist.append(sublist)\n return True\n else:\n return False\n\nif n >= 2:\n counter = 2\nelif n == 1:\n counter = 1\nelse:\n counter = 0\n\nfor i in range (1, n-1):\n # print('calling left with i ', i)\n if choptreetoleft(mainlist, i):\n counter = counter + 1\n continue\n # print('calling right with i ', i)\n if choptreetoright(mainlist, i):\n counter = counter + 1\n\n# print('chopped list ', choppedlist)\nprint(counter)", "# cook your dish here\nn = int(input())\na = [list(map(int,input().split())) for _ in range(n)]\na = a + [ (float('inf'), -1) ]\n\nc = 0\n_w = a[0][0]\nfor i in range(1,len(a)):\n if a[i][0] - a[i][1] > _w:\n c += 1\n _w = a[i][0]\n elif a[i][0] + a[i][1] < a[i+1][0]:\n c += 1\n _w = a[i][0] + a[i][1]\n else:\n _w = a[i][0]\n\nprint(c)\n\n", "# cook your dish here\nn = int(input())\na,h=[],[]\narr = [list(map(int,input().split())) for i in range(n)]\narr = sorted(arr,key=lambda i:i[0])\nfor i in arr:\n k,m = i\n a.append(k)\n h.append(m)\nif n==1 or n==2:\n print(n)\nelse:\n count,chopped=2,0\n for i in range(1,n-1):\n if a[i]-a[i-1]>h[i] and chopped ==0:\n count+=1\n elif chopped ==1 and a[i]-a[i-1]-h[i-1]>h[i]:\n chopped=0\n count+=1\n elif a[i+1]-a[i]>h[i]:\n count+=1\n chopped=1\n else:\n chopped=0\n print(count)\n", "import numpy as np\nn = int(input())\narr = np.empty((n,2),dtype=int)\nfor i in range(n):\n x = list(map(int,input().split()))\n arr[i]=x\nflag = 'l'\nif(n==1):\n ans=1\nelse:\n ans=2\nfor i in range(1,n-1):\n curr = arr[i]\n pre = arr[i-1]\n next = arr[i+1]\n if(flag=='l'):\n cn_l = curr[0]-curr[1]\n cn_r = curr[0]+curr[1]\n if(cn_l>pre[0]):\n flag='l'\n ans+=1\n elif(cn_r<next[0]):\n flag='r'\n ans+=1\n elif(flag=='r'):\n cn_l = curr[0] - curr[1]\n cn_r = curr[0] + curr[1]\n pre_r = pre[0] + pre[1]\n if(cn_l > pre_r):\n flag = 'l'\n ans+=1\n elif(cn_r < next[0]):\n flag='r'\n ans+=1\nprint(ans)\n", "\nn=int(input())\nsticks=[]\ncount=2\n\nfor i in range(n):\n inn=input().split(' ')\n sticks.append([int(inn[0]),int(inn[1])])\nif len(sticks)<2:\n print(len(sticks))\n return\narea=[[sticks[0][0]-sticks[0][1],sticks[0][0]],\n\n[sticks[-1][0],sticks[-1][0]+sticks[-1][1]]\n\n]\n\n# print(sticks)\n# print(area)\nfor i in sticks:\n area.append([i[0],i[0]])\ndef check(aa,hh):\n a=aa-hh\n h=aa\n flag=0\n for i in area:\n if i==[aa,aa]:\n continue\n if i[0]==i[1] and a<=i[0] and h>=i[0]:\n flag=-1\n break\n if a<=i[0] and h>=i[0]:\n \n flag=-1\n break\n if a<=i[0] and h>=i[1]:\n \n flag=-1\n break\n if a<=i[1] and h>=i[1]:\n \n flag=-1\n break\n if a>=i[0] and h<=i[1]:\n \n flag=-1\n break\n if flag==0:\n return [a,h]\n flag=1\n a=aa\n h=aa+hh\n for i in area:\n if i==[aa,aa]:\n continue\n if i[0]==i[1] and a<=i[0] and h>=i[0]:\n flag=-1\n break\n if a<=i[0] and h>=i[0]:\n \n flag=-1\n break\n if a<=i[0] and h>=i[1]:\n \n flag=-1\n break\n if a<=i[1] and h>=i[1]:\n \n flag=-1\n break\n if a>=i[0] and h<=i[1]:\n \n flag=-1\n break\n if flag==1:\n return [a,h]\n return -1\n\n\nfor i in sticks[1:-1]:\n temp=check(i[0],i[1])\n \n if temp==-1:\n continue\n count+=1\n area.append(temp)\n\nprint(count)\n\n\n \n\n", "n=int(input())\nah=[]\nfor _ in range(n):\n cach=list(map(int,input().split()))\n ah.append(cach)\nah.sort(key=lambda x:x[0])\n#print(ah)\nlmit=-2*(10**9)\nchop=0\nfor i in range(n-1):\n a=ah[i][0]-ah[i][1]\n b=ah[i][0]\n c=ah[i][0]\n d=ah[i][0]+ah[i][1]\n if b<ah[i+1][0] and a>lmit:\n lmit=b\n chop+=1\n #print(\"first\")\n elif d<ah[i+1][0] and c>lmit:\n #print(\"sec\",a,b,c,d,lmit,ah[i+1][0])\n lmit=d\n chop+=1\n #print(\"sec\")\n else:\n lmit=b\n #print(lmit)\nprint(chop+1)\n", "n = int(input())\n\nl = []\nlc = False\nc = 0\n\nfor i in range(n):\n a, h = list(map(int, input().split()))\n\n l.append([a, h])\n\n if i == 0:\n c += 1\n lc = True\n continue\n\n if lc:\n if a - l[-2][0] <= h:\n lc = False\n\n else:\n c += 1\n lc = True\n\n continue\n\n if a - l[-2][0] > l[-2][1]:\n c += 1\n l[-2][0] += l[-2][1]\n l[-2][1] = 0\n\n if a - l[-2][0] <= h:\n lc = False\n else:\n c += 1\n lc = True\n\nif not lc:\n c += 1\n\nprint(c)\n", "# cook your dish here\nn = int(input())\n\noccupy = [float(\"-inf\")]\nheight = [0]\npos = [float(\"-inf\")]\n\nfor i in range(n):\n p,h = list(map(int, input().split()))\n pos.append(p)\n height.append(h)\n occupy.append(p)\n\npos.append(float(\"inf\"))\nheight.append(0)\noccupy.append(float(\"inf\"))\n\nsol = 0\nfor i in range(1,n+1):\n if pos[i]-height[i] > occupy[i-1]:\n sol +=1\n elif pos[i]+height[i] < occupy[i+1]:\n sol +=1\n occupy[i] = pos[i]+height[i]\n \nprint(sol)\n \n \n\n", "# cook your dish here\nn=int(input())\nout=[0]\ndp=[[float(\"-inf\"),float(\"-inf\"),float(\"-inf\")]]\nfor _ in range(n):\n x=list(map(int,input().split()))\n x=[x[0]-x[1],x[0],x[0]+x[1]]\n dp.append(x)\ndp.append([float(\"inf\"),float(\"inf\"),float(\"inf\")])\nfor i in range(1,len(dp)-1):\n if dp[i-1][2]<dp[i][0]:\n dp[i][2]=dp[i][1]\n out.append(out[-1]+1)\n elif dp[i][2]<dp[i+1][1]:\n out.append(out[-1]+1)\n else:\n dp[i]=[dp[i][1],dp[i][1],dp[i][1]]\n out.append(out[-1])\nprint(out[-1])\n \n\n"]

{"inputs": [["5", "1 2", "2 1", "5 10", "10 9", "19 1", "Sample Input 2:", "5", "1 2", "2 1", "5 10", "10 9", "20 1"]], "outputs": [["3", "Sample Output 2:", "4"]]}

INTERVIEW

PYTHON3

CODECHEF

16,547

cfbc27c1b216dda6841e6eaa7a6b914e

UNKNOWN

To help Lavanya learn all about binary numbers and binary sequences, her father has bought her a collection of square tiles, each of which has either a 0 or a 1 written on it. Her brother Nikhil has played a rather nasty prank. He has glued together pairs of tiles with 0 written on them. Lavanya now has square tiles with 1 on them and rectangular tiles with two 0's on them, made up of two square tiles with 0 stuck together). Thus, she can no longer make all possible binary sequences using these tiles. To amuse herself, Lavanya has decided to pick a number $N$ and try and construct as many binary sequences of length $N$ as possible using her collection of tiles. For example if $N$ = 1, she can only make the sequence 1. For $N$=2, she can make 11 and 00. For $N$=4, there are 5 possibilities: 0011, 0000, 1001, 1100 and 1111. Lavanya would like you to write a program to compute the number of arrangements possible with $N$ tiles so that she can verify that she has generated all of them. Since she cannot count beyond 15746, it is sufficient to report this number modulo 15746. -----Input:----- A single line with a single integer $N$. -----Output:----- A single integer indicating the number of binary sequences of length $N$, modulo 15746, that Lavanya can make using her tiles. -----Constraints:----- You may assume that $N \leq$ 1000000. -----Sample Input:----- 4 -----Sample Output:----- 5 -----Explanation:----- This corresponds to the example discussed above.

["n=int(input())\nmodulo=15746\nnum=[1,1]\nfor i in range(2,n+1):\n num.append((num[i-1]+num[i-2])%modulo)\nprint(num[n])", "def EXEC(n):\r\n if n < 3: return n\r\n else:\r\n x, y = 1, 2\r\n for _ in range(2, n):\r\n z = (x + y) % 15746\r\n x, y = y, z\r\n return y % 15746\r\n\r\n\r\nprint(EXEC(int(input())))", "def fib(n):\r\n s1,s2=1,2\r\n if n==1:\r\n return s1\r\n elif n==2:\r\n return s2\r\n else:\r\n for i in range(2,n):\r\n s3=(s1+s2)%15746\r\n s1=s2\r\n s2=s3\r\n return s2%15746\r\n\r\ntry:\r\n n=int(input())\r\n z=fib(n)\r\n print(z)\r\n \r\nexcept:\r\n pass", "\r\n# // Problem : Zero One Tiles\r\n# // Contest : CodeChef - IARCS OPC Judge Problems\r\n# // URL : https://www.codechef.com/IARCSJUD/problems/TILES01\r\n# // Memory Limit : 256 MB\r\n# // Time Limit : 1000 ms\r\n# // Powered by CP Editor (https://github.com/cpeditor/cpeditor)\r\n\r\ndp = [None]*1000010\r\ndp[0] = 0\r\ndp[1] = 1\t\r\nMOD = 15746\r\nn = int(input())\r\nfor i in range(2,n+2):\r\n\tdp[i] = (dp[i-1]+dp[i-2])%MOD\r\nprint(dp[n+1])", "n=int(input())\r\na,b=1,2\r\nif n==1 :\r\n print(1)\r\nelif n==2 :\r\n print(2)\r\nelse :\r\n for i in range (3 , n+1) :\r\n c=(a+b)%15746\r\n a=b\r\n b=c\r\n print(c%15746)", "n = int(input())\r\n\r\nl1 = 1\r\nl2 = 1\r\n\r\nans = 0\r\n\r\nif(n == 0):\r\n ans = 0\r\nelif(n == 1):\r\n ans = 1\r\nelif(n == 2):\r\n ans = 2\r\nelse:\r\n ans = 2\r\n for i in range(3,n+1):\r\n ans = ans % 15746\r\n k = l2 \r\n l2 = ans\r\n l1 = k\r\n ans = l1 + l2\r\n\r\nans = ans % 15746\r\n \r\nprint(ans)", "\r\n'''def abcd(n):\r\n x=(1+math.sqrt(5))/2\r\n y=(1-math.sqrt(5))/2\r\n \r\n val=((power(x, n, 15746)-power(y, n, 15746))//math.sqrt(5))\r\n return(int(val))'''\r\n \r\ndef main():\r\n n=int(input())\r\n #x=abcd(n+1)\r\n a=1; b=2;\r\n if(n==1):\r\n print(1)\r\n elif(n==2):\r\n print(2)\r\n else:\r\n for i in range(3, n+1):\r\n temp=(a+b)%15746\r\n a=b%15746\r\n b=temp%15746\r\n \r\n print(temp%15746)\r\n #print(power(0.55, 67, 1355))\r\n \r\nmain()"]

{"inputs": [["4"]], "outputs": [["5"]]}

INTERVIEW

PYTHON3

CODECHEF

2,329

9aa1ff9c7a9b31c162bca56de8c5374d

UNKNOWN

The chef is playing a game of long distance. Chef has a number K and he wants to find the longest distance between the index of the first and the last occurrence of K in a given array of N numbers. -----Input:----- - First-line will contain $T$, the number of test cases. Then the test cases follow. - Each test case contains two lines of input. - Next line with Two integers in one line $K, N$. - Next line with $N$ space-separated integers. -----Output:----- For each test case, output in a single line answer as the index of first and last occurrence of K in the given array. Note: Here Indexing is from 1 not 0 based. -----Constraints----- - $1 \leq T \leq 100$ - $1 \leq k \leq 10^5$ - $1 \leq N \leq 10^5$ -----Sample Input:----- 2 2 6 2 3 4 2 1 6 4 6 2 3 4 2 1 6 -----Sample Output:----- 3 0 -----EXPLANATION:----- For 1) Index of First and last occurrence of 2 in the given array is at 1 and 4, i.e. distance is 3. For 2) 4 occurs only once in the given array hence print 0.

["# cook your dish here\nfor _ in range(int(input())):\n m,n=list(map(int,input().split()))\n a=[int(i) for i in input().split()]\n l=-1\n for i in range(n-1,-1,-1):\n if a[i]==m:\n l=i\n break\n f=-1\n for i in range(0,n):\n if a[i]==m:\n f=i\n break\n print(l-f)\n \n \n", "# cook your dish here\nt=int(input())\nfor _ in range(t):\n k,n=map(int,input().split())\n l=list(map(int,input().split())) \n f=-1\n s=-1\n for i in range(n):\n if l[i]==k:\n f=i \n break \n for i in range(n-1,-1,-1):\n if l[i]==k:\n s=i\n break \n if f==-1 or s==-1:\n print(0) \n else:\n s+=1 \n f+=1\n print(s-f)", "# cook your dish here\nfor t in range(int(input())):\n k,n=map(int, input().split())\n a=list(map(int, input().split()))[:n]\n lst=[]\n for i in range(n):\n if a[i]==k:\n lst.append(i)\n if len(lst)>0:\n print(max(lst)-min(lst))\n else:\n print(0)", "# cook your dish here\nT = int(input())\n\nfor t in range(T):\n K,N = map(int,input().split())\n data = list(map(int,input().split()))\n \n first = -1\n \n for i in range(len(data)):\n if(data[i]==K):\n first = i\n break\n \n second = -1\n \n for i in range(len(data)-1,first,-1):\n if(data[i]==K):\n second = i\n break\n \n if(first == -1 or second == -1):\n print(0)\n else:\n print(second-first)", "# cook your dish here\nT = int(input())\n\nfor t in range(T):\n K,N = map(int,input().split())\n data = list(map(int,input().split()))\n \n first = -1\n \n for i in range(len(data)):\n if(data[i]==K):\n first = i\n break\n \n second = -1\n \n for i in range(len(data)-1,first,-1):\n if(data[i]==K):\n second = i\n break\n \n if(first == -1 or second == -1):\n print(0)\n else:\n print(second-first)", "from sys import stdin, stdout\r\ninput = stdin.readline\r\nfrom collections import defaultdict as dd\r\nimport math\r\ndef geti(): return list(map(int, input().strip().split()))\r\ndef getl(): return list(map(int, input().strip().split()))\r\ndef gets(): return input()\r\ndef geta(): return int(input())\r\ndef print_s(s): stdout.write(s+'\\n')\r\n\r\ndef solve():\r\n for _ in range(geta()):\r\n m,n=geti()\r\n a=getl()\r\n l=s=0\r\n for i in range(n):\r\n if a[i]==m:\r\n s=i\r\n break\r\n for i in range(n-1,-1,-1):\r\n if a[i]==m:\r\n l=i\r\n break\r\n print(l-s)\r\n\r\ndef __starting_point():\r\n solve()\r\n\n__starting_point()", "T = int(input())\r\n\r\nfor t in range(T):\r\n K,N = map(int,input().split())\r\n data = list(map(int,input().split()))\r\n \r\n first = -1\r\n \r\n for i in range(len(data)):\r\n if(data[i]==K):\r\n first = i\r\n break\r\n \r\n second = -1\r\n \r\n for i in range(len(data)-1,first,-1):\r\n if(data[i]==K):\r\n second = i\r\n break\r\n \r\n if(first == -1 or second == -1):\r\n print(0)\r\n else:\r\n print(second-first)"]

{"inputs": [["2", "2 6", "2 3 4 2 1 6", "4 6", "2 3 4 2 1 6"]], "outputs": [["3", "0"]]}

INTERVIEW

PYTHON3

CODECHEF

3,482

6b94b63ef40ecd0ba43a3634abedbef4

UNKNOWN

Vasya's older brother, Petya, attends an algorithm course in his school. Today he learned about matchings in graphs. Formally, a set of edges in a graph is called a matching if no pair of distinct edges in the set shares a common endpoint. Petya instantly came up with an inverse concept, an antimatching. In an antimatching, any pair of distinct edges should have a common endpoint. Petya knows that finding a largest matching in a graph is a somewhat formidable task. He wonders if finding the largest antimatching is any easier. Help him find the number of edges in a largest antimatching in a given graph. -----Input:----- The first line contains T$T$, number of test cases per file. The first line of each test case contains two integers n$n$ and m−$m-$ the number of vertices and edges of the graph respectively (1≤n≤104$1 \leq n \leq 10^4$, 0≤m≤104$0 \leq m \leq 10^4$). The next m$m$ lines describe the edges. The i$i$-th of these lines contains two integers ui$u_i$ and vi−$v_i-$ the indices of endpoints of the i$i$-th edge (1≤ui,vi≤n$1 \leq u_i, v_i \leq n$, ui≠vi$u_i \neq v_i$). It is guaranteed that the graph does not contain self-loops nor multiple edges. It is not guaranteed that the graph is connected. -----Output:----- Print a single number per test case −$-$ the maximum size of an antichain in the graph. -----Constraints----- - 1≤T≤10$1 \leq T \leq 10$ - 1≤n≤104$1 \leq n \leq 10^4$ - 0≤m≤104$0 \leq m \leq 10^4$ - 1≤ui,vi≤n$1 \leq u_i, v_i \leq n$ - ui≠vi$u_i \neq v_i$ -----Sample Input:----- 3 3 3 1 2 1 3 2 3 4 2 1 2 3 4 5 0 -----Sample Output:----- 3 1 0 -----EXPLANATION:----- In the first sample all three edges form an antimatching. In the second sample at most one of the two edges can be included in an antimatching since they do not share common endpoints. In the third sample there are no edges, hence the answer is 0$0$.

["def detect_triangle(adj): \n for x in range(len(adj)):\n for y in adj[x]:\n if not set(adj[x]).isdisjoint(adj[y]):\n return True\n\n \nfor _ in range(int(input())):\n n,m=list(map(int,input().split()))\n graph=[[] for i in range(n)]\n for i in range(m):\n u,v=list(map(int,input().split()))\n graph[u-1].append(v-1)\n graph[v-1].append(u-1)\n h=[] \n for i in range(len(graph)):\n h.append(len(graph[i]))\n h1=max(h) \n if h1>=3:\n print(h1)\n continue\n if detect_triangle(graph):\n print(3)\n continue\n print(h1) # cook your dish here\n", "# cook your dish here\ndef detect_triangle(adj): \n for x in range(len(adj)):\n for y in adj[x]:\n if not set(adj[x]).isdisjoint(adj[y]):\n return True\n\n \nfor _ in range(int(input())):\n n,m=map(int,input().split())\n graph=[[] for i in range(n)]\n for i in range(m):\n u,v=map(int,input().split())\n graph[u-1].append(v-1)\n graph[v-1].append(u-1)\n h=[] \n for i in range(len(graph)):\n h.append(len(graph[i]))\n h1=max(h) \n if h1>=3:\n print(h1)\n continue\n if detect_triangle(graph):\n print(3)\n continue\n print(h1) ", "# cook your dish here\ndef detect_triangle(adj): \n for x in range(len(adj)):\n for y in adj[x]:\n if not set(adj[x]).isdisjoint(adj[y]):\n return True\n\n \nfor _ in range(int(input())):\n n,m=map(int,input().split())\n graph=[[] for i in range(n)]\n for i in range(m):\n u,v=map(int,input().split())\n graph[u-1].append(v-1)\n graph[v-1].append(u-1)\n h=[] \n for i in range(len(graph)):\n h.append(len(graph[i]))\n h1=max(h) \n if h1>=3:\n print(h1)\n continue\n if detect_triangle(graph):\n print(3)\n continue\n print(h1) ", "def detect_triangle(adj): \n for x in range(len(adj)):\n for y in adj[x]:\n if not set(adj[x]).isdisjoint(adj[y]):\n return True\n\n \nfor _ in range(int(input())):\n n,m=list(map(int,input().split()))\n graph=[[] for i in range(n)]\n for i in range(m):\n u,v=list(map(int,input().split()))\n graph[u-1].append(v-1)\n graph[v-1].append(u-1)\n h=[] \n for i in range(len(graph)):\n h.append(len(graph[i]))\n h1=max(h) \n if h1>=3:\n print(h1)\n continue\n if detect_triangle(graph):\n print(3)\n continue\n print(h1) \n", "import sys\n#sys.stdin = open(\"i\",\"r\")\n\nfor _ in range( int(input()) ):\n\n n, m = list(map(int, input().split()))\n adj = [ [] for _ in range(n+1) ]\n\n for _ in range(m):\n src, dest = list(map(int, input().split()))\n adj[src].append(dest)\n adj[dest].append(src)\n\n print(( max( max( [len(a) for a in adj] ) , 3 \\\n if any( not set(adj[x]).isdisjoint(adj[y]) \\\n for x in range(len(adj)) for y in adj[x] ) \\\n else max( [len(a) for a in adj] ) ) ))\n"]

{"inputs": [["3", "3 3", "1 2", "1 3", "2 3", "4 2", "1 2", "3 4", "5 0"]], "outputs": [["3", "1", "0"]]}

INTERVIEW

PYTHON3

CODECHEF

2,979

454db7c33a5976ae5fde2997905fe196

UNKNOWN

Chef got in the trouble! He is the king of Chefland and Chessland. There is one queen in Chefland and one queen in Chessland and they both want a relationship with him. Chef is standing before a difficult choice… Chessland may be considered a chessboard with $N$ rows (numbered $1$ through $N$) and $M$ columns (numbered $1$ through $M$). Let's denote a unit square in row $r$ and column $c$ by $(r, c)$. Chef lives at square $(X, Y)$ of this chessboard. Currently, both queens are living in Chessland too. Each queen, when alone on the chessboard, can see all squares that lie on the same row, column or diagonal as itself. A queen from $(x_q, y_q)$ cannot see a square $(r, c)$ if the square $(X, Y)$ is strictly between them. Of course, if the queens can see each other, the kingdom will soon be in chaos! Help Chef calculate the number of possible configurations of the queens such that the kingdom will not be in chaos. A configuration is an unordered pair of distinct squares $(x_{q1}, y_{q1})$ and $(x_{q2}, y_{q2})$ such that neither of them is the square $(X, Y)$. Two configurations are different if the position of queen $1$ is different or the position of queen $2$ is different. -----Input----- - The first line of the input contains a single integer $T$ denoting the number of test cases. The description of $T$ test cases follows. - The first and only line of each test case contains four space-separated integers $N$, $M$, $X$ and $Y$. -----Output----- For each test case, print a single line containing one integer — the number of configurations such that the kingdom will not be in chaos. -----Constraints----- - $1 \le T \le 1000$ - $1 \le X \le N \le 10^2$ - $1 \le Y \le M \le 10^2$ - $2 \le N, M$ -----Example Input----- 2 3 3 2 2 4 4 2 3 -----Example Output----- 24 94 -----Explanation----- Example case 1: Half of these configurations are: - $(1, 1), (3, 3)$ - $(1, 1), (2, 3)$ - $(1, 1), (3, 2)$ - $(1, 2), (3, 3)$ - $(1, 2), (3, 2)$ - $(1, 2), (3, 1)$ - $(1, 3), (3, 1)$ - $(1, 3), (3, 2)$ - $(1, 3), (2, 1)$ - $(2, 1), (2, 3)$ - $(2, 1), (1, 3)$ - $(2, 1), (3, 3)$

["def C(n):\n return n*(n-1)//2\n\n\ndef sol():\n equal, mini = False, min(N,M)\n total_ways = 2*C(N * M)\n if N==M:\n equal = True\n ways = 0\n if not equal:\n ways = (N*C(M)+M*C(N))\n diag = 0\n for i in range(2, mini+1):\n diag += 2*C(i)\n for i in range(mini+1,max(N,M)):\n diag += C(mini)\n diag *= 2\n ways += diag\n ways *= 2\n else:\n ways = (N*C(M)+M*C(N))\n diag = 0\n for i in range(2, mini):\n diag += 2*C(i)\n diag += C(mini)\n diag *= 2\n ways += diag\n ways *=2\n safe = total_ways - ways\n l, r, t, d = Y-1, M-Y, X-1, N-X\n safe_add, to_remove = 0, 0\n\n for i in range(1,N+1):\n for j in range(1, M+1):\n if i==X or j==Y or abs(i-X)==abs(j-Y):\n continue\n else:\n to_remove += 1\n\n if l>0 and r>0 and t>0 and d>0:\n dtl, dtr, dbl, dbr = min(l,t), min(r,t), min(l,d), min(r,d)\n safe_add += dtl*dbr*2 + dtr*dbl*2\n safe_add += t*d*2\n safe_add += l*r*2\n elif l>0 and r>0:\n safe_add += l*r*2\n elif t>0 and d>0:\n safe_add += t*d*2\n\n safe += safe_add - to_remove*2\n\n return safe\n\n\nT = int(input())\nfor _ in range(T):\n N, M, X, Y = [int(x) for x in input().split()]\n print(sol())", "\ndef solve(N,M,x,y):\n n,m=min(N,M),max(N,M)\n\n count = ((n-1)*n*(2*n-1)//3 + (m-n+1)*n**2 ) * 2 ## total sum of l_d and \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0r_d at all places\n p1,p2 = min(x-1,y-1),min(N-x,M-y)\n r1,r2 = min(M-y,x-1),min(N-x,y-1)\n #print('-->',p1,p2,r1,r2)\n count += (n+m)*n*m ## total sum of places queen 2 cannt have at all cells \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0including kings cell\n #print('1',count)\n\n count -= p1+p2+r1+r2 + n+m + 2 ## place occupied by king cannot be \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0occupied by queen\n #print('2',count)\n \n count += (n*m)-(p1+p2+r1+r2 + n + m -1) ## total count where queen 2 cannot \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0come\n #print('3',count)\n\n count -= (n*m-1)*3 ## total count where queen 2 cannot come where centre is \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0counted once\n #print('4',count)\n tot = (n*m-1)*n*m - count\n #print(tot)\n tot += 2*(p1*p2 + r1*r2 + (x-1)*(N-x) + (y-1)*(M-y))\n\n return tot\n \n\nfor _ in range(int(input())):\n\n n,m,x,y = list(map(int,input().split()))\n print(solve(n,m,x,y))\n", "def ncr(n, r): \n if n < r :\n return 0\n elif r == 2:\n return(n*(n-1)/2)\n elif r == 1:\n return n\n else:\n t = 0\n\nt = int(input())\nfor p in range(t):\n n,m,x,y = input().split()\n n,m,x,y = int(n),int(m),int(x),int(y)\n\n maxi = ncr(n*m-1,2)\n\n sub1 = ncr(n,2) * (m-1)\n sub2 = ncr(m,2) * (n-1)\n maxi = maxi - (sub1 + sub2)\n #print(maxi)\n\n sub3 = ncr(y-1,2) + ncr(m-y,2)\n sub4 = ncr(x-1,2) + ncr(n-x,2)\n #print(sub3,sub4)\n maxi = maxi - (sub3 + sub4)\n #print(maxi)\n\n if n < m:\n temp = n\n diff = m-n\n else:\n temp = m\n diff = n-m\n\n sub5 = 0\n sub6 = 0\n for i in range(2,temp):\n sub5 += ncr(i,2)\n\n for j in range(diff+1):\n sub6 += ncr(temp,2)\n\n sub5 *= 4\n sub6 *= 2\n\n #print(sub5,sub6)\n maxi = maxi - (sub5 + sub6)\n #print(maxi)\n\n l1 = min(n-x,y-1)\n l2 = min(m-y,x-1)\n maxi = maxi + l1 + l2 + (l1*l2)\n\n\n l3 = min(x-1,y-1)\n l4 = min(m-y,n-x)\n maxi = maxi + l3 + l4 + (l3*l4)\n\n print(int(maxi*2))\n\n\n\n\n"]

{"inputs": [["2", "3 3 2 2", "4 4 2 3"]], "outputs": [["24", "94"]]}

INTERVIEW

PYTHON3

CODECHEF

3,259

26ac5951eecc0558de4dbf241c860a0b

UNKNOWN

2021 was approaching and the world was about to end. So 2 gods Saurabhx and Saurabhy (from Celesta) created the Cyberverse. But this time disappointed with humans both the gods decided not to have humans in this world. So they created a world of cyborgs. A world without humans. Isn’t it interesting? So let us dive into the cyberverse and have a look at their problems. There are $N$ kid cyborgs with Chief Cyborg '100gods' and he has $K$ weapons with him. He wants to distribute those $K$ weapons among $N$ kid cyborgs. Since all the kid cyborgs are very good friends, so they set a rule among themselves for taking those weapons. The rule states that the difference between kid cyborg having the maximum weapons and the kid cyborg having minimum weapons should be less than or equal to $1$. Find the value of the minimum number of weapons a kid cyborg can have when all the $K$ weapons are distributed among them. -----Input:----- - The first line contains an integer $T$, denoting the number of test cases. - Each of the next $T$ lines will contain two space-separated integers denoting $N$ and $K$ respectively. -----Output:----- - For each test case ,output a single line containing an integer $X$ denoting the minimum number of weapons a kid cyborg can have in that test case. -----Constraints:----- - $1 \leq T \leq 10^5$ - $1 \leq N \leq 10^5$ - $1 \leq K \leq 10^9$ -----Sample Input:----- 1 5 8 -----Expected Output:----- 1 -----Explanation----- - There are $5$ kids and $8$ weapons. - Hence we will distribute the weapons such that $3$ kids have $2$ weapons each and the remaining $2$ kids have $1$ weapon each. - Hence the minimum number of weapons a kid cyborg has is $1$. ( That is, $min(1,2)$ = $1$ )

["# cook your dish here\nt=int(input())\nfor i in range(t):\n (n,k)=tuple(map(int,input().split()))\n print(k//n)", "# cook your dish here\nt=int(input())\nfor _ in range(t):\n n,k=map(int,input().split())\n print(k//n)", "# cook your dish here\nt=int(input())\nfor i in range(0,t):\n s=input().split(\" \")\n k=list(map(int,s))\n print(k[1]//k[0])", "for i in range(int(input())):\n x,y=list(map(int,input().split()))\n print(y//x)\n", "for _ in range(int(input())):\n n,k=list(map(int,input().split()))\n print(k//n)\n", "t=input()\nt=int(t)\nwhile t!=0 :\n inp=input().split(\" \")\n inp=[int(x) for x in inp]\n print(int(inp[1]/inp[0]))\n t-=1", "# cook your dish here\nfor i in range(int(input())):\n k,w=map(int,input().split())\n if k>w:\n print(0)\n else:\n print(w//k)", "for i in range(int(input())):\n k,w=list(map(int,input().split()))\n c=0\n if k>w:\n print(0)\n \n else:\n print(w//k)\n", "for _ in range(int(input())):\n N, K = map(int, input().split())\n print(K // N)", "# cook your dish here\nfor t in range(int(input())):\n n,k=[int(x)for x in input().rstrip().split()]\n print(k//n)\n", "import math\nt=int(input())\nfor i in range(t):\n n,x=map(int,input().split())\n print(math.floor(x/n))", "t=int(input())\nfor a in range(t):\n (a,b)=map(int,input().split())\n import math\n print(math.floor(b/a))", "t=int(input())\nfor a in range(t):\n (a,b)=map(int,input().split())\n import math\n print(math.floor(b/a))", "# cook your dish here\nfor i in range(int(input())):\n NUMBER=input().split()\n CYBER_KIDS=int(NUMBER[0])\n WEAPONS=int(NUMBER[1])\n count=0\n if WEAPONS<CYBER_KIDS:\n print(count)\n else:\n count=WEAPONS//CYBER_KIDS\n print(count)", "# cook your dish here\nfor t in range(int(input())):\n n,k = map(int,input().split())\n print(k//n)", "# cook your dish here\nfor _ in range(int(input())):\n n,k=map(int,input().split())\n print(k//n)", "# cook your dish here\nt=int(input())\nfor _ in range(t):\n a,b=list(map(int,input().split()))\n print(int(b/a))\n", "for k in range(int(input())):\n a,b=map(int,input().split())\n print(b//a) ", "T = int(input())\nfor i in range(T):\n N,K = (int(x) for x in input().split())\n if N>K:\n print(0)\n else:\n print(K//N)\n \n", "for _ in range(int(input())):\n n,k=map(int,input().split())\n if n<=k:\n div=k//n\n rem=k%n\n if rem: \n maxx=div+1\n minn=div\n else: \n maxx=div\n minn=div\n else:\n maxx=1\n minn=0\n print(minn)", "for _ in range(int(input())):\n n,k=map(int,input().split())\n if n<=k:\n div=k//n\n rem=k%n\n if rem: \n maxx=div+1\n minn=div\n else: \n maxx=div\n minn=div\n else:\n maxx=1\n minn=0\n print(minn)", "# cook your dish here\nfor _ in range(int(input())):\n n,k=map(int,input().split())\n k1=k//n \n print(k1)", "# cook your dish here\nt=int(input())\nfor _ in range(t):\n n,k=map(int,input().split())\n k1=k//n \n print(k1)", "# cook your dish here\nt=int(input())\nfor _ in range(t):\n n,k=list(map(int,input().split()))\n k1=k//n \n print(k1)\n", "# cook your dish here\nt=int(input())\nfor _ in range(t):\n n,k=list(map(int,input().split()))\n k1=k//n \n k2=k-(k1*n)\n print(k1)\n"]

{"inputs": [["1", "5 8"]], "outputs": [["1"]]}

INTERVIEW

PYTHON3

CODECHEF

3,126

23dc1dec94f19037b403ceeccd854435

UNKNOWN

Zonal Computing Olympiad 2015, 29 Nov 2014 We say that two integers x and y have a variation of at least K, if |x − y| ≥ K (the absolute value of their difference is at least K). Given a sequence of N integers a1,a2,...,aN and K, the total variation count is the number of pairs of elements in the sequence with variation at least K, i.e. it is the size of the set of pairs {(i,j)|1≤i<j≤N and|ai−aj|≥K} For example if K = 1 and the sequence is 3,2,4 the answer is 3. If K = 1 and the sequence is 3, 1, 3 then the answer is 2. Your task is to write a program that takes a sequence and the value K as input and computes the total variation count. -----Input format----- The first line contains two positive integers N and K, separated by a space. This is followed by a line containing N integers separated by space giving the values of the sequence. -----Output format----- A single integer in a single line giving the total variation count. -----Test data----- You may assume that all integers in the input are in the range 0 to 10^8 inclusive. Subtask 1 (40 marks) : 1 ≤ N ≤ 4000, 1 ≤ K ≤ 10^8 Subtask 2 (60 marks) : 1 ≤ N ≤ 65000, 1 ≤ K ≤ 10^8 -----Sample Input----- 3 1 3 1 3 -----Sample Output----- 2

["n,k=[int(x) for x in input().split()]\r\na=[int(x) for x in input().split()]\r\nans=0\r\nfor i in range(n-1):\r\n for j in range(i+1,n):\r\n if(abs(a[i]-a[j])>=k):\r\n ans+=1\r\nprint(ans)\r\n", "n,k=map(int,input().split())\na=list(map(int,input().split()))\na.sort()\ni=0\ns=0\nfor j in range(0,n):\n while(i<n):\n if(a[i]-a[j]>=k):\n s=s+(n-i)\n break\n i=i+1\nprint(s)", "import sys\r\nn,k=list(map(int,input().strip().split()))\r\na=list(map(int,sys.stdin.readline().strip().split()))\r\ns=0\r\nfor i in range(len(a)):\r\n for j in range(i+1,len(a)):\r\n if abs(a[i]-a[j])>=k:\r\n s+=1\r\n \r\nprint(s)\r\n", "n,k=list(map(int,input().strip().split()))\r\na=list(map(int,input().strip().split()))\r\ns=0\r\nfor i in range(len(a)):\r\n for j in range(i+1,len(a)):\r\n if abs(a[i]-a[j])>=k:\r\n s+=1\r\n \r\nprint(s)\r\n", "n,k=list(map(int,input().split()))\nl=list(map(int,input().split()))\nl.sort()\ni=0\nfin=0\nfor j in range(0,n):\n while(i<n):\n if(l[i]-l[j]>=k):\n fin=fin+(n-i)\n break\n i=i+1\nprint(fin)", "n,k=list(map(int,input().split()))\nl=list(map(int,input().split()))\nl.sort()\ni=0\nfin=0\nfor j in range(n):\n while(i<n):\n if(l[i]-l[j]>=k):\n fin=fin+(n-i)\n break\n i=i+1\nprint(fin)", "n,k=list(map(int,input().split()))\nl=list(map(int,input().split()))\ncount=0\nfor i in range(0,n-1):\n for j in range(i+1,n):\n if(abs(l[i]-l[j])>=k):\n count=count+1\nprint(count)\n \n", "# cook your dish here\nN, K = map(int, input().split(\" \"))\ninputs = list(map(int, input().split(\" \")))\ninputs.sort()\ndata = [[inputs[0], 1]]\ntotal = 0\nprevious = [inputs[0], 0]\nfor n in range(1,N): \n if inputs[n] == previous[0]: \n total+=previous[1]\n data[0][1] += 1\n else: \n flag = True\n for point in data:\n if inputs[n] - point[0] >= K: \n total += point[1]\n previous = [inputs[n], point[1]]\n flag = False\n break\n data = [[inputs[n], data[0][1] + 1]] + data\n if flag:\n previous = [inputs[n], 0]\nprint(total)", "# cook your dish here\nN, K = map(int, input().split(\" \"))\ninputs = list(map(int, input().split(\" \")))\ninputs.sort()\ndata = [[None, 0]]\ntotal = 0\nprevious = [None, None]\nfor n in range(N): \n if inputs[n] == previous[0]: \n total+=previous[1]\n data[0][1] += 1\n else: \n previous = [None, None]\n data = [[inputs[n], data[0][1] + 1]] + data\n for point in data[1:-1]:\n if inputs[n] - point[0] >= K: \n total += point[1]\n previous = [inputs[n], point[1]]\n break\n if previous == [None, None]:\n previous = [inputs[n], 0]\nprint(total)", "# cook your dish here\nN, K = map(int, input().split(\" \"))\ninputs = list(map(int, input().split(\" \")))\ninputs.sort()\ntotal = 0\nprevious = [None, None]\nfor n in range(1, N): \n if inputs[n] == previous[0]: \n total+=previous[1]\n continue\n previous = [None, None]\n for i in range(n-1, -1, -1):\n tmp = inputs[n] - inputs[i]\n if tmp < 0: \n tmp = -tmp\n if tmp >= K: \n total += i+1 \n previous[1] = i+1\n previous[0] = inputs[n]\n break\n if previous[0] is None: \n previous[0] = inputs[n]\n previous[1] = 0\nprint(total)", "# cook your dish here\nN, K = map(int, input().split(\" \"))\ninputs = list(map(int, input().split(\" \")))\ninputs.sort()\ntotal = 0\nfor n in range(N): \n for i in range(n-1, -1, -1):\n tmp = inputs[n] - inputs[i]\n if tmp < 0: \n tmp = -tmp\n if tmp >= K: \n total += i+1 \n break\nprint(total)", "# cook your dish here\nN,K=map(int,input().split())\nx=list(map(int,input().split()))[:N]\ncount=[]\nfor i in range(len(x)):\n for j in range(i,len(x)):\n if abs(x[i]-x[j])>=K:\n count.append(1)\nprint(len(count))", "# cook your dish here\nN,K=map(int,input().split())\nx=list(map(int,input().split()))[:N]\ncount=[]\nfor i in range(len(x)):\n for j in range(i,len(x)):\n if abs(x[i]-x[j])>=K:\n count.append(1)\nprint(len(count))", "n,k=list(map(int,input().split()))\narr=list(map(int,input().split()))\narr.sort()\ni=0\nres=0\nfor j in range(n):\n while(i<n):\n if(arr[i]-arr[j]>=k):\n res=res+(n-i)\n break\n i+=1\nprint(res) \n \n", "n,k=list(map(int,input().split()))\narr=list(map(int,input().split()))\narr.sort()\ni=0\nres=0\nwhile(i<len(arr)):\n j=i+1\n while(j<len(arr)):\n if(arr[j]-arr[i]>=k):\n res=res+len(arr)-j\n break\n j+=1\n i+=1\nprint(res) \n \n", "n,k=list(map(int,input().split()))\narr=list(map(int,input().split()))\narr.sort()\ni=0\nres=0\nwhile(i<len(arr)):\n j=i+1\n while(j<len(arr)):\n if(arr[j]-arr[i]>=k):\n res=res+1\n j+=1\n i+=1\nprint(res) \n \n", "n, k = list(map(int, input().split()))\narr = list(map(int, input().split()))\narr.sort()\ncount = 0\n\nj = 0\nfor i in range(n) :\n while(j < n) :\n if arr[j] - arr[i] >= k :\n count += n-j\n break\n j += 1\n \nprint(count)# cook your dish here\n", "nk=list(map(int,input().split()))\r\narr=list(map(int,input().split()))\r\narr.sort()\r\ncount=0\r\nfor i in range(0,len(arr)):\r\n for j in range (i+1,len(arr)):\r\n x=arr[j]-arr[i]\r\n if x>=nk[1]:\r\n count=count+1\r\nprint(count)\r\n3", "nk=list(map(int,input().split()))\r\narr=list(map(int,input().split()))\r\narr.sort()\r\ncount=0\r\nfor i in range(0,len(arr)):\r\n for j in range (i+1,len(arr)):\r\n x=arr[i]-arr[j]\r\n if x<0:\r\n x=x*(-1)\r\n if x>=nk[1]:\r\n count=count+1\r\nprint(count)\r\n3", "n, k = map(int, input().split())\narr = list(map(int, input().split()))\narr.sort()\ncount = 0\n\nj = 0\nfor i in range(n) :\n while(j < n) :\n if arr[j] - arr[i] >= k :\n count += n-j\n break\n j += 1\n \nprint(count)", "n, k = map(int, input().split())\narr = list(map(int, input().split()))\narr.sort()\ncount = n*(n-1)//2\n\nfor i in range(n-1, -1, -1) :\n for j in range(i-1, -1, -1) :\n if arr[i] - arr[j] >= k :\n break\n else :\n count -= 1\n \nprint(count)", "n, k = map(int, input().split())\narr = list(map(int, input().split()))\narr.sort()\narr.reverse()\ncount = n*(n-1)//2\n\nfor i in range(n) :\n for j in range(i+1, n) :\n if arr[i] - arr[j] >= k :\n break\n else :\n count -= 1\n \nprint(count)", "n, k = map(int, input().split())\narr = list(map(int, input().split()))\narr.sort()\ncount = 0\n\nfor i in range(n) :\n for j in range(i+1, n) :\n if arr[i] - arr[j] <= -1*k :\n count += 1\n \nprint(count)", "n, k = map(int, input().split())\narr = []\n\narr = list(map(int, input().split()))\ncount = 0\n\nfor i in arr :\n for j in arr :\n if i - j >= k :\n count += 1\n \nprint(count)", "n, k = map(int, input().split())\narr = list(map(int, input().split()))\ncount = 0\n\nfor i in arr :\n for j in arr :\n if i - j >= k :\n count += 1\n \nprint(count)"]

{"inputs": [["3 1", "3 1 3"]], "outputs": [["2"]]}

INTERVIEW

PYTHON3

CODECHEF

7,653

67cbc96175663aca8abc7d6e914c2567

UNKNOWN

Sebi goes to school daily with his father. They cross a big highway in the car to reach to the school. Sebi sits in front seat beside his father at driving seat. To kill boredom, they play a game of guessing speed of other cars on the highway. Sebi makes a guess of other car's speed being SG kph, his father FG kph. The highway is usually empty, so the drivers use cruise control, i.e. vehicles run at a constant speed. There are markers on the highway at a gap of 50 meters. Both father-son duo wants to check the accuracy of their guesses. For that, they start a timer at the instant at which their car and the other car (which speed they are guessing) are parallel to each other (they need not to be against some marker, they can be in between the markers too). After some T seconds, they observe that both the cars are next to some markers and the number of markers in between the markers of their car and the other car is D - 1 (excluding the markers next to both the cars). Also, they can observe these markers easily because the other car is faster than their. Speed of Sebi's father's car is S. Using this information, one can find the speed of the other car accurately. An example situation when Sebi's father starts the timer. Notice that both the car's are parallel to each other. Example situation after T seconds. The cars are next to the markers. Here the value of D is 1. The green car is Sebi's and the other car is of blue color. Sebi's a child, he does not know how to find the check whose guess is close to the real speed of the car. He does not trust his father as he thinks that he might cheat. Can you help to resolve this issue between them by telling whose guess is closer. If Sebi's guess is better, output "SEBI". If his father's guess is better, output "FATHER". If both the guess are equally close, then output "DRAW". -----Input----- The first line of the input contains an integer T denoting the number of test cases. Each of the next T lines contain five space separated integers S, SG, FG, D, T corresponding to the Sebi's car speed, Sebi's guess, his father's guess, D as defined in the statement and the time at which both the cars at against the markers (in seconds), respectively. -----Output----- Output description. For each test case, output a single line containing "SEBI", "FATHER" or "DRAW" (without quotes) denoting whose guess is better. -----Constraints----- - 1 ≤ T ≤ 10000 - 0 ≤ S ≤ 130 - 0 ≤ SG, FG ≤ 300 - 1 ≤ D ≤ 30 - 1 ≤ T ≤ 300 - The other car speed doesn't exceed 300 kph. -----Example----- Input: 2 100 180 200 20 60 130 131 132 1 72 Output: SEBI FATHER -----Explanation----- Example case 1. There are total 20 - 1 = 19 markers in between the Sebi's car and the other car. So, the distance between those cars at time T is 20 * 50 = 1000 meters = 1 km. As T = 60 seconds, i.e. 1 minutes. So, the other car goes 1 km more than Sebi's car in 1 minute. So, the other car will go 60 km more than Sebi's car in 1 hour. So, its speed is 60 kmph more than Sebi's car, i.e. 160 kmph. Sebi had made a guess of 180 kmph, while his father of 200 kmph. Other car's real speed is 160 kmph. So, Sebi's guess is better than his father. Hence he wins the game. Example case 2. The situation of this example is depicted in the image provided in the statement. You can find the speed of other car and see that Father's guess is more accurate.

["# cook your dish here\nn=int(input())\nfor i in range(n):\n S, SG, FG, D, T = map(int, input().split())\n speed = (D*180)/T + S\n if abs(SG-speed) == abs(FG-speed):\n print('DRAW')\n elif abs(SG-speed) > abs(FG-speed):\n print('FATHER')\n else:\n print('SEBI')", "# cook your dish here\nn=int(input())\nfor i in range(n):\n S, SG, FG, D, T = map(int, input().split())\n speed = (D*180)/T + S\n if abs(SG-speed) == abs(FG-speed):\n print('DRAW')\n elif abs(SG-speed) > abs(FG-speed):\n print('FATHER')\n else:\n print('SEBI')", "for i in range(int(input())):\n s,sg,fg,d,t = [int(i) for i in input().split()]\n dis = (d*50)\n speed = dis/t \n exs = (speed*18)/5\n ts = s + exs\n ss = abs(sg-ts)\n sf = abs(fg-ts)\n if ss>sf:\n print('FATHER')\n elif ss<sf:\n print('SEBI')\n elif ss==sf:\n print('DRAW')\n ", "for _ in range(int(input())):\r\n S, SG, FG, D, T = map(int, input().split())\r\n speed = (D*180)/T + S\r\n if abs(SG-speed) == abs(FG-speed):\r\n print('DRAW')\r\n elif abs(SG-speed) > abs(FG-speed):\r\n print('FATHER')\r\n else:\r\n print('SEBI')", "# cook your dish here\nfor _ in range(int(input())):\n S, SG, FG, D, T = map(int, input().split())\n speed = (D*180)/T + S\n if abs(SG-speed) == abs(FG-speed):\n print('DRAW')\n elif abs(SG-speed) > abs(FG-speed):\n print('FATHER')\n else:\n print('SEBI')", "for _ in range(int(input())):\n S, SG, FG, D, T = map(int, input().split())\n speed = (D*180)/T + S\n if abs(SG-speed) == abs(FG-speed):\n print('DRAW')\n elif abs(SG-speed) > abs(FG-speed):\n print('FATHER')\n else:\n print('SEBI')", "for i in range(int(input())):\n s,sg,fg,d,t=list(map(int,input().split()))\n speed=((d*180)/t+s)\n sa=abs(sg-speed)\n fa=abs(fg-speed)\n if fa<sa:\n print('FATHER')\n elif fa>sa:\n print('SEBI')\n else:\n print('DRAW')\n\n", "import math\nt=int(input())\nfor i in range(t):\n #n=int(input())\n s,sg,fg,d,t=map(int,input().split())\n #l=list(map(int,input().split()))\n #s=input()\n tot=(d*50*3.6)/t\n final=s+tot\n a=abs(final-sg)\n b=abs(final-fg)\n #print(tot,final,a,b)\n if(a<b):\n print(\"SEBI\")\n elif(b<a):\n print(\"FATHER\")\n else:\n print(\"DRAW\")\n\n# cook your dish here\n", "for i in range(int(input())):\r\n s,sg,fg,d,t=list(map(int,input().split()))\r\n speed=((d*180)/t+s)\r\n sa=abs(sg-speed)\r\n fa=abs(fg-speed)\r\n if fa<sa:\r\n print('FATHER')\r\n elif fa>sa:\r\n print('SEBI')\r\n else:\r\n print('DRAW')\r\n", "for i in range(int(input())):\n s,sg,fg,d,t = list(map(int,input().split()))\n tot = (50*d*3.6)/t\n final = s + tot\n a = abs(sg-final)\n b = abs(fg-final)\n if a<b:\n print(\"SEBI\")\n elif a>b:\n print(\"FATHER\")\n else:\n print(\"DRAW\")", "import math\r\nt=int(input())\r\n#t=1\r\nfor i in range(t):\r\n #n=int(input())\r\n s,sg,fg,d,t=map(int,input().split())\r\n #l=list(map(int,input().split()))\r\n #s=input()\r\n tot=(d*50*3.6)/t\r\n final=s+tot\r\n a=abs(final-sg)\r\n b=abs(final-fg)\r\n #print(tot,final,a,b)\r\n if(a<b):\r\n print(\"SEBI\")\r\n elif(b<a):\r\n print(\"FATHER\")\r\n else:\r\n print(\"DRAW\")\r\n\r\n\r\n ", "# cook your dish here\nt = int(input())\n\nfor _ in range(t):\n s,sg,fg,d,t = map(int , input().split(\" \"))\n \n # t = t/3600\n # d = (d*50)/1000\n \n car_speed = s + (d*50*3.6)/t\n #print(car_speed)\n sebi = abs(car_speed-sg)\n fat = abs(car_speed-fg)\n #print(sebi,fat)\n if sebi<fat:\n print(\"SEBI\")\n elif fat==sebi:\n print(\"DRAW\")\n else:\n print(\"FATHER\")", "for _ in range(int(input())):\n S,SG,FG,D,T=map(int, input().strip().split())\n G=S+((180*D)/T)\n if abs(G-SG)>abs(G-FG):\n print(\"FATHER\")\n elif abs(G-SG)<abs(G-FG):\n print(\"SEBI\") \n else:\n print(\"DRAW\")", "# cook your dish here\nfrom sys import stdin, stdout\nans = []\n\nfor _ in range(int(stdin.readline())):\n spd, sg, fg, d, time = map(int, stdin.readline().split())\n ckh = ((d*180)/time) + spd\n dsg = abs(ckh - sg)\n dfg = abs(ckh - fg)\n ans.append('DRAW' if dsg == dfg else 'SEBI' if dsg < dfg else 'FATHER')\nstdout.write('\\n'.join(ans))\n", "# cook your dish here\nfrom sys import stdin, stdout\nans = []\n\nfor _ in range(int(stdin.readline())):\n spd, sg, fg, d, time = map(int, stdin.readline().split())\n ckh = ((d*180)/time) + spd\n dsg = abs(ckh - sg)\n dfg = abs(ckh - fg)\n ans.append('DRAW' if dsg == dfg else 'SEBI' if dsg < dfg else 'FATHER')\nstdout.write('\\n'.join(ans))\n", "for _ in range(int(input())):\r\n s,sg,fg,d,t=map(int,input().split())\r\n dis=(d*50)/1000\r\n t1=t/60\r\n speed=d*50*60*60/(t*1000)\r\n speed+=s\r\n if(abs(speed-sg)>abs(speed-fg)):\r\n print('FATHER')\r\n elif(abs(speed-sg)<abs(speed-fg)):\r\n print('SEBI')\r\n else:\r\n print('DRAW')\r\n", "for i in range(int(input())):\n s,sg,fg,d,t=map(int,input().split())\n sc=s+(d*180/t)\n if abs(sg-sc)==abs(fg-sc):\n print('DRAW')\n elif abs(sg-sc)<abs(fg-sc):\n print('SEBI')\n elif abs(sg-sc)>abs(fg-sc):\n print('FATHER')", "# cook your dish here\nfor i in range(int(input())):\n s,sg,fg,d,t=map(int,input().split())\n sc=s+(d*180/t)\n if abs(sg-sc)==abs(fg-sc):\n print('DRAW')\n elif abs(sg-sc)<abs(fg-sc):\n print('SEBI')\n elif abs(sg-sc)>abs(fg-sc):\n print('FATHER')\n ", "# cook your dish here\nfor _ in range(int(input())):\n s,sg,fg,d,t=map(int,input().split())\n dif=float(d*180/t)\n diff=float(s)+dif\n if abs(float(diff-sg))>abs(float(diff-fg)):\n print(\"FATHER\")\n elif abs(float(diff-sg))<abs(float(diff-fg)):\n print(\"SEBI\")\n else:\n print(\"DRAW\")", "# cook your dish here\ntests = int(input())\nfor _ in range(tests):\n s, sg, fg, d, t = [int(j) for j in input().split()]\n speed = s + 180 * d / t\n abs_s = abs(sg-speed)\n abs_f = abs(fg-speed)\n if abs_s < abs_f:\n print(\"SEBI\")\n elif abs_f < abs_s:\n print(\"FATHER\")\n else:\n print(\"DRAW\")"]

{"inputs": [["2", "100 180 200 20 60", "130 131 132 1 72", "", ""]], "outputs": [["SEBI", "FATHER"]]}

INTERVIEW

PYTHON3

CODECHEF

6,493

a0e68d2a4270bebd628b25054d93ba11

UNKNOWN

Bob has got some injury in his leg and due to this he can take exactly M steps in one move. Bob enters a square field of size NxN. The field is only having one gate(for both entrance and exit) at its one of the corners. Bob started walking along the perimeter of square field.(remember Bob can only take exactly M steps in one move and cannot reverse his direction of motion). Bob wants to know how many minimum number of moves he needs to come out(i.e. he reaches the same gate from where he entered into the field) from the square field. Tell the answer to Bob ASAP. Luckily, you came to know M=N+1. -----Input----- - The first line of the input contains an integer T denoting the number of test cases. - Each test case contains a single integer N denoting the sides of the square. -----Output----- - For each test case, output a single line containing minimum number of moves Bob required to come out from the field. -----Constraints----- - 1 ≤ T ≤ 10000 - 1 ≤ N ≤ 1000000000 -----Example----- Input: 2 1 2 Output: 2 8 -----Explanation----- Example case 1.Let four corners of square be (0,0), (0,1), (1,1), (1,0). Let gate be at (0,0). Bob takes 2 steps in one move. Let movement of Bob be as follows (0,0) -> (1,1) -> (0,0). Thus minimum moves needed were 2. Example case 2.Let four corners of square be (0,0), (0,2), (2,2), (2,0). Let gate be at (0,0). Bob takes 3 steps in one move. Let movement of Bob be as follows (0,0) -> (2,1) -> (0,2) -> (1,0) -> (2,2) -> (0,1) -> (2,0) -> (1,2) -> (0,0). Thus minimum number of moves needed are 8.

["# By Prathmesh Maurya\nt=eval(input())\nwhile(t!=0):\n t-=1\n n=eval(input())\n if n%2 == 0:\n print(n*4)\n elif n%4==3:\n print(n)\n else:\n print(n*2)\n", "t = eval(input())\n\ndef gcd(a, b):\n while b:\n t = a % b\n a, b = b, t\n return a\n\nfor i in range(t):\n n = eval(input())\n m = n + 1\n k = n * 4\n g = gcd(m, k)\n lcm = m * k / g\n print(lcm / m)\n", "# your code goes here\ndef gcd(a,b):\n if b==0:\n return a\n else:\n return gcd(b,a%b)\n \nt=int(input().strip())\nwhile t:\n a=int(input().strip())\n b=a*4\n a+=1\n ans=b/gcd(b,a)\n print(ans)\n t-=1", "t = int(input())\n\nfor i in range(t):\n n = int(input())\n if n%2==0:\n print(n*4)\n else:\n temp = n/2 + 1\n if temp%2==0:\n print(n)\n else:\n print(n*2)\n", "t=eval(input())\nfor i in range(t):\n n=eval(input())\n m=n+1\n l=4*n\n if (4*n)%m==0:\n print(4*n/m)\n else:\n a=l\n b=m\n while b:\n a,b=b,a%b\n print(l/a)\n", "def function():\n print('hello world!!its ranjeet kumar yadav from iiitdmj')\n\n#please ignore the size of variable\ntgnfdngnd=eval(input())\nwhile tgnfdngnd>0:\n tgnfdngnd=tgnfdngnd-1\n #taking input\n adddddd=eval(input())\n s=0\n #calculating size of perimeter\n \n s=2*(adddddd+1)+2*(adddddd-1)\n i=0\n \n\n vddddddddddddd=0\n dddddddddddddddd=0\n if adddddd%2==0:\n print(s)\n else:\n n=(adddddd-1)/2+1\n if n%2==0:\n print(adddddd)\n else:\n print(adddddd*2)\n \n \n \n", "import math\n\n \n \nt=eval(input())\nwhile t>0:\n t=t-1\n a=eval(input())\n s=0\n s=2*(a+1)+2*(a-1)\n i=0\n b=a+1\n if a%2==0:\n print(s)\n else:\n n=(a-1)/2+1\n if n%2==0:\n print(a)\n else:\n print(a*2)\n \n \n", "from fractions import gcd\nfor _ in range(int(input())):\n n = int(input())\n s = n * 4\n m = n + 1\n if s % m == 0:\n print(s / m)\n else:\n print(s * m / gcd(s, m) / m)\n", "t=int(input())\nfor i in range(0,t):\n n=int(input())\n x=4*n\n ans=2\n m=n+1\n tem=0\n if(n%2==0):\n ans=(n/2)*8\n elif(n%4==3):\n ans=n\n else:\n val=(n+3)/4\n ans=2+(val-1)*8\n print(ans)", "t=int(input())\nfor i in range(0,t):\n n=int(input())\n x=4*n\n ans=2\n m=n+1\n tem=0\n if(n%2==0):\n ans=(n/2)*8\n elif(n%4==3):\n ans=n\n else:\n val=(n+3)/4\n ans=2+(val-1)*8\n print(ans)"]

{"inputs": [["2", "1", "2"]], "outputs": [["2", "8"]]}

INTERVIEW

PYTHON3

CODECHEF

2,208

79fc705bad4eb37d5b0bbeae2253e897

UNKNOWN

Chef has a sequence of positive integers $A_1, A_2, \ldots, A_N$. He wants to choose some elements of this sequence (possibly none or all of them) and compute their MEX, i.e. the smallest positive integer which does not occur among the chosen elements. For example, the MEX of $[1, 2, 4]$ is $3$. Help Chef find the largest number of elements of the sequence $A$ which he can choose such that their MEX is equal to $M$, or determine that it is impossible. -----Input----- - The first line of the input contains a single integer $T$ denoting the number of test cases. The description of $T$ test cases follows. - The first line of each test case contains two space-separated integers $N$ and $M$. - The second line contains $N$ space-separated integers $A_1, A_2, \ldots, A_N$. -----Output----- For each test case, print a single line containing one integer ― the maximum number of elements Chef can choose, or $-1$ if he cannot choose elements in such a way that their MEX is $M$. -----Constraints----- - $1 \le T \le 100$ - $2 \le M \le N \le 10^5$ - $1 \le A_i \le 10^9$ for each valid $i$ - the sum of $N$ over all test cases does not exceed $10^6$ -----Example Input----- 1 3 3 1 2 4 -----Example Output----- 3 -----Explanation----- Example case 1: The MEX of whole array is 3. Hence, we can choose all the elements.

[" \r\nfor __ in range(int(input())):\r\n n,m=map(int,input().split())\r\n arr=list(map(int,input().split()))\r\n s=set(arr)\r\n mex=-1\r\n ele=1\r\n for i in range(1,n+1):\r\n if i not in s:\r\n mex = i\r\n break\r\n if m>mex:\r\n print(-1)\r\n elif m==mex:\r\n print(n)\r\n else:\r\n c=arr.count(m)\r\n print(n-c)\r\n \r\n \r\n \r\n", "for _ in range(int(input())):\r\n n,m = map(int,input().split())\r\n arr = list(map(int,input().split()))\r\n\r\n st = set(arr)\r\n\r\n mex = -1\r\n\r\n for i in range(1,n+1):\r\n if i not in st:\r\n mex = i\r\n break\r\n \r\n if mex==m:\r\n print(n)\r\n elif mex<m:\r\n print(-1)\r\n else:\r\n res = 0\r\n \r\n for i in arr:\r\n if i!=m:\r\n res+=1\r\n \r\n print(res)\r\n\r\n\r\n\r\n\r\n\r\n ", "for _ in range(int(input())):\n n,m=map(int,input().split())\n ar=[int(x) for x in input().split()]\n ar.sort()\n f=0\n j=1\n # v=[]\n if m==1:\n c=ar.count(1)\n if n-c==0:\n print(-1)\n else:\n print(n-c)\n else:\n if ar[0]==1:\n prev=1\n j=2\n for i in range(1,n):\n if ar[i]<m:\n if ar[i]!=prev and ar[i]==j:\n j+=1\n prev=ar[i]\n elif ar[i]!=prev and ar[i]!=j:\n f=1\n break\n elif ar[i]==prev:\n continue\n else:\n break\n else:\n if m!=1:\n f=1\n if f==1 or j!=m:\n print(-1)\n else:\n c=ar.count(m)\n if n-c==0:\n print(-1)\n else:\n print(n-c)\n \n \n \n \n \n \n \n \n ", "t = int(input())\nfor i in range(t):\n c = 1\n n, m = map(int, input().split())\n A = list(map(int, input().split()))\n a = set(A)\n j = 1\n while j < m and j in a:\n j += 1\n if j != m:\n print(-1)\n else:\n print(n-A.count(m))", "t = int(input())\nfor i in range(t):\n c = 1\n n, m = map(int, input().split())\n A = list(map(int, input().split()))\n a = set(A)\n j = 1\n while j < m and j in a:\n j += 1\n if j != m:\n print(-1)\n else:\n print(n-A.count(m))", "# cook your dish here\nimport bisect\nt = int(input())\nfor _ in range(t):\n n,m = map(int, input().split())\n arr = list(map(int, input().split()))\n seti = set(arr)\n f = 1\n for i in range(1,m):\n if i not in seti:\n f = 0\n break\n if f==0:\n print(-1)\n else:\n if m in seti:\n print(n-arr.count(m))\n else:\n print(n)\n ", "tc = int(input())\r\nfor _ in range(tc):\r\n\tN,M = map(int,input().split())\r\n\tarr = list(map(int, input().split()))\r\n\tcurr_mex = 1\r\n\tarr.sort()\r\n\tfor i in range(N):\r\n\t\tif(arr[i]==curr_mex):\r\n\t\t\tcurr_mex+=1\r\n\tif(curr_mex == M):\r\n\t\tprint(N)\r\n\telif(curr_mex < M):\r\n\t\tprint(-1)\r\n\telse:\r\n\t\tcnt = 0\r\n\t\tfor x in arr:\r\n\t\t\tif(x == M):\r\n\t\t\t\tcnt+=1\r\n\t\tprint(N-cnt)\r\n\r\n", "# cook your dish here\nfor _ in range(int(input())):\n n,m=list(map(int, input().split()))\n l=list(map(int, input().split()))\n c, cnt = m-1, 0\n l1=[0]*m\n \n for k in l:\n if k<m:\n if l1[k]==0:\n l1[k]=1 \n c-=1 \n cnt+=1 \n \n elif k>m:\n cnt+=1\n \n if c==0:\n print(cnt)\n \n else:\n print(-1)", "# cook your dish here\r\nfor T in range(int(input())):\r\n n,m=map(int,input().split())\r\n a=list(map(int,input().split()))\r\n \r\n count=[0]*n\r\n\r\n for key in a:\r\n try:\r\n count[key-1]+=1\r\n except:\r\n pass\r\n\r\n a=list(set(a))\r\n a.sort()\r\n\r\n flag=True\r\n for i in range(len(a)):\r\n if(a[i]!=(i+1)):\r\n flag=False\r\n mex=i+1\r\n break\r\n if(flag):\r\n mex=len(a)+1\r\n\r\n if(mex < m):\r\n print(-1)\r\n else:\r\n print(n-count[m-1])\r\n \r\n", "# cook your dish here\r\nfor T in range(int(input())):\r\n n,m=map(int,input().split())\r\n a=list(map(int,input().split()))\r\n \r\n count=[0]*n\r\n\r\n for key in a:\r\n try:\r\n count[key-1]+=1\r\n except:\r\n pass\r\n\r\n a=list(set(a))\r\n a.sort()\r\n\r\n flag=True\r\n for i in range(len(a)):\r\n if(a[i]!=(i+1)):\r\n flag=False\r\n mex=i+1\r\n break\r\n if(flag):\r\n mex=len(a)+1\r\n\r\n if(mex < m):\r\n print(-1)\r\n else:\r\n print(n-count[m-1])\r\n \r\n", "# cook your dish here\r\nfor T in range(int(input())):\r\n n,m=map(int,input().split())\r\n a=list(map(int,input().split()))\r\n \r\n count=[0]*n\r\n\r\n for key in a:\r\n try:\r\n count[key-1]+=1\r\n except:\r\n pass\r\n\r\n a=list(set(a))\r\n a.sort()\r\n\r\n flag=True\r\n for i in range(len(a)):\r\n if(a[i]!=(i+1)):\r\n flag=False\r\n mex=i+1\r\n break\r\n if(flag):\r\n mex=len(a)+1\r\n\r\n if(mex < m):\r\n print(-1)\r\n else:\r\n print(n-count[m-1])\r\n \r\n", "# cook your dish here\r\nfor T in range(int(input())):\r\n n,m=map(int,input().split())\r\n a=list(map(int,input().split()))\r\n \r\n count=[0]*n\r\n\r\n for key in a:\r\n try:\r\n count[key-1]+=1\r\n except:\r\n pass\r\n\r\n a=list(set(a))\r\n a.sort()\r\n\r\n flag=True\r\n for i in range(len(a)):\r\n if(a[i]!=(i+1)):\r\n flag=False\r\n mex=i+1\r\n break\r\n if(flag):\r\n mex=len(a)+1\r\n\r\n if(mex < m):\r\n print(-1)\r\n else:\r\n print(n-count[m-1])\r\n \r\n", "# cook your dish here\r\nfor T in range(int(input())):\r\n n,m=map(int,input().split())\r\n a=list(map(int,input().split()))\r\n \r\n count=[0]*n\r\n\r\n for key in a:\r\n try:\r\n count[key-1]+=1\r\n except:\r\n pass\r\n\r\n a=list(set(a))\r\n a.sort()\r\n\r\n flag=True\r\n for i in range(len(a)):\r\n if(a[i]!=(i+1)):\r\n flag=False\r\n mex=i+1\r\n break\r\n if(flag):\r\n mex=len(a)+1\r\n\r\n if(mex < m):\r\n print(-1)\r\n else:\r\n print(n-count[m-1])\r\n \r\n", "def main():\r\n n , m = [int(x) for x in input().split()]\r\n l =[int(X) for X in input().split()]\r\n ls = set(l)\r\n f = 1\r\n for i in range(1,m):\r\n if i not in ls:\r\n f = 0\r\n break\r\n if f==0:\r\n print(-1)\r\n else:\r\n if m in ls:\r\n print(n-l.count(m))\r\n else:print(n)\r\ndef __starting_point():\r\n for _ in range(int(input())):\r\n main()\r\n\n__starting_point()", "for _ in range(int(input())):\r\n n , m = [int(x) for x in input().split()]\r\n ls =[int(X) for X in input().split()]\r\n x = ls.count(m)\r\n ls2 = list(set(ls))\r\n if len(ls2) <=m-2:\r\n print(-1)\r\n elif ls2[m-2]!=m-1:\r\n print(-1)\r\n else:\r\n print(n-x)\r\n", "t=int(input())\r\nfor _ in range(t):\r\n n,m=list(map(int,input().strip().split()))\r\n list1=list(map(int,input().strip().split()))\r\n count=list1.count(m)\r\n\r\n set1=set(list1)\r\n list2=list(set1)\r\n \r\n if len(list2)<=m-2:\r\n print(-1)\r\n elif list2[m-2]!=m-1:\r\n print(-1)\r\n else:\r\n print(n-count)\r\n \r\n \r\n", "t=int(input())\nwhile t:\n n,m=map(int,input().split())\n a=list(map(int,input().split()))\n a.sort()\n j=1\n cm=0\n for i in range(n):\n if a[i]>j:\n cm=a[i]\n break\n else:\n j+=1\n if i==n-1 and cm==0:\n cm=a[n-1]+1\n if cm==m:\n print(n)\n elif cm<m:\n print(-1)\n else:\n c=0\n for i in range(n):\n if a[i]!=m:\n c+=1\n print(c)\n \n t-=1\n", "from sys import stdin, stdout\nfrom collections import defaultdict as D\n\ntry:\n for _ in range(int(input())):\n n,m=[int(i) for i in stdin.readline().split()]\n a=[int(i) for i in stdin.readline().split()]\n d = D(lambda:0)\n for i in a:\n d[i] += 1 \n \n k = 1\n for i in range(1, max(a) + 2):\n if d[i] == 0:\n k = i\n break\n \n if k==m:\n print(n)\n elif k<m:\n print(-1)\n elif k>m:\n print(n - d[m])\nexcept:\n pass", "t=int(input())\nwhile t:\n n,m=(int(o) for o in input().split())\n a=[int(o) for o in input().split()]\n a.sort()\n j=1\n cm=0\n for i in range(n):\n if a[i]>j:\n cm=a[i]\n break\n else:\n j+=1\n if i==n-1 and cm==0:\n cm=a[n-1]+1\n if cm==m:\n print(n)\n elif cm<m:\n print(-1)\n else:\n c=0\n for i in range(n):\n if a[i]!=m:\n c+=1\n print(c)\n \n t-=1\n", "t=int(input())\r\nimport sys\r\nwhile(t!=0):\r\n n,m=list(map(int,input().strip().split()))\r\n a=list(map(int,input().strip().split()))\r\n l=[0]*100000\r\n mx=-1\r\n c=0\r\n for i in a:\r\n if(i>mx):\r\n mx=i\r\n l[i]+=1\r\n for i in range(1,mx+1):\r\n if(l[i]==0):\r\n if(i==m):\r\n print(n)\r\n c=1\r\n break\r\n elif(i<m):\r\n print(-1)\r\n c=1\r\n break\r\n else:\r\n print(n-l[m])\r\n c=1\r\n break\r\n if(c==0):\r\n if(m==mx+1):\r\n print(n)\r\n else:\r\n print(\"-1\")\r\n t-=1", "from sys import stdin\r\ndef sin():\r\n return stdin.readline()\r\n\r\n\r\nfor _ in range(int(sin())):\r\n n,m = map(int, sin().split())\r\n l = list(map(int, sin().split(\" \")))\r\n g=[0]*max(l)*2\r\n for i in l:\r\n g[i-1]=1\r\n p=g.index(0)+1\r\n if p==m:\r\n print(n)\r\n elif p<m:\r\n print(-1)\r\n else:\r\n print(n-l.count(m))\r\n", "'''\r\n\r\n Online Python Compiler.\r\n Code, Compile, Run and Debug python program online.\r\nWrite your code in this editor and press \"Run\" button to execute it.\r\n\r\n'''\r\nimport bisect\r\nt=int(input())\r\nfor i in range(t):\r\n n,m=map(int,input().split())\r\n l=list(map(int,input().split()))\r\n l.sort()\r\n a=bisect.bisect(l,m)\r\n s=list(set(l[0:a]))\r\n if(len(s)==0):\r\n if(m==1):\r\n if(m in l):\r\n print(len(l)-l.count(m))\r\n else: \r\n print(n)\r\n else:\r\n print(-1)\r\n else: \r\n s.sort() \r\n a=s[len(s)-1]\r\n if(s==list(range(1,a+1))):\r\n if(m in l):\r\n print(len(l)-l.count(m))\r\n else: \r\n print(n)\r\n \r\n else:\r\n print(-1)", "t = int(input())\n\nfor _ in range(t):\n n,m = map(int,input().split())\n l = list(map(int,input().split()))\n \n ans = 0\n temp = [0]*(m-1)\n for i in l:\n if i>m:\n ans+=1 \n elif i<m:\n temp[i-1]+=1 \n \n flag=1\n for i in range(m-2,-1,-1):\n if temp[i]==0:\n flag=0\n break \n else:\n ans+=temp[i]\n if flag==0:\n print(\"-1\")\n else:\n print(ans)", "t = int(input())\r\nwhile t>0:\r\n t -= 1\r\n n, m = map(int, input().split())\r\n a = [int(x) for x in input().split()]\r\n count = 0\r\n temp = [0]*(m+1)\r\n for i in range(n):\r\n if a[i] == m:\r\n temp[a[i]] += 1\r\n elif a[i] > m:\r\n pass\r\n else:\r\n temp[a[i]] = 1\r\n for i in range(1, m):\r\n if temp[i] == 0:\r\n print(-1)\r\n break\r\n if i == m-1:\r\n print(n-temp[-1])\r\n \r\n \r\n "]

{"inputs": [["1", "3 3", "1 2 4", ""]], "outputs": [["3"]]}

INTERVIEW

PYTHON3

CODECHEF

12,855

7d28e5a350f25edfafdfb80aaf9506ca

UNKNOWN

"Humankind cannot gain anything without first giving something in return. To obtain, something of equal value must be lost. That is alchemy's first law of Equivalent Exchange. In those days, we really believed that to be the world's one, and only truth." -- Alphonse Elric Now, here we have an equivalent exchange law for triangles which states that two right-angled isosceles triangles of the same color can be made into a square of the same color using Alchemy. You are given N$N$ right-angled isosceles colored triangles numbered from 1$1$ to N$N$. For each triangle, the two equal sides have a length of 1$1$ unit. The Color of i$i$-th triangle is given by Ci$C_i$. To create a tower, we choose some consecutive (2×k)+1$2 \times k)+1$ triangles for any k≥0$k \geq 0$. We then pick some 2×k$2 \times k$ of them (these need not be consecutive), and form k$k$ pairs of triangles such that both triangles in pair have the same color. Also, each of the 2×k$2 \times k$ should be in exactly one pair. Then the two triangles in each pair are joined using Alchemy (following the law of equivalent exchange for triangles) to form squares and these k$k$ squares are placed one upon other. The one remaining triangle is placed as a roof to the tower. This results in a tower of the height of k$k$. Find the maximum height of the tower that can be formed. In other words, you should select the largest consecutive segment of triangles, such that you can form a tower using every single one of those triangles. In particular, you leave out one triangle, which will form the roof, and the other triangles should all be paired up such that both triangles in a pair have the same colour. -----Input:----- - The first line contains T$T$, the number of test cases. Then the test cases follow. - For every test case, the first line contains N$N$ denoting the number of triangles. - For every test case, the second line contains N$N$ space-separated integers Ci$C_{i}$ denoting the color of the triangles. ( 1≤i≤N$1 \leq i \leq N$). -----Output:----- For every test case, output a single integer denoting the maximum height of the tower that can be formed. -----Constraints----- - 1≤T≤100$1 \leq T \leq 100$ - 1≤N≤105$1 \leq N \leq 10^{5}$ - 1≤Ci≤30$1 \leq C_{i} \leq 30$ - Sum of N$N$ over all test cases doesn't exceed 5×105$5\times 10^{5}$ -----Sample Input:----- 4 14 5 4 2 2 3 2 1 3 2 7 4 9 9 9 3 1 2 1 3 1 1 1 5 1 2 3 4 1 -----Sample Output:----- 3 1 1 0 -----EXPLANATION:----- - #1$1$: The subarray [2,2,3,2,1,3,2]$[2, 2, 3, 2, 1, 3, 2]$ results in a tower of height 3$3$. - #2$2$: The subarray [1,2,1]$[ 1, 2, 1 ]$ results in a tower of height 1$1$. - #3$3$: The subarray [1,1,1]$[ 1, 1, 1 ]$ results in a tower of height 1$1$. - #4$4$: The subarrays [1]$[ 1 ]$, [2]$[ 2 ]$ , [3]$[ 3 ]$, [4]$[ 4 ]$ and [1]$[ 1 ]$ all results in a tower of height 0$0$. The above tower is possible by subarray [2,2,3,2,1,3,2]$[2, 2, 3, 2, 1, 3, 2]$ resulting in a height of 3$3$ in test case 1$1$.

["for i in range(int(input())):\n n = int(input())\n c = list(map(int, input().split()))\n d = {}\n d[0] = -1\n parity = 0\n ans = 0\n for i in range(n):\n parity ^= 1 << (c[i]-1)\n for t in range(30):\n x = parity^(1<<t)\n if(x in d.keys()):\n ans = max(ans, i - d[x])\n if parity not in d.keys():\n d[parity] = i\n print(ans//2)", "# cook your dish here\nfor t in range(int(input())):\n n = int(input())\n l = [int(j)-1 for j in input().split()]\n d = dict()\n # st = tuple([0 for i in range(30)])\n st = 0\n d[st] = -1\n ans = 1\n for i in range(n):\n # st = list(st)\n st = st ^ (1 << l[i])\n # st[l[i]] = 1-st[l[i]]\n for j in range(30):\n # st1 = list(st)\n st1 = st\n st1 = st1 ^ (1<<j)\n # st1[j] = 1 - st1[j]\n if st1 in d and d[st1]!=i-1:\n ans = max(ans, i-d[st1])\n # print(i, d[tuple(st1)])\n if st not in d:\n d[st] = i\n\n print(ans//2)", "for t in range(int(input())):\n n = int(input())\n l = [int(j)-1 for j in input().split()]\n d = dict()\n # st = tuple([0 for i in range(30)])\n st = 0\n d[st] = -1\n ans = 1\n for i in range(n):\n # st = list(st)\n st = st ^ (1 << l[i])\n # st[l[i]] = 1-st[l[i]]\n for j in range(30):\n # st1 = list(st)\n st1 = st\n st1 = st1 ^ (1<<j)\n # st1[j] = 1 - st1[j]\n if st1 in d and d[st1]!=i-1:\n ans = max(ans, i-d[st1])\n # print(i, d[tuple(st1)])\n if st not in d:\n d[st] = i\n\n print(ans//2)", "for t in range(int(input())):\n n = int(input())\n c = list(map(int,input().split()))\n dictionary = {0:0}\n parity = 0\n k = 0\n for i in range(n):\n parity ^= (1<<c[i]-1)\n if parity not in dictionary:\n dictionary[parity] = i+1;\n for j in range(30):\n x = parity ^ (1<<j);\n if x in dictionary:\n k=max(k,i-dictionary[x])\n\n print(k//2)\n\n", "# cook your dish here\nfor t in range(int(input())):\n n = int(input())\n l = [int(j)-1 for j in input().split()]\n d = dict()\n # st = tuple([0 for i in range(30)])\n st = 0\n d[st] = -1\n ans = 1\n for i in range(n):\n # st = list(st)\n st = st ^ (1 << l[i])\n # st[l[i]] = 1-st[l[i]]\n for j in range(30):\n # st1 = list(st)\n st1 = st\n st1 = st1 ^ (1<<j)\n # st1[j] = 1 - st1[j]\n if st1 in d and d[st1]!=i-1:\n ans = max(ans, i-d[st1])\n # print(i, d[tuple(st1)])\n if st not in d:\n d[st] = i\n\n print(ans//2)", "\nfrom sys import stdin, stdout\n\nfor tc_ in range(int(stdin.readline())):\n n=int(stdin.readline())\n a=list(map(int,stdin.readline().split()))\n dic={0:-1}\n ans=last=0\n for i in range(n):\n last^=(1<<(a[i]-1))\n for j in range(30):\n x=last^(1<<j)\n if x in dic:\n ans=max(ans,i-dic[x])\n if last not in dic:\n dic[last]=i\n stdout.write(f\"{ans>>1}\\n\")\n", "# cook your dish here\nfor t in range(int(input())):\n n = int(input())\n l = [int(j)-1 for j in input().split()]\n d = dict()\n # st = tuple([0 for i in range(30)])\n st = 0\n d[st] = -1\n ans = 1\n for i in range(n):\n # st = list(st)\n st = st ^ (1 << l[i])\n # st[l[i]] = 1-st[l[i]]\n for j in range(30):\n # st1 = list(st)\n st1 = st\n st1 = st1 ^ (1<<j)\n # st1[j] = 1 - st1[j]\n if st1 in d and d[st1]!=i-1:\n ans = max(ans, i-d[st1])\n # print(i, d[tuple(st1)])\n if st not in d:\n d[st] = i\n\n print(ans//2)", "for t in range(int(input())):\n n = int(input())\n l = [int(j)-1 for j in input().split()]\n d = dict()\n # st = tuple([0 for i in range(30)])\n st = 0\n d[st] = -1\n ans = 1\n for i in range(n):\n # st = list(st)\n st = st ^ (1 << l[i])\n # st[l[i]] = 1-st[l[i]]\n for j in range(30):\n # st1 = list(st)\n st1 = st\n st1 = st1 ^ (1<<j)\n # st1[j] = 1 - st1[j]\n if st1 in d and d[st1]!=i-1:\n ans = max(ans, i-d[st1])\n # print(i, d[tuple(st1)])\n if st not in d:\n d[st] = i\n\n print(ans//2)", "for t in range(int(input())):\n n = int(input())\n l = [int(j)-1 for j in input().split()]\n d = dict()\n # st = tuple([0 for i in range(30)])\n st = 0\n d[st] = -1\n ans = 1\n for i in range(n):\n # st = list(st)\n st = st ^ (1 << l[i])\n # st[l[i]] = 1-st[l[i]]\n for j in range(30):\n # st1 = list(st)\n st1 = st\n st1 = st1 ^ (1<<j)\n # st1[j] = 1 - st1[j]\n if st1 in d and d[st1]!=i-1:\n ans = max(ans, i-d[st1])\n # print(i, d[tuple(st1)])\n if st not in d:\n d[st] = i\n\n print(ans//2)\n\n"]

{"inputs": [["4", "14", "5 4 2 2 3 2 1 3 2 7 4 9 9 9", "3", "1 2 1", "3", "1 1 1", "5", "1 2 3 4 1"]], "outputs": [["3", "1", "1", "0"]]}

INTERVIEW

PYTHON3

CODECHEF

4,804

6b94b3c2b2458a87514acddd02824c41

UNKNOWN

Chef has just finished the construction of his new garden. He has sown the garden with patches of the most beautiful carpet grass he could find. He has filled it with patches of different color and now he wants to evaluate how elegant his garden is. Chef's garden looks like a rectangular grid of cells with N rows and M columns. So there are N x M cells in total. In each cell Chef planted grass of some color. The elegance of the garden is defined by the number of squares, composed of at least four garden cells, with edges parallel to the sides of the garden, that have four corner cells of the same color. Given the description of Chef's garden, calculate how many such squares exist. Input format The first line contains the number T, the number of test cases. In the following lines, T test cases follow (without any newlines between them.) The first line of each test case contains N and M, separated by a single space. Each of the next N lines contains M characters without any spaces between them, and without any leading or trailing spaces. Each character describes the color of the corresponding cell in the garden and belongs to the set of lowercase and uppercase lettes of the English alphabet. One letter in lowercase and uppercase describes different colors. Output format For each test case, print the number of squares that conform to the definition in the problem statement. Constraints 1 ≤ T ≤ 50 1 ≤ N, M ≤ 50 Sample input 3 2 2 aa aA 3 3 aba bab aba 4 4 aabb aabb bbaa bbaa Sample output 0 1 4 Explanation In the first case the only avaliable square does not conform to the definition in the problem statement because 'a' and 'A' describes different colors. In the second case, you can select the 4 a's at the corners of the garden. In the third case, you can only make four squares, from the four 2x2 segments that are of the same color.

["# cook your dish here\nimport sys\nimport math\n\ndef main(grid):\n ans=0\n for i in range(len(grid)):\n for j in range(len(grid[0])):\n first_point=grid[i][j]\n for k in range(j+1,len(grid[0])):\n second_point=grid[i][k]\n if first_point==second_point:\n dist=k-j\n if i+dist<len(grid):\n thrid_point=grid[i+dist][j]\n fourth_point=grid[i+dist][k] \n if second_point==thrid_point and second_point==fourth_point:\n ans+=1\n return ans\n \ntest=int(input())\nfor _ in range(test):\n n,m=input().split()\n n=int(n)\n arr=[]\n for b in range(n):\n arr.append(list(input()))\n print(main(arr))", "import sys\nimport math\n\ndef main(grid):\n \n ans=0\n for i in range(len(grid)):\n \n for j in range(len(grid[0])):\n first_point=grid[i][j]\n for k in range(j+1,len(grid[0])):\n second_point=grid[i][k]\n \n if first_point==second_point:\n dist=k-j\n \n if i+dist<len(grid):\n \n thrid_point=grid[i+dist][j]\n fourth_point=grid[i+dist][k] \n if second_point==thrid_point and second_point==fourth_point:\n ans+=1\n return ans\nfor _ in range(int(input())):\n n,m=input().split()\n n=int(n)\n arr=[]\n for b in range(n):\n arr.append(list(input()))\n print(main(arr))\n \n \n\n ", "for _ in range(int(input())):\r\n N, M = map(int, input().split())\r\n array = []\r\n for i in range(N):\r\n array.append(list(input().strip()))\r\n count = 0\r\n for i in range(N-1):\r\n for j in range(M-1):\r\n for k in range(j+1, min(j + N - i, M)):\r\n if array[i][j] == array[i][k] and array[i][j] == array[i+k-j][j] and array[i][j] == array[i+k-j][k]:\r\n count += 1\r\n print(count)", "for _ in range(int(input())):\n N,M = [int(x) for x in input().split()]\n List = []\n for i in range(N):\n Temp = [x for x in input()]\n List.append(Temp)\n Ans = 0\n for i in range(N):\n for j in range(M):\n x=1\n while(i+x<N and j+x<M):\n if(List[i][j]==List[i][j+x]==List[i+x][j]==List[i+x][j+x]):\n Ans+=1\n x+=1\n print(Ans)\n ", "def check(z,i,j,r):\n x = j-i\n if r[z][i]==r[z][j]==r[z+x][i]==r[z+x][j]:\n return True\n return False \nt = int(input())\nwhile(t):\n t-=1\n count = 0\n a = list((map(int , input().split())))\n r = []\n for h in range(a[0]):\n p = list(input())\n r.append(p)\n #print(r) \n for z in range(a[0]):\n for i in range(a[1]):\n for j in range(i+1,a[1]):\n x = j-i\n if x<=(a[0]-z-1):\n if check(z,i,j,r)==True:\n count+=1\n else:\n break\n print(count) \n \n ", "def check_square(arr,nn,mm):\r\n total = 0\r\n for dim in range (2,mm+1):\r\n for row in range(nn-dim+1):\r\n for col in range(mm-dim+1):\r\n if arr[row][col]== arr[row][col+dim-1]==arr[row+dim-1][col]==arr[row+dim-1][col+dim-1]:\r\n total+=1\r\n \r\n return total\r\n\r\nfor _ in range(int(input())):\r\n n,m = map(int,input().split())\r\n garden = []\r\n for i in range(n):\r\n garden.append(input())\r\n if n==1 or m == 1:\r\n print(0)\r\n else:\r\n print(check_square(garden,n,m))"]

{"inputs": [["3", "2 2", "aa", "aA", "3 3", "aba", "bab", "aba", "4 4", "aabb", "aabb", "bbaa", "bbaa", "", ""]], "outputs": [["0", "1", "4"]]}

INTERVIEW

PYTHON3

CODECHEF

3,920

b344bd988548869907ab14c12fce8409

UNKNOWN

Ram and Shyam are playing a game of Truth and Dare. In this game, Shyam will ask Ram to perform tasks of two types: - Truth task: Ram has to truthfully answer a question. - Dare task: Ram has to perform a given task. Each task is described by an integer. (If a truth task and a dare task are described by the same integer, they are still different tasks.) You are given four lists of tasks: - $T_{r, 1}, T_{r, 2}, \dots, T_{r, t_r}$: the truth tasks Ram can perform. - $D_{r, 1}, D_{r, 2}, \dots, D_{r, d_r}$: the dare tasks Ram can perform. - $T_{s, 1}, T_{s, 2}, \dots, T_{s, t_s}$: the truth tasks Shyam can ask Ram to perform. - $D_{s, 1}, D_{s, 2}, \dots, D_{s, d_s}$: the dare tasks Shyam can ask Ram to perform. Note that the elements of these lists are not necessarily distinct, each task may be repeated any number of times in each list. Shyam wins the game if he can find a task Ram cannot perform. Ram wins if he performs all tasks Shyam asks him to. Find the winner of the game. Let's take an example where Ram can perform truth tasks $3$, $2$ and $5$ and dare tasks $2$ and $100$, and Shyam can give him truth tasks $2$ and $3$ and a dare task $100$. We can see that whichever truth or dare tasks Shyam asks Ram to perform, Ram can easily perform them, so he wins. However, if Shyam can give him dare tasks $3$ and $100$, then Ram will not be able to perform dare task $3$, so Shyam wins. -----Input----- - The first line of the input contains a single integer $T$ denoting the number of test cases. The description of $T$ test cases follows. - The first line of each test case contains a single integer $t_r$. - The second line contains $t_r$ space-separated integers $T_{r, 1}, T_{r, 2}, \dots, T_{r, t_r}$. - The third line contains a single integer $d_r$. - The fourth line contains $d_r$ space-separated integers $D_{r, 1}, D_{r, 2}, \dots, D_{r, d_r}$. - The fifth line contains a single integer $t_s$. - The sixth line contains $t_s$ space-separated integers $T_{s, 1}, T_{s, 2}, \dots, T_{s, t_s}$. - The seventh line contains a single integer $d_s$. - The eighth line contains $d_s$ space-separated integers $D_{s, 1}, D_{s, 2}, \dots, D_{s, d_s}$. -----Output----- For each test case, print a single line containing the string "yes" if Ram wins the game or "no" otherwise. -----Constraints----- - $1 \le T \le 100$ - $1 \le t_r, d_r, t_s, d_s \le 100$ - $1 \le T_{r, i} \le 100$ for each valid $i$ - $1 \le D_{r, i} \le 100$ for each valid $i$ - $1 \le T_{s, i} \le 100$ for each valid $i$ - $1 \le D_{s, i} \le 100$ for each valid $i$ -----Example Input----- 4 2 1 2 3 1 3 2 1 2 2 3 2 2 1 2 3 1 3 2 1 2 3 3 2 4 3 3 2 5 2 2 100 1 2 1 100 2 1 2 3 1 3 2 1 2 3 3 2 2 -----Example Output----- yes no yes yes -----Explanation----- Example case 1: Ram's truth tasks are $[1, 2]$ and his dare tasks are $[1, 3, 2]$. Shyam's truth tasks are $[2]$ and his dare tasks are $[3, 2]$. Ram can perform all tasks Shyam gives him. Example case 2: Ram's truth tasks are $[1, 2]$ and his dare tasks are $[1, 3, 2]$. Shyam's truth tasks are $[2]$ and his dare tasks are $[3, 2, 4]$. If Shyam asks Ram to perform dare task $4$, Ram will not be able to do it.

["# cook your dish here\nfor _ in range(int(input())):\n tr=int(input())\n trl=list(map(int,input().split()))\n dr = int(input())\n drl = list(map(int, input().split()))\n ts = int(input())\n tsl = list(map(int, input().split()))\n ds = int(input())\n dsl = list(map(int, input().split()))\n for item in tsl:\n if item in trl:\n res=1\n continue\n else:\n res=0\n break\n for item1 in dsl:\n if item1 in drl:\n res1=1\n continue\n else:\n res1=0\n break\n if res==1 and res1==1:\n print(\"yes\")\n else:\n print(\"no\")\n", "# cook your dish here\nfor i in range(int(input())):\n Tr = int(input())\n Tr = list(map(int,input().split()))\n Dr = int(input())\n Dr = list(map(int,input().split()))\n Ts = int(input())\n Ts = list(map(int,input().split()))\n Ds = int(input())\n Ds = list(map(int,input().split()))\n for i in Ts:\n if i not in Tr:\n print(\"no\")\n break\n else:\n for j in Ds:\n if j not in Dr:\n print(\"no\")\n break\n else:\n print(\"yes\")\n\n\n", "for i in range(int(input())):\r\n _ = int(input())\r\n Tr = list(map(int, input().split()))\r\n _ = int(input())\r\n Dr = list(map(int, input().split()))\r\n _ = int(input())\r\n Ts = list(map(int, input().split()))\r\n _ = int(input())\r\n Ds = list(map(int, input().split()))\r\n \r\n for j in Ts:\r\n if j not in Tr:\r\n print(\"no\")\r\n break\r\n else:\r\n for k in Ds:\r\n if k not in Dr:\r\n print(\"no\")\r\n break\r\n else:\r\n print(\"yes\")", "# cook your dish here\r\n\r\nfor i in range(int(input())):\r\n _ = int(input())\r\n Tr = list(map(int, input().split()))\r\n _ = int(input())\r\n Dr = list(map(int, input().split()))\r\n _ = int(input())\r\n Ts = list(map(int, input().split()))\r\n _ = int(input())\r\n Ds = list(map(int, input().split()))\r\n \r\n for j in Ts:\r\n if j not in Tr:\r\n print(\"no\")\r\n break\r\n else:\r\n for k in Ds:\r\n if k not in Dr:\r\n print(\"no\")\r\n break\r\n else:\r\n print(\"yes\")", "for i in range(int(input())):\n trn = int(input())\n tr = input().split(\" \")\n drn = int(input())\n dr = input().split(\" \")\n tsn = int(input())\n ts = input().split(\" \")\n dsn = int(input())\n ds = input().split(\" \")\n for j in ts:\n if j not in tr:\n print(\"no\")\n break\n else:\n for k in ds:\n if k not in dr:\n print(\"no\")\n break\n else:\n print(\"yes\")\n \n ", "def Check(ram,shyam):\n for i in shyam:\n if i not in ram:\n return False\n return True\n\nfor _ in range(int(input())):\n tR = int(input())\n Tr = list(map(int,input().split()))\n dR = int(input())\n Dr = list(map(int,input().split()))\n tS = int(input())\n Ts = list(map(int,input().split()))\n dS = int(input())\n Ds = list(map(int,input().split()))\n truthCheck = Check(Tr,Ts)\n dareCheck = Check(Dr,Ds)\n if ( truthCheck and dareCheck ):\n print(\"yes\")\n else:\n print(\"no\")\n \n", "def Check(ram,shyam):\n for i in shyam:\n if i not in ram:\n return False\n return True\n\nfor _ in range(int(input())):\n tR = int(input())\n Tr = list(map(int,input().split()))\n dR = int(input())\n Dr = list(map(int,input().split()))\n tS = int(input())\n Ts = list(map(int,input().split()))\n dS = int(input())\n Ds = list(map(int,input().split()))\n truthCheck = Check(Tr,Ts)\n dareCheck = Check(Dr,Ds)\n if ( truthCheck and dareCheck ):\n print(\"yes\")\n else:\n print(\"no\")\n ", "# cook your dish here\nfor _ in range(int(input())):\n rt = int(input())\n tr= list(map(int,input().split()))\n rd = int(input())\n dr = list(map(int,input().split()))\n st = int(input())\n ts = list(map(int,input().split()))\n sd = int(input())\n ds = list(map(int,input().split()))\n l = []\n for i in ts:\n if i in tr:\n l.append('y')\n else:\n l.append('no')\n for i in ds:\n if i in dr:\n l.append('y')\n else:\n l.append('no')\n if \"no\" in l:\n print(\"no\")\n else:\n print(\"yes\") ", "# cook your dish here\nt = int(input())\nfor i in range(t):\n truthtasks = []\n daretasks = []\n tr = int(input())\n TR = list(map(int, input().split()))\n dr = int(input())\n DR = list(map(int, input().split()))\n ts = int(input())\n TS = list(map(int, input().split()))\n ds = int(input())\n DS = list(map(int, input().split()))\n for i in TS:\n if i in TR:\n flag = 1\n else:\n flag = 0\n break\n if flag:\n for j in DS:\n if j in DR:\n flag = 1\n else:\n flag = 0\n break\n if flag:\n print('yes')\n else:\n print('no')\n \n \n \n \n ", "for _ in range(int(input())):\n tr = int(input())\n Tr = list(map(int, input().split()))\n dr = int(input())\n Dr = list(map(int, input().split()))\n ts = int(input())\n Ts = list(map(int, input().split()))\n ds = int(input())\n Ds = list(map(int, input().split()))\n \n for truth_s in Ts:\n if truth_s in Tr:\n #Tr.remove(truth_s)\n flag = 1\n else:\n flag = 0\n break \n if flag:\n for dare_s in Ds:\n if dare_s in Dr:\n #Dr.remove(dare_s)\n flag = 1\n else:\n flag = 0\n break\n \n if flag:\n print('yes')\n else:\n print('no')", "# cook your dish here\ntry:\n for _ in range(int(input())):\n c,d=0,0\n t1=int(input())\n r1=list(map(int,input().split()))\n d1=int(input())\n r2=list(map(int,input().split()))\n t2=int(input())\n r3=list(map(int,input().split()))\n d2=int(input())\n r4=list(map(int,input().split()))\n for i in range(t2):\n a=r3[i]\n if a in r1:\n c=c+1\n for i in range(d2):\n b=r4[i]\n if b in r2:\n d=d+1\n if c==len(r3) and d==len(r4):\n print(\"yes\")\n else:\n print(\"no\")\nexcept:\n pass", "for _ in range(int(input())):\r\n t_r = int(input())\r\n tr = list(map(int, input().split()))\r\n d_r = int(input())\r\n dr = list(map(int, input().split()))\r\n t_s = int(input())\r\n ts = list(map(int, input().split()))\r\n d_s = int(input())\r\n ds = list(map(int, input().split()))\r\n l = []\r\n for i in ts:\r\n if i in tr:\r\n l.append('y')\r\n else:\r\n l.append('no')\r\n for i in ds:\r\n if i in dr:\r\n l.append('y')\r\n else:\r\n l.append('no')\r\n if \"no\" in l:\r\n print(\"no\")\r\n else:\r\n print(\"yes\")", "# cook your dish here\nfor _ in range(int(input())):\n t_r = int(input())\n tr = list(map(int, input().split()))\n d_r = int(input())\n dr = list(map(int, input().split()))\n t_s = int(input())\n ts = list(map(int, input().split()))\n d_s = int(input())\n ds = list(map(int, input().split()))\n \n flag = True\n \n for t in ts:\n if t not in tr:\n flag = False\n break\n \n if flag:\n for d in ds:\n if d not in dr:\n flag = False\n break\n \n print(\"yes\" if flag else \"no\")", "# cook your dish here\nfor _ in range(int(input())):\n t_r = int(input())\n tr = list(map(int, input().split()))\n d_r = int(input())\n dr = list(map(int, input().split()))\n t_s = int(input())\n ts = list(map(int, input().split()))\n d_s = int(input())\n ds = list(map(int, input().split()))\n \n flag = True\n \n for t in ts:\n if t not in tr:\n flag = False\n break\n \n if flag:\n for d in ds:\n if d not in dr:\n flag = False\n break\n \n print(\"yes\" if flag else \"no\")", "for _ in range(int(input())):\r\n t1=int(input())\r\n ta1=list(map(int,input().split()))\r\n d1=int(input())\r\n da1=list(map(int,input().split()))\r\n t2=int(input())\r\n ta2=list(map(int,input().split()))\r\n d2=int(input())\r\n da2=list(map(int,input().split()))\r\n if(set(ta2).issubset(set(ta1)) and set(da2).issubset(set(da1))):\r\n print(\"yes\")\r\n else:\r\n print(\"no\")", "def bs(a,n,k): \n l=0 \n h=n-1 \n while(l<=h): \n mid=(l+h)//2\n if a[mid]==k: \n return 1\n if a[mid]<k: \n l=mid+1 \n else: \n h=mid-1 \n return 0\n \n \nt=int(input())\nfor kk in range(t): \n ntr=int(input()) \n tr=[int(x) for x in input ().split()] \n tr.sort()\n ndr=int(input ()) \n dr=[int(x) for x in input (). split ()] \n dr.sort()\n nts=int(input ()) \n ts=[int(x) for x in input ().split()] \n nds=int(input ()) \n ds=[int(x) for x in input ().split()] \n s=1\n for i in range(nts): \n if bs(tr,ntr,ts[i]): \n continue \n else: \n s=0 \n break\n if s==0: \n print(\"no\") \n continue\n for i in range(nds): \n if bs(dr,ndr,ds[i]): \n continue\n else: \n s=0 \n break\n if s==0: \n print(\"no\")\n continue\n if s==1: \n print(\"yes\")\n \n \n ", "try:\n for _ in range(int(input())):\n n=int(input())\n d=list(map(int,input().split()))\n s=int(input())\n p=list(map(int,input().split()))\n o=int(input())\n t=list(map(int,input().split()))\n w=int(input())\n q=list(map(int,input().split()))\n l=[]\n for i in t:\n if i in d:\n l.append(\"y\")\n else:\n l.append(\"no\")\n for i in q:\n if i in p:\n l.append(\"y\")\n else:\n l.append(\"no\") \n \n if \"no\" in l:\n print(\"no\")\n else:\n print(\"yes\")\nexcept:\n pass\n\n\n", "try:\n t = int(input())\n result = []\n for i in range(t):\n check1 = True\n check2 = True\n tr = int(input())\n trl = list(map(int, input().split()))\n dr = int(input())\n drl = list(map(int, input().split()))\n ts = int(input())\n tsl = list(map(int, input().split()))\n ds = int(input())\n dsl = list(map(int, input().split()))\n\n for j in range(ts):\n if (tsl[j] not in trl):\n check1 = False\n else:\n continue\n\n for k in range(ds):\n if (dsl[k] not in drl):\n check2 = False\n else:\n continue\n\n if (check1 == True and check2 == True):\n result.append(\"yes\")\n else:\n result.append(\"no\")\n\n for b in result:\n print(b)\n\n\n\nexcept:\n pass", "# cook your dish here\nfor _ in range(int(input())):\n t_r = int(input())\n tr = list(map(int, input().split()))\n d_r = int(input())\n dr = list(map(int, input().split()))\n t_s = int(input())\n ts = list(map(int, input().split()))\n d_s = int(input())\n ds = list(map(int, input().split()))\n \n flag = True\n \n for t in ts:\n if t not in tr:\n flag = False\n break\n \n if flag:\n for d in ds:\n if d not in dr:\n flag = False\n break\n \n print(\"yes\" if flag else \"no\")\n", "# cook your dish here\nfor _ in range(int(input())):\n t_r = int(input())\n tr = list(map(int, input().split()))\n d_r = int(input())\n dr = list(map(int, input().split()))\n t_s = int(input())\n ts = list(map(int, input().split()))\n d_s = int(input())\n ds = list(map(int, input().split()))\n \n flag = True\n \n for t in ts:\n if t not in tr:\n flag = False\n break\n \n if flag:\n for d in ds:\n if d not in dr:\n flag = False\n break\n \n print(\"yes\" if flag else \"no\")\n", "# cook your dish here\nfor _ in range(int(input())):\n t_r = int(input())\n tr = list(map(int, input().split()))\n d_r = int(input())\n dr = list(map(int, input().split()))\n t_s = int(input())\n ts = list(map(int, input().split()))\n d_s = int(input())\n ds = list(map(int, input().split()))\n \n flag = True\n \n for t in ts:\n if t not in tr:\n flag = False\n break\n \n if flag:\n for d in ds:\n if d not in dr:\n flag = False\n break\n \n print(\"yes\" if flag else \"no\")", "# cook your dish here\n# cook your dish here\nfor _ in range(int(input())):\n t_r = int(input())\n tr = list(map(int, input().split()))\n d_r = int(input())\n dr = list(map(int, input().split()))\n t_s = int(input())\n ts = list(map(int, input().split()))\n d_s = int(input())\n ds = list(map(int, input().split()))\n \n flag = True\n \n for t in ts:\n if t not in tr:\n flag = False\n break\n \n if flag:\n for d in ds:\n if d not in dr:\n flag = False\n break\n \n print(\"yes\" if flag else \"no\")", "# cook your dish here\nfor _ in range(int(input())):\n t_r = int(input())\n tr = list(map(int, input().split()))\n d_r = int(input())\n dr = list(map(int, input().split()))\n t_s = int(input())\n ts = list(map(int, input().split()))\n d_s = int(input())\n ds = list(map(int, input().split()))\n \n flag = True\n \n for t in ts:\n if t not in tr:\n flag = False\n break\n \n if flag:\n for d in ds:\n if d not in dr:\n flag = False\n break\n \n print(\"yes\" if flag else \"no\")# cook your dish here\n", "# cook your dish here\nfor _ in range(int(input())):\n t_r = int(input())\n tr = list(map(int, input().split()))\n d_r = int(input())\n dr = list(map(int, input().split()))\n t_s = int(input())\n ts = list(map(int, input().split()))\n d_s = int(input())\n ds = list(map(int, input().split()))\n \n flag = True\n \n for t in ts:\n if t not in tr:\n flag = False\n break\n \n if flag:\n for d in ds:\n if d not in dr:\n flag = False\n break\n \n print(\"yes\" if flag else \"no\")\n \n ", "for _ in range(int(input())):\n t_r = int(input())\n tr = list(map(int, input().split()))\n d_r = int(input())\n dr = list(map(int, input().split()))\n t_s = int(input())\n ts = list(map(int, input().split()))\n d_s = int(input())\n ds = list(map(int, input().split()))\n \n flag = True\n \n for t in ts:\n if t not in tr:\n flag = False\n break\n \n if flag:\n for d in ds:\n if d not in dr:\n flag = False\n break\n \n print(\"yes\" if flag else \"no\")\n \n "]

{"inputs": [["4", "2", "1 2", "3", "1 3 2", "1", "2", "2", "3 2", "2", "1 2", "3", "1 3 2", "1", "2", "3", "3 2 4", "3", "3 2 5", "2", "2 100", "1", "2", "1", "100", "2", "1 2", "3", "1 3 2", "1", "2", "3", "3 2 2", ""]], "outputs": [["yes", "no", "yes", "yes"]]}

INTERVIEW

PYTHON3

CODECHEF

16,163

d0ee3a020d4f9cfd829227d9d715914d

UNKNOWN

An encoder encodes the first $16$ lowercase English letters using $4$ bits each. The first bit (from the left) of the code is $0$ if the letter lies among the first $8$ letters, else it is $1$, signifying that it lies among the last $8$ letters. The second bit of the code is $0$ if the letter lies among the first $4$ letters of those $8$ letters found in the previous step, else it's $1$, signifying that it lies among the last $4$ letters of those $8$ letters. Similarly, the third and the fourth bit each signify the half in which the letter lies. For example, the letter $j$ would be encoded as : - Among $(a,b,c,d,e,f,g,h$ $|$ $i,j,k,l,m,n,o,p)$, $j$ appears in the second half. So the first bit of its encoding is $1$. - Now, among $(i,j,k,l$ $|$ $m,n,o,p)$, $j$ appears in the first half. So the second bit of its encoding is $0$. - Now, among $(i,j$ $|$ $k,l)$, $j$ appears in the first half. So the third bit of its encoding is $0$. - Now, among $(i$ $|$ $j)$, $j$ appears in the second half. So the fourth and last bit of its encoding is $1$. So $j$'s encoding is $1001$, Given a binary encoded string $S$, of length at most $10^5$, decode the string. That is, the first 4 bits are the encoding of the first letter of the secret message, the next 4 bits encode the second letter, and so on. It is guaranteed that the string's length is a multiple of 4. -----Input:----- - The first line of the input contains an integer $T$, denoting the number of test cases. - The first line of each test case contains an integer $N$, the length of the encoded string. - The second line of each test case contains the encoded string $S$. -----Output:----- For each test case, print the decoded string, in a separate line. -----Constraints----- - $1 \leq T \leq 10$ - $4 \leq N \leq 10^5$ - The length of the encoded string is a multiple of $4$. - $0 \le S_i \le 1$ -----Subtasks----- - $100$ points : Original constraints. -----Sample Input:----- 3 4 0000 8 00001111 4 1001 -----Sample Output:----- a ap j -----Explanation:----- - Sample Case $1$ : The first bit is $0$, so the letter lies among the first $8$ letters, i.e., among $a,b,c,d,e,f,g,h$. The second bit is $0$, so it lies among the first four of these, i.e., among $a,b,c,d$. The third bit is $0$, so it again lies in the first half, i.e., it's either $a$ or $b$. Finally, the fourth bit is also $0$, so we know that the letter is $a$. - Sample Case $2$ : Each four bits correspond to a character. Just like in sample case $1$, $0000$ is equivalent to $a$. Similarly, $1111$ is equivalent to $p$. So, the decoded string is $ap$. - Sample Case $3$ : The first bit is $1$, so the letter lies among the last $8$ letters, i.e., among $i,j,k,l,m,n,o,p$. The second bit is $0$, so it lies among the first four of these, i.e., among $i,j,k,l$. The third bit is $0$, so it again lies in the first half, i.e., it's either $i$ or $j$. Finally, the fourth bit is $1$, so we know that the letter is $j$.

["# cook your dish here\ndef decode(L,S):\n str_2=\"\"\n lst=[]\n for i in range(L//4):\n str_1 = \"abcdefghijklmnop\"\n S_1=S[(i*4):(4*(i+1))]\n for j in range(4):\n if(S_1[j]==\"1\"):\n str_1=str_1[len(str_1)//2:len(str_1)]\n else:\n str_1 = str_1[0:len(str_1) // 2]\n str_2=str_2+str_1\n print(str_2)\n\nT=int(input())\nfor i in range(T):\n L=int(input())\n S=input()\n decode(L,S)\n", "testcases = int(input())\nalphabet = 'aiemckgobjfndlhp'\n\nfor testcase in range(testcases):\n length = int(input())\n code = input()\n string = ''\n for byte in range(0,length,4):\n letter = code[:4]\n num = (int(code[3])*8+int(code[2])*4+int(code[1])*2+int(code[0]))\n string += alphabet[num]\n code = code[4:]\n print(string)", "# cook your dish here\nt=int(input())\nfor e in range(t):\n n=int(input())\n s=input()\n ans=''\n for i in range(0,n,4):\n s2=s[i]+s[i+1]+s[i+2]+s[i+3]\n l=[chr(q) for q in range(97,113)]\n for z in s2:\n if z=='0':\n l=l[0:int(len(l)/2)]\n else:\n l=l[int(len(l)/2):]\n ans=ans+l[0]\n print(ans)", "# cook your dish here\nt=int(input())\nwhile t>0:\n n=int(input())\n str1= input()\n str3=\"\"\n for i in range(0,n,4):\n str2=str1[i]+str1[i+1]+str1[i+2]+str1[i+3]\n l1=['a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p']\n for j in str2:\n if j=='0':\n l1=l1[:int(len(l1)/2)]\n else:\n l1=l1[int(len(l1)/2):]\n #print(l1)\n str3+=l1[0]\n print(str3)\n \n t=t-1", "# cook your dish here\nfor _ in range(int(input())):\n n=int(input())\n s=input()\n d={'0000':'a','0001':'b','0010':'c','0011':'d',\n '0100':'e','0101':'f','0110':'g','0111':'h',\n '1000':'i','1001':'j','1010':'k','1011':'l',\n '1100':'m','1101':'n','1110':'o','1111':'p'}\n a=\"\"\n for i in range(0,n,4):\n x=s[i:i+4]\n a+=d.get(x)\n print(a)\n \n", "# cook your dish here\ndef find(n,i):\n if i=='0':\n return n//2\n else:\n return n\n \nalphabets=['a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p']\ntest=int(input())\nwhile(test!=0):\n bits=int(input())\n li=list(input())\n k=0\n while(bits>=4):\n t=16\n s=''\n for i in range(k,k+4):\n s=s+li[i]\n bits=bits-4\n k=k+4\n s=int(s,2)\n print(alphabets[s],end=\"\")\n print()\n test=test-1", "# cook your dish here\nfor _ in range(int(input())):\n n = int(input())\n lst = ['a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p']\n f = lst\n o = ''\n fo = ''\n s = input()\n for i in range(n+1):\n if i%4==0:\n fo+=o\n f = lst\n if i==n:\n break\n if int(s[i])==0:\n f = f[:len(f)//2]\n o = f[0]\n elif int(s[i])==1:\n f = f[len(f)//2:]\n o = f[0]\n print(fo)\n", "# cook your dish here\nfor i in range(int(input())):\n n = int(input())\n a = str(input())\n d = {'0000':'a','0001':'b','0010':'c','0011':'d',\n '0100':'e','0101':'f','0110':'g','0111':'h',\n '1000':'i','1001':'j','1010':'k','1011':'l',\n '1100':'m','1101':'n','1110':'o','1111':'p'}\n\n ans = ''\n for i in range(0,len(a),4):\n x = a[i:i+4]\n ans+=(d.get(x))\n print(ans)", "# cook your code here\nzz= int(input(''))\nfor j in range(zz):\n xx=int(input(''))\n x=list(input(''))\n kk=0\n sos=''\n for i in range (xx,0,-4):\n t=3\n c=0\n for k in range (4):\n c=c+(int(x[kk])*(2**t))\n kk=kk+1\n t=t-1\n sos=sos+ chr(c+97)\n print(sos)", "# cook your dish here\nmap_dict={'0000':'a',\n '0001':'b',\n '0010':'c',\n '0011':'d',\n '0100':'e',\n '0101':'f',\n '0110':'g',\n '0111':'h',\n '1000':'i',\n '1001':'j',\n '1010':'k',\n '1011':'l',\n '1100':'m',\n '1101':'n',\n '1110':'o',\n '1111':'p'}\ndef decode_it(s):\n l=len(s)\n ch_list=[]\n for i in range(0,l,4):\n ind=s[i:i+4]\n x=map_dict[ind]\n ch_list.append(x)\n return \"\".join(ch_list)\nT=int(input())\nwhile T > 0:\n l=int(input())\n s=input()\n print(decode_it(s))\n T-=1", "d=['a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p']\nfor t in range(int(input())):\n n = int(input())\n s=input()\n string=''\n for i in range(0,n-3,4):\n string+=d[int(s[i:i+4],2)]\n print(string)", "# cook your dish here \nt=int(input())\nwhile(t): \n k=int(input())\n s=input()\n n=4\n l = [s[i:i+n] for i in range(0, k, n)] \n li=[]\n for i in l:\n \n li.append(chr(int(i,2)+97)) \n \n print(\"\".join(i for i in li))\n \n t-=1", "def find_string(k):\n f=\"abcdefghijklmnop\"\n for i in range(0,len(k)): \n if k[i]==\"1\": \n f=f[len(f)//2:] \n elif k[i]==\"0\":\n f=f[:len(f)//2]\n return f\nt=int(input())\nwhile(t):\n o=int(input())\n k=input()\n res=\"\"\n j=0\n while j+3 in range(len(k)):\n res=res+find_string(k[j:j+4])\n j=j+4\n print(res)\n t=t-1\n", "# cook your dish here\nt=int(input())\nwhile t>0:\n n=int(input())\n s=input()\n arr=[]\n for i in range(97,113):\n arr.append(chr(i))\n i=0\n while i<n:\n k=0\n l=15\n while k<l:\n m=(k+l)//2\n if k>=l:\n break\n if s[i]=='0':\n l=m\n elif s[i]=='1':\n k=m+1\n \n i=i+1\n print(arr[k],end=\"\")\n print() \n t=t-1", "# cook your dish here\ndef division(x,s):\n l=[]\n for i in range(0,s,4):\n l.append(x[i:i+4])\n return l\nt=int(input())\nfor i in range(t):\n size=int(input())\n x=input()\n s=division(x,size)\n string=\"\"\n for i in s:\n sum1=0\n for j in range(4):\n sum1+=(2**(3-j))*int(i[j])\n sum1+=97\n string+=chr(sum1)\n print(string)\n \n\n", "# cook your dish here\ndef division(x,s):\n l=[]\n for i in range(0,s,4):\n l.append(x[i:i+4])\n return l\nt=int(input())\nfor i in range(t):\n size=int(input())\n x=input()\n s=division(x,size)\n string=\"\"\n for i in s:\n sum1=0\n for j in range(4):\n sum1+=(2**(3-j))*int(i[j])\n sum1+=97\n string+=chr(sum1)\n print(string)\n \n\n", "for _ in range(int(input())):\n l=int(input())\n s=input()\n string=\"abcdefghijklmnop\"\n decode=''\n for b in range(0,l,4):\n string=\"abcdefghijklmnop\"\n for a in range(b,b+4):\n if s[a]=='0':\n n=len(string)//2\n string=string[0:n]\n elif s[a]=='1':\n n=len(string)\n string=string[(n//2):n]\n decode=decode+string\n print(decode)", "# cook your dish here\nfor i in range(int(input())):\n N = int(input())\n S = input()\n for i in range(0, N, 4):\n print(chr(97 + int(S[i:i+4], 2)), end='')\n print('')", "for _ in range(int(input())):\n N = int(input())\n S = input()\n for i in range(0, N, 4):\n print(chr(97 + int(S[i:i+4], 2)), end='')\n print('')", "import sys\nimport math\n\n\nclass Test:\n N=0\n S=[]\n def __init__(self):\n tmp=input().split()\n self.N=int(tmp[0])\n self.S=[int(i) for i in input()]\n\nclass Input:\n T=0\n test=[]\n def __init__(self):\n self.T=int(input())\n for i in range(0,self.T):\n self.test.append(Test())\n\nletter=[]\nletter.append([])\nletter.append([])\nletter[0].append([])\nletter[0].append([])\nletter[1].append([])\nletter[1].append([])\nletter[0][0].append([])\nletter[0][0].append([])\nletter[0][1].append([])\nletter[0][1].append([])\nletter[1][0].append([])\nletter[1][0].append([])\nletter[1][1].append([])\nletter[1][1].append([])\n\nletter[0][0][0].append(\"a\")\nletter[0][0][0].append(\"b\")\nletter[0][0][1].append(\"c\")\nletter[0][0][1].append(\"d\")\nletter[0][1][0].append(\"e\")\nletter[0][1][0].append(\"f\")\nletter[0][1][1].append(\"g\")\nletter[0][1][1].append(\"h\")\nletter[1][0][0].append(\"i\")\nletter[1][0][0].append(\"j\")\nletter[1][0][1].append(\"k\")\nletter[1][0][1].append(\"l\")\nletter[1][1][0].append(\"m\")\nletter[1][1][0].append(\"n\")\nletter[1][1][1].append(\"o\")\nletter[1][1][1].append(\"p\")\ndef getletter(i, j, k, l):\n return letter[i][j][k][l]\n\ndef test_case(t:Test):\n sum=0\n i=0\n string=\"\"\n while i + 3 < len(t.S):\n string+=getletter(t.S[i], t.S[i+1], t.S[i+2],t.S[i+3])\n i+=4\n print(string)\n\ninp=Input()\nfor test in inp.test:\n test_case(test)\n", "# cook your dish her\nt=int(input())\nwhile(t):\n a=['a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p']\n n=int(input())\n s=input()\n res=''\n for i in range(0,len(s),4):\n res=res+a[int(s[i:i+4],2)]\n print(res)\n t-=1\n"]

{"inputs": [["3", "4", "0000", "8", "00001111", "4", "1001"]], "outputs": [["a", "ap", "j"]]}

INTERVIEW

PYTHON3

CODECHEF

7,990

a61e80a517cd34f4039cc226ab665a4c

UNKNOWN

Chef wants to serve mankind by making people immortal by preparing a dish, a dish of life - a dish with the best taste in the universe, one with the smell and splash of fresh water flowing down the springs of the mountain, one with the smell of the best lily flowers of the garden, one that has contained the very essence of life in a real sense. This dish will contain K ingredients that are found only in remote islands amid mountains. For sake of convenience, we enumerate the ingredients by the integers from 1 to K, both inclusive. There are N islands and each of them offers some ingredients. Chef being a little child did not know how to collect the ingredients for the recipe. He went to all the islands and bought all the ingredients offered in each island. Could he possibly have saved some time by skipping some island? If it was not possible for Chef to collect the required ingredients (i.e. all the K ingredients), output "sad". If it was possible for him to skip some islands, output "some", otherwise output "all". -----Input----- First line of the input contains an integer T denoting number of test cases. The description of T test cases follow. The first line of each test case contains two space separated integers N, K. The i-th of the next lines will contain first an integer Pi, denoting the number of ingredients grown in the i-th island, followed by Pi distinct integers in the range [1, K]. All the integers are space separated. -----Output----- For each test case, output a single line containing one of the strings "sad", "all" or "some" (without quotes) according to the situation. -----Constraints----- - 1 ≤ T ≤ 10 - 1 ≤ N, K ≤ 105 - 1 ≤ Pi ≤ K - Sum of Pi over all test cases ≤ 106 -----Subtasks----- Subtask #1 (30 points) - 1 ≤ N, K ≤ 50 Subtask #2 (30 points) - 1 ≤ K ≤ 50 Subtask #3 (40 points) - original constraints -----Example----- Input 3 3 4 3 1 2 3 2 1 3 2 1 2 2 3 3 1 2 3 2 1 3 2 3 2 1 2 2 1 3 Output sad some all -----Explanation----- Example 1. The ingredient 4 is not available in any island, so Chef can't make the dish of life. Hence, the answer is "sad". Example 2. Chef can just go to the first island and collect all the three ingredients required. He does not need to visit the second island. So, the answer is "some". Example 3. Chef has to visit both the islands in order to obtain all the three ingredients. So, the answer is "all".

["for _ in range(int(input())):\n n,k = list(map(int,input().split()))\n array = []\n tot = []\n for _ in range(n):\n temp = list(map(int,input().split()))\n aa = temp[0]\n del(temp[0])\n temp.sort()\n temp.insert(0,aa)\n array.append(temp)\n dic = {}\n array.sort(reverse=True)\n for i in array:\n del(i[0])\n for i in range(1,k+1):\n dic[i] = False\n count = 0\n for i in array:\n count += 1\n # print(count,tot)\n for j in i:\n if(dic[j]==True):\n pass\n else:\n tot.append(j)\n dic[j]=True\n if(len(tot)==k):\n break\n if(len(tot)!=k):\n print(\"sad\")\n elif(count!=n):\n print(\"some\")\n else:\n print(\"all\")", "for _ in range(int(input())):\n n,k = list(map(int,input().split()))\n array = []\n tot = []\n for _ in range(n):\n temp = list(map(int,input().split()))\n aa = temp[0]\n del(temp[0])\n temp.sort()\n temp.insert(0,aa)\n array.append(temp)\n dic = {}\n array.sort(reverse=True)\n for i in array:\n del(i[0])\n for i in range(1,k+1):\n tot.append(i)\n dic[i] = False\n count = 0\n for i in array:\n count += 1\n # print(count,tot)\n for j in i:\n if(dic[j]==True):\n pass\n else:\n tot.remove(j)\n dic[j]=True\n if(len(tot)==0):\n break\n if(len(tot)!=0):\n print(\"sad\")\n elif(count!=n):\n print(\"some\")\n else:\n print(\"all\")", "for _ in range(int(input())):\n n,k = list(map(int,input().split()))\n array = []\n tot = []\n for _ in range(n):\n temp = list(map(int,input().split()))\n aa = temp[0]\n del(temp[0])\n temp.sort()\n temp.insert(0,aa)\n array.append(temp)\n array.sort(reverse=True)\n for i in array:\n del(i[0])\n for i in range(1,k+1):\n tot.append(i)\n count = 0\n for i in array:\n count += 1\n # print(count,tot)\n for j in i:\n if(j in tot):\n tot.remove(j)\n if(len(tot)==0):\n break\n if(len(tot)!=0):\n print(\"sad\")\n elif(count!=n):\n print(\"some\")\n else:\n print(\"all\")", "for q in range(int(input())):\n n,k=list(map(int,input().split()))\n test=[]\n z=[]\n f=0\n for i in range(n):\n l=[int(i) for i in input().split()]\n l=l[1:]\n z.append(l)\n c=[0]*(k+1)\n for i in range(n):\n for j in z[i]:\n c[j]+=1\n for i in range(1,k+1):\n if c[i]==0:\n print(\"sad\")\n f=1\n break\n if f==1:\n continue\n for i in range(n):\n cnt=0\n for j in z[i]:\n if c[j]!=1:\n cnt+=1\n if cnt==len(z[i]):\n print(\"some\")\n break\n else:\n print(\"all\")\n \n \n \n", "\n#island=[[0 for i in range(k+2)]for j in range(n)\nfor _ in range(int(input())):\n island=[]\n n,k=map(int,input().split())\n for i in range(n):\n l=[int(i) for i in input().split()]\n l=l[1:]\n island.append(l)\n cnt=[0]*(k+1)\n for i in range(n):\n for indigrient in island[i]:\n cnt[indigrient]+=1 \n f=1 \n for i in range(1,k+1):\n if cnt[i]==0:\n f=0 \n break \n if not f:\n print('sad')\n continue \n f1=0 \n # print(island)\n for i in range(n):\n f2=1 \n for j in island[i]:\n if cnt[j]==1:\n f2=0\n if f2:\n f1=1 \n break \n if f1:\n print('some')\n else:\n print('all')"]

{"inputs": [["3", "3 4", "3 1 2 3", "2 1 3", "2 1 2", "2 3", "3 1 2 3", "2 1 3", "2 3", "2 1 2", "2 1 3"]], "outputs": [["sad", "some", "all"]]}

INTERVIEW

PYTHON3

CODECHEF

3,038

4c0bad2dd8066126e6c1bfa51b338e4a

UNKNOWN

Motu and Patlu are playing with a Magical Ball. Patlu find some interesting pattern in the motion of the ball that ball always bounce back from the ground after travelling a linear distance whose value is some power of $2$. Patlu gave Motu total distance $D$ travelled by the ball and ask him to calculate the minimum number of bounces that the ball makes before coming to rest. -----Input:----- - First line will contain $T$, number of testcases. Then the testcases follow. - Each testcase contains of a single line of input, single integers $D$. - Note : Power of $2$ must be a non-negative integer. -----Output:----- For each testcase, output in a single line answer, the minimum number of bounces the ball makes before coming to rest. -----Constraints----- - $1 \leq T \leq 10^5$ - $1$ $\leq$ $M$< $10$^18 -----Sample Input:----- 1 13 -----Sample Output:----- 2 -----EXPLANATION:-----

["# cook your dish here\r\ntest=int(input())\r\nfor _ in range(test):\r\n n=int(input())\r\n n=list(bin(n))\r\n ans=n.count('1')\r\n print(ans-1)", "# cook your dish here\nt=int(input())\nfor i in range(t):\n n=int(input())\n binary=bin(n)\n setb=[ones for ones in binary[2:] if ones=='1']\n print(len(setb)-1)\n", "# cook your dish here\nimport math\ntry:\n \n t=int(input())\n\n while(t>0):\n n=int(input())\n c=0\n '''while(n>=1):\n if(n%2==1):\n c=c+1\n n=n//2'''\n m=n\n s=0\n if(math.log2(n)-int(math.log2(n))==0):\n print(0)\n else:\n while(n>=2):\n if(bool(math.log2(n))):\n c=c+1\n r=2**(int(math.log2(n)))\n s=s+r \n n=n-r\n \n if(s==m):\n c=c-1\n #print(n)\n print(c)\n t=t-1\nexcept:\n pass", "test=int(input())\r\nfor _ in range(test):\r\n n=int(input())\r\n n=list(bin(n))\r\n ans=n.count('1')\r\n print(ans-1)", "# cook your dish here\nimport math;\ncount = 0;\n\ndef steps(num):\n nonlocal count;\n \n expo=int(math.log(num,2));\n nearPow=int(pow(2,expo));\n if(nearPow==num):\n return count;\n num-=nearPow;\n count+=1;\n if(num==1):\n return count;\n else:\n steps(num);\n return count;\n\n \niterator=int(input());\nwhile(iterator>0):\n count=0;\n num=int(input());\n print((steps(abs(num))));\n iterator-=1;\n", "try:\n t = int(input())\n for _ in range(t):\n N = int(input())\n a = bin(N)\n\n print(a.count('1') -1 )\n\nexcept:\n pass", "# cook your dish here\nimport math\nt=int(input())\nfor i in range(t):\n k=int(input())\n count=0\n temp=(int(math.log2(k)))\n for j in range(temp,-1,-1):\n if((k-(2**j))>=0):\n k=k-(2**j)\n \n count=count+1\n print(count-1)\n", "def countBits(n):\r\n\tcount=0\r\n\twhile n>0:\r\n\t\tn = n &n-1\r\n\t\tcount+=1\r\n\treturn count\t\r\n\r\nt = int(input())\r\nfor _ in range(t):\r\n\tn = int(input())\r\n\tprint(countBits(n)-1)", "# cook your dish here\ndef balls():\n d=int(input())\n i=0\n while(1):\n if (2**i)>d:\n i-=1 \n break\n i+=1 \n temp=0\n result=0\n j=i \n while(j>=0):\n if (temp+(2**j))==d:\n return result\n if (temp+(2**j))>d:\n j-=1 \n else:\n temp+=(2**j)\n result+=1\n return result\nt=int(input())\nfor loop in range(t):\n print(balls())", "for i in range(int(input())):\r\n a=int(input())\r\n sum=0\r\n x=2\r\n while (a//x)!=0:\r\n sum+=1\r\n x*=2\r\n \r\n temp=0\r\n while a>=0 and sum>=0:\r\n if 2**sum<=a:\r\n a-=(2**sum)\r\n temp+=1\r\n sum -= 1\r\n\r\n print(temp-1)\r\n", "for i in range(int(input())):\r\n a=int(input())\r\n sum=0\r\n x=2\r\n while (a//x)!=0:\r\n sum+=1\r\n x*=2\r\n \r\n temp=0\r\n while a>=0 and sum>=0:\r\n if 2**sum<=a:\r\n a-=(2**sum)\r\n temp+=1\r\n sum -= 1\r\n\r\n print(temp-1)\r\n", "import math as m\nfor _ in range(int(input())):\n d=int(input())\n p=d\n c=0\n while(True):\n a=int(m.log2(d))\n c=c+1\n d=d-2**a\n if d==1 or d==0:\n if p%2==0:\n c=c-1\n print(c)\n break\n else:\n print(c)\n break", "import math\r\nT=int(input())\r\nfor _ in range(T):\r\n D=int(input())\r\n count=0\r\n while D>0:\r\n p = int(math.log(D, 2))\r\n D = D - 2**p\r\n count+=1\r\n print(count-1)", "# cook your dish here\nimport math\nt=int(input())\nfor _ in range(t):\n n=int(input())\n if math.ceil(math.log2(n))== math.floor(math.log2(n)):\n print(0)\n else:\n x,c=0,0\n while n>0:\n x=2**math.floor(math.log2(n))\n c+=1\n n=n-x\n if math.ceil(math.log2(n))== math.floor(math.log2(n)):\n break\n print(c) \n", "import math\nt = int(input())\nwhile(t!=0):\n d = int(input())\n bounce=0\n while(d>0):\n p = int(math.log(d,2))\n d = d- (pow(2,p))\n if(d!=0):\n bounce+=1;\n print(int(bounce))\n t-=1", "# cook your dish here\ndef ConDecBin(num, count):\n\tcount += num%2\n\tif num > 1:\n\t\tConDecBin(num//2, count)\n\telse:\n\t\tprint(count - 1)\n\nfor k in range(int(input())):\n\tnum = int(input())\n\tcount = 0\n\n\tConDecBin(num, count)", "# def b(n):\r\n# str=\"\"\r\n# if n>1:\r\n# b(n//2)\r\n# print(n%2,end=\"\")\r\nt=int(input())\r\nfor i in range(t):\r\n n=int(input())\r\n # b(n)\r\n binary=bin(n)\r\n setBits=[ones for ones in binary[2:] if ones=='1']\r\n print(len(setBits)-1)\r\n", "try:\n t=int(input())\n for i in range(t):\n d=int(input())\n li=list(bin(d))\n print(li.count('1')-1)\nexcept:\n pass\n", "# cook your dish here\nimport numpy as np\n\ndef bb(d):\n if(d==0):\n return 0\n elif(d==1 or d==2):\n return 1\n else:\n return 1+bb(d-2**int(np.log2(d)))\n\n\nT = int(input())\ntests = np.zeros(T)\nfor i in range(T):\n tests[i] = int(input())\n print(bb(tests[i])-1)", "def bitsoncount(x):\n return bin(x).count('1')\nfor t in range(int(input())):\n x = int(input())\n if x == 0:\n print(0)\n else:\n\n print(bitsoncount(x)-1)", "for _ in range(int(input())):\n a=int(input())\n b=list(bin(a))\n print(b.count('1')-1)\n", "t=int(input())\r\nwhile(t!=0):\r\n k=0\r\n n=int(input())\r\n if n&n-1==0:\r\n print(0)\r\n else:\r\n while(n!=0):\r\n n=n&n-1\r\n k+=1\r\n print(k-1)\r\n t-=1\r\n\r\n\r\n", "t=int(input())\r\nwhile(t!=0):\r\n k=0\r\n n=int(input())\r\n if n==1:\r\n print(0)\r\n elif n&n-1==0:\r\n print(0)\r\n else:\r\n while(n!=0):\r\n n=n&n-1\r\n k+=1\r\n print(k-1)\r\n t-=1\r\n\r\n\r\n", "import math\nfor _ in range(int(input())):\n d=int(input())\n c=0\n while d>0:\n n=math.floor(math.log2(d))\n x=pow(2,n)\n d-=x\n c+=1\n print(c-1)", "for _ in range(int(input())):\r\n d=int(input())\r\n print(str(bin(d)).count(\"1\")-1)"]

{"inputs": [["1", "13"]], "outputs": [["2"]]}

INTERVIEW

PYTHON3

CODECHEF

6,800

99f24491321b5bb9201a0b9178a2aaf5

UNKNOWN

Two players are playing a game. The game is played on a sequence of positive integer pairs. The players make their moves alternatively. During his move the player chooses a pair and decreases the larger integer in the pair by a positive multiple of the smaller integer in the pair in such a way that both integers in the pair remain positive. If two numbers in some pair become equal then the pair is removed from the sequence. The player who can not make any move loses (or in another words the player who encounters an empty sequence loses). Given the sequence of positive integer pairs determine whether the first player can win or not (assuming that both players are playing optimally). -----Input----- The first line of the input contains an integer T denoting the number of test cases. The description of T test cases follows. Each test starts with an integer N denoting the number of pairs. Each of the next N lines contains a pair of positive integers. -----Output----- For each test case, output a single line containing "YES" if the first player can win and "NO" otherwise. -----Constraints----- - 1 ≤ T ≤ 100 - 1 ≤ N ≤ 100 - All other integers are between 1 to 108 - The integers in each pair will be different -----Example----- Input: 3 1 2 3 2 4 5 5 6 2 2 3 3 5 Output: NO NO YES -----Explanation----- Example case 1. The first player don't have any choice other subtracting 2 from 3. So during the turn of the second player integer pair will be (2,1). The second player will win by subtracting 1 from 2. Example case 2. If the first player choose to move (4,5) to (4,1) the second player will make it to (1,1). If the first player choose to move (5,6) to (5,1) the second player will make it to (1,1). So regardless of the move of the first player, the second will always win. Example case 3. The first player will select pair (3,5) and make it to (3,2). Now both pairs are equal. So whatever the move of second player he will just mirror that move in another pair. This will ensure his win.

["import sys\n\nt = int(input())\n\ndef g(a,b):\n if (a > b):\n tmp = a\n a = b\n b = tmp\n if (b == a):\n return 0\n if (b % a == 0):\n return int(b/a)-1\n r = g(b%a,a)\n q = int(b/a)\n if (r >= q):\n return q-1\n else:\n return q\n\ndef mex(x):\n n = len(list(x.keys()))\n for i in range(n):\n if (i not in x):\n return i\n return i\n\ndef g2(a,b):\n if (a == b):\n return 0\n if (a > b):\n tmp = a\n a = b\n b = tmp\n if (b % a == 0):\n return int(b/a)-1\n q = int(b/a)\n x = {}\n r = b % a\n for i in range(q):\n x[g2(r+i*a,a)] = True\n return mex(x)\n\n#print(str(g(6,33))+\" \"+str(g2(6,33)))\n\nwhile (t):\n\n n = int(input())\n x = 0\n while (n):\n line = input().split()\n a = int(line[0])\n b = int(line[1])\n x ^= g(a,b)\n n -= 1\n if (x):\n sys.stdout.write(\"YES\\n\")\n else:\n sys.stdout.write(\"NO\\n\")\n #print(str(g(a,b)) + \" \" + str(g2(a,b)))\n t -= 1"]

{"inputs": [["3", "1", "2 3", "2", "4 5", "5 6", "2", "2 3", "3 5"]], "outputs": [["NO", "NO", "YES"]]}

INTERVIEW

PYTHON3

CODECHEF

898

54f17b59bcf1c8cd30aa3aafea7f711c

UNKNOWN

The chef is trying to solve some pattern problems, Chef wants your help to code it. Chef has one number K to form a new pattern. Help the chef to code this pattern problem. -----Input:----- - First-line will contain $T$, the number of test cases. Then the test cases follow. - Each test case contains a single line of input, one integer $K$. -----Output:----- For each test case, output as the pattern. -----Constraints----- - $1 \leq T \leq 100$ - $1 \leq K \leq 100$ -----Sample Input:----- 4 1 2 3 4 -----Sample Output:----- * * * * *** *** * * *** *** ***** ***** * * *** *** ***** ***** ******* ******* -----EXPLANATION:----- No need, else pattern can be decode easily.

["# cook your dish here\nfor i in range(int(input())):\n n=int(input())\n p=1\n l=n-1\n for j in range(n):\n for k in range(l):\n print(\" \",end='')\n for k in range(p):\n print(\"*\",end='')\n print()\n for k in range(l):\n print(\" \",end='')\n for k in range(p):\n print(\"*\",end='')\n print()\n p+=2\n l-=1\n ", "t=int(input())\r\nfor _ in range(t):\r\n n=int(input())\r\n for i in range(n):\r\n print(\" \"*(n-i-1)+'*'*(2*i+1))\r\n print(\" \"*(n-i-1)+'*'*(2*i+1))\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n", "for _ in range(int(input())):\n n=int(input())\n for i in range(0,n):\n print((n-i)*' '+(2*i+1)*\"*\")\n print((n-i)*' '+(2*i+1)*\"*\")\n i=i+2\n'''\n*\n*\n *\n *\n***\n***\n *\n *\n ***\n ***\n*****\n*****\n *\n *\n ***\n ***\n *****\n *****\n*******\n*******'''", "from sys import stdin, stdout\nfrom math import floor, gcd, fabs, factorial, fmod, sqrt, inf, log\nfrom collections import defaultdict as dd, deque\nfrom heapq import merge, heapify, heappop, heappush, nsmallest\nfrom bisect import bisect_left as bl, bisect_right as br, bisect\nmod = pow(10, 9) + 7\nmod2 = 998244353\ndef inp(): return stdin.readline().strip()\ndef out(var, end=\"\\n\"): stdout.write(str(var)+\"\\n\")\ndef outa(*var, end=\"\\n\"): stdout.write(' '.join(map(str, var)) + end)\ndef lmp(): return list(mp())\ndef mp(): return list(map(int, inp().split()))\ndef smp(): return list(map(str, inp().split()))\ndef l1d(n, val=0): return [val for i in range(n)]\ndef l2d(n, m, val=0): return [l1d(n, val) for j in range(m)]\ndef remadd(x, y): return 1 if x%y else 0\ndef ceil(a,b): return (a+b-1)//b\n\ndef isprime(x):\n if x<=1: return False\n if x in (2, 3): return True\n if x%2 == 0: return False\n for i in range(3, int(sqrt(x))+1, 2):\n if x%i == 0: return False\n return True\n\nfor _ in range(int(inp())):\n n = int(inp())\n k = 1\n for i in range(2*n):\n if i!=0 and i%2==0:\n k+=2\n print(\" \"*((n-k)) + \"*\"*k + \" \"*((n-k)))\n", "for i in range(int(input())):\r\n a=int(input())\r\n i=1\r\n for j in range(1,a*2,2):\r\n print(\" \"*(a-i),\"*\"*j)\r\n print(\" \"*(a-i),\"*\"*j)\r\n i+=1", "for _ in range(int(input())):\r\n n = int(input())\r\n s = '*'\r\n\r\n for i in range(n):\r\n x = ' ' * ((n * 2 - 1 - len(s)) // 2)\r\n\r\n print(x + s + x)\r\n print(x + s + x)\r\n\r\n s = '*' + s + '*'", "for tc in range(int(input())):\r\n K = int(input())\r\n mx = 2 * K - 1\r\n for i in range(K):\r\n s = '*' * (2 * i + 1)\r\n s = ' ' * (mx - len(s) >> 1) + s\r\n print(s)\r\n print(s)"]

{"inputs": [["4", "1", "2", "3", "4"]], "outputs": [["*", "*", "*", "*", "***", "***", "*", "*", "***", "***", "*****", "*****", "*", "*", "***", "***", "*****", "*****", "*******", "*******"]]}

INTERVIEW

PYTHON3

CODECHEF

2,859

39c7d2800107f6fa85602aa4eacf88ee

UNKNOWN

In a fictitious city of CODASLAM there were many skyscrapers. The mayor of the city decided to make the city beautiful and for this he decided to arrange the skyscrapers in descending order of their height, and the order must be strictly decreasing but he also didn’t want to waste much money so he decided to get the minimum cuts possible. Your job is to output the minimum value of cut that is possible to arrange the skyscrapers in descending order. -----Input----- *First line of input is the number of sky-scrappers in the city *Second line of input is the height of the respective sky-scrappers -----Output----- * Your output should be the minimum value of cut required to arrange these sky-scrappers in descending order. -----Example----- Input: 5 1 2 3 4 5 Output: 8 By: Chintan,Asad,Ashayam,Akanksha

["import sys\n \nnum=int(sys.stdin.readline())\ns=sys.stdin.readline().split()\nsky=list(map(int,s))\nsky.reverse()\ncuts=0\nchange=0\nt=False\ni=1\n \nwhile i<len(sky):\n if sky[i]<=sky[i-1]:\n for j in range(i-1,-1,-1):\n \n if sky[j]<=sky[i]-(i-j):\n break\n else:\n change+=sky[j]-(sky[i]-(i-j))\n \n if change>=sky[i]:\n change=sky[i]\n t=True\n break\n \n cuts+=change\n \n if t:\n del sky[i]\n t=False\n i-=1\n \n else:\n for j in range(i-1,-1,-1):\n if sky[j]<sky[i]-(i-j):\n break\n else:\n sky[j]=sky[i]-(i-j)\n i+=1\n \n change=0\n \nprint(cuts)", "#!/usr/bin/env python\n\ndef main():\n N = int(input())\n while True:\n try:\n X = input()\n except:\n break\n H = list(map(int, X.split()))\n C = 0\n while H:\n e = H.pop(0)\n H2, C1, C2 = list(H), e, 0\n for i in range(len(H2)):\n if H2[i] > e-1:\n C2 += H2[i]-(e-1)\n H2[i] = e-1\n #print C+C2, H2, C+C1, H\n if C1 <= C2:\n C += C1\n else:\n C += C2\n H = H2\n print(C)\n\nmain()\n\n", "import sys\n\nnum=int(sys.stdin.readline())\ns=sys.stdin.readline().split()\nsky=list(map(int,s))\nsky.reverse()\ncuts=0\nchange=0\nt=False\ni=1\n\nwhile i<len(sky):\n if sky[i]<=sky[i-1]:\n for j in range(i-1,-1,-1):\n \n if sky[j]<=sky[i]-(i-j):\n break\n else:\n change+=sky[j]-(sky[i]-(i-j))\n \n if change>=sky[i]:\n change=sky[i]\n t=True\n break\n \n cuts+=change\n \n if t:\n del sky[i]\n t=False\n i-=1\n \n else:\n for j in range(i-1,-1,-1):\n if sky[j]<sky[i]-(i-j):\n break\n else:\n sky[j]=sky[i]-(i-j)\n i+=1\n \n change=0\n \nprint(cuts)\n"]

{"inputs": [["5", "1 2 3 4 5"]], "outputs": [["8", "By:", "Chintan,Asad,Ashayam,Akanksha"]]}

INTERVIEW

PYTHON3

CODECHEF

1,678

b6d90b2a4da50323edca7ee16e6e0292

UNKNOWN

There is Chef and Chef’s Crush who are playing a game of numbers. Chef’s crush has a number $A$ and Chef has a number $B$. Now, Chef wants Chef’s crush to win the game always, since she is his crush. The game ends when the greatest value of A^B is reached after performing some number of operations (possibly zero), Where ^ is Bitwise XOR. Before performing any operation you have to ensure that both $A$ and $B$ have the same number of bits without any change in the values. It is not guaranteed that $A$ and $B$ should have same number of bits in the input. For example, if $A$ is $2$ and $B$ is $15$, then the binary representation of both the numbers will have to be $0010$ and $1111$ respectively, before performing any operation. The operation is defined as : - Right circular shift of the bits of only $B$ from MSB$_B$ to LSB$_B$ i.e. if we consider $B_1 B_2 B_3 B_4$ as binary number, then after one circular right shift, it would be $B_4 B_1 B_2 B_3$ They both are busy with themselves, can you find the number of operations to end the game? -----Input :----- - The first line of input contains $T$, (number of test cases) - Then each of the next $T$ lines contain : two integers $A$ and $B$ respectively. -----Output :----- For each test case print two space-separated integers, The number of operations to end the game and value of A^B when the game ends. -----Constraints :----- - $1 \leq T \leq100$ - $1\leq A,B \leq 10^{18}$ -----Subtasks :----- - 30 Points: $1\leq A,B \leq 10^5$ - 70 Points: Original Constraints -----Sample Input :----- 1 4 5 -----Sample Output :----- 2 7 -----Explanation :----- Binary representation of $4$ is $100$ and binary representation $5$ is $101$. - After operation $1$ : $B$ $=$ $110$, so A^B $=$ $2$ - After operation $2$ : $B$ $=$ $011$, so A^B $=$ $7$ So, the value of A^B will be $7$. Which is the greatest possible value for A^B and the number of operations are $2$.

["\ndef main():\n t = int(input())\n while (t):\n m, n = map(int, input().split())\n a , b= bin(m)[2:],bin(n)[2:]\n #print(a,b)\n max = m^n\n if len(a)>len(b):\n diff =len(a)-len(b)\n b= (\"0\"*diff)+b\n #print(b)\n elif len(a)<len(b):\n diff =len(b)-len(a)\n a= (\"0\"*diff)+a\n #print(a)\n ll = len(b)\n count= 0\n for i in range(ll-1):\n s= b[ll-1] + b\n s= s[:ll]\n\n tt= m^ int(s,2)\n #print(m,s,tt)\n if tt>max:\n max =tt\n count= i+1\n b=s\n\n print(count,max)\n t-=1\n\ndef __starting_point():\n main()\n__starting_point()", "def bitLen(int_type):\n length = 0\n while (int_type):\n int_type >>= 1\n length += 1\n return(length)\ndef rot(b):\n b=b[-1]+b[:-1]\n return b\nfor __ in range(int(input())):\n ans=0\n r=0\n x=0\n c=0\n a, b = map(int, input().split())\n if a>=b:\n r = bitLen(a)\n b=(bitLen(a)-bitLen(b))*'0'+bin(b).replace('0b','')\n a=bin(a).replace('0b','')\n else:\n r = bitLen(b)\n a = (bitLen(b) - bitLen(a)) * '0' + bin(a).replace('0b', '')\n b = bin(b).replace('0b', '')\n for d in range(r):\n x=int(a,2)^int(b,2)\n b=rot(b)\n if ans < x:\n ans=x\n c=d\n print(c,ans)", "try:\n def ts(s): \n str1 = \"\" \n for ele in s: \n str1 += ele \n return str1 \n \n for _ in range(int(input())):\n x,y=[int(x) for x in input().split()]\n x=list(bin(x).replace(\"0b\", \"\"))\n y=list(bin(y).replace(\"0b\",\"\"))\n xl=len(x)\n yl=len(y)\n if(xl<yl):\n for __ in range(yl-xl):\n x.insert(0,'0')\n else:\n for __ in range(xl-yl):\n y.insert(0,'0') \n l=len(x)\n xor=-1\n rotations=-1\n for i in range(l):\n temp_xor=int(ts(x),2)^int(ts(y),2)\n if(temp_xor>xor):\n xor=temp_xor\n rotations=i\n temp=x.pop\n y.insert(0,y.pop())\n print(rotations,xor)\n \nexcept:\n pass", "t = int(input())\nwhile(t):\n a, b = map(int ,input().split())\n stra = bin(a).replace(\"0b\", \"\")\n strb = bin(b).replace(\"0b\",\"\")\n if(len(stra) == len(strb)):\n pass\n elif(len(stra) > len(strb)):\n addi = len(stra) - len(strb)\n for i in range(addi):\n strb = '0' + strb\n else:\n addi = len(strb) - len(stra)\n for i in range(addi):\n stra = '0'+ stra\n n = len(strb)\n maxi = int(stra, 2) ^ int(strb, 2)\n i = 0\n indi = 0\n tem = strb[-1] + strb[0:n-1]\n while(tem != strb):\n c = int(stra, 2) ^ int(tem, 2)\n i += 1\n if(c >= maxi):\n maxi = c\n indi = i\n tem = tem[-1] + tem[0:n-1]\n print(indi, maxi)\n t = t - 1", "# cook your dish here\nfor i in range(int(input())):\n a,b=map(int, input().split())\n b=bin(b)[2:]\n b=list(map(str, b))\n for j in range (len(str(bin(a)[2:]))-len(b)):\n b.insert(0,\"0\")\n xor=a^int((\"\".join(b)),2)\n max=xor\n c=0\n for j in range(len(b)-1):\n b = (b[-1:] + b[:-1])\n xor=a^int((\"\".join(b)),2)\n if xor>max:\n max=xor\n c=j+1\n print(c, max)", "\ndef bint(var):\n decimale = 0\n l = len(var)\n for i in range(l):\n decimale += int(var[i])*(2**(l-i-1))\n return decimale\n \n \nt = int(input())\nfor _ in range(t):\n a, b = map(int, input().split())\n a = bin(a)[2:]\n b = bin(b)[2:]\n if(len(a) > len(b)):\n b = \"0\"*(len(a)-len(b)) + b\n elif(len(b) > len(a)):\n a = \"0\"*(len(b)-len(a)) + a\n l = len(a)\n res =0\n val = bint(a)^bint(b)\n temp = b[-1] + b[:l-1]\n x = 1\n while(x < l):\n if(bint(a)^bint(temp) > val):\n val = bint(a)^bint(temp)\n res = x\n temp = temp[-1] + temp[:l-1]\n x += 1\n print(res, val)", "from math import log2\ndef rotate(n, bits):\n if(n&1):\n n = n>>1 | 1<<bits\n else:\n n = n >> 1\n return n\nt = int(input())\nwhile(t > 0):\n t -= 1\n max_xor = 0\n count = 0\n max_count = 0\n a, b = map(int, input().split())\n a_bits = int(log2(a)+1)\n b_bits = int(log2(b)+1)\n if(a_bits > b_bits):\n bits = a_bits\n else:\n bits = b_bits\n c = bits\n bits -= 1\n while(c > 0):\n c -= 1\n c_xor = a^b\n if(c_xor > max_xor):\n max_xor = c_xor\n max_count = count\n b = rotate(b, bits)\n count += 1\n print(max_count, max_xor)", "def dec(n): \n return bin(n).replace(\"0b\", \"\")\ndef ss(str):\n if len(str) <= 1:\n return str\n mid = str[1:len(str)]\n return mid + str[0]\ndef btd(q): \n q1 = q \n decimal, i, n = 0, 0, 0\n while(q != 0): \n dec = q % 10\n decimal = decimal + dec * (2**i) \n q= q//10\n i += 1\n return(decimal) \nt=int(input())\nfor iw in range(0,t):\n a=input()\n arr=[]\n \n we=[]\n x=a.split()\n string=str(dec(int(x[1])))\n string2=str(dec(int(x[0])))\n d=int(x[0])\n if(len(string)>len(string2)):\n l=len(string)\n else:\n l=len(string2)\n for lk in range(0,len(string2)-len(string)):\n string='0'+string\n for k in range(0,l):\n c=int(x[1])\n arr.append(d^c)\n string=ss(string)\n x[1]=btd(int(string))\n for h in range(0,len(arr)):\n if(max(arr)==arr[h]):\n if(h==0):\n we.append(0)\n break\n else:\n we.append(len(arr)-h)\n print(min(we),max(arr))", "t=int(input())\nwhile(t):\n l=input().split()\n a=int(l[0])\n b=int(l[1])\n a=str(bin(a).replace(\"0b\",\"\"))\n b=str(bin(b).replace(\"0b\",\"\"))\n if(len(a)!=len(b)):\n if(len(a)>len(b)):\n m=len(a)-len(b)\n b=(\"0\"*m)+b\n else:\n m=len(b)-len(a)\n a=(\"0\"*m)+a\n l=len(b)\n s1=b.count('1')\n s2=b.count('0')\n if(l==s1 or l==s2):\n j=int(a)^int(b)\n k=int(str(j),2)\n print(0,k)\n else:\n l1=[]\n o=int(a,2)\n p=int(b,2)\n q=o^p\n l1.append(q)\n for i in range(1,l):\n b=b[-1]+b[0:-1]\n c=int(b,2)\n l1.append(o^c)\n maxx=max(l1)\n print(l1.index(maxx),maxx)\n t-=1", "try:\n def right_shift(x):\n temp = x+x\n return temp[len(x)-1:2*len(x)-1]\n \n for i in range(int(input())): \n a , b = map(int,input().split(\" \"))\n a,b=bin(a)[2:] , bin(b)[2:]\n \n if(len(a)<len(b)):\n diff = len(b)-len(a)\n a=\"0\"*diff+a\n elif(len(b)<len(a)):\n diff = len(a)-len(b)\n b=\"0\"*diff+b \n \n a=int(a,2) \n maxi = a^int(b,2) \n steps=0\n \n for i in range(1,len(b)): \n b=right_shift(b) \n \n if(a^int(b,2)>maxi):\n maxi=a^int(b,2)\n steps = i\n \n print(steps,maxi)\nexcept:\n pass", "# cook your dish here\ndef right_shift(x):\n temp = x+x\n return temp[len(x)-1:2*len(x)-1]\n \nfor i in range(int(input())): \n a , b = map(int,input().split(\" \"))\n a,b=bin(a)[2:] , bin(b)[2:]\n \n if(len(a)<len(b)):\n diff = len(b)-len(a)\n a=\"0\"*diff+a\n elif(len(b)<len(a)):\n diff = len(a)-len(b)\n b=\"0\"*diff+b \n \n a=int(a,2) \n maxi = a^int(b,2) \n steps=0\n \n for i in range(1,len(b)): \n b=right_shift(b) \n \n if(a^int(b,2)>maxi):\n maxi=a^int(b,2)\n steps = i\n \n print(steps,maxi)", "# cook your dish here\ntry:\n def dectobin(a):\n r=[int(i) for i in bin(a)[2:]]\n return r\n def bintodec(a):\n r=int(\"\".join(str(x) for x in a),2)\n return r\n def s(a):\n a=[a[-1]]+a[:-1]\n return a\n for i in range(int(input())):\n a,b=map(int,input().split())\n bina=dectobin(a)\n binb=dectobin(b)\n ans=[]\n ans.append(a^b)\n bits=len(bina)-len(binb)\n if bits<0:\n for j in range(bits):\n bina.insert(0,0)\n elif bits>0:\n for j in range(bits):\n binb.insert(0,0)\n for j in range(len(binb)):\n binb=s(binb)\n b=bintodec(binb)\n ans.append(a^b)\n print(ans.index(max(ans)),max(ans))\nexcept:\n pass", "def right_shift(x):\n temp = x+x\n return temp[len(x)-1:2*len(x)-1]\n \nfor i in range(int(input())): \n a , b = map(int,input().split(\" \"))\n a,b=bin(a)[2:] , bin(b)[2:]\n \n if(len(a)<len(b)):\n diff = len(b)-len(a)\n a=\"0\"*diff+a\n elif(len(b)<len(a)):\n diff = len(a)-len(b)\n b=\"0\"*diff+b \n \n a=int(a,2) \n maxi = a^int(b,2) \n steps=0\n \n for i in range(1,len(b)): \n b=right_shift(b) \n \n if(a^int(b,2)>maxi):\n maxi=a^int(b,2)\n steps = i\n \n print(steps,maxi)", "for _ in range(int(input())):\n a,b=list(map(int,input().split()))\n ab=bin(a)[2:]\n bb=bin(b)[2:]\n n=abs(len(bb)-len(ab))\n if n>0:\n if len(bb)>len(ab):\n ab = \"0\"*n + ab\n else:\n bb = \"0\"*n + bb\n m=0\n count=0\n for i in range(len(bb)):\n l=int(ab,2)^int(bb,2)\n if l>m:\n m=l\n count=i\n bb =bb[-1] + bb\n bb=bb[:-1]\n \n print(count,m)\n", "# cook your dish here\nfor i in range(int(input())):\n A,B=map(int, input().split())\n B=bin(B)[2:]\n B=list(map(str, B))\n for j in range (len(str(bin(A)[2:]))-len(B)):\n B.insert(0,\"0\")\n xor=A^int((\"\".join(B)),2)\n max=xor\n c=0\n for j in range(len(B)-1):\n B = (B[-1:] + B[:-1])\n xor=A^int((\"\".join(B)),2)\n if xor>max:\n max=xor\n c=j+1\n print(c, max)", "t=int(input())\nwhile(t):\n t-=1\n a,b=list(map(int,input().split()))\n a=bin(a).replace(\"0b\",\"\")\n b=bin(b).replace(\"0b\",\"\")\n s1=len(a)\n s2=len(b)\n if(s1!=s2):\n if(s1>s2):\n f=s1-s2\n b=(f*'0')+b\n else:\n f=s2-s1\n a=(f*'0')+a\n s1=len(a)\n s2=len(b)\n t1=b.count('1')\n t2=b.count('0')\n if(s2==t1 or s2==t2):\n n=int(a)^int(b)\n m=int(str(n),2)\n print(0,m)\n else:\n v=[]\n g=int(a,2)\n h=int(b,2)\n j=g^h\n v.append(j)\n for i in range(1,len(b)):\n b=b[-1]+b[0:-1]\n c=int(b,2)\n v.append(g^c)\n y=max(v)\n print(v.index(y),y)\n", "import math\nt = int(input())\nfor ti in range(t):\n a,b = map(int,input().split())\n mx = max(a,b)\n bit = int((math.log(mx) / math.log(2)) + 1)\n num = pow(2,bit) - 1\n res = a^b \n cnt = 0\n rot = 0\n for i in range(1,bit):\n if b%2==0:\n b//=2\n else:\n b+=num \n b//=2\n ans = a^b\n cnt+=1\n if ans>res:\n res=ans\n rot=cnt\n print(str(rot)+\" \"+str(res))"]

{"inputs": [["1", "4 5"]], "outputs": [["2 7"]]}

INTERVIEW

PYTHON3

CODECHEF

9,336

bf5a235dcc984bd82ebdbc1593200db3

UNKNOWN

Chef Tobby is playing a rapid fire with Bhuvan. He gives Bhuvan a string S and each time, Bhuvan has to guess whether there exists 2 equal subsequences in the string or not. Bhuvan got a perfect score in the game with Chef Tobby. However, Chef Tobby has now asked Bhuvan to write a program that will do this automatically given a string S. Bhuvan is an intelligent man but he does not know how to write a code. Can you help him? Find two different subsequences such that they are equal in their value, more formally, find two sequences of indices (a1, a2, ..., ak-1, ak) and (b1, b2, ..., bk-1, bk) such that: - 1≤ ai, bi ≤ |S| - ai < ai+1 for all valid i - bi < bi+1 for all valid i - Sai = Sbi for all valid i - there exist at least one i such that ai is not equal to bi -----Input section----- The first line contains T, the number of test cases. Each of the next T lines contain one string S each. Input will only consist of lowercase english characters -----Output section----- For each test case, output "yes" or "no" (without quotes) as the solution to the problem. -----Input constraints----- 1 ≤ T ≤ 1000 1 ≤ length of S ≤ 100 -----Sample Input----- 4 likecs venivedivici bhuvan codechef -----Sample Output----- no yes no yes -----Explanation----- In test case 2, one of the possible equal subsequence is "vi" and "vi". (one at position {0, 3} and other at {4, 7}, assuming 0-based indexing). In test case 4, one of the possible equal subsequence is "ce" and "ce". (one at position {0, 3} and other at {4, 6}, assuming 0-based indexing).

["t = int(input())\n\nfor _ in range(t):\n s = [x for x in input()]\n \n freq = {}\n \n for i in s:\n if i in freq:\n freq[i] += 1\n else:\n freq[i] = 1\n \n flag = 0\n \n for keys, values in freq.items():\n if(values >= 2):\n flag = 1\n break\n \n if(flag == 0):\n print(\"no\")\n else:\n print(\"yes\")", "t = int(input())\n\nfor _ in range(t):\n s = [x for x in input()]\n \n freq = {}\n \n for i in s:\n if i in freq:\n freq[i] += 1\n else:\n freq[i] = 1\n \n flag = 0\n \n for keys, values in freq.items():\n if(values >= 2):\n flag = 1\n break\n \n if(flag == 0):\n print(\"no\")\n else:\n print(\"yes\")", "for _ in range(int(input())):\n S = input()\n set_S = list(set(list(S)))\n flag = False\n \n for s in set_S:\n if S.count(s) > 1:\n flag = True\n break\n \n print(\"yes\" if flag else \"no\")", "for _ in range(int(input())) :\n s = input()\n if len(set(s)) == len(s) :\n print('no')\n else :\n print('yes')", "for _ in range(int(input())):\n S = input()\n for i in list(set(S)):\n if S.count(i) > 1:\n print('yes')\n break\n else:\n print('no')", "# cook your dish here\nfor _ in range(int(input())):\n s=input()\n flag=0\n for i in range(len(s)):\n if s.count(s[i]) > 1:\n flag=1\n break\n if flag==1:\n print('yes')\n else:\n print('no')", "t=int(input())\nfor i in range(t):\n s=input()\n list1=[]\n flag=0\n for i in range(len(s)):\n list1.append(s[i])\n set1=set(list1)\n dict1=dict()\n for i in set1:\n dict1[i]=0\n for i in list1:\n dict1[i]+=1\n if(dict1[i]>1):\n print(\"yes\")\n flag=1\n break\n if(flag==0):\n print(\"no\")\n \n", "T=int(input())\n\nwhile(T>0):\n s=input();\n flg=0;\n for i in range(len(s)-1):\n if(s.find(s[i],i+1)!=-1):\n flg=1;\n if(flg==0):\n print(\"no\");\n else:\n print(\"yes\");\n \n\n T=T-1\n", "def check(h):\n for n in h:\n if n > 1:\n return \"yes\"\n return \"no\"\n \n\nfor _ in range(int(input())):\n s = input()\n h = [0]*26\n \n for c in s:\n h[ord(c)-ord('a')] += 1\n \n print(check(h))", "# cook your dish here\nfor h in range(int(input())):\n s = input()\n if len(s)!=len(set(s)):\n print('yes')\n else:\n print('no')", "t=int(input())\nfor i in range(t):\n s=input()\n n=len(s)\n c=0\n if n!=len(set(s)):\n print('yes')\n else:\n print('no')", "def Cook(S):\n Counter = dict()\n for i in S:\n if i not in Counter.keys():\n Counter[i] = 0\n Counter[i] += 1\n for i in Counter.values():\n if i > 1:\n return \"yes\"\n return \"no\"\n\nfor T in range(int(input())):\n S = input()\n print(Cook(S))", "def Cook(S):\n Counter = dict()\n for i in S:\n if i not in Counter.keys():\n Counter[i] = 0\n Counter[i] += 1\n for i in Counter.values():\n if i > 1:\n return \"yes\"\n return \"no\"\n\nfor T in range(int(input())):\n S = input()\n print(Cook(S))", "t=int(input())\nfor i in range(t):\n s=input()\n l=[0 for i in range(26)]\n for j in range(len(s)):\n l[ord(s[j])-97]+=1\n f=0\n for j in range(26):\n if l[j]>1:\n f=1\n break\n if f==1:\n print(\"yes\")\n else:\n print(\"no\")", "# cook your dish here\nfor h in range(int(input())):\n s=input();\n l=list(s)\n s1=set(s)\n if(len(s1)==len(l)):\n print('no')\n else:\n print('yes')\n", "# cook your dish here\ntry:\n for _ in range(int(input())):\n s=input()\n l1=len(s)\n l2=len(set(s))\n if l1!=l2:\n print('yes')\n else:\n print('no')\nexcept:\n pass", "# cook your dish here\nfor i in range(int(input())):\n s=input()\n s1=set(s)\n l=[]\n for j in s1:\n l.append(s.count(j))\n if(max(l)>=2):\n print('yes')\n else:\n print('no')\n", "for _ in range(int(input())):\n s=input()\n l1=len(s)\n l2=len(set(s))\n if l1!=l2:\n print('yes')\n else:\n print('no')", "# cook your dish here\n# cook your dish here\nt=int(input())\nfor i in range(t):\n s=input()\n ans=1\n for j in s:\n if(s.count(j)>1):\n ans=0\n break\n if(ans==0):\n print(\"yes\")\n else:\n print(\"no\")\n", "# cook your dish here\nt=int(input())\nfor i in range(t):\n s=input()\n ans=1\n for j in s:\n if(s.count(j)>1):\n ans=0\n break\n if(ans==0):\n print(\"yes\")\n else:\n print(\"no\")\n", "# cook your dish here\nt=int(input())\nfor i in range(t):\n s=input()\n ans=1\n for j in s:\n if(s.count(j)>1):\n ans=0\n break\n if(ans==0):\n print(\"yes\")\n else:\n print(\"no\")\n", "# cook your dish here\nfor _ in range(int(input())):\n s = list(input())\n letters = set()\n flag = False\n for letter in s:\n if letter not in letters:\n letters.add(letter)\n else:\n flag = True\n break\n \n if flag:\n print(\"yes\")\n else:\n print(\"no\")", "t = int(input())\nfor i in range(t):\n a = input()\n b = list(a)\n c = 0\n for i in b:\n if a.count(i) > 1:\n c = c + 1\n if c >= 1:\n print(\"yes\")\n else:\n print(\"no\")"]

{"inputs": [["4", "likecs", "venivedivici", "bhuvan", "codechef"]], "outputs": [["no", "yes", "no", "yes"]]}

INTERVIEW

PYTHON3

CODECHEF

4,747

5bd2bfec4904a2b8ea43afc9c2738c38

UNKNOWN

Chef has gone shopping with his 5-year old son. They have bought N items so far. The items are numbered from 1 to N, and the item i weighs Wi grams. Chef's son insists on helping his father in carrying the items. He wants his dad to give him a few items. Chef does not want to burden his son. But he won't stop bothering him unless he is given a few items to carry. So Chef decides to give him some items. Obviously, Chef wants to give the kid less weight to carry. However, his son is a smart kid. To avoid being given the bare minimum weight to carry, he suggests that the items are split into two groups, and one group contains exactly K items. Then Chef will carry the heavier group, and his son will carry the other group. Help the Chef in deciding which items should the son take. Your task will be simple. Tell the Chef the maximum possible difference between the weight carried by him and the weight carried by the kid. -----Input:----- The first line of input contains an integer T, denoting the number of test cases. Then T test cases follow. The first line of each test contains two space-separated integers N and K. The next line contains N space-separated integers W1, W2, ..., WN. -----Output:----- For each test case, output the maximum possible difference between the weights carried by both in grams. -----Constraints:----- - 1 ≤ T ≤ 100 - 1 ≤ K < N ≤ 100 - 1 ≤ Wi ≤ 100000 (105) -----Example:----- Input: 2 5 2 8 4 5 2 10 8 3 1 1 1 1 1 1 1 1 Output: 17 2 -----Explanation:----- Case #1: The optimal way is that Chef gives his son K=2 items with weights 2 and 4. Chef carries the rest of the items himself. Thus the difference is: (8+5+10) − (4+2) = 23 − 6 = 17. Case #2: Chef gives his son 3 items and he carries 5 items himself.

["def main():\n T = int(input())\n for t in range(T):\n N,K = map(int, input().split())\n W = list(map(int, input().split()))\n W.sort()\n if 2*K > N:\n K = N - K\n kid = sum(W[:K])\n dad = sum(W[K:])\n\n diff = dad - kid\n\n print(diff)\n\n\ndef __starting_point():\n main()\n__starting_point()", "# cook your dish here\nt=int(input())\nfor i in range(t):\n n,k=list(map(int,input().split()))\n s=list(map(int,input().split()))\n\n s.sort()\n su=sum(s)\n s1=sum(s[:k])\n s2=sum(s[n-k:])\n\n print(max(abs(s1-(su-s1)),abs(s2-(su-s2))))\n\n \n", "# cook your dish here\ntry:\n for _ in range(int(input())):\n N, K = map(int, input().split())\n memory = list(map(int, input().split()))\n memory.sort()\n a = memory[:K]\n b = memory[K:]\n memory.reverse()\n c = memory[:K]\n d = memory[K:]\n a = sum(a)\n b = sum(b)\n c = sum(c)\n d = sum(d)\n print(max(abs(a - b), abs(c - d)))\nexcept:\n pass", "# cook your dish here\ntry:\n for _ in range(int(input())):\n N, K = map(int, input().split())\n memory = list(map(int, input().split()))\n memory.sort()\n a = memory[:K]\n b = memory[K:]\n memory.reverse()\n c = memory[:K]\n d = memory[K:]\n a = sum(a)\n b = sum(b)\n c = sum(c)\n d = sum(d)\n print(max(abs(a - b), abs(c - d)))\nexcept:\n pass", "# cook your dish here\nt = int(input())\nfor _ in range(t):\n n,k = map(int,input().split())\n carryBag = list(map(int,input().split()))\n carryBag.sort()\n w1 = min(k,n-k)\n son = sum(carryBag[:w1])\n father = sum(carryBag[w1:])\n print(father-son)", "# cook your dish here\nfor i in range(int(input())):\n a,b=list(map(int,input().split()))\n ls=list(map(int,input().split()))\n ls.sort()\n l1=sum(ls[b:])-sum(ls[:b])\n l2=sum(ls[a-b:])-sum(ls[:a-b])\n print(max(l1,l2))\n \n", "t=int(input())\nwhile(t>0):\n t-=1\n n,k=list(map(int,input().split()))\n arr=list(map(int,input().split()))\n curr=sorted(arr)\n div1 = sum(curr[k:])-sum(curr[:k])\n div2 = sum(curr[n-k:])-sum(curr[:n-k])\n print(max(div1,div2))\n\n", "import heapq\ndef kSmallest(lst, k,n):\n res=lst[:k]\n heapq._heapify_max(res)\n for i in range(k,n):\n if lst[i]<res[0]:\n heapq._heapreplace_max(res,lst[i])\n return res \ndef solve():\n t = int(input())\n for _ in range(t):\n n,k = [int(x) for x in input().split()]\n k = min(k,n-k)\n a = [int(x) for x in input().split()]\n b = kSmallest(a,k,n)\n print(abs(sum(a)-2*sum(b))) \n \n# import sys\n# def fast():\n# sys.stdin = open(\"input.txt\", \"r\")\n# sys.stdout = open(\"output.txt\", \"w\")\n# fast()\nsolve()", "def solve():\n n,k=map(int,input().split())\n w=list(map(int,input().split()))\n if k<=n//2:\n w.sort()\n else:\n w.sort(reverse=True)\n print(abs(sum(w[k:])-sum(w[:k])))\n\nt=int(input())\nwhile t:\n solve()\n t-=1", "# cook your dish here\nfor x in range(int(input())):\n n,k=input().split()\n n=int(n)\n k=int(k)\n l=list(map(int,input().split()))\n l.sort()\n if k<=n//2:\n print(sum(l[k:])-sum(l[:k]))\n else:\n print(abs(sum(l[:n-k])-sum(l[n-k:])))\n \n", "def subset_sum_check(l, n, sum1):\n while n >= 0:\n if sum1 - l[n] == 0:\n return True\n elif sum1 - l[n] > 0:\n if subset_sum_check(l, n - 1, sum1 - l[n]):\n return True\n n -= 1\n return False\n \nfor _ in range(int(input())):\n n,k = list(map(int,input().split()))\n arr = [int(i) for i in input().split()]\n h=n//2\n if n%2!=0:\n h+=1 \n if k>=h:\n k=n-k\n arr.sort()\n print(abs(sum(arr[:k])-sum(arr[k:])))\n", "t=int(input())\nwhile t>0:\n n,k=map(int,input().split(\" \"))\n li=list(map(int,input().split(\" \"))) \n li.sort()\n h=n//2\n if n%2!=0:\n h+=1 \n if k>=h:\n k=n-k\n l1=li[:k]\n l2=li[k:]\n #print(l1,l2)\n print(abs(sum(l1)-sum(l2)))\n t-=1", "for _ in range(int(input())):\n n,k = list(map(int, input().split()))\n weight = list(map(int, input().split()))\n weight.sort()\n a, b = 0, 0\n for i in range(n):\n if i < k:\n a += weight[i] \n \n if i >= n-k:\n b += weight[i] \n \n print(max(abs(a-(sum(weight) - a)), abs(b-(sum(weight)-b))))\n", "# cook your dish here\nfor _ in range(int(input())):\n n,k = list(map(int, input().split()))\n items = list(map(int,input().split()))\n items.sort()\n v1 = abs(sum(items[k:])-sum(items[:k]))\n items.sort(reverse = True)\n v2 = abs(sum(items[k:])-sum(items[:k]))\n print(max(v1,v2))", "test = int(input())\nfor i in range(test):\n items,given = [int(x) for x in input().split()]\n weight = [int(y) for y in input().split()]\n weight.sort()\n mn,mx = 0,0\n if given <= items//2:\n for j in range(1,items+1):\n if j <= given:\n mn = mn + weight[j-1]\n else:\n mx = mx + weight[j-1]\n print(mx-mn)\n else:\n for j in range(1,items+1):\n if j <= given:\n mn = mn + weight[items - j]\n else:\n mx = mx + weight[items - j]\n print(mn-mx)", "T = int(input())\n\nfor _ in range(T):\n N, K = map(int, input().split())\n W = list(map(int, input().split()))\n\n W.sort()\n\n if K <= N // 2:\n Kv = [W[i] for i in range(K)]\n else:\n Kv = [W[N - i - 1] for i in range(K)]\n for i in Kv:\n W.remove(i)\n\n diff = sum(Kv) - sum(W)\n if diff < 0:\n diff *= -1\n\n print(diff)", "answers= []\n\ndef solve(weights, limit):\n weights.sort()\n diff1 = abs(sum(weights[limit:])-sum(weights[0:limit]))\n diff2 = abs(sum(weights[-limit:]) - sum(weights[:-limit]))\n # answers.append(abs(sum(weights[limit:])-sum(weights[0:limit])))\n answers.append(max(diff1, diff2))\n\n\nT = int(input())\nwhile T:\n N, K = [int(x) for x in input().split()]\n weights = [int(x) for x in input().split()]\n solve(weights, K)\n T -= 1\n\nfor ans in answers:\n print(ans)", "# cook your dish here\nfor _ in range(int(input())):\n n,k = map(int,input().split())\n w = list(map(int,input().split()))\n w.sort()\n if k <= n//2:\n s1 = sum(w[:k])\n s2 = sum(w[k:])\n print(abs(s2 - s1))\n else:\n s1 = sum(w[n-k:])\n s2 = sum(w[:n-k])\n print(abs(s2-s1))", "\nt = int(input())\nfor _ in range(t):\n n,k = list(map(int,input().split()))\n\n l = list(map(int,input().split()))\n l.sort()\n a = max(sum(l[k:])-sum(l[:k]),sum(l[:k])-sum(l[k:]))\n l.sort(reverse=True)\n b = max(sum(l[k:])-sum(l[:k]),sum(l[:k])-sum(l[k:]))\n print(max(a,b)) \n\n\n", "# n items bought (1,2,3,....,n)\n# 1 2 3 4 5 6 7 8 9\n\nt=int(input())\nfor i in range(t):\n n,k=map(int,input().split())\n weightlist=list(map(int,input().split()))\n summofweights=0\n sonweight=0\n dadweight=0\n weightlist.sort()\n for j in weightlist:\n summofweights+=j\n if(k>n/2):\n for j in range(-1,-(k+1),-1):\n dadweight+=weightlist[j]\n ans=False\n else:\n for j in range(k):\n sonweight+=weightlist[j]\n ans=True\n if(ans):\n print(summofweights-(2*sonweight))\n else:\n print((2*dadweight)-summofweights)", "# cook your dish here\nfor _ in range(int(input())):\n sum_son=0\n n,k=map(int,input().split())\n w=[int(item) for item in input().split()]\n w.sort()\n k=min(k,n-k)\n for i in range(k):\n sum_son=sum_son+w[i]\n total_sum=sum(w) \n chef_sum=total_sum-sum_son\n print(abs(chef_sum-sum_son))", "t = int(input())\n\nfor i in range(t):\n w,k = map(int,input().split())\n l = [int(x) for x in input().split()]\n l.sort()\n sum_w = sum(l)\n s1 = 0\n s2 = 0\n start = 0\n end = len(l) - 1\n while k > 0:\n s1 += l[start]\n s2 += l[end]\n start += 1\n end -= 1\n k -= 1\n print(max(abs(s1 - (sum_w - s1)) , abs(s2 - (sum_w - s2))))", "# cook your dish here\nt=int(input())\nfor i in range(t):\n sum=0\n sum1=0\n n,k=map(int,input().split())\n l=list(map(int,input().split()))\n l.sort()\n k=min(k,n-k)\n for p in range(k):\n sum+=l[p]\n for q in range(k,n):\n sum1+=l[q]\n \n print(abs(sum-sum1))", "# cook your dish here\nfor _ in range(int(input())):\n num,k=list(map(int,input().split()))\n arr=list(map(int,input().split()))\n if(k<=num//2):\n arr.sort()\n ans=sum(arr[k:])-sum(arr[:k])\n print(abs(ans))\n else:\n arr.sort()\n ans=sum(arr[num-k:])-sum(arr[:num-k])\n print(ans)\n\n"]

{"inputs": [["2", "5 2", "8 4 5 2 10", "8 3", "1 1 1 1 1 1 1 1"]], "outputs": [["17", "2"]]}

INTERVIEW

PYTHON3

CODECHEF

7,851

47ddd45f6b2ea7dde6f22e3e8c026bc8

UNKNOWN

Consider the following operations on a triple of integers. In one operation, you should: - Choose an integer $d$ and an arithmetic operation ― either addition or multiplication. - Choose a subset of elements of the triple. - Apply the arithmetic operation to each of the chosen elements, i.e. either add $d$ to each of them or multiply each of them by $d$. For example, if we have a triple $(3, 5, 7)$, we may choose to add $3$ to the first and third element, and we get $(6, 5, 10)$ using one operation. You are given an initial triple $(p, q, r)$ and a target triple $(a, b, c)$. Find the minimum number of operations needed to transform $(p, q, r)$ into $(a, b, c)$. -----Input----- - The first line of the input contains a single integer $T$ denoting the number of test cases. The description of $T$ test cases follows. - The first line of each test case contains three space-separated integers $p$, $q$ and $r$. - The second line contains three space-separated integers $a$, $b$ and $c$. -----Output----- For each test case, print a single line containing one integer ― the minimum required number of operations. -----Constraints----- - $1 \le T \le 1,000$ - $|p|, |q|, |r|, |a|, |b|, |c| \le 10^9$ -----Subtasks----- Subtask #1 (10 points): $|p|, |q|, |r|, |a|, |b|, |c| \le 10$ Subtask #2 (90 points): original constraints -----Example Input----- 2 3 5 7 6 5 10 8 6 3 9 7 8 -----Example Output----- 1 2 -----Explanation----- Example case 1: We add $3$ to the first and third element of $(3, 5, 7)$ to form $(6, 5, 10)$. Example case 2: We can add $1$ to each element to form $(9, 7, 4)$ and then multiply the third element by $2$.

["def eq_solve(v0, v1, u0, u1):\r\n den = u0 - v0\r\n num = u1 - v1\r\n if den != 0:\r\n return num / den\r\n return 1\r\n \r\ndef solve(p, q, r, a, b, c, rs):\r\n if p == a and q == b and r == c:\r\n return rs\r\n if rs >= 2:\r\n return 3\r\n res = 3\r\n adds = [a - p, b - q, c - r]\r\n muls = []\r\n if p != 0:\r\n muls.append(a / p)\r\n if q != 0:\r\n muls.append(b / q)\r\n if r != 0:\r\n muls.append(c / r)\r\n muls.append(eq_solve(p, a, q, b))\r\n muls.append(eq_solve(p, a, r, c))\r\n muls.append(eq_solve(q, b, r, c))\r\n msks = 2 ** 3\r\n for msk in range(msks):\r\n for add in adds:\r\n np = p\r\n nq = q\r\n nr = r\r\n if (msk & 1) > 0:\r\n np += add\r\n if (msk & 2) > 0:\r\n nq += add\r\n if (msk & 4) > 0:\r\n nr += add\r\n res = min(res, solve(np, nq, nr, a, b, c, rs + 1))\r\n for mul in muls:\r\n np = p\r\n nq = q\r\n nr = r\r\n if (msk & 1) > 0:\r\n np *= mul\r\n if (msk & 2) > 0:\r\n nq *= mul\r\n if (msk & 4) > 0:\r\n nr *= mul\r\n res = min(res, solve(np, nq, nr, a, b, c, rs + 1))\r\n return res\r\n \r\n \r\n \r\nt = int(input())\r\n \r\nwhile t > 0:\r\n p, q, r = map(int, input().split())\r\n a, b, c = map(int, input().split())\r\n z = solve(p, q, r, a, b, c, 0)\r\n print(z)\r\n t -= 1 ", "def eq_solve(v0, v1, u0, u1):\r\n den = u0 - v0\r\n num = u1 - v1\r\n if den != 0:\r\n return num / den\r\n return 1\r\n \r\ndef solve(p, q, r, a, b, c, rs):\r\n if p == a and q == b and r == c:\r\n return rs\r\n if rs >= 2:\r\n return 3\r\n res = 3\r\n adds = [a - p, b - q, c - r]\r\n muls = []\r\n if p != 0:\r\n muls.append(a / p)\r\n if q != 0:\r\n muls.append(b / q)\r\n if r != 0:\r\n muls.append(c / r)\r\n muls.append(eq_solve(p, a, q, b))\r\n muls.append(eq_solve(p, a, r, c))\r\n muls.append(eq_solve(q, b, r, c))\r\n msks = 7\r\n for msk in range(msks):\r\n msk = msk + 1\r\n for add in adds:\r\n np = p\r\n nq = q\r\n nr = r\r\n if (msk & 1) > 0:\r\n np += add\r\n if (msk & 2) > 0:\r\n nq += add\r\n if (msk & 4) > 0:\r\n nr += add\r\n res = min(res, solve(np, nq, nr, a, b, c, rs + 1))\r\n for mul in muls:\r\n np = p\r\n nq = q\r\n nr = r\r\n if (msk & 1) > 0:\r\n np *= mul\r\n if (msk & 2) > 0:\r\n nq *= mul\r\n if (msk & 4) > 0:\r\n nr *= mul\r\n res = min(res, solve(np, nq, nr, a, b, c, rs + 1))\r\n return res\r\n \r\n \r\n \r\nt = int(input())\r\n \r\nwhile t > 0:\r\n p, q, r = map(int, input().split())\r\n a, b, c = map(int, input().split())\r\n z = solve(p, q, r, a, b, c, 0)\r\n print(z)\r\n t -= 1 ", "def eqSolve(p, a, q, b) :\n x = p - q\n y = a - b\n if x != 0 :\n z = int(y/x)\n return z\n else :\n return 1\n \ndef solve(p, q, r, a, b, c, rs) :\n if p == a and q == b and r == c :\n return rs\n elif rs >= 2 :\n return 3\n else :\n res = 3\n m = 8\n adds = [a - p, b - q, c - r]\n muls = []\n if p != 0 :\n muls.append(a/p)\n if q != 0 :\n muls.append(b/q)\n if r != 0 :\n muls.append(c/r)\n muls.append(eqSolve(p, a, q, b))\n muls.append(eqSolve(p, a, r, c))\n muls.append(eqSolve(q, b, r, c))\n for n in range(m) :\n for add in adds :\n np = p\n nq = q\n nr = r\n if n & 1 > 0 :\n np = np + add\n if n & 2 > 0 :\n nq = nq + add\n if n & 4 > 0 :\n nr = nr + add\n res = min(res, solve(np, nq, nr, a, b, c, rs + 1))\n for mul in muls :\n np = p\n nq = q\n nr = r\n if n & 1 > 0 :\n np = np*mul\n if n & 2 > 0 :\n nq = nq*mul\n if n & 4 > 0 :\n nr = nr*mul\n res = min(res, solve(np, nq, nr, a, b, c, rs + 1))\n return res \n\nt = int(input())\nx = 0\nfor x in range(t) :\n p, q, r = map(int, input().split())\n a, b, c = map(int, input().split())\n y = solve(p, q, r, a, b, c, 0)\n print(y)", "def eqSolve(p, a, q, b) :\n x = p - q\n y = a - b\n if x != 0 :\n z = int(y/x)\n return z\n else :\n return 1\n \ndef solve(p, q, r, a, b, c, rs) :\n if p == a and q == b and r == c :\n return rs\n elif rs>=2 :\n return 3\n else :\n res = 3\n m = 7\n adds = [a - p, b - q, c - r]\n muls = []\n if p != 0 :\n muls.append(a/p)\n if q != 0 :\n muls.append(b/q)\n if r != 0 :\n muls.append(c/r)\n muls.append(eqSolve(p, a, q, b))\n muls.append(eqSolve(p, a, r, c))\n muls.append(eqSolve(q, b, r, c))\n for n in range(m) :\n n = n + 1\n for add in adds :\n np = p\n nq = q\n nr = r\n if n & 1 > 0 :\n np = np + add\n if n & 2 > 0 :\n nq = nq + add\n if n & 4 > 0 :\n nr = nr + add\n res = min(res, solve(np, nq, nr, a, b, c, rs + 1))\n for mul in muls :\n np = p\n nq = q\n nr = r\n if n & 1 > 0 :\n np = np*mul\n if n & 2 > 0 :\n nq = nq*mul\n if n & 4 > 0 :\n nr = nr*mul\n res = min(res, solve(np, nq, nr, a, b, c, rs + 1))\n return res \n\nt = int(input())\nx = 0\nfor x in range(t) :\n p, q, r = map(int, input().split())\n a, b, c = map(int, input().split())\n y = solve(p, q, r, a, b, c, 0)\n print(y)", "for _ in range(int(input())):\n a, b, c = map(int, input().split())\n p, q, r = map(int, input().split())\n zeros = [a, b, c].count(0)\n d, e, f = p - a, q - b, r - c\n operations = 0\n if d == e == f:\n if d:\n operations = 1\n else:\n operations = 0\n elif zeros >= 2:\n if (d == e and f == 0) or (d == e == 0 and f) or (e == f and d == 0) or (e == f == 0 and d) or (f == d and e == 0) or (f == d == 0 and e):\n operations = 1\n elif d == e or e == f or f == d or d == e + f or e == d + f or f == d + e:\n operations = 2\n elif zeros == 1:\n if a == 0:\n if (d == e and f == 0) or (d == e == 0 and f) or (e == f and d == 0) or (e == f == 0 and d) or (f == d and e == 0) or (f == d == 0 and e) or (d == 0 and q // b == r // c and q % b == 0 and r % c == 0):\n operations = 1\n elif d == e or e == f or f == d or (d and q // b == r // c and q % b == 0 and r % c == 0) or d == e + f or e == d + f or f == d + e:\n operations = 2\n elif b == 0:\n if (d == e and f == 0) or (d == e == 0 and f) or (e == f and d == 0) or (e == f == 0 and d) or (f == d and e == 0) or (f == d == 0 and e) or (e == 0 and p // a == r // c and p % a == 0 and r % c == 0):\n operations = 1\n elif d == e or e == f or f == d or (e and p // a == r // c and p % a == 0 and r % c == 0) or d == e + f or e == d + f or f == d + e:\n operations = 2\n else:\n if (d == e and f == 0) or (d == e == 0 and f) or (e == f and d == 0) or (e == f == 0 and d) or (f == d and e == 0) or (f == d == 0 and e) or (f == 0 and p // a == q // b and p % a == 0 and q % b == 0):\n operations = 1\n elif d == e or e == f or f == d or (f and p // a == q // b and p % a == 0 and q % b == 0) or d == e + f or e == d + f or f == d + e:\n operations = 2\n else:\n x, y, z = p // a, q // b, r // c\n if (d == e and f == 0) or (d == e == 0 and f) or (e == f and d == 0) or (e == f == 0 and d) or (f == d and e == 0) or (f == d == 0 and e) or (x == y == z and p % a == 0 and q % b == 0 and r % c == 0) or (d == 0 and y == z and q % b == 0 and r % c == 0) or (e == 0 and x == z and p % a == 0 and r % c == 0) or (f == 0 and x == y and p % a == 0 and q % b == 0):\n operations = 1\n elif d == e or e == f or f == d or (f and x == y and p % a == 0 and q % b == 0) or (d and y == z and q % b == 0 and r % c == 0) or (e and x == z and p % a == 0 and r % c == 0) or (d == 0 and e != f and e and f) or (e == 0 and d != f and d and f) or (f == 0 and d != e and d and e) or d == e + f or e == d + f or f == d + e or (p % a == 0 and q % b == 0 and r % c == 0 and (x * y == z or y * z == x or z * x == y)):\n operations = 2\n if operations == 0:\n if d:\n operations += 1\n if e:\n operations += 1\n if f:\n operations += 1\n if operations == 3:\n try:\n u, v, w = (q * a - p * b) // (p - q), (r * b - q * c) // (q - r), (p * c - r * a) // (r - p)\n if u == v == w and (q * a - p * b) % (p - q) == 0 and (r * b - q * c) % (q - r) == 0 and (p * c - r * a) % (r - p) == 0 and p // (a + u) == q // (b + u) == r // (c + u) and p % (a + u) == 0 and q % (b + u) == 0 and r % (c + u) == 0:\n operations = 2\n except:\n pass\n if operations == 3:\n try:\n x = p // a\n if p % a == 0 and ((q % x == 0 and c + (q // x) - b == r) or (r % x == 0 and b + (r // x) - c == q)):\n operations = 2\n except:\n pass\n if operations == 3:\n try:\n x = q // b\n if q % b == 0 and ((p % x == 0 and c + (p // x) - a == r) or (r % x == 0 and a + (r // x) - c == p)):\n operations = 2\n except:\n pass\n if operations == 3:\n try:\n x = r // c\n if r % c == 0 and ((p % x == 0 and b + (p // x) - a == q) or (q % x == 0 and a + (q // x) - b == p)):\n operations = 2\n except:\n pass\n if operations == 3:\n try:\n if (q * a - p * b) % (p - q) == 0:\n u, x = (q * a - p * b) // (p - q), p // (a + u)\n if x == q // (b + u) and p % (a + u) == 0 and q % (b + u) == 0 and (c * x == r or c + u == r):\n operations = 2\n except:\n pass\n if operations == 3:\n try:\n if (r * b - q * c) % (q - r) == 0:\n v, x = (r * b - q * c) // (q - r), q // (b + v)\n if x == r // (c + v) and q % (b + v) == 0 and r % (c + v) == 0 and (a * x == p or a + v == p):\n operations = 2\n except:\n pass\n if operations == 3:\n try:\n if (p * c - r * a) % (r - p) == 0:\n w, x = (p * c - r * a) // (r - p), r // (c + w)\n if x == p // (a + w) and r % (c + w) == 0 and p % (a + w) == 0 and (b * x == q or b + w == q):\n operations = 2\n except:\n pass\n if operations == 3:\n try:\n x, y, z = (p - q) // (a - b), (q - r) // (b - c), (r - p) // (c - a)\n if x == y == z and (p - q) % (a - b) == 0 and (q - r) % (b - c) == 0 and (r - p) % (c - a) == 0 and p - a * x == q - b * y == r - c * z:\n operations = 2\n except:\n pass\n if operations == 3:\n try:\n x = p // a\n if p % a == 0 and (b * x + r - c == q or c * x + q - b == r):\n operations = 2\n except:\n pass\n if operations == 3:\n try:\n x = q // b\n if q % b == 0 and (a * x + r - c == p or c * x + p - a == r):\n operations = 2\n except:\n pass\n if operations == 3:\n try:\n x = r // c\n if r % c == 0 and (a * x + q - b == p or b * x + p - a == q):\n operations = 2\n except:\n pass\n if operations == 3:\n try:\n x = (p - q) // (a - b)\n if (p - q) % (a - b) == 0 and p - a * x == q - b * x and (c + p - a * x == r or c * x == r):\n operations = 2\n except:\n pass\n if operations == 3:\n try:\n y = (q - r) // (b - c)\n if (q - r) % (b - c) == 0 and q - b * y == r - c * y and (a + q - b * y == p or a * y == p):\n operations = 2\n except:\n pass\n if operations == 3:\n try:\n z = (r - p) // (c - a)\n if (r - p) % (c - a) == 0 and r - c * z == p - a * z and (b + r - c * z == q or b * z == q):\n operations = 2\n except:\n pass\n print(operations)", "from sys import *\ndef eq_solve(v0, v1, u0, u1):\n den = u0 - v0\n num = u1 - v1\n if den != 0:\n return num / den\n return 1\n \ndef solve(p, q, r, a, b, c, rs):\n if p == a and q == b and r == c:\n return rs\n if rs >= 2:\n return 3\n res = 3\n adds = [a - p, b - q, c - r]\n muls = []\n if p != 0:\n muls.append(a / p)\n if q != 0:\n muls.append(b / q)\n if r != 0:\n muls.append(c / r)\n muls.append(eq_solve(p, a, q, b))\n muls.append(eq_solve(p, a, r, c))\n muls.append(eq_solve(q, b, r, c))\n msks = 2 ** 3\n for msk in range(msks):\n for add in adds:\n np = p\n nq = q\n nr = r\n if (msk & 1) > 0:\n np += add\n if (msk & 2) > 0:\n nq += add\n if (msk & 4) > 0:\n nr += add\n res = min(res, solve(np, nq, nr, a, b, c, rs + 1))\n for mul in muls:\n np = p\n nq = q\n nr = r\n if (msk & 1) > 0:\n np *= mul\n if (msk & 2) > 0:\n nq *= mul\n if (msk & 4) > 0:\n nr *= mul\n res = min(res, solve(np, nq, nr, a, b, c, rs + 1))\n return res\n \nt = int(stdin.readline())\nwhile t > 0:\n p,q,r = map(int,stdin.readline().split())\n a,b,c = map(int,stdin.readline().split())\n print(solve(p,q,r,a,b,c,0))\n t -= 1", "def eq_solve(v0, v1, u0, u1):\n den = u0 - v0\n num = u1 - v1\n if den != 0:\n return num / den\n return 1\n \ndef solve(p, q, r, a, b, c, rs):\n if p == a and q == b and r == c:\n return rs\n if rs >= 2:\n return 3\n res = 3\n adds = [a - p, b - q, c - r]\n muls = []\n if p != 0:\n muls.append(a / p)\n if q != 0:\n muls.append(b / q)\n if r != 0:\n muls.append(c / r)\n muls.append(eq_solve(p, a, q, b))\n muls.append(eq_solve(p, a, r, c))\n muls.append(eq_solve(q, b, r, c))\n msks = 2 ** 3\n for msk in range(msks):\n for add in adds:\n np = p\n nq = q\n nr = r\n if (msk & 1) > 0:\n np += add\n if (msk & 2) > 0:\n nq += add\n if (msk & 4) > 0:\n nr += add\n res = min(res, solve(np, nq, nr, a, b, c, rs + 1))\n for mul in muls:\n np = p\n nq = q\n nr = r\n if (msk & 1) > 0:\n np *= mul\n if (msk & 2) > 0:\n nq *= mul\n if (msk & 4) > 0:\n nr *= mul\n res = min(res, solve(np, nq, nr, a, b, c, rs + 1))\n return res\n \n \n \nt = int(input())\n \nwhile t > 0:\n p, q, r = map(int, input().split())\n a, b, c = map(int, input().split())\n print(solve(p, q, r, a, b, c, 0))\n t -= 1 ", "import sys\r\ndef fop(s,end='\\n'): sys.stdout.write(str(s)+end)\r\ndef fip(): return sys.stdin.readline().strip()\r\nfintinp = lambda : int(fip()) \r\ndef flistinp(func= int): return list(map(func,fip().split())) \r\ndef fnsepline(n,func=str): return [func(fip()) for _ in range(n)]\r\nfrom functools import lru_cache\r\n#-------------------code------------------------\r\n@lru_cache(maxsize=1<<10)\r\ndef byeqs(pqr, abc):\r\n # f_ans = 3\r\n p,q,r = pqr\r\n a,b,c = abc\r\n # zeq = a*(r-q) + b*(p-r) + c*(q-p)\r\n # m=n=None # for y = mx + n\r\n muls = [] \r\n # if zeq==0:\r\n try:\r\n if p!=q:\r\n m_ = (a-b)//(p-q)\r\n muls.append(m_)\r\n except: pass\r\n try:\r\n if p!=r:\r\n m_ = (a-c)//(p-r)\r\n muls.append(m_)\r\n except: pass\r\n try:\r\n if q!=r:\r\n m_ = (b-c)//(q-r)\r\n muls.append(m_)\r\n except: pass\r\n return muls\r\n\r\n@lru_cache(maxsize=1<<10)\r\ndef recSolver(pqr, abc, ans = 0):\r\n if pqr == abc: return ans \r\n if ans>=2: return 3\r\n adds = [abc[i]-pqr[i] for i in range(3)]\r\n muls = [abc[i]//pqr[i] if pqr[i]!=0 else 0 for i in range(3)] + byeqs(pqr, abc)\r\n f_ans = 3 \r\n for ss in range(8):\r\n for a in adds:\r\n pqr_copy = list(pqr)\r\n for i in [1,2,4]:\r\n if ss&i:\r\n pqr_copy[i>>1]+=a \r\n f_ans = min(f_ans, recSolver(tuple(pqr_copy), tuple(abc), ans+1))\r\n \r\n for m in muls:\r\n pqr_copy = list(pqr)\r\n for i in [1,2,4]:\r\n if ss&i:\r\n pqr_copy[i>>1]*=m \r\n f_ans = min(f_ans, recSolver(tuple(pqr_copy), tuple(abc), ans+1))\r\n return f_ans\r\n \r\nfor _ in range(fintinp()):\r\n pqr = flistinp()\r\n abc = flistinp()\r\n fop(recSolver(tuple(pqr), tuple(abc), 0))", "import sys\r\ndef fop(s,end='\\n'): sys.stdout.write(str(s)+end)\r\ndef fip(): return sys.stdin.readline().strip()\r\nfintinp = lambda : int(fip()) \r\ndef flistinp(func= int): return list(map(func,fip().split())) \r\ndef fnsepline(n,func=str): return [func(fip()) for _ in range(n)]\r\nfrom functools import lru_cache\r\n#-------------------code------------------------\r\n@lru_cache(maxsize=1<<20)\r\ndef byeqs(pqr, abc):\r\n # f_ans = 3\r\n p,q,r = pqr\r\n a,b,c = abc\r\n # zeq = a*(r-q) + b*(p-r) + c*(q-p)\r\n # m=n=None # for y = mx + n\r\n muls = [] \r\n # if zeq==0:\r\n try:\r\n if p!=q:\r\n m_ = (a-b)//(p-q)\r\n muls.append(m_)\r\n except: pass\r\n try:\r\n if p!=r:\r\n m_ = (a-c)//(p-r)\r\n muls.append(m_)\r\n except: pass\r\n try:\r\n if q!=r:\r\n m_ = (b-c)//(q-r)\r\n muls.append(m_)\r\n except: pass\r\n return muls\r\n\r\n@lru_cache(maxsize=1<<20)\r\ndef recSolver(pqr, abc, ans = 0):\r\n if pqr == abc: return ans \r\n if ans>=2: return 3\r\n adds = [abc[i]-pqr[i] for i in range(3)]\r\n muls = [abc[i]//pqr[i] if pqr[i]!=0 else 0 for i in range(3)] + byeqs(pqr, abc)\r\n f_ans = 3 \r\n for ss in range(8):\r\n for a in adds:\r\n pqr_copy = list(pqr)\r\n for i in [1,2,4]:\r\n if ss&i:\r\n pqr_copy[i>>1]+=a \r\n f_ans = min(f_ans, recSolver(tuple(pqr_copy), tuple(abc), ans+1))\r\n \r\n for m in muls:\r\n pqr_copy = list(pqr)\r\n for i in [1,2,4]:\r\n if ss&i:\r\n pqr_copy[i>>1]*=m \r\n f_ans = min(f_ans, recSolver(tuple(pqr_copy), tuple(abc), ans+1))\r\n return f_ans\r\n \r\nfor _ in range(fintinp()):\r\n pqr = flistinp()\r\n abc = flistinp()\r\n fop(recSolver(tuple(pqr), tuple(abc), 0))", "import sys\r\ndef fop(s,end='\\n'): sys.stdout.write(str(s)+end)\r\ndef fip(): return sys.stdin.readline().strip()\r\nfintinp = lambda : int(fip()) \r\ndef flistinp(func= int): return list(map(func,fip().split())) \r\ndef fnsepline(n,func=str): return [func(fip()) for _ in range(n)]\r\n#-------------------code------------------------\r\ndef byeqs(pqr, abc):\r\n # f_ans = 3\r\n p,q,r = pqr\r\n a,b,c = abc\r\n # zeq = a*(r-q) + b*(p-r) + c*(q-p)\r\n # m=n=None # for y = mx + n\r\n muls = [] \r\n # if zeq==0:\r\n try:\r\n if p!=q:\r\n m_ = (a-b)//(p-q)\r\n muls.append(m_)\r\n except: pass\r\n try:\r\n if p!=r:\r\n m_ = (a-c)//(p-r)\r\n muls.append(m_)\r\n except: pass\r\n try:\r\n if q!=r:\r\n m_ = (b-c)//(q-r)\r\n muls.append(m_)\r\n except: pass\r\n return muls\r\n\r\ndef recSolver(pqr, abc, ans = 0):\r\n if pqr == abc: return ans \r\n if ans>=2: return 3\r\n adds = [abc[i]-pqr[i] for i in range(3)]\r\n muls = [abc[i]//pqr[i] if pqr[i]!=0 else 0 for i in range(3)] + byeqs(pqr, abc)\r\n f_ans = 3 \r\n for ss in range(8):\r\n for a in adds:\r\n pqr_copy = list(pqr)\r\n for i in [1,2,4]:\r\n if ss&i:\r\n pqr_copy[i>>1]+=a \r\n f_ans = min(f_ans, recSolver(pqr_copy, abc, ans+1))\r\n \r\n for m in muls:\r\n pqr_copy = list(pqr)\r\n for i in [1,2,4]:\r\n if ss&i:\r\n pqr_copy[i>>1]*=m \r\n f_ans = min(f_ans, recSolver(pqr_copy, abc, ans+1))\r\n return f_ans\r\n \r\nfor _ in range(fintinp()):\r\n pqr = flistinp()\r\n abc = flistinp()\r\n fop(recSolver(pqr, abc, 0))", "T = int(input())\r\nfor tc in range(T):\r\n p, q, r = map(int, input().split())\r\n a ,b, c = map(int, input().split())\r\n p_diff = a - p\r\n q_diff = b - q\r\n r_diff = c - r\r\n flag = 0\r\n \r\n # GCD of Three Numbers\r\n def gcd(a,b):\r\n if b == 0:\r\n return a\r\n else:\r\n return gcd(b, a%b)\r\n\r\n g_c_d = gcd(a,gcd(b,c))\r\n \r\n def factors(x):\r\n # We will store all factors in `result`\r\n result = []\r\n i = 2\r\n # This will loop from 1 to int(sqrt(x))\r\n while i*i <= x:\r\n # Check if i divides x without leaving a remainder\r\n if x % i == 0:\r\n result.append(i)\r\n # Handle the case explained in the 4th\r\n if x//i != i: # In Python, // operator performs integer/floored division\r\n result.append(x//i)\r\n i += 1\r\n # Return the list of factors of x\r\n return result\r\n listi = factors(g_c_d)\r\n \r\n try:\r\n p_rem = a / p\r\n except:\r\n p_rem = 1\r\n try:\r\n q_rem = b / q\r\n except:\r\n q_rem = 1\r\n try:\r\n r_rem = c / r\r\n except:\r\n r_rem = 1\r\n \r\n if a == p and b == q and c == r:\r\n print(\"0\")\r\n flag = 1\r\n continue\r\n elif p_rem == q_rem == r_rem != 1:\r\n print(\"1\")\r\n flag = 1\r\n continue\r\n elif p_diff == q_diff == r_diff:\r\n print(\"1\")\r\n flag = 1\r\n continue\r\n elif p == a and q == b:\r\n print(\"1\")\r\n flag = 1\r\n continue\r\n elif p == a and r == c:\r\n print(\"1\")\r\n flag = 1\r\n continue\r\n elif q == b and r == c:\r\n print(\"1\")\r\n continue\r\n elif p == a:\r\n if q_diff == r_diff:\r\n print(\"1\")\r\n flag = 1\r\n continue\r\n elif q_rem == r_rem != 1:\r\n print(\"1\")\r\n flag = 1\r\n continue\r\n else:\r\n print(\"2\")\r\n flag = 1\r\n continue\r\n elif q == b:\r\n if p_diff == r_diff:\r\n print(\"1\")\r\n flag = 1\r\n continue\r\n elif p_rem == r_rem != 1:\r\n print(\"1\")\r\n flag = 1\r\n continue\r\n else:\r\n print(\"2\")\r\n flag = 1\r\n continue\r\n elif r == c:\r\n if q_diff == p_diff:\r\n print(\"1\")\r\n flag = 1\r\n elif q_rem == p_rem != 1:\r\n print(\"1\")\r\n flag = 1\r\n continue\r\n else:\r\n print(\"2\")\r\n flag = 1\r\n elif p_diff == 0:\r\n if q_diff == r_diff:\r\n print(\"1\")\r\n flag = 1\r\n continue\r\n elif q_rem == r_rem:\r\n print(\"1\")\r\n flag = 1\r\n continue\r\n else:\r\n print(\"2\")\r\n flag = 1\r\n continue\r\n elif q_diff == 0:\r\n if p_diff == r_diff:\r\n print(\"1\")\r\n flag = 1\r\n continue\r\n elif p_rem == r_rem:\r\n print(\"1\")\r\n flag = 1\r\n continue\r\n else:\r\n print(\"2\")\r\n flag = 1\r\n continue\r\n elif r_diff == 0:\r\n if p_diff == q_diff:\r\n print(\"1\")\r\n flag = 1\r\n continue\r\n elif p_rem == q_rem:\r\n print(\"1\")\r\n flag = 1\r\n continue\r\n else:\r\n print(\"2\")\r\n flag = 1\r\n continue\r\n elif r_diff - p_diff == q_diff:\r\n print(\"2\")\r\n continue\r\n elif r_diff - q_diff == p_diff:\r\n print(\"2\")\r\n continue\r\n elif q_diff - r_diff == p_diff:\r\n print(\"2\")\r\n continue\r\n elif q_diff - p_diff == r_diff:\r\n print(\"2\")\r\n continue\r\n elif p_diff - q_diff == r_diff:\r\n print(\"2\")\r\n continue\r\n elif p_diff - r_diff == q_diff:\r\n print(\"2\")\r\n continue\r\n \r\n elif p_diff == q_diff:\r\n print(\"2\")\r\n flag = 1\r\n continue\r\n elif q_diff == r_diff:\r\n print(\"2\")\r\n flag = 1\r\n continue\r\n elif p_diff == r_diff:\r\n print(\"2\")\r\n flag = 1\r\n continue\r\n elif p_rem == q_rem and r_rem != 1:\r\n print(\"2\")\r\n flag = 1\r\n continue\r\n elif p_rem == r_rem and q_rem != 1:\r\n print(\"2\")\r\n flag = 1\r\n continue\r\n elif q_rem == r_rem and p_rem != 1:\r\n print(\"2\")\r\n flag = 1\r\n continue\r\n elif ((a // g_c_d) - p) == ((b // g_c_d) - q) == ((c // g_c_d) - r):\r\n print(\"2\")\r\n flag = 1\r\n continue\r\n if flag == 0:\r\n try:\r\n if (r_diff - b) / q == (r_diff - a) / p:\r\n print(\"2\")\r\n flag = 1\r\n continue\r\n except:\r\n if (r_diff - b) / 1 == (r_diff - a) / 1:\r\n print(\"2\")\r\n flag = 1\r\n continue\r\n try:\r\n if (q_diff - c) / r == (q_diff - a) / p:\r\n print(\"2\")\r\n flag = 1\r\n continue\r\n except:\r\n if (q_diff - c) / 1 == (q_diff - a) / 1:\r\n print(\"2\")\r\n flag = 1\r\n continue\r\n try:\r\n if (p_diff - c) / r == (p_diff - b) / q:\r\n print(\"2\")\r\n flag = 1\r\n continue\r\n except:\r\n if (p_diff - c) / 1 == (p_diff - b) / 1:\r\n print(\"2\")\r\n flag = 1\r\n continue\r\n try:\r\n if (b/ r_rem) - q == a - p:\r\n print(\"2\")\r\n flag = 1\r\n continue\r\n except:\r\n if (b/ 1) - q == a - p:\r\n print(\"2\")\r\n flag = 1\r\n continue\r\n try: \r\n if (a / r_rem) - p == b - q:\r\n print(\"2\")\r\n flag = 1\r\n continue\r\n except:\r\n if (a / 1) - p == b - q:\r\n print(\"2\")\r\n flag = 1\r\n continue\r\n try:\r\n if (b / p_rem) - q == c - r:\r\n print(\"2\")\r\n flag = 1\r\n continue\r\n except:\r\n if (b / 1) - q == c - r:\r\n print(\"2\")\r\n flag = 1\r\n continue\r\n try:\r\n if (c / p_rem) - r == b - q:\r\n print(\"2\")\r\n flag = 1\r\n continue\r\n except:\r\n if (c / 1) - r == b - q:\r\n print(\"2\")\r\n flag = 1\r\n continue\r\n try:\r\n if (c / q_rem) - r == a - p:\r\n print(\"2\")\r\n flag = 1\r\n continue\r\n except:\r\n if (c / 1) - r == a - p:\r\n print(\"2\")\r\n flag = 1\r\n continue\r\n try:\r\n if (a / q_rem) - p == c - r:\r\n print(\"2\")\r\n flag = 1\r\n continue\r\n except:\r\n if (a / 1) - p == c - r:\r\n print(\"2\")\r\n flag = 1\r\n continue\r\n \r\n if flag == 0:\r\n try:\r\n if (b - (c-r)) / q == p_rem:\r\n print(\"2\")\r\n flag = 1\r\n continue\r\n except:\r\n x = 1\r\n if (b - (c-r)) / x == p_rem:\r\n print(\"2\")\r\n flag = 1\r\n continue\r\n try:\r\n if (b - (a-p)) / q == r_rem:\r\n print(\"2\")\r\n flag = 1\r\n continue\r\n except:\r\n x = 1\r\n if (b - (a-p)) / x == r_rem:\r\n print(\"2\")\r\n flag = 1\r\n continue\r\n \r\n try:\r\n if (a - (b-q)) / p == r_rem:\r\n print(\"2\")\r\n flag = 1\r\n continue\r\n except:\r\n x = 1\r\n if (a - (b-q)) / x == r_rem:\r\n print(\"2\")\r\n flag = 1\r\n continue\r\n try:\r\n if (a - (c-r)) / p == q_rem:\r\n print(\"2\")\r\n flag = 1\r\n continue\r\n \r\n except:\r\n x = 1\r\n if (a - (c-r)) / x == q_rem:\r\n print(\"2\")\r\n flag = 1\r\n continue\r\n try:\r\n if (c - (b-q)) / r == p_rem:\r\n print(\"2\")\r\n flag = 1\r\n continue\r\n except:\r\n x = 1\r\n if (c - (b-q)) / x == p_rem:\r\n print(\"2\")\r\n flag = 1\r\n continue\r\n try:\r\n if (c - (a-p)) / r == q_rem:\r\n print(\"2\")\r\n flag = 1\r\n continue\r\n except:\r\n x = 1\r\n if (c - (a-p)) / x == q_rem:\r\n print(\"2\")\r\n flag = 1\r\n continue\r\n try:\r\n if (b / r_rem) / q == p_rem:\r\n print(\"2\")\r\n flag = 1\r\n continue\r\n except:\r\n x = 1\r\n if (b / x) / x == p_rem:\r\n print(\"2\")\r\n flag = 1\r\n continue\r\n try:\r\n if (a / r_rem) / p == q_rem:\r\n print(\"2\")\r\n flag = 1\r\n continue\r\n except:\r\n x = 1\r\n if (a / x) / x == q_rem:\r\n print(\"2\")\r\n flag = 1\r\n continue\r\n try:\r\n if (b / p_rem) / q == r_rem:\r\n print(\"2\")\r\n flag = 1\r\n continue\r\n except:\r\n x = 1\r\n if (b / x) / x == r_rem:\r\n print(\"2\")\r\n flag = 1\r\n continue\r\n try:\r\n if (c / p_rem) / r == q_rem:\r\n print(\"2\")\r\n flag = 1\r\n continue\r\n except:\r\n x = 1\r\n if (c / x) / x == q_rem:\r\n print(\"2\")\r\n flag = 1\r\n continue\r\n try:\r\n if (a / q_rem) / p == r_rem:\r\n print(\"2\")\r\n flag = 1\r\n continue\r\n except:\r\n x = 1\r\n if (a / x) / x == r_rem:\r\n print(\"2\")\r\n flag = 1\r\n continue\r\n try:\r\n if (c / q_rem) / r == p_rem:\r\n print(\"2\")\r\n flag = 1\r\n continue\r\n except:\r\n x = 1\r\n if (c / x) / x == p_rem:\r\n print(\"2\")\r\n flag = 1\r\n continue\r\n \r\n if flag == 0:\r\n try:\r\n if b / (q + (c-r)) == a / (p +(c-r)):\r\n print(\"2\")\r\n flag = 1\r\n continue\r\n except:\r\n rem1 = 1\r\n rem2 = 1\r\n if b / rem1 == a / rem2:\r\n print(\"2\")\r\n flag = 1\r\n continue\r\n \r\n try:\r\n if c / (r + (b-q)) == a / (p +(b-q)):\r\n print(\"2\")\r\n flag = 1\r\n continue\r\n except:\r\n rem1 = 1\r\n rem2 = 1\r\n if c / rem1 == a / rem2:\r\n print(\"2\")\r\n flag = 1\r\n continue\r\n \r\n try:\r\n if b / (q + (a-p)) == c / (r +(a-p)):\r\n print(\"2\")\r\n flag = 1\r\n continue\r\n except:\r\n rem1 = 1\r\n rem2 = 1\r\n if b / rem1 == c / rem2:\r\n print(\"2\")\r\n flag = 1\r\n continue\r\n \r\n \r\n if flag == 0:\r\n if(p-q != 0):\r\n rem = (a-b)/(p-q)\r\n diff = a - (p*rem)\r\n if(rem%1 == 0 and diff%1 == 0 and (r*rem+diff)==c):\r\n print(\"2\")\r\n flag = 1\r\n if flag == 0:\r\n if len(listi) > 0:\r\n for x in listi:\r\n if ((a // x) - p) == ((b // x) - q) == ((c // x) - r):\r\n print(\"2\")\r\n flag = 1\r\n if flag == 0:\r\n if a - (q_rem * p) == c - (q_rem * r):\r\n print(\"2\")\r\n flag = 1\r\n continue\r\n elif a - (r_rem * p) == b - (r_rem * q):\r\n print(\"2\")\r\n flag = 1\r\n continue\r\n elif c - (p_rem * r) == b - (p_rem * q):\r\n print(\"2\")\r\n flag = 1\r\n continue\r\n if flag == 0:\r\n print(\"3\")", "intput = lambda: [int(i) for i in input().split()]\n# Write your code here\nfrom sys import stdout\nsol = \"3332323313233322223333\"\nsubsets = ['100', '010', '001', '110', '101', '011', '111']\neq = lambda x, y: abs(x - y) < 1e-6\ndef check(x):\n if x == [9, 7, 4]:\n print(\"Debug\")\n if x == y:\n return 0\n d, q, f = [], [], []\n for i in range(3):\n d.append(y[i] - x[i])\n q.append(0.5 if x[i] == 0 else y[i] / x[i])\n f.append(q[i] % 1 == 0)\n for i in range(3):\n j, k = (i + 1) % 3, (i + 2) % 3\n if x[j] == y[j] and x[k] == y[k]:\n return 1\n if x[i] == y[i] and (d[j] == d[k] or (f[j] and eq(q[j], q[k]))):\n return 1\n if (d[0] == d[1] and d[0] == d[2]) or (f[0] and eq(q[0], q[1]) and eq(q[0], q[2])):\n return 1\n return 2\ndef move(subset, oper, d):\n res = x.copy()\n for i in range(3):\n if subset[i] == '1':\n res[i] = res[i] + d if oper else res[i] * d\n return res\nfor tc in range(int(input())):\n x = list(map(int, input().split()))\n y = list(map(int, input().split()))\n a = check(x)\n if a < 2:\n print(a)\n continue\n d, q, f = [], [], []\n for i in range(3):\n d.append(y[i] - x[i])\n q.append(0.5 if x[i] == 0 else y[i] / x[i])\n f.append(q[i] % 1 == 0)\n flag = False\n for subset in subsets:\n for i in range(3):\n a = check(move(subset, True, d[i]))\n if a < 2:\n print(2)\n flag = True\n break\n if f[i]:\n a = check(move(subset, False, q[i]))\n if a < 2:\n print(2)\n flag = True\n break\n if flag:\n break\n if flag:\n continue\n for i in range(3):\n j, k = (i + 1) % 3, (i + 2) % 3\n if x[j] != 0 and x[k] != 0 and eq((y[j] - d[i]) / x[j], (y[k] - d[i]) / x[k]) and ((y[j] - d[i]) / x[j]) % 1 == 0:\n print(2)\n flag = True\n break\n if flag:\n continue\n if x[0] != x[1] and x[0] != x[2] and eq((y[0] - y[1]) / (x[0] - x[1]), (y[0] - y[2]) / (x[0] - x[2])):\n print(2)\n continue\n print(3)", "intput = lambda: [int(i) for i in input().split()]\n# Write your code here\nfrom sys import stdout\nsol = \"3332323313233322223333\"\nsubsets = ['100', '010', '001', '110', '101', '011', '111']\neq = lambda x, y: abs(x - y) < 1e-6\ndef check(x):\n if x == [9, 7, 4]:\n print(\"Debug\")\n if x == y:\n return 0\n d, q, f = [], [], []\n for i in range(3):\n d.append(y[i] - x[i])\n q.append(0.5 if x[i] == 0 else y[i] / x[i])\n f.append(q[i] % 1 == 0)\n for i in range(3):\n j, k = (i + 1) % 3, (i + 2) % 3\n if x[j] == y[j] and x[k] == y[k]:\n return 1\n if x[i] == y[i] and (d[j] == d[k] or (f[j] and eq(q[j], q[k]))):\n return 1\n if (d[0] == d[1] and d[0] == d[2]) or (f[0] and eq(q[0], q[1]) and eq(q[0], q[2])):\n return 1\n return 2\ndef move(subset, oper, d):\n res = x.copy()\n for i in range(3):\n if subset[i] == '1':\n res[i] = res[i] + d if oper else res[i] * d\n return res\nfor tc in range(int(input())):\n x = list(map(int, input().split()))\n y = list(map(int, input().split()))\n a = check(x)\n if a < 2:\n print(a)\n continue\n d, q, f = [], [], []\n for i in range(3):\n d.append(y[i] - x[i])\n q.append(0.5 if x[i] == 0 else y[i] / x[i])\n f.append(q[i] % 1 == 0)\n flag = False\n for subset in subsets:\n for i in range(3):\n a = check(move(subset, True, d[i]))\n if a < 2:\n print(2)\n flag = True\n break\n if f[i]:\n a = check(move(subset, False, q[i]))\n if a < 2:\n print(2)\n flag = True\n break\n if flag:\n break\n if flag:\n continue\n for i in range(3):\n j, k = (i + 1) % 3, (i + 2) % 3\n if x[j] != 0 and x[k] != 0 and eq((y[j] - d[i]) / x[j], (y[k] - d[i]) / x[k]) and ((y[j] - d[i]) / x[j]) % 1 == 0:\n print(2)\n flag = True\n break\n if flag:\n continue\n if x[0] != x[1] and eq((y[0] - y[1]) / (x[0] - x[1]), (y[0] - y[2]) / (x[0] - x[2])):\n print(2)\n continue\n print(3)", "def d1d2(p,q,r,a,b,c):\r\n if p == 0 or q == 0 or r == 0:\r\n return False\r\n if a%p == 0 and b % q == 0:\r\n d1 = a//p\r\n d2 = b//q\r\n if c == r * d1 * d2:\r\n return True\r\n return False\r\n return False\r\n \r\ndef e1e2(p,q,r,a,b,c):\r\n e1 = a - p\r\n e2 = b - q\r\n return c == r + e1 + e2\r\n \r\ndef d3e3(p,q,r,a,b,c):\r\n delta = [0, 0, 0]\r\n delta[0] = p - q\r\n# print(f'1.{delta=}')\r\n if delta[0] == 0:\r\n return False\r\n # explanation:\r\n # for infinite no of sols a = b; but q = p(delta[0] == 0) sol 2 same case (already handled) not considering here\r\n delta[1] = a - b\r\n delta[2] = p*b - q*a\r\n# print(f'2.{delta=}')\r\n if delta[1] % delta[0] == 0 and delta[2] % delta[0] == 0:\r\n val_d = delta[1]//delta[0]\r\n val_e = delta[2]//delta[0]\r\n return c == r * val_d + val_e\r\n \r\n else:\r\n #e and d are not integer solutions\r\n return False\r\n \r\ndef d3e2(p,q,r,a,b,c):\r\n #assuming a,b eq has same form\r\n delta = [0, 0, 0]\r\n delta[0] = p - q\r\n if delta[0] == 0:\r\n return False\r\n # explanation:\r\n # for infinite no of sols a = b; but q = p(delta[0] == 0) sol 2 same case (already handled) not considering here\r\n delta[1] = a - b\r\n delta[2] = p*b - q*a\r\n# print(f'\u03940 = {delta[0]} \u03941 = {delta[1]} \u03942 = {delta[2]}')\r\n if delta[1] % delta[0] == 0 and delta[2] % delta[0] == 0:\r\n val_d = delta[1]//delta[0]\r\n val_e = delta[2]//delta[0]\r\n# print(f'd = {val_d} e = {val_e}')\r\n return c == r * val_d\r\n \r\n else:\r\n #e and d are not integer solutions\r\n return False\r\n \r\ndef d2e3(p,q,r,a,b,c):\r\n #assuming a,b eq has same form\r\n \r\n delta = [0, 0, 0]\r\n delta[0] = p - q\r\n if delta[0] == 0:\r\n return False\r\n # explanation:\r\n # for infinite no of sols a = b; but q = p(delta[0] == 0) sol 2 same case (already handled) not considering here\r\n delta[1] = a - b\r\n delta[2] = p*b - q*a\r\n\r\n if delta[1] % delta[0] == 0 and delta[2] % delta[0] == 0:\r\n val_d = delta[1]//delta[0]\r\n val_e = delta[2]//delta[0]\r\n return c == r + val_e\r\n \r\n else:\r\n #e and d are not integer solutions\r\n return False\r\n \r\n'''\r\ntwo case: 1. a = pd + e, b = qd + e, c = r (already handled 1 same)\r\n2. a = pd + e, b = qd, c = r + e\r\n'''\r\ndef d2e2(p,q,r,a,b,c):\r\n if q != 0 and b % q == 0:\r\n d = b//q\r\n e = c - r\r\n assert e != 0, \"already checked, one same\"\r\n return a == p*d + e\r\n return False\r\n\r\ndef e3d2(p,q,r,a,b,c):\r\n assert c!=r, \"1 same\"\r\n e = c - r\r\n if p != -e and q !=-e and a % (p + e) == 0 and b % (q + e) == 0:# p + e != 0 as then a = 0 and 1 difference case or no soln\r\n d1 = a//(p + e)\r\n d2 = b//(q + e)\r\n return d1 != 1 and d1 == d2\r\n return False\r\n \r\ndef e2d2(p,q,r,a,b,c):\r\n if r != 0 and c % r == 0:\r\n d = c//r\r\n e = b - q\r\n assert d != 1 and e != 0, '1 or 2 same'\r\n return a == (p + e) * d\r\n return False\r\n \r\ndef modified(src, dst):\r\n p,q,r = src\r\n a,b,c = dst\r\n # print(p,q,r), '-->',(a,b,c)\r\n \r\n #case 1: some are same\r\n #case 1.0: all are same then 0 chances:\r\n if p == a and q == b and r == c:\r\n print(0)\r\n return\r\n #case 1.1:if two are same\r\n # p,q\r\n if p == a and q == b:\r\n if r != c:\r\n print(1)\r\n return\r\n assert True, \"Should not have come here1\"\r\n # q,r\r\n if q == b and r == c:\r\n if p != a:\r\n print(1)\r\n return\r\n assert True, \"Should not have come here2\"\r\n # r,p\r\n if r == c and p == a:\r\n if q != b:\r\n print(1)\r\n return\r\n assert True, \"Should not have come here3\"\r\n \r\n #case 1.3 any one is same\r\n # p\r\n if p == a:\r\n if b - q == c - r:\r\n print(1)\r\n return\r\n if q != 0 and r != 0 and b%q == 0 and b%q == c%r and b//q == c//r:\r\n print(1)\r\n return\r\n print(2)\r\n return\r\n if q == b:\r\n if c - r == a - p:\r\n print(1)\r\n return\r\n if p != 0 and r != 0 and a%p == 0 and a%p == c%r and a//p == c//r:\r\n print(1)\r\n return\r\n print(2)\r\n return\r\n \r\n if r == c:\r\n if b - q == a - p:\r\n print(1)\r\n return\r\n if p != 0 and q != 0 and a%p == 0 and a%p == b%q and a//p == b//q:\r\n print(1)\r\n return\r\n print(2)\r\n return \r\n #case 2: all are different\r\n #case 2.1: all are at same difference : 2 same ratio/ difference\r\n if p-a == q-b and q-b == r-c:\r\n print(1)\r\n return\r\n #or at same ratio\r\n if p!=0 and q!= 0 and r!=0:\r\n if a%p == 0 and a%p == b%q and b%q == c%r:\r\n if a//p == b//q and b//q == c//r:\r\n print(1)\r\n return\r\n #if any two has same difference or ratio\r\n #case 2.2: 1 same ratio/difference\r\n # p,q\r\n if p-a == q-b :\r\n print(2)\r\n return\r\n if p!=0 and q!=0 and a%p == 0 and a%p == b%q and a//p == b//q:\r\n print(2)\r\n return\r\n # q,r\r\n if r-c == q-b :\r\n print(2)\r\n return\r\n if r!=0 and q!=0 and c%r == 0 and c%r == b%q and c//r == b//q:\r\n print(2)\r\n return \r\n \r\n # r,p\r\n if p-a == r-c :\r\n print(2)\r\n return\r\n if p!=0 and r!=0 and a%p == 0 and a%p == c%r and a//p == c//r:\r\n print(2)\r\n return\r\n \r\n \r\n #case 3: nothing is same no two has same difference or ration\r\n #case 3.0: pd1 qd2 rd1d2 form\r\n if d1d2(p,q,r,a,b,c) or d1d2(q,r,p,b,c,a) or d1d2(r,p,q,c,a,b):\r\n print(2)\r\n return\r\n #case 3.1: p + e1 q + e2 r + e1 + e2 form\r\n if e1e2(p,q,r,a,b,c) or e1e2(q,r,p,b,c,a) or e1e2(r,p,q,c,a,b):\r\n print(2)\r\n return\r\n #case 3.2: pd + e forms\r\n #case 3.2.1: 3d3e\r\n if d3e3(p,q,r,a,b,c):\r\n print(2)\r\n return\r\n #case 3.2.2: 3d2e\r\n if d3e2(p,q,r,a,b,c) or d3e2(q,r,p,b,c,a) or d3e2(r,p,q,c,a,b):\r\n print(2)\r\n return\r\n \r\n #case 3.2.3: 2d3e\r\n if d2e3(p,q,r,a,b,c) or d2e3(q,r,p,b,c,a) or d2e3(r,p,q,c,a,b):\r\n print(2)\r\n return\r\n if d2e2(p,q,r,a,b,c) or d2e2(q,r,p,b,c,a) or d2e2(r,p,q,c,a,b) or d2e2(p,r,q,a,c,b) or d2e2(q,p,r,b,a,c) or d2e2(r,q,p,c,b,a):\r\n print(2)\r\n return\r\n if e3d2(p,q,r,a,b,c) or e3d2(q,r,p,b,c,a) or e3d2(r,p,q,c,a,b):\r\n print(2)\r\n return\r\n if e2d2(p,q,r,a,b,c) or e2d2(q,r,p,b,c,a) or e2d2(r,p,q,c,a,b) or e2d2(p,r,q,a,c,b) or e2d2(q,p,r,b,a,c) or e2d2(r,q,p,c,b,a):\r\n print(2)\r\n return\r\n print(3)\r\n \r\nfor _ in range(int(input())):\r\n src = tuple(map(int, input().split()))\r\n dst = tuple(map(int, input().split()))\r\n modified(src, dst)\r\n # print(modified(src, dst))", "def aa22(p,q,r,a,b,c):\n if(q+a-p+c-r == b):\n return 1\n else:\n return 0\ndef aa21(p,q,r,a,b,c):\n if(p-q==a-b):\n return 1\n else:\n return 0\ndef as22(p,q,r,a,b,c):\n if((p+b-c+r-q)==a):\n return 1\n else:\n return 0\ndef am22(p,q,r,a,b,c):\n if(r!=0 and c!=0 and c%r==0 and (b*r)%c==0 and ((b*r)//c)-q==(a-p)):\n return 1\n else:\n return 0\ndef am21(p,q,r,a,b,c):\n if((r!=0) and c%r==0 and (p-q)==(a-b)):\n return 1\n else:\n return 0\ndef am23(p,q,r,a,b,c):\n if((r!=0) and (c!=0) and (c%r)==0 and (b*r)%c==0 and (a*r)%c==0 and ((a*r)//c)-p==((b*r)//c)-q):\n return 1\n else:\n return 0\ndef am32(p,q,r,a,b,c):\n if((q+c-r)!=0 and (p+c-r)!=0 and (b//(q+c-r))==(a//(p+c-r)) and b%(q+c-r)==0 and a%(p+c-r)==0):\n return 1\n else:\n return 0\ndef ma33(p,q,r,a,b,c):\n if((p-q)!=0 and ((b*p)-(a*q))%(p-q)==0 and (q-r)!=0 and p!=0 and ((c*q)-(b*r))%(q-r)==0 and ((b*p)-(a*q))//(p-q)==((c*q)-(b*r))//(q-r) and (a-(((b*p)-(a*q))//(p-q)))%p==0):\n return 1\n else:\n return 0\ndef am33(p,q,r,a,b,c):\n if((a-b)!=0 and ((b*p)-(a*q))%(a-b)==0 and (b-c)!=0 and ((c*q)-(b*r))%(b-c)==0 and ((b*p)-(a*q))//(a-b)==((c*q)-(b*r))//(b-c) and (p+(((b*p)-(a*q))//(a-b)))!=0 and a%(p+(((b*p)-(a*q))//(a-b)))==0):\n return 1\n else:\n return 0\ndef ma22(p,q,r,a,b,c):\n if((p!=0) and q!=0 and (a%p)==0 and (b-c+r)%q==0 and (a//p)==((b-c+r)//q)):\n return 1\n else:\n return 0\ndef ma21(p,q,r,a,b,c):\n if((p!=0) and (q!=0) and (a%p)==0 and (b%q)==0 and (a//p)==(b//q)):\n return 1\n else:\n return 0\ndef ma23(p,q,r,a,b,c):\n if((q!=0) and (p!=0) and (b-c+r)%q==0 and (a-c+r)%p==0 and ((b-c+r)//q)==((a-c+r)//p)):\n return 1\n else:\n return 0\ndef ma32(p,q,r,a,b,c):\n if(r!=0 and (q*c)%r==0 and (p*c)%r==0 and b-((q*c)//r)==a-((p*c)//r) and (c%r)==0):\n return 1\n else:\n return 0\ndef ms22(p,q,r,a,b,c):\n if((q!=0) and (p!=0) and ((b+r-c)%q)==0 and (a%p)==0 and ((b+r-c)//q)==(a//p)):\n return 1\n else:\n return 0\ndef mm22(p,q,r,a,b,c):\n if((q*c)!=0 and (b*r)%(q*c)==0 and (p!=0) and a%p==0 and (a//p)==((b*r)//(q*c))):\n return 1\n else:\n return 0\ndef mm21(p,q,r,a,b,c):\n if((r!=0) and (c%r==0) and (q!=0) and (p!=0) and (b//q)==(a//p) and (b%q)==0 and (a%p)==0):\n return 1\n else:\n return 0\ndef sa22(p,q,r,a,b,c):\n if((q-b+c-r)==(p-a)):\n return 1\n else:\n return 0\ndef sa21(p,q,r,a,b,c):\n if((p-a)==(q-b)):\n return 1\n else:\n return 0\ndef sm32(p,q,r,a,b,c):\n if((q-r+c)!=0 and (p-r+c)!=0 and (b//(q-r+c))==(a//(p-r+c)) and b%(q-r+c)==0 and a%(p-r+c)==0):\n return 1\n else:\n return 0\ndef as2(q,r,b,c):\n if((q-r) == (b-c)):\n return 1\n else:\n return 0\ndef m2(q,r,b,c):\n if(r!=0 and q!=0 and (b//q)==(c//r) and (b%q)==0 and (c%r)==0):\n return 1\n else:\n return 0\ndef as3(p,q,r,a,b,c):\n if(p-q == a-b and q-r == b-c and p-r == a-c):\n return 1\n else:\n return 0\ndef m3(p,q,r,a,b,c):\n if(q!=0 and r!=0 and p!=0 and (a//p)==(b//q) and (b//q)==(c//r) and (a%p)==0 and (b%q)==0 and c%r==0):\n return 1\n else:\n return 0\nt=int(input())\nwhile(t>0):\n p,q,r=map(int,input().split())\n a,b,c=map(int,input().split())\n l=[]\n d=[]\n l3=[]\n l.append(p)\n l.append(q)\n l.append(r)\n l.append(p)\n l.append(r)\n l.append(q)\n l.append(q)\n l.append(p)\n l.append(r)\n l.append(q)\n l.append(r)\n l.append(p)\n l.append(r)\n l.append(p)\n l.append(q)\n l.append(r)\n l.append(q)\n l.append(p)\n l3.append(a)\n l3.append(b)\n l3.append(c)\n l3.append(a)\n l3.append(c)\n l3.append(b)\n l3.append(b)\n l3.append(a)\n l3.append(c)\n l3.append(b)\n l3.append(c)\n l3.append(a)\n l3.append(c)\n l3.append(a)\n l3.append(b)\n l3.append(c)\n l3.append(b)\n l3.append(a)\n l2=[]\n l4=[]\n if(p==a):\n l2.append(q)\n l2.append(r)\n l4.append(b)\n l4.append(c)\n if(q==b):\n l2.append(p)\n l2.append(r)\n l4.append(a)\n l4.append(c)\n if(r==c):\n l2.append(p)\n l2.append(q)\n l4.append(a)\n l4.append(b)\n sol=0\n ans=0\n cnt=(p==a)+(q==b)+(r==c)\n if(p==a and q==b and r==c):\n ans=4\n elif(cnt==2):\n ans=1\n else:\n if(cnt==1):\n for i in range(0,2,2):\n sol=as2(l2[i],l2[i+1],l4[i],l4[i+1])\n if(sol==1):\n break\n sol=m2(l2[i],l2[i+1],l4[i],l4[i+1])\n if(sol==1):\n break\n if(sol==1):\n ans=1\n sol=0\n else:\n ans=2\n elif(cnt==0 and ans==0):\n sol=as3(p,q,r,a,b,c)\n if(sol==1):\n ans=1\n sol=m3(p,q,r,a,b,c)\n if(sol==1):\n ans=1\n sol=0\n for i in range(0,16,3):\n if(ans!=0):\n break\n sol=aa22(l[i],l[i+1],l[i+2],l3[i],l3[i+1],l3[i+2])\n if(sol==1):\n break\n sol=aa21(l[i],l[i+1],l[i+2],l3[i],l3[i+1],l3[i+2])\n if(sol==1):\n break\n sol=as22(l[i],l[i+1],l[i+2],l3[i],l3[i+1],l3[i+2])\n if(sol==1):\n break\n sol=am22(l[i],l[i+1],l[i+2],l3[i],l3[i+1],l3[i+2])\n if(sol==1):\n break\n sol=am21(l[i],l[i+1],l[i+2],l3[i],l3[i+1],l3[i+2])\n if(sol==1):\n break\n sol=am23(l[i],l[i+1],l[i+2],l3[i],l3[i+1],l3[i+2])\n if(sol==1):\n break\n sol=am32(l[i],l[i+1],l[i+2],l3[i],l3[i+1],l3[i+2])\n if(sol==1):\n break\n sol=ma33(l[i],l[i+1],l[i+2],l3[i],l3[i+1],l3[i+2])\n if(sol==1):\n break\n sol=am33(l[i],l[i+1],l[i+2],l3[i],l3[i+1],l3[i+2])\n if(sol==1):\n break\n sol=ma22(l[i],l[i+1],l[i+2],l3[i],l3[i+1],l3[i+2])\n if(sol==1):\n break\n sol=ma21(l[i],l[i+1],l[i+2],l3[i],l3[i+1],l3[i+2])\n if(sol==1):\n break\n sol=ma23(l[i],l[i+1],l[i+2],l3[i],l3[i+1],l3[i+2])\n if(sol==1):\n break\n sol=ma32(l[i],l[i+1],l[i+2],l3[i],l3[i+1],l3[i+2])\n if(sol==1):\n break\n sol=ms22(l[i],l[i+1],l[i+2],l3[i],l3[i+1],l3[i+2])\n if(sol==1):\n break\n sol=mm22(l[i],l[i+1],l[i+2],l3[i],l3[i+1],l3[i+2])\n if(sol==1):\n break\n sol=mm21(l[i],l[i+1],l[i+2],l3[i],l3[i+1],l3[i+2])\n if(sol==1):\n break\n sol=sa22(l[i],l[i+1],l[i+2],l3[i],l3[i+1],l3[i+2])\n if(sol==1):\n break\n sol=sm32(l[i],l[i+1],l[i+2],l3[i],l3[i+1],l3[i+2])\n if(sol==1):\n break\n if(sol==1 and ans==0):\n ans=2\n elif(ans==0 and sol!=1):\n ans=3\n if(ans==4):\n print(\"0\")\n else:\n print(ans)\n t=t-1", "def checkpoint1(p,q,r,a,b,c):\r\n if p==a and b-q==c-r :\r\n return True\r\n if q==b and a-p==c-r :\r\n return True\r\n if c==r and a-p==b-q:\r\n return True\r\n if p==a and q==b :\r\n return True\r\n if p==a and c==r :\r\n return True\r\n if c==r and b==q :\r\n return True\r\n if a-p==b-q and a-p==c-r :\r\n return True\r\n if q!=0 and r!=0 and b%q==0 and c%r==0 and p==a and b/q==c/r :\r\n return True\r\n if p!=0 and r!=0 and a%p==0 and c%r==0 and q==b and a/p==c/r :\r\n return True\r\n if p!=0 and q!=0 and a%p==0 and b%q==0 and c==r and a/p==b/q :\r\n return True \r\n if p!=0 and q!=0 and r!=0 and a%p==0 and b%q==0 and c%r==0 and a/p==b/q and a/p==c/r:\r\n return True \r\n return False\r\ndef checkpoint2(p,q,r,a,b,c):\r\n x1=a-p\r\n y1=b-q\r\n z1=c-r\r\n if p==a or q==b or r==c :\r\n return True\r\n if a-p==b-q or b-q==c-r or c-r==a-p :\r\n return True\r\n if p!=0 and q!=0 and ( a%p==0 and b%q==0 ) and ( a/p==b/q ) :\r\n return True\r\n if p!=0 and r!=0 and ( a%p==0 and c%r==0 ) and ( a/p==c/r ) :\r\n return True\r\n if q!=0 and r!=0 and ( b%q==0 and c%r==0 ) and ( b/q==c/r ) :\r\n return True\r\n if p!=0 and q!=0 and r!=0 and a%p==0 and b%q==0 and c%r==0 and ( a/p*b/q==c/r or a/p*c/r==b/q or b/q*c/r==a/p ) :\r\n return True\r\n if x1+y1==z1 or x1+z1==y1 or y1+z1==x1 :\r\n return True\r\n if (q+x1)!=0 and r!=0 and b%(q+x1)==0 and c%r==0 and b/(q+x1)==c/r :\r\n return True\r\n if p!=0 and a%p==0 and b-(q*a/p)==c-r :\r\n return True\r\n if (q+z1)!=0 and p!=0 and b%(q+z1)==0 and a%p==0 and b/(q+z1)==a/p:\r\n return True\r\n if r!=0 and c%r==0 and b-(q*c/r)==a-p :\r\n return True\r\n if (p+y1)!=0 and r!=0 and a%(p+y1)==0 and c%r==0 and a/(p+y1)==c/r :\r\n return True\r\n if q!=0 and b%q==0 and a-(p*b/q)==c-r :\r\n return True\r\n if (p+z1)!=0 and q!=0 and a%(p+z1)==0 and b%q==0 and a/(p+z1)==b/q :\r\n return True\r\n if r!=0 and c%r==0 and a-(p*c/r)==b-q :\r\n return True\r\n if (r+y1)!=0 and p!=0 and c%(r+y1)==0 and a%p==0 and c/(r+y1)==a/p :\r\n return True\r\n if q!=0 and b%q==0 and c-(r*b/q )==a-p :\r\n return True\r\n if (r+x1)!=0 and q!=0 and c%(r+x1)==0 and b%q==0 and c/(r+x1)==b/q :\r\n return True\r\n if p!=0 and a%p==0 and c-(r*a/p)==b-q :\r\n return True\r\n if (p+z1)!=0 and (q+z1)!=0 and a%(p+z1)==0 and b%(q+z1)==0 and a/(p+z1)==b/(q+z1) :\r\n return True\r\n if r!=0 and c%r==0 and a-(p*c/r)==b-(q*c/r) :\r\n return True\r\n if (p+y1)!=0 and (r+y1)!=0 and a%(p+y1)==0 and c%(r+y1)==0 and a/(p+y1)==c/(r+y1) :\r\n return True\r\n if q!=0 and b%q==0 and a-(p*b/q)==c-(r*b/q) :\r\n return True\r\n if (q+x1)!=0 and (r+x1)!=0 and b%(q+x1)==0 and c%(r+x1)==0 and b/(q+x1)==c/(r+x1) :\r\n return True\r\n if p!=0 and a%p==0 and b-(q*a/p)==c-(r*a/p) :\r\n return True\r\n if r!=0 and c%r==0 and c/r!=0 and a%(c/r)==0 and b%(c/r)==0 and a/(c/r)-p==b/(c/r)-q :\r\n return True\r\n if p!=0 and q!=0 and (a-z1)%p==0 and (b-z1)%q==0 and (a-z1)/p==(b-z1)/q :\r\n return True\r\n if q!=0 and b%q==0 and b/q!=0 and a%(b/q)==0 and c%(b/q)==0 and a/(b/q)-p==c/(b/q)-r : \r\n return True\r\n if p!=0 and r!=0 and (a-y1)%p==0 and (c-y1)%r==0 and (a-y1)/p==(c-y1)/r :\r\n return True\r\n if p!=0 and a%p==0 and a/p!=0 and b%(a/p)==0 and c%(a/p)==0 and b/(a/p)-q==c/(a/p)-r : \r\n return True\r\n if q!=0 and r!=0 and (b-x1)%q==0 and (c-x1)%r==0 and (b-x1)/q==(c-x1)/r :\r\n return True \r\n if (q-p)!=0 and (r-q)!=0 and (b-a)%(q-p)==0 and (c-b)%(r-q)==0 and (b-a)/(q-p)==(c-b)/(r-q):\r\n return True\r\n return False\r\ntest=int(input())\r\nfor _ in range(test):\r\n x1,y1,z1=[int(x) for x in input().split()]\r\n a,b,c=[int(x) for x in input().split()]\r\n if a==x1 and b==y1 and c==z1:\r\n print(0)\r\n elif checkpoint1(x1,y1,z1,a,b,c):\r\n print(1)\r\n elif checkpoint2(x1,y1,z1,a,b,c):\r\n print(2)\r\n else:\r\n print(3)", "def checkpoint1(p,q,r,a,b,c):\r\n if p==a and b-q==c-r :\r\n return True\r\n if q==b and a-p==c-r :\r\n return True\r\n if c==r and a-p==b-q:\r\n return True\r\n if p==a and q==b :\r\n return True\r\n if p==a and c==r :\r\n return True\r\n if c==r and b==q :\r\n return True\r\n if a-p==b-q and a-p==c-r :\r\n return True\r\n if q!=0 and r!=0 and b%q==0 and c%r==0 and p==a and b/q==c/r :\r\n return True\r\n if p!=0 and r!=0 and a%p==0 and c%r==0 and q==b and a/p==c/r :\r\n return True\r\n if p!=0 and q!=0 and a%p==0 and b%q==0 and c==r and a/p==b/q :\r\n return True \r\n if p!=0 and q!=0 and r!=0 and a%p==0 and b%q==0 and c%r==0 and a/p==b/q and a/p==c/r:\r\n return True \r\n return False\r\ndef checkpoint2(p,q,r,a,b,c):\r\n x1=a-p\r\n y1=b-q\r\n z1=c-r\r\n if p==a or q==b or r==c :\r\n return True\r\n if a-p==b-q or b-q==c-r or c-r==a-p :\r\n return True\r\n if p!=0 and q!=0 and ( a%p==0 and b%q==0 ) and ( a/p==b/q ) :\r\n return True\r\n if p!=0 and r!=0 and ( a%p==0 and c%r==0 ) and ( a/p==c/r ) :\r\n return True\r\n if q!=0 and r!=0 and ( b%q==0 and c%r==0 ) and ( b/q==c/r ) :\r\n return True\r\n if p!=0 and q!=0 and r!=0 and a%p==0 and b%q==0 and c%r==0 and ( a/p*b/q==c/r or a/p*c/r==b/q or b/q*c/r==a/p ) :\r\n return True\r\n if x1+y1==z1 or x1+z1==y1 or y1+z1==x1 :\r\n return True\r\n if (q+x1)!=0 and r!=0 and b%(q+x1)==0 and c%r==0 and b/(q+x1)==c/r :\r\n return True\r\n if p!=0 and a%p==0 and b-(q*a/p)==c-r :\r\n return True\r\n if (q+z1)!=0 and p!=0 and b%(q+z1)==0 and a%p==0 and b/(q+z1)==a/p:\r\n return True\r\n if r!=0 and c%r==0 and b-(q*c/r)==a-p :\r\n return True\r\n if (p+y1)!=0 and r!=0 and a%(p+y1)==0 and c%r==0 and a/(p+y1)==c/r :\r\n return True\r\n if q!=0 and b%q==0 and a-(p*b/q)==c-r :\r\n return True\r\n if (p+z1)!=0 and q!=0 and a%(p+z1)==0 and b%q==0 and a/(p+z1)==b/q :\r\n return True\r\n if r!=0 and c%r==0 and a-(p*c/r)==b-q :\r\n return True\r\n if (r+y1)!=0 and p!=0 and c%(r+y1)==0 and a%p==0 and c/(r+y1)==a/p :\r\n return True\r\n if q!=0 and b%q==0 and c-(r*b/q )==a-p :\r\n return True\r\n if (r+x1)!=0 and q!=0 and c%(r+x1)==0 and b%q==0 and c/(r+x1)==b/q :\r\n return True\r\n if p!=0 and a%p==0 and c-(r*a/p)==b-q :\r\n return True\r\n if (p+z1)!=0 and (q+z1)!=0 and a%(p+z1)==0 and b%(q+z1)==0 and a/(p+z1)==b/(q+z1) :\r\n return True\r\n if r!=0 and c%r==0 and a-(p*c/r)==b-(q*c/r) :\r\n return True\r\n if (p+y1)!=0 and (r+y1)!=0 and a%(p+y1)==0 and c%(r+y1)==0 and a/(p+y1)==c/(r+y1) :\r\n return True\r\n if q!=0 and b%q==0 and a-(p*b/q)==c-(r*b/q) :\r\n return True\r\n if (q+x1)!=0 and (r+x1)!=0 and b%(q+x1)==0 and c%(r+x1)==0 and b/(q+x1)==c/(r+x1) :\r\n return True\r\n if p!=0 and a%p==0 and b-(q*a/p)==c-(r*a/p) :\r\n return True\r\n if r!=0 and c%r==0 and c/r!=0 and a%(c/r)==0 and b%(c/r)==0 and a/(c/r)-p==b/(c/r)-q :\r\n return True\r\n if p!=0 and q!=0 and (a-z1)%p==0 and (b-z1)%q==0 and (a-z1)/p==(b-z1)/q :\r\n return True\r\n if q!=0 and b%q==0 and b/q!=0 and a%(b/q)==0 and c%(b/q)==0 and a/(b/q)-p==c/(b/q)-r : \r\n return True\r\n if p!=0 and r!=0 and (a-y1)%p==0 and (c-y1)%r==0 and (a-y1)/p==(c-y1)/r :\r\n return True\r\n if p!=0 and a%p==0 and a/p!=0 and b%(a/p)==0 and c%(a/p)==0 and b/(a/p)-q==c/(a/p)-r : \r\n return True\r\n if q!=0 and r!=0 and (b-x1)%q==0 and (c-x1)%r==0 and (b-x1)/q==(c-x1)/r :\r\n return True \r\n if (q-p)!=0 and (r-q)!=0 and (b-a)%(q-p)==0 and (c-b)%(r-q)==0 and (b-a)/(q-p)==(c-b)/(r-q):\r\n return True\r\n return False\r\ntest=int(input())\r\nfor _ in range(test):\r\n x1,y1,z1=[int(x) for x in input().split()]\r\n a,b,c=[int(x) for x in input().split()]\r\n if a==x1 and b==y1 and c==z1:\r\n print(0)\r\n elif checkpoint1(x1,y1,z1,a,b,c):\r\n print(1)\r\n elif checkpoint2(x1,y1,z1,a,b,c):\r\n print(2)\r\n else:\r\n print(3)", "t=int(input())\nwhile t>0:\n li1=[int(i) for i in input().split()]\n li2=[int(i) for i in input().split()]\n s1=set()\n s2=set()\n val,ans=0,3\n for i in range(3):\n if li1[i]==li2[i]:\n val+=1\n if val==3:\n ans=0\n elif val==2:\n ans=1\n else:\n for i in range(3):\n if li2[i]-li1[i]!=0:\n s1.add(li2[i]-li1[i])\n if li1[i]!=0 and li2[i]%li1[i]==0 and li2[i]//li1[i]!=1:\n s2.add(li2[i]//li1[i])\n temp=[]\n for i in s1:\n for j in range(7):\n temp=[li1[k] for k in range(3)]\n if j==0:\n temp[0]+=i\n temp[1]+=i\n elif j==1:\n temp[0]+=i\n temp[2]+=i\n elif j==2:\n temp[1]+=i\n temp[2]+=i\n elif j==3:\n temp[0]+=i\n temp[1]+=i\n temp[2]+=i\n elif j==4:\n temp[0]+=i\n elif j==5:\n temp[1]+=i\n elif j==6:\n temp[2]+=i\n a=0\n for k in range(3):\n if temp[k]==li2[k]:\n a+=1\n if a==3:\n ans=1\n if a==2:\n ans=min(ans,2)\n s3=set()\n for k in range(3):\n if temp[k]!=0 and li2[k]%temp[k]==0 and li2[k]//temp[k]!=1:\n s3.add(li2[k]//temp[k])\n temp1=[]\n for k in s3:\n for l in range(7):\n temp1=[temp[m] for m in range(3)]\n if l==0:\n temp1[0]*=k\n temp1[1]*=k\n elif l==1:\n temp1[0]*=k\n temp1[2]*=k\n elif l==2:\n temp1[1]*=k\n temp1[2]*=k\n elif l==3:\n temp1[0]*=k\n temp1[1]*=k\n temp1[2]*=k\n elif l==4:\n temp1[0]*=k\n elif l==5:\n temp1[1]*=k\n elif l==6:\n temp1[2]*=k\n for m in range(3):\n if li2[m]!=temp1[m]:\n break\n if m==2:\n ans=min(ans,2)\n s4=set()\n for k in range(3):\n if li2[k]-temp[k]!=0:\n s4.add(li2[k]-temp[k])\n temp2=[]\n for k in s4:\n for l in range(7):\n temp2=[temp[m] for m in range(3)]\n if l==0:\n temp2[0]+=k\n temp2[1]+=k\n elif l==1:\n temp2[0]+=k\n temp2[2]+=k\n elif l==2:\n temp2[1]+=k\n temp2[2]+=k\n elif l==3:\n temp2[0]+=k\n temp2[1]+=k\n temp2[2]+=k\n elif l==4:\n temp2[0]+=k\n elif l==5:\n temp2[1]+=k\n elif l==6:\n temp2[2]+=k\n for m in range(3):\n if li2[m]!=temp2[m]:\n break\n if m==2:\n ans=min(ans,2)\n s4.clear()\n count=0\n for k in range(3):\n var=li2[k]-i\n if li1[k]!=0 and var%li1[k]==0:\n if var//li1[k]!=1:\n s4.add(var//li1[k])\n count+=1\n if len(s4)==1 and count==3:\n ans=min(ans,2)\n if ans==3 or ans==2:\n d1=li2[2]-li2[1]\n d2=li2[1]-li2[0]\n d3=li1[2]-li1[1]\n d4=li1[1]-li1[0]\n d5=li2[2]-li2[0]\n d6=li1[2]-li1[0]\n if (d3!=0 and d4!=0 and d6!=0 and d1%d3==0 and d2%d4==0 and d5%d6==0 and d1//d3==d2//d4 and d1//d3==d5//d6):\n ans=min(ans,2)\n for i in s2:\n s3=set()\n count=0\n for j in range(3):\n temp[j]=li2[j]\n if i!=0 and temp[j]%i==0:\n temp[j]//=i\n temp[j]-=li1[j]\n if temp[j]!=0:\n s3.add(temp[j])\n count+=1\n \n if len(s3)==1 and count==3:\n ans=min(ans,2)\n for i in s2:\n for j in range(7):\n temp=[li1[k] for k in range(3)]\n if j==0:\n temp[0]*=i\n temp[1]*=i\n elif j==1:\n temp[0]*=i\n temp[2]*=i\n elif j==2:\n temp[1]*=i\n temp[2]*=i\n elif j==3:\n temp[0]*=i\n temp[1]*=i\n temp[2]*=i\n elif j==4:\n temp[0]*=i\n elif j==5:\n temp[1]*=i\n elif j==6:\n temp[2]*=i\n a=0\n for k in range(3):\n if temp[k]==li2[k]:\n a+=1\n if a==3:\n ans=1\n elif a==2:\n ans=min(ans,2)\n temp2=[]\n s4=set()\n for k in range(3):\n if temp[k]!=0 and li2[k]%temp[k]==0 and li2[k]//temp[k]!=1:\n s4.add(li2[k]//temp[k])\n temp2=[]\n for k in s4:\n for l in range(7):\n temp2=[temp[m] for m in range(3)]\n if l==0:\n temp2[0]*=k\n temp2[1]*=k\n elif l==1:\n temp2[0]*=k\n temp2[2]*=k\n elif l==2:\n temp2[1]*=k\n temp2[2]*=k\n elif l==3:\n temp2[0]*=k\n temp2[1]*=k\n temp2[2]*=k\n elif l==4:\n temp2[0]*=k\n elif l==5:\n temp2[1]*=k\n elif l==6:\n temp2[2]*=k\n for m in range(3):\n if li2[m]!=temp2[m]:\n break\n if m==2:\n ans=min(ans,2)\n s4.clear()\n for k in range(3):\n var=li2[k]-temp[k]\n if var!=0:\n s4.add(var)\n if len(s4)==1:\n ans=min(ans,2)\n print(ans)\n t-=1\n", "def util(x1, x2, y1, y2):\r\n d = x1 - y1\r\n n = x2 - y2\r\n if d and not n%d:\r\n return n//d\r\n return 1\r\n\r\ndef solve(p, q, r, a, b, c, res=0):\r\n if p == a and q == b and r == c:\r\n return res\r\n if res >= 2:\r\n return 3\r\n adds = [a-p, b-q, c-r]\r\n muls = []\r\n if p and not a%p:\r\n muls += [a//p]\r\n if q and not b%q:\r\n muls += [b//q]\r\n if r and not c%r:\r\n muls += [c//r]\r\n muls.append(util(p, a, q, b))\r\n muls.append(util(p, a, r, c))\r\n muls.append(util(q, b, r, c))\r\n mask = 2**3\r\n ans = 3\r\n for msk in range(1, mask):\r\n for add in adds:\r\n np, nq, nr = p, q, r\r\n if msk & 1:\r\n np += add\r\n if msk & 2:\r\n nq += add\r\n if msk & 4:\r\n nr += add\r\n ans = min(ans, solve(np, nq, nr, a, b, c, res+1))\r\n for mul in muls:\r\n np, nq, nr = p, q, r\r\n if msk & 1:\r\n np *= mul\r\n if msk & 2:\r\n nq *= mul\r\n if msk & 4:\r\n nr *= mul\r\n ans = min(ans, solve(np, nq, nr, a, b, c, res+1))\r\n return ans\r\n\r\ndef main():\r\n t = int(input())\r\n for i in range(t):\r\n p, q, r = map(int, input().split())\r\n a, b, c = map(int, input().split())\r\n print(solve(p, q, r, a, b, c))\r\n\r\ndef __starting_point():\r\n main()\r\n\n__starting_point()"]

{"inputs": [["2", "3 5 7", "6 5 10", "8 6 3", "9 7 8", ""]], "outputs": [["1", "2"]]}

INTERVIEW

PYTHON3

CODECHEF

76,040

c404e8295424718589824a366f309b2d

UNKNOWN

Johnny was asked by his math teacher to compute nn (n to the power of n, where n is an integer), and has to read his answer out loud. This is a bit of a tiring task, since the result is probably an extremely large number, and would certainly keep Johnny occupied for a while if he were to do it honestly. But Johnny knows that the teacher will certainly get bored when listening to his answer, and will sleep through most of it! So, Johnny feels he will get away with reading only the first k digits of the result before the teacher falls asleep, and then the last k digits when the teacher wakes up. Write a program to help Johnny to compute the digits he will need to read out. -----Input----- The first line contains t, the number of test cases (about 30000). Then t test cases follow. Each test case consists of one line containing two numbers n and k (1 ≤ n ≤ 109, 1 ≤ k ≤ 9). It is guaranteed that k is not more than the number of digits of nn. -----Output----- For each test case, print out one line containing two numbers, separated by a space, which are the first and the last k digits of nn. -----Example----- Input 2 4 2 9 3 Output 25 56 387 489

["from math import log10\nfrom decimal import Decimal\ndef solve(n,k):\n \n mod=10**k\n x=Decimal(n)\n y=x*(x.log10())%1\n p=str(pow(10,y))\n c=0\n first=''\n for v in p:\n if c==k:\n break\n if v==\".\":\n continue\n first+=v\n c+=1\n last=str(pow(n,n,mod)).zfill(k)\n return (first,last)\nqueries=[]\nfor _ in range(int(input())):\n n,k=list(map(int,input().split( )))\n queries.append((n,k))\nfor n,k in queries:\n print(\"%s %s\"%(solve(n,k)))\n \n \n", "from decimal import *\ndef firstkdigits(n, k): \n n = Decimal(n)\n product = n *(n.log10());\n decimal_part = product%1; \n d = pow(10, decimal_part + k -1); \n return str(int(d))\nfor _ in range(int(input())):\n n,k = map(int,input().split())\n q2 = str(pow(n, n, 10 ** k)).zfill(k)\n if n >= 1000 :\n q1 = firstkdigits(n,k)\n else :\n q1 = str(n**n)[:k] \n print(q1 + \" \" + q2)", "from decimal import *\nfor i in range(int(input())):\n x, y = input().split()\n x = int(x)\n y = int(y)\n if (x < 1000):\n q1 = str(x ** x)[:y]\n else:\n x = Decimal(x)\n q1 = str(int(10 **(x*(x.log10())%1 + y - 1)))\n q2 = str(pow(x, x, 10 ** y)).zfill(y) \n print(q1 + \" \" + q2)", "from decimal import *\nfor i in range(int(input())):\n x, y = input().split()\n x = int(x)\n y = int(y)\n if (x < 1000):\n q1 = str(x ** x)[:y]\n else:\n x = Decimal(x)\n q1 = str(int(10 **(x*(x.log10())%1 + y - 1)))\n q2 = str(pow(x, x, 10 ** y)).zfill(y) \n print(q1 + \" \" + q2)"]

{"inputs": [["2", "4 2", "9 3"]], "outputs": [["25 56", "387 489"]]}

INTERVIEW

PYTHON3

CODECHEF

1,431

a495a766fca0036b79970bdb23d92a20

UNKNOWN

Sherlock Holmes has decided to start a new academy to some of the young lads. He has conducted several tests and finally selected N equally brilliant students.Now he don't know whether to train all the N students or not. Now since Holmes was in a confusion, Watson came up with an idea. He wanted to test the obedience of the students. So during the camp, the students were given some Swiss Chocolates as gifts each time when they passed a level.Now some of them have finished eating all the chocolates, some of them had some remaining. Now to test their team chemistry and IQ skills, Watson told the lads to arrange themselves in such a way that, number of chocolates of the ith kid should be equal to the sum of (i-1)th kid and (i-2)th kid. Now they have arranged themselves in an order. Now Sherlock announced that he will select the students who have formed the line according to this order. But since there can be many such small groups among the entire N kids, he will select a sequence of kids such that the length of the sequence is maximized, meanwhile satisfying the above condition -----Input----- First line is an integer T which denotes the total number of test cases. Each of the next T lines contains an integer N which denotes, N students. The next line contains N spaced integers.where it denotes the order in which the kids arranged themselves. -----Output----- Each line contains an integer which denotes the maximum number of students among the N students who have arranged themselves according the rule said by Watson.It is guaranteed that Holmes will select atleast 1 or 2 students -----Constraints----- - 1 ≤ T ≤ 10 - 1 ≤ N ≤ 10^5 - 1 ≤ Each of next N integers ≤ 10^9 -----Subtasks----- Subtask #1 : (20 points) - 1 ≤ T ≤ 10 - 1 ≤ N≤ 100 - 1 ≤ Each element≤ 10^3 Subtask 2 : (80 points) - 1 ≤ T ≤ 10 - 1 ≤ N≤ 100000 - 1 ≤ Each element≤ 10^9 -----Example----- Input: 2 5 2 3 5 1 2 3 1 2 3 Output: 3 3 -----Explanation----- Example case 1. Here the first kid has 2 chocolates, second has 3 chocolates, third kid has 5 chocolates, which is the sum of first kid's total chocolates and second kid's chocolate. Forth student has only 1 chocolate where he did not follow the rule. So the maximum number of kids who arranged themselves in the order was 3. That is students at index 1 to index 3.

["t = eval(input())\n\nfor i in range(t):\n n = eval(input())\n a = list(map(int, input().split()))\n cnt = 2\n cnt1 = 2\n ll = len(a)\n if ll < 3:\n cnt1 = ll\n else:\n for j in range(2,ll):\n if a[j-1] + a[j-2] == a[j]:\n cnt += 1\n cnt1 = max(cnt1, cnt)\n else:\n cnt1 = max(cnt1, cnt)\n cnt = 2\n print(cnt1) ", "t = int(input())\n\nfor e in range(t):\n n = int(input())\n chocolates = input().strip().split(\" \")\n\n # Sequence is working\n sequence = []\n for x in range(len(chocolates) - 2):\n if int(chocolates[x]) + int(chocolates[x+1]) == int(chocolates[x+2]):\n sequence.append(1)\n else:\n sequence.append(0)\n\n inSequence = 0\n gSequence = 0\n end = 0\n for x in range(len(sequence)):\n if sequence[x] == 1:\n inSequence += 1\n if x == len(sequence) - 1:\n end = x + 1\n gSequence = inSequence\n else:\n if inSequence > gSequence:\n gSequence = inSequence\n end = x\n inSequence = 0\n\n space = \" \"\n output = chocolates[end - gSequence:end + 2]\n print(len(output))", "t = int(input())\n\nfor e in range(t):\n n = int(input())\n chocolates = input().strip().split(\" \")\n\n # Sequence is working\n sequence = []\n for x in range(len(chocolates) - 2):\n if int(chocolates[x]) + int(chocolates[x+1]) == int(chocolates[x+2]):\n sequence.append(1)\n else:\n sequence.append(0)\n\n inSequence = 0\n gSequence = 0\n end = 0\n for x in range(len(sequence)):\n if sequence[x] == 1:\n inSequence += 1\n if x == len(sequence) - 1:\n end = x + 1\n gSequence = inSequence\n else:\n if inSequence > gSequence:\n gSequence = inSequence\n end = x\n inSequence = 0\n\n space = \" \"\n output = chocolates[end - gSequence:end + 2]\n print(len(output))", "for _ in range(int(input())):\n n = int(input())\n a = list(map(int, input().split()))\n mx = 1\n if n > 1 and a[0] == a[1]:\n mx = 2\n if n > 2:\n c = 1\n f = 1\n for i in range(2, n):\n if a[i] == a[i-1] + a[i-2]:\n c += 1 + f\n f = 0\n continue\n else:\n mx = max(c, mx)\n c = 1\n f = 1\n mx = max(c, mx) \n print(mx) ", "for _ in range(int(input())):\n n = int(input())\n a = list(map(int, input().split()))\n mx = 1\n if n < 3:\n if n == 2 and a[0] == a[1]:\n mx = 2\n else:\n c = 2\n for i in range(2, n):\n if a[i] == a[i-1] + a[i-2]:\n c += 1\n continue\n else:\n mx = max(c, mx)\n c = 2\n mx = max(c, mx) \n print(mx)", "for _ in range(eval(input())):\n n = eval(input())\n A = list(map(int, input().split()))\n if n < 3:\n print(n)\n elif n == 3:\n print(2 if A[2] != A[0] + A[1] else 3)\n else:\n st = 1\n max_len = 0\n for i in range(2,n):\n if A[i] != A[i-1] + A[i-2]:\n max_len = max(max_len, i-st)\n st = i\n max_len = max(max_len, (i-st)+1) if st < n-1 else max_len\n print(max_len + 1)", "tc = int(input())\nwhile tc!=0:\n size = int(input())\n data = [] \n data = list(map(int,input().split()))\n if size == 1:\n print(\"1\")\n tc -= 1\n continue\n i = 2\n count = 2\n max = 2\n while i < size:\n if data[i] == (data[i-1] + data[i-2]):\n count+=1\n if count > max:\n max = count\n else:\n count = 2\n i+=1\n print(max)\n tc -= 1 ", "tc = int(input())\nwhile tc!=0:\n size = int(input())\n data = [] \n data = list(map(int,input().split()))\n i = 2\n count = 2\n max = 2\n while i < size:\n if data[i] == (data[i-1] + data[i-2]):\n count+=1\n if count > max:\n max = count\n else:\n count = 2\n i+=1\n print(max)\n tc -= 1", "tc = int(input())\nwhile tc!=0:\n size = int(input())\n data = [] \n data = list(map(int,input().split()))\n i = 2\n count = 2\n max = 0\n while i < size:\n if data[i] == (data[i-1] + data[i-2]):\n count+=1\n if count > max:\n max = count\n else:\n count = 2\n i+=1\n if count > max:\n max = count\n print(max)\n tc -= 1", "for _ in range(int(input())):\n n=int(input())\n s=list(map(int,input().split()))\n maxx=0\n count=0\n if n<=2:\n print(n)\n elif n==3:\n if s[2]==s[1]+s[0]:\n print(3)\n else:\n print(2)\n else:\n for i in range(2,n):\n if s[i]==s[i-1]+s[i-2]:\n count+=1\n maxx=max(maxx,count)\n else:\n count=0\n print(maxx+2)\n \n \n\n", "import sys\n\nfor __ in range(eval(input())) :\n n = eval(input())\n lists = list(map(int,sys.stdin.readline().split()))\n curmax , temp , fflag = 0 , 2 , False\n for i in range(2,n) :\n if lists[i-2]+lists[i-1] == lists[i] :\n temp += 1\n else :\n if temp > curmax :\n curmax = temp\n temp = 2\n print(max(curmax,temp) if n > 1 else 1)\n", "import sys\n\nfor __ in range(eval(input())) :\n n = eval(input())\n lists = list(map(int,sys.stdin.readline().split()))\n curmax , temp , fflag = 0 , 2 , False\n for i in range(2,n) :\n if lists[i-2]+lists[i-1] == lists[i] :\n temp += 1\n else :\n if temp > curmax :\n curmax = temp\n temp = 2\n print(max(curmax,temp))\n", "for t in range(int(input())):\n n = int(input())\n a = list(map(int, input().split()))\n if (n==1):\n print(1)\n elif (n==2):\n print(2)\n else:\n c = 2\n m = 0\n for i in range(2,n):\n if (a[i] == a[i-1]+a[i-2]):\n c+=1\n else:\n m = max(c,m)\n c = 2\n m = max(c,m)\n print(m)", "for t in range(int(input())):\n n = int(input())\n a = list(map(int, input().split()))\n c = 2\n m = 0\n for i in range(2,n):\n if (a[i] == a[i-1]+a[i-2]):\n c+=1\n else:\n m = max(c,m)\n c = 2\n m = max(c,m)\n print(m)"]

{"inputs": [["2", "5", "2 3 5 1 2", "3", "1 2 3"]], "outputs": [["3", "3"]]}

INTERVIEW

PYTHON3

CODECHEF

5,372

9819135bcc160f88bbdb6b9b3b911343

UNKNOWN

A robot is initially at $(0,0)$ on the cartesian plane. It can move in 4 directions - up, down, left, right denoted by letter u, d, l, r respectively. More formally: - if the position of robot is $(x,y)$ then u makes it $(x,y+1)$ - if the position of robot is $(x,y)$ then l makes it $(x-1,y)$ - if the position of robot is $(x,y)$ then d makes it $(x,y-1)$ - if the position of robot is $(x,y)$ then r makes it $(x+1,y)$ The robot is performing a counter-clockwise spiral movement such that his movement can be represented by the following sequence of moves - ulddrruuulllddddrrrruuuuu… and so on. A single move takes 1 sec. You have to find out the position of the robot on the cartesian plane at $t$ second. -----Input:----- - The first line of the input contains a single integer $T$ denoting the number of test cases. The description of $T$ test cases follows. - The first line of each test case contains a single integer $t$. -----Output:----- For each test case, print two space-separated integers, $(x,y)$ — the position of the robot. -----Constraints----- - $1 \leq T \leq 10^6$ - $1 \leq t \leq 10^{18}$ -----Sample Input:----- 5 1 2 3 50 12233443 -----Sample Output:----- 0 1 -1 1 -1 0 2 4 -1749 812

["\r\n\r\nz = int(input())\r\ni = 0\r\nwhile i < z:\r\n n = int(input())\r\n p = int(n**(0.5))\r\n if p*(p+1) < n:\r\n p += 1\r\n # print(\"P\", p)\r\n x, y = 0, 0\r\n q = 0\r\n flag = True\r\n if p*(p+1) == n:\r\n # print(\"Even steps, nice\")\r\n q = p\r\n else:\r\n # remaining steps\r\n q = p-1\r\n flag = False\r\n if q%2 :\r\n # odd\r\n x -= ((q+1)//2)\r\n y += ((q+1)//2)\r\n else :\r\n x += (q//2)\r\n y -= (q//2)\r\n if flag:\r\n print(x, y)\r\n else:\r\n # remaining steps\r\n l = q*(q+1)\r\n t = p*(p+1)\r\n diff = t-l\r\n \r\n\r\n # print(x, y)\r\n if x < 0:\r\n # left\r\n if n-l >= diff//2:\r\n y *= (-1)\r\n l += (diff//2)\r\n x += (n-l)\r\n else :\r\n y -= (n-l)\r\n \r\n else:\r\n # right\r\n if n-l >= diff//2:\r\n y *= (-1)\r\n y += 1\r\n l += (diff//2)\r\n x -= (n-l)\r\n else :\r\n y += (n-l)\r\n # print(\"Remaining steps: \", n-l)\r\n print(x, y)\r\n i+=1 "]

{"inputs": [["5", "1", "2", "3", "50", "12233443"]], "outputs": [["0 1", "-1 1", "-1 0", "2 4", "-1749 812"]]}

INTERVIEW

PYTHON3

CODECHEF

1,059

617e1ce131107df64e986e5b416c2542

UNKNOWN

Prof. Sergio Marquina is a mathematics teacher at the University of Spain. Whenever he comes across any good question(with complexity k), he gives that question to students within roll number range i and j. At the start of the semester he assigns a score of 10 to every student in his class if a student submits a question of complexity k, his score gets multiplied by k. This month he gave M questions and he is wondering what will be mean of maximum scores of all the students. He is busy planning a tour of the Bank of Spain for his students, can you help him? -----Input:----- - First-line will contain $T$, the number of test cases. Then the test cases follow. - Each test case contains the first line of input, two integers N, M i.e. Number of students in the class and number of questions given in this month. - Next M lines contain 3 integers -i,j,k i.e. starting roll number, end roll number, and complexity of the question -----Output:----- - For each test case, output in a single line answer - floor value of Mean of the maximum possible score for all students. -----Constraints----- - $1 \leq T \leq 100$ - $1 \leq N, M \leq 105$ - $1 \leq i \leq j \leq N$ - $1 \leq k \leq 100$ -----Sample Input:----- 1 5 3 1 3 5 2 5 2 3 4 7 -----Sample Output:----- 202 -----EXPLANATION:----- Initial score of students will be : [10,10,10,10,10] after solving question 1 scores will be: [50,50,50,10,10] after solving question 2 scores will be: [50,100,100,20,20] after solving question 1 scores will be: [50,100,700,140,20] Hence after all questions mean of maximum scores will (50+100+700+140+20)/5=202

["# cook your dish here\nfor t in range(int(input())):\n n,m=[int(x)for x in input().rstrip().split()]\n s=[]\n for p in range(n):\n s.append(10)\n for c in range(m):\n i,j,k=[int(x)for x in input().rstrip().split()]\n for q in range(i-1,j):\n s[q]=s[q]*k\n print(sum(s)//n)\n \n \n \n \n", "# cook your dish here\nimport math\nfor _ in range(int(input())):\n n,m=list(map(int,input().split()))\n p=[10]*n\n for i in range(m):\n l=list(map(int,input().split()))\n i=l[0]-1\n j=l[1]\n k=l[2]\n for s in range(i,j,1):\n p[s]=p[s]*k\n sup=sum(p)\n sup=math.floor(sup/n)\n print(sup)\n", "# cook your dish here\nt=int(input())\nfor _ in range(t):\n n,m=map(int,input().split())\n a=list()\n for _ in range(n):\n a.append(10)\n for _ in range(m):\n i,j,k=map(int,input().split())\n for z in range(i-1,j):\n a[z]=a[z]*k\nprint(sum(a)//n)", "import numpy as py\n\nT=int(input())\nfor _ in range(T):\n N,M=list(map(int,input().split()))\n l=[10]*N\n for _ in range(M):\n i,j,k=list(map(int,input().split()))\n s1=l[:i-1]\n s2=l[i-1:j]\n s3=l[j:]\n new=list(py.array(s2)*k)\n l=s1+new+s3\n #print(l)\ns=sum(l)//N\nprint(s)\n"]

{"inputs": [["1", "5 3", "1 3 5", "2 5 2", "3 4 7"]], "outputs": [["202"]]}

INTERVIEW

PYTHON3

CODECHEF

1,143

ac119ec051aa3127c6800c0c22749de1

UNKNOWN

The city of Siruseri is impeccably planned. The city is divided into a rectangular array of cells with $M$ rows and $N$ columns. Each cell has a metro station. There is one train running left to right and back along each row, and one running top to bottom and back along each column. Each trains starts at some time $T$ and goes back and forth along its route (a row or a column) forever. Ordinary trains take two units of time to go from one station to the next. There are some fast trains that take only one unit of time to go from one station to the next. Finally, there are some slow trains that take three units of time to go from one station the next. You may assume that the halting time at any station is negligible. Here is a description of a metro system with $3$ rows and $4$ columns: $ $ S(1) F(2) O(2) F(4) F(3) . . . . S(2) . . . . O(2) . . . . $ $ The label at the beginning of each row/column indicates the type of train (F for fast, O for ordinary, S for slow) and its starting time. Thus, the train that travels along row 1 is a fast train and it starts at time $3$. It starts at station ($1$, $1$) and moves right, visiting the stations along this row at times $3, 4, 5$ and $6$ respectively. It then returns back visiting the stations from right to left at times $6, 7, 8$ and $9$. It again moves right now visiting the stations at times $9, 10, 11$ and $12$, and so on. Similarly, the train along column $3$ is an ordinary train starting at time $2$. So, starting at the station ($3$,$1$), it visits the three stations on column $3$ at times $2, 4$ and $6$, returns back to the top of the column visiting them at times $6,8$ and $10$, and so on. Given a starting station, the starting time and a destination station, your task is to determine the earliest time at which one can reach the destination using these trains. For example suppose we start at station ($2$,$3$) at time $8$ and our aim is to reach the station ($1$,$1$). We may take the slow train of the second row at time $8$ and reach ($2$,$4$) at time $11$. It so happens that at time $11$, the fast train on column $4$ is at ($2$,$4$) travelling upwards, so we can take this fast train and reach ($1$,$4$) at time $12$. Once again we are lucky and at time $12$ the fast train on row $1$ is at ($1$,$4$), so we can take this fast train and reach ($1$, $1$) at time $15$. An alternative route would be to take the ordinary train on column $3$ from ($2$,$3$) at time $8$ and reach ($1$,$3$) at time $10$. We then wait there till time $13$ and take the fast train on row $1$ going left, reaching ($1$,$1$) at time $15$. You can verify that there is no way of reaching ($1$,$1$) earlier than that. -----Input:----- The first line contains two integers $M$ and $N$ indicating the number rows and columns in the metro system. This is followed by $M$ lines, lines $2, 3, …, M+1$, describing the trains along the $M$ rows. The first letter on each line is either F or O or S, indicating whether the train is a fast train, an ordinary train or a slow train. Following this, separated by a blank space, is an integer indicating the time at which this train starts running. The next $N$ lines, lines $M+2, M+3, …, N+M+1$, contain similar descriptions of the trains along the $N$ columns. The last line, line $N+M+2$, contains $5$ integers $a, b, c, d$ and $e$ where ($a$,$b$) is the starting station, $c$ is the starting time and ($d$,$e$) is the destination station. -----Output:----- A single integer indicating the earliest time at which one may reach the destination. -----Constraints:----- - $1 \leq M, N \leq 50$. - $1 \leq a, d \leq M$ - $1 \leq b, e \leq N$ - $1 \leq$ all times in input $\leq 20$ -----Sample Input----- 3 4 F 3 S 2 O 2 S 1 F 2 O 2 F 4 2 3 8 1 1 -----Sample Output----- 15

["from queue import PriorityQueue\r\nm,n=list(map(int,input().split()))\r\nrr=[]\r\ncc=[]\r\nspeed={'S':3,'O':2,'F':1}\r\nvisited=set()\r\ndp=[]\r\n\r\ndef qwerty(cur,x,y,f):\r\n\tif f==0:\r\n\t\tgg=rr[x][1]+y*rr[x][0]\r\n\t\twhile gg<cur:\r\n\t\t\tgg+=(2*(n-1))*rr[x][0]\r\n\t\treturn gg-cur+rr[x][0]\r\n\telif f==1:\r\n\t\tgg=rr[x][1]+(2*(n-1)-y)*rr[x][0]\r\n\t\twhile gg<cur:\r\n\t\t\tgg+=(2*(n-1))*rr[x][0]\r\n\t\treturn gg-cur+rr[x][0]\r\n\telif f==2:\r\n\t\tgg=cc[y][1]+x*cc[y][0]\r\n\t\twhile gg<cur:\r\n\t\t\tgg+=(2*(m-1))*cc[y][0]\r\n\t\treturn gg-cur+cc[y][0]\t\t\r\n\telif f==3:\r\n\t\tgg=cc[y][1]+(2*(m-1)-x)*cc[y][0]\r\n\t\twhile gg<cur:\r\n\t\t\tgg+=(2*(m-1))*cc[y][0]\r\n\t\treturn gg-cur+cc[y][0]\r\n\r\n\r\ndirx=[0, 0, 1, -1]\r\ndiry=[1, -1, 0, 0]\r\n\r\nfor i in range(m):\r\n\to=[x for x in input().split()]\r\n\to[0]=speed[o[0]]\r\n\to[1]=int(o[1])\r\n\trr.append(o)\r\n\r\n\r\nfor i in range(n):\r\n\to=[x for x in input().split()]\r\n\to[0]=speed[o[0]]\r\n\to[1]=int(o[1])\r\n\tcc.append(o)\r\n\r\n\r\nsx,sy,stt,dx,dy=list(map(int,input().split()))\r\nsx-=1\r\nsy-=1\r\ndx-=1\r\ndy-=1\r\n\r\nfor i in range(m):\r\n\tdp.append([10**9]*n)\r\n\r\ndp[sx][sy]=stt\r\npq = PriorityQueue()\r\npq.put((stt, sx, sy))\r\nwhile not pq.empty():\r\n\t#print(dp)\r\n\t(t,cxx,cyy)=pq.get()\r\n\tif (cxx,cyy) in visited:\r\n\t\tcontinue\r\n\tvisited.add((cxx,cyy))\r\n\tfor i in range(len(dirx)):\r\n\t\tnxx=cxx+dirx[i]\r\n\t\tnyy=cyy+diry[i]\r\n\t\tif nxx>=0 and nxx<m and nyy>=0 and nyy<n and (nxx,nyy) not in visited:\r\n\t\t\tcoo=qwerty(dp[cxx][cyy],cxx,cyy,i)\r\n\t\t\tif coo+dp[cxx][cyy]<dp[nxx][nyy]:\r\n\t\t\t\t\tdp[nxx][nyy]=coo+dp[cxx][cyy]\r\n\t\t\t\t\tpq.put((dp[nxx][nyy],nxx,nyy))\r\n\r\nprint(dp[dx][dy])\r\n\r\n\r\n\r\n\r\n\r\n\r\n\t\r\n\r\n\r\n\r\n"]

{"inputs": [["3 4", "F 3", "S 2", "O 2", "S 1", "F 2", "O 2", "F 4", "2 3 8 1 1"]], "outputs": [["15"]]}

INTERVIEW

PYTHON3

CODECHEF

1,773

af41cfba1f416652da63fc5fee733663

UNKNOWN

Taxis of Kharagpur are famous for making sharp turns. You are given the coordinates where a particular taxi was on a 2-D planes at N different moments: (x1, y1), (x2, y2), ..., (xN, yN). In between these coordinates, the taxi moves on a straight line. A turn at the i-th (2 ≤ i ≤ N-1) coordinate is said to be a sharp turn if the angle by which it turns at Point B = (xi, yi) when going from coordinates A = (xi-1, yi-1) to C = (xi+1, yi+1) via (xi, yi) is greater than 45 degrees. ie. suppose you extend the line segment AB further till a point D, then the angle DBC would be greater than 45 degrees. You have to identify whether the taxi made a sharp turn somewhere or not (Please look at Output section for details). If it made a sharp turn, also identify whether it is possible to change the coordinates at one of the N moments to make sure that the taxi doesn't make any sharp turn. Note that all the N pairs of coordinates (including the new coordinates) should be integers and distinct and should have their x and y coordinates at least 0 and at most 50. -----Input----- - The first line of the input contains a single integer T denoting the number of test cases. The description of T test cases follows. - The first line of each test case contains a single integer N denoting the number of moments at which you are given the information of the taxi's coordinates. - Each of the next N lines contains two space-separated integers xi and yi denoting the x and y coordinates of the taxi at i-th moment. -----Output----- - For each test case, print a single line containing two space-separated strings, either of which can be a "yes" or "no" (without quotes). If there was no sharp turn, the first string should be "yes", and if there was a sharp turn, the first string should be "no". For the second string, you should tell whether it is possible to modify at most one coordinate in such a way that taxi doesn't make a sharp turn. Note that if the first string is "yes", then the second string would always be "yes". -----Constraints----- - 1 ≤ T ≤ 50 - 3 ≤ N ≤ 50 - 0 ≤ xi, yi ≤ 50 - It's guaranteed that all (xi, yi) pairs are distinct. -----Example----- Input 5 3 0 0 1 1 2 1 3 0 0 1 0 6 1 3 0 0 1 0 1 1 4 0 0 1 0 1 1 6 1 6 0 0 1 0 1 1 2 1 2 2 3 2 Output yes yes yes yes no yes no yes no no -----Explanation----- Example 1. You can see that taxi is never making a sharp turn. Example 3 You can see that taxi is making a sharp turn of 90 degrees, an angle greater than 45'. However, you can change the coordinates of the third points to (2, 1) to ensure that the angle remains <= 45'.

["import math\nimport copy\ntry:\n import psyco\n psyco.full()\nexcept ImportError:\n pass\n \ndef isSharp(ang):\n return ang > math.pi/4 + 0.00001\n \ndef unitVector(p2, p1):\n d0 = p2[0] - p1[0]\n d1 = p2[1] - p1[1]\n d = math.sqrt(d0*d0 + d1*d1)\n if d != 0:\n return [d0/d, d1/d]\n return [0, 0]\n \ndef compVectors(P):\n V = []\n for i in range(1,len(P)):\n v = unitVector(P[i], P[i-1])\n if v[0] == 0 and v[1] == 0:\n return None\n V.append(v)\n return V\n \ndef angle(v2, v1):\n d = v2[0]*v1[0] + v2[1]*v1[1]\n if d > 1:\n d = 1\n if d < -1:\n d = -1\n return math.acos(d)\n \ndef compAngles(V):\n A = []\n for i in range(len(V)-1):\n A.append(angle(V[i+1], V[i]))\n return A\n \ndef updateAngles(i, P, V, A):\n if i-1 >= 0:\n V[i-1] = unitVector(P[i], P[i-1])\n if i+1 < len(P):\n V[i] = unitVector(P[i+1], P[i])\n if i-2 >= 0:\n A[i-2] = angle(V[i-1], V[i-2])\n if i-1 >= 0 and i+1 < len(P):\n A[i-1] = angle(V[i], V[i-1])\n if i+2 < len(P):\n A[i] = angle(V[i+1], V[i])\n \ndef checkMoves(check, P, V, A, filled):\n for i in check:\n if i < 0 or i >= len(P):\n break\n x, y = P[i]\n for j in range(51):\n for k in range(51):\n P[i][0] = j\n P[i][1] = k\n if str(P[i]) in filled:\n continue\n updateAngles(i, P, V, A)\n fixed = True\n if i-2 >= 0:\n if isSharp(A[i-2]):\n fixed = False\n if i-1 >= 0 and i-1 < len(A):\n if isSharp(A[i-1]):\n fixed = False\n if i < len(A):\n if isSharp(A[i]):\n fixed = False\n if fixed:\n return True\n P[i] = [x, y]\n updateAngles(i, P, V, A) \n return False\n \n \ndef canFix(first, last, P, V, A, filled):\n d = last - first\n if d > 2:\n return False\n if d == 2:\n check = [first+2]\n if d == 1:\n check = [first+1, first+2]\n if d == 0:\n check = [first, first+1, first+2]\n if checkMoves(check, P, V, A, filled):\n return True\n return False\n \nT=int(input())\nfor i in range(T):\n N=int(input())\n P=[]\n V=[]\n filled={}\n for i in range(N):\n P.append(list(map(int,input().split())))\n filled[str(P[i])] = 1\n V = compVectors(P)\n A = compAngles(V)\n blunt = True\n first = -1\n last = -1\n for i in range(len(A)):\n if isSharp(A[i]):\n blunt = False\n last = i\n if first < 0:\n first = i\n if blunt:\n print('yes yes')\n else:\n if canFix(first, last, P, V, A, filled):\n print('no yes')\n else:\n print('no no') ", "import math\nimport copy\ntry:\n import psyco\n psyco.full()\nexcept ImportError:\n pass\n \ndef isSharp(ang):\n return ang > math.pi/4 + 0.00001\n \ndef unitVector(p2, p1):\n d0 = p2[0] - p1[0]\n d1 = p2[1] - p1[1]\n d = math.sqrt(d0*d0 + d1*d1)\n if d != 0:\n return [d0/d, d1/d]\n return [0, 0]\n \ndef compVectors(P):\n V = []\n for i in range(1,len(P)):\n v = unitVector(P[i], P[i-1])\n if v[0] == 0 and v[1] == 0:\n return None\n V.append(v)\n return V\n \ndef angle(v2, v1):\n d = v2[0]*v1[0] + v2[1]*v1[1]\n if d > 1:\n d = 1\n if d < -1:\n d = -1\n return math.acos(d)\n \ndef compAngles(V):\n A = []\n for i in range(len(V)-1):\n A.append(angle(V[i+1], V[i]))\n return A\n \ndef updateAngles(i, P, V, A):\n if i-1 >= 0:\n V[i-1] = unitVector(P[i], P[i-1])\n if i+1 < len(P):\n V[i] = unitVector(P[i+1], P[i])\n if i-2 >= 0:\n A[i-2] = angle(V[i-1], V[i-2])\n if i-1 >= 0 and i+1 < len(P):\n A[i-1] = angle(V[i], V[i-1])\n if i+2 < len(P):\n A[i] = angle(V[i+1], V[i])\n \ndef checkMoves(check, P, V, A, filled):\n for i in check:\n if i < 0 or i >= len(P):\n break\n x, y = P[i]\n for j in range(51):\n for k in range(51):\n P[i][0] = j\n P[i][1] = k\n if str(P[i]) in filled:\n continue\n updateAngles(i, P, V, A)\n fixed = True\n if i-2 >= 0:\n if isSharp(A[i-2]):\n fixed = False\n if i-1 >= 0 and i-1 < len(A):\n if isSharp(A[i-1]):\n fixed = False\n if i < len(A):\n if isSharp(A[i]):\n fixed = False\n if fixed:\n return True\n P[i] = [x, y]\n updateAngles(i, P, V, A) \n return False\n \n \ndef canFix(first, last, P, V, A, filled):\n d = last - first\n if d > 2:\n return False\n if d == 2:\n check = [first+2]\n if d == 1:\n check = [first+1, first+2]\n if d == 0:\n check = [first, first+1, first+2]\n if checkMoves(check, P, V, A, filled):\n return True\n return False\n \nT=int(input())\nfor i in range(T):\n N=int(input())\n P=[]\n V=[]\n filled={}\n for i in range(N):\n P.append(list(map(int,input().split())))\n filled[str(P[i])] = 1\n V = compVectors(P)\n A = compAngles(V)\n blunt = True\n first = -1\n last = -1\n for i in range(len(A)):\n if isSharp(A[i]):\n blunt = False\n last = i\n if first < 0:\n first = i\n if blunt:\n print('yes yes')\n else:\n if canFix(first, last, P, V, A, filled):\n print('no yes')\n else:\n print('no no') "]

{"inputs": [["5", "3", "0 0", "1 1", "2 1", "3", "0 0", "1 0", "6 1", "3", "0 0", "1 0", "1 1", "4", "0 0", "1 0", "1 1", "6 1", "6", "0 0", "1 0", "1 1", "2 1", "2 2", "3 2"]], "outputs": [["yes yes", "yes yes", "no yes", "no yes", "no no"]]}

INTERVIEW

PYTHON3

CODECHEF

4,768

166496f202e1cd356c806b5fe522e98a

UNKNOWN

Chef is the judge of a competition. There are two players participating in this competition — Alice and Bob. The competition consists of N races. For each i (1 ≤ i ≤ N), Alice finished the i-th race in Ai minutes, while Bob finished it in Bi minutes. The player with the smallest sum of finish times wins. If this total time is the same for Alice and for Bob, a draw is declared. The rules of the competition allow each player to choose a race which will not be counted towards their total time. That is, Alice may choose an index x and her finish time in the race with this index will be considered zero; similarly, Bob may choose an index y and his finish time in the race with this index will be considered zero. Note that x can be different from y; the index chosen by Alice does not affect Bob's total time or vice versa. Chef, as the judge, needs to announce the result of the competition. He knows that both Alice and Bob play optimally and will always choose the best option. Please help Chef determine the result! -----Input----- - The first line of the input contains a single integer T denoting the number of test cases. The description of T test cases follows. - The first line of each test case contains a single integer N. - The second line contains N space-separated integers A1, A2, ..., AN. - The third line contains N space-separated integers B1, B2, ..., BN. -----Output----- For each test case, print a single line containing the string "Alice" if Alice wins, "Bob" if Bob wins or "Draw" if the result is a draw (without quotes). -----Constraints----- - 1 ≤ T ≤ 100 - 2 ≤ N ≤ 100 - 1 ≤ Ai ≤ 1000 for each valid i - 1 ≤ Bi ≤ 1000 for each valid i -----Example----- Input: 3 5 3 1 3 3 4 1 6 2 5 3 5 1 6 2 5 3 3 1 3 3 4 3 4 1 3 2 2 7 Output: Alice Bob Draw -----Explanation----- Example case 1: Alice will choose the finish time in the last race to be considered zero, which means her sum of finish times is 3 + 1 + 3 + 3 + 0 = 10, while Bob will choose the finish time of his second race to be considered zero, so his total sum of finish times is 1 + 0 + 2 + 5 + 3 = 11. Since Alice's sum is smaller, she is considered the winner. Example case 2: We're dealing with the same situation as in the previous case, but finish times for the players are swapped, so Bob wins this time. Example case 3: Alice will choose the finish time of the first race to be considered zero, which means her total time is 0 + 1 + 3 = 4. Bob will choose the finish time of his last race to be considered zero, which makes his total time 2 + 2 + 0 = 4. The competition is considered a draw because both players have equal sums of finish times.

["# cook your dish here\nfor i in range(int(input())):\n N=int(input())\n ALICE=list(map(int,input().split()))\n BOB=list(map(int,input().split()))\n ALICE[ALICE.index(max(ALICE))]=0\n BOB[BOB.index(max(BOB))]=0\n if sum(ALICE)<sum(BOB):\n print(\"Alice\")\n elif sum(BOB)<sum(ALICE):\n print(\"Bob\")\n else:\n print(\"Draw\")", "# cook your dish here\nfor i in range(int(input())):\n N=int(input())\n ALICE=list(map(int,input().split()))\n BOB=list(map(int,input().split()))\n ALICE[ALICE.index(max(ALICE))]=0\n BOB[BOB.index(max(BOB))]=0\n if sum(ALICE)<sum(BOB):\n print(\"Alice\")\n elif sum(BOB)<sum(ALICE):\n print(\"Bob\")\n else:\n print(\"Draw\")", "# cook your dish here\nfor i in range(int(input())):\n N=int(input())\n ALICE=list(map(int,input().split()))\n BOB=list(map(int,input().split()))\n ALICE[ALICE.index(max(ALICE))]=0\n BOB[BOB.index(max(BOB))]=0\n if sum(ALICE)<sum(BOB):\n print(\"Alice\")\n elif sum(BOB)<sum(ALICE):\n print(\"Bob\")\n else:\n print(\"Draw\")", "t=int(input())\nfor k in range(t):\n n=int(input())\n a=input().split()\n b=input().split()\n for j in range(n):\n a[j]=int(a[j])\n b[j]=int(b[j])\n a.remove(max(a))\n b.remove(max(b))\n s1=sum(a)\n s2=sum(b)\n if (s1>s2):\n print(\"Bob\")\n elif (s2>s1):\n print(\"Alice\")\n else:\n print(\"Draw\")", "t=int(input())\nfor i in range(t):\n n=int(input())\n a=list(map(int,input().split()))\n b=list(map(int,input().split()))\n x=max(a)\n y=max(b)\n a.remove(x)\n b.remove(y)\n suma=0\n sumb=0\n for i in a:\n suma=suma+i\n for i in b:\n sumb=sumb+i\n if suma<sumb:\n print(\"Alice\")\n elif suma>sumb:\n print(\"Bob\")\n else:\n print(\"Draw\")\n", "# cook your dish here\nT=int(input())\nfor i in range(T):\n n=int(input())\n a=list(map(int,input().split()))\n b=list(map(int,input().split()))\n x=max(a)\n y=max(b)\n a.remove(x)\n b.remove(y)\n suma=0\n sumb=0\n for i in a:\n suma=suma+i\n for i in b:\n sumb=sumb+i\n if suma<sumb:\n print(\"Alice\")\n elif suma>sumb:\n print(\"Bob\")\n else:\n print(\"Draw\")", "t=int(input())\nwhile t>0:\n n=int(input())\n a=list(map(int,input().split()))\n b=list(map(int,input().split()))\n a.sort()\n a.pop()\n b.sort()\n b.pop()\n al=sum(a)\n bob=sum(b)\n if(al<bob):\n print('Alice')\n elif(al==bob):\n print('Draw')\n else:\n print('Bob')\n t=t-1", "# cook your dish here\ndef alice_bob(alice, bob):\n alice.remove(max(alice))\n bob.remove(max(bob))\n result_alice = 0\n result_bob = 0\n result_alice += sum(alice)\n result_bob += sum(bob)\n if result_alice > result_bob:\n return 'Bob'\n elif result_alice < result_bob:\n return 'Alice'\n elif result_bob == result_alice:\n return 'Draw'\n\n\nT = int(input())\nfor i in range(T):\n N = int(input())\n # for j in range(2):\n alice = list(map(int, input().split()))\n bob = list(map(int, input().split()))\n print(alice_bob(alice, bob))\n\n \n", "# cook your dish here\nfor _ in range(int(input())):\n c = int(input())\n a = list(map(int,input().split()))\n b = list(map(int,input().split()))\n a = sum(a) - max(a)\n b = sum(b) - max(b)\n if a<b:\n print(\"Alice\")\n elif a>b:\n print(\"Bob\")\n else:\n print(\"Draw\")", "# cook your dish here\nfor i in range(int(input())):\n n = int(input())\n l1 = list(map(int,input().split( )))\n l2 = list(map(int,input().split( )))\n a = sum(l1) - max(l1)\n b = sum(l2) - max(l2)\n if a>b:\n print('Bob')\n elif b>a:\n print('Alice')\n else:\n print('Draw')", "# cook your dish here\nfor i in range(int(input())):\n n = int(input())\n l1 = list(map(int,input().split( )))\n l2 = list(map(int,input().split( )))\n a = sum(l1) - max(l1)\n b = sum(l2) - max(l2)\n if a>b:\n print('Bob')\n elif b>a:\n print('Alice')\n else:\n print('Draw')", "t=int(input())\nfor i in range(t):\n n=int(input())\n a=[int(j) for j in input().split()]\n b=[int(k) for k in input().split()]\n m=max(a)\n a=sum(a)-m\n z=max(b)\n b=sum(b)-z\n if a<b:\n print(\"Alice\")\n elif a>b:\n print(\"Bob\")\n else:\n print(\"Draw\")", "t=int(input())\nfor i in range(t):\n n=int(input())\n a=[int(j) for j in input().split()]\n b=[int(k) for k in input().split()]\n m=max(a)\n a=sum(a)-m\n z=max(b)\n b=sum(b)-z\n if a<b:\n print(\"Alice\")\n elif a>b:\n print(\"Bob\")\n else:\n print(\"Draw\")", "t=int(input())\nwhile t!=0:\n n=int(input())\n a=list(map(int,input().split()))\n b=list(map(int,input().split()))\n alice=sum(a)-max(a)\n bob=sum(b)-max(b)\n if alice<bob:\n print('Alice')\n elif bob<alice:\n print('Bob')\n else:\n print('Draw')\n t-=1", "def win(arr1,arr2,n):\n a=max(arr1)\n b=max(arr2)\n for ind in range(n):\n if arr1[ind]==a:\n index_a=ind\n if arr2[ind]==b:\n index_b=ind\n \n arr1[index_a]=0\n arr2[index_b]=0\n sum_a,sum_b=0,0\n for i in range(n):\n sum_a+=arr1[i]\n for j in range(n):\n sum_b+=arr2[j]\n \n if sum_a<sum_b:\n print(\"Alice\")\n elif sum_a>sum_b:\n print(\"Bob\")\n else:\n print(\"Draw\")\n\nt=int(input())\nfor tc in range(t):\n n=int(input())\n arr1=[int(ele) for ele in input().split()]\n arr2=[int(ele) for ele in input().split()]\n win(arr1,arr2,n)\n", "# cook your dish here\nt=int(input())\nfor i in range(t):\n n=int(input())\n a=list(map(int,input().strip().split()))\n b=list(map(int,input().strip().split()))\n a.remove(max(a))\n b.remove(max(b))\n if(sum(a)>sum(b)):\n print(\"Bob\")\n elif sum(a)==sum(b):\n print(\"Draw\")\n else:\n print(\"Alice\")", "import math\nfor _ in range(int(input())):\n n=int(input())\n a=list(map(int,input().split()))\n b=list(map(int,input().split()))\n x=sum(a)-max(a)\n y=sum(b)-max(b)\n if x<y:\n print('Alice')\n elif x>y:\n print('Bob')\n else:\n print('Draw')\n", "a=int(input())\nwhile a:\n a=a-1\n b=int(input())\n x=list(map(int,input().split()))\n y=list(map(int,input().split()))\n h=sum(x) - max(x)\n g=sum(y) - max(y)\n if h<g:\n print(\"Alice\")\n elif g<h:\n print(\"Bob\")\n else:\n print(\"Draw\")", "for i in range(int(input())):\n n=int(input())\n a=list(map(int,input().split()))\n b=list(map(int,input().split()))\n if (sum(a)-max(a))<(sum(b)-max(b)):\n print(\"Alice\")\n elif (sum(a)-max(a))==(sum(b)-max(b)):\n print(\"Draw\")\n else:\n print(\"Bob\")\n \n", "t=int(input())\nfor i in range(0,t):\n n=int(input())\n l1=list(map(int,input().split()))\n l1.sort()\n l1[-1]=0\n sum1=0\n for a in l1:\n sum1+=a\n l2=list(map(int,input().split()))\n l2.sort()\n l2[-1]=0\n sum2=0\n for b in l2:\n sum2+=b\n if(sum1<sum2):\n print(\"Alice\")\n elif(sum1>sum2):\n print(\"Bob\")\n else:\n print(\"Draw\")", "t = int(input())\nfor i in range(t):\n n = int(input())\n alice = list(map(int,input().split()))\n bob = list(map(int,input().split()))\n alice.remove(max(alice))\n bob.remove(max(bob))\n sum_alice = sum(alice)\n sum_bob = sum(bob)\n if sum_bob>sum_alice:\n print(\"Alice\")\n elif sum_alice>sum_bob:\n print(\"Bob\")\n else:\n print(\"Draw\")", "t=int(input())\nfor i in range(t):\n n=int(input())\n a=list(map(int,input().split()))\n b=list(map(int,input().split()))\n a.remove(max(a))\n b.remove(max(b))\n a1=sum(a)\n b1=sum(b)\n if(a1>b1):\n print(\"Bob\")\n elif(b1>a1):\n print(\"Alice\")\n else:\n print(\"Draw\")", "# cook your dish here\nt=int(input())\nfor _ in range(t):\n n=int(input())\n a=list(map(int,input().split()))\n b=list(map(int,input().split()))\n a.sort()\n b.sort()\n a[len(a)-1]=0\n b[len(b)-1]=0\n if(sum(a)>sum(b)):\n print(\"Bob\")\n elif(sum(b)>sum(a)):\n print(\"Alice\")\n else:\n print(\"Draw\")"]

{"inputs": [["3", "5", "3 1 3 3 4", "1 6 2 5 3", "5", "1 6 2 5 3", "3 1 3 3 4", "3", "4 1 3", "2 2 7"]], "outputs": [["Alice", "Bob", "Draw"]]}

INTERVIEW

PYTHON3

CODECHEF

7,423

3d3ba4481811be4d1731687cd7822945

UNKNOWN

This time minions are celebrating Diwali Festival. There are N minions in total. Each of them owns a house. On this Festival, Each of them wants to decorate their house. But none of them have enough money to do that. One of the minion, Kevin, requested Gru for money. Gru agreed for money distribution but he will be giving money to a minion if and only if demanded money is less than or equal to the money Gru have. Now Gru wonders if he can spend all the money or not. -----Input----- First line have number of test cases T. Each test case consist of Two Lines. First line contains two space separated integers N and K i.e. Number of minions and Amount of Money Gru have. Next line contains N space separated integers A1,A2,A3,.....,AN representing amount of money demanded by ith minion. -----Output----- Output YES if Gru can spend his all of the money on minions i.e. after distribution Gru have zero amount of money else NO. -----Constraints----- - 1 ≤ T ≤ 105 - 1 ≤ N ≤ 102 - 1 ≤ K,Ai ≤ 109 -----Example----- Input: 2 4 9 5 2 2 4 4 9 5 2 18 3 Output: YES NO -----Explanation----- Example case 1.At first Gru is having 9 Rs. If he gives 5 Rs. to first minion then remaining 4 Rs. can be given to 2nd and 3rd minion or to the 4th minion. Which will leave zero amount of money in the hands of Gru. Example case 2.At first Gru is having 9 Rs. If he gives 5 Rs. to the first minion then from remaining 4 Rs. either he can give 2 Rs. to the 2nd minion or 3 Rs. to the fourth minion. Which will leave either 2 Rs. or 1 Rs. in the hands of Gru.

["def find_combinations(list, sum):\n if not list:\n if sum == 0:\n return [[]]\n return []\n return find_combinations(list[1:], sum) + \\\n [[list[0]] + tail for tail in\n find_combinations(list[1:], sum - list[0])]\nfor tc in range(int(input())):\n n,k=list(map(int,input().split()))\n a=list(map(int,input().split()))\n a.sort()\n if len(find_combinations(a,k))==0:\n print(\"NO\")\n else:\n print(\"YES\")\n \n", "def find_combinations(list, sum):\n if not list:\n if sum == 0:\n return [[]]\n return []\n return find_combinations(list[1:], sum) + \\\n [[list[0]] + tail for tail in\n find_combinations(list[1:], sum - list[0])]\nfor tc in range(int(input())):\n n,k=list(map(int,input().split()))\n a=list(map(int,input().split()))\n a.sort()\n if len(find_combinations(a,k))==0:\n print(\"NO\")\n else:\n print(\"YES\")\n \n"]

{"inputs": [["2", "4 9", "5 2 2 4", "4 9", "5 2 18 3"]], "outputs": [["YES", "NO"]]}

INTERVIEW

PYTHON3

CODECHEF

852

7965989be01f11173998a6fa29278af5

UNKNOWN

Chef loves to play chess, so he bought a new chessboard with width M$M$ and height N$N$ recently. Chef considers a chessboard correct if its width (number of columns) is equal to its height (number of rows) and each cell has no side-adjacent cell of the same color (this is the so-called "chess order" which you can see in real-world chessboards). Chef's chessboard does not have to be a correct chessboard (in particular, it may have N≠M$N \neq M$). A sub-board of Chef's chessboard is a rectangular piece of this board with an arbitrarily chosen top left and bottom right cell (possibly equal to the original chessboard). Every sub-board is also a chessboard. Chef can invert some cells; inverting a cell means changing its color from white to black or from black to white. After inverting those cells, he wants to cut the maximum correct sub-board out of the original chessboard. Chef has not yet decided how many cells he would like to invert. Now he wonders about the answers to Q$Q$ question. In the i$i$-th question (1≤i≤Q$1 \le i \le Q$), he is allowed to invert at most ci$c_i$ cells (possibly zero); he would like to know the side length of the largest possible correct sub-board of his chessboard. Help Chef answer these questions. -----Input----- - The first line of the input contains two space-separated integers N$N$ and M$M$. - N$N$ lines follow. For each valid i$i$, the i$i$-th of these lines contains a string with length M$M$ describing the i$i$-th row of Chef's chessboard. Each character of this string is either '0', representing a black cell, or '1', representing a white cell. - The next line contains a single integer Q$Q$. - The last line contains Q$Q$ space-separated integers c1,c2,…,cQ$c_1, c_2, \dots, c_Q$. -----Output----- For each question, print a single line containing one integer — the maximum size of a correct sub-board. -----Constraints----- - 1≤N,M≤200$1 \le N, M \le 200$ - 1≤Q≤105$1 \le Q \le 10^5$ - 0≤ci≤109$0 \le c_i \le 10^9$ for each valid i$i$ -----Subtasks----- Subtask #1 (20 points): - 1≤N,M≤20$1 \le N, M \le 20$ - 1≤Q≤100$1 \le Q \le 100$ Subtask #2 (30 points): 1≤N,M≤20$1 \le N, M \le 20$ Subtask #3 (50 points): original constraints -----Example Input----- 8 8 00101010 00010101 10101010 01010101 10101010 01010101 10101010 01010101 4 1 2 0 1001 -----Example Output----- 7 8 6 8 -----Explanation----- If we don't change the board, the best answer here is the 6x6 bottom right sub-board. We can invert cells (2,2)$(2, 2)$ and (1,1)$(1, 1)$ to get a better answer.

["# cook your dish here\nn,m=map(int,input().split())\nL=[]\nfor i in range(n):\n s=input()\n L.append(s)\n\ncost=[]\nh2=[0]*(m+1)\ncost.append(h2)\nfor i in range(n):\n h=[0]\n for j in range(m):\n if(L[i][j]=='0' and (i+j)%2!=0):\n h.append(1)\n elif(L[i][j]=='1' and (i+j)%2==0):\n h.append(1)\n else:\n h.append(0)\n cost.append(h)\n\npre=[]\nh2=[0]*(m+1)\npre.append(h2)\nfor i in range(1,n+1):\n h=[0]\n c=0\n for j in range(1,m+1):\n c+=cost[i][j]\n c2=c\n if(i>0):\n c2+=pre[i-1][j]\n h.append(c2)\n pre.append(h)\n\nbs=[0]*((m*n)+10)\n\nfor i in range(1,n+1):\n for j in range(1,m+1):\n for k in range(1,min(m,n)+1):\n if(i-k>=0 and j-k>=0):\n c=pre[i][j]-pre[i-k][j]-pre[i][j-k]+pre[i-k][j-k]\n c=min(c,(k*k)-c)\n bs[c]=max(bs[c],k)\n\nmx=bs[0]\nfor i in range(1,len(bs)):\n mx=max(mx,bs[i])\n bs[i]=mx\n\nQ=int(input())\nq=[int(x) for x in input().split()]\nfor i in range(0,len(q)):\n qr=min(m*n,q[i])\n print(bs[qr])\n\n\n", "n,m=map(int,input().split())\r\nL=[]\r\nfor i in range(n):\r\n s=input()\r\n L.append(s)\r\n\r\ncost=[]\r\nh2=[0]*(m+1)\r\ncost.append(h2)\r\nfor i in range(n):\r\n h=[0]\r\n for j in range(m):\r\n if(L[i][j]=='0' and (i+j)%2!=0):\r\n h.append(1)\r\n elif(L[i][j]=='1' and (i+j)%2==0):\r\n h.append(1)\r\n else:\r\n h.append(0)\r\n cost.append(h)\r\n\r\npre=[]\r\nh2=[0]*(m+1)\r\npre.append(h2)\r\nfor i in range(1,n+1):\r\n h=[0]\r\n c=0\r\n for j in range(1,m+1):\r\n c+=cost[i][j]\r\n c2=c\r\n if(i>0):\r\n c2+=pre[i-1][j]\r\n h.append(c2)\r\n pre.append(h)\r\n\r\nbs=[0]*((m*n)+10)\r\n\r\nfor i in range(1,n+1):\r\n for j in range(1,m+1):\r\n for k in range(1,min(m,n)+1):\r\n if(i-k>=0 and j-k>=0):\r\n c=pre[i][j]-pre[i-k][j]-pre[i][j-k]+pre[i-k][j-k]\r\n c=min(c,(k*k)-c)\r\n bs[c]=max(bs[c],k)\r\n\r\nmx=bs[0]\r\nfor i in range(1,len(bs)):\r\n mx=max(mx,bs[i])\r\n bs[i]=mx\r\n\r\nQ=int(input())\r\nq=[int(x) for x in input().split()]\r\nfor i in range(0,len(q)):\r\n qr=min(m*n,q[i])\r\n print(bs[qr])\r\n\r\n\r\n", "n,m=map(int,input().split())\r\nchess=[]\r\nfor _ in range(n):\r\n chess.append([int(x) for x in list(input())])\r\nchessO=[]\r\nchessL=[]\r\nfixO=[]\r\nfixL=[]\r\nfor _ in range(n):\r\n p=[0]*m\r\n fixL.append(p)\r\n q=[0]*m\r\n fixO.append(q)\r\n tm=[0]*m\r\n chessO.append(tm)\r\n to=[0]*m\r\n chessL.append(to)\r\n\r\nfor i in range(n):\r\n for j in range(m):\r\n chessO[i][j]=((i+j)%2)^chess[i][j]\r\n chessL[i][j]=((i+j+1)%2)^chess[i][j]\r\n fixO[i][j]=chessO[i][j]\r\n fixL[i][j]=chessL[i][j]\r\n\r\nfor i in range(n):\r\n for j in range(1,m):\r\n fixO[i][j]=fixO[i][j-1]+chessO[i][j]\r\n fixL[i][j]=fixL[i][j-1]+chessL[i][j]\r\n\r\nans=[-1]*min(m,n)\r\nfor i in range(n):\r\n for j in range(m):\r\n for k in range(min(n-i,m-j)):\r\n errorO,errorL=0,0\r\n for l in range(i,i+k+1):\r\n errorO+=fixO[l][j+k]-fixO[l][j]+chessO[l][j]\r\n errorL+=fixL[l][j+k]-fixL[l][j]+chessL[l][j]\r\n if ans[k]==-1 or ans[k]>min(errorO,errorL): ans[k]=min(errorO,errorL)\r\nfinal=[0]*50000\r\nmaxo=9999999999\r\nfor i in range(min(m,n)-1,-1,-1):\r\n if ans[i]!=-1 and ans[i]<maxo:\r\n maxo=ans[i]\r\n final[maxo]=i\r\ntmp=final[0]\r\nfor i in range(1,50000):\r\n if final[i]>tmp:\r\n tmp=final[i]\r\n final[i]=tmp\r\ninput()\r\nq=[int(x) for x in input().split()]\r\n\r\nfor x in q:\r\n if x>50000-2 : print(final[45000]+1)\r\n else: print(final[x]+1)\r\n \r\n", "n,m = [int(i) for i in input().split()]\r\nsqsets = list(range(2,min(n,m)+1))\r\nci = []\r\nfor i in range(n):\r\n ci.append(list(input()))\r\ncc = [[0 for i in range(m+1)] for j in range(n+1)]\r\ndef cache_creation_part(x,y):\r\n cc[y][x] = cc[y][x - 1] + cc[y - 1][x] - cc[y - 1][x - 1]\r\n if (y + x) % 2 == 0:\r\n cc[y][x] += int(ci[y - 1][x - 1] != '1')\r\n else:\r\n cc[y][x] += int(ci[y - 1][x - 1] != '0')\r\n\r\ndef cache_creation(m,n):\r\n for y in range(1,n+1):\r\n for x in range(1, m + 1):\r\n cache_creation_part(x,y)\r\n\r\ndef operation(x,y,k):\r\n return cc[y + k][x + k] + cc[y][x] - cc[y + k][x] - cc[y][x + k]\r\n\r\nc = 0\r\nkd = {k:c for k in sqsets}\r\ndef kd_creation(m,n,sqsets):\r\n cache_creation(m,n)\r\n for k in sqsets:\r\n kd[k] = (10**9)+1\r\n for y in range(n-k+1):\r\n for x in range(m-k+1):\r\n cu = operation(x,y,k)\r\n kd[k] = min(kd[k], cu, k*k-cu)\r\nkd_creation(m,n,sqsets)\r\ndel cc\r\ndel ci\r\ndel sqsets\r\ntc = int(input())\r\ntc = [int(x) for x in input().split()]\r\nfor u in tc:\r\n p = 0\r\n for i in kd:\r\n if kd[i] <= u:\r\n p = max(i, p)\r\n print(p)", "# -*- coding: utf-8 -*-\r\n\r\nimport math\r\nimport collections\r\nimport bisect\r\nimport heapq\r\nimport time\r\nimport random\r\nimport itertools\r\nimport sys\r\n\r\n\"\"\"\r\ncreated by shhuan at 2018/10/30 19:45\r\n\r\n\"\"\"\r\n\r\n\r\nN, M = map(int, input().split())\r\n\r\nA = []\r\n\r\nfor i in range(N):\r\n A.append([int(x) for x in input()])\r\n\r\n# for row in A:\r\n# print(row)\r\n\r\n\r\n#f(r, c, color, width) = f(r+1, c+1, color, width-1) + mismatches_in_edge\r\n\r\nmxMN, mnMN = max(M, N), min(M, N)\r\nans = [float('inf') for _ in range(mxMN + 1)]\r\nf = [[[[0 for _ in range(mxMN + 1)] for color in range(2)] for c in range(M+1)] for r in range(N+1)]\r\n\r\nfor width in range(1, min(N, N)+1):\r\n for color in [0, 1]:\r\n for sr in range(N-width+1):\r\n for sc in range(N-width+1):\r\n steps = f[sr+1][sc+1][color][width-1]\r\n\r\n cc = color\r\n for c in range(sc, sc+width):\r\n steps += 0 if A[sr][c] == cc else 1\r\n cc ^= 1\r\n cc = color ^ 1\r\n for r in range(sr+1, sr+width):\r\n steps += 0 if A[r][sc] == cc else 1\r\n cc ^= 1\r\n\r\n f[sr][sc][color][width] = steps\r\n ans[width] = min(ans[width], steps)\r\n\r\nqc = input()\r\nqs = [int(x) for x in input().split()]\r\n\r\n# print()\r\n# print(ans)\r\nfor q in qs:\r\n print(bisect.bisect_right(ans, q) - 1)\r\n\r\n", "n,m=list(map(int,input().split()))\r\ngrid=[ list(map(int,list(input()))) for i in range(n)]\r\nobs0=[ [ 0 for j in range(m)] for i in range(n)] \r\nobs1=[ [ 0 for j in range(m)] for i in range(n) ]\r\nmax_side=min(m,n)\r\nside_c=[ 40000 for i in range(max_side+1)]\r\nside_c[0]=0\r\nside_c[1]=0\r\n#print(grid)\r\nfor i in range(n):\r\n\tfor j in range(m):\r\n\t\tif (i+j)%2==0:\r\n\t\t\tobs0[i][j]=0\r\n\t\t\tobs1[i][j]=1\r\n\t\telse:\r\n\t\t\tobs0[i][j]=1\r\n\t\t\tobs1[i][j]=0\r\n#print(obs0)\r\n#print(obs1)\r\nfor i in range(n):\r\n\tfor j in range(m):\r\n\t\tif obs0[i][j]!=grid[i][j]:\r\n\t\t\tobs0[i][j]=1\r\n\t\telse:\r\n\t\t\tobs0[i][j]=0\r\n\t\tif obs1[i][j]!=grid[i][j]:\r\n\t\t\tobs1[i][j]=1\r\n\t\telse:\r\n\t\t\tobs1[i][j]=0\r\n#print(obs0)\r\n#print(obs1)\r\n\r\nfor i in range(n):\r\n\tfor j in range(1,m):\r\n\t\tobs0[i][j]+=obs0[i][j-1]\r\n\t\tobs1[i][j]+=obs1[i][j-1]\r\nfor j in range(m):\r\n\tfor i in range(1,n):\r\n\t\tobs0[i][j]+=obs0[i-1][j]\r\n\t\tobs1[i][j]+=obs1[i-1][j]\r\nfor side in range(2,max_side+1):\r\n\tfor i in range(n):\r\n\t\tfor j in range(m):\r\n\t\t\tif i+side>n or j+side>m:\r\n\t\t\t\tcontinue\r\n\t\t\tcount0 = obs0[i+side-1][j+side-1] + (i!=0 and j!=0)*obs0[i-1][j-1] -(j!=0)*obs0[i+side-1][j-1] -(i!=0)*obs0[i-1][j+side-1] \r\n\t\t\tcount1 = obs1[i+side-1][j+side-1] + (i!=0 and j!=0)*obs1[i-1][j-1] -(j!=0)*obs1[i+side-1][j-1] -(i!=0)*obs1[i-1][j+side-1]\r\n\t\t\tside_c[side]=min(count0,count1,side_c[side])\r\ninput()\r\n#print(side_c)\r\n#print(*obs0,sep=\"\\n\")\r\n#print(*obs1,sep=\"\\n\")\r\nlist_c=list(map(int,input().split()))\r\nfor i in range(len(list_c)):\r\n\tc=list_c[i]\r\n\tanswer=1\r\n\tfor side in range(2,max_side+1):\r\n\t\tif c<side_c[side]:\r\n\t\t\tanswer=side-1\r\n\t\t\tbreak\r\n\tif c>=side_c[max_side]:\r\n\t\tanswer=max_side\r\n\tprint(answer)\r\n\r\n\r\n\r\n", "n,m=map(int,input().split())\r\nb=[[int(x) for x in list(input())] for x in range(n)]\r\nc=int(input())\r\n\r\nsize=min(n,m)\r\nres=[size**2 for x in range(size+1)]\r\n\r\ndef invert(i,j,r,ele):\r\n count=0\r\n \r\n for index,x in enumerate(range(i,i+r)):\r\n temp=ele\r\n if index%2:\r\n temp=0 if ele else 1\r\n \r\n for y in range(j,j+r):\r\n count+=0 if temp==b[x][y] else 1\r\n temp=0 if temp else 1\r\n return count\r\n\r\n\r\nfor s in range(size,1,-1):\r\n flag=0\r\n for x in range(n-s+1):\r\n for y in range(m-s+1):\r\n ic=min(invert(x,y,s,0),invert(x,y,s,1))\r\n res[s]=min(res[s],ic)\r\n # print(x,y,s,ic)\r\n if not ic:\r\n flag=1\r\n break\r\n if flag:\r\n break\r\n if flag:\r\n break\r\n\r\nfor t in map(int,input().split()):\r\n for index,e in reversed(list(enumerate(res))):\r\n if e<=t:\r\n print(index)\r\n break\r\n\r\nres = list(map(lambda x: 0 if x==size**2 else x,res))", "import sys\r\n\r\ndp=[[0 for i in range(201)]for i in range(201)]\r\nQ =[sys.maxsize for i in range(201)]\r\nQ1=[sys.maxsize for i in range(201)]\r\n\r\n\r\ndef compareWith(A ,B ,n ,m , f):\r\n \r\n for i in range(1,n+1):\r\n for j in range(1,m+1):\r\n \r\n a=0\r\n if(A[i-1][j-1]!=B[i-1][j-1]):\r\n a=1\r\n \r\n dp[i][j]=a + dp[i-1][j] + dp[i][j-1] -dp[i-1][j-1]\r\n \r\n \r\n for i in range(1,n+1):\r\n for j in range(1,m+1):\r\n k=i\r\n l=j\r\n r=1\r\n while k<=n and l<=m:\r\n a=findError(i,j,k,l)\r\n Q[r]=min(Q[r],a)\r\n k+=1\r\n l+=1\r\n r+=1\r\n \r\n if f==1:\r\n Q1=Q[:]\r\n\r\n\r\ndef findError(i,j,k,l):\r\n return dp[k][l]-dp[k][j-1]-dp[i-1][l]+dp[i-1][j-1]\r\n \r\n\r\n\r\n\r\nn, m = map(int, input().split()) \r\n\r\nA=[]\r\nC=[]\r\nB=[]\r\n\r\nfor i in range(n):\r\n s=input()\r\n A.append(s)\r\n \r\nfor i in range(n):\r\n sb=\"\"\r\n sc=\"\"\r\n for j in range(m):\r\n if(i%2==0):\r\n if(j%2==0):\r\n sb+='1'\r\n sc+='0'\r\n else:\r\n sb+='0'\r\n sc+='1'\r\n else:\r\n if(j%2==1):\r\n sb+='1'\r\n sc+='0'\r\n else:\r\n sb+='0'\r\n sc+='1'\r\n B.append(sb)\r\n C.append(sc)\r\n \r\n# print(*B, sep='\\n')\r\n# print(\"****\")\r\n# print(*C, sep='\\n')\r\n\r\ncompareWith(A,B,n,m,1)\r\ncompareWith(A,C,n,m,0)\r\n\r\nq=int(input())\r\nc=list(map(int,input().split()))\r\n\r\nfor i in c:\r\n a=0\r\n for j in range(1,min(m,n)+1):\r\n if i>=Q[j] or i>=Q1[j]:\r\n a=max(a,j)\r\n \r\n print(a)\r\n\r\n\r\n ", "# cook your dish here\nn,m=map(int,input().split())\nR=n\nC=m\na=[None]*n\nz=[0]*n\no=[1]*n\nfor i in range(m):\n if i%2!=0:\n z[i]=1\n o[i]=0\nzi=[None]*n\noi=[None]*n\nfor i in range(n):\n a[i]=input()\n a[i]=list(a[i])\n for j in range(m):\n a[i][j]=int(a[i][j])\n \n if i%2==0:\n zi[i]=z[:]\n oi[i]=o[:]\n else:\n zi[i]=o[:]\n oi[i]=z[:]\nforzi=0\nforoi=0\npsao = [[0 for x in range(C)] for y in range(R)] \npsaz = [[0 for x in range(C)] for y in range(R)] \nnoioo=0\nnoizz=0\nnoio=0\nnoiz=0\nfor i in range(n):\n noiz=0\n noio=0\n \n for j in range(m):\n \n if i==0:\n if a[i][j]!=oi[i][j]:\n noio+=1\n else:\n noiz+=1\n psao[i][j]=noio\n psaz[i][j]=noiz\n else:\n if a[i][j]!=oi[i][j]:\n noio+=1\n else:\n noiz+=1\n psaz[i][j]=noiz+psaz[i-1][j]\n psao[i][j]=noio+psao[i-1][j]\n \n\n \n \n\n\nmmm=[]\nfor i in range(2,min(m,n)+1):\n c=0\n ap=[]\n for j in range(n-i+1):\n for k in range(m-i+1):\n czz=0\n czz1=0\n czz2=0\n coo=0\n cor=0\n czz+=(psaz[j+i-1][k+i-1])\n coo+=(psao[j+i-1][k+i-1])\n\n if k-1>=0:\n czz-=(psaz[j+i-1][k-1])\n coo-=(psao[j+i-1][k-1])\n else:\n czz+=0\n if j-1>=0:\n czz-=(psaz[j-1][k+i-1])\n coo-=(psao[j-1][k+i-1])\n\n else:\n czz+=0\n if j-1>=0 and k-1>=0:\n czz+=(psaz[j-1][k-1])\n coo+=(psao[j-1][k-1])\n else:\n czz+=0\n \n ap.append((min((abs(coo)),abs(czz))))\n mmm.append(min(ap))\n\nq=int(input())\nlo=[int(pp) for pp in input().split()]\nmaxq=max(mmm)\nfor i in range(q):\n if lo[i]>maxq:\n print(min(n,m))\n else:\n j=len(mmm)-1\n ind=0\n while j>=0:\n if lo[i]>=mmm[j]:\n ind=j+2\n break\n j-=1\n print(ind)"]

{"inputs": [["8 8", "00101010", "00010101", "10101010", "01010101", "10101010", "01010101", "10101010", "01010101", "4", "1 2 0 1001"]], "outputs": [["7", "8", "6", "8"]]}

INTERVIEW

PYTHON3

CODECHEF

13,773

ead56553e782574f944a71d31392cbff

UNKNOWN

The land of Programmers Army is surrounded by many islands. A unique number is associated with each island. The king of the islands is a very generous person, he donates a certain amount of gold coins to travelers for visiting each island that they visited to. Now, you are appointed as a traveler, who will travel to all these(or some) islands as many times as the Army wants, and you will collect gold coins from the king of the island. In each trip, you will be asked to give the total sum of gold coins you have collected. -----Input:----- - The first line of the input contains a single integer $T$. $T$ denoting the number of test cases. The description of $T$ test cases is as follows. - The next line of the input contains a single integer $N$. $N$ denotes the total number of Islands. - The next line of the input contains $N$ space-separated integers $A1, A2, A3...An$ where $ith$ number denotes the maximum number of coins that the king of $ith$ island can donate. - Next line contains a single integer $Q$. $Q$ denotes the total number of times traveler have to go for the trip. - Next $Q$ lines contains, two space-separated integers $Q1,Q2$ denoting the start and end number of islands, i.e. traveler will start the trip from $Q1th$ island and will go till $Q2th$ island, in each trip. Note: islands are numbered from $1$ to $N$. -----Output:----- - For each trip print the total number of gold coins, traveler will collect(each on a new line). -----Constraints:----- - $1 \leq T \leq 100$ - $1 \leq N \leq 10^4$ - $1 \leq A1, A2, A3...An \leq 10^5$ - $1 \leq Q \leq 10^3$ - $1 \leq Q1,Q2 \leq N$ -----Sample Input:----- 1 4 10 2 5 50 2 1 3 2 4 -----Sample Output:----- 17 57 -----Explanation:----- - In 1st Trip, traveler will go from 1st Island to 3rd Island, hence the total number of coins traveler can collect is 10+2+5 = 17 - In 2 d Trip, traveler will go from 2nd Island to 4th Island, hence the total number of coins traveler can collect is 2+5+50 = 57

["# cook your dish here\nfor i in range(int(input())):\n N = int(input())\n l = list(map(int, input().split()))\n for j in range(int(input())):\n q1, q2 = map(int, input().split())\n temp = l[q1 - 1 : q2]\n print(sum(temp))", "# cook your dish here\nfor _ in range(int(input())):\n n=int(input())\n arr=[int(k) for k in input().split()]\n q=int(input())\n for i in range(q):\n \n route=[int(k) for k in input().split()]\n sum =0\n for j in range(route[0]-1,route[1]):\n sum = sum + arr[j]\n \n print(sum)", "for _ in range(int(input())):\n n = int(input())\n arr = [int(k) for k in input().split()]\n q = int(input())\n sum = 0\n for i in range(q):\n start,end = [int(k) for k in input().split()]\n for j in range(start - 1, end):\n sum = sum + arr[j]\n print(sum)\n sum = 0\n", "# cook your dish here\nfor i in range(int(input())):\n n=int(input())\n arr=list(map(int,input().split()[:n]))\n k=int(input())\n for j in range(k):\n s,e=list(map(int,input().split()))\n su=sum(arr[s-1:e])\n print(su)\n \n", "for _ in range(int(input())):\n a=input()\n l=list(map(int,input().split()))\n q=int(input())\n r=[]\n for i in range(q):\n a,b=list(map(int,input().split()))\n print(sum(l[a-1:b]))\n \n \n", "ncases = int(input())\r\n\r\nfor cases in range(ncases):\r\n islands = int(input())\r\n pricelist = list( map( int, input().split()))\r\n if len(pricelist) != islands:\r\n continue\r\n visits = int(input())\r\n\r\n for k in range(visits):\r\n step = list( map( int, input().split()))\r\n print(sum(pricelist[step[0] - 1:step[1]]))\r\n\r\n", "# cook your dish here\nt=int(input())\n\nfor i in range(t):\n n=int(input())\n lst=list(map(int,input().split()))\n \n q=int(input())\n for j in range(q):\n q1,q2=list(map(int,input().split()))\n sum=0\n for k in range(q1-1,q2):\n sum+=lst[k]\n print(sum)\n \n", "# cook your dish here\nT = int(input())\n\nfor no in range(T):\n N = int(input())\n A = list(map(int,input().split()))\n Q = int(input())\n for q in range(Q):\n Q1 = list(map(int,input().split()))\n s = 0\n for i in range(Q1[0] - 1, Q1[1]):\n s += A[i]\n print(s)", "def c(data):\r\n n,a,q,q_i=data\r\n res=[]\r\n for s,e in q_i:\r\n res.append(str(sum(a[s-1:e])))\r\n return '\\n'.join(res)\r\n\r\ndef l():\r\n r=[]\r\n for _ in range(int(input())):\r\n n=int(input())\r\n a=[int(x)for x in input().split()]\r\n q=int(input())\r\n q_i=[tuple([int(x) for x in input().split()])for _ in range(q)]\r\n r.append((n,a,q,q_i))\r\n return r\r\ndef __starting_point():\r\n print('\\n'.join(map(c,l())))\n__starting_point()", "for _ in range(int(input())):\r\n n=int(input())\r\n a=list(map(int,input().split()))\r\n q=int(input())\r\n for i in range(q):\r\n x,y=map(int,input().split())\r\n ans=sum(a[x-1:y])\r\n print(ans)", "for _ in range(int(input())):\n\tn = int(input());arr = list(map(int , input().split()))\n\tfor _ in range(int(input())):\n\t\tstart,end = map(int , input().split())\n\t\tprint(sum(arr[start - 1:end]))", "# cook your dish here\ntry:\n for t in range(int(input())):\n k=int(input().strip(\" \"))\n kc=input().split(\" \")\n for q in range(int(input())):\n q1, q2 = input().split(\" \")\n q1 = int(q1)\n q2 = int(q2)\n sum=0\n for i in range(q1-1,q2):\n sum=sum + int(kc[i].strip())\n print(sum)\nexcept EOFError as e:\n pass\n# except ValueError as r:\n# pass\n", "# cook your dish here\nt=int(input())\nw=[]\nfor i in range(t):\n n=int(input())\n a=list(map(int,input().split()))\n Q=int(input())\n for j in range(Q):\n q=list(map(int,input().split()))\n count=0\n for k in range(q[0],q[1]+1):\n count+=a[k-1]\n w.append(count)\nfor i in w:\n print(i)\n\n\n", "try:\n n=int(input())\n for i in range(n):\n m=int(input())\n l=list(map(int,input().split()))\n q=int(input())\n for j in range(q):\n a,b=list(map(int,input().split()))\n newlist=l[(a-1):b]\n print(sum(newlist))\nexcept e:\n pass\n", "t = int(input())\r\nfor x in range(t):\r\n n = int(input())\r\n arr = input().split()\r\n for i in range(len(arr)):\r\n arr[i] = int(arr[i])\r\n q = int(input())\r\n for y in range(q):\r\n s = input().split()\r\n q1 = int(s[0])-1\r\n q2 = int(s[1])-1\r\n print(sum(arr[q1:q2+1]))", "for i in range(int(input())):\r\n nlands=int(input())\r\n maxcoins=list(map(int,input().split()))\r\n for j in range(int(input())):\r\n trips=list(map(int,input().split()))\r\n print(sum(maxcoins[trips[0]-1:trips[1]]))", "from sys import stdin\r\n\r\n# Input data\r\n#stdin = open(\"input\", \"r\")\r\n\r\n\r\nfor _ in range(int(stdin.readline())):\r\n n = int(stdin.readline())\r\n arr = list(map(int, stdin.readline().split()))\r\n for i in range(int(stdin.readline())):\r\n a, b = list(map(int, stdin.readline().split()))\r\n print(sum(arr[a - 1:b]))\r\n", "for i in range(int(input())):\n n = int(input())\n a = list(map(int, input().split()))\n q = int(input())\n for j in range(q):\n x,y = list(map(int, input().split()))\n print(sum(a[x-1:y]))\n", "# cook your dish here\ntestcases=int(input())\n\nfor _ in range(testcases):\n total_islands=int(input())\n \n coins_list=list(map(int,input().split()))\n \n total_trips=int(input())\n \n\n \n for _ in range(total_trips):\n coins=0\n \n (start,end)=list(map(int,input().split()))\n \n for i in range(start-1,end):\n coins=coins+coins_list[i]\n \n print(coins)\n \n", "# cook your dish here\nt=int(input())\nfor _ in range(t):\n n=int(input())\n l=list(map(int,input().split()))\n q=int(input())\n for i in range(q):\n a,b=map(int,input().split())\n print(sum(l[a-1:b]))", "T=int(input())\nfor _ in range(T):\n a=int(input())\n b=list(map(int,input().split()))\n c=int(input())\n for _ in range(c):\n d=list(map(int,input().split()))\n e=d[0]-1\n print(sum(b[e:d[1]]))\n", "# cook your dish here\nimport sys\ndef get_ints(): return map(int, sys.stdin.readline().strip().split())\ndef get_list(): return list(map(int, sys.stdin.readline().strip().split()))\ndef get_list_string(): return list(map(str, sys.stdin.readline().strip().split()))\ndef get_string(): return sys.stdin.readline().strip()\ndef get_int(): return int(sys.stdin.readline().strip())\ndef get_print_int(x): sys.stdout.write(str(x) + '\\n')\ndef get_print(x): sys.stdout.write(x + '\\n')\n\ndef solve():\n for _ in range(get_int()):\n n = get_int()\n arr = get_list()\n pre = [0]*n\n pre[0] = arr[0]\n for i in range(1,n):\n pre[i] = pre[i-1] + arr[i]\n q = get_int()\n while(q):\n s,e = get_ints()\n s -= 1\n e -= 1\n if(s == 0):\n get_print_int(pre[e])\n else:\n get_print_int(pre[e] - pre[s-1])\n q -= 1\nsolve()", "try:\r\n def fun(N,coins,q1,q2):\r\n arr=coins[q1-1:q2]\r\n return sum(arr)\r\n \r\n \r\n T=int(input())\r\n for _ in range(T):\r\n N=int(input())\r\n coins = [int(i) for i in input().split()]\r\n q = int(input())\r\n for i in range(q):\r\n q1,q2 = list(map(int,input().split()))\r\n print(fun(N,coins,q1,q2))\r\n \r\nexcept:\r\n pass\r\n", "try:\n def fun(N,coins,q1,q2):\n arr=coins[q1-1:q2]\n return sum(arr)\n \n \n T=int(input())\n for _ in range(T):\n N=int(input())\n coins = [int(i) for i in input().split()]\n q = int(input())\n for i in range(q):\n q1,q2 = list(map(int,input().split()))\n print(fun(N,coins,q1,q2))\n \nexcept:\n pass\n", "t= int(input())\nresult = []\n \ndef logic(arr,p1,p2):\n return sum(arr[p1-1:p2])\n \n\nfor i in range(0,t):\n n = int(input())\n arr = list(map(int, input().split()))\n q = int(input())\n for x in range(0,q):\n p1,p2 = list(map(int,input().split())) \n result.append(logic(arr,p1,p2))\n \nfor item in result:\n print(item)\n"]

{"inputs": [["1", "4", "10 2 5 50", "2", "1 3", "2 4"]], "outputs": [["17", "57"]]}

INTERVIEW

PYTHON3

CODECHEF

8,813

5120d67b7482c0ad0edced8aa1c128bb

UNKNOWN

-----Coal Company ----- The Tunisian Coal Mining company uses a train to ferry out coal blocks from its coal mines. The train has N containers numbered from 1 to N which need to be filled with blocks of coal. Assume there are infinite coal blocks. The containers are arranged in increasing order of capacity, and the ith container has capacity i. Every container has a specific loading cost ci. The workers fill the containers in rounds. In every round, they choose a subset of containers and load them with coal blocks. This subset should be such that each subsequent container chosen in a round should be more spacious than the previous one. Also, the difference in loading cost of consecutive containers should be at least K. What is the least number of rounds in which all containers can be filled? ----- Input ----- The first line contains the number of test cases T. T test cases follow. Each case contains an integer N and K on the first line, followed by integers c1,...,cn on the second line. 1 <= T <= 100 1 <= N <= 300 1 <= ci <= 1000 1 <= K <= 1000 ----- Output ----- Output T lines, one for each test case, containing the minimum number of rounds in which all containers could be filled. ----- Example ----- Input: 2 3 2 5 4 7 5 1 5 3 4 5 6 Output: 2 1 Explanation: For the first example, workers can fill the containers of cost 5 and 7 in the first round and the container with cost 4 in the next round. Note that the containers with cost 5 and 4 cannot be filled consecutively because the loading costs should differ by at least K (which is 2). Also, the containers cannot be filled in order 5, 7, 4 in one round because the containers filled in a round should be in increasing capacity.

["for _ in range(int(input())):\n n,k=list(map(int,input().split()))\n c=list(map(int,input().split()))\n count=1\n for i in range(n):\n if i+1<n:\n if c[i]-c[i+1]>=k or c[i+1]-c[i]>=k:\n continue\n else:\n count+=1\n c[i],c[i+1]=c[i+1],c[i]\n print(count)\n \n"]

{"inputs": [["2", "3 2", "5 4 7", "5 1", "5 3 4 5 6"]], "outputs": [["2", "1"]]}

INTERVIEW

PYTHON3

CODECHEF

280

be0a5dae02f65c3e2c573cafe5a2c8a0

UNKNOWN

"If you didn't copy assignments during your engineering course, did you even do engineering?" There are $Q$ students in Chef's class. Chef's teacher has given the students a simple assignment: Write a function that takes as arguments an array $A$ containing only unique elements and a number $X$ guaranteed to be present in the array and returns the ($1$-based) index of the element that is equal to $X$. The teacher was expecting a linear search algorithm, but since Chef is such an amazing programmer, he decided to write the following binary search function: integer binary_search(array a, integer n, integer x): integer low, high, mid low := 1 high := n while low ≤ high: mid := (low + high) / 2 if a[mid] == x: break else if a[mid] is less than x: low := mid+1 else: high := mid-1 return mid All of Chef's classmates have copied his code and submitted it to the teacher. Chef later realised that since he forgot to sort the array, the binary search algorithm may not work. Luckily, the teacher is tired today, so she asked Chef to assist her with grading the codes. Each student's code is graded by providing an array $A$ and an integer $X$ to it and checking if the returned index is correct. However, the teacher is lazy and provides the exact same array to all codes. The only thing that varies is the value of $X$. Chef was asked to type in the inputs. He decides that when typing in the input array for each code, he's not going to use the input array he's given, but an array created by swapping some pairs of elements of this original input array. However, he cannot change the position of the element that's equal to $X$ itself, since that would be suspicious. For each of the $Q$ students, Chef would like to know the minimum number of swaps required to make the algorithm find the correct answer. -----Input----- - The first line of the input contains a single integer $T$ denoting the number of test cases. The description of $T$ test cases follows. - The first line of each test case contains two space-separated integers $N$ and $Q$ denoting the number of elements in the array and the number of students. - The second line contains $N$ space-separated integers $A_1, A_2, \dots, A_N$. - The following $Q$ lines describe queries. Each of these lines contains a single integer $X$. -----Output----- For each query, print a single line containing one integer — the minimum required number of swaps, or $-1$ if it is impossible to make the algorithm find the correct answer. (Do you really think Chef can fail?) -----Constraints----- - $1 \le T \le 10$ - $1 \le N, Q \le 10^5$ - $1 \le A_i \le 10^9$ for each valid $i$ - $1 \le X \le 10^9$ - all elements of $A$ are pairwise distinct - for each query, $X$ is present in $A$ - sum of $N$ over all test cases $\le 5\cdot10^5$ - sum of $Q$ over all test cases $\le 5\cdot10^5$ -----Subtasks----- Subtask #1 (20 points): $1 \le N \le 10$ Subtask #2 (30 points): - $1 \le A_i \le 10^6$ for each valid $i$ - $1 \le X \le 10^6$ Subtask #3 (50 points): original constraints -----Example Input----- 1 7 7 3 1 6 7 2 5 4 1 2 3 4 5 6 7 -----Example Output----- 0 1 1 2 1 0 0 -----Explanation----- Example case 1: - Query 1: The algorithm works without any swaps. - Query 2: One solution is to swap $A_2$ and $A_4$. - Query 3: One solution is to swap $A_2$ and $A_6$. - Query 4: One solution is to swap $A_2$ with $A_4$ and $A_5$ with $A_6$. - Query 5: One solution is to swap $A_2$ and $A_4$. - Query 6: The algorithm works without any swaps. - Query 7: The algorithm works without any swaps.

["def f(a,y,index,sorted_pos):\n #print(a,y,index,sorted_pos)\n n=len(a)\n low=0\n high=n-1\n L,R=0,0\n l,r=0,0\n while(low<=high):\n mid=(low+high)//2\n #print(low,high,mid)\n if(a[mid]== y):\n break\n elif(mid > index[y]):\n high=mid-1\n L+=1\n #print(\"L\")\n if(a[mid] <y):\n l+=1\n #print(\" l \")\n else:\n low=mid+1\n R+=1\n #print(\"R\")\n if(a[mid]>y):\n r+=1\n #print(\"r\")\n x=sorted_pos[y]\n #print(L,R,l,r,x,n-x-1)\n if(R>x or L> n-x-1):\n print(\"-1\")\n else:\n print(max(l,r))\n\n\ndef fun():\n test=int(input())\n for t in range(test):\n n,q=list(map(int,input().split()))\n arr=list(map(int,input().split()))\n index= dict()\n for i in range(n):\n index[arr[i]]=i\n sorted_pos=dict()\n a=sorted(arr)\n for i in range(n):\n sorted_pos[a[i]]=i\n for x in range(q):\n y=int(input())\n f(arr,y,index,sorted_pos)\n\nfun()\n\n", "from sys import stdin,stdout\nt=int(stdin.readline())\nwhile(t):\n n,q=list(map(int,stdin.readline().rstrip().split()))\n arr=list(map(int,stdin.readline().rstrip().split()))\n d={}\n d1={}\n a=arr.copy()\n a.sort()\n for i in range(n):\n d1[a[i]]=i\n d[arr[i]]=i\n while(q):\n v=int(stdin.readline().rstrip())\n index=d[v]\n smaller=d1[v]\n bigger=n-smaller-1\n low,high=0,n-1\n c1,c2=0,0\n while(high>=low):\n mid=(high+low)//2\n if mid==index:\n break\n elif index>mid:\n if arr[mid]>v:\n c1+=1\n else:\n smaller-=1\n low=mid+1\n else:\n if v>arr[mid]:\n c2+=1\n else:\n bigger-=1\n high=mid-1\n if c2>c1:\n if bigger>=(c2-c1):\n print(c2)\n else:\n print(-1)\n elif c1>c2:\n if smaller>=(c1-c2):\n print(c1)\n else:\n print(-1)\n else:\n print(c1)\n q-=1\n t-=1\n\n", "def binarySearch(start, end, xindex,opList):\n if start <= end:\n midindex = int((start+end)/2)\n opList.append(midindex)\n if xindex < midindex:\n return binarySearch(start, midindex-1, xindex, opList)\n\n elif xindex > midindex:\n return binarySearch(midindex+1, end, xindex, opList)\n\n else:\n return opList\n\n\ndef counter(opList,a, x):\n small = 0\n big = 0\n rightSmall = 0\n rightBig = 0\n\n for i in range(len(opList)-1):\n # print(\"for oplist[\",i,\"]=\",opList[i])\n if opList[i] < opList[i+1]:\n # print(\"traverse to right\")\n if x < a[opList[i]]:\n # print(\"x is small\")\n small += 1\n else:\n rightSmall += 1\n else:\n # print(\"traverse to left\")\n if x> a[opList[i]]:\n # print(\"x is big\")\n big += 1\n else:\n rightBig += 1\n flag = isBigSmallAvailable(small,big,x,a,rightBig,rightSmall)\n if flag:\n total = small + big\n total = total - min(small,big)\n return total\n else:\n return -1\n\n\ndef isBigSmallAvailable(small,big,x,a,rightBig,rightSmall):\n s = 0\n b = 0\n s = s - rightSmall\n b = b - rightBig\n length = len(a)\n for i in range(length):\n if a[i] < x:\n s += 1\n if a[i] > x:\n b += 1\n\n if s >= small and b >= big:\n return True\n return False\n\n\nt = int(input())\nfor z in range(t):\n l = list(map(int,input().split()))\n n = int(l[0])\n q = int(l[1])\n a = list(map(int,input().split()))\n for i in range(q):\n x = int(input())\n xindex = a.index(x)\n opList = []\n result = binarySearch(0, n-1, xindex, opList)\n count = counter(opList, a, x)\n\n # print(result)\n print(count)\n # else:\n # print(swapCount)\n", "def binarySearch(start, end, xindex,opList):\n if start <= end:\n midindex = int((start+end)/2)\n\n opList.append(midindex)\n if xindex < midindex :\n return binarySearch(start, midindex-1, xindex, opList)\n\n elif xindex > midindex :\n return binarySearch(midindex+1, end, xindex, opList)\n\n else:\n return opList\n\n\ndef counter(opList,a, x):\n small = 0\n big = 0\n rightSmall = 0\n rightBig = 0\n\n for i in range(len(opList)-1):\n # print(\"for oplist[\",i,\"]=\",opList[i])\n if opList[i] < opList[i+1]:\n # print(\"traverse to right\")\n if x < a[opList[i]]:\n # print(\"x is small\")\n small += 1\n else:\n rightSmall += 1\n else:\n # print(\"traverse to left\")\n if x> a[opList[i]]:\n # print(\"x is big\")\n big += 1\n else:\n rightBig += 1\n flag = isBigSmallAvailable(small,big,x,a,rightBig,rightSmall)\n if flag:\n total = small + big\n total = total - min(small,big)\n return total\n else:\n return -1\n\n\ndef isBigSmallAvailable(small,big,x,a,rightBig,rightSmall):\n s = 0\n b = 0\n s = s - rightSmall\n b = b - rightBig\n length = len(a)\n for i in range(length):\n if a[i] < x:\n s += 1\n if a[i] > x:\n b += 1\n\n if s >= small and b >= big:\n return True\n # s = s - rightSmall\n # b = b - rightBig\n # print(\"big \",b)\n\n return False\n\n\nt = int(input())\nswapCount = 0\nswaped = []\nvisited = []\nfor z in range(t):\n l = list(map(int,input().split()))\n n = int(l[0])\n q = int(l[1])\n aa = list(map(int,input().split()))\n for i in range(q):\n swapCount = 0\n swaped.clear()\n visited.clear()\n a = aa[:]\n # print(\"aa is\",aa)\n\n x = int(input())\n # a.sort()\n xindex = a.index(x)\n opList = []\n result = binarySearch(0, n-1, xindex, opList)\n count = counter(opList, a, x)\n\n # print(result)\n print(count)\n # else:\n # print(swapCount)\n", "def binarySearch(start, end, xindex,opList):\n if start <= end:\n midindex = int((start+end)/2)\n\n opList.append(midindex)\n if xindex < midindex :\n return binarySearch(start, midindex-1, xindex, opList)\n\n elif xindex > midindex :\n return binarySearch(midindex+1, end, xindex, opList)\n\n else:\n return opList\n\n\ndef counter(opList,a, x):\n small = 0\n big = 0\n rightSmall = 0\n rightBig = 0\n\n for i in range(len(opList)-1):\n # print(\"for oplist[\",i,\"]=\",opList[i])\n if opList[i] < opList[i+1]:\n # print(\"traverse to right\")\n if x < a[opList[i]]:\n # print(\"x is small\")\n small += 1\n else:\n rightSmall += 1\n else:\n # print(\"traverse to left\")\n if x> a[opList[i]]:\n # print(\"x is big\")\n big += 1\n else:\n rightBig += 1\n flag = isBigSmallAvailable(small,big,x,a,rightBig,rightSmall)\n if flag:\n total = small + big\n total = total - min(small,big)\n return total\n else:\n return -1\n\n\ndef isBigSmallAvailable(small,big,x,a,rightBig,rightSmall):\n s = 0\n b = 0\n length = len(a)\n for i in range(length):\n if a[i] < x:\n s += 1\n if a[i] > x:\n b += 1\n s = s - rightSmall\n b = b - rightBig\n # print(\"big \",b)\n if s>=small and b>=big:\n return True\n return False\n\n\nt = int(input())\nswapCount = 0\nswaped = []\nvisited = []\nfor z in range(t):\n l = list(map(int,input().split()))\n n = int(l[0])\n q = int(l[1])\n aa = list(map(int,input().split()))\n for i in range(q):\n swapCount = 0\n swaped.clear()\n visited.clear()\n a = aa[:]\n # print(\"aa is\",aa)\n\n x = int(input())\n # a.sort()\n xindex = a.index(x)\n opList = []\n result = binarySearch(0, n-1, xindex, opList)\n count = counter(opList, a, x)\n\n # print(result)\n print(count)\n # else:\n # print(swapCount)\n", "def binarySearch(start, end, xindex,opList):\n if start <= end:\n midindex = int((start+end)/2)\n\n opList.append(midindex)\n if xindex < midindex :\n return binarySearch(start, midindex-1, xindex, opList)\n\n elif xindex > midindex :\n return binarySearch(midindex+1, end, xindex, opList)\n\n else:\n return opList\n\n\ndef counter(opList,a, x):\n small = 0\n big = 0\n rightSmall = 0\n rightBig = 0\n\n for i in range(len(opList)-1):\n # print(\"for oplist[\",i,\"]=\",opList[i])\n if opList[i] < opList[i+1]:\n # print(\"traverse to right\")\n if x < a[opList[i]]:\n # print(\"x is small\")\n small += 1\n else:\n rightSmall += 1\n else:\n # print(\"traverse to left\")\n if x> a[opList[i]]:\n # print(\"x is big\")\n big += 1\n else:\n rightBig += 1\n flag = isBigSmallAvailable(small,big,x,a,rightBig,rightSmall)\n if flag:\n total = small + big\n total = total - min(small,big)\n return total\n else:\n return -1\n\n\ndef isBigSmallAvailable(small,big,x,a,rightBig,rightSmall):\n s = 0\n b = 0\n for i in range(len(a)):\n if a[i] < x:\n s += 1\n if a[i] > x:\n b += 1\n s = s - rightSmall\n b = b - rightBig\n # print(\"big \",b)\n if s>=small and b>=big:\n return True\n return False\n\n\nt = int(input())\nswapCount = 0\nswaped = []\nvisited = []\nfor z in range(t):\n l = list(map(int,input().split()))\n n = int(l[0])\n q = int(l[1])\n aa = list(map(int,input().split()))\n for i in range(q):\n swapCount = 0\n swaped.clear()\n visited.clear()\n a = aa[:]\n # print(\"aa is\",aa)\n\n x = int(input())\n # a.sort()\n xindex = a.index(x)\n opList = []\n result = binarySearch(0, n-1, xindex, opList)\n count = counter(opList, a, x)\n\n # print(result)\n print(count)\n # else:\n # print(swapCount)\n", "for _ in range(int(input())):\n n,q=list(map(int,input().split()))\n l=[int(i) for i in input().split()]\n d={}\n ind={}\n for i in range(n):\n ind[l[i]]=i \n #dup=l[:]\n dup=sorted(l)\n for i in range(n):\n chote=i \n bade=n-i-1 \n d[dup[i]]=[chote,bade]\n for _ in range(q):\n chotewale_swap=0 \n badewale_swap=0\n x=int(input())\n #d1=d[x].copy()\n d1={}\n d1[0]=d[x][0]\n d1[1]=d[x][1]\n f=1\n low=0\n high=n-1 \n while low<=high:\n mid=(low+high)//2 \n if ind[x]==mid:\n break \n elif ind[x]>mid and x>l[mid]:\n if d1[0]==0:\n f=-1 \n break \n d1[0]-=1 \n low=mid+1\n elif ind[x]>mid and x<l[mid]:\n if d1[0]==0:\n f=-1 \n break \n d1[0]-=1 \n chotewale_swap+=1\n low=mid+1\n elif ind[x]<mid and x<l[mid]:\n if d1[1]==-1:\n f=-1 \n break \n d1[1]-=1 \n high=mid-1\n elif ind[x]<mid and x>l[mid]:\n if d1[1]==0:\n f=-1 \n break \n d1[1]-=1 \n badewale_swap+=1 \n high=mid-1 \n if f==-1:\n print(-1)\n else:\n print(max(chotewale_swap,badewale_swap))\n", "for _ in range(int(input())):\n n,q=list(map(int,input().split()))\n l=[int(i) for i in input().split()]\n d={}\n ind={}\n for i in range(n):\n ind[l[i]]=i \n #dup=l[:]\n dup=sorted(l)\n for i in range(n):\n chote=i \n bade=n-i-1 \n d[dup[i]]=[chote,bade]\n for _ in range(q):\n chotewale_swap=0 \n badewale_swap=0\n x=int(input())\n #d1=d[x].copy()\n d1={}\n d1[0]=d[x][0]\n d1[1]=d[x][1]\n f=1\n low=0\n high=n-1 \n while low<=high:\n mid=(low+high)//2 \n if ind[x]==mid:\n break \n elif ind[x]>mid and x>l[mid]:\n d1[0]-=1 \n low=mid+1\n elif ind[x]>mid and x<l[mid]:\n if d1[0]==0:\n f=-1 \n break \n d1[0]-=1 \n chotewale_swap+=1\n low=mid+1\n elif ind[x]<mid and x<l[mid]:\n d1[1]-=1 \n high=mid-1\n elif ind[x]<mid and x>l[mid]:\n if d1[1]==0:\n f=-1 \n break \n d1[1]-=1 \n badewale_swap+=1 \n high=mid-1 \n if f==-1:\n print(-1)\n else:\n print(max(chotewale_swap,badewale_swap))\n", "for _ in range(int(input())):\n n,q=list(map(int,input().split()))\n l=[int(i) for i in input().split()]\n d={}\n ind={}\n for i in range(n):\n ind[l[i]]=i \n #dup=l[:]\n dup=sorted(l)\n for i in range(n):\n chote=i \n bade=n-i-1 \n d[dup[i]]=[chote,bade]\n for _ in range(q):\n chotewale_swap=0 \n badewale_swap=0\n x=int(input())\n d1=d[x].copy()\n f=1\n low=0\n high=n-1 \n while low<=high:\n mid=(low+high)//2 \n if ind[x]==mid:\n break \n elif ind[x]>mid and x>l[mid]:\n d1[0]-=1 \n low=mid+1\n elif ind[x]>mid and x<l[mid]:\n if d1[0]==0:\n f=-1 \n break \n d1[0]-=1 \n chotewale_swap+=1\n low=mid+1\n elif ind[x]<mid and x<l[mid]:\n d1[1]-=1 \n high=mid-1\n elif ind[x]<mid and x>l[mid]:\n if d1[1]==0:\n f=-1 \n break \n d1[1]-=1 \n badewale_swap+=1 \n high=mid-1 \n if f==-1:\n print(-1)\n else:\n print(max(chotewale_swap,badewale_swap))\n", "def f(a,y,index,sorted_pos):\n #print(a,y,index,sorted_pos)\n n=len(a)\n low=0\n high=n-1\n L,R=0,0\n l,r=0,0\n while(low<=high):\n mid=(low+high)//2\n #print(low,high,mid)\n if(a[mid]== y):\n break\n elif(mid > index[y]):\n high=mid-1\n L+=1\n #print(\"L\")\n if(a[mid] <y):\n l+=1\n #print(\" l \")\n else:\n low=mid+1\n R+=1\n #print(\"R\")\n if(a[mid]>y):\n r+=1\n #print(\"r\")\n x=sorted_pos[y]\n #print(L,R,l,r,x,n-x-1)\n if(R>x or L> n-x-1):\n print(\"-1\")\n else:\n print(max(l,r))\n\n\ndef fun():\n test=int(input())\n for t in range(test):\n n,q=list(map(int,input().split()))\n arr=list(map(int,input().split()))\n index= dict()\n for i in range(n):\n index[arr[i]]=i\n sorted_pos=dict()\n a=sorted(arr)\n for i in range(n):\n sorted_pos[a[i]]=i\n for x in range(q):\n y=int(input())\n f(arr,y,index,sorted_pos)\n\nfun()\n\n", "for _ in range(int(input())):\n n,q=list(map(int,input().split()))\n l=[int(i) for i in input().split()]\n d={}\n ind={}\n for i in range(n):\n ind[l[i]]=i \n dup=l[:]\n dup=sorted(dup)\n for i in range(n):\n chote=i \n bade=n-i-1 \n d[dup[i]]=[chote,bade]\n for _ in range(q):\n chotewale_swap=0 \n badewale_swap=0\n x=int(input())\n d1=d[x].copy()\n f=1\n low=0\n high=n-1 \n while low<=high:\n mid=(low+high)//2 \n if ind[x]==mid:\n break \n elif ind[x]>mid and x>l[mid]:\n d1[0]-=1 \n low=mid+1\n elif ind[x]>mid and x<l[mid]:\n if d1[0]==0:\n f=-1 \n break \n d1[0]-=1 \n chotewale_swap+=1\n low=mid+1\n elif ind[x]<mid and x<l[mid]:\n d1[1]-=1 \n high=mid-1\n elif ind[x]<mid and x>l[mid]:\n if d1[1]==0:\n f=-1 \n break \n d1[1]-=1 \n badewale_swap+=1 \n high=mid-1 \n if f==-1:\n print(-1)\n else:\n print(max(chotewale_swap,badewale_swap))\n", "for _ in range(int(input())):\n n,q=list(map(int,input().split()))\n l=[int(i) for i in input().split()]\n d={}\n ind={}\n for i in range(n):\n ind[l[i]]=i \n dup=l.copy()\n dup.sort()\n for i in range(n):\n chote=i \n bade=n-i-1 \n d[dup[i]]=[chote,bade]\n for _ in range(q):\n chotewale_swap=0 \n badewale_swap=0\n x=int(input())\n d1=d[x].copy()\n f=1\n low=0\n high=n-1 \n while low<high:\n mid=(low+high)//2 \n if ind[x]==mid:\n break \n elif ind[x]>mid and x>l[mid]:\n d1[0]-=1 \n low=mid+1\n elif ind[x]>mid and x<l[mid]:\n if d1[0]==0:\n f=-1 \n break \n d1[0]-=1 \n chotewale_swap+=1\n low=mid+1\n elif ind[x]<mid and x<l[mid]:\n d1[1]-=1 \n high=mid-1\n elif ind[x]<mid and x>l[mid]:\n if d1[1]==0:\n f=-1 \n break \n d1[1]-=1 \n badewale_swap+=1 \n high=mid-1 \n if f==-1:\n print(-1)\n else:\n print(max(chotewale_swap,badewale_swap))\n", "for _ in range(int(input())):\n n,q=list(map(int,input().split()))\n l=[int(i) for i in input().split()]\n d={}\n ind={}\n for i in range(n):\n ind[l[i]]=i \n dup=l.copy()\n dup.sort()\n for i in range(n):\n chote=i \n bade=n-i-1 \n d[dup[i]]=[chote,bade]\n for _ in range(q):\n chotewale_swap=0 \n badewale_swap=0\n x=int(input())\n d1=d[x].copy()\n f=1\n low=0\n high=n-1 \n while low<=high:\n mid=(low+high)//2 \n if ind[x]==mid:\n break \n elif ind[x]>mid and x>l[mid]:\n d1[0]-=1 \n low=mid+1\n elif ind[x]>mid and x<l[mid]:\n if d1[0]==0:\n f=-1 \n break \n d1[0]-=1 \n chotewale_swap+=1\n low=mid+1\n elif ind[x]<mid and x<l[mid]:\n d1[1]-=1 \n high=mid-1\n elif ind[x]<mid and x>l[mid]:\n if d1[1]==0:\n f=-1 \n break \n d1[1]-=1 \n badewale_swap+=1 \n high=mid-1 \n if f==-1:\n print(-1)\n else:\n print(max(chotewale_swap,badewale_swap))\n", "t = int(input())\nwhile t > 0:\n t -= 1\n n, q = list(map(int, input().split()))\n arr = list(map(int, input().split()))\n tarr = sorted(arr)\n d = {}\n inddir = {}\n for i in range(len(arr)):\n inddir[arr[i]] = i\n tarrlen = len(tarr)\n for i in range(len(tarr)):\n d[tarr[i]] = [i, tarrlen - i - 1]\n for _ in range(q):\n k = int(input())\n find = inddir[k]\n l, r = 1, tarrlen\n gs=0\n ls=0\n sw = 0\n tempc = d[k].copy()\n while l <= r:\n mid = (l + r) // 2\n if mid - 1 == find:\n break\n elif mid - 1 < find:\n if arr[mid - 1] < k:\n if tempc[0] > 0:\n tempc[0] -= 1\n else:\n sw = -1\n break\n else:\n if tempc[0] > 0:\n tempc[0] -= 1\n sw += 1\n ls+=1\n else:\n sw = -1\n break\n l = mid + 1\n else:\n if arr[mid - 1] > k:\n if tempc[1] > 0:\n tempc[1] -= 1\n else:\n sw = -1\n break\n else:\n if tempc[1] > 0:\n tempc[1] -= 1\n sw += 1\n gs+=1\n else:\n sw = -1\n break\n r = mid - 1\n print(max(ls,gs) if sw!=-1 else -1)\n", "T=int(input())\nfor xs in range(T):\n N,Q=[int(o) for o in input().split()]\n a=[int(o) for o in input().split()]\n b=sorted(a)\n Di={} #Dictionary\n for i in range(len(a)):\n Di[a[i]]=[i]\n for i in range(len(b)):\n Di[b[i]].append(i) \n r=[]\n qu=[int(input()) for j in range(Q)]\n for q in qu:\n low=1\n high=N\n ind=Di[q][0]+1\n b=[]\n f=[]\n s=0\n maxs=N-Di[q][1]-1\n mins=N-maxs-1\n while low<=high: #Binary Search algorithm\n mid=(low+high)//2\n if mid==ind:\n break\n elif mid<ind:\n low=mid+1\n if a[mid-1]>q:\n b.append(a[mid-1])\n else:\n mins-=1 \n elif mid>ind:\n high=mid-1\n if a[mid-1]<q:\n f.append(a[mid-1])\n else:\n maxs-=1\n lenf=len(f)\n lenb=len(b)\n sw=min(lenf,lenb)\n rs=max(lenf,lenb)-sw\n mins,maxs=mins-sw,maxs-sw\n ex=min(mins,maxs)\n if ex<rs: \n r.append(-1)\n s=1\n else:\n sw+=rs # When ex>=rs\n if not s:\n r.append(sw) \n for ans in r:\n print(ans) #Final"]

{"inputs": [["1", "7 7", "3 1 6 7 2 5 4", "1", "2", "3", "4", "5", "6", "7"]], "outputs": [["0", "1", "1", "2", "1", "0", "0"]]}

INTERVIEW

PYTHON3

CODECHEF

17,582

324c5dc9f871558c7c56fdbf119caa88

UNKNOWN

Chef likes strings a lot but he likes palindromic strings more. Today, Chef has two strings A and B, each consisting of lower case alphabets. Chef is eager to know whether it is possible to choose some non empty strings s1 and s2 where s1 is a substring of A, s2 is a substring of B such that s1 + s2 is a palindromic string. Here '+' denotes the concatenation between the strings. Note: A string is a palindromic string if it can be read same both forward as well as backward. To know more about palindromes click here. -----Input----- - First line of input contains a single integer T denoting the number of test cases. - For each test case: - First line contains the string A - Second line contains the string B. -----Output----- For each test case, Print "Yes" (without quotes) if it possible to choose such strings s1 & s2. Print "No" (without quotes) otherwise. -----Constraints----- - 1 ≤ T ≤ 10 - 1 ≤ |A|, |B| ≤ 1000 -----Subtasks----- - Subtask 1: 1 ≤ |A|, |B| ≤ 10 : ( 40 pts ) - Subtask 2: 1 ≤ |A|, |B| ≤ 1000 : ( 60 pts ) -----Example-----Input 3 abc abc a b abba baab Output Yes No Yes -----Explanation----- - Test 1: One possible way of choosing s1 & s2 is s1 = "ab", s2 = "a" such that s1 + s2 i.e "aba" is a palindrome. - Test 2: There is no possible way to choose s1 & s2 such that s1 + s2 is a palindrome. - Test 3: You can figure it out yourself.

["t=int(input())\nfor _ in range (t):\n str1=input()\n str2=input()\n res='No'\n for i in str1:\n if i in str2:\n res='Yes'\n break\n print(res)\n", "for _ in range(int(input())):\n str1=input()\n str2=input()\n res='No'\n for i in str1:\n if i in str2:\n res='Yes'\n break\n print(res)", "# cook your dish here\nt = int(input())\nfor i in range(t):\n a = input()\n b= input()\n c=0\n for i in a:\n if i in b:\n c=1\n break\n else:\n continue\n if c==1:\n print(\"Yes\")\n else:\n print(\"No\")\n", "T=int(input())\nfor i in range(T):\n A=input()\n B=input()\n flag=0\n for i in A:\n if i in B:\n flag=1\n break\n if(flag==0):\n print(\"No\")\n else:\n print(\"Yes\")\n", "for _ in range(int(input())):\n a=set(list(input()))\n b=set(list(input()))\n if len(a&b)==0:\n print('No')\n else:\n print('Yes')\n", "a=int(input())\nwhile a:\n a=a-1\n b=input()\n c=input()\n p=[]\n for i in c:\n if i not in p:\n p.append(i) \n f=0 \n for i in b:\n if i not in p:\n continue \n else:\n f=1 \n break\n if f==1:\n print(\"Yes\")\n else:\n print(\"No\")\n", "for _ in range(int(input())):\n s1,s2=input(),input()\n for i in s1:\n if i in s2:\n print(\"Yes\")\n break\n else:\n print(\"No\")", "# cook your dish here\nfor _ in range(int(input())):\n a=input()\n b=input()\n for i in b:\n if(i in a):\n print(\"Yes\")\n break\n else:\n print(\"No\")", "t=int(input())\nfor x in range(t):\n a=input()\n b=input()\n flag=False\n for i in a:\n if i in b:\n flag=True\n break\n if flag :\n print(\"Yes\")\n else:\n print(\"No\")\n \n\n", "# cook your dish here\nfor i in range(int(input())):\n s1=input()\n s2=input()\n c=0\n for i in s1:\n for j in s2:\n if(i==j):\n c+=1\n if(c>0):\n print('Yes')\n else:\n print('No')", "# cook your dish here\nt=int(input())\nfor _ in range(t):\n a=str(input())\n b=str(input())\n k=0\n for i in a:\n for j in b:\n if(i==j):\n k+=1\n if(k>0):\n print('Yes')\n else:\n print('No')", "# cook your dish here\nt=int(input())\nfor ts in range(t):\n s1=str(input())\n s2=str(input())\n c=0\n for i in s1:\n for j in s2:\n if(i==j):\n c=c+1\n if(c>0):\n print('Yes')\n else:\n print('No')", "# cook your dish here\nt = int(input())\nfor z in range(t) :\n a = input()\n b = input()\n s1 = set(a)\n s2 = set(b)\n if s1&s2 :\n print(\"Yes\")\n else:\n print(\"No\")", "# cook your dish here\nt=int(input())\nfor ts in range(t):\n s1=str(input())\n s2=str(input())\n c=0\n for i in s1:\n for j in s2:\n if(i==j):\n c=c+1\n if(c>0):\n print('Yes')\n else:\n print('No')", "# cook your dish here\nx=int(input())\nfor i in range(x):\n s1=str(input())\n s2=str(input())\n c=0\n for j in s1:\n for k in s2:\n if(j==k):\n c=c+1\n if(c>0):\n print('Yes')\n else:\n print('No')", "# cook your dish her\nfor _ in range(int(input())):\n x=set(input())\n y=set(input())\n if(len(x&y)):\n print('Yes')\n else:\n print('No')\n", "# cook your dish here\nfor i in range(int(input())):\n s1=set(input())\n s2=set(input())\n if(len(s1&s2)):\n print('Yes')\n else:\n print('No')\n", "# cook your dish here\nt=int(input())\nfor _ in range(t):\n a=str(input())\n b=str(input())\n k=0\n for i in a:\n for j in b:\n if(i==j):\n k+=1\n if(k>0):\n print('Yes')\n else:\n print('No')", "import sys\n\n#def input(): return sys.stdin.readline().strip()\ndef iinput(): return int(input())\n#def rinput(): return map(int, sys.stdin.readline().strip().split()) \n#def get_list(): return list(map(int, sys.stdin.readline().strip().split())) \n\nfor _ in range(iinput()):\n s1=set(input())\n s2=set(input())\n if(len(s1&s2)):\n print('Yes')\n else:\n print('No')\n \n \n", "# cook your dish here\nn=int(input())\nfor i in range(n):\n a=input()\n b=input()\n c=0\n for i in a:\n if i in b:\n c=1\n print(\"Yes\")\n break\n if c==0:\n print(\"No\")\n", "import sys\n\n#def input(): return sys.stdin.readline().strip()\ndef iinput(): return int(input())\n#def rinput(): return map(int, sys.stdin.readline().strip().split()) \n#def get_list(): return list(map(int, sys.stdin.readline().strip().split())) \n\nfor _ in range(iinput()):\n s1=set(input())\n s2=set(input())\n if(len(s1&s2)):\n print('Yes')\n else:\n print('No')\n \n \n", "for _ in range(int(input())):\n a=set(input())\n b=set(input())\n print('Yes' if len(a&b)>0 else 'No')", "def solve(s1,s2):\n for i in s1:\n for j in s2:\n if i==j:\n return \"Yes\"\n return \"No\"\nt=int(input())\nfor _ in range(t):\n s1=input()\n s2=input()\n print(solve(s1,s2))", "# cook your dish here\ndef solve(a,b):\n for i in a:\n for j in b:\n if i==j:\n return 1\n return 0\nt=int(input())\nfor _ in range(0,t):\n a=input()\n b=input()\n if(solve(a,b)):\n print(\"Yes\")\n else:\n print(\"No\")", "# cook your dish here\nt=int(input())\n\nfor n in range(t):\n a=str(input())\n b=str(input())\n count = 0\n for i in a:\n for j in b:\n if i==j:\n count+=1\n if count > 0:\n print(\"Yes\")\n else:\n print(\"No\")"]

{"inputs": [["3", "abc", "abc", "a", "b", "abba", "baab"]], "outputs": [["Yes", "No", "Yes"]]}

INTERVIEW

PYTHON3

CODECHEF

4,997

b1b31108634cb7d856da67c6bb1034eb

UNKNOWN

Chef's new hobby is painting, but he learned the fact that it's not easy to paint 2D pictures in a hard way, after wasting a lot of canvas paper, paint and of course time. From now on, he decided to paint 1D pictures only. Chef's canvas is N millimeters long and is initially all white. For simplicity, colors will be represented by an integer between 0 and 105. 0 indicates white. The picture he is envisioning is also N millimeters long and the ith millimeter consists purely of the color Ci. Unfortunately, his brush isn't fine enough to paint every millimeter one by one. The brush is 3 millimeters wide and so it can only paint three millimeters at a time with the same color. Painting over the same place completely replaces the color by the new one. Also, Chef has lots of bottles of paints of each color, so he will never run out of paint of any color. Chef also doesn't want to ruin the edges of the canvas, so he doesn't want to paint any part beyond the painting. This means, for example, Chef cannot paint just the first millimeter of the canvas, or just the last two millimeters, etc. Help Chef by telling him whether he can finish the painting or not with these restrictions. -----Input----- The first line of the input contains an integer T denoting the number of test cases. The description of T test cases follows. The first line of each test case contains a single integer N. The second line contains N space-separated integers C1, C2, ..., CN denoting the colors of Chef's painting. -----Output----- For each test case, output a single line containing either “Yes” or “No” (without quotes), denoting whether Chef can finish the painting or not. -----Constraints----- - 1 ≤ T ≤ 105 - 3 ≤ N ≤ 105 - The sum of the Ns over all the test cases in a single test file is ≤ 5×105 - 1 ≤ Ci ≤ 105 -----Example----- Input:3 4 1 5 5 5 4 1 1 1 5 3 5 5 2 Output:Yes Yes No -----Explanation----- Example case 1. Chef's canvas initially contains the colors [0,0,0,0]. Chef can finish the painting by first painting the first three millimeters with color 1, so the colors become [1,1,1,0], and then the last three millimeters with color 5 so that it becomes [1,5,5,5]. Example case 2. Chef's canvas initially contains the colors [0,0,0,0]. Chef can finish the painting by first painting the last three millimeters by color 5 so the colors become [0,5,5,5], and then the first three millimeters by color 1 so it becomes [1,1,1,5]. Example case 3. In this test case, Chef can only paint the painting as a whole, so all parts must have the same color, and the task is impossible.

["# cook your dish here\nimport sys\nimport math\n\ndef main(arr):\n for i in range(1,len(arr)-1):\n if arr[i]==arr[i-1] and arr[i]==arr[i+1]:\n return \"Yes\"\n return \"No\"\n\ntest=int(input())\nfor _ in range(test):\n b=int(input())\n arr=list(map(int,input().split()))\n print(main(arr))\n\n ", "import sys\nimport math\n\ndef main(arr):\n \n \n for i in range(1,len(arr)-1):\n if arr[i]==arr[i-1] and arr[i]==arr[i+1]:\n return \"Yes\"\n return \"No\"\n\n\nfor _ in range(int(input())):\n b=int(input())\n arr=list(map(int,input().split()))\n print(main(arr))\n\n ", "t=int(input())\r\nfor i in range(t):\r\n n=int(input())\r\n l=list(map(int,input().split()))\r\n flag=0\r\n cou=0\r\n for j in range(n-2):\r\n a1=l[j]\r\n a2=l[j+1]\r\n a3=l[j+2]\r\n if(a1==a2 and a2==a3):\r\n flag=1\r\n break\r\n if(flag==1):\r\n print(\"Yes\")\r\n else:\r\n print(\"No\")\r\n \r\n\r\n", "try:\r\n for _ in range(int(input())):\r\n n=int(input())\r\n lis=list(map(int,input().split()))\r\n flag=0\r\n for i in range(n-2):\r\n if(lis[i]==lis[i+1]==lis[i+2]):\r\n flag=1\r\n break\r\n else:\r\n continue\r\n if(flag==1):\r\n print(\"Yes\")\r\n else:\r\n print(\"No\")\r\nexcept Exception:\r\n pass\r\n", "t=int(input())\r\nfor i in range(t):\r\n n = int(input())\r\n l = list(map(int,input().split()))\r\n flag=0\r\n for j in range(n-2):\r\n if(l[j]==l[j+1]==l[j+2]):\r\n flag=1\r\n break\r\n else:\r\n continue\r\n if(flag==1):\r\n print(\"Yes\")\r\n else:\r\n print(\"No\")", "# cook your dish here\nt=int(input())\nfor t1 in range(t):\n b=input()\n a=list(map(int,input().split()))\n x=0\n f=0\n \n while x<(len(a)-2):\n if a[x]==a[x+1] and a[x+1]==a[x+2]:\n f=1\n break\n x+=1\n if f==1:\n print(\"Yes\")\n else:\n print(\"No\")", "# cook your dish here\nfor _ in range(int(input())):\n n=int(input())\n a=list(map(int,input().split()))\n f=0\n for i in range(n-2):\n l=a[i:i+3]\n if len(set(l))==1:\n print(\"Yes\")\n f=1\n break\n if f==0:\n print(\"No\")", "for _ in range(int(input())):\r\n\tN=int(input())\r\n\tA=list(map(int,input().split()))\r\n\tc=False\r\n\tfor i in range(N-2):\r\n\t\tif A[i]==A[i+1]==A[i+2]:\r\n\t\t\tc=True\r\n\t\t\tbreak\r\n\tif c==False:\r\n\t\tprint('No')\r\n\telse:\r\n\t\tprint('Yes')", "for j in range(int(input())):\r\n n=int(input())\r\n x=list(map(int,input().split()))\r\n c=0\r\n for i in range(n-2):\r\n if(x[i]==x[i+1] and x[i]==x[i+2]):\r\n c=1\r\n break\r\n if(c==1):\r\n print(\"Yes\")\r\n else:\r\n print(\"No\")", "for _ in range(int(input())):\r\n n=int(input())\r\n a=list(map(int,input().split()))\r\n ans=0\r\n for i in range(n-2):\r\n if(a[i]==a[i+1] and a[i]==a[i+2]):\r\n ans=1\r\n if ans==1:\r\n print('Yes')\r\n else:\r\n print('No')", "# cook your dish here\nfor _ in range(int(input())):\n n=int(input())\n l=list(map(int,input().split()))\n flag=0\n for i in range(n-2):\n if(l[i]==l[i+1] and l[i]==l[i+2]):\n print(\"Yes\")\n flag=1\n break\n if(flag==0):\n print(\"No\")", "for _ in range(int(input())):\r\n N = int(input())\r\n array = list(map(int, input().split()))\r\n possible = 'No'\r\n for i in range(N - 2):\r\n if array[i] == array[i+1] and array[i] == array[i+2]:\r\n possible = 'Yes'\r\n break\r\n\r\n print(possible)\r\n", "for _ in range(int(input())):\r\n n=int(input())\r\n a=list(map(int,input().split()))\r\n flag=0\r\n for i in range(len(a)-2):\r\n if len(set(a[i:i+3]))==1:\r\n print('Yes')\r\n flag=1\r\n break\r\n else:\r\n flag=0\r\n if flag==0:\r\n print('No')", "# cook your dish here\nt=int(input())\nwhile t:\n n = input()\n l = list(map(int,input().split()))\n i=0\n z=1\n while i<len(l)-2:\n \n if len(set(l[i:i+3]))==1:\n z=0\n break\n else:\n i+=1\n if z==0:\n print(\"Yes\")\n else:\n print(\"No\")\n t-=1\n", " \r\nfor _ in range(int(input())): \r\n n=int(input())\r\n a=[int(i) for i in input().split()]\r\n count=0\r\n for i in range(n-1):\r\n if a[i] == a[i+1]:\r\n count+=1\r\n if count==2:\r\n print(\"Yes\")\r\n break\r\n else:\r\n count=0\r\n else:\r\n print(\"No\")\r\n", "# cook your dish here\nimport sys\nfor i in range(int(sys.stdin.readline())):\n n = int(sys.stdin.readline())\n c = list(map(int, sys.stdin.readline().split()))\n v = 0\n for j in range(n-2):\n if c[j] == c[j+1] == c[j+2]:\n v += 1\n break\n else:\n pass\n if v == 1:\n sys.stdout.write('Yes\\n')\n else:\n sys.stdout.write('No\\n')", "# cook your dish here\nt = int(input())\nfor _ in range(t):\n n = int(input())\n s = input().split(' ')\n arr = [int(i) for i in s]\n flag = 0\n for i in range(len(arr)-2):\n if(arr[i]==arr[i+1] and arr[i+1]==arr[i+2]):\n flag = 1\n break\n if(flag==0):\n print('No')\n else:\n print('Yes')", "# cook your dish here\nfor test_case in range(int(input())):\n n = int(input())\n canvas = list(map(int, input().split(' ')))\n \n threes = 0\n if n > 2:\n for i in range(n - 2):\n if canvas[i] == canvas[i + 1] and canvas[i + 1] == canvas[i + 2]:\n threes += 1\n \n if threes > 0:\n print('Yes')\n else:\n print('No')", "t=int(input())\r\nfor _ in range(t):\r\n n=int(input())\r\n l=list(map(int,input().split()))\r\n x=[0]*n\r\n for i in range(n-2):\r\n x[i]=x[i+1]=x[i+2]=l[i]\r\n for j in range(n-1,1,-1):\r\n if l[j]!=x[j]:\r\n x[j]=x[j-1]=x[j-2]=l[j]\r\n \r\n if x==l:\r\n print('Yes')\r\n else:\r\n print('No')\r\n \r\n \r\n \r\n", "t=int(input())\r\nfor _ in range(t):\r\n n=int(input())\r\n l=list(map(int,input().split()))\r\n x=[0]*n\r\n for i in range(n-2):\r\n x[i]=x[i+1]=x[i+2]=l[i]\r\n if x==l:\r\n print('Yes')\r\n else:\r\n if n==3:\r\n print('No')\r\n elif n==4:\r\n if (l[0]==l[1] and l[1]==l[2]) or (l[-1]==l[-2] and l[-2]==l[-3]):\r\n print('Yes')\r\n else:\r\n print('No')\r\n else:\r\n for j in range(n-1,1,-1):\r\n if l[j]!=x[j]:\r\n x[j]=x[j-1]=x[j-2]=l[j]\r\n \r\n \r\n if x==l:\r\n print('Yes')\r\n else:\r\n print('No')\r\n \r\n \r\n \r\n", "for _ in range(int(input())):\n a=int(input())\n arr=list(map(int, input().split()))\n prev=arr[0]\n count=0\n f=0\n for i in arr:\n if i==prev:\n count+=1\n else:\n prev=i\n count=1\n if count>=3:\n print(\"Yes\")\n f=1\n break\n if not f:\n print(\"No\")\n", "from collections import Counter\nT=int(input())\nfor i in range(T):\n N=int(input())\n List=[int(x) for x in input().split()]\n Initial=List[0]\n a=0\n count=0\n for i in List:\n if(Initial==i):\n count+=1\n if(count>=3):\n a=1\n break\n if(Initial!=i):\n count=1\n Initial=i\n if(a==1):\n print(\"Yes\")\n else:\n print(\"No\")", "t=int(input())\nwhile(t):\n t-=1\n n=int(input())\n ls=list(map(int,input().split()))\n k=0\n for i in range(0,n-2):\n if ls[i]==ls[i+1] and ls[i+1]==ls[i+2]:\n k=1\n break\n if k==1:\n print(\"Yes\")\n else:\n print(\"No\")", "\n\nt = int(input())\n\nfor i in range(t):\n n = int(input())\n flag = 0\n l = list(map(int,input().split()))\n for j in range(n-2):\n if l[j] == l[j+1] == l[j+2]:\n flag = 1\n break\n if flag == 1:\n print('Yes')\n else:\n print('No')\n\n\n", "# cook your dish here\ndef get_ans(ar, n):\n for i in range(n - 2):\n if ar[i] == ar[i+1] == ar[i+2]:\n return 'Yes'\n return 'No'\n\nfor _ in range(int(input())):\n n = int(input())\n ar = list(map(int, input().split()))\n \n print(get_ans(ar, n))"]

{"inputs": [["3", "4", "1 5 5 5", "4", "1 1 1 5", "3", "5 5 2", ""]], "outputs": [["Yes", "Yes", "No"]]}

INTERVIEW

PYTHON3

CODECHEF

9,088

5e824983f5b38933f880032b91f0aa21

UNKNOWN

Kefaa has developed a novel decomposition of a tree. He claims that this decomposition solves many difficult problems related to trees. However, he doesn't know how to find it quickly, so he asks you to help him. You are given a tree with $N$ vertices numbered $1$ through $N$. Let's denote an edge between vertices $u$ and $v$ by $(u, v)$. The triple-tree decomposition is a partition of edges of the tree into unordered triples of edges $(a, b), (a, c), (a, d)$ such that $a \neq b \neq c \neq d$. Each edge must belong to exactly one triple. Help Kefaa with this problem — find a triple-tree decomposition of the given tree or determine that no such decomposition exists. -----Input----- - The first line of the input contains a single integer $T$ denoting the number of test cases. The description of $T$ test cases follows. - The first line of each test case contains a single integer $N$. - Each of the following $N-1$ lines contains two space-separated integers $u$ and $v$ describing an edge between vertices $u$ and $v$ of the tree. -----Output----- - For each test case, print a line containing the string "YES" if a triple-tree decomposition of the given tree exists or "NO" otherwise. - If it exists, print $\frac{N-1}{3}$ more lines describing a decomposition. - Each of these lines should contain four space-separated integers $a$, $b$, $c$ and $d$ describing a triple of edges $(a, b), (a, c), (a, d)$. If more than one triple-tree decomposition exists, you may output any one. -----Constraints----- - $1 \le T \le 100$ - $2 \le N \le 2 \cdot 10^5$ - $1 \le u, v \le N$ - the sum of $N$ over all test cases does not exceed $2 \cdot 10^5$ -----Subtasks----- Subtask #1 (20 points): $2 \le N \le 10$ Subtask #2 (30 points):$2 \le N \le 5000$ and the sum of $N$ overall testcases doesn't exceed $5000$ Subtask #3 (50 points): original constraints -----Example Input----- 2 4 1 2 1 3 1 4 7 1 2 2 3 1 4 4 5 1 6 6 7 -----Example Output----- YES 1 2 3 4 NO

["\ntest=int(input())\nfor t in range(test):\n n= int(input())\n\n adj=[[] for i in range(n+1)]\n\n for _ in range(n-1):\n a,b=list(map(int,input().split()))\n adj[a].append(b)\n adj[b].append(a)\n \n\n #print(adj)\n root=1\n q,s=[root],set([root])\n\n for x in q:\n adj[x]= [p for p in adj[x] if p not in s]\n q.extend(adj[x])\n s.update(adj[x])\n\n #print(adj)\n ans=True\n if(n<4):\n ans=False\n for i in range(n+1):\n if(len(adj[i]) %3!=0):\n ans=False\n if(ans):\n print(\"YES\")\n for i in range(n+1):\n while(len(adj[i])):\n print(i,adj[i][0],adj[i][1],adj[i][2])\n adj[i].pop(0)\n adj[i].pop(0)\n adj[i].pop(0)\n else:\n print(\"NO\")\n", "\ntest=int(input())\nfor t in range(test):\n n= int(input())\n\n adj=[[] for i in range(n+1)]\n\n for _ in range(n-1):\n a,b=list(map(int,input().split()))\n adj[a].append(b)\n adj[b].append(a)\n \n\n #print(adj)\n root=1\n q,s=[root],set([root])\n\n for x in q:\n adj[x]= [p for p in adj[x] if p not in s]\n q.extend(adj[x])\n s.update(adj[x])\n\n #print(adj)\n ans=True\n if(n<4):\n ans=False\n for i in range(n+1):\n if(len(adj[i]) %3!=0):\n ans=False\n if(ans):\n print(\"YES\")\n for i in range(n+1):\n while(len(adj[i])):\n print(i,adj[i][0],adj[i][1],adj[i][2])\n adj[i].pop(0)\n adj[i].pop(0)\n adj[i].pop(0)\n else:\n print(\"NO\")\n", "\ntest=int(input())\nfor t in range(test):\n n= int(input())\n\n adj=[[] for i in range(n+1)]\n\n for _ in range(n-1):\n a,b=list(map(int,input().split()))\n adj[a].append(b)\n adj[b].append(a)\n \n\n #print(adj)\n root=1\n q,s=[root],set([root])\n\n for x in q:\n adj[x]= [p for p in adj[x] if p not in s]\n q.extend(adj[x])\n s.update(adj[x])\n\n #print(adj)\n ans=True\n for i in range(n+1):\n if(len(adj[i]) %3!=0):\n ans=False\n if(ans):\n print(\"YES\")\n for i in range(n+1):\n while(len(adj[i])):\n print(i,adj[i][0],adj[i][1],adj[i][2])\n adj[i].pop(0)\n adj[i].pop(0)\n adj[i].pop(0)\n else:\n print(\"NO\")\n"]

{"inputs": [["2", "4", "1 2", "1 3", "1 4", "7", "1 2", "2 3", "1 4", "4 5", "1 6", "6 7"]], "outputs": [["YES", "1 2 3 4", "NO"]]}

INTERVIEW

PYTHON3

CODECHEF

1,995

a4ec6d67dbaa0d7f760ef923d0d264c0

UNKNOWN

Sandu, a teacher in Chefland introduced his students to a new sequence i.e. 0,1,0,1,2,0,1,2,3,0,1,2,3,4........ The Sequence starts from 0 and increases by one till $i$(initially i equals to 1), then repeat itself with $i$ changed to $i+1$ Students being curious about the sequence asks the Nth element of the sequence. Help Sandu to answer the Students -----Input:----- - The first-line will contain $T$, the number of test cases. Then the test case follows. - Each test case contains a single numbers N. -----Output:----- Print the Nth element of the sequence -----Constraints----- - $1 \leq T \leq 1000$ - $1 \leq N \leq 10^{18}$ -----Sample Input:----- 5 8 9 20 32 109 -----Sample Output:----- 2 3 5 4 4

["from math import sqrt\n\nfor _ in range(int(input())):\n n = int(input())\n\n x = int(sqrt(2 * n))\n\n while x * (x+1) // 2 <= n:\n x += 1\n\n while x * (x+1) // 2 > n:\n x -= 1\n\n n -= x * (x+1) // 2\n\n print(n)\n", "\"\"\"\nProblem Statement: https://www.codechef.com/ENCD2020/problems/ECAPR203\nAuthor: striker\n\"\"\"\n\nimport math\n\ndef main():\n for test in range(int(input().strip())):\n n = int(input().strip())\n tinv = (1 + int(math.sqrt(1 + 8 * n))) // 2\n print(n - ((tinv * (tinv - 1)) // 2))\n\ndef __starting_point():\n main()\n\n__starting_point()", "import math\n_1_50 = 1 << 50\ndef isqrt(x):\n if x < 0:\n raise ValueError('square root not defined for negative numbers')\n if x < _1_50:\n return int(math.sqrt(x)) \n n = int(x)\n if n <= 1:\n return n \n\n r = 1 << ((n.bit_length() + 1) >> 1)\n while True:\n newr = (r + n // r) >> 1 \n if newr >= r:\n return r\n r = newr\n\nfor i in range(int(input())):\n n=int(input())\n x=(isqrt(4*2*n+1)-1)//2\n \n x=x*(x+1)//2\n print(n-x)\n", "import math\n\nfor _ in range(int(input())):\n n = int(input())\n \n def findNumber( n ): \n \n x = int(math.ceil((-1 + math.sqrt(1\n + 8 * n + 8)) / 2)) \n x -= 1\n \n b = (x * (x + 1)) // 2 - 1\n \n res = n - b -1 \n \n return res\n ans = findNumber(n)\n print(ans)", "# cook your dish here\nimport math\nt=int(input())\nwhile t>0:\n n=int(input())\n k=n+1\n k*=2\n a=math.sqrt(k)\n a=int(a)\n if a*(a+1)>k:\n a-=1 \n b=k-(a*(a+1))\n if b==0:\n c=a-1\n else:\n c=b//2\n c-=1\n print(c)\n t-=1\n \n \n", "# cook your dish here\nimport math\nt = int(input())\nfor _ in range(t):\n n = int(input())\n x = math.floor((-1 + math.sqrt(1 + 8 * (n))) // 2)\n num = (x * (x+1) // 2) \n print(n - num)", "def do_sum(m):\n return ((m+1)*(m+2))//2-1\n\ndef bin_search(n, l, h):\n m = (l+h)//2\n if do_sum(m)<n and do_sum(m+1)>=n:\n return m\n if do_sum(m)<n:\n return bin_search(n, m+1, h)\n return bin_search(n, l, m-1)\n\nt = int(input().strip())\nfor _ in range(t):\n n = int(input().strip())\n # a = [int(x) for x in input().strip().split()]\n m = bin_search(n,1,10000000000)\n print(n-((m+1)*(m+2))//2)", "from math import floor\nt = int(input())\nfor _ in range(t):\n n = int(input())\n t = floor((2*n+1/4)**0.5 - 1/2)\n nt = t*(t+1)//2\n print(int(n-nt))", "import math\n_1_50 = 1 << 50\ndef isqrt(x):\n if x < 0:\n raise ValueError('square root not defined for negative numbers')\n if x < _1_50:\n return int(math.sqrt(x)) \n n = int(x)\n if n <= 1:\n return n \n\n r = 1 << ((n.bit_length() + 1) >> 1)\n while True:\n newr = (r + n // r) >> 1 \n if newr >= r:\n return r\n r = newr\n\nfor i in range(int(input())):\n n=int(input())\n x=(isqrt(4*2*n+1)-1)//2\n x=x*(x+1)//2\n print(n-x)\n\n\n", "#In the Name of God\nimport math\n\nt = int(input())\n\nfor _ in range(t):\n n = int(input())\n x = int(math.sqrt(2*n))\n while(((x*(x+1))//2)-1 >= n):\n x-=1;\n #print(x)\n ini = (x*(x+1))//2\n ini -= 1\n print(int(n-ini-1))", "# cook your dish here\nimport math\n\ndef solve(N):\n bucket = math.ceil((math.sqrt(8*N+1)-1)//2)\n return N - (bucket*bucket+bucket)//2\n\n\nT = int(input())\nfor _ in range(T):\n N = int(input())\n result = solve(N)\n print(result)", "# cook your dish here\nimport math\nfor _ in range(int(input())):\n N=int(input())\n t=int(math.sqrt(2*N+2))\n if ((t*t+1)<N):\n t=t+1\n if(t&1==1):\n print(N%t)\n else:\n k=N%t\n if(k<t//2):\n print(k+t//2)\n else:\n print(k-t//2)\n", "for n in range(int(input())):\n x=int(input())\n v=x+1\n j=-1+int((8*v)**.5)\n j//=2\n d=j*(j+1)//2\n if d==v:\n print(j-1)\n else:\n print(v-d-1)\n", "# cook your dish here\nt = int(input())\nfor i in range(t):\n n = int(input())\n x = int((((8*(n+1)+1)**0.5) - 1)/2)\n d = (8*(n+1)+1)**0.5\n if (d-int(d)==0):\n print(x-1)\n else:\n f = (x*(x+1))//2 \n c = n-f\n print(c)\n", "#code\nimport math\nt=int(input())\nwhile(t>0):\n t-=1\n n=int(input())\n n-=1\n n1=(int(math.sqrt(8*n+1))-1)//2\n i=n1*(n1+1)//2-1\n if(n1+1+i==n):\n print(0)\n else:\n print(n-i)", "t=int(input())\nfor i in range(t):\n n=int(input())\n term=(-1+((8*n+9)**0.5))/2\n # print('term is '+str(term))\n if term==int(term):\n ans=int(term-1)\n # print('yo')\n # print(str(term)+' '+str(int(term)))\n else:\n term=int(term)\n summ=((term*(term+1))//2)-1\n # print('summ is '+str(summ))\n ans=n-summ-1\n print(ans)", "# cook your dish here\nfrom collections import defaultdict\nimport math\np=int(input())\nwhile p>0:\n n=int(input())\n #n-=1\n t=math.floor(((2*n+1)**0.5)+0.5)\n res=0.5*(t-(t**2)+2*n)\n print(int(res))\n p-=1\n\n\n \n", "# cook your dish here\n#ecapr203\n\ntry:\n# if(True):\n for _ in range(int(input())):\n n=int(input())\n k=int((((9+(8*n))**(0.5))-1)/2)\n m=((k-1)*(k+2))//2\n d=n-m\n if(d==0):\n print(k-1)\n else:\n print(d-1)\nexcept:\n pass", "import math\nt=int(input())\nfor i in range(0,t):\n n=int(input())\n k=0\n x=0\n k=((int(math.sqrt(((8*n)+1)))-1)//2)\n x=(k*(k+1)//2)\n n=n-x\n print(n)\n", "import math\nt = int(input())\nwhile t:\n n = int(input())\n c = 0\n i = (1 + math.ceil((9 + 8 * n)**0.5) - 1) // 2\n # print(i)\n c = (i * (i + 1) // 2) - 1\n # print(c)\n print(int(i - (c - n) - 1))\n t-=1", "import math\nfor _ in range(int(input())):\n n = int(input())\n d = math.floor(math.sqrt(1+(8*n)))\n d = ((d-1)//2)\n s = ((d*(d+1))//2)\n if s==n:\n print(0)\n else:\n print(n-s)", "t=int(input())\nfor it in range(t):\n n=int(input())\n p=int(((8*n+1)**0.5-3)/2)\n print(n-((p+1)*(p+2))//2)", "import math\ndef getk(n):\n exp=(9+8*n)**0.5\n exp-=1\n exp=exp//2\n # print(math.floor(exp))\n return math.floor(exp)\nt=int(input())\nwhile(t):\n n=int(input())\n k=int(getk(n))\n offset= int(n-(k*(k+1)//2-1))\n if(offset==0):\n offset=k\n print(offset-1)\n t-=1"]

{"inputs": [["5", "8", "9", "20", "32", "109"]], "outputs": [["2", "3", "5", "4", "4"]]}

INTERVIEW

PYTHON3

CODECHEF

5,760

3b7da0e21b175c0af906905896fe99ce

UNKNOWN

Ayu loves distinct letter sequences ,a distinct letter sequence is defined by a sequence of small case english alphabets such that no character appears more then once. But however there are two phrases that she doesn't like these phrases are "kar" and "shi" and she is given a sequence of distinct characters and she wonders how many such sequences she can form using all the characters such that these phrases don't occur. Help her finding the number of such sequences. New Year Gift - It is guaranteed that for sequences of length greater then 6 letters k,a,r,s,h,i will be present(we thought of being generous, thank us later :)). -----Input:----- - First line will contain $T$, number of testcases. Then the testcases follow. - Each line consists of a string $S$ (3<=s.length<=18) of distinct characters. -----Output:----- Print the number of sequences that can be formed by permuting all the characters such that phrases "kar" and "shi" don't occur. -----Constraints----- - $1 \leq T \leq 10$ - $3 \leq S.length \leq 18$ -----Sample Input:----- 2 karp abcd -----Sample Output:----- 22 24

["# cook your dish here\r\nfrom collections import deque, defaultdict\r\nfrom math import sqrt, ceil,factorial\r\nimport sys\r\nimport copy\r\ndef get_array(): return list(map(int, sys.stdin.readline().strip().split()))\r\ndef get_ints(): return map(int, sys.stdin.readline().strip().split())\r\ndef input(): return sys.stdin.readline().strip()\r\n\r\nfor _ in range(int(input())):\r\n\r\n s=input()\r\n if len(s)>6:\r\n ans=0\r\n rem=len(s)-6\r\n ans+=factorial(len(s))\r\n ans-=2*(factorial(len(s)-2))\r\n ans+=factorial(rem+2)\r\n print(ans)\r\n\r\n else:\r\n if 'k' in s and 'r' in s and 'a' in s and 's' in s and 'h' in s and 'i' in s:\r\n ans = 0\r\n rem = len(s) - 6\r\n ans += factorial(len(s))\r\n ans -= 2 * (factorial(len(s) - 2))\r\n ans += factorial(rem + 2)\r\n print(ans)\r\n else:\r\n if 'k' in s and 'a' in s and 'r' in s:\r\n ans=0\r\n rem=len(s)-3\r\n ans+=factorial(len(s))\r\n ans-=factorial(rem+1)\r\n print(ans)\r\n continue\r\n if 's' in s and 'h' in s and 'i' in s:\r\n ans = 0\r\n rem = len(s) - 3\r\n ans += factorial(len(s))\r\n ans -= factorial(rem + 1)\r\n print(ans)\r\n continue\r\n\r\n print(factorial(len(s)))\r\n\r\n"]

{"inputs": [["2", "karp", "abcd"]], "outputs": [["22", "24"]]}

INTERVIEW

PYTHON3

CODECHEF

1,497

a7ac4c70101c38241936f15fbeac854c

UNKNOWN

The chef has a recipe he wishes to use for his guests, but the recipe will make far more food than he can serve to the guests. The chef therefore would like to make a reduced version of the recipe which has the same ratios of ingredients, but makes less food. The chef, however, does not like fractions. The original recipe contains only whole numbers of ingredients, and the chef wants the reduced recipe to only contain whole numbers of ingredients as well. Help the chef determine how much of each ingredient to use in order to make as little food as possible. -----Input----- Input will begin with an integer T, the number of test cases. Each test case consists of a single line. The line begins with a positive integer N, the number of ingredients. N integers follow, each indicating the quantity of a particular ingredient that is used. -----Output----- For each test case, output exactly N space-separated integers on a line, giving the quantity of each ingredient that the chef should use in order to make as little food as possible. -----Sample Input----- 3 2 4 4 3 2 3 4 4 3 15 9 6 -----Sample Output----- 1 1 2 3 4 1 5 3 2 -----Constraints----- T≤100 2≤N≤50 All ingredient quantities are between 1 and 1000, inclusive.

["#! /usr/bin/env python\n\nfrom sys import stdin\nfrom functools import reduce\n\ndef gcd(a,b):\n\twhile b!=0:\n\t\ta,b=b,a%b\n\treturn a\n\t\ndef gcdl(l):\n\treturn reduce(gcd, l[1:],l[0])\n\ndef __starting_point():\n\tT=int(stdin.readline())\n\tfor case in range(T):\n\t\tnumbers=list(map(int, stdin.readline().split()[1:]))\n\t\tg=gcdl(numbers)\n\t\t\n\t\tnumbers=[n/g for n in numbers]\n\t\tprint(\" \".join([str(x) for x in numbers]))\n\n__starting_point()"]

{"inputs": [["3", "2 4 4", "3 2 3 4", "4 3 15 9 6", ""]], "outputs": [["1 1", "2 3 4", "1 5 3 2"]]}

INTERVIEW

PYTHON3

CODECHEF

464

9bcbd573b0904e482a7a7eb8f18b2a16

UNKNOWN

Today is Chef's birthday. His mom has surprised him with truly fruity gifts: 2 fruit baskets. The first basket contains N apples, and the second one contains M oranges. Chef likes apples and oranges very much but he likes them equally, and therefore, wants to have the minimum possible difference between the number of apples and oranges he has. To do so, he can purchase 1 apple or 1 orange by paying exactly 1 gold coin (that's some expensive fruit, eh?). Chef can purchase fruits at most K times (as he has only K gold coins in his pocket) to make the difference the minimum possible. Our little Chef is busy in celebrating his birthday to the fullest, and therefore, he has handed this job to his best friend — you. Can you help him by finding the minimum possible difference he can achieve between the number of apples and orange he owns? -----Input----- The first line of input contains a single integer T denoting the number of test cases. The first and only line of each test case contains 3 space separated integers — N, M and K — denoting the number of apples, number of oranges, and number of gold coins our little Chef has. -----Output----- For each test case, output the minimum possible difference between the number of apples and oranges that Chef can achieve. -----Constraints----- - 1 ≤ T ≤ 100 - 1 ≤ N, M, K ≤ 100 -----Example-----Input 3 3 4 1 5 2 1 3 4 3 Output 0 2 0 -----Explanation----- - Test 1: Chef will buy 1 apple by paying 1 gold coin and will have equal number of apples and oranges. - Test 2: Chef will buy 1 orange by paying 1 gold coin and will have 5 apples and 3 oranges.

["for _ in range(int(input())):\n a,o,g=map(int,input().split())\n while g>0:\n if a<o:\n a+=1\n g-=1\n elif o<a:\n o+=1\n g-=1\n else:\n break\n print(abs(a-o))", "# cook your dish here\ntest_case = int(input())\nfor i in range(test_case):\n apple ,orange ,coin = map(int,input().split())\n k = abs(apple - orange)\n if(k >= coin):\n print(k - coin)\n else:\n print(0)", "# cook your dish here\nfor i in range(int(input())):\n a,b,k=list(map(int,input().split()))\n k1=abs(a-b)\n if(k1>=k):\n print(k1-k)\n else:\n print(0)\n", "t=int(input())\nfor i in range(t):\n n, m, k=list(map(int, input().split()))\n k1=abs(n-m)\n if k<=k1:\n print(k1-k)\n else:\n print(0)\n \n", "# cook your dish here\nt=int(input())\nfor i in range(t):\n n,m,k=list(map(int,input().split()))\n if(n>m):\n ma=n\n mi=m\n d=n-m\n elif(m>n):\n ma=m\n mi=n\n d=m-n\n else:\n d=0\n if(d<=k):\n print(0)\n else:\n mi=mi+k\n print(ma-mi)\n", "# cook your dish here\nfor _ in range(int(input())):\n a,m,g=[int(x) for x in input().split()]\n r=abs(a-m)\n if g<=r:\n print(r-g)\n else:\n print(0)", "# cook your dish here\nfor _ in range(int(input())):\n a,m,g=[int(x) for x in input().split()]\n r=abs(a-m)\n if g<=r:\n print(r-g)\n else:\n print(0)", "# cook your dish here\nt = int(input())\nfor i in range(t):\n a,b,c=[int(x) for x in input().split()]\n y= min(a,b)\n z=max(a,b)\n if y+c >= z :\n print(0)\n else:\n print(z-(y+c))", "# cook your dish here\nN = int(input())\nfor i in range(N):\n n,m,k=[int(x) for x in input().split()]\n y= min(n,m)\n z=max(n,m)\n if y+k >= z :\n print(0)\n else:\n print(z-(y+k))", "N = int(input())\nfor i in range(N):\n n,m,k=[int(x) for x in input().split()]\n y= min(n,m)\n z=max(n,m)\n if y+k >= z :\n print(0)\n else:\n print(z-(y+k))", "# cook your dish here\nn=int(input())\nfor i in range(n):\n n,m,k=list(map(int,input().split()))\n if n==m:\n print(0)\n elif n>m:\n c=(n-m-k)\n if c<=0:\n print(0)\n else:\n print(c)\n\n else:\n c=m-n-k\n if c<=0:\n print(0)\n else:\n print(c)\n\n", "# cook your dish here\nt=int(input())\nfor i in range(0,t):\n arr=list(map(int,input().split()))\n n=arr[0]\n m=arr[1]\n k=arr[2]\n if m>n:\n n,m=m,n\n diff=n-m;\n if diff==k:\n print(0)\n elif diff>k:\n print(diff-k)\n else:\n print(0)\n\n", "# cook your dish here\nfor i in range(int(input())):\n n,m,k=map(int,input().split())\n if abs(n-m)<=k:\n print(0)\n else:\n print(abs(n-m)-k)", "for _ in range(int(input())):\n x, y, z= map(int, input().split())\n if abs(x-y)<=z:\n print(0)\n else:\n print(abs(x-y)-z)", "# cook your dish here\nx = int(input())\nfor i in range(x):\n (a, b, c) = map(int, input().split())\n if abs(a-b)==c or abs(a-b)<c:\n print(\"0\")\n elif abs(a-b)>c:\n print(abs(a-b)-c)", "t=int(input())\nfor i in range(t):\n a,o,g=map(int,input().split())\n diff=abs(a-o)\n if diff<=g:\n print(0)\n else:\n print(diff-g)", "# cook your dish here\nT = int(input())\n\nfor t in range(T):\n apples, oranges, coins = input().split()\n apples = int(apples)\n oranges = int(oranges)\n coins = int(coins)\n while coins > 0:\n if apples > oranges:\n oranges += 1 \n coins -= 1\n elif oranges > apples:\n apples += 1\n coins -= 1\n else:\n if coins % 2 == 0:\n half = int(coins / 2)\n apples = apples + half\n oranges = oranges + half\n coins = 0\n break\n else:\n half = int(coins / 2)\n #coins = coins - half\n apples = apples + half\n oranges = oranges + half\n coins = 1\n break\n print(int(abs(apples-oranges))) \n #print(int(apples - oranges) if apples >= oranges else int(oranges - apples\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0))\n", "try:\n for _ in range(int(input())):\n a,o,g=map(int,input().split())\n res=abs(a-o)\n if(res>g):\n print(res-g)\n else:\n print(0)\nexcept:\n pass", "# cook your dish here\nfor _ in range(int(input())):\n a,b,k=list(map(int,input().split()))\n if(max(a,b)-min(a,b)-k)<=0:\n print(\"0\")\n else :\n print(max(a,b)-min(a,b)-k)\n", "# cook your dish here\nN=int(input())\nfor i in range(N):\n m,o,k=list(map(int,input().split()))\n d=abs(m-o)\n if(k>d):\n print(0)\n else:\n print(d-k)\n", "t=int(input())\nfor i in range(t):\n n,m,k=map(int,input().split())\n diff=abs(n-m)\n \n if(k>diff):\n print(0)\n else:\n print(diff-k)", "import math\n\ndef makeeql(a,o,g):\n print(abs(max(a,o) - min((min(a,o)+g),max(a,o))))\n \nfor i in range(int(input())):\n a,o,g = map(int,input().split())\n makeeql(a,o,g)", "t=int(input())\nfor i in range(t):\n n,m,k=list(map(int,input().split()))\n d=abs(n-m)\n if k>=d:\n print(\"0\")\n else:\n print((d-k))# cook your dish here\n"]

{"inputs": [["3", "3 4 1", "5 2 1", "3 4 3"]], "outputs": [["0", "2", "0"]]}

INTERVIEW

PYTHON3

CODECHEF

4,658

23280361291787657f4a9124a344f7c5

UNKNOWN

After acquiring an extraordinary amount of knowledge through programming contests, Malvika decided to harness her expertise to train the next generation of Indian programmers. So, she decided to hold a programming camp. In the camp, she held a discussion session for n members (n-1 students, and herself). They are sitting in a line from left to right numbered through 1 to n. Malvika is sitting in the nth spot. She wants to teach m topics of competitive programming to the students. As the people taking part in the camp are all newbies, they know none of the topics being taught, i.e., initially, the first n - 1 people in the line know none of the topics, while the nth knows all of them. It takes one hour for a person to learn a topic from his neighbour. Obviously, one person cannot both teach a topic as well as learn one during the same hour. That is, in any particular hour, a person can either teach a topic that he knows to one of his neighbors, or he can learn a topic from one of his neighbors, or he can sit idly. It is also obvious that if person x is learning from person y at a particular hour, then person y must be teaching person x at that hour. Also, note that people can work parallely too, i.e., in the same hour when the 4th person is teaching the 3rd person, the 1st person can also teach the 2nd or learn from 2nd. Find out the minimum number of hours needed so that each person learns all the m topics. -----Input----- - The first line of input contains a single integer T denoting number of test cases. - The only line of each test case contains two space separated integers n, m as defined in the statement. -----Output----- - For each test case, output a single integer in a line corresponding to the answer of the problem. -----Constraints----- - 1 ≤ T, n, m ≤ 100 -----Example----- Input: 2 2 1 3 2 Output: 1 4 -----Explanation----- In the first example, there are two people. Second person is Malvika and she has to teach only one topic to the first person. It will take only one hour to do so. In the second example, there are three people. The 3rd person is Malvika and she has to teach only two topics to 1st and 2nd person. In the 1st hour, she teaches the 1st topic to the 2nd person. Now, in the 2nd hour, the 2nd person will teach the 1st topic to the 1st person. In the 3rd hour, Malvika will teach the 2nd topic to the 2nd person. Now the 2nd person will teach that topic to the 1st in the 4th hour. So, it takes a total of 4 hours for all the people to know all the topics.

["for _ in range(int(input())):\n n,m=map(int, input().split())\n if n==1:\n print(0)\n elif n==2:\n print(m)\n else:\n print(m*2+n-3)", "# cook your dish here\nfor i in range(int(input())):\n n,m=list(map(int,input().split()))\n if(n==1):\n print(0)\n continue\n if(n==2):\n print(m)\n continue\n ans=(n-1)+2*(m-1)\n print(ans)\n \n", "for i in range(int(input())):\n n,m=list(map(int,input().split()))\n if(n==1):\n print(0)\n continue\n if(n==2):\n print(m)\n continue\n ans=(n-1)+2*(m-1)\n print(ans)\n \n", "def main():\n for _ in range(int(input())):\n (m,n) = map(int, input().split())\n if m==1:\n print(0)\n continue\n if m==2:\n print(n)\n continue\n a=(m-1) + 2 * (n-1)\n print(a)\n\ndef __starting_point():\n main()\n__starting_point()", "T = int(input())\nfor i in range(T):\n n, m = input().split(\" \")\n n = int(n)\n m = int(m)\n if(n==1): \n print(0)\n elif(n==2):\n print(m) \n else:\n print(n+2*m - 3)"]

{"inputs": [["2", "2 1", "3 2"]], "outputs": [["1", "4"]]}

INTERVIEW

PYTHON3

CODECHEF

951

5d47b3882a803cac37f16067d7ef17c2

UNKNOWN

Find out the maximum sub-array of non negative numbers from an array. The sub-array should be continuous. That is, a sub-array created by choosing the second and fourth element and skipping the third element is invalid. Maximum sub-array is defined in terms of the sum of the elements in the sub-array. Sub-array A is greater than sub-array B if sum(A) > sum(B). NOTE 1 :If there is a tie, then compare with segment's length and return segment which has maximum length NOTE 2: If there is still a tie, then return the segment with minimum starting index. -----Input----- The first line contains the number of test cases. Each test cases contains an integer N. next line consists of N integers, the elements of the array. -----Output----- Print out the maximum sub-array as stated above. -----Constraints----- - 1 ≤ T ≤ 100 - 1 ≤ N ≤ 105 - 1 ≤ Ai ≤ 105 -----Example----- Input: 1 6 1 2 5 -7 2 3 Output: 1 2 5

["for t in range(int(input())):\n n=int(input())\n a=list(map(int,input().split()))\n s=0\n l=[]\n for i in range(n):\n if (a[i]<0):\n e=i\n ss=sum(a[s:e])\n l.append((ss,e-s,n-s))\n s=i+1\n e=n\n ss=sum(a[s:e])\n l.append((ss,e-s,n-s))\n x=max(l)\n s=n-x[2]\n e=x[1]+s\n for i in range(s,e):\n print(a[i], end=' ')\n print(\"\")"]

{"inputs": [["1", "6", "1 2 5 -7 2 3"]], "outputs": [["1 2 5"]]}

INTERVIEW

PYTHON3

CODECHEF

341

57e690aa51999fd187b4c3e834b4bf88

UNKNOWN

Chef found a strange string yesterday - a string of signs s, where each sign is either a '<', '=' or a '>'. Let N be the length of this string. Chef wants to insert N + 1 positive integers into this sequence and make it valid. A valid sequence is a sequence where every sign is preceded and followed by an integer, and the signs are correct. That is, if a sign '<' is preceded by the integer a and followed by an integer b, then a should be less than b. Likewise for the other two signs as well. Chef can take some positive integers in the range [1, P] and use a number in the range as many times as he wants. Help Chef find the minimum possible P with which he can create a valid sequence. -----Input----- The first line of the input contains an integer T denoting the number of test cases. The description of T test cases follows. The only line of each test case contains the string of signs s, where each sign is either '<', '=' or a '>'. -----Output----- For each test case, output a single line containing an integer corresponding to the minimum possible P. -----Constraints----- - 1 ≤ T, |s| ≤ 105 - 1 ≤ Sum of |s| over all test cases in a single test file ≤ 106 -----Subtasks----- Subtask #1 (30 points) - 1 ≤ T, |s| ≤ 103 - 1 ≤ Sum of |s| over all test cases in a single test file ≤ 104 Subtask #2 (70 points) - Original constraints -----Example----- Input: 4 <<< <>< <=> <=< Output: 4 2 2 3 -----Explanation----- Here are some possible valid sequences which can be formed with the minimum P for each of the test cases: 1 < 2 < 3 < 4 1 < 2 > 1 < 2 1 < 2 = 2 > 1 1 < 2 = 2 < 3

["for _ in range(int(input())):\n st=input().replace(\"=\",\"\")\n if not len(st):print(1)\n else:\n cu=mx=1\n for j in range(1,len(st)):\n if st[j]==st[j-1]:cu+=1\n else:mx=max(mx,cu);cu=1\n print(max(mx+1,cu+1))\n", "r=int(input())\nfor z in range(r):\n s=input()\n s=s.replace('=','')\n l=list(s)\n final=0\n ans=0\n if(len(l))==0:\n print(1)\n else:\n for i in range(1,len(l)):\n if(l[i]==l[i-1]):\n ans=ans+1\n else:\n if(final<ans):\n final=ans\n ans=0\n if(final<ans):\n final=ans\n print(final+2)\n \n", "# cook your dish here\ndef solve(s):\n temp = []\n for c in s:\n if c != '=':\n temp.append(c)\n \n count = 1\n ans = 1\n # print(temp)\n if temp:\n for i in range(1, len(temp)):\n if temp[i] == temp[i-1]:\n count += 1\n # print(i, count)\n else:\n ans = max(ans, count);\n count = 1\n ans = max(ans, count);\n print(ans+1)\n else:\n print(1)\n \nn = int(input())\nfor i in range(n):\n s = input().strip()\n solve(s)", "for _ in range(int(input())):\n l=list(input())\n temp=['<','=']\n fg,c=0,0\n ans1,ans2=0,0\n for i in range(len(l)):\n if l[i] in temp:\n fg=1\n if l[i]=='<':\n c+=1\n elif fg==1:\n ans1=max(ans1,c)\n fg=0\n c=0\n if fg==1:\n ans1 = max(ans1, c)\n ans1+=1\n temp=['>','=']\n fg,c=0,0\n for i in range(len(l)):\n if l[i] in temp:\n fg=1\n if l[i]=='>':\n c+=1\n elif fg==1:\n ans2=max(ans2,c)\n fg=0\n c=0\n if fg==1:\n ans2 = max(ans2, c)\n ans2+=1\n print(max(ans1,ans2))", "t=int(input())\nfor z in range(t):\n s=input()\n j=1\n ans=1\n a=[]\n for i in s:\n if i!='=':\n a.append(i)\n if len(a)== 0 :\n print(1)\n continue\n for i in range(len(a)-1):\n if a[i]==a[i+1]:\n j+=1\n ans=max(ans,j)\n else:\n j=1\n print(ans+1)\n", "t=int(input())\nfor z in range(t):\n s=input()\n j=1\n ans=0\n a=[]\n for i in s:\n if i!='=':\n a.append(i)\n \n for i in range(len(a)-1):\n if a[i]==a[i+1]:\n j+=1\n ans=max(ans,j)\n else:\n j=1\n\n print(ans+1)\n", "# cook your dish here\nimport math\nt=0\ntry:\n t = int(input())\nexcept EOFError as e : pass\nfor _ in range(t):\n myStr = input().replace('=', '')\n if len(myStr) == 0 :\n print(1)\n continue\n ans = 0\n count = 1\n for k in range(len(myStr)-1):\n if myStr[k] == myStr[k+1]:\n count +=1\n else:\n ans = max(count, ans)\n count = 1\n ans = max(count, ans)\n print(ans+1)\n \n", "# cook your dish here\nimport math\nt=0\ntry:\n t = int(input())\nexcept EOFError as e : pass\nfor _ in range(t):\n # myStr = input().replace('=', '')\n # if len(myStr) == 0 :\n # print(1)\n # continue\n # ans = 0\n # count = 1\n # for k in range(len(myStr)-1):\n # if myStr[k] == myStr[k+1]:\n # count +=1\n # else:\n # ans = max(count, ans)\n # count = 1\n # ans = max(count, ans)\n # print(ans+1)\n s=input().replace('=','')\n if len(s)==0:\n print(1)\n continue\n ans,count=0,1\n for i in range(len(s)-1):\n if s[i]==s[i+1]:\n count+=1\n else:\n ans=max(ans,count)\n count=1\n ans=max(count,ans)\n print(ans+1)\n", "# cook your dish here\nimport math\nt=0\ntry:\n t = int(input())\nexcept EOFError as e : pass\nfor i in range(t):\n myStr = input().replace('=', '')\n if len(myStr) == 0 :\n print(1)\n continue\n ans = 0\n count = 1\n for k in range(len(myStr)-1):\n if myStr[k] == myStr[k+1]:\n count +=1\n else:\n ans = max(count, ans)\n count = 1\n ans = max(count, ans)\n print(ans+1)\n", "# cook your dish here\nimport math\nt=0\ntry:\n t = int(input())\nexcept EOFError as e : pass\nfor i in range(t):\n myStr = input().replace('=', '')\n if(len(myStr) == 0):\n print(1)\n continue\n ans = 0\n count = 1\n for k in range(len(myStr)-1):\n if(myStr[k] == myStr[k+1]):\n count +=1\n else:\n ans = max(count, ans)\n count = 1\n ans = max(count, ans)\n print(ans+1)\n", "# cook your dish here\nimport math\nt=0\ntry:\n t = int(input())\nexcept EOFError as e : pass\nfor i in range(t):\n myStr = input().replace('=', '')\n if(len(myStr) == 0):\n print(1)\n continue\n ans = 0\n count = 1\n for k in range(len(myStr)-1):\n if(myStr[k] == myStr[k+1]):\n count +=1\n else:\n count = 1\n ans = max(count, ans)\n print(ans+1)\n", "x=int(input())\nfor _ in range(x):\n n=input()\n lol=[]\n for i in n:\n if i!=\"=\":\n lol.append(i)\n n=\"\".join(lol) \n l=0\n if len(n)>0:\n l+=1\n c=1\n for i in range(1,len(n)):\n if n[i]==n[i-1]:\n c+=1\n else:\n #print(c,l,i)\n l=max(l,c)\n c=1\n l=max(l,c) \n print(l+1)", "T = int(input())\n\nfor i in range(T):\n x = input().replace(\"=\", \"\")\n max_right = 0\n max_left = 0\n curr_right = 0\n curr_left = 0\n right = False\n left = False\n\n for j in x:\n if j == \">\":\n curr_right += 1\n if not right:\n right = True\n\n if left:\n left = False\n if max_left < curr_left:\n max_left = curr_left\n\n curr_left = 0\n\n elif j == \"<\":\n curr_left += 1\n if not left:\n left = True\n\n if right:\n right = False\n if max_right < curr_right:\n max_right = curr_right\n\n curr_right = 0\n\n if curr_left > max_left: max_left = curr_left\n if curr_right > max_right: max_right = curr_right\n\n print(max(max_right, max_left) + 1)\n", "t=int(input())\nfor _ in range(t):\n s=input().replace('=','')\n if len(s)==0:\n print(1)\n continue\n ans,count=0,1\n for i in range(len(s)-1):\n if s[i]==s[i+1]:\n count+=1\n else:\n ans=max(ans,count)\n count=1\n ans=max(count,ans)\n print(ans+1)", "for _ in range(int(input())):\n q=input()\n x=0\n o=0\n y=[]\n z=-1\n c=-1\n for ii in range(len(q)):\n if(q[ii]!='='):\n y.append(q[ii])\n for i in range(len(y)):\n if(y[i]=='>')and(o==0):\n x+=1\n elif(y[i]=='<')and(x==0):\n o+=1\n else:\n if(z<o):\n z=o\n if(c<x):\n c=x\n if(y[i]=='>'):\n x=1\n o=0\n if(y[i]=='<'):\n o=1\n x=0\n if(z<o):\n z=o\n if(c<x):\n c=x\n print(max(z,c,0)+1)\n", "for _ in range(int(input())):\n q=input()\n x=0\n o=0\n y='='+q\n z=-1\n c=-1\n for i in range(1,len(y)):\n if(y[i]=='>')and(y[i-1]=='=' or y[i-1]=='>' ):\n x+=1\n elif(y[i]=='<')and(y[i-1]=='=' or y[i-1]=='<' ):\n o+=1\n elif(y[i]=='='):\n continue\n else:\n if(z<o):\n z=o\n if(c<x):\n c=x\n if(y[i]=='>'):\n x=1\n o=0\n if(y[i]=='<'):\n o=1\n x=0\n if(z<o):\n z=o\n if(c<x):\n c=x\n print(max(z,c,0)+1)\n", "for _ in range(int(input())):\n q=input()\n x=0\n o=0\n y='='+q\n z=-1\n c=-1\n for i in range(1,len(y)):\n if(y[i]=='>')and(y[i-1]=='=' or y[i-1]=='>' ):\n x+=1\n elif(y[i]=='<')and(y[i-1]=='=' or y[i-1]=='<' ):\n o+=1\n elif(y[i]=='='):\n continue\n else:\n if(z<o):\n z=o\n if(c<x):\n c=x\n if(y[i]=='>'):\n x=1\n o=0\n if(y[i]=='<'):\n o=1\n x=0\n if(z<o):\n z=o\n if(c<x):\n c=x\n print(max(z,c)+1)\n", "for _ in range(int(input())):\n q=input()\n x=0\n o=0\n y='='+q\n z=-1\n c=-1\n for i in range(1,len(y)):\n if(y[i]=='>')and(y[i-1]=='=' or y[i-1]=='>' ):\n x+=1\n elif(y[i]=='<')and(y[i-1]=='=' or y[i-1]=='<' ):\n o+=1\n else:\n if(z<o):\n z=o\n if(c<x):\n c=x\n if(y[i]=='>'):\n x=1\n o=0\n if(y[i]=='<'):\n o=1\n x=0\n if(z<o):\n z=o\n if(c<x):\n c=x\n print(max(z,c)+1)\n", "# cook your dish here\nimport math\nt=int(input())\nwhile(t>0):\n l=[]\n s1=input()\n s=\"\"\n for i in s1:\n if i!=\"=\":\n s=s+i\n max=-99999\n sum=0\n for i in range(0,len(s)-1):\n if(s[i]!=\"=\"):\n sum=sum+1\n #print(\"here\",sum)\n if s[i] != s[i+1]:\n #print(sum)\n if sum>max:\n max=sum\n sum=0\n if len(s)>1 and s[i]!=\"=\":\n if sum+1>max:\n max=sum+1\n if len(s)==1 and s[0]!=\"=\":\n max=1\n if max==-99999:\n print(1)\n else:\n print(max+1)\n t=t-1"]

{"inputs": [["4", "<<<", "<><", "<=>", "<=<"]], "outputs": [["4", "2", "2", "3"]]}

INTERVIEW

PYTHON3

CODECHEF

7,711

f45801f89c02c42f37a9ab3f5f8a1e47

UNKNOWN

You came across this story while reading a book. Long a ago when the modern entertainment systems did not exist people used to go to watch plays in theaters, where people would perform live in front of an audience. There was a beautiful actress who had a disability she could not pronounce the character $'r'$. To win her favours which many have been denied in past, you decide to write a whole play without the character $'r'$. Now you have to get the script reviewed by the editor before presenting it to her. The editor was flattered by the script and agreed to you to proceed. The editor will edit the script in this way to suit her style. For each word replace it with a sub-sequence of itself such that it contains the character 'a'. A subsequence is a sequence that can be derived from another sequence by deleting some or no elements without changing the order of the remaining elements Wikipedia Now given a script with $N$ words, for each word in the script you wish to know the number of subsequences with which it can be replaced. -----Input:----- - First-line will contain $N$, the number of words in the script. Then next $N$ line with one test case each. - Each test case contains a single word $W_i$ -----Output:----- For each test case, output in a single line number of subsequences with which it can be replaced. -----Constraints----- - $1 \leq N \leq 1000$ - $1 \leq$ length of $W_i$ $\leq 20$ - $W_i$ on contains lowercase english alphabets and does not have the character 'r' -----Sample Input 1:----- 2 abc aba -----Sample Output 1:----- 4 6 -----EXPLANATION:----- This subsequences with which $abc$ can be replaed : ${a,ab,ac,abc}$. This subsequences with which $aba$ can be replaed : ${a,ab,aba,a,ba,a}$. -----Sample Input 2:----- 3 abcde abcdea xyz -----Sample Output 2:----- 16 48 0

["for _ in range(int(input())):\r\n S = input()\r\n n = len(S)\r\n a = n - S.count('a')\r\n print(2 ** n - 2 ** a)", "for _ in range(int(input())):\n s=input()\n n=len(s)\n c=s.count('a')\n l=n-c\n print(pow(2,n)-pow(2,l))\n\n", "for _ in range(int(input())):\n s=input()\n n=len(s)\n c=s.count('a')\n l=n-c\n print(pow(2,n)-pow(2,l))\n\n", "try:\r\n t = int(input())\r\n for _ in range(t):\r\n s = input()\r\n acount = 0\r\n for i in s:\r\n if i == \"a\":\r\n acount+=1\r\n p = len(s) - acount\r\n base = 2**(acount) - 1\r\n print(base * 2**(p))\r\nexcept:\r\n pass", "# cook your dish here\nt=int(input())\nfor _ in range(t):\n stringa=input()\n a=0\n counter=0\n for char in stringa:\n if char=='a':\n a+=1 \n print(2**(len(stringa)-a)*(2**a-1))\n", "# cook your dish here\n# code by RAJ BHAVSAR\nimport sys\ndef get_ints(): return map(int, sys.stdin.readline().strip().split())\ndef get_list(): return list(map(int, sys.stdin.readline().strip().split()))\ndef get_string(): return sys.stdin.readline().strip()\ndef get_int(): return int(sys.stdin.readline().strip())\ndef get_print_int(x): sys.stdout.write(str(x) + '\\n')\ndef get_print(x): sys.stdout.write(x + '\\n')\n\ndef solve():\n\tfor _ in range(get_int()):\n\t\ts = get_string()\n\t\tn = len(s)\n\t\tcount = 0\n\t\tfor i in s:\n\t\t\tif(i == 'a'):\n\t\t\t\tcount += 1\n\t\tget_print_int((2**n - 1) - (2**(n-count) - 1))\nsolve()", "n=int(input())\nfor _ in range(n):\n c=0\n s=input()\n for i in s:\n if i=='a':\n c+= 1 \n print((2**len(s)-2**(len(s)-c)))# cook your dish here\n", "# def count(a, b): \n# \tm = len(a);n = 1\n# \tlookup = [[0] * (n + 1) for i in range(m + 1)] \n# \tfor i in range(n+1): lookup[0][i] = 0\n# \tfor i in range(m + 1): lookup[i][0] = 1\n# \tfor i in range(1, m + 1): \n# \t\tfor j in range(1, n + 1): \n# \t\t\tif a[i - 1] == b[j - 1]: lookup[i][j] = lookup[i - 1][j - 1] + lookup[i - 1][j]\n# \t\t\telse: lookup[i][j] = lookup[i - 1][j] \n# \treturn lookup[m][n]\n# for _ in range(int(input())):\n# \ta = input()\n# \tb = \"a\"\n# \tprint(count(a, b)) #this just counts the number of times a string occurs, nut the subsequences\n#>>> if there are only a's, then answer is (2**len) - 1\n#>>> if there are len - 1 a's and one diff, then answer is (2**len) - 2\n#>>> if there are len - 1 diff's and one a, then answer is 2**(len - 1)\n#>>> if there are all diff, then answer is 0\n#>>> there has to be a direct relation somewhere...gottit..if there are equal a's and diffs, then answer is 2**len - 2**(len/2)\n#>>> wait a minute...2**len - 2**(len/2) this works for inequalities also (?)\nfor _ in range(int(input())):\n\ta = input();count = 0\n\tfor i in a:\n\t\tif(i != \"a\"): count += 1\n\tprint(2**len(a) - 2**count)", "from math import factorial as fact\nfrom itertools import combinations\nfor _ in range(int(input())):\n a=input()\n if \"a\" not in a:\n print(0)\n continue\n ct=a.count(\"a\")\n ct=\"a\"*ct\n a=a.replace(\"a\",\"\")\n count=0\n for i in range(1,len(a)+1):\n count+=(fact(len(a))/(fact(i)*(fact(len(a)-i))))\n ctcount=0\n for i in range(1,len(ct)+1):\n ctcount+=len(list(combinations(ct,i)))\n print(int(count)*ctcount+ctcount)", "# cook your dish here\ndef power(a,b):\n\tif(b==0):\n\t\treturn 1\n\tif(b==1):\n\t\treturn a\n\tif(b%2==1):\n\t\treturn (power(a,b-1)*a)\n\tx=power(a,b/2)\n\treturn (x*x)\nt=int(input())\nwhile(t>0):\n s=input()\n b=s.count(\"a\")\n n=len(s)\n if(b==0):\n print(0)\n else:\n c=n-b\n print(power(2,n)-power(2,c))\n t-=1\n \n\n", "# cook your dish here\nn = int(input())\nfor i in range(n):\n w = input()\n l = len(w)\n s = 0\n a = 0\n for i in w:\n if i == 'a':\n a += 1\n s += 2**(l-a)\n print(s)", "# cook your dish here\nfor u in range(int(input())):\n s=input()\n n=len(s)\n x=s.count('a')\n z=n-x\n s=2**x-1\n c=2**z\n print(s*c)\n"]

{"inputs": [["2", "abc", "aba"]], "outputs": [["4", "6"]]}

INTERVIEW

PYTHON3

CODECHEF

4,133

69c84e3586a6ca4d1eeb928675793992

UNKNOWN

Not everyone probably knows that Chef has younder brother Jeff. Currently Jeff learns to read. He knows some subset of the letter of Latin alphabet. In order to help Jeff to study, Chef gave him a book with the text consisting of N words. Jeff can read a word iff it consists only of the letters he knows. Now Chef is curious about which words his brother will be able to read, and which are not. Please help him! -----Input----- The first line of the input contains a lowercase Latin letter string S, consisting of the letters Jeff can read. Every letter will appear in S no more than once. The second line of the input contains an integer N denoting the number of words in the book. Each of the following N lines contains a single lowecase Latin letter string Wi, denoting the ith word in the book. -----Output----- For each of the words, output "Yes" (without quotes) in case Jeff can read it, and "No" (without quotes) otherwise. -----Constraints----- - 1 ≤ |S| ≤ 26 - 1 ≤ N ≤ 1000 - 1 ≤ |Wi| ≤ 12 - Each letter will appear in S no more than once. - S, Wi consist only of lowercase Latin letters. -----Subtasks----- - Subtask #1 (31 point): |S| = 1, i.e. Jeff knows only one letter. - Subtask #2 (69 point) : no additional constraints -----Example----- Input:act 2 cat dog Output:Yes No -----Explanation----- The first word can be read. The second word contains the letters d, o and g that aren't known by Jeff.

["knows=input()\nn=eval(input())\nwhile n!=0:\n n=n-1\n word=input()\n for x in word:\n ctr=0\n for y in knows:\n if x==y:ctr=ctr+1;break\n if ctr==0:print('No');break\n else: print('Yes')", "import collections\n\ndef alphabet():\n s = input()\n d = collections.defaultdict(lambda : 0)\n for i in s:\n d[i]+=1\n n = int(input())\n for i in range(n):\n w = input()\n flag = True\n for i in w:\n if i not in d:\n print(\"No\")\n flag = False\n break\n if flag:\n print(\"Yes\")\n\n\nalphabet()\n\n", "import collections\n\ndef alphabet():\n s = input()\n d = collections.defaultdict(lambda : 0)\n for i in s:\n d[i]+=1\n n = int(input())\n for i in range(n):\n w = input()\n flag = True\n for i in w:\n if i not in d:\n print(\"No\")\n flag = False\n break\n if flag:\n print(\"Yes\")\n\n\nalphabet()\n\n", "s1 = input()\nfor i in range(int(input())):\n s2 = input()\n a= ''.join(sorted(s1))\n c= ''.join(set(s2))\n b= ''.join(sorted(c))\n if b in a and len(b)<=len(a):\n print('Yes')\n else:\n print('No')", "s1 = input()\nfor i in range(int(input())):\n s2 = input()\n a= ''.join(sorted(s1))\n c= ''.join(set(s2))\n b= ''.join(sorted(c))\n if b in a and len(c)<=len(a):\n print('Yes')\n else:\n print('No')", "s1 = input()\nfor i in range(int(input())):\n s2 = input()\n a= ''.join(sorted(s1))\n c= ''.join(set(s2))\n b= ''.join(sorted(c))\n if b in a:\n print('Yes')\n else:\n print('No')", "s = input()\nn = eval(input())\nfor i in range(n):\n w = input()\n cnt = 0\n for j in range(len(w)):\n if(w[j] in s):\n cnt+=1\n \n if(cnt == len(w)):\n print(\"Yes\")\n else:\n print(\"No\")", "# book = ''.join(sorted(str(raw_input())))\nbook = input()\n\n\nfor i in range(0, int(input())):\n words = str(input())\n check = 0\n for letter in sorted(words):\n if letter in book:\n check = check + 1\n\n if check == len(words):\n print(\"Yes\")\n else:\n print(\"No\")\n", "# cook your code here\nalf = input()\n\nn = int(input())\nfor _ in range(n):\n yes = 1\n x = input()\n for c in x:\n if(alf.find(c) == -1):\n yes = 0\n break\n if yes:print(\"Yes\")\n else:print(\"No\")", "l1 = input().lower()\nlang_set = set([x.lower() for x in l1 if x.isalpha() ])\nl2 = set([x for x in l1 if l1.count(x)>1])\n\nno_cases = int(input())\n# if(len(l2)>0):\n# for i in xrange(no_cases):\n# word = raw_input()\n# print \"No\"\n# else :\nfor i in range(no_cases):\n word = input().lower()\n word_set = set([x.lower() for x in word if x.isalpha() ])\n fl =word_set.issubset(lang_set)\n if(fl) :\n print(\"Yes\")\n else :\n print(\"No\")", "\ndef correct_string(s):\n a = set(s)\n if len(a) == len(s):\n return 1\n return 0\n\ns = input()\nif correct_string(s):\n s = sorted(s)\n s1 = \"\".join(s)\n n = int(input())\n if (n >= 1 and n <= 1000):\n for x in range(0,n):\n v = input()\n v = set(v)\n lw = len(v)\n if lw >= 1 and lw <= 12:\n v = sorted(v)\n s2 = \"\".join(v)\n if s1 == s2:\n print(\"Yes\")\n else:\n print(\"No\")\n pass", "s = input()\nn = int(input())\nt = []\nfor _ in range(n):\n a = input()\n t.append(a)\n\nfor i in t:\n flag = True\n for j in i:\n if j not in s:\n flag = False\n break\n if(flag):\n print(\"Yes\")\n else:\n print(\"No\")\n", "s=input().lower()\nfor _ in range(int(input())):\n st=input().lower()\n \n if(set(st)==set(s)):\n print(\"Yes\")\n else:\n print(\"No\")\n \n \n \n \n", "s = input()\nn = int(input())\n\ndef find_str(word):\n nonlocal s\n for i in word:\n if i in s:\n pass\n else:\n return \"No\"\n return \"Yes\"\n\nwhile n :\n w = input()\n print(find_str(w))\n n = n - 1", "l=input()\nn=int(input())\nfor i in range(n):\n flag=0\n s=input()\n for j in range(len(s)):\n if(s[j] in l):\n flag=flag+1\n if(flag==len(s)):\n print(\"Yes\")\n else:\n print(\"No\")", "s = [0]*26\nq = input()\nfor i in q:\n s[ord(i)-97] = 1\nn = int(input())\nwhile(n):\n e = input()\n f = 1\n for i in e:\n if not (s[ord(i)-97]):\n f = 0\n break\n if(f):\n print(\"Yes\")\n else:\n print(\"No\")\n n -= 1", "letters=input()\nn=int(input())\nwords=list()\n\nfor i in range(n):\n word=input()\n words.append(word)\n\nfor word in words:\n l=list(word)\n i=0\n for letter in l:\n if letter in letters:\n continue\n else:\n print(\"No\")\n i=1\n break\n\n if i==0:\n print(\"Yes\")\n i=0\n", "s=input()\nfor _ in range(int(input())):\n st=input()\n if(s.islower() and st.islower()):\n if(set(st)==set(s)):\n print(\"Yes\")\n else:\n print(\"No\")\n else:\n print(\"No\")\n", "S = input()\nN = int(input())\nwhile N != 0:\n W = input()\n flag = 0\n for i in range(0, len(W)):\n if W[i] in S:\n continue\n else:\n flag = 1\n break\n if flag == 0:\n print(\"Yes\")\n else:\n print(\"No\")\n N -= 1\n"]

{"inputs": [["act", "2", "cat", "dog"]], "outputs": [["Yes", "No"]]}

INTERVIEW

PYTHON3

CODECHEF

4,775

ca1e568c157042d2a67c91b764d9aa3b

UNKNOWN

Chef has a calculator which has two screens and two buttons. Initially, each screen shows the number zero. Pressing the first button increments the number on the first screen by 1, and each click of the first button consumes 1 unit of energy. Pressing the second button increases the number on the second screen by the number which is currently appearing on the first screen. Each click of the second button consumes B units of energy. Initially the calculator has N units of energy. Now chef wonders what the maximum possible number is, that he gets on the second screen of the calculator, with the limited energy. -----Input----- The first line of the input contains an integer T denoting the number of test cases. Each test case is described using a single line containing two integers, N and B. -----Output----- For each test case, output a single line containing the answer to this test case. -----Constraints----- - 1 ≤ T ≤ 10,000 - 1 ≤ N, B ≤ 1,000,000,000 -----Subtasks----- - Subtask 1 (20 points): 1 ≤ N, B ≤ 1,000 - Subtask 2 (80 points): Original constraints -----Example----- Input: 3 10 2 8 5 6 1 Output: 12 3 9 -----Explanation----- Example case 1. There are 10 units of energy available. Pressing second button takes 2 units of energy. Chef can achieve 12 on the second screen as follows. - Press first button to get scores (1, 0). 9 units of energey is left. - Press first button to get scores (2, 0). 8 units of energy remaining. - Press first button to get scores (3, 0). 7 units of energy remaining. - Press first button to get scores (4, 0). 6 units of energy remaining. - Press second button to get scores (4, 4). 4 units of energy remaining. - Press second button to get scores (4, 8). 2 units of energy remaining. - Press second button to get scores (4, 12). 0 units of energy remaining.

["# cook your dish here\nfor i in range(int(input())):\n n,b=map(int,input().split())\n ans=round(n/(2*b))*(n-b*round((n/(2*b))));\n print(ans)", "import math\nn=int(input())\nfor i in range(n):\n a,b=list(map(int,input().split()))\n if a>b:\n a1=math.ceil(a/(2*b))\n b1=a-a1*b\n a2=math.floor(a/(2*b))\n b2=a-a2*b\n print(max(a1*b1,a2*b2))\n else:\n print(0)\n \n \n", "n=int(input())\nfor i in range(n):\n a,b=list(map(int,input().split()))\n if a>b:\n t=a//b\n max1=1\n ans=0\n while(t>=t/2):\n ans=(a-b*t)*t\n max1=max(ans,max1)\n t-=1\n print(max1)\n else:\n print(0)\n \n \n", "n=int(input())\nfor i in range(n):\n a,b=map(int,input().split())\n if a>b:\n t=a//b\n max1=1\n ans=0\n while(t>0):\n ans=(a-b*t)*t\n max1=max(ans,max1)\n t-=1\n print(max1)\n else:\n print(0)", "# cook your dish here\nt = int(input())\nfor i in range(t):\n # n for total energy, b for energy of second screen\n n,b = map(int,input().split(\" \"))\n num = n//b\n final = [i*(n-b*i) for i in range(num+1)]\n print(max(final))", "def function(x,n):\n if x>n:\n return 0\n return x*(n-x*b)\nfor _ in range(int(input())):\n n,b=list(map(int,input().split()))\n #print(n//(2*b),n//(2*b)+1)\n print(max((function(n//(2*b),n),function(n//(2*b)+1,n))))\n \n \n", "def closestNumber(n, m) : \n# Find the quotient \n q = int(n / m) \n \n# 1st possible closest number \n n1 = m * q \n \n# 2nd possible closest number \n if((n * m) > 0) : \n n2 = (m * (q + 1)) \n else : \n n2 = (m * (q - 1)) \n \n # if true, then n1 is the required closest number \n if (abs(n - n1) < abs(n - n2)) : \n return n1 \n \n # else n2 is the required closest number \n return n2 \n\nT = int(input())\nfor j in range(1, T+1):\n N, B = input().split()\n N = int(N)\n B = int(B)\n p = N % B\n k = N\n fs = 0\n maxim = 0\n \n print(int((N-closestNumber(int(N/2), B))*(closestNumber(int(N/2), B))/B))\n \n \n", "T = int(input())\nfor j in range(1, T+1):\n N, B = input().split()\n N = int(N)\n B = int(B)\n p = N % B\n k = N\n fs = 0\n maxim = 0\n for i in range(p, N-B+1, B):\n N = k\n fs = 0\n ss = 0\n fs = fs + i\n N = N-i\n while (N>=B):\n ss = ss + fs\n N = N-B\n if ss > maxim:\n maxim = ss\n print(maxim)\n \n \n", "T = int(input())\nfor j in range(1, T+1):\n N, B = input().split()\n N = int(N)\n B = int(B)\n k = N\n fs = 0\n maxim = 0\n for i in range(1, N-B+1):\n N = k\n fs = 0\n ss = 0\n fs = fs + i\n N = N-i\n while (N>=B):\n ss = ss + fs\n N = N-B\n if ss > maxim:\n maxim = ss\n print(maxim)\n \n \n", "T = int(input())\nfor j in range(1, T+1):\n N, B = input().split()\n N = int(N)\n B = int(B)\n k = N\n fs = 0\n maxim = 0\n for i in range(1, N+1):\n N = k\n fs = 0\n ss = 0\n fs = fs + i\n N = N-i\n while (N>=B):\n ss = ss + fs\n N = N-B\n if ss > maxim:\n maxim = ss\n print(maxim)\n \n \n", "from math import *\nfor j in range(int(input())):\n n,b=list(map(int,input().split()))\n a=n/(2*b)\n a1=ceil(a)\n a2=floor(a)\n d=(n-a1*b)*a1\n e=(n-a2*b)*a2\n print(max(d,e))\n", "import math\ndef ushijima(x):\n return (n-b*x)*x\nt = int(input())\nfor i in range(t):\n (n,b) = (int(x) for x in input().split())\n y1 = math.floor((math.floor(n/2))/b)\n y2 = math.floor((math.ceil(n/2))/b)\n y3 = math.ceil((math.floor(n/2))/b)\n y4 = math.ceil((math.ceil(n/2))/b)\n if y1==0 and y2==0 and y3==0 and y4==0:\n print(\"0\")\n\n else:\n print(max(ushijima(y1),ushijima(y2),ushijima(y3),ushijima(y4)))", "from math import floor,ceil\nfor _ in range(int(input())):\n n,k=map(int,input().split())\n t1=ceil(ceil(n/2)/k)\n t2=ceil(floor(n/2)/k)\n t3=floor(ceil(n/2)/k)\n t4=floor(floor(n/2)/k)\n if not t1:t1=1\n if not t2:t2=1\n if not t3:t3=1\n if not t4:t4=1\n t1= int((n-k*t1)*t1)\n t2= int((n-k*t2)*t2)\n t3= int((n-k*t3)*t3)\n t4= int((n-k*t4)*t4)\n if t1<0 and t2<0 and t3<0 and t4<0:\n print(0)\n else:\n print(max(t1,t2,t3,t4))", "for _ in range(int(input())):\n n,k=list(map(int,input().split()))\n t1=-(-(n/2)//k)\n t2=(n/2)//k\n if not t1:t1=1\n if not t2:t2=1\n t1= int((n-k*t1)*t1)\n t2= int((n-k*t2)*t2)\n if t1<0 and t2<0:\n print(0)\n else:\n print(max(t1,t2))\n\n"]

{"inputs": [["3", "10 2", "8 5", "6 1"]], "outputs": [["12", "3", "9"]]}

INTERVIEW

PYTHON3

CODECHEF

4,129

2dab08a1c24aa8d9e1ff58ee2e34672e

UNKNOWN

Chef has a circular sequence $A$ of $N$ non-negative integers $A_1, A_2, \ldots, A_N$ where $A_i$ and $A_{i+1}$ are considered adjacent, and elements $A_1$ and $A_N$ are considered adjacent. An operation on position $p$ in array $A$ is defined as replacing $A_p$ by the bitwise OR of elements adjacent to $A_p$. Formally, an operation is defined as: - If $p = 1$, replace $A_1$ with $A_N | A_{2}$ - If $1 < p < N$, replace $A_p$ with $A_{p-1} | A_{p+1}$ - If $p = N$, replace $A_N$ with $A_{N-1} | A_1$ Here, '|' denotes the bitwise OR operation. Now, Chef must apply operations at each position exactly once, but he may apply the operations in any order. Being a friend of Chef, you are required to find a sequence of operations, such that after applying all the $N$ operations, the bitwise OR of the resulting array is $K$, or determine that no such sequence of operations exist. -----Input:----- - The first line of the input contains a single integer $T$ denoting the number of test cases. The description of $T$ test cases follows. - The first line of each test case contains two space-separated integers $N$ and $K$ denoting the number of elements, and the required bitwise OR after operations. - The second line contains $N$ space-separated integers $A_1, A_2, \ldots, A_N$. -----Output:----- For each test case, if no valid sequence of operations exist, print -1. Otherwise, print $N$ space-separated integers in which $i$-th integer denote the position chosen in the $i$-th operation. If there are multiple valid sequences of operations, you may print any valid sequence. -----Constraints----- - $1 \le T \le 10^5$ - $3 \le N \le 2*10^5$ - $0 \le A_i, K \le 10^9$ - It's guaranteed that the total length of the arrays in one test file doesn't exceed $10^6$ -----Sample Input:----- 5 3 6 2 1 6 3 6 2 1 5 3 7 2 4 6 3 7 1 2 4 3 7 1 2 6 -----Sample Output:----- 2 1 3 -1 -1 -1 2 3 1 -----Explanation:----- In the first test case, initially, the sequence is {2, 1, 6}. - Chef applies the operation on the $2^{nd}$ index, so the sequence converts to {2, 6, 6}. - Next, Chef applies the operation on the $1^{st}$ index, so the sequence converts to {6, 6, 6}. - Next, Chef applies the operation on the $3^{rd}$ index, and this time sequence does not change. The final sequence is {6, 6, 6}, and bitwise OR of this sequence is $6$ that is equal to given $K$.

["t=int(input())\ndef check():\n pref = [0]*n\n pref[0]=a[0]\n suff = [0]*n\n suff[-1]=a[-1]\n for i in range (1,n):\n pref[i] = pref[i-1]|a[i]\n suff[n-i-1] = suff[n-i]|a[n-i-1]\n if suff[1]==k:\n return 0\n elif pref[n-2]==k:\n return n-1\n else:\n for i in range (1,n-1):\n if pref[i-1]|suff[i+1] == k:\n return i\n return -1\nwhile(t):\n t-=1\n n,k=[int(i) for i in input().split()]\n a=[int(i) for i in input().split()]\n ans = []\n arr = [0]*n\n for i in range (n):\n if k|a[i] != k:\n a[i] = a[i-1]|a[(i+1)%(n)]\n ans.append(i+1)\n arr[i]=1\n\n x = 0\n count = 0\n for i in range (n):\n x|=a[i]\n \n if x!= k:\n print(-1)\n else:\n y = check()\n if y == -1:\n print(-1)\n else:\n for i in range (y,n+y):\n if arr[i%n]==0:\n arr[i%n]==1\n ans.append((i%n)+1)\n print(*ans)", "# cook your dish here\ntests = int(input())\nfor _ in range(tests):\n n, k = [int(j) for j in input().split()]\n nums = [int(j) for j in input().split()]\n check = [(j - (j & k)) != 0 for j in nums]\n impossible = check[0] and check[-1]\n for i in range(n-1):\n impossible = impossible or (check[i] and check[i+1])\n if impossible:\n print(-1)\n elif sum(check) != 0:\n start = -1\n for i in range(-1,n-1):\n if check[i]:\n nums[i] = nums[i-1] | nums[i+1]\n if start == -1:\n start = i+1\n for i in range(start,start+n):\n if not check[i%n]:\n nums[i%n] = nums[(i-1)%n] | nums[(i+1)%n]\n answer = 0\n for i in range(n):\n answer = answer | nums[i]\n if answer == k:\n for i in range(n):\n if check[i]:\n print(i+1, end = \" \")\n for i in range(start,start+n):\n if not check[i%n]:\n print(i%n+1, end = \" \")\n print(\"\")\n else:\n print(-1)\n else:\n for i in range(-1,n-1):\n if nums[i] == nums[i] & (nums[i-1] | nums[i+1]):\n for j in range(i,i+n):\n nums[j%n] = nums[(j-1)%n] | nums[(j+1)%n]\n answer = 0\n for j in range(n):\n answer = answer | nums[j]\n if answer == k:\n for j in range(i,i+n):\n print((j+n)%n+1,end = \" \")\n print(\"\")\n else:\n print(-1)\n impossible = True\n break\n if not impossible:\n for i in range(n):\n ss = list(nums)\n for j in range(i,i+n):\n ss[j%n] = ss[(j+1)%n] | ss[(j-1)%n]\n answer = 0\n for j in range(n):\n answer = answer | ss[j]\n if answer == k:\n for j in range(i,i+n):\n print((j%n)+1,end=\" \")\n print(\"\")\n impossible = True\n break\n if not impossible:\n print(-1)\n ", "t=int(input())\ndef check():\n pref = [0]*n\n pref[0]=a[0]\n suff = [0]*n\n suff[-1]=a[-1]\n for i in range (1,n):\n pref[i] = pref[i-1]|a[i]\n suff[n-i-1] = suff[n-i]|a[n-i-1]\n if suff[1]==k:\n return 0\n elif pref[n-2]==k:\n return n-1\n else:\n for i in range (1,n-1):\n if pref[i-1]|suff[i+1] == k:\n return i\n return -1\nwhile(t):\n t-=1\n n,k=[int(i) for i in input().split()]\n a=[int(i) for i in input().split()]\n ans = []\n arr = [0]*n\n for i in range (n):\n if k|a[i] != k:\n a[i] = a[i-1]|a[(i+1)%(n)]\n ans.append(i+1)\n arr[i]=1\n\n x = 0\n count = 0\n for i in range (n):\n x|=a[i]\n \n if x!= k:\n print(-1)\n else:\n y = check()\n if y == -1:\n print(-1)\n else:\n for i in range (y,n+y):\n if arr[i%n]==0:\n arr[i%n]==1\n ans.append((i%n)+1)\n print(*ans)\n", "# cook your dish here\ndef check():\n pref = [0]*n;pref[0]=a[0];suff = [0]*n;suff[-1]=a[-1]\n for i in range (1,n):pref[i] = pref[i-1]|a[i];suff[n-i-1] = suff[n-i]|a[n-i-1]\n if suff[1]==k:return 0\n elif pref[n-2]==k:return n-1\n else:\n for i in range (1,n-1):\n if pref[i-1]|suff[i+1] == k:return i\n return -1\nfor z in range(int(input())):\n n,k=[int(i) for i in input().split()];a=[int(i) for i in input().split()];ans,arr = [],[0]*n\n for i in range (n):\n if k|a[i] != k:a[i] = a[i-1]|a[(i+1)%(n)];ans.append(i+1);arr[i]=1\n x = 0;count = 0\n for i in range (n):x|=a[i] \n if x!= k:print(-1)\n else:\n y = check()\n if y == -1:print(-1)\n else:\n for i in range (y,n+y):\n if arr[i%n]==0:arr[i%n]==1;ans.append((i%n)+1)\n print(*ans)", "# cook your dish here\ndef check():\n pref = [0]*n;pref[0]=a[0];suff = [0]*n;suff[-1]=a[-1]\n for i in range (1,n):pref[i] = pref[i-1]|a[i];suff[n-i-1] = suff[n-i]|a[n-i-1]\n if suff[1]==k:return 0\n elif pref[n-2]==k:return n-1\n else:\n for i in range (1,n-1):\n if pref[i-1]|suff[i+1] == k:return i\n return -1\nfor z in range(int(input())):\n n,k=[int(i) for i in input().split()];a=[int(i) for i in input().split()];ans,arr = [],[0]*n\n for i in range (n):\n if k|a[i] != k:a[i] = a[i-1]|a[(i+1)%(n)];ans.append(i+1);arr[i]=1\n x = 0;count = 0\n for i in range (n):x|=a[i] \n if x!= k:print(-1)\n else:\n y = check()\n if y == -1:print(-1)\n else:\n for i in range (y,n+y):\n if arr[i%n]==0:arr[i%n]==1;ans.append((i%n)+1)\n print(*ans)", "def check():\n pref = [0]*n;pref[0]=a[0];suff = [0]*n;suff[-1]=a[-1]\n for i in range (1,n):pref[i] = pref[i-1]|a[i];suff[n-i-1] = suff[n-i]|a[n-i-1]\n if suff[1]==k:return 0\n elif pref[n-2]==k:return n-1\n else:\n for i in range (1,n-1):\n if pref[i-1]|suff[i+1] == k:return i\n return -1\nfor z in range(int(input())):\n n,k=[int(i) for i in input().split()];a=[int(i) for i in input().split()];ans,arr = [],[0]*n\n for i in range (n):\n if k|a[i] != k:a[i] = a[i-1]|a[(i+1)%(n)];ans.append(i+1);arr[i]=1\n x = 0;count = 0\n for i in range (n):x|=a[i] \n if x!= k:print(-1)\n else:\n y = check()\n if y == -1:print(-1)\n else:\n for i in range (y,n+y):\n if arr[i%n]==0:arr[i%n]==1;ans.append((i%n)+1)\n print(*ans)", "t=int(input())\ndef check():\n pref = [0]*n\n pref[0]=a[0]\n suff = [0]*n\n suff[-1]=a[-1]\n for i in range (1,n):\n pref[i] = pref[i-1]|a[i]\n suff[n-i-1] = suff[n-i]|a[n-i-1]\n if suff[1]==k:\n return 0\n elif pref[n-2]==k:\n return n-1\n else:\n for i in range (1,n-1):\n if pref[i-1]|suff[i+1] == k:\n return i\n return -1\nwhile(t):\n t-=1\n n,k=[int(i) for i in input().split()]\n a=[int(i) for i in input().split()]\n ans = []\n arr = [0]*n\n for i in range (n):\n if k|a[i] != k:\n a[i] = a[i-1]|a[(i+1)%(n)]\n ans.append(i+1)\n arr[i]=1\n\n x = 0\n count = 0\n for i in range (n):\n x|=a[i]\n \n if x!= k:\n print(-1)\n else:\n y = check()\n if y == -1:\n print(-1)\n else:\n for i in range (y,n+y):\n if arr[i%n]==0:\n arr[i%n]==1\n ans.append((i%n)+1)\n print(*ans)\n", "t=int(input())\r\ndef check():\r\n pref = [0]*n\r\n pref[0]=a[0]\r\n suff = [0]*n\r\n suff[-1]=a[-1]\r\n for i in range (1,n):\r\n pref[i] = pref[i-1]|a[i]\r\n suff[n-i-1] = suff[n-i]|a[n-i-1]\r\n if suff[1]==k:\r\n return 0\r\n elif pref[n-2]==k:\r\n return n-1\r\n else:\r\n for i in range (1,n-1):\r\n if pref[i-1]|suff[i+1] == k:\r\n return i\r\n return -1\r\nwhile(t):\r\n t-=1\r\n n,k=[int(i) for i in input().split()]\r\n a=[int(i) for i in input().split()]\r\n ans = []\r\n arr = [0]*n\r\n for i in range (n):\r\n if k|a[i] != k:\r\n a[i] = a[i-1]|a[(i+1)%(n)]\r\n ans.append(i+1)\r\n arr[i]=1\r\n\r\n x = 0\r\n count = 0\r\n for i in range (n):\r\n x|=a[i]\r\n \r\n if x!= k:\r\n print(-1)\r\n else:\r\n y = check()\r\n if y == -1:\r\n print(-1)\r\n else:\r\n for i in range (y,n+y):\r\n if arr[i%n]==0:\r\n arr[i%n]==1\r\n ans.append((i%n)+1)\r\n print(*ans)"]

{"inputs": [["5", "3 6", "2 1 6", "3 6", "2 1 5", "3 7", "2 4 6", "3 7", "1 2 4", "3 7", "1 2 6"]], "outputs": [["2 1 3", "-1", "-1", "-1", "2 3 1"]]}

INTERVIEW

PYTHON3

CODECHEF

9,092

a2bebfb98e48b43da636716f639f8ebb

UNKNOWN

The chef is trying to decode some pattern problems, Chef wants your help to code it. Chef has one number K(odd) to form a new pattern. Help the chef to code this pattern problem. -----Input:----- - First-line will contain $T$, the number of test cases. Then the test cases follow. - Each test case contains a single line of input, one integer $K$. -----Output:----- For each test case, output as the pattern. -----Constraints----- - $1 \leq T \leq 100$ - $1 \leq K \leq 100$ -----Sample Input:----- 4 1 3 5 7 -----Sample Output:----- 1 111 111 111 11111 11 11 1 1 1 11 11 11111 1111111 11 11 1 1 1 1 1 1 1 1 1 1 1 11 11 1111111 -----EXPLANATION:----- No need, else pattern can be decode easily.

["from sys import stdin, stdout\nfrom math import floor, gcd, fabs, factorial, fmod, sqrt, inf, log\nfrom collections import defaultdict as dd, deque\nfrom heapq import merge, heapify, heappop, heappush, nsmallest\nfrom bisect import bisect_left as bl, bisect_right as br, bisect\nmod = pow(10, 9) + 7\nmod2 = 998244353\ndef inp(): return stdin.readline().strip()\ndef out(var, end=\"\\n\"): stdout.write(str(var)+\"\\n\")\ndef outa(*var, end=\"\\n\"): stdout.write(' '.join(map(str, var)) + end)\ndef lmp(): return list(mp())\ndef mp(): return map(int, inp().split())\ndef smp(): return map(str, inp().split())\ndef l1d(n, val=0): return [val for i in range(n)]\ndef l2d(n, m, val=0): return [l1d(n, val) for j in range(m)]\ndef remadd(x, y): return 1 if x%y else 0\ndef ceil(a,b): return (a+b-1)//b\n\ndef isprime(x):\n if x<=1: return False\n if x in (2, 3): return True\n if x%2 == 0: return False\n for i in range(3, int(sqrt(x))+1, 2):\n if x%i == 0: return False\n return True\n\nfor _ in range(int(inp())):\n n = int(inp())\n for i in range(n):\n for j in range(n):\n if i==0 or i==n-1 or j==0 or j==n-1 or i==j or i+j==n-1:\n print(1, end=\"\")\n else:\n print(\" \", end=\"\")\n print()", "for _ in range(int(input())):\r\n n = int(input())\r\n\r\n print('1' * n)\r\n\r\n s = list(' ' * n)\r\n s[0] = s[-1] = '1'\r\n\r\n l, r = 1, n-2\r\n for i in range(2, n):\r\n s[l] = s[r] = '1'\r\n print(*s, sep='')\r\n s[l] = s[r] = ' '\r\n\r\n l += 1\r\n r -= 1\r\n\r\n if n != 1:\r\n print('1' * n)"]

{"inputs": [["4", "1", "3", "5", "7"]], "outputs": [["1", "111", "111", "111", "11111", "11 11", "1 1 1", "11 11", "11111", "1111111", "11 11", "1 1 1 1", "1 1 1", "1 1 1 1", "11 11", "1111111"]]}

INTERVIEW

PYTHON3

CODECHEF

1,659

f080afea8556628d4020028dbcc3f4ea

UNKNOWN

Humpy, the little elephant, has his birthday coming up. He invited all his cousins but doesn’t know how many of them are really coming as some of them are having exams coming up. He will only get to know how many of them are coming on the day of his birthday. He ordered sugarcane for his party, of length L. Humpy’s mom decided that she will be dividing the sugarcane among Humty and his friends in a way such that they get the sugarcane in ratio of their ages. Your task is to determine whether it is possible to serve sugarcane to everyone as integral multiples of their ages. -----INPUT----- First line of input contains an integer N, denoting the number of test cases. Then N test cases follow. The first line of each test case contains three integers K, L and E. K denoting the number of friends coming; L denoting the length of the sugarcane and E denoting the age of the little elephant. Next line has K space separated integers denoting the age of friends who came to the party. -----OUTPUT----- For each test case, output “YES” (without quotes) if everyone gets their part as integral multiples of their ages; otherwise output “NO”(without quotes). -----CONSTRAINTS----- - 1 <= T<=30 - 1 <= K<=1000 - 1 <= L<=1000000 - 1 <= E<=100000 - 1 <= Age of Cousins<=100000 -----Example----- Input: 2 4 10 2 2 2 3 1 4 12 3 6 5 7 3 Output: YES NO

["# your code goes here\nfrom sys import stdin, stdout\nn = int(stdin.readline())\nwhile n:\n n -= 1\n k, l, e = map(int, stdin.readline().strip().split(' '))\n a = map(int, stdin.readline().strip().split(' '))\n x = float(l) / float(e + sum(a))\n if x - int(x):\n stdout.write(\"NO\\n\")\n else:\n stdout.write(\"YES\\n\")", "n = [\"\"]\nfor x in range(0,int(input())):\n k,l,e = list(map(int,input().split()))\n sum=0\n\n n = list(map(int,input().split()))\n\n for i in range(0,k):\n sum += n[i]\n sum += e\n\n if l%sum == 0:\n print(\"YES\")\n else:\n print(\"NO\")", "from math import *\nt=int(input())\nfor i in range(t):\n a=list(map(float,input().split()))\n b=list(map(float,input().split()))\n c=sum(b)+a[2]\n d=float(a[1]/c)\n if ceil(d)==d:\n print(\"YES\")\n else:\n print(\"NO\")\n", "for _ in range(0,int(input())):\n ans,[l,m,n]=['NO','YES'],list(map(int,input().split())) \n o = list(map(int,input().split())) +[n]\n print(ans[m%sum(o) ==0])\n", "for __ in range(eval(input())):\n k, l, e = list(map(int,input().split()))\n arr = list(map(int, input().split()))\n val = sum(arr) + e\n if l%val ==0:\n print(\"YES\")\n else:\n print(\"NO\")\n", "for __ in range(eval(input())):\n n, l, e = list(map(int, input().split()))\n a = list(map(int, input().split()))\n if l%(sum(a) + e)==0: print('YES')\n else: print('NO')\n", "for t in range(int(input())):\n k,l,e = list(map(int,input().split()))\n a = list(map(int,input().split()))\n s = float(sum(a)+e)\n if (l/s==int(l/s)):\n print(\"YES\")\n else:\n print(\"NO\")"]

{"inputs": [["2", "4 10 2", "2 2 3 1", "4 12 3", "6 5 7 3"]], "outputs": [["YES", "NO"]]}

INTERVIEW

PYTHON3

CODECHEF

1,543

c4d22849b389c122b9e18922a0e73e36

UNKNOWN

You may have tried your level best to help Chef but Dr Doof has managed to come up with his masterplan in the meantime. Sadly, you have to help Chef once again. Dr Doof has designed a parenthesis-inator. It throws a stream of $N$ brackets at the target, $1$ bracket per second. The brackets can either be opening or closing. Chef appears in front of the stream at time $t$. If Chef faces an opening bracket, he gets hit. However, if he faces a closing bracket, he may choose to let it pass through him (Chef is immune to closing brackets). Chef gets a chance to counter attack Doof as soon as he finds a balanced non-empty bracket sequence. Help Chef by providing him the minimum time $x$ at which he will be able to launch his counter attack. If Chef is unable to counter attack, answer $-1$. Formally, you are given a string $S$ of length $N$ consisting only of opening brackets $($ and closing brackets $)$. The substring of $S$ starting at index $L$ and ending at index $R$, i.e. $S_L S_{L+1} \ldots S_{R}$ is denoted by $S[L, R]$ . Consider $Q$ cases. In the $i^{\text{th}}$ case, Chef appears at time $t_i$ $(1 \leq t_i \leq N)$ and faces all characters from index $t_i$ to $N$. Find the minimum index $x$ $(t_i \leq x \leq N)$ such that the substring $S[t_i, x]$ contains a non-empty balanced bracket subsequence containing the same number of opening brackets as $S[t_i, x]$ (i.e., you cannot remove any opening bracket from the substring). If such an $x$ does not exist, print $-1$. A string $X$ is called a subsequence of a string $Y$ if it is possible to obtain $X$ by erasing some (possibly zero) characters from $Y$ without changing the order of the remaining characters. A balanced bracket sequence is defined as: - an empty string is a balanced bracket sequence. - if $s$ is a balanced bracket sequence, then so is $(s)$. - if $s$ and $t$ are balanced bracket sequences, then so is $st$. $Note :-$ The input files are large. The use of Fast I/O is recommended. -----Input----- - The first line contains a single integer $T$ denoting the number of testcases. - The first line of each test case contains the string $S$. - The next line contains a single integer $Q$ denoting the number of cases to consider. - The next line contains $Q$ space separated integers, each denoting $t_i$. -----Output----- For each query, print the minimum value of $x$ in a separate line. If no such $x$ exists, print $-1$. -----Constraints----- - $1 \leq T \leq 10^3$ - $1 \leq |S| \leq 10^7$ - $1 \leq Q \leq 10^6$ - $1 \leq t_i \leq N$ - Every character of $S$ is either $($ or $)$. - Sum of $|S|$ and $Q$ over all testcases for a particular test file does not exceed $10^7$ and $10^6$ respectively. -----Sample Input----- 1 )())((() 3 1 7 6 -----Sample Output----- 3 8 -1 -----Explanation----- For the first query, Chef chooses to let $S_1$ pass through him, gets hit by $S_2$ and finally completes a balanced bracket sequence by adding $S_3$ to $S_2$ at time $x$ = $3$.

["import sys\nimport bisect as bi\nimport math\nfrom collections import defaultdict as dd\ninput=sys.stdin.readline\n##sys.setrecursionlimit(10**7)\ndef cin():\n return list(map(int,sin().split()))\ndef ain(): \n return list(map(int,sin().split()))\ndef sin():\n return input()\ndef inin():\n return int(input())\nfor _ in range(inin()):\n s=sin().strip();q=inin();a=ain();n=len(s);store=[0]*n;store1=[-1]*n;f=0;d=dd(int)#input wgera\n store[0]=1 if s[0]=='(' else -1\n d[store[0]]=1\n for i in range(1,n):\n if(s[i]=='('):\n store[i]=store[i-1]+1\n d[store[i]]=i+1\n else:\n store[i]=store[i-1]-1\n if(d[store[i-1]]):\n store1[d[store[i-1]]-1]=i+1\n post=[-1]*n;\n if(n==1 or(n==2 and s!=\"()\")):f=1 # corner case\n for i in range(n-2,-1,-1):\n if(s[i]=='('): #dekhna h ki agla agr ( h toh -1 hi rhega wrna wo jo stored tha uppr\n if(store1[i]!=-1):post[i]=store1[i] #wo iska ans ho jayega\n else:post[i]=post[i+1] #jo iske agle ka answer hoga wahi iska hoga\n for i in a:\n if(f):print(-1) #cond ki jaroorat nhi thi pr tasalli (>_<)\n else:print(post[i-1]) #wrna uska ans print kra do\n \n \n##n=m=0\n##s=''\n##t=''\n##dp=[]\n##def solve(inds,indt,k,cont):\n## ans=-999999999999999\n## print(dp)\n## if(k<0):return 0\n## elif(inds>=n and indt>=m):return 0\n## elif(dp[inds][indt][k][cont]!=-1):return dp[inds][indt][k][cont]\n## else:\n## if(indt<m):ans=max(ans,solve(inds,indt+1,k,0))\n## if(inds<n):ans=max(ans,solve(inds+1,indt,k,0))\n## if(s[inds]==t[indt]):\n## ans=max(ans,solve(inds+1,indt+1,k-1,1)+1)\n## if(cont):ans=max(ans,solve(inds+1,indt+1,k,1)+1)\n## dp[inds][indt][k][cont]=ans\n## return ans \n\n## n,m,k=cin()\n## s=sin().strip()\n## t=sin().strip()\n## dp=[[[[-1]*2 for i in range(k)] for i in range(m+1)] for i in range(n+1)]\n## c=0\n## for i in dp:\n## for j in i:\n## for l in j:\n## c+=1\n## print(l,c)\n## print(solve(0,0,k,0))\n", "# cook your dish here\nT = int(input())\nfor _ in range(T):\n s = input()\n _ = input()\n stack = []\n nextOpen = [-1 for _ in range(len(s))]\n closing = [-1 for _ in range(len(s))]\n nextO = len(s) + 1\n for i in range(len(s) - 1, -1, -1):\n if s[i] == '(':\n nextO = i\n if stack:\n closing[i] = stack.pop()\n else:\n stack.append(i)\n nextOpen[i] = nextO\n\n for t in map(int, input().split()):\n t -= 1\n t = nextOpen[t]\n if t < len(s):\n res = closing[t]\n print(res + 1 if res >= 0 else -1)\n else:\n print(-1)\n", "# cook your dish here\nT = int(input())\nfor _ in range(T):\n s = input()\n _ = input()\n \n stack = []\n nextOpen = [-1 for _ in range(len(s))]\n closing = [-1 for _ in range(len(s))]\n nextO = len(s) + 1\n for i in range(len(s) - 1, -1, -1):\n if s[i] == '(':\n nextO = i\n if stack and stack[-1][0] == 1:\n _, pos = stack.pop()\n closing[i] = pos\n else:\n stack.append((0,i))\n else:\n stack.append((1,i))\n nextOpen[i] = nextO\n\n for t in map(int, input().split()):\n t -= 1\n t = nextOpen[t]\n if t < len(s):\n res = closing[t]\n print(res + 1 if res >= 0 else -1)\n else:\n print(-1)\n", "from sys import stdin, stdout \nfor t in range(int(stdin.readline())):\n s = str(stdin.readline()) \n q = int(stdin.readline())\n a = list(map(int, stdin.readline().split()))\n d = {}\n stc = []\n p = -1\n for i in range((len(s) - 1), -1, -1):\n if(s[i] == ')'):\n stc.append(i)\n d[i+1] = p\n elif(s[i] == '('):\n if(len(stc) >= 1):\n d[i+1] = stc[-1] + 1\n p = d[i + 1]\n stc.pop()\n else:\n d[i+1] = -1\n p = d[i + 1]\n \n for i in a:\n print(d[i])\n \n \n \n", "try:\n tt=int(input())\n while(tt):\n tt=tt-1\n s=input()\n st1, dicti, i = [], {}, 1\n for j in s:\n if j == '(':\n st1.append(i)\n elif st1:\n h = st1.pop() - 2\n dicti[h + 2] = i\n while h >= 0 and s[h] == ')':\n dicti[h + 1] = i\n h -= 1\n i+=1\n q=int(input())\n t=list(map(int,input().split()))\n for i in t:\n if(i in list(dicti.keys())):\n print(dicti[i])\n else:\n print(-1)\nexcept:\n pass\n\n\n", "t = int(input())\r\nfor _ in range(t):\r\n s = input()\r\n s = list(s)\r\n# q = int(input())\r\n n = len(s)\r\n answer=[]\r\n stack = []\r\n stack2 = []\r\n for i in range(len(s)-1,-1,-1):\r\n# print(stack)\r\n# print(s[i])\r\n if s[i]==')':\r\n if answer==[]:\r\n answer = [-1]\r\n stack2.append(i)\r\n stack.append(')')\r\n continue\r\n stack2.append(i)\r\n answer.append(answer[-1])\r\n stack.append(')')\r\n else:\r\n if stack2==[]:\r\n answer.append(-1)\r\n stack.append('(')\r\n else:\r\n stack.pop()\r\n e = stack2[-1]\r\n stack2.pop()\r\n answer.append(e+1)\r\n# if i==5:\r\n# break\r\n answer.reverse()\r\n q = int(input())\r\n W = list(map(int,input().split()))\r\n for i in range(q):\r\n w = W[i]\r\n print(answer[w-1])\r\n# print(answer)\r\n \r\n \r\n \r\n", "import sys\ninput = sys.stdin.readline\n\nT = int(input())\n\nfor _ in range(T):\n\ts = input()\n\tq = int(input())\n\tt = list(map(int,input().split()))\n\tstack = []\n\tval = [-1 for i in range(len(s))]\n\tlast_open = -1\n\tfor i in range(len(s)-2,-1,-1):\n\t\tif s[i] == ')':\n\t\t\tstack.append(i)\n\t\t\tval[i] = last_open\n\t\telse:\n\t\t\tif len(stack) != 0:\n\t\t\t\tval[i] = stack[-1]\n\t\t\t\tstack.pop()\n\t\t\t\tlast_open = val[i]\n\t\t\telse:\n\t\t\t\tlast_open = -1\n\n\tfor i in range(q):\n\t\tif val[t[i]-1] == -1:\n\t\t\tprint(-1)\n\t\telse:\n\t\t\tprint(val[t[i]-1] +1)\n\n\n\n", "for _ in range(int(input())):\r\n\tst=input()\r\n\tq=int(input())\r\n\tqi=list(map(int,input().split()))\r\n\tn=len(st)\r\n\ttracker=0\r\n\t# lastClose=-1\r\n\tans=[-1]*n\r\n\tstack=[]\r\n\tfor i in range(n-1,-1,-1):\r\n\t\tif st[i]==')':\r\n\t\t\tstack.append(i+1)\r\n\t\t\tif i!=n-1:\r\n\t\t\t\tans[i]=ans[i+1]\r\n\t\t\t# lastClose=i+1\r\n\t\t\ttracker-=1\r\n\t\telif tracker<0 and st[i]=='(':\r\n\t\t\tans[i]=stack.pop()\r\n\t\t\ttracker+=1\r\n\t# print(ans)\r\n\tfor i in range(q):\r\n\t\tprint(ans[qi[i]-1])", "try:\n def findans(s):\n l,val,r=[],{},[]\n for i,kk in enumerate(s):\n if kk == '(':\n l.append(i+1)\n elif l:\n x=l.pop()\n val[x]=i+1\n x-=2\n while x>=0 and s[x]==')':\n val[x+1]=i+1\n x-=1\n return val\n \n for ii in range(int(input())):\n b=input()\n dic=findans(b)\n n=int(input())\n q=list(map(int, input().split()))\n for jj in q:\n print(dic.get(jj,-1))\nexcept: pass", "# cook your dish here\nfrom sys import stdin, stdout \nt = int(stdin.readline()) \nwhile(t):\n t -= 1\n string = str(stdin.readline()) \n q = int(stdin.readline())\n a = list(map(int, stdin.readline().split()))\n\n pos = 0\n l = {}\n stack = []\n pos = -1\n for j in range(len(string) - 1, -1, -1):\n #print(string[j])\n if(string[j] == ')'):\n stack.append(j)\n l[j+1] = pos\n elif(string[j] == '('):\n if(len(stack) >= 1):\n l[j+1] = stack[-1] + 1\n pos = l[j + 1]\n stack.pop()\n else:\n l[j+1] = -1\n pos = l[j + 1]\n #print(l) \n for item in a:\n print(l[item])\n \n", "# cook your dish here\nfrom sys import stdin, stdout \nt = int(stdin.readline()) \nwhile(t):\n t -= 1\n string = str(stdin.readline()) \n q = int(stdin.readline())\n a = list(map(int, stdin.readline().split()))\n\n pos = 0\n l = {}\n stack = []\n pos = -1\n for j in range(len(string) - 1, -1, -1):\n #print(string[j])\n if(string[j] == ')'):\n stack.append(j)\n l[j+1] = pos\n elif(string[j] == '('):\n if(len(stack) >= 1):\n l[j+1] = stack[-1] + 1\n pos = l[j + 1]\n stack.pop()\n else:\n l[j+1] = -1\n pos = l[j + 1]\n #print(l) \n for item in a:\n print(l[item])\n \n", "# cook your dish here\nfrom sys import stdin, stdout \n \n\ndef main(): \n \n t = input() \n t=int(t)\n while t:\n t=t-1\n s=input()\n n=len(s)\n #print(n,s)\n l=[0 for i in range(n)]\n l[n-1]=-1\n q=[]\n if s[n-1]==\")\":\n q.append(n-1)\n for i in range(n-2,-1,-1):\n \n if s[i]==\")\":\n l[i]=l[i+1]\n q.append(i)\n elif s[i]==\"(\" and len(q)==0:\n l[i]=-1\n else:\n l[i]=q[len(q)-1]\n q.pop()\n \n Q = int(input())\n #print(l)\n \n arr = [int(x) for x in stdin.readline().split()] \n \n for i in range(Q):\n x=arr[i]\n x=x-1\n if l[x]==-1:\n print(-1)\n else:\n print(l[x]+1)\n \n \n \n \n \n \n \n \n \n \n# call the main method \ndef __starting_point(): \n main() \n__starting_point()", "\n\ndef find_min(s,queries):\n\n stack = []\n\n balancing = [-1]*len(s)\n\n op = [-1]* len(s)\n\n last_opening = -1\n for i in range(len(s)-1,-1,-1):\n if s[i]==')':\n op[i] = last_opening\n else:\n last_opening = i\n\n\n for i in range(len(s)):\n if s[i]==')':\n if len(stack)!=0:\n balancing[stack[-1]] = i\n del stack[-1]\n else:\n stack.append(i)\n\n for query in queries:\n q = query-1\n if s[q]==')':\n if op[q]==-1:\n print(-1)\n continue\n else:\n q = op[q]\n if balancing[q]==-1:\n print(-1)\n else:\n print(balancing[q]+1)\n\nT = int(input())\nwhile T!=0:\n s = input()\n q = int(input())\n queries = [int(a) for a in input().split(\" \")]\n find_min(s,queries)\n T-=1\n\n", "from collections import deque \nfrom sys import stdin\ninput=stdin.readline\nfor _ in range(int(input())):\n s=list(input())\n n=len(s)\n ans=[0]*n\n x=0\n y=0\n a=n-1\n b=n-1\n stack=deque([])\n prev=-1\n while a>=0:\n if s[a]==')':\n stack.append(a)\n ans[a] = prev\n else:\n if len(stack)==0:\n ans[a]=-1\n prev=-1\n else:\n prev=stack[-1]+1\n ans[a]=prev\n stack.pop()\n a-=1\n \n q=int(input())\n x=list(map(int,input().split()))\n for i in x:\n i=i-1\n print(ans[i])\n \n \n", "# from mymodule import input\nt = int(input())\nfor _ in range(t):\n s = input().strip()\n li,stk,tmp = [-1]*len(s),[],[]\n for i in range(len(s)):\n if len(stk):\n if s[i]=='(':\n while len(tmp):\n stk.append(tmp.pop())\n stk.append(i)\n elif s[stk[-1]]=='(':\n li[stk[-1]] = i\n v = stk.pop()\n while len(stk)!=0:\n if s[stk[-1]]==')':\n li[stk[-1]]=v\n stk.pop()\n else:\n break\n tmp.append(i)\n else:\n stk.append(i)\n pass\n elif s[i]=='(':\n while len(tmp)!=0:\n stk.append(tmp.pop())\n stk.append(i)\n else:\n stk.append(i)\n # for i in tmp:\n # li[i] = len(s)\n # print(li,stk)\n q = int(input())\n for i in map(int,input().split()):\n ind = i-1\n while li[ind]!=-1 and s[li[ind]]!=')':\n ind = li[ind]\n if li[ind]!=-1:\n print(li[ind]+1)\n else:\n print(-1)", "\r\nfor _ in range(int(input())):\r\n s = input()\r\n n = int(input())\r\n l = list(map(int, input().split()))\r\n \r\n count = 0 \r\n stk = []\r\n last = -1\r\n store = [0] * len(s)\r\n \r\n \r\n \r\n for i in range(len(s)-1, -1, -1):\r\n if s[i] == ')':\r\n stk.append(i+1)\r\n if last == -1:\r\n store[i] = -1\r\n else:\r\n store[i] = last\r\n \r\n else:\r\n if len(stk) == 0:\r\n store[i] = -1\r\n last = -1\r\n else:\r\n x = stk.pop()\r\n store[i] = x\r\n last = x\r\n \r\n # print(store)\r\n \r\n for i in range(len(l)):\r\n print(store[l[i]-1])\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n", "import sys\r\nimport math\r\nfrom collections import defaultdict,Counter\r\n\r\ninput=sys.stdin.readline\r\ndef print(x):\r\n sys.stdout.write(str(x)+\"\\n\")\r\n\r\n# sys.stdout=open(\"CP3/output.txt\",'w')\r\n# sys.stdin=open(\"CP3/input.txt\",'r')\r\n\r\n# m=pow(10,9)+7\r\nt=int(input())\r\nfor i in range(t):\r\n s=input().strip()\r\n c=0\r\n v=[0]*len(s)\r\n st=[]\r\n prev=-2\r\n c1=0\r\n for j in range(len(s)-1,-1,-1):\r\n if s[j]==')':\r\n # c1-=1\r\n # if c1>=0:\r\n # c=0\r\n v[j]=prev\r\n st.append(j)\r\n else:\r\n c1+=1\r\n c+=1\r\n if st:\r\n v[j]=st.pop()\r\n else:\r\n v[j]=-2\r\n prev=v[j]\r\n # if len(st)>=c:\r\n # v[j]=st[-c]\r\n # prev=st[-c]\r\n # else:\r\n # v[j]=-2\r\n # prev=-2\r\n q1=int(input())\r\n q=list(map(int,input().split()))\r\n # print(v)\r\n for j in q:\r\n print(v[j-1]+1)\r\n"]

{"inputs": [["1", ")())((()", "3", "1 7 6"]], "outputs": [["3", "8", "-1"]]}

INTERVIEW

PYTHON3

CODECHEF

15,263

af35cb3838b6eea0e5cb36e65afbd8ca

UNKNOWN

Let's call a sequence good if the sum of all its elements is $0$. You have a sequence of integers $A_1, A_2, \ldots, A_N$. You may perform any number of operations on this sequence (including zero). In one operation, you should choose a valid index $i$ and decrease $A_i$ by $i$. Can you make the sequence good using these operations? -----Input----- - The first line of the input contains a single integer $T$ denoting the number of test cases. The description of $T$ test cases follows. - The first line of each test case contains a single integer $N$. - The second line contains $N$ space-separated integers $A_1, A_2, \ldots, A_N$. -----Output----- For each test case, print a single line containing the string "YES" if it is possible to make the given sequence good or "NO" if it is impossible. -----Constraints----- - $1 \le T \le 1,000$ - $1 \le N \le 10$ - $|A_i| \le 100$ for each valid $i$ -----Subtasks----- Subtask #1 (10 points): $N = 1$ Subtask #2 (30 points): $N \le 2$ Subtask #3 (60 points): original constraints -----Example Input----- 2 1 -1 2 1 2 -----Example Output----- NO YES -----Explanation----- Example case 2: We can perform two operations ― subtract $1$ from $A_1$ and $2$ from $A_2$.

["n=int(input())\nfor i in range(n):\n t=int(input())\n m=list(map(int,input().split()))\n p,q=0,0\n if t==1:\n if m[0]>=0:\n print('YES')\n else:\n print('NO')\n else:\n for i in m:\n if i<0:\n q+=i\n else:\n p+=i\n if p>=abs(q):\n print('YES')\n else:\n print('NO')", "n=int(input())\nfor i in range(n):\n t=int(input())\n m=list(map(int,input().split()))\n p,q=0,0\n if t==1:\n if m[0]>=0:\n print('YES')\n else:\n print('NO')\n else:\n for i in m:\n if i<0:\n q+=1\n else:\n p+=1\n if p>=abs(q):\n print('YES')\n else:\n print('NO')", "for i in range(int(input())):\n n=int(input())\n l=list(map(int,input().split()))\n a,b=0,0\n if n==1:\n if l[0]>=0:\n print('YES')\n else:\n print('NO')\n else:\n for i in l:\n if i<0:\n b+=i\n else:\n a+=i\n if a>=abs(b):\n print('YES')\n else:\n print('NO')", "# cook your dish here\nfor __ in range(int(input())):\n n=int(input())\n arr=list(map(int,input().split()))\n p_c,n_c=0,0\n if n==1:\n if arr[0]>=0:\n print(\"YES\")\n else:\n print(\"NO\")\n else:\n for i in arr:\n if i<0:\n n_c+=i\n else:\n p_c+=i\n \n if p_c>=abs(n_c):\n print(\"YES\")\n else:\n print(\"NO\")\n", "# cook your dish here\nt=int(input())\nfor i in range(t):\n n=int(input())\n l=list(map(int,input().split()))\n s=sum(l)\n if s>=0:\n print(\"YES\")\n else:\n print(\"NO\")\n", "# cook your dish here\nn = int(input())\nfor i in range(n):\n a = int(input())\n l = [int(x) for x in input().split()]\n if sum(l) >= 0:\n print(\"YES\")\n else:\n print(\"NO\")", "for _ in range(int(input())):\n a=int(input())\n b=list(map(int,input().split()))\n k=sum(b)\n if k>=0:\n print(\"YES\")\n else:\n print(\"NO\")", "# cook your dish here\n# cook your dish here\nfor i in range(int(input())):\n n=int(input())\n a=list(map(int,input().split()))\n if(sum(a)>=0):\n print(\"YES\")\n else:\n print(\"NO\")", "# cook your dish here\nfor i in range(int(input())):\n n=int(input())\n a=list(map(int,input().split()))\n if(sum(a)>=0):\n print(\"YES\")\n else:\n print(\"NO\")", "t=int(input())\nfor i in range(t):\n n=int(input())\n a=list(map(int,input().split()))\n search=0\n for i in range(len(a)):\n if(a[i]<0):\n search=1\n break\n if(search==1):\n print(\"NO\")\n else:\n print(\"YES\")\n", "# cook your dish here\nfor _ in range(int(input())):\n n = int(input())\n l = list(map(int,input().split()))\n if sum(l)>=0:\n print('YES')\n else:\n print('NO')", "\nfor _ in range(int(input())):\n n=int(input())\n a=list(map(int,input().split()))\n if(sum(a)>=0):\n print(\"YES\")\n else:\n print(\"NO\")", "for _ in range(int(input())):\n n=int(input())\n l=list(map(int,input().split()))\n if(sum(l)>=0):\n print(\"YES\")\n else:\n print(\"NO\")\n", "for _ in range(int(input())):\n n=int(input())\n l=list(map(int,input().split()))\n if(sum(l)>=0):\n print(\"YES\")\n else:\n print(\"NO\")", "# cook your dish here\nfor _ in range(int(input())):\n n=int(input())\n l=list(map(int,input().split()))\n if(sum(l)>=0):\n print(\"YES\")\n else:\n print(\"NO\")", "T = int(input())\nfor i in range(T):\n N = int(input())\n l = list(map(int, input().split()))\n if (sum(l) < 0):\n print(\"NO\")\n else:\n print(\"YES\")", "T = int(input())\nfor i in range(0, T):\n n = int(input())\n arr = list(map(int, input().split()))\n flag=0\n if sum(arr)<0:\n flag=1\n if flag==1:\n print(\"NO\")\n else:\n print(\"YES\")\n\n\n", "T = int(input())\nfor i in range(0, T):\n n = int(input())\n arr = list(map(int, input().split()))\n flag=0\n for x in arr:\n if x<0:\n flag=1\n break\n if flag==1:\n print(\"NO\")\n else:\n print(\"YES\")\n\n\n", "for _ in range(int(input())):\n n=int(input())\n l=list(map(int,input().split(\" \")))\n s=sum(l)\n if s>=0:\n print(\"YES\")\n else:\n print(\"NO\")", "# ------- main function -------\n\ndef solve():\n n = int(input())\n a = list(map(int,input().split(' ')))\n ls = sum(a)\n if ls >= 0:\n print(\"YES\")\n else:\n print(\"NO\")\n\n\n\n# ------- starting point of program -------\n\ndef __starting_point():\n for _ in range(int(input())):\n solve()\n\n__starting_point()", "for _ in range(int(input())):\n n= int(input())\n arr = list(map(int,input().split()))\n if sum(arr)<0:\n print(\"NO\")\n else:\n print(\"YES\")\n", "# cook your dish here\nt = int(input())\nfor x in range(t):\n n=int(input())\n l = [int(i) for i in input().split()]\n s = sum(l)\n if(s>=0):\n print(\"YES\")\n else:\n print(\"NO\")", "# cook your dish here\nt = int(input())\nfor x in range(t):\n n=int(input())\n l = [int(i) for i in input().split()]\n for i in l:\n if(i<0):\n print(\"NO\")\n break\n else:\n print(\"YES\")", "# cook your dish here\nt = int (input())\nwhile t > 0:\n n = int(input())\n l = list(map(int,input().strip().split()))[:n]\n s = sum(l)\n if s >= 0:\n print(\"YES\")\n else :\n print(\"NO\")\n t = t - 1\n", "# cook your dish here\nt=int(input())\nwhile t>0:\n n=int(input())\n l=list(map(int,input().split()))\n s=sum(l)\n if s>=0:\n print(\"YES\")\n else:\n print(\"NO\")\n t=t-1"]

{"inputs": [["2", "1", "-1", "2", "1 2"]], "outputs": [["NO", "YES"]]}

INTERVIEW

PYTHON3

CODECHEF

5,076

585653a9fbeb1b2e061848a5dd1313ea

UNKNOWN

Given a binary string $S$ consisting of only 1’s and 0’s where 1 represents a Square and 0 represents a Circle. The diameter of the circle and the side of the square must be any integer (obviously > 0) . You will have to perfectly inscribe (as shown in the example below) the respective geometric figure at $S$$i+1$ inside of $S$$i$ where $i$ $\epsilon$ $[0,N-2]$, if it is possible. Note that, it will not be possible to inscribe if the dimension of the geometric figure you are perfectly inscribing is not an integer and you will discard the rest of the string. Find the maximum number of circles we can inscribe in a square according to the given string. For a given binary string there can be only one geometric figure and this figure is concentric. For example : the string 1100 can be represented as the figure below, the first two squares have the same side length and the next two circles have the same diameter. Another example : the string 0001 can be represented as the one given below Again here, we have 3 circles of the same diameter and one square inscribed in them. -----Input:----- The first line contains $N$, the number of strings Then each of the next $N$ lines contains a binary string $S$. -----Output:----- The $N$ lines of output should have $N$ integers in separate lines, the maximum number of circles we can inscribe in a square according to the given string $S$ . -----Constraints----- - 1 $\leq$ $N$ $\leq$ 103 - 1 $\leq$ length of string $S$ $\leq$ 104 -----Sample Input:----- 3 1110 0010 1001000 -----Sample Output:----- 1 0 2 -----Explanation:----- In the first case, we can inscribe the string 1110 as : three squares of side length 4 units (on top of each other) and then we can inscribe one circle of diameter 4 units. The answer is 1 since, there is 1 circle inscribed in a square. In the second case 0010, Let the first two circles be of some diameter 10, we can see that we cannot inscribe another square of any integer dimension inside them. So, the answer is 0. In the third case 1001000, we can take the first square of size 10, then inscribe two circles of diameter 5, then we cannot inscribe another square in this since, it will not be of any possible integer dimension and we discard the rest of the string.

["for z in range(int(input())):\n s = input()\n n = len(s)\n i = 0\n while i<n and s[i]=='1':\n i+=1\n if i==0:\n print(0)\n else:\n k = 0\n while i<n and s[i]=='0':\n i+=1\n k+=1\n print(k)\n", "# cook your dish h\nfor _ in range(int(input())):\n a = list(input())\n \n len_a = len(a)\n i = 0\n for i in range(i+1, len_a):\n if(a[i-1] == '0' and a[i] == '1'):\n a = a[:i]\n break\n if('1' in a):\n print(a.count('0'))\n else:\n print(0)\n", "# cook your dish here\nt=int(input())\nfor x in range(t):\n a = list(input())\n # print(a)\n # flag = 1\n N = len(a)\n i = 0\n for i in range(i+1, N):\n if(a[i-1] == '0' and a[i] == '1'):\n a = a[:i]\n break\n if('1' in a):\n print(a.count('0'))\n else:\n print(0)\n", "for _ in range(int(input())):\r\n s = list(map(int, list(input())))\r\n s.append('0')\r\n y = 0\r\n if s[0] == 0:\r\n y = 1\r\n while s[0] == 0:\r\n s.remove(0)\r\n while s[0] == 1:\r\n s.remove(1)\r\n z = 0\r\n while s[0] == 0:\r\n s.remove(0)\r\n z += 1\r\n if y == 1:\r\n print(0)\r\n else:\r\n print(z)\r\n", "\r\n\r\nN=int(input())\r\nlst=[]\r\nlt=[]\r\ncount=[]\r\nfor i in range(N):\r\n string=input()\r\n lst.append(string)\r\n \r\n\r\nfor num in lst:\r\n if num.startswith(\"1\"):\r\n x=num.find(\"0\")\r\n y=num.find('1',x)\r\n if y == -1:\r\n z=lt.append(len(num[x:]))\r\n else :\r\n z=lt.append(len(num[x:y]))\r\n if num.startswith(\"0\"):\r\n z=lt.append(0)\r\nfor i in lt:\r\n print(i)\r\n \r\n \r\n \r\n \r\n", "# cook your dish here\n\nt= int (input())\nfor i in range (t):\n count = 0\n x = list(input())\n f1= 0\n f2 = 0 \n for i in range (len(x) ):\n if x[i] == '1' and f1 == 0 and f2 ==0 :\n f1 = 1 \n elif x[i] == '1' and f1 == 1 and f2 ==0:\n continue\n elif x[i] == '0' and f1 == 0 and f2 ==0 :\n f2 = 1\n elif x[i] == '0' and f1 == 1 :\n count = count+1 \n f2 = 2 \n elif x[i] == '0' and f2 == 1 :\n continue\n elif x[i] == '0' and f2 == 2 :\n count = count+1 \n elif x[i] == '1' and f2 == 1 :\n break\n elif x[i] == '1' and f2 == 2 :\n break\n print(count)", "for i in range(int(input())):\r\n s=input()\r\n if s.count(s[0])==len(s):\r\n print(\"0\")\r\n continue\r\n if s[0]==\"0\":\r\n print(\"0\")\r\n continue\r\n tmp=s.index(\"0\")\r\n c=1\r\n for j in range(tmp+1,len(s)):\r\n if s[j]==\"0\":\r\n c+=1\r\n else:\r\n break\r\n print(c)", "def solve(S):\r\n if(S[0] == '0'):\r\n return 0\r\n count = 0\r\n flag = False\r\n for char in S:\r\n if char == '0':\r\n count += 1\r\n flag = True\r\n elif char == '1' and not flag:\r\n continue\r\n elif char == '1' and flag:\r\n break\r\n return count\r\n \r\ndef main():\r\n N = int(input())\r\n for case in range(N):\r\n S = input()\r\n print(solve(S))\r\n return \r\n\r\ndef __starting_point():\r\n main()\n__starting_point()", "# cook your dish here\ntry:\n t=int(input())\n while(t):\n n=input()\n x=0\n f=0\n if(n[0]=='1'):\n for i in range(1,len(n)):\n if(n[i]=='1' and f==0):\n continue\n elif(n[i]=='0'):\n x+=1\n f=1\n continue\n elif(n[i]=='1' and f==1):\n break\n print(x)\n \n t-=1\nexcept:\n pass", "for _ in range(int(input())):\n s = input().strip()\n if s[0] == '0' or '1' not in s:\n print(0)\n else:\n ans = 0\n s = s.lstrip('1')\n for i in range(len(s)):\n if s[i] == '1':\n break\n ans += 1\n print(ans)\n", "t = int(input())\r\nwhile(t!=0):\r\n t-=1\r\n string = input()\r\n s = []\r\n for i in range(len(string)):\r\n s.append(int(string[i]))\r\n \r\n sqinc = 0\r\n for i in range(1,len(s)):\r\n if s[i-1]!=s[i] and s[i-1] == 1:\r\n sqinc+=1\r\n if s[i-1]!=s[i] and s[i-1]==0:\r\n break\r\n if s[i-1]==s[i] and s[i-1]==0 and sqinc>0:\r\n sqinc+=1\r\n print(sqinc)\r\n\r\n", "for t in range(int(input())):\n pts=list(input())\n ans=0\n if pts[0]=='0':\n ans=0\n else:\n for i in range(1,len(pts),1):\n if pts[i]=='0':\n ans=ans+1\n if pts[i-1]=='0':\n if pts[i]=='1':\n break\n print(ans)\n", "# cook your dish here\nfor _ in range(int(input())):\n a = input()\n count = 0\n if a[0]=='0':\n print(count)\n else:\n s = 0\n for i in a:\n if i=='0':\n count +=1\n s+=1\n else:\n if s>0:\n break\n print(count)", "t = 0\ntry:\n t = int(input())\nexcept:\n pass\nfor _ in range(t):\n s = input()\n x = 0\n if s[0] == '0':\n print(x)\n else:\n last = 0\n for i in range(0,len(s)):\n if s[i] == '0':\n x += 1\n if i<len(s)-1:\n if s[i+1] == '1':\n break\n else:\n last = 1\n print(x)", "for _ in range(int(input())):\n S = input().strip()\n count = 0\n Sflag = False\n Cflag = False\n \n \n for x in S:\n if x == '1':\n Sflag = True\n else:\n Cflag = True\n \n if Cflag and x == '1':\n break\n \n if Sflag and x == '0':\n count += 1\n \n print(count)", "# cook your dish here\nfor N in range(int(input())):\n count,nxt,prev=0,0,0\n S=input()\n S=list(S)\n # print(S)\n if (S[0]=='1'):\n for i in range(1,len(S)):\n if S[i]=='0' and nxt==0 and prev==0:\n for j in range(i,len(S)):\n if S[j]=='0':\n count=count+1\n # print(count)\n if j==len(S)-1:\n prev=prev+1\n elif S[j]=='1':\n nxt=nxt+1\n break\n else:\n continue\n # print(count)\n # if S[i]=='1' and S[i].count('0')<1:\n # # nxt=nxt+1\n # continue\n print(count)", "# cook your dish here\nn=int(input())\nfor _ in range(n):\n s=input()\n if s[0]=='0':\n print(0)\n else:\n c=0\n flag=0\n for i in range(1,len(s)):\n if(s[i]=='0'):\n c+=1\n flag=1\n if(s[i]=='1' and flag==1):\n break\n print(c)", "# cook your dish here\nfor _ in range(int(input())):\n s=input()\n lis=[]\n count=0\n for i in s:\n lis.append(int(i))\n \n if lis[0]==0:\n print(0)\n continue\n i=0\n while i<len(lis) and lis[i]==1:\n i+=1\n continue\n #print(i)\n while i<len(lis) and lis[i]==0:\n count+=1\n i+=1\n print(count)\n\n\n", "# cook your dish here\ntest=int(input())\nfor tt in range(0,test):\n s=input()\n n=len(s)\n p=0\n if(s[0]==\"0\"): \n print(0)\n else:\n i=0\n while(i<n and s[i]==\"1\"):\n i=i+1\n while(i<n and s[i]==\"0\"):\n p=p+1\n i=i+1\n print(p)", "test_cases = int(input())\r\n\r\nfor _ in range(test_cases):\r\n s = input()\r\n ans = 0\r\n s += '0'\r\n index = s.index('0')\r\n if index == 0 or index == len(s)-1:\r\n print(ans)\r\n else:\r\n for i in range(index, len(s)-1):\r\n if s[i] == '0':\r\n ans += 1\r\n else:\r\n break\r\n print(ans)", "import re\nfor _ in range(int(input())):\n m = re.match(\"1+(0*)\", input())\n if m:\n print(len(m[1]))\n else:\n print(0)\n", "T=int(input())\nfor _ in range(T):\n s=input()\n if s[0]=='0':\n print('0')\n continue\n c=0\n z=0\n for i in range(len(s)):\n if s[i]=='1' :\n if z==0:\n continue\n else:\n break\n c+=1\n z=1\n print(c)", "# cook your dish here\nT=int(input())\nfor _ in range(T):\n S=input()\n t=-1\n if(S[0]=='0'):\n print(0)\n continue\n else:\n i=1\n count=0\n while(i<len(S)):\n if(i==len(S)-1 and S[i]=='0'):\n print(count+1)\n break\n if(t==-1 and i==len(S)-1):\n print(0)\n break\n if(t==0 and S[i]=='1'):\n print(count)\n break\n if(S[i]=='0'):\n t=0\n if(S[i]=='0' and t==0):\n count+=1\n i=i+1\n \n"]

{"inputs": [["3", "1110", "0010", "1001000"]], "outputs": [["1", "0", "2"]]}

INTERVIEW

PYTHON3

CODECHEF

9,714

6093fad81f2e546a0906dd9f99db8951

UNKNOWN

You are an evil sorcerer at a round table with $N$ sorcerers (including yourself). You can cast $M$ spells which have distinct powers $p_1, p_2, \ldots, p_M$. You may perform the following operation any number of times (possibly zero): - Assign a living sorcerer to each positive integer cyclically to your left starting from yourself ― the closest living sorcerer to your left is assigned to $1$, the next living sorcerer to the left is assigned to $2$ and so on. Note that each living sorcerer (including yourself) is assigned to an infinite number of integers. - Choose a spell $j$ (possibly a spell you have chosen before) and kill the living sorcerer assigned to $p_j$. You may not cast a spell to kill yourself. What is the maximum number of sorcerers you can kill using zero or more operations? -----Input----- - The first line of the input contains a single integer $T$ denoting the number of test cases. The description of $T$ test cases follows. - The first line of each test case contains two space-separated integers $N$ and $M$. - The second line contains $M$ space-separated integers $p_1, p_2, \ldots, p_M$. -----Output----- For each test case, print a single line containing one integer ― the maximum number of sorcerers you can kill. -----Constraints----- - $1 \le T \le 1,000$ - $1 \le N \le 10^9$ - $1 \le M \le 3 \cdot 10^5$ - $1 \le p_i \le 10^9$ for each valid $i$ - $p_1, p_2, \ldots, p_N$ are pairwise distinct - the sum of $M$ over all test cases does not exceed $3 \cdot 10^5$ -----Example Input----- 5 4 1 5 6 2 2 4 1 4 7 16 8 29 1000000000 1 998244353 1 1 20201220 -----Example Output----- 3 4 0 1755647 0 -----Explanation----- Example case 1: The initial state is shown in the figure from the statement. We can first use spell $1$ and kill the $5$-th sorcerer to our left, i.e. sorcerer $2$. Now there are $3$ living sorcerers and the state is as shown in the following figure: We can use spell $1$ again and kill the current $5$-th living sorcerer to our left, i.e. sorcerer $4$. Now there are $2$ living sorcerers and the state is: Finally, we can use spell $1$ again and kill the only other living sorcerer, i.e. sorcerer $3$. Now, none of the other sorcerers are alive. As we cannot cast a spell to kill ourselves, we cannot improve the answer any further. Example case 2: We can perform $4$ operations using the spell $p_1 = 2$ each time. We can also instead use $p_2 = 4$ in the first two operations and $p_1 = 2$ in the last two operations. Note that there may be multiple valid sequences of operations that lead to the best answer. Example case 3: We cannot perform any operations using any of the given spells, so we are unable to kill any sorcerers. Example case 4: We can perform $1,755,647$ operations, each of them using the spell $p_1 = 998,244,353$.

["import functools\n\ndef gcd(x,y):\n if(y == 0):\n return x\n return gcd(y, x%y)\n\nfor _ in range(int(input())):\n n, m= map(int, input().split())\n p = list(map(int, input().split()))\n \n ans = functools.reduce(lambda x,y: gcd(x, y), p)\n \n if(ans <= n):\n print(n-ans)\n else:\n f = [1]\n for k in range(ans//2, 1, -1):\n if ans %k == 0:\n if k<=n:\n f.append(k)\n \n if ans//k <= n:\n f.append(ans//k)\n res = n-max(f)\n print(res)", "import functools\n\ndef gcd(x,y):\n if(y == 0):\n return x\n return gcd(y, x%y)\n\nfor _ in range(int(input())):\n n, m= map(int, input().split())\n p = list(map(int, input().split()))\n \n ans = functools.reduce(lambda x,y: gcd(x, y), p)\n \n if(ans <= n):\n print(n-ans)\n else:\n f = [1]\n for k in range(ans//2, 1, -1):\n if ans %k == 0:\n if k<=n:\n f.append(k)\n break\n if ans//k <= n:\n f.append(ans//k)\n res = n-max(f)\n print(res)", "from math import gcd,sqrt,ceil\n\ndef fac(x,n):\n mx = 1\n for i in range(1,ceil(sqrt(x))+1):\n if x % i == 0:\n if i <= n:\n mx = max(mx,i)\n if x//i <= n:\n mx = max(mx,x//i)\n return mx\n\n \n\nfor _ in range(int(input())):\n n,m = map(int,input().split())\n rev = n\n lis = list(map(int,input().split()))\n \n g = lis[0]\n for i in lis:\n g = gcd(g,i)\n\n if n > g:\n k = n - g\n else:\n val = fac(g,n)\n k = n - val\n print(k)", "# cook your dish here\ndef _gcd(a,b):\n while(b!=0):\n a,b=b,a%b\n return a\n \ndef __gcd(mp):\n if(len(mp)==1):\n return mp[0]\n gcd=_gcd(mp[0],mp[1])\n for i in range(2,len(mp)):\n gcd=_gcd(gcd,mp[i])\n return gcd\n \ndef factors(hcf):\n if(hcf==0):\n return [1]\n factor_list=[]\n for i in range(1,int(hcf**(0.5))+1):\n if(hcf%i==0):\n factor_list.append(i)\n factor_list.append(hcf//i)\n return factor_list\n \nt=int(input())\nfor _ in range(t):\n n,m=map(int,input().split())\n mp=list(map(int,input().split()))\n hcf=0\n if(m==1):\n hcf=mp[0]\n elif(m>1):\n hcf=__gcd(mp)\n ans=0\n factor_list=factors(hcf)\n factor_list.sort(reverse=True)\n for i in factor_list:\n if i<=n:\n ans=n-i\n break\n print(ans)", "# cook your dish here\nimport math\n\ndef gcd(a, b):\n if a % b == 0:\n return b\n return gcd(b, a % b)\n \ndef maxfact(g, n):\n i = 1\n maxf = None\n while i * i <= g:\n if g % i == 0:\n if(i <= n):\n maxf = i\n if math.floor(g / i) <= n:\n maxf = math.floor(g / i)\n break\n i = i+1\n return maxf\n \n\nt = int(input())\nwhile t>0:\n t = t-1\n [n, m] = [int(x) for x in input().split(' ')]\n spells = [int(x) for x in input().split(' ')]\n g = spells[0]\n for i in range(1, m):\n g = gcd(g, spells[i])\n print(n - maxfact(g, n))\n", "try:\n \n def gcd_fd(i, j):\n while(j):\n i, j = j, i % j\n \n return i\n \n \n def gcd_l(t):\n num = t[0]\n k = t[1]\n gcd = gcd_fd(num, k)\n \n for i in range(2, len(t)):\n gcd = gcd_fd(gcd, t[i])\n \n return(gcd)\n \n \n def fact(num1):\n if num1 == 0:\n return 1\n a = []\n for j in range(1, int(num1**(1 / 2)) + 1):\n if num1 % j == 0:\n a.append(j)\n a.append(num1 // j)\n return(a)\n \n \n for _ in range(int(input())):\n n, m = map(int, (input().split()))\n a = list(map(int, input().split()))\n p = 0\n ans = 0\n if m > 1:\n p = gcd_l(a)\n else:\n p = a[0]\n fac = fact(p)\n fac.sort(reverse=True)\n for i in fac:\n if i <= n:\n ans = n - i\n break\n print(ans)\nexcept:\n pass", "# cook your dish here\ndef find_gcd(x, y): \n while(y): \n x, y = y, x % y \n return x \n\ndef maxfact(x,n):\n lar_fac = 0\n for i in range(1, x + 1):\n if x % i == 0:\n if(i <= n):\n lar_fac = max(lar_fac, i)\n elif(x / i <= n):\n lar_fac = max(lar_fac, x / i)\n return(lar_fac)\n \nfor _ in range(int(input())):\n n, m = list(map(int, input().split()))\n p = list(map(int, input().split()))\n gcd = 0\n for i in range(m):\n gcd = find_gcd(gcd, p[i])\n \n if(gcd > n):\n temp = maxfact(gcd, n)\n gcd = temp\n \n ans = n - gcd\n print(ans)\n", "def gcd(a, b):\n if(a == 0):\n return b\n else:\n return gcd(b % a, a)\n\n\ndef fgcd(a):\n r = a[0]\n for i in range(1, len(a)):\n r = gcd(a[i], r)\n if(r == 1):\n return 1\n return r\n\n\nt = int(input())\nwhile t:\n t -= 1\n n, m = list(map(int, input().split()))\n a = list(map(int, input().split()))\n a.sort()\n # mn = min(a)\n mn = fgcd(a)\n # print(mn)\n c = 0\n if(n >= mn):\n c = n - mn\n print(c)\n continue\n while(n > 1):\n if(mn % n != 0):\n c += 1\n n -= 1\n else:\n break\n print(c)\n", "from math import gcd\ndef largest_factor(val,n):\n k = min(n,val)\n while k > 0:\n if val % k == 0:\n return k\n k -= 1\nfor _ in range(int(input())):\n n,m = list(map(int,input().split()))\n li = list(map(int,input().split()))\n if n == 1:\n print(0)\n else:\n val = li[0]\n for i in range(1,m):\n val = gcd(val,li[i])\n print(n - largest_factor(val,n))\n\n", "# cook your dish here\nimport math \n\ndef gcd(a,b):\n if b == 0:\n return a\n return gcd(b,a%b)\n \nfor _ in range(int(input())):\n n,m=list(map(int,input().split(\" \")))\n p=list(map(int,input().split(\" \")))\n g=p[0]\n for i in range(1,m):\n g = gcd(g,p[i])\n \n if g>n:\n maxEl=1\n for i in range(2,int(math.sqrt(g)+1)):\n if g%i == 0:\n if i<=n:\n maxEl = max(maxEl,i)\n if g//i<=n:\n maxEl = max(maxEl,g//i)\n print(n - maxEl) \n else:\n print(n - g)\n \n", "# cook your dish here\nimport math \n\ndef gcd(a,b):\n if b == 0:\n return a\n return gcd(b,a%b)\n \nfor _ in range(int(input())):\n n,m=list(map(int,input().split(\" \")))\n p=list(map(int,input().split(\" \")))\n g=p[0]\n for i in range(1,m):\n g = gcd(g,p[i])\n \n if g>n:\n maxEl=1\n for i in range(2,int(math.sqrt(g)+1)):\n if g%i == 0:\n if i<=n:\n maxEl = max(maxEl,i)\n if g//i<=n:\n maxEl = max(maxEl,g//i)\n print(n - maxEl) \n else:\n print(n - g)\n \n", "# cook your dish here\nimport math \n\ndef gcd(a,b):\n if b == 0:\n return a\n return gcd(b,a%b)\n \nfor _ in range(int(input())):\n n,m=list(map(int,input().split(\" \")))\n p=list(map(int,input().split(\" \")))\n g=p[0]\n for i in range(1,m):\n g = gcd(g,p[i])\n \n if g>n:\n maxEl=1\n for i in range(n,0,-1):\n if g%i == 0:\n maxEl = i\n break\n print(n - maxEl) \n else:\n print(n - g)\n \n", "from math import gcd,sqrt\nfor _ in range(int(input())):\n n,m = map(int,input().split())\n l = list(map(int,input().split()))\n g = 0\n for i in l:\n g = gcd(g,i)\n if(g<n):\n print(n - g)\n continue\n f = 0\n s = int(sqrt(g))\n for i in range(1,s+1):\n if(g%i == 0):\n if(i <= n):\n f = max(f,i)\n if(g//i <= n):\n f = max(f,g//i)\n print(n - f)", "import math as x\ndef lfact(n,k):\n fact=[]\n max=0\n for j in range(1,int(k**0.5)+1):\n if k%j==0:\n \n if j<=n and j>max:\n max=j\n if k//j<=n and k//j>max:\n max=k//j\n return max\n \nt=int(input())\nfor j in range(t):\n n,m=list(map(int,input().split()))\n arr=list(map(int,input().split()))\n if n==1:\n print(0)\n else:\n g=0\n for i in range(m):\n g=x.gcd(arr[i],g)\n \n if g>n:\n g=lfact(n,g)\n print(n-g)\n elif g==n:\n print(0)\n else:\n print(n-g)\n \n", "# cook your dish here\ndef gcdf(x,y):\n while(y): \n x, y = y, x % y \n return x\n\nt = int(input())\nfor cases in range(t):\n (n, m) = list(map(int, input().split()))\n spells = list(map(int, input().split()))\n kills = 0\n gcd = spells[0]\n for i in range (1, m):\n gcd = gcdf(gcd, spells[i])\n if (n > gcd):\n kills += n - gcd\n n = gcd\n if (n < gcd):\n for i in range(n,0,-1):\n if (gcd % i == 0):\n break\n kills += 1\n print(kills)\n \n \n \n \n \n", "# cook your dish here# cook your dish here\nimport math\n\ndef gcdiv(l):\n l.sort()\n ans = math.gcd(l[0],l[1])\n i = 2\n \n while (ans!=1 and i<len(l)):\n ans = math.gcd(ans,l[i])\n i = i + 1\n \n return(ans)\n \ndef lf(gc,n):\n if (gc < n):\n return(gc)\n out = n\n while out>1:\n if (gc%out == 0):\n return(out)\n out -= 1\n \n return(out)\n \n \nt = int(input())\n\nwhile t>0:\n t -= 1\n n, m = list(map(int,input().split()))\n l1 = list([int(i) for i in input().split()])\n \n if len(l1) > 1:\n gc = gcdiv(l1)\n else:\n gc = l1[0]\n \n print(n-lf(gc,n))\n \n \n \n \n \n \n \n \n \n", "# cook your dish here\ndef gcd(a1,b1):\n if b1==0:\n return a1\n else:\n return gcd(b1,a1%b1)\na = int(input())\nfor i in range(a):\n b = list(map(int,str(input()).split(' ')))\n c = list(map(int,str(input()).split(' ')))\n k = c[0]\n Ans = 0\n if b[0]==1:\n print(0)\n else:\n if b[1]==1:\n if b[0]>c[0]:\n print(abs(b[0]-c[0]))\n elif b[0]==c[0]:\n print(0)\n else:\n for i2 in range(b[0]-1):\n if (c[0]%b[0])!=0:\n Ans+=1\n b[0]-=1\n else:\n break\n print(Ans)\n \n else:\n for i1 in range(b[1]):\n k = gcd(c[i1],k)\n if b[0]>k:\n print(abs(b[0]-k))\n elif b[0]==k:\n print(0)\n else:\n for i3 in range(b[0]-1):\n if (k%b[0])!=0:\n Ans+=1\n b[0]-=1\n else:\n break\n print(Ans)", "# cook your dish here\ntry:\n def find_gcd(x, y): \n while(y): \n x, y = y, x % y \n \n return x\n def gcd_arr(l):\n num1=l[0] \n num2=l[1] \n gcd=find_gcd(num1,num2) \n \n for i in range(2,len(l)): \n gcd=find_gcd(gcd,l[i])\n return(gcd)\n def factors(n):\n #print(n)\n if n==0:\n return 1\n x=[]\n for i in range(1,int(n**(1/2))+1):\n if n%i==0:\n x.append(i)\n x.append(n//i)\n return(x)\n for t in range(int(input())):\n n,m=map(int,input().split())\n p=list(map(int,input().split()))\n hcf=0\n if m>1:\n hcf=gcd_arr(p)\n else:\n hcf=p[0]\n fact=factors(hcf)\n fact.sort(reverse=True)\n final=0\n for i in fact:\n if i<=n:\n final=n-i\n break\n print(final)\nexcept:\n pass", "# cook your dish here\ndef find_gcd(x, y): \n while(y): \n x, y = y, x % y \n \n return x\ndef gcd_arr(l):\n num1=l[0] \n num2=l[1] \n gcd=find_gcd(num1,num2) \n \n for i in range(2,len(l)): \n gcd=find_gcd(gcd,l[i])\n return(gcd)\ndef factors(n):\n #print(n)\n if n==0:\n return 1\n x=[]\n for i in range(1,int(n**(1/2))+1):\n if n%i==0:\n x.append(i)\n x.append(n//i)\n return(x)\nfor t in range(int(input())):\n n,m=map(int,input().split())\n p=list(map(int,input().split()))\n hcf=0\n if m>1:\n hcf=gcd_arr(p)\n else:\n hcf=p[0]\n fact=factors(hcf)\n fact.sort(reverse=True)\n final=0\n for i in fact:\n if i<=n:\n final=n-i\n break\n print(final)"]

{"inputs": [["5", "4 1", "5", "6 2", "2 4", "1 4", "7 16 8 29", "1000000000 1", "998244353", "1 1", "20201220"]], "outputs": [["3", "4", "0", "1755647", "0"]]}

INTERVIEW

PYTHON3

CODECHEF

10,367

06f3361a9dbf31ef051dff02d723e0f4

UNKNOWN

Teacher Sungjae wanted to hold a programming competition for his students where every participant need to be included into team. The participants submitted their team names before the deadline. After the competition ran for half an hour, (It is assured that each registered team will submit absolutely once within half an hour) Sungjae mistakenly pressed a button that changed the order of the registered team names. Now in the submission list, order of the characters in the team's name doesn't matter. That means $abc$, $acb$, $bac$, $bca$, $cab$, $cba$ refers to the same team. The competition ran for two hours and then ended. Sungjae now counting each of the team's score and wants to print the registered team names and score. The scoreboard should be ordered based on scores in decreasing order and if two teams have same score, Sangjae would follow lexicographical order. $N$.$B$. frequency of each character's in a registered team's name will not match with another team. That means two teams named $xoxo$ and $oxox$ is not possible. Because both of them have the same frequency of each of the characters (two 'o' and two 'x'). Similarly $abb$ and $bab$ is not possible (because both of them have one 'a' and two 'b'). It is ensured that only possible test cases will be given. -----Input:-----Input: - First line will contain $T$, number of testcases. Then the testcases follow. - The first line of each test case contains two integers , $N$ and $R$ - total number of submissions and the number of submissions within first half an hour. - Then $R$ lines follow: the i'th line contains a string $ti$, registered names of the teams and an integer $pi$, points they got on that submission. - Then $N-R$ lines follow: the i-th line contains a string $ti$- the i-th team's name (in any order) in lowercase letter only and $pi$ -points they got on that submission. -----Output:-----Output: For each testcase,print the scoreboard. That means print the teams name and their point according to their score in decreasing order and if some of them have same score,print the teams name in lexicographical order -----Constraints-----Constraints - $1 \leq T \leq 10$ - $1 \leq R \leq N \leq 1000$ - $1 \leq ti \leq 1000$ - $1 \leq pi \leq 10^6$ Sum of points ($pi$) of a team will not cross $10^9$. -----Sample Input:-----Sample Input: 1 10 5 amigoes 1 bannermen 1 monarchy 4 outliers 5 iniciador 10 aegimos 2 iiiacdnor 1 eilorstu 1 gimosae 3 mnachroy 7 -----Sample Output:-----Sample Output: iniciador 11 monarchy 11 amigoes 6 outliers 6 bannermen 1 -----Explanation:-----Explanation: $It$ $is$ $assured$ $that$ $each$ $team$ $will$ $submit$ $once$ $within$ $first$ $half$ $an$ $hour$.That means - that kind of submissions isn't possible within first half an hour. Dataset can be huge. Use faster I/O method.

["# cook your dish here\nfor t in range(int(input())):\n n,k=map(int,input().split())\n a=[]\n sr=[]\n for i in range(k):\n x,y=input().split()\n y=int(y)\n a.append([10**10-y,x])\n sr.append(sorted(x))\n for i in range(n-k):\n x,y=input().split()\n y=int(y)\n x=sorted(x)\n for j in range(k):\n if x==sr[j]:\n a[j][0]-=y\n break\n a.sort()\n for i in a:\n print(i[1],abs(i[0]-10**10))", "for _ in range(int(input())):\n n,r=map(int,input().split())\n s=[]\n d=dict()\n for i in range(r):\n a,b=map(str,input().split())\n s.append([int(b),a])\n a=list(a)\n a.sort()\n d[''.join(a)]=i\n for i in range(n-r):\n a,b=map(str,input().split())\n a=list(a)\n a.sort()\n s[d[''.join(a)]][0]+=int(b)\n s.sort(key=lambda x:x[1], reverse=True)\n s.sort(key=lambda x:x[0])\n for i in range(-1,-r-1,-1):\n print(s[i][1],s[i][0])", "for _ in range(int(input())):\n n,r=map(int,input().split())\n s=[]\n d=dict()\n for i in range(r):\n a,b=map(str,input().split())\n s.append([int(b),a])\n a=list(a)\n a.sort()\n d[''.join(a)]=i\n for i in range(n-r):\n a,b=map(str,input().split())\n a=list(a)\n a.sort()\n s[d[''.join(a)]][0]+=int(b)\n s.sort(key=lambda x:x[1], reverse=True)\n s.sort(key=lambda x:x[0])\n for i in range(-1,-r-1,-1):\n print(s[i][1],s[i][0])", "# cook your dish here\nfor _ in range(int(input())):\n n, r = map(int, input().split())\n reg_teams = [input().split() for _ in range(r)]\n after = [input().split() for _ in range(n - r)]\n check1 = [[''.join(sorted(list(s))), int(p), s] for s, p in reg_teams]\n check2 = {}\n for a in after:\n cur = \"\".join(sorted(list(a[0])))\n if cur in check2.keys():\n check2[cur] += int(a[1])\n else:\n check2[cur] = int(a[1])\n for c in check1:\n if c[0] in check2.keys():\n c[1] += check2[c[0]]\n\n check1.sort(key = lambda z: z[2])\n check1.sort(key = lambda z: z[1], reverse = True)\n for c in check1:\n print(c[2], c[1])"]

{"inputs": [["1", "10 5", "amigoes 1", "bannermen 1", "monarchy 4", "outliers 5", "iniciador 10", "aegimos 2", "iiiacdnor 1", "eilorstu 1", "gimosae 3", "mnachroy 7"]], "outputs": [["iniciador 11", "monarchy 11", "amigoes 6", "outliers 6", "bannermen 1"]]}

INTERVIEW

PYTHON3

CODECHEF

2,279

9f4763a03b342044e3b743dc7708e7b9

UNKNOWN

On a planet called RUIZ LAND, which is ruled by the queen, Erika Ruiz. Each person on that planet has a strength value (strength value >0). That planet has a special rule made by the queen that a boy and a girl will form a couple if their Hate value is a prime number where $Hate$ is given by the formula:- Hate = (boy's strength value) XOR (girl's strength value ) You are given $N$ numbers denoting the strength value of $N$ girls, and each of the $N$ girls has to form a couple with a boy such that sum of $Hate$ value of all the $N$ couples will be minimum. You need to print the strength value of each boy, Where the boy at index $i$ will form a couple with the girl at index $i$, where $1 \leq i \leq N$. Assume that you can always find at least one boy having that strength for each girl. -----Input:----- - First line will contain $N$, the number of Girls. - Next line contains $N$ numbers separated by space denoting strength value for each girl. -----Output:----- Print the required $N$ numbers denoting strength of boys. -----Constraints----- - $1 \leq N \leq 100000$ - $1 \leq A_i \leq 10^9$ , (where $1 \leq i \leq N$) and $A_i$ denotes strength of i'th girl. -----Sample Input:----- 2 10 16 -----Sample Output:----- 8 18

["n=int(input())\r\na=list(map(int,input().split()))\r\nc=[]\r\nfor i in range(len(a)):\r\n if a[i]==2:\r\n c.append(1)\r\n else:\r\n c.append(a[i]^2)\r\nprint(*c)", "import copy\r\nn=int(input())\r\na=list(map(int,input().split()))\r\nc=[]\r\nfor i in range(len(a)):\r\n if a[i]==2:\r\n c.append(1)\r\n else:\r\n str=bin(a[i])[2:]\r\n if len(str)!=32:\r\n rem=32-len(str)\r\n str='0'*rem+str\r\n str1=copy.deepcopy(str)\r\n str1=list(x for x in str1)\r\n\r\n if str[31]=='0':\r\n str1[31]='0'\r\n if str[31]=='1':\r\n str1[31]='1'\r\n if str[30]=='0':\r\n str1[30]='1'\r\n if str[30]=='1':\r\n str1[30]='0'\r\n ##print(str1)\r\n str1=''.join(str1)\r\n x=int(str1,2)\r\n c.append(x)\r\nprint(*c)", "# cook your dish here\r\nn=int(input())\r\nl=list(map(int,input().split()))\r\nfor i in l:\r\n if i==1:\r\n print(3,end=' ')\r\n continue\r\n if i==2:\r\n print(1,end=' ')\r\n continue\r\n s=list(bin(i)[2:])\r\n if s[-2]=='1':\r\n s[-2]='0'\r\n else:\r\n s[-2]='1'\r\n x=int(''.join(s),2)\r\n print(x,end=' ')\r\nprint()\r\n", "n=int(input())\r\na=list(map(int,input().rstrip().split()))\r\nans=[]\r\nfor i in a:\r\n if i==2:\r\n ans.append(1)\r\n else:\r\n ans.append(i^2)\r\nprint(*ans)", "\r\nlens = int(input())\r\narrs = [int(x) for x in input().split()]\r\nvals = []\r\nfor a in arrs:\r\n if a != 2:\r\n vals.append(2 ^ a)\r\n else:\r\n vals.append(3 ^ a)\r\nprint(*vals)", "n=int(input())\r\nl=list(map(int,input().split()))\r\nans=[]\r\nfor i in l:\r\n if i==2:\r\n ans.append(1)\r\n else:\r\n ans.append(i^2)\r\nprint(*ans)", "n=int(input())\r\nl=list(map(int,input().split()))\r\nans=[]\r\nfor i in l:\r\n if i==2:\r\n ans.append(1)\r\n else:\r\n ans.append(i^2)\r\nprint(*ans)", "from sys import stdin, stdout\nfrom math import floor, gcd, fabs, factorial, fmod, sqrt, inf, log\nfrom collections import defaultdict as dd, deque\nfrom heapq import merge, heapify, heappop, heappush, nsmallest\nfrom bisect import bisect_left as bl, bisect_right as br, bisect\nmod = pow(10, 9) + 7\nmod2 = 998244353\ndef inp(): return stdin.readline().strip()\ndef out(var, end=\"\\n\"): stdout.write(str(var)+\"\\n\")\ndef outa(*var, end=\"\\n\"): stdout.write(' '.join(map(str, var)) + end)\ndef lmp(): return list(mp())\ndef mp(): return map(int, inp().split())\ndef smp(): return map(str, inp().split())\ndef l1d(n, val=0): return [val for i in range(n)]\ndef l2d(n, m, val=0): return [l1d(n, val) for j in range(m)]\ndef remadd(x, y): return 1 if x%y else 0\ndef ceil(a,b): return (a+b-1)//b\n\ndef isprime(x):\n if x<=1: return False\n if x in (2, 3): return True\n if x%2 == 0: return False\n for i in range(3, int(sqrt(x))+1, 2):\n if x%i == 0: return False\n return True\n \nn = int(inp())\narr = lmp()\nfor i in range(n):\n if arr[i]==2:\n print(1, end=\" \")\n elif arr[i]^2<arr[i]:\n print(arr[i]-2, end=\" \")\n else:\n print(arr[i]+2, end=\" \")\nprint()\n ", "# cook your dish here\r\nn=int(input())\r\na=[int(i) for i in input().split()]\r\nfor i in a:\r\n if i==1:\r\n print(\"2\",'',end='')\r\n elif i==2:\r\n print(\"1\",'',end='')\r\n else:\r\n b=str(bin(i)).replace('0b','')\r\n p=''\r\n l=len(b)\r\n if b[l-1]=='0':\r\n p='0'\r\n else:\r\n p='1'\r\n if b[l-2]=='0':\r\n p='1'+p\r\n else:\r\n p='0'+p\r\n for j in range(l-3,-1,-1):\r\n p=b[j]+p\r\n print(int(p,2),'',end='')\r\nprint()", "# cook your dish here\r\n# cook your dish here\r\ndef solve():\r\n k = int(input())\r\n #n,m = input().split()\r\n #n = int(n)\r\n #m = int(m)\r\n #s = input()\r\n a = list(map(int, input().split()))\r\n #print(a)\r\n for i in range(k):\r\n n2=-1\r\n if a[i]==1 :n2 =3\r\n elif a[i]==2 :n2 =1\r\n else:\r\n b = bin(a[i]).replace(\"0b\",\"\")\r\n n = len(b)\r\n #print(b)\r\n if b[n-2]=='0': b=b[0:n-2]+'1'+b[n-1:]\r\n else: b=b[0:n-2]+'0'+b[n-1:]\r\n #print(b)\r\n n2 = int(b,2)\r\n #print(n2)\r\n if i==k-1:print(n2,end=\"\")\r\n else: print(n2,end=\" \")\r\n \r\n \r\n \r\n \r\ndef __starting_point():\r\n #T = int(input())\r\n #for i in range(T):\r\n #a = solve()\r\n #n = len(a)\r\n #for i in range(n):\r\n # if i==n-1 : print(a[i])\r\n # else: print(a[i],end=\" \")\r\n (solve())\n__starting_point()", "# cook your dish here\r\nn = int(input())\r\narr = list(map(int,input().split()))\r\nfor i in arr:\r\n\tif i == 2:\r\n\t\tprint(\"1\",end=\" \")\r\n\telse:\r\n\t\tprint(i^2,end=\" \")", "def func(lst):\r\n for i in lst:\r\n if i == 2:\r\n print(i^3, end=' ')\r\n else:\r\n print(i^2, end=' ')\r\n\r\n\r\nn = int(input())\r\nlst = list(map(int, input().split()))\r\nfunc(lst)\r\n\r\n", "n=int(input())\r\nb=list(map(int,input().split()))\r\nres=[]\r\nfor j in range(n):\r\n if b[j]!=2:\r\n res.append(b[j]^2)\r\n\r\n else:\r\n res.append(b[j]^3)\r\n\r\nprint(*res)", "# author : Tapan Goyal\r\n# MNIT Jaipur\r\n\r\nimport math\r\nimport bisect\r\nimport itertools\r\nimport sys\r\nI=lambda : sys.stdin.readline()\r\none=lambda : int(I())\r\nmore=lambda : map(int,I().split())\r\nlinput=lambda : list(more())\r\n\r\nmod=10**9 +7\r\ninf=10**18 + 1 \r\n\r\n'''fact=[1]*100001\r\nifact=[1]*100001\r\nfor i in range(1,100001):\r\n fact[i]=((fact[i-1])*i)%mod\r\n ifact[i]=((ifact[i-1])*pow(i,mod-2,mod))%mod\r\ndef ncr(n,r):\r\n return (((fact[n]*ifact[n-r])%mod)*ifact[r])%mod\r\ndef npr(n,r):\r\n return (((fact[n]*ifact[n-r])%mod))\r\n '''\r\n\r\n\r\ndef merge(a,b):\r\n i=0;j=0\r\n c=0\r\n ans=[]\r\n while i<len(a) and j<len(b):\r\n if a[i]<b[j]:\r\n ans.append(a[i])\r\n i+=1\r\n else:\r\n ans.append(b[j])\r\n c+=len(a)-i\r\n j+=1\r\n ans+=a[i:]\r\n ans+=b[j:]\r\n return ans,c\r\ndef mergesort(a):\r\n if len(a)==1:\r\n return a,0\r\n mid=len(a)//2 \r\n left,left_inversion=mergesort(a[:mid])\r\n right,right_inversion=mergesort(a[mid:])\r\n m,c=merge(left,right)\r\n c+=(left_inversion+right_inversion)\r\n return m,c\r\n \r\ndef is_prime(num):\r\n if num == 1: return False\r\n if num == 2: return True\r\n if num == 3: return True\r\n if num%2 == 0: return False\r\n if num%3 == 0: return False\r\n t = 5\r\n a = 2\r\n while t <= int(math.sqrt(num)):\r\n if num%t == 0: return False\r\n t += a\r\n a = 6 - a\r\n return True\r\n\r\n \r\ndef ceil(a,b):\r\n return (a+b-1)//b\r\n \r\n\r\n\r\n#/////////////////////////////////////////////////////////////////////////////////////////////////\r\ndef __starting_point():\r\n for _ in range(1):\r\n n=one()\r\n a=linput()\r\n for i in a:\r\n ans=i^2\r\n if ans>0:\r\n print(ans,end=\" \")\r\n else:\r\n print(i^3,end=\" \")\r\n \r\n \n__starting_point()", "# cook your dish here\nn=int(input())\na=list(map(int,input().split()))\nb=[]\nfor i in range (n):\n num=a[i]\n b.append(num)\n num//=2\n if num%2==1:\n b[i]-=2\n else:\n b[i]+=2\n if b[i]==0:\n b[i]=1\nprint(*b)", "# cook your dish here\nn=int(input())\narr=list(map(int,input().split()))\nfor x in arr:\n if x==2:\n print(end='1 ')\n else:\n y=x%4\n if y>1:\n print(x-2,end=' ')\n else:\n print(x+2,end=' ')\nprint()\n", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\nfor i in a:\r\n if i != 2:\r\n print(i^2, end=' ')\r\n else:\r\n print(1, end=' ')\r\n\r\nprint()\r\n", "# cook your dish here\nn = int(input())\narr = [int(s) for s in input().split(\" \")]\nans = []\nfor x in arr:\n if x == 2:\n ans.append(1)\n else:\n ans.append(x^2)\nprint(*ans)", "n = int(input())\n\ndef foo(n):\n if int(n)==2:\n return str(2^3)\n return str(int(n)^2)\n\ndata = list(map(foo, input().split()))\n\nprint(' '.join(data))\n", "import sys\r\ndef get_ints(): return map(int, sys.stdin.readline().strip().split())\r\ndef get_int(): return list(map(int, sys.stdin.readline().strip().split()))[0]\r\ndef get_list(): return list(map(int, sys.stdin.readline().strip().split()))\r\ndef get_string(): return sys.stdin.readline().strip()\r\n\r\nN = 0\r\na = []\r\n\r\ndef solve():\r\n nonlocal N\r\n N = get_int()\r\n a = get_list()\r\n for i in a:\r\n if i == 2:\r\n print(1, end=' ')\r\n else:\r\n print(i ^ 2, end=' ')\r\n print()\r\n\r\ntest_cases = 1 # get_int()\r\n\r\nfor _ in range(test_cases):\r\n solve()\r\n", "from sys import stdin, stdout\r\n# #from collections import Counter\r\n# n = int(stdin.readline())\r\n# #l = list(map(int, stdin.readline().split()))\r\n# #l = [int(stdin.readline()) for _ in range(n)]\r\n# #a, b = input().split()\r\n# for _ in range(n):\r\nn1 = int(stdin.readline())\r\nl = list(map(int, stdin.readline().split()))\r\nfor x in l:\r\n if x!=2:\r\n print(x^2,end=' ')\r\n else:\r\n print(1,end=' ')\r\nprint()", "n=int(input())\r\nl=list(map(int,input().split()))\r\nans=[]\r\nfor i in l:\r\n x=i^2\r\n if x==0:\r\n ans.append(i^3)\r\n else:\r\n ans.append(x)\r\nprint(*ans)\r\n"]

{"inputs": [["2", "10 16"]], "outputs": [["8 18"]]}

INTERVIEW

PYTHON3

CODECHEF

9,827

0d6aea4a28a26aba598a2238227743d4

UNKNOWN

Vasya has ordered a pizza delivery. The pizza can be considered a perfect circle. There were $n$ premade cuts in the pizza when it was delivered. Each cut is a straight segment connecting the center of the pizza with its boundary. Let $O$ be the center of the pizza, $P_i$ be the endpoint of the $i$-th cut lying on the boundary, and $R$ be the point of the boundary straight to the right of $O$. Then the counterclockwise-measured angle $\angle ROP_i$ is equal to $a_i$ degrees, where $a_i$ is an integer between $0$ and $359$. Note that angles between $0$ and $180$ angles correspond to $P_i$ in the top half of the pizza, while angles between $180$ and $360$ angles correspond to the bottom half. Vasya may cut his pizza a few more times, and the new cuts still have to be straight segments starting at the center. He wants to make the pizza separated into several equal slices, with each slice being a circular sector with no cuts inside of it. How many new cuts Vasya will have to make? -----Input:----- The first line of input contains $T$ , i.e number of test cases per file. The first line of each test case contains a single integer $n-$ the numbers of premade cuts ($2 \leq n \leq 360$). The second lines contains $n$ integers $a_1, \ldots, a_n-$ angles of the cuts $1, \ldots, n$ respectively ($0 \leq a_1 < \ldots, a_{n - 1} < 360$). -----Output:----- Print a single integer$-$ the smallest number of additional cuts Vasya has to make so that the pizza is divided into several equal slices. -----Constraints----- - $1 \leq T \leq 36$ - $2 \leq n \leq 360$ - $0 \leq a_1 < \ldots, a_{n - 1} < 360$ -----Sample Input:----- 3 4 0 90 180 270 2 90 210 2 0 1 -----Sample Output:----- 0 1 358 -----EXPLANATION:----- In the first sample the pizza is already cut into four equal slices. In the second sample the pizza will be cut into three equal slices after making one extra cut at $330$ degrees. In the third sample Vasya will have to cut his pizza into $360$ pieces of $1$ degree angle each.

["def gcd(a, b):\n if a == 0:\n return b\n return(gcd(b % a, a))\n\nt = int(input())\nfor T in range(t):\n n = int(input())\n l = [int(x) for x in input().split()]\n\n ang = []\n for i in range(1, n):\n ang.append(l[i] - l[i - 1])\n ang.append(360 - (l[-1] - l[0]))\n ang.sort()\n if ang == ang[::-1]:\n print(0)\n continue\n \n g = ang[0]\n for i in range(1, n):\n g = gcd(g, ang[i])\n\n \n total = 360 // g - len(ang)\n print(total)\n## print(g, ang, total)\n\n\n", "# cook your dish here\nfrom functools import reduce\nfrom math import gcd\n\nfor _ in range(int(input())):\n n = int(input())\n a = [int(i) for i in input().split()]\n arr = []\n val = 0\n for i in a:\n arr.append(i-val)\n val = i\n \n arr[0] = 360 - (val-arr[0])\n arr.append(360)\n q = reduce(gcd, arr)\n needed = 360/q\n print(int(needed - n))", "from functools import reduce\nfrom math import gcd\n\nfor _ in range(int(input())):\n n = int(input())\n a = [int(i) for i in input().split()]\n arr = []\n val = 0\n for i in a:\n arr.append(i-val)\n val = i\n \n arr[0] = 360 - (val-arr[0])\n arr.append(360)\n q = reduce(gcd, arr)\n needed = 360/q\n print(int(needed - n)) \n", "# cook your dish here\ndef isDivisible(a, k):\n for i in a:\n if (i%k!=0):\n return False\n return True\ndef find_gcd(x, y): \n \n while(y): \n x, y = y, x % y \n \n return x \n \ndef findHCF(l):\n gcd = find_gcd(l[0], l[1]) \n \n for i in range(2, len(l)): \n gcd = find_gcd(gcd, l[i]) \n return gcd\ndef calDegree(a):\n b = []\n p = a[0]\n i = 1\n while(i<len(a)):\n b.append((a[i]-p)%360)\n p = a[i]\n i+=1\n return b\ndef calRawCount(a, k):\n s = 0\n for i in a:\n s+=(i//k)\n return s\nt = int(input())\nfor _ in range(t):\n n = int(input())\n l = list(map(int, input().split(\" \")))\n l.append(l[0])\n a = calDegree(l)\n \n HCF = findHCF(a)\n \n raw_count = calRawCount(a, HCF)\n print(raw_count-len(l)+1)\n", "# cook your dish here\nfrom functools import reduce\nfrom math import gcd\nfor _ in range(int(input())):\n num=int(input())\n cuts=list(map(int,input().split(\" \")))\n initial_cuts=[0]*(num-1)\n for i in range(0,num-1):\n \n initial_cuts[i]=cuts[i+1]-cuts[i]\n initial_cuts.append(360) \n red=reduce(gcd,initial_cuts)\n total_initial=int(360/red)\n vasya_cuts=total_initial-num\n print(vasya_cuts)", "t=int(input())\n\ndef gcd(a,b):\n if a<b:\n a=a+b\n b=a-b\n a=a-b\n\n if a%b==0:\n return b\n else:\n c=a%b\n return gcd(b,c)\n\nfor _ in range(t):\n n=int(input())\n angle_list=list(map(int,input().split()))\n slice_list=[]\n for i in range(n):\n if i==n-1:\n theta=angle_list[0]+360-angle_list[i]\n else:\n theta=angle_list[i+1]-angle_list[i]\n slice_list.append(theta)\n for i in range(n-1):\n slice_list[1]=gcd(slice_list[0],slice_list[1])\n slice_list.pop(0)\n slices=360/slice_list[0]-n\n print(str(int(slices)))\n", "def find_gcd(x, y):\n while y:\n x, y = y, x % y\n\n return x\n\n\nT = int(input())\n\nfor i in range(T):\n N = int(input())\n lst = [int(x) for x in input().strip().split()]\n diff = []\n\n for j in range(1, len(lst)):\n diff.append(lst[j] - lst[j - 1])\n\n diff.append(360)\n\n gcd = find_gcd(diff[0], diff[1])\n for j in range(2, len(diff)):\n gcd = find_gcd(gcd, diff[j])\n\n print(360 // gcd - N)\n", "# cook your dish here\nfrom functools import reduce\nfrom math import gcd\nfor _ in range(int(input())):\n num=int(input())\n cuts=list(map(int,input().split(\" \")))\n initial_cuts=[0]*(num-1)\n for i in range(0,num-1):\n \n initial_cuts[i]=cuts[i+1]-cuts[i]\n initial_cuts.append(360) \n red=reduce(gcd,initial_cuts)\n total_initial=int(360/red)\n vasya_cuts=total_initial-num\n print(vasya_cuts)\n", "from functools import reduce\nfrom math import gcd\n\nfor _ in range(int(input())):\n n = int(input())\n a = [int(i) for i in input().split()]\n arr = []\n val = 0\n for i in a:\n arr.append(i-val)\n val = i\n \n arr[0] = 360 - (val-arr[0])\n arr.append(360)\n q = reduce(gcd, arr)\n needed = 360/q\n print(int(needed - n)) ", "#cut pizza codechef solution\n#first try to handle boundary conditions, if n(cuts) = 360, return 0\nfrom math import gcd\nfrom functools import reduce\n\ndef n_cuts(x):\n \"\"\"\n x: list of cuts \n\n \"\"\"\n l = len(x)\n if(l == 360):\n print(0)\n return\n\n #find minimum difference\n mini = min(x)\n flag = 0\n for i in range(len(x)):\n if(x[i]%mini != 0):\n flag = 1\n break\n if(flag == 0):\n if(360%mini == 0):\n print(360//mini - l)\n return\n\n\n #find gcd\n GCD = reduce(gcd, x)\n result = int(360/GCD)\n print(result-l)\n return\n\n\n\ndef __starting_point():\n t = int(input()) #number of test cases\n for i in range(t):\n n = int(input()) #not use\n x = list(map(int, input().split(' '))) #x is the cuts list\n diff = []\n for i in range(1,len(x)):\n diff.append(x[i]-x[i-1])\n diff.append(360-x[-1]+x[0])\n n_cuts(diff)\n\n\n\n\n\n\n\n\n\n\n\n\n\n__starting_point()", "# cook your dish here\nt = int(input())\n\nfor x in range(t):\n cu = int(input())\n angle = list(map(int, input().split()))\n \n diff = []\n mi = float('infinity')\n for i in range(cu - 1):\n diff.append(angle[i + 1] - angle[i])\n if diff[i] < mi:\n mi = diff[i]\n \n diff.append(angle[0] - angle[cu - 1] + 360)\n if diff[cu - 1] < mi:\n mi = diff[cu - 1]\n div = 1\n while div < 360:\n smallest = mi / div\n count = 0\n flag = True\n for i in diff:\n dm = divmod(i, smallest)\n if dm[1] != 0:\n flag = False\n break\n count += dm[0]\n if flag:\n print(int(count - cu))\n break\n div += 1", "from functools import reduce\nfrom math import gcd\n\nfor _ in range(int(input())):\n n = int(input())\n a = [int(i) for i in input().split()]\n arr = []\n val = 0\n for i in a:\n arr.append(i-val)\n val = i\n \n arr[0] = 360 - (val-arr[0])\n arr.append(360)\n q = reduce(gcd, arr)\n needed = 360/q\n print(int(needed - n))\n", "from functools import reduce\nfrom math import gcd\n\nfor _ in range(int(input())):\n n = int(input())\n a = [int(i) for i in input().split()]\n arr = [0]*360\n\n for i in a:\n arr[i] = 1\n #arr[(180+i)%360] = 1\n val = 0\n dif = []\n for i in range(0,360):\n if(arr[i] == 1):\n dif.append(i - val)\n #print(i, val)\n val = i\n #print(val, dif[0]) \n #print(arr) \n dif[0] = 360 - (val - dif[0])\n dif.append(360)\n #print(dif)\n q = reduce(gcd, (dif))\n needed = 360/q\n print(int(needed - n))\n", "def gcd(n1,n2):\n m=1\n di=2\n while di<=min(n1,n2) and (n1>1 and n2>1):\n if n1%di==0 and n2%di==0:\n n1//=di\n n2//=di\n m*=di\n else:\n di+=1\n return m\nfor _ in range(int(input())):\n n=int(input())\n a=list(map(int,input().split()))\n mi,d=a[1]-a[0],[a[1]-a[0]]\n for i in range(2,n):\n d+=[a[i]-a[i-1]]\n if (d[i-1]%mi)!=0:\n mi=gcd(mi,d[i-1])\n d+=[360-a[n-1]+a[0]]\n if (d[n-1]%mi)!=0:\n mi=gcd(mi,d[n-1])\n print(360//mi-n)\n \n \n", "def gcd(a, b):\n if b == 0:\n return a\n return gcd(b, a%b)\n\ndef gcd_of_list(lst):\n a = lst[0]\n for item in lst:\n a = gcd(item, a)\n if a == 1:\n return 1\n return a\n\ndef __starting_point():\n cases = int(input())\n for _ in range(cases):\n cuts = int(input())\n angles = list(map(int, input().split()))\n min_angle = angles[0]\n size = []\n for i in range(cuts):\n if i != cuts-1:\n size.append(angles[i+1]-angles[i])\n size.append(360-angles[-1]+angles[0])\n diff = gcd_of_list(size)\n print(360//diff - len(size))\n__starting_point()", "# cook your dish here\nimport numpy as np\nimport math\nfor t in range(int(input())):\n n=int(input())\n a=list(map(int,input().split()))\n aa=np.zeros([n],dtype=int)\n for i in range(n-1):\n aa[i]=a[i+1]-a[i]\n aa[n-1]=360-a[n-1]+a[0]\n hcf=180\n for i in range(n):\n hcf=min(hcf,math.gcd(aa[i%n],aa[(i+1)%n]))\n print(360//hcf-n)", "def gcd(a, b):\n if b == 0:\n return a\n return gcd(b, a%b)\n\ndef gcd_of_list(lst):\n a = lst[0]\n for item in lst:\n a = gcd(item, a)\n if a == 1:\n return 1\n return a\n\ndef __starting_point():\n cases = int(input())\n for _ in range(cases):\n cuts = int(input())\n angles = list(map(int, input().split()))\n min_angle = angles[0]\n size = []\n for i in range(cuts):\n if i != cuts-1:\n size.append(angles[i+1]-angles[i])\n size.append(360-angles[-1]+angles[0])\n diff = gcd_of_list(size)\n print(360//diff - len(size))\n\n__starting_point()", "T=int(input())\ndef gcd(a,b):\n if(b==0):\n return a\n else:\n return gcd(b,a%b)\nfor i in range(T):\n N=int(input())\n arrst=input()\n arr=list(map(int,arrst.split()))\n count=0\n arr.sort()\n lis=[arr[0]-arr[len(arr)-1]+360]\n \n for j in range(len(arr)-1):\n lis+=[arr[j+1]-arr[j]]\n ans=lis[0] \n for j in range(len(arr)):\n ans=gcd(ans,lis[j])\n for j in range(len(arr)):\n count+=(lis[j]//ans)-1\n print(int(count)) \n \n\n", "from math import gcd\nT=int(input());\nx=[];\nfor i in range(T):\n n=int(input());\n a=[int(i) for i in input().split()]\n g=a[1]-a[0];\n for i in range(1,n):\n g=gcd(g,a[i]-a[i-1]);\n g=gcd(g,360-a[n-1]+a[0]);\n count=0;\n for i in range(1,n):\n count+=(a[i]-a[i-1])//g-1;\n count+=(360-a[n-1]+a[0])//g-1;\n print(count)\n", "def hcf(a, b):\n if b == 0:\n return (a)\n else:\n return (hcf(b, a % b))\n\nt=int(input())\nfor i in range(t):\n\n n=int(input())\n a=list(map(int,input().strip().split()))\n b=[]\n for j in range(len(a)-1):\n b.append(a[j+1]-a[j])\n b.append(360-a[len(a)-1]+a[0])\n for k in range(len(b)-1):\n b[k+1]=hcf(b[k],b[k+1])\n p=360/b[len(b)-1]\n print(int(p-len(a)))", "def gcd(a,b):\n if b==0:\n return a\n else:\n return gcd(b,a%b)\nt=int(input())\nfor _ in range(t):\n n=int(input())\n a=[int(i) for i in input().split()]\n x=[]\n for i in range(1,n):\n x.append(a[i]-a[i-1])\n x.append(360-a[n-1]+a[0])\n p=x[0]\n s=0\n for i in x:\n p=gcd(p,i)\n for i in x:\n s+=i//p-1\n print(s)", "# cook your dish here\ndef gcd(a,b):\n if b==0:\n return a\n else:\n return gcd(b,a%b)\nt=int(input())\nfor _ in range(t):\n n=int(input())\n a=[int(i) for i in input().split()]\n x=[]\n for i in range(1,n):\n x.append(a[i]-a[i-1])\n x.append(360-a[n-1]+a[0])\n p=x[0]\n s=0\n for i in x:\n p=gcd(p,i)\n for i in x:\n s+=i//p-1\n print(s)", "from math import gcd\nfor _ in range(int(input())):\n n=int(input())\n l=[int(y) for y in input().split(' ')]\n g=l[1]-l[0]\n count=0\n for i in range(1,n):\n g=gcd(g,l[i]-l[i-1])\n g=gcd(g,360-l[n-1]+l[0])\n for i in range(1, n):\n count+=(l[i]-l[i-1])//g-1\n count+=(360-l[n-1]+l[0])//g-1\n print(count)"]

{"inputs": [["3", "4", "0 90 180 270", "2", "90 210", "2", "0 1"]], "outputs": [["0", "1", "358"]]}

INTERVIEW

PYTHON3

CODECHEF

10,414

3be38813c5dc7e9bd5454cd5ea0db4bd

UNKNOWN

Digory Kirke and Polly Plummer are two kids living next door to each other. The attics of the two houses are connected to each other through a passage. Digory's Uncle Andrew has been secretly doing strange things in the attic of his house, and he always ensures that the room is locked. Being curious, Digory suspects that there is another route into the attic through Polly's house, and being curious as kids always are, they wish to find out what it is that Uncle Andrew is secretly up to. So they start from Polly's house, and walk along the passageway to Digory's. Unfortunately, along the way, they suddenly find that some of the floorboards are missing, and that taking a step forward would have them plummet to their deaths below. Dejected, but determined, they return to Polly's house, and decide to practice long-jumping in the yard before they re-attempt the crossing of the passage. It takes them exactly one day to master long-jumping a certain length. Also, once they have mastered jumping a particular length L, they are able to jump any amount less than equal to L as well. The next day they return to their mission, but somehow find that there is another place further up the passage, that requires them to jump even more than they had practiced for. So they go back and repeat the process. Note the following: - At each point, they are able to sense only how much they need to jump at that point, and have no idea of the further reaches of the passage till they reach there. That is, they are able to only see how far ahead is the next floorboard. - The amount they choose to practice for their jump is exactly the amount they need to get across that particular part of the passage. That is, if they can currently jump upto a length L0, and they require to jump a length L1(> L0) at that point, they will practice jumping length L1 that day. - They start by being able to "jump" a length of 1. Find how many days it will take them to cross the passageway. In the input, the passageway is described as a string P of '#'s and '.'s. A '#' represents a floorboard, while a '.' represents the absence of a floorboard. The string, when read from left to right, describes the passage from Polly's house to Digory's, and not vice-versa. -----Input----- The first line consists of a single integer T, the number of testcases. Each of the next T lines consist of the string P for that case. -----Output----- For each case, output the number of days it takes them to cross the passage. -----Constraints----- - 1 ≤ T ≤ 1,000,000 (106) - 1 ≤ |P| ≤ 1,000,000 (106) - The total length of P will be ≤ 5,000,000 (5 * 106)across all test-cases of a test-file - P will consist of only the characters # and . - The first and the last characters of P will be #. -----Example----- Input: 4 #### ##.#..# ##..#.# ##.#....# Output: 0 2 1 2 -----Explanation----- For the first example, they do not need to learn any jump size. They are able to cross the entire passage by "jumping" lengths 1-1-1. For the second example case, they get stuck at the first '.', and take one day learning to jump length 2. When they come back the next day, they get stuck at '..' and take one day to learn to jump length 3. For the third example case, they get stuck first at '..', and they take one day to learn to jump length 3. On the second day, they are able to jump both length 3 as well as length 2 required to cross the passage. For the last test case they need to stop and learn jumping two times. At first they need to jump a length 2 and then a length 5. -----Appendix----- Irrelevant to the problem description, if you're curious about what Uncle Andrew was up to, he was experimenting on Magic Rings that could facilitate travel between worlds. One such world, as some of you might have heard of, was Narnia.

["# cook your dish here\nfor i in range(int(input())):\n s = input()\n m = 0\n p = 0\n d = 0\n l = []\n for i in range(len(s)):\n if(s[i] == \".\"):\n m = m+1\n elif(s[i] == \"#\"):\n l.append(m)\n m=0\n for i in range(len(l)):\n if(l[i]>p):\n p = l[i]\n d = d+1\n print(d)\n \n \n \n \n", "t=int(input())\nfor _ in range(t):\n s=input()\n l,d,m=0,0,0\n for i in range(len(s)):\n if s[i]=='.':\n l+=1\n if s[i]=='#' :\n if l>m: \n d+=1\n m=l\n l=0\n print(d)", "# cook your dish here\ntest_case = int(input())\nwhile test_case :\n \n passage = input()\n n = len(passage)\n \n count_days = 0 \n jump = 0\n i = 0 \n while i < n:\n \n if passage[i] == '.' :\n count_empty = 1 \n k = i + 1\n while(passage[k] == '.' ) :\n count_empty += 1\n k += 1\n if count_empty > jump :\n count_days += 1\n jump = count_empty \n \n i = k \n else:\n i += 1\n \n print(count_days)\n test_case -= 1\n \n \n \n \n \n \n \n \n \n \n", "# cook your dish here\nt=int(input())\nfor i in range(t):\n s=input()\n count=0\n pre=0\n ans=0\n for val in range(len(s)):\n if s[val]==\"#\":\n # print(count,pre)\n if count>pre:\n # print(ans)\n ans+=1\n pre=count\n # count=0\n count=0\n else:\n count+=1\n print(ans)\n \n \n # pos=s[0]\n # for k in range(len(s)-1):\n # if s[k+1]==\"#\":\n # pos=s[k+1]\n # else:\n \n # if counter\n", "def solve(S):\n \n \n i = 0\n count = 0\n L = 0\n n = len(S)\n end = False\n size = 0\n while (i<n):\n \n if S[i] == '.':\n size +=1\n \n elif size!=0:\n if size>L:\n count+=1\n L = size\n size = 0\n \n i+=1\n \n return count\n\n\nt = int(input())\nfor _ in range(t):\n s = input()\n print(solve(s))", "# https://www.codechef.com/problems/ATTIC\n\nT = int(input())\n\nfor t in range(T):\n s = input()\n L = len(s)\n days = 0\n i = 0\n jump_len_known = 1\n \n while i < L:\n while i < L and s[i] == '#':\n i += 1\n \n if i < L:\n j = i + 1\n \n while j < L and s[j] == '.':\n j += 1\n \n jump_len = j - i + 1\n \n if jump_len_known < jump_len:\n days += 1\n jump_len_known = jump_len\n \n i = j\n\n print(days)\n", "# cook your dish here\nt=int(input())\nfor _ in range(t):\n p=input()\n \n cnt,maxi,ans = 1,1,0\n \n for i in p:\n \n if i=='#' and cnt!=1:\n if cnt>maxi:\n maxi=cnt\n ans+=1\n \n cnt=1\n \n elif i=='.':\n cnt+=1\n \n elif i=='#' and cnt==1:\n continue\n \n if cnt!=1:\n if cnt>maxi:\n ans+=1\n \n print(ans)", "def __starting_point():\n for _ in range(int(input())):\n s = input()\n L, count, days = 0, 0, 0\n for c in s:\n if(c == \"#\"):\n if(count > L):\n days += 1\n L = count\n count = 0\n else:\n count += 1\n if(count > L):\n days += 1\n print(days)\n\n__starting_point()", "def __starting_point():\n for _ in range(int(input())):\n s = input()\n L, count, days = 0, 0, 0\n for c in s:\n if(c == \"#\"):\n if(count > L):\n days += 1\n L = count\n count = 0\n else:\n count += 1\n if(count > L):\n days += 1\n print(days)\n\n__starting_point()", "t = int(input())\nfor _ in range(t):\n w = str(input()).split('#')\n day = 0\n jump = 0\n for i in w:\n if len(i)>jump:\n jump = len(i)\n day+=1\n print(day)# cook your dish here\n", "t=int(input())\nfor _ in range(t):\n n=input()\n s=0\n p=0\n h=0\n if(len(n)==1):\n if(n[0]=='.'):\n print(1)\n else:\n print(0)\n else:\n for i in range(len(n)-1):\n if(n[i]=='.'):\n p+=1\n if(n[i+1]=='#' or i+1==len(n)-1):\n if(p>s):\n h+=1\n s=p\n p=0\n if(h==0 and n[len(n)-1]=='.'):\n print(1)\n else:\n print(h)\n \n", "t = int(input())\nfor _ in range(t) :\n path = str(input()).split('#')\n c = 0\n jump = 0\n for i in path :\n if len(i) > jump :\n jump = len(i)\n c += 1\n print(c)", "T = int(input())\nans = []\n\nfor _ in range(T):\n P = input()\n\n N = len(P)\n days = 0\n jumping_length = 1\n i = 0\n while(i<N):\n if(P[i]=='.'):\n j = i\n while(j<N and P[j]=='.'):\n j += 1\n if(j-i+1 > jumping_length):\n jumping_length = j-i+1\n days += 1\n i = j\n else:\n i += 1\n ans.append(days)\n\nfor i in ans:\n print(i)", "# cook your dish here\nfor i in range(int(input())):\n p=input()\n l=len(p)\n arr=[0]\n count=0\n for j in range(l):\n if(p[j]=='.'):\n count=count+1\n elif(count>0 and p[j]=='#'):\n if(max(arr)<count):\n arr.append(count)\n count=0\n print(len(set(arr))-1)", "# cook your dish here\nfor t in range(int(input())):\n path = input()\n mx = 0\n it = 0\n count = 0\n\n while it < len(path):\n\n if path[it] == '.':\n temp = 0\n\n while path[it] == '.':\n temp += 1\n it += 1\n\n if temp > mx:\n count += 1\n mx = temp\n\n else:\n it += 1\n\n print(count)\n\n\n\n", "# cook your dish here\nt=int(input())\nfor _ in range(t):\n arr=input()\n i=0\n temp=[]\n while i<len(arr):\n count=0\n while i<len(arr) and arr[i]=='#':\n i+=1\n while i<len(arr) and arr[i]=='.':\n count+=1\n i+=1\n if count!=0 and count not in temp:\n temp.append(count)\n check,day=-1,0\n for ele in temp:\n if ele>check:\n day+=1\n check=ele\n print(day)\n \n", "# cook your dish here\nfrom sys import stdin,stdout\nt=int(stdin.readline())\n\ndef attic(s):\n c=0\n l=[]\n k=0\n m=0\n for i in range(len(p)):\n if s[i]=='.':\n c+=1\n else:\n if c > k:\n k=c\n m+=1\n l.append(c)\n \n c=0\n return m\n \nfor _ in range(t):\n p=input()\n r=attic(p)\n print(r)", "# cook your dish here\nt=int(input())\n\ndef attic(s):\n c=0\n l=[]\n k=0\n m=0\n for i in range(len(p)):\n if s[i]=='.':\n c+=1\n else:\n if c > k:\n k=c\n m+=1\n l.append(c)\n \n c=0\n return m\n \nfor _ in range(t):\n p=input()\n r=attic(p)\n print(r)", "# cook your dish here\nt=int(input())\n\ndef attic(s):\n c=0\n l=[]\n k=0\n for i in range(len(p)):\n if s[i]=='.':\n c+=1\n else:\n if c > k:\n k=c\n l.append(c)\n \n c=0\n return len(set(sorted(l)))\n \nfor _ in range(t):\n p=input()\n r=attic(p)\n print(r)", "t = int(input())\nwhile t > 0:\n s = input()\n c = 0\n mx = 0\n d = 0\n for i in range(len(s)):\n c = 0\n if s[i] == '.' and s[i - 1] != '.':\n while s[i] != '#':\n c += 1\n i += 1\n if c > mx:\n d += 1\n mx = c\n print(d)\n t = t - 1\n", "t=int(input())\nfor i in range(t):\n s=list(input())\n mx=0\n count=0\n c=0\n for j in range(len(s)):\n if s[j]=='.':\n count+=1\n else:\n if count>mx:\n c+=1\n mx=max(mx,count)\n count=0\n print(c)\n", "for _ in range(int(input())):\n s = input()\n n = len(s)\n cnt = 0\n ans =0\n c =0\n for i in range(n):\n if s[i]=='.':\n cnt+=1\n else:\n if cnt > ans:\n c+=1\n ans = max(ans,cnt)\n cnt=0\n print(c)", "for _ in range(int(input())):\n string = input()\n count = 0\n list1 = []\n for i in string:\n if i=='.':\n count+=1\n else:\n if count!=0:\n list1.append(count)\n count = 0\n if len(list1)==0:\n print(0)\n else:\n ans = 1\n count = list1[0]\n for a in list1:\n if a>count:\n ans+=1\n count = a\n print(ans)\n", "# cook your dish here\nfor _ in range(int(input())):\n p=input()\n i=0\n count=0\n result=0\n s=0\n while i<len(p):\n if p[i]=='.':\n while p[i]!='#':\n count+=1 \n i+=1 \n if result<count:\n result=count\n s+=1\n count=0\n else:\n i+=1\n print(s)\n", "t=int(input())\nfor i in range(t):\n s=str(input())\n l=[]\n cou=0\n for j in s:\n if(j=='.'):\n cou+=1\n else:\n if(cou!=0):\n l.append(cou)\n cou=0\n if(len(l)==0):\n print(0)\n else:\n cou=l[0]\n ans=1\n for j in l:\n if(j>cou):\n ans+=1\n cou=j\n print(ans) "]

{"inputs": [["4", "####", "##.#..#", "##..#.#", "##.#....#"]], "outputs": [["0", "2", "1", "2"]]}

INTERVIEW

PYTHON3

CODECHEF

7,659

dd3809d100b7d788c6742ccc9accff17

UNKNOWN

Chef has an array A consisting of N integers (1-based indexing). He asks you to perform the following operation M times: for i = 2 to N: Ai = Ai + Ai-1 Your task is to find the xth element of the array (i.e., Ax) after performing the above operation M times. As the answer could be large, please output it modulo 109 + 7. -----Input----- - The first line of input contains an integer T denoting the number of test cases. - The first line of each test case contains three space-separated integers — N, x, and M — denoting the size of the array, index of the element you need to find, and the amount of times you need to repeat operation before finding the element, respectively. The second line contains N space-separated integers A1, A2, …, AN. -----Output----- For each test case, output a single line containing one integer: Ax modulo 109 + 7. -----Constraints----- - 1 ≤ T ≤ 10 - 1 ≤ x ≤ N ≤ 105 - 1 ≤ M ≤ 1018 - 1 ≤ Ai ≤ 1018 -----Subtasks-----Subtask 1 (8 points): - 1 ≤ x ≤ min{2, N}Subtask 2 (24 points): - 1 ≤ N * M ≤ 106Subtask 3 (68 points): No additional constraints -----Example----- Input: 2 3 2 3 1 2 3 3 3 3 1 2 3 Output: 5 15 -----Explanation----- Values in the array A: - Before the operations: [1, 2, 3] - After the first operation: [1, 3, 6] - After the second operation: [1, 4, 10] - After the third operation: [1, 5, 15] Since input file can be fairly large (about 8 MB), it's recommended to use fast I/O (for example, in C++, use scanf/printf instead of cin/cout).

["for _ in range(int(input())):\n n,x,m = map(int,input().split())\n a = list(map(int,input().split()))\n for _ in range(m):\n for i in range(1,n):\n a[i] = a[i] + a[i-1]\n print(a[x-1]%(10**9+7))", "def modInverse(a, m) : \n m0 = m \n y = 0\n x = 1\n\n if (m == 1) : \n return 0\n\n while (a > 1) : \n q = a // m \n\n t = m \n m = a % m \n a = t \n t = y \n y = x - q * y \n x = t \n if (x < 0) : \n x = x + m0 \n\n return x\np=10**9+7\nf=[1]*(100000+1)\nfor i in range(1,100000+1):\n f[i]=i*f[i-1]\n if f[i]>p:\n f[i]=f[i]%p\n\nfor _ in range(int(input())):\n n,x,m=map(int,input().split( ))\n m=m%p\n a=list(map(int,input().split( ))) \n pre=[1]*(x)\n for i in range(1,x):\n pre[i]=pre[i-1]*((m+(i-1)))*f[i-1]\n inv=modInverse(f[i],p)\n pre[i]=(pre[i]*inv)%p\n ans=0\n j=0 \n for i in range(x-1,-1,-1):\n ans+=a[j]*pre[i]\n if ans>p:\n ans=ans%p\n j+=1\n print(ans%p)", "def modInverse(a, m) : \n m0 = m \n y = 0\n x = 1\n\n if (m == 1) : \n return 0\n\n while (a > 1) : \n q = a // m \n\n t = m \n m = a % m \n a = t \n t = y \n y = x - q * y \n x = t \n if (x < 0) : \n x = x + m0 \n\n return x\np=10**9+7\nf=[1]*(100000+1)\nfor i in range(1,100000+1):\n f[i]=i*f[i-1]\n if f[i]>p:\n f[i]=f[i]%p\n\nfor _ in range(int(input())):\n n,x,m=map(int,input().split( ))\n m=m%p\n a=list(map(int,input().split( ))) \n pre=[1]*(x)\n for i in range(1,x):\n pre[i]=pre[i-1]*((m+(i-1)))*f[i-1]\n inv=modInverse(f[i],p)\n pre[i]=(pre[i]*inv)%p\n ans=0\n j=0 \n for i in range(x-1,-1,-1):\n ans+=a[j]*pre[i]\n if ans>p:\n ans=ans%p\n j+=1\n print(ans%p)", "p=10**9+7\nf=[1]*(100000+1)\nfor i in range(1,100000+1):\n f[i]=i*f[i-1]\n if f[i]>p:\n f[i]=f[i]%p\n\nfor _ in range(int(input())):\n n,x,m=map(int,input().split( ))\n m=m%p\n a=list(map(int,input().split( ))) \n pre=[1]*(x)\n for i in range(1,x):\n pre[i]=((((pre[i-1]%p)*((m+(i-1))%p))%p)%p*(f[i-1]%p))%p\n pre[i]=pre[i]//f[i]\n ans=0\n j=0 \n for i in range(x-1,-1,-1):\n ans+=a[j]*pre[i]\n if ans>p:\n ans=ans%p\n j+=1\n print(ans%p)", "p=10**9+7\nf=[1]*(100000+1)\nfor i in range(1,100000+1):\n f[i]=i*f[i-1]\n if f[i]>p:\n f[i]=f[i]%p\n\nfor _ in range(int(input())):\n n,x,m=map(int,input().split( ))\n m=m%p\n a=list(map(int,input().split( ))) \n pre=[1]*(x)\n for i in range(1,x):\n pre[i]=pre[i-1]*(m+(i-1))*f[i-1]\n if pre[i]>p:\n pre[i]=pre[i]%p\n pre[i]=pre[i]//f[i]\n ans=0\n j=0 \n for i in range(x-1,-1,-1):\n ans+=a[j]*pre[i]\n if ans>p:\n ans=ans%p\n j+=1\n print(ans%p)", "p=10**9+7\nf=[1]*(100000+1)\nfor i in range(1,100000+1):\n f[i]=i*f[i-1]\n if f[i]>=p:\n f[i]=f[i]%p\n\nfor _ in range(int(input())):\n n,x,m=map(int,input().split( ))\n m=m%p\n a=list(map(int,input().split( ))) \n pre=[1]*(x)\n for i in range(1,x):\n pre[i]=pre[i-1]*(m+(i-1))*f[i-1]\n if pre[i]>=p:\n pre[i]=pre[i]%p\n pre[i]=pre[i]//f[i]\n ans=0\n j=0 \n for i in range(x-1,-1,-1):\n ans+=a[j]*pre[i]\n if ans>=p:\n ans=ans%p\n j+=1\n print(ans%p)", "p=10**9+7\nf=[1]*(100000+1)\nfor i in range(1,100000):\n f[i]=i*f[i-1]\n if f[i]>=p:\n f[i]=f[i]%p\n\nfor _ in range(int(input())):\n n,x,m=map(int,input().split( ))\n m=m%p\n a=list(map(int,input().split( ))) \n pre=[1]*(x)\n for i in range(1,x):\n pre[i]=pre[i-1]*(m+(i-1))*f[i-1]\n if pre[i]>=p:\n pre[i]=pre[i]%p\n pre[i]=pre[i]//f[i]\n ans=0\n j=0 \n for i in range(x-1,-1,-1):\n ans+=a[j]*pre[i]\n if ans>=p:\n ans=ans%p\n j+=1\n print(ans%p)", "p=10**9+7\nf=[1]*(100000+1)\nfor i in range(1,100000):\n f[i]=i*f[i-1]\n if f[i]>=p:\n f[i]=f[i]%p\n\nfor _ in range(int(input())):\n n,x,m=map(int,input().split( ))\n a=list(map(int,input().split( ))) \n pre=[1]*(x+1)\n for i in range(1,x):\n pre[i]=pre[i-1]*(m+(i-1))*f[i-1]\n if pre[i]>=p:\n pre[i]=pre[i]%p\n pre[i]=pre[i]//f[i]\n ans=0\n j=0 \n for i in range(x-1,-1,-1):\n ans+=a[j]*pre[i]\n if ans>=p:\n ans=ans%p\n j+=1\n print(ans)", "p=10**9+7\nf=[1]*(100+1)\nfor i in range(1,100):\n f[i]=i*f[i-1]\n if f[i]>=p:\n f[i]=f[i]%p\n\nfor _ in range(int(input())):\n n,x,m=map(int,input().split( ))\n a=list(map(int,input().split( ))) \n pre=[1]*(x+1)\n for i in range(1,x):\n pre[i]=pre[i-1]*(m+(i-1))*f[i-1]\n if pre[i]>=p:\n pre[i]=pre[i]%p\n pre[i]=pre[i]//f[i]\n ans=0\n j=0 \n for i in range(x-1,-1,-1):\n ans+=a[j]*pre[i]\n if ans>=p:\n ans=ans%p\n j+=1\n print(ans)", "import math\nT=int(input())\nfor i in range(T):\n n,x,m=list(map(int,input().split()))\n l1=[int(i) for i in input().split()]\n if x==1:\n l1[0]=l1[0]%1000000007\n print(l1[0])\n elif x==2:\n m=m%1000000007\n l1[0]=l1[0]%1000000007\n l1[1]=(l1[1]%1000000007+l1[0]*m%1000000007)%1000000007\n print(l1[1])\n else:\n m=m%1000000007\n c=-1\n y=0\n q=1\n f=1\n y=(l1[x-1]%1000000007)\n for j in range(x-2,-1,-1):\n c=c+1\n q=(q*((m+c)%1000000007))%1000000007\n q=(q*pow(c+1,1000000005,1000000007))%1000000007\n y=(y+(q*(l1[j]%1000000007))%1000000007)%1000000007\n #print(q,s,c)\n #print(y,s,l1[j])\n print(y%1000000007)\n \n\n", "T=int(input())\nfor i in range(T):\n n,x,m=list(map(int,input().split()))\n l1=[int(i) for i in input().split()]\n if x==1:\n l1[0]=l1[0]%1000000007\n print(l1[0])\n elif x==2:\n m=m%1000000007\n l1[0]=l1[0]%1000000007\n l1[1]=(l1[1]%1000000007+l1[0]*m%1000000007)%1000000007\n print(l1[1])\n else:\n m=m%1000000007\n c=-1\n y=0\n q=1\n y=(l1[x-1]%1000000007)\n for j in range(x-2,-1,-1):\n c=c+1\n q=(q*((m+c)%1000000007))%1000000007\n #print(q)\n s=(q*pow(c,1000000005,1000000007))%1000000007\n y=(y+(s*(l1[j]%1000000007))%1000000007)%1000000007\n #print(y,s,l1[j])\n print(y)\n \n\n", "T=int(input())\nfor i in range(T):\n n,x,m=list(map(int,input().split()))\n l1=[int(i) for i in input().split()]\n if x==1:\n l1[0]=l1[0]%1000000007\n print(l1[0])\n elif x==2:\n m=m%1000000007\n l1[0]=l1[0]%1000000007\n l1[1]=(l1[1]%1000000007+l1[0]*m%1000000007)%1000000007\n print(l1[1])\n else:\n m=m%1000000007\n c=-1\n y=0\n q=1\n y=(l1[x-1]%1000000007)\n for j in range(x-2,-1,-1):\n c=c+1\n q=(q*((m+c)%1000000007))%1000000007\n print(q)\n s=(q*pow(c,1000000005,1000000007))%1000000007\n y=(y+(s*(l1[j]%1000000007))%1000000007)%1000000007\n #print(y,s,l1[j])\n print(y)\n \n\n", "T=int(input())\nfor i in range(T):\n n,x,m=list(map(int,input().split()))\n l1=[int(i) for i in input().split()]\n if x==1:\n l1[0]=l1[0]%1000000007\n print(l1[0])\n elif x==2:\n m=m%1000000007\n l1[0]=l1[0]%1000000007\n l1[1]=(l1[1]%1000000007+l1[0]*m%1000000007)%1000000007\n print(l1[1])\n '''else:\n m=m%1000000007\n c=-1\n y=0\n q=1\n y=(l1[x-1]%1000000007)\n for j in range(x-2,-1,-1):\n c=c+1\n q=(q*((m+c)%1000000007))%1000000007\n s=(q*pow(c,1000000005,1000000007))%1000000007\n y=(y+(s*(l1[j]%1000000007))%1000000007)%1000000007\n #print(y,s,l1[j])\n print(y)'''\n \n\n", "def mult(r,v):\n w=r\n for k in range(1,v):\n w=(w*((k+r)%1000000007))%1000000007\n return w\nT=int(input())\nfor i in range(T):\n n,x,m=list(map(int,input().split()))\n l1=[int(i) for i in input().split()]\n if x==1:\n l1[0]=l1[0]%1000000007\n print(l1[0])\n elif x==2:\n m=m%1000000007\n l1[0]=l1[0]%1000000007\n l1[1]=(l1[1]%1000000007+l1[0]*m%1000000007)%1000000007\n print(l1[1])\n else:\n m=m%1000000007\n c=0\n y=0\n y=(l1[x-1]%1000000007)\n for j in range(x-2,-1,-1):\n c=c+1\n s=(mult(m,c)*pow(c,1000000005,1000000007))%1000000007\n y=(y+(s*(l1[j]%1000000007))%1000000007)%1000000007\n #print(y,s,l1[j])\n print(y)\n \n\n", "T=int(input())\nfor i in range(T):\n n,x,m=list(map(int,input().split()))\n l1=[int(i) for i in input().split()]\n if x==1:\n l1[0]=l1[0]%1000000007\n print(l1[0])\n elif x==2:\n m=m%1000000007\n l1[0]=l1[0]%1000000007\n l1[1]=(l1[1]%1000000007+l1[0]*m%1000000007)%1000000007\n print(l1[1])\n", "T=int(input())\nfor k in range(T):\n n,x,m=list(map(int,input().split()))\n l1=[int(i) for i in input().split()]\n l2,l3=[],[]\n for i in range(len(l1)):\n l2.append(0)\n l3.append(0)\n l2[0]=l1[0]%1000000007\n for i in range(1,len(l1)):\n l2[i]=((l1[i]%1000000007)+(l2[i-1]%1000000007))%1000000007\n if m==1:\n print(l1[x-1]%1000000007)\n elif m==2:\n print(l2[x-1])\n else:\n l3[0]=l2[0]\n l3[1]=(l1[1]+((m)*l1[0])%1000000007)%1000000007\n #print(l3[1],x,l2[1])\n s=0\n v=0\n for i in range(2,x):\n s=l2[i-1]*(l2[i-1]-1)//2\n # print(l2[i-1],s)\n v=l3[i-1]*(l3[i-1]+1)//2\n #print(l3[i-1],v)\n #print(v-s)\n l3[i]=((v-s)%1000000007+l1[i])%1000000007\n print(l3[x-1])\n \n \n \n", "T=int(input())\nfor k in range(T):\n n,x,m=list(map(int,input().split()))\n l1=[int(i) for i in input().split()]\n l2,l3=[],[]\n for i in range(len(l1)):\n l2.append(0)\n l3.append(0)\n l2[0]=l1[0]%1000000007\n for i in range(1,len(l1)):\n l2[i]=((l1[i]%1000000007)+(l2[i-1]%1000000007))%1000000007\n if m==1:\n print(l1[x-1]%1000000007)\n elif m==2:\n print(l2[x-1])\n else:\n l3[0]=l2[0]\n l3[1]=(l1[1]+((m)*l1[0])%1000000007)%1000000007\n #print(l3[1],x,l2[1])\n s=0\n v=0\n for i in range(2,x):\n s=l2[i-1]*(l2[i-1]-1)//2\n # print(l2[i-1],s)\n v=l3[i-1]*(l3[i-1]+1)//2\n #print(l3[i-1],v)\n #print(v-s)\n l3[i]=((v-s)%1000000007+l1[i])%1000000007\n print(l3[x-1])\n \n \n \n", "T=int(input())\nfor k in range(T):\n n,x,m=list(map(int,input().split()))\n l1=[int(i) for i in input().split()]\n l2,l3=[],[]\n for i in range(len(l1)):\n l2.append(0)\n l3.append(0)\n l2[0]=l1[0]%1000000007\n for i in range(1,len(l1)):\n l2[i]=((l2[i]%1000000007)+(l2[i-1]%1000000007))%1000000007\n if m==1:\n print(l1[x-1]%1000000007)\n elif m==2:\n print(l2[x-1])\n else:\n l3[0]=l2[0]\n l3[1]=(l1[1]+((m)*l1[0])%1000000007)%1000000007\n s=0\n v=0\n for i in range(2,x):\n s=l2[i-1]*(l2[i-1]-1)//2\n v=l3[i-1]*(l3[i-1]+1)//2\n l3[i]=(v-s)%1000000007\n print(l3[x-1])\n \n \n \n", "for _ in range(int(input())):\n n,x,m=list(map(int,input().split()))\n l=[int(i) for i in input().split()]\n MOD=10**9+7\n if x<=2:\n if x==1:\n print(l[0]%MOD)\n else:\n print((l[0]*m+l[1])%MOD)\n continue \n\n temp=l[:]\n while m:\n for i in range(1,n):\n l[i]=l[i]+l[i-1]\n #l=temp[:]\n #print(l)\n m-=1 \n print(l[x-1]%MOD)\n \n", "for _ in range(int(input())):\n n,x,m=list(map(int,input().split()))\n l=[int(i) for i in input().split()]\n MOD=10**9+7 \n temp=l[:]\n while m:\n for i in range(1,n):\n l[i]=l[i]+l[i-1]\n #l=temp[:]\n #print(l)\n m-=1 \n print(l[x-1]%MOD)\n", "# cook your dish here\nfor _ in range(int(input())):\n n,x,m=list(map(int,input().split()))\n l=list(map(int,input().split()))\n q=[]\n for j in range(m):\n for i in range(1,len(l)):\n l[i]=l[i]+l[i-1]\n print(l[x-1]%(10**9 +7))\n", "'''input\n2\n3 2 3\n1 2 3\n3 3 3 \n1 2 3\n'''\nmod=10**9+7\nfor _ in range(int(input())):\n n,x,m=map(int,input().split())\n a=[int(i) for(i) in input().split()]\n ans=a[x-1]%mod\n f=1\n for i in range(1,x):\n f=f*(m-1+i)\n f=f//i\n f=f%mod;\n ans+=(a[x-1-i]*f)%mod\n print(ans%mod)", "'''input\n2\n3 2 3\n1 2 3\n3 3 3 \n1 2 3\n'''\nfor _ in range(int(input())):\n n,x,m=map(int,input().split())\n a=[int(i) for(i) in input().split()]\n ans=a[x-1]\n f=1\n for i in range(1,x):\n f=f*(m-1+i)\n f=f//i\n ans+=a[x-1-i]*f\n print(ans%(10**9+7))"]

{"inputs": [["2", "3 2 3", "1 2 3", "3 3 3", "1 2 3"]], "outputs": [["5", "15"]]}

INTERVIEW

PYTHON3

CODECHEF

11,218

87792cc2d9ac30d55afcb4bcfc8334f2

UNKNOWN

Ganesh lives in Gopalmath. He is looking for Jojo. So he decides to collect Aadhar Card Information of all the citizens of India from UIDAI. Someone told Ganesh that the sum of all the digits of Jojo’s Aadhar number is divisible by 10 and it is greater than zero. After finding all Aadhar numbers which are divisible by 10, Jojo’s Aadhar number is $N$th smallest Aadhar number. Hence, Ganesh wants to find Jojo’s Aadhar number which satisfies all of the above conditions. (In this chaotic world, Aadhar numbers can be any natural number.) However, Guruji refused Ganesh to carry out this task, because he is weak in Maths. Therefore, Ganesh assigns this task to Paritoshbhai who possesses excellent Mathematical skills. Since Paritoshbhai is busy in his jewellery business, help him in this task. -----Input:----- - The first line of the input contains a single integer T denoting the number of test cases. The description of T test cases follows. - The first and only line of each test case contains a single integer N. -----Output:----- For each test case, print a single line containing Aadhar number of Jojo. -----Constraints----- - $1 \leq T \leq 1000$ - $1 \leq N \leq 10^{100,000}$ -----Sample Input:----- 1 3 -----Sample Output:----- 37

["for _ in range(int(input())):\n N = input()\n num = list(N)\n s=0\n for n in num:\n if n.isnumeric():\n s+=int(n)\n #print(s)\n x=(10-s%10)%10\n print(int(N)*10+int(x))", "# cook your dish here\ndef s(n):\n sn=str(n)\n r=0\n for i in sn:\n r+=int(i)\n return r\n \nfor _ in range(int(input())):\n n=int(input())\n print(str(n)+str((10-s(n))%10))", "for _ in range(int(input())):\n n = input().strip().lstrip('0')\n\n x = sum(int(i) for i in n) % 10\n\n if x == 0:\n x = 10\n\n print(str(n) + str(10 - x))\n"]

{"inputs": [["1", "3"]], "outputs": [["37"]]}

INTERVIEW

PYTHON3

CODECHEF

516

4741ee3d6cfa2b9534e08c2ef3a383db

UNKNOWN

Teddy and Tracy like to play a game based on strings. The game is as follows. Initially, Tracy writes a long random string on a whiteboard. Then, each player starting with Teddy makes turn alternately. Each turn, the player must erase a contiguous substring that exists in the dictionary. The dictionary consists of N words. Of course, the player that can't erase any substring in his turn loses the game, and the other player is declared the winner. Note that after a substring R is erased, the remaining substring becomes separated, i.e. they cannot erase a word that occurs partially to the left of R and partially to the right of R. Determine the winner of the game, assuming that both players play optimally. -----Input----- The first line contains a single integer T, the number of test cases. T test cases follow. The first line of each testcase contains a string S, the string Tracy writes on the whiteboard. The next line contains a single integer N. N lines follow. The i-th line contains a single string wi, the i-th word in the dictionary. -----Output----- For each test case, output a single line containing the name of the winner of the game. -----Example----- Input: 3 codechef 2 code chef foo 1 bar mississippi 4 ssissi mippi mi ppi Output: Tracy Tracy Teddy -----Constraints----- - 1 <= T <= 5 - 1 <= N <= 30 - 1 <= |S| <= 30 - 1 <= |wi| <= 30 - S and wi contain only characters 'a'-'z'

["import sys\n\ndef mex(S,W,C,start,end):\n \"\"\"Returns Nim-number of S[start:end]\"\"\"\n key=(start,end)\n try:\n return C[key]\n except KeyError:\n pass\n A=set()\n for s in range(start,end):\n for e in range(start+1,end+1):\n if S[s:e] not in W: continue\n A.add(mex(S,W,C,start,s)^mex(S,W,C,e,end))\n a=0\n while a in A: a+=1\n C[key]=a\n return a\n \n\na=sys.stdin\n#a=open('astrgame.txt','r')\nT=int(a.readline())\nfor t in range(T):\n S=a.readline().strip()\n N=int(a.readline())\n W=set([a.readline().strip() for n in range(N)])\n print('Teddy' if mex(S,W,{},0,len(S)) else 'Tracy')\n \n", "#!/usr/bin/env python\n\ndef memo(func):\n cache = {}\n def f(*args):\n if args in cache:\n return cache[args]\n r = func(*args)\n cache[args] = r\n return r\n return f\n\ndef doit():\n s = input().strip()\n words = set([input().strip() for x in range(eval(input()))])\n @memo\n def g(start, end):\n num = set([])\n if start >= end: return 0\n for w in words:\n x = start\n while x + len(w) <= end:\n r = s.find(w, x, end)\n if r == -1:\n break\n num.add(g(start, r) ^ g(r + len(w), end))\n x = r + 1\n x = 0\n while x in num:\n x += 1\n return x\n return g(0, len(s)) > 0\n\nn = eval(input())\nfor x in range(n):\n if doit():\n print('Teddy')\n else:\n print('Tracy')\n", "#!/usr/bin/env python\n\ndef memo(func):\n cache = {}\n def f(*args):\n if args in cache:\n return cache[args]\n r = func(*args)\n cache[args] = r\n return r\n return f\n\ndef doit():\n s = input().strip()\n words = set([input().strip() for x in range(eval(input()))])\n @memo\n def g(start, end):\n num = set([])\n x = start\n while x <= end:\n y = x\n while y <= end:\n if s[x:y+1] in words:\n num.add(g(start, x-1) ^ g(y+1, end))\n y += 1\n x += 1\n x = 0\n while x in num:\n x += 1\n return x\n return g(0, len(s) - 1) > 0\n\nn = eval(input())\nfor x in range(n):\n if doit():\n print('Teddy')\n else:\n print('Tracy')\n", "D = {}\n\ndef g(s):\n if s in D: return D[s]\n \n vals = set()\n l = len(s)\n for i in range(l):\n for j in range(1, l+1 - i):\n sub = s[i : i+j]\n if sub in DIC:\n vals.add(g(s[:i]) ^ g(s[i+j:]))\n \n i = 0\n while 1:\n if not i in vals:\n break\n i += 1\n D[s] = i\n return D[s]\n\nT = int(input(\"\"))\nfor t in range(T):\n s = input(\"\")\n d_len = int(input(\"\"))\n DIC = set()\n for i in range(d_len):\n DIC.add(input(\"\"))\n D = {}\n print(\"Teddy\" if g(s) else \"Tracy\")\n"]

{"inputs": [["3", "codechef", "2", "code", "chef", "foo", "1", "bar", "mississippi", "4", "ssissi", "mippi", "mi", "ppi", "", ""]], "outputs": [["Tracy", "Tracy", "Teddy"]]}

INTERVIEW

PYTHON3

CODECHEF

2,986

efc82c6919ecc32866243fb1a55e2470

UNKNOWN

Mathison recently inherited an ancient papyrus that contained some text. Unfortunately, the text was not a pangram. Now, Mathison has a particular liking for holoalphabetic strings and the text bothers him. The good news is that Mathison can buy letters from the local store in order to turn his text into a pangram. However, each letter has a price and Mathison is not very rich. Can you help Mathison find the cheapest way to obtain a pangram? -----Input----- The first line of the input file will contain one integer, T, representing the number of tests. Each test will be formed from two lines. The first one contains 26 space-separated integers, representing the prices of all letters. The second will contain Mathison's initial text (a string of N lowercase letters). -----Output----- The output file will contain T lines, one for each test. Each line will contain the answer for the corresponding test. -----Constraints and notes----- - 1 ≤ T ≤ 10 - 1 ≤ N ≤ 50,000 - All prices are natural numbers between 1 and 1,000,000 (i.e. 106). - A pangram is a string that contains every letter of the Latin alphabet at least once. - All purchased letters are added to the end of the string. -----Subtaks----- Subtask #1 (30 points): - N = 1 Subtask #2 (70 points): - Original constraints -----Example----- Input: 2 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 abcdefghijklmopqrstuvwz 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 thequickbrownfoxjumpsoverthelazydog Output: 63 0 -----Explanation----- First test There are three letters missing from the original string: n (price 14), x (price 24), and y (price 25). Therefore the answer is 14 + 24 + 25 = 63. Second test No letter is missing so there is no point in buying something. The answer is 0.

["# cook your dish here\n# cook your dish here\nfor i in range(int(input())):\n a=list(map(int,input().split()))\n x=input()\n t=0\n for i in range(ord('a'),ord('z')+1):\n if chr(i) not in x:\n t+=a[i-97]\n print(t)", "t=int(input())\nx='abcdefghijklmnopqrstuvwxyz'\nfor i in range(t):\n a=0\n b=input().split()\n c=input()\n for j in range(len(x)):\n if(x[j] not in c):\n a=a+int(b[j])\n print(a)", "t=int(input())\nn=\"abcdefghijklmnopqrstuvwxyz\"\nfor i in range(t):\n m=0\n p=input().split()\n q=input()\n for j in range(len(n)):\n if(n[j] not in q):\n m=m+int(p[j])\n print(m)", "t=int(input())\na = \"abcdefghijklmnopqrstuvwxyz\"\nfor i in range(t):\n c=0\n p=input().split()\n s=input()\n \n for j in range(len(a)):\n if(a[j] not in s):\n c = c + int(p[j])\n print(c)\n", "# cook your dish here\nfor i in range(int(input())):\n a=list(map(int,input().split()))\n x=input()\n t=0\n for i in range(97,123):\n if chr(i) not in x:\n t+=a[i-97]\n print(t)", "# cook your dish here\nfor i in range(int(input())):\n a=list(map(int,input().split()))\n x=input()\n tot=0\n for i in range(97,123):\n if chr(i) not in x:\n tot+=a[i-97]\n print(tot)", "# cook your dish here\nfor i in range(int(input())):\n a=list(map(int,input().split()))\n x=input()\n tot=0\n for i in range(ord('a'),ord('z')+1):\n if chr(i) not in x:\n tot+=a[i-97]\n print(tot)", "# cook your dish here\nt=int(input())\nfor i in range(t):\n arr = list(map(int,input().split()))\n s=input()\n brr=list(map(chr,range(97,123)))\n count=0\n for j in range(len(brr)):\n if brr[j] in s:\n continue\n else:\n count+=arr[j]\n print(count)", "for _ in range(int(input())):\n A = list(map(int, input().split()))\n s, x = list(set(list(input()))), 0\n for c in s:\n x += A[ord(c)-97]\n print(sum(A)-x)", "import string\ncheck=string.ascii_lowercase\nfor _ in range(int(input())):\n price=0\n l=list(map(int,input().strip().split()))\n s=str(input())\n s=set(s)\n for i in range(0, len(check)):\n if check[i] not in s:\n price += l[i]\n print(price)", "# cook your dish here\nt = int(input())\nfor _ in range(t):\n price = list(map(int, input().split()))\n string = set(input())\n letters = []\n cost = 0\n for i in range(97, 123):\n if chr(i) not in string:\n cost += price[i-97]\n print(cost)\n", "t = int(input())\nfor _ in range(t):\n price = list(map(int, input().split()))\n string = set(input())\n letters = []\n cost = 0\n for i in range(97, 123):\n if chr(i) not in string:\n cost += price[i-97]\n print(cost)\n", "import bisect\nfrom collections import Counter\nfor _ in range(int(input())):\n a=list(map(int,input().split()))\n s=input()\n c=0\n for i in range(ord('a'),ord('z')+1):\n if chr(i) not in s:\n c+=a[i-97]\n print(c)\n", "for _ in range(int(input())):\n prices = list(map(int,input().split(' ')))\n s = set(input())\n total = 0\n for x in range(97,123):\n ch = chr(x)\n if ch not in s:\n total += prices[ord(ch)-97]\n print(total)\n", "# cook your dish here\ntry:\n for i in range(int(input())):\n l=list(map(int,input().strip().split()))\n s=input()\n s=list(s)\n alpha=\"abcdefghijklmnopqrstuvwxyz\"\n alpha=list(alpha)\n count=0\n for i in alpha:\n if i not in s:\n count=count+l[ord(i)-97]\n print(count)\nexcept:\n pass\n", "T = int(input())\nfor i in range(T):\n s = input()+' '\n cost = {}\n present = {}\n spend = 0\n for j in range(26):\n n = s.find(' ')\n cost[97+j] = int(s[:n])\n present[97+j] = False\n s = s[n+1:]\n s = input()\n for k in range(len(s)):\n t = ord(s[k])\n present[t] = True\n for l in range(26):\n if present[97+l] == False:\n spend += cost[97+l]\n print(spend)", "# cook your dish here\nt=int(input())\nfor i in range(t):\n alphabets='abcdefghijklmnopqrstuvwxyz'\n a=list(map(int,input().split()))\n s=input()\n c=0\n for j in alphabets:\n if j not in s:\n c+=a[ord(j)-97]\n print(c)", "import string\ns = string.ascii_lowercase\nfor _ in range(int(input())):\n arr = list(map(int, input().split()))\n s1 = input()\n total = 0\n for i in s:\n if i not in s1:\n total += arr[s.index(i)]\n s1 += i\n print(total)\n", "import string\ns = string.ascii_lowercase\nfor _ in range(int(input())):\n arr = list(map(int, input().split()))\n s1 = input()\n total = 0\n for i in s:\n if i not in s1:\n total += arr[s.index(i)]\n s1 += i\n print(total)\n"]

{"inputs": [["2", "1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26", "abcdefghijklmopqrstuvwz", "1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26", "thequickbrownfoxjumpsoverthelazydog"]], "outputs": [["63", "0"]]}

INTERVIEW

PYTHON3

CODECHEF

4,331

5b559147634fc5b25854fd1a6ec99e28

UNKNOWN

You are given a sequence of integers $A_1,A_2,…,A_N$ and a magical non-zero integer $x$ You have to select a subsegment of sequence A (possibly empty), and replace the elements in that subsegment after dividing them by x. Formally, replace any one subsegment $A_l, A_{l+1}, ..., A_r$ with $A_l/x, A_{l+1}/x, ..., A_r/x$ where $l \leq r$ What is the minimum possible sum you can obtain? Note: The given operation can only be performed once -----Input ----- - The first line of the input contains two positive integer n denoting the size of array, and x denoting the magical integer - Next line contains $N$ space separated integers -----Output----- Single line containing one real number, denoting the minimum possible sum you can obtain. Your answer will be considered correct if its absolute or relative error does not exceed $10^{-2}$ -----Constraints----- - $1 \leq n \leq 10^3$ - $1 \leq |x| \leq 10^3$ - $ |A_i| \leq 10^3$ -----Sample Input----- 3 2 1 -2 3 -----Sample Output----- 0.5 -----Explanation----- Array 1 -2 3, selecting subsegment {3}, you get 1 -2 1.5, which gives $sum=0.5$

["def solve(a,n):\n max1=curr=a[0]\n for i in range(1,n):\n curr=max(a[i],curr+a[i])\n max1=max(max1,curr)\n return max1\n \nn,k = list(map(int,input().split()))\na = list(map(int,input().split()))\nprint(sum(a)-solve(a,n)+solve(a,n)/k)\n", "# cook your dish here\ndef atharva(a:list,n:int): \n msf = mh = a[0]\n for i in range(n):\n mh = max(a[i],mh+a[i])\n msf = max(msf,mh)\n return msf\n\nn,x = map(int,input().split())\na = list(map(int,input().split()))\nsumm = sum(a)\nmax_sum = atharva(a,len(a))\nprint(summ - max_sum + max_sum/x)", "# cook your dish here\ndef atharva(a:list,n:int): \n msf = a[0]\n mh = a[0]\n for i in range(n):\n mh = max(a[i],mh+a[i])\n msf = max(msf,mh)\n return msf\n \n \nn,x = map(int,input().split())\na = list(map(int,input().split()))\nsumm = sum(a)\nmax_sum = atharva(a,len(a))\nprint(summ - max_sum + max_sum/x)", "# cook your dish here\ndef maxSubArraySum(a,size): \n \n max_so_far =a[0] \n curr_max = a[0] \n \n for i in range(1,size): \n curr_max = max(a[i], curr_max + a[i]) \n max_so_far = max(max_so_far,curr_max) \n \n return max_so_far \nn,x = map(int,input().split())\na = list(map(int,input().split()))\nt = sum(a)\nu = maxSubArraySum(a,n)\nprint(t-u+u/x)", "def maxSubArraySum(a,size): \n max_so_far,curr_max = a[0],a[0] \n for i in range(1,size): \n curr_max = max(a[i], curr_max + a[i]) \n max_so_far = max(max_so_far,curr_max) \n return max_so_far \nn,x = map(int,input().split())\na = list(map(int,input().split()))\nprint(sum(a)-maxSubArraySum(a,n)+ (maxSubArraySum(a,n)/x))", "def maxSubArraySum(a,size): \n \n max_so_far =a[0] \n curr_max = a[0] \n \n for i in range(1,size): \n curr_max = max(a[i], curr_max + a[i]) \n max_so_far = max(max_so_far,curr_max) \n \n return max_so_far \nn,x = map(int,input().split())\na = list(map(int,input().split()))\nt = sum(a)\nu = maxSubArraySum(a,n)\nprint(t-u+u/x)", "# cook your dish here\ndef func1(l):\n if(len(l)==1):\n return 0\n elif(len(l)==2):\n return l[1]-l[0]\n else:\n mid=len(l)//2\n p=l[:mid]\n q=l[mid:]\n return max(func1(p),func1(q),max(q)-min(p))\ndef func2(l):\n if(len(l)==1):\n return float('inf')\n elif(len(l)==2):\n return l[1]-l[0]\n else:\n mid=len(l)//2\n p=l[:mid]\n q=l[mid:] \n return min(func2(p),func2(q),min(q)-max(p))\nn,x=list(map(int,input().split()))\narr=list(map(int,input().split()))\nl=[0]\nfor i in arr:\n l.append(l[-1]+i)\nl.pop(0)\nif(x==1):\n print(l[-1])\nelif((1/x)-1<0):\n v=func1(l)\nelse:\n v=func2(l)\nprint(l[-1]-v+(v/x))\n\n\n\n", "# cook your dish here\nn,x=list(map(int,input().split()))\nl=list(map(int,input().split()))\nres=l[0]\ntemp=l[0]\nfor i in range(1,n):\n temp=max(l[i],temp+l[i])\n res=max(temp,res)\nprint(sum(l)-res+(res/x)) \n", "def max_possible_sum_of_subsegment(array):\n current_max=0\n maxx=0\n for j in array:\n current_max+=j\n if maxx<current_max:\n maxx=current_max\n if current_max<0:\n current_max=0\n return maxx\n\n\nn,x=list(map(int,input().split()))\nl=list(map(int,input().split()))\ntot=sum(l)\nmaxx=max_possible_sum_of_subsegment(l)\nprint(tot-(maxx)+(maxx/x))\n", "n,k=list(map(int,input().split()))\na=list(map(int,input().split()))\nsumi=0\nans=10**20\nfor i in range(len(a)):\n sumi=sum(a)\n for j in range(i,len(a)):\n sumi=(sumi-a[j])+(a[j]/k)\n ans=min(ans,sumi)\nprint(ans)\n", "n,k=list(map(int,input().split()))\na=list(map(int,input().split()))\nsumi=0\nans=10**20\nfor i in range(len(a)):\n sumi=sum(a)\n for j in range(i,len(a)):\n sumi=(sumi-a[j])+(a[j]/k)\n ans=min(ans,sumi)\nprint(ans)\n", "n,x=map(int,input().split())\na=list(map(int,input().split()))\nb=[]\ni=0\nwhile(i<n):\n j=i+1\n while(j<=n):\n b.append([sum(a[i:j]),i,j])\n j+=1\n i+=1 \nb.sort()\nl=len(b)\nv=b[l-1][1]\ny=b[l-1][2]\nz=b[l-1][0]\nprint(float(sum(a[0:v])+sum(a[y:n])+(z/x)))", "n,m=list(map(int,input().split()))\nl=list(map(int,input().split()))\ninc,enc=0,0\nfor i in range(0,len(l)):\n inc=max(l[i],inc+l[i])\n enc=max(enc,inc)\nresult=sum(l)-enc\nprint(result+enc/m)\n", "# cook your dish here\nn,x=list(map(int,input().split()))\na=list(map(int,input().split()))\ntotal=sum(a)\ncurrent_max=a[0]\ntotal_max=a[0]\nfor i in range(1,len(a)):\n current_max=max(a[i],current_max+a[i])\n total_max=max(total_max,current_max)\nprint(total-total_max+(total_max/x))\n\n\n\n\n\n \n", "n,k=list(map(int,input().split()))\nl=list(map(int,input().split()))\ni=0\nx=sum(l)\nd=x\nm=0\nfor i in range(n):\n c=0\n for j in range(i,n):\n c+=l[j]\n m=max(c,m)\nd-=m\nd+=m/k\n \n \n\nprint(d)\n \n \n \n", "# cook your dish here\nn,x=map(int,input().split())\nl=list(map(int,input().split()))\nans=l[0]\ntemp=l[0]\nfor i in range(1,n):\n temp=max(l[i],temp+l[i])\n ans=max(temp,ans)\nprint(sum(l)-ans+(ans/x))", "n,x=list(map(int,input().split()))\na=list(map(int,input().split()))\nmaxi=a[0]\np=0\nfor i in range (n):\n sumi=a[i]\n if (sumi>maxi):\n maxi=sumi \n \n for j in range (i+1,n):\n sumi+=a[j]\n if (i==0):\n p+=a[j]\n if (sumi>maxi):\n maxi=sumi\n \n if (sumi>maxi):\n maxi=sumi \n \np+=a[0]\n\nprint(p-maxi+maxi/x)\n", "n,x=list(map(int,input().split()))\na=list(map(int,input().split()))\nmini,maxi=a[0],a[0]\np=0\nfor i in range (n):\n sumi=a[i]\n if (sumi>maxi):\n maxi=sumi \n if (sumi<mini):\n mini=sumi \n for j in range (i+1,n):\n sumi+=a[j]\n if (i==0):\n p+=a[j]\n if (sumi>maxi):\n maxi=sumi\n if (sumi<mini):\n mini=sumi\n if (sumi>maxi):\n maxi=sumi \n if (sumi<mini):\n mini=sumi \np+=a[0]\n\nprint(min((p-maxi+maxi/x),(p-mini+mini/x)))\n", "def get_the_largest_contiguous_subarray_sum(A,N):\n\n max_sum_so_far=0\n max_sum_ending_here=0\n\n for i in range(N):\n max_sum_ending_here+=A[i]\n\n if max_sum_ending_here<0:\n max_sum_ending_here=0\n else:\n max_sum_so_far=max(max_sum_so_far,max_sum_ending_here)\n\n return max_sum_so_far\n\n\nN,x=list(map(int,input().split()))\nA=list(map(int,input().split()))\narray_sum=sum(A)\nmax_subarray_sum=get_the_largest_contiguous_subarray_sum(A,N)\nprofit=max_subarray_sum-(max_subarray_sum/x)\nmin_sum_possible=array_sum-profit\nprint(min_sum_possible)"]

{"inputs": [["3 2", "1 -2 3"]], "outputs": [["0.5"]]}

INTERVIEW

PYTHON3

CODECHEF

6,071

083f112be5923fa90736ee3b5f37cf76

UNKNOWN

You are given a string $S$. Find the number of ways to choose an unordered pair of non-overlapping non-empty substrings of this string (let's denote them by $s_1$ and $s_2$ in such a way that $s_2$ starts after $s_1$ ends) such that their concatenation $s_1 + s_2$ is a palindrome. Two pairs $(s_1, s_2)$ and $(s_1', s_2')$ are different if $s_1$ is chosen at a different position from $s_1'$ or $s_2$ is chosen at a different position from $s_2'$. -----Input----- The first and only line of the input contains a single string $S$. -----Output----- Print a single line containing one integer — the number of ways to choose a valid pair of substrings. -----Constraints----- - $1 \le |S| \le 1,000$ - $S$ contains only lowercase English letters -----Subtasks----- Subtask #1 (25 points): $|S| \le 100$ Subtask #2 (75 points): original constraints -----Example Input----- abba -----Example Output----- 7 -----Explanation----- The following pairs of substrings can be chosen: ("a", "a"), ("a", "ba"), ("a", "bba"), ("ab", "a"), ("ab", "ba"), ("abb", "a"), ("b", "b").

["def binarySearch(arr, l, r, x):\n mid=0\n while l <= r: \n mid = l + (r - l)//2; \n if arr[mid] == x: \n return mid+1 \n elif arr[mid] < x: \n l = mid + 1\n else: \n r = mid - 1\n if mid!=len(arr):\n if arr[mid]<x:\n return mid+1\n return mid\ns=input()\nstrt=[]\nend=[]\nplc=[]\nlandr=[]\nl2r=[]\nlr=[]\nans=0\nn=len(s)\nif n!=1:\n for i in range(n):\n strt.append([])\n end.append([])\n landr.append([0]*n)\n l2r.append([0]*n)\n for i in range(n): \n for j in range(n):\n if i-j<0 or i+j>=n:\n break\n if (s[i-j]==s[i+j]):\n if i-j-1>=0:\n strt[i-j-1].append(2*j+1)\n if i+j+1<n:\n end[i+j+1].append(2*j+1)\n else:\n break\n for i in range(n):\n for j in range(n):\n if i-j<0 or i+j+1>=n:\n break\n if (s[i-j]==s[i+j+1]):\n if i-j-1>=0:\n strt[i-j-1].append(2*j+2)\n if i+j+2<n:\n end[i+j+2].append(2*j+2)\n else:\n break\n for i in range(n):\n end[i].sort()\n strt[i].sort()\n for i in range(n-1):\n for j in range(i+1,n):\n if s[i]==s[j]:\n lr.append([i,j])\n if i>0 and j<n-1:\n landr[i][j]=landr[i-1][j+1]+1\n else:\n landr[i][j]=1\n for i in lr:\n tempans=1\n l=i[0]\n r=i[1]\n length=r-l-1\n tempans+=binarySearch(strt[l],0,len(strt[l])-1,length)\n tempans+=binarySearch(end[r],0,len(end[r])-1,length)\n l2r[l][r]=tempans\n for i in range(n):\n for j in range(n):\n ans+=l2r[i][j]*landr[i][j]\nprint(ans)", "import sys,math\nfrom sys import stdin,stdout\n\n\ns=stdin.readline().strip()\n\nispalin=[[0 for i in range(len(s)+1)] for i in range(len(s)+1)]\nsuff=[[-1 for i in range(len(s)+1)] for i in range(len(s)+1)]\npref=[[-1 for i in range(len(s)+1)] for i in range(len(s)+1)]\nlcp=[[0 for i in range(len(s)+1)] for i in range(len(s)+1)]\n\nfor i in range(0,len(s)):\n ispalin[i][i]=1;pref[i][i]=1;suff[i][i]=1\n ispalin[i][i+1]=1;pref[i][i+1]=2;suff[i][i+1]=2\n\n#for i in ispalin:\n #print(i)\n\nfor l in range(2,len(s)+1):\n for i in range(0,len(s)-l+1):\n #print(i,i+l-1,s[i],s[i+l-1])\n ispalin[i][i+l]=ispalin[i+1][i+l-1]*int(s[i]==s[i+l-1])\n pref[i][i+l]=pref[i][i+l-1]+ispalin[i][i+l]\n suff[i][i+l]=suff[i+1][i+l]+ispalin[i][i+l]\n\nfor i in range(len(s)):\n for j in range(i+1,len(s)):\n lcp[i][j]=(lcp[i-1][j+1]+1)*int(s[i]==s[j])\n\n#\n\nans=0\n\nfor i in range(1,len(s)):\n for j in range(i,len(s)):\n #if lcp[i-1][j]!=0:\n #print(i,j,lcp[i-1][j],suff[i][j],pref[i][j],s[0:i],s[i:j],s[j:])\n ans+=(lcp[i-1][j]*(suff[i][j]+pref[i][j]-1))\n#\nstdout.write(str(ans))\n\n\n", "# cook your dish here\nst = str(input())\n\ndef checkpal(i,j,k,l):\n \n a=i\n b=l\n while(a<b):\n if st[a] != st[b]:\n \n return -1\n \n if(a==j):\n a = k-1\n if(b==k):\n b = j+1\n\n a+=1\n b-=1 \n # print(i,j,k,l)\n # print(\"yes\")\n return 1\n\nl = len(st)\ncount = 0\nfor i in range(l):\n for j in range(i,l):\n for k in range(j+1,l):\n for m in range(k,l):\n if checkpal(i,j,k,m) == 1: \n count += 1\n \nprint(count)", "def palSub(s,n,isPal):\n for gap in range(n):\n for i in range(n-gap):\n j = i + gap\n if(gap == 0):\n isPal[i][j] = 1\n elif(gap == 1):\n isPal[i][j] = 1 if(s[i] == s[j]) else 0\n else:\n isPal[i][j] = 1 if(s[i] == s[j] and isPal[i+1][j-1]) else 0\n return isPal\ndef case1(n,isPal,c1):\n for i in range(n):\n for j in range(i,n):\n if(i == j):\n c1[i][j] = 1\n else:\n c1[i][j] = c1[i][j-1] + isPal[i][j]\n return c1\ndef case2(n,isPal,c2):\n for j in range(n-1,-1,-1):\n for i in range(j,-1,-1):\n if(i == j):\n c2[i][j] = 1\n else:\n c2[i][j] = c2[i+1][j] + isPal[i][j]\n return c2\ndef getSub(s,n,c1,c2,res):\n for gap in range(n):\n for i in range(n-gap):\n j = i + gap\n if(gap == 0):\n res[i][j] = 0\n elif(gap == 1):\n res[i][j] = 1 if(s[i] == s[j]) else 0\n elif(s[i] == s[j]):\n res[i][j] = 1 + c1[i+1][j-1] + c2[i+1][j-1] + res[i+1][j-1]\n return res\ndef __starting_point():\n s = input()\n n = len(s)\n isPal = [[0 for x in range(n)]for y in range(n)]\n isPal = palSub(s,n,isPal)\n c1 = [[-1 for x in range(n)]for y in range(n)]\n c2 = [[-1 for x in range(n)]for y in range(n)]\n c1 = case1(n,isPal,c1)\n c2 = case2(n,isPal,c2)\n res = [[0 for x in range(n)]for y in range(n)]\n res = getSub(s,n,c1,c2,res)\n mycount = 0\n for i in range(n):\n for j in range(n):\n mycount += res[i][j]\n print(mycount)\n__starting_point()"]

{"inputs": [["abba"]], "outputs": [["7"]]}

INTERVIEW

PYTHON3

CODECHEF

4,367

cd3ca4fc18a421c0037cdc03e29f0b7d

UNKNOWN

Chef is playing a game on the non-negative x-axis. It takes him $1$ second to reach from $i^{th}$ position to $(i-1)^{th}$ position or $(i+1)^{th}$ position. The chef never goes to the negative x-axis. Also, Chef doesn't stop at any moment of time. The movement of chef can be described as follows. - At the start he is standing at $x=0$ at time $0$. - In the first round, he moves towards $x=1$ and comes back to the $x=0$ position. - In the second round, he moves towards the $x=2$ and comes back again to $x=0$. - Generalizing, in the $k^{th}$ round, he moves from $x=0$ to $x=k$ and then returns back to $x=0$ at the end of the round. This goes on as the game progresses. For Example, the path of Chef for $3^{rd}$ round is given below. $0 - 1 - 2 - 3 - 2 - 1 - 0$ The overall path followed by Chef would look somewhat like this: $0 - 1 - 0 - 1 - 2 - 1 - 0 - 1 - 2 - 3 - 2 - 1 - 0 - 1 - 2 - 3 - 4 - 3 - …$ You are given two non-negative integers $N$ and $K$. You have to tell the time at which Chef arrives at $x=N$ for the $K^{th}$ time. Note - Chef can not skip a position while visiting the positions. -----Input:----- - The first line contains $T$ the number of test cases. Then the test cases follow. - Each test case contains a single line of two integers $N$ and $K$. -----Output:----- For each test case, print a single line containing one integer -- the time taken by the chef to arrive at $x=N$ for the $K^{th}$ time by modulo $1,000,000,007$. -----Constraints----- - $1 \le T \le 10^5$ - $0 \le N \le 10^9$ - $1 \le K \le 10^9$ -----Sample Input:----- 5 0 1 1 1 2 1 1 3 4 6 -----Sample Output:----- 0 1 4 5 46 -----Explanation:----- Test Case 1: Chef starts the journey from the $N = 0$ at time $t = 0$ and it's the first time $(K = 1)$, he is here. So, the answer is $0$. Test Case 2: Chef starts the journey from the $N = 0$ at time $t = 0$ then goes to $N = 1$ at $t = 1$ and it's the first time $(K = 1)$, he is here. So, the answer is $1$. Test Case 4: The path followed by Chef to reach $1$ for the third time is given below. $0 - 1 - 0 - 1 - 2 - 1$ He reaches $1$ for the third time at $t=5$.

["import sys\nfrom random import choice,randint\ninp=sys.stdin.readline\nout=sys.stdout.write\nflsh=sys.stdout.flush\n \nsys.setrecursionlimit(10**9)\ninf = 10**20\neps = 1.0 / 10**10\nmod = 10**9+7\ndd = [(-1,0),(0,1),(1,0),(0,-1)]\nddn = [(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]\n \ndef MI(): return map(int, inp().strip().split())\ndef LI(): return list(map(int, inp().strip().split()))\ndef LLI(): return [list(map(int, l.split())) for l in sys.stdin.readlines().strip()]\ndef LI_(): return [int(x)-1 for x in inp().strip().split()]\ndef LF(): return [float(x) for x in inp().strip().split()]\ndef LS(): return inp().strip().split()\ndef I(): return int(inp().strip())\ndef F(): return float(inp().strip())\ndef S(): return inp().strip()\ndef pf(s): return out(s+'\\n')\ndef JA(a, sep): return sep.join(map(str, a))\ndef JAA(a, s, t): return s.join(t.join(map(str, b)) for b in a)\n\ndef main():\n from math import ceil\n t = I()\n l = []\n for _ in range(t):\n n,k=MI()\n if n==0:\n k-=1\n ans = ((k)*((k+1)))%mod\n l.append(ans)\n else:\n # if k==1:\n # ans = ((((n)*((n-1)))%mod)+ n%mod)%mod\n # l.append(ans)\n # else:\n # k-=1\n # lr = (n%mod+((ceil(k/2)%mod))%mod\n # ans = ((lr*((lr-1))%mod\n # if k%2!=0:\n # ans= (ans%mod + n%mod)%mod\n # else:\n # ans = ((ans%mod)+((lr+n)%mod))%mod\n # l.append(ans)\n if k%2!=0:\n lr = k//2\n l.append(((n*n)%mod+(lr*((2*n)%mod))%mod+(lr*(lr+1))%mod)%mod)\n else:\n lr = k//2\n l.append(((n*n)%mod + (lr*(2*n)%mod)%mod + (lr*(lr-1))%mod)%mod)\n\n for i in range(t):\n pf(str(l[i]))\n\ndef __starting_point():\n main()\n__starting_point()", "for i in range(int(input())):\n n,k = list(map(int,input().split())) \n if n==0 and k==1 :\n print(0)\n \n elif n==0:\n print((k*(k-1))%q)\n else:\n m = n+1\n q= 10**9+7\n if k%2 ==0:\n m+=k//2-1\n print((m**2+n-m)%q)\n else:\n m+=(k+1)//2-1\n print((m**2-n-m)%q)\n \n", "for _ in range(int(input())):\r\n n,k = list(map(int,input().split()))\r\n if n == 0:\r\n print((k*(k-1))%1000000007)\r\n elif k == 1:\r\n print((n**2)%1000000007)\r\n else:\r\n turn = (k//2)\r\n point = turn + n\r\n if k%2 == 0:\r\n print((point**2 - turn)%1000000007)\r\n else:\r\n print((point**2 + turn)%1000000007)\r\n \r\n \r\n \r\n \r\n \r\n \r\n", "try:\n t=int(input())\n for _ in range(t):\n a,b=map(int,input().split())\n if(a==0):\n print(((b-1)*b)%1000000007)\n else:\n c=b%2\n if(c==0):\n x=(b-2)//2\n ans=(a+x)*(a+x+1)+a\n print(ans%1000000007)\n else:\n x=b//2\n ans=(a+x-1)*(a+x)\n ans=(ans+a+2*x)\n print(ans%1000000007)\nexcept:\n pass", "for _ in range(int(input())):\n n,k = map(int,input().split()) ; m =(10**9)+7\n if n==0:\n if k==1:\n print(0)\n else:\n print((k*(k-1))%m)\n else:\n if k==1:\n print((n*(n-1)+n)%m)\n elif k%2:\n x = n+((k-1)//2)\n print((x*(x+1)-n)%m)\n else:\n x = (n+(k//2))\n print((x*(x-1)+n)%m)", "t = int(input().strip())\nm = 1000000007\nfor _ in range(t):\n n,k = [int(x) for x in input().strip().split()]\n if n==0:\n ans = (k*(k-1))%m\n elif k%2==0:\n ans = ((n*n)%m + (k*n)%m + (((k)*(k-2))//4)%m)%m\n else:\n ans = ((n*n)%m + ((k-1)*n)%m + (((k+1)*(k-1))//4)%m)%m\n print(ans)", "# cook your dish here\ntry:\n t=int(input())\n for _ in range(t):\n x,y=map(int,input().split())\n if(x==0):\n print(((y-1)*y)%1000000007)\n else:\n inc=y%2\n if(inc==0):\n cir=(y-2)//2\n a=(x+cir)*(x+cir+1)+x\n print(a%1000000007)\n else:\n cir=y//2\n a=(x+cir-1)*(x+cir)\n a=(a+x+2*cir)\n print(a%1000000007)\nexcept:\n pass", "for t in range(int(input())):\n n,k=map(int,input().split())\n mod=10**9+7\n if n==0:\n if k==1:\n print(0)\n else:\n print(k*(k-1)%mod)\n else:\n if k%2==0:\n a=n+k//2-1\n print((a*(a+1)+n)%mod)\n else:\n a=n+k//2 \n print((a*(a+1)-n)%mod)", "'''input\r\n6\r\n0 1\r\n1 1\r\n2 1\r\n1 3\r\n4 6\r\n4 100\r\n'''\r\nfrom bisect import bisect_left as bl, bisect_right as br\r\nfrom collections import defaultdict as dd\r\nmod=10**9+7\r\n\r\nfor _ in range(int(input())):\r\n\r\n #n=int(input())\r\n n,k=list(map(int,input().strip().split()))\r\n if(k==1):\r\n sm=pow(n,2,mod)\r\n print(sm)\r\n continue\r\n elif(n==0):\r\n sm=k*(k-1)\r\n print(sm%mod)\r\n continue\r\n else:\r\n sm=(n*(n+1))%mod\r\n\r\n\r\n y=(k-1)/2\r\n q=y\r\n if(int(y)==y):\r\n y=max(0,int(y)-1)\r\n rem=2\r\n else:\r\n y=int(y)\r\n rem=1\r\n \r\n sm+=(2*y*n)%mod+(y*(y+1))%mod\r\n #print(sm,\"**\")\r\n\r\n if(rem==1):\r\n sm+=n\r\n else:\r\n sm+=2*(n+y+1)-n\r\n\r\n print(sm%mod)\r\n\r\n\r\n\r\n", "# cook your dish here\nmd=1000000007\nfor tst in range(int(input())):\n n,k = [int(x) for x in input().split()]\n if(n==0):\n ans=(k*(k-1))%md\n print(ans)\n continue\n z=0\n if (k&1):\n z=1\n g=(k//2)+n\n ans=((g+1)*g)\n if(z):\n ans=(ans-n)%md\n else:\n ans=(ans-g-g+n)%md\n print(ans)", "# cook your dish here\ntry:\n t=int(input())\n for _ in range(t):\n a,b=map(int,input().split())\n if(a==0):\n print(((b-1)*b)%1000000007)\n else:\n inc=b%2\n if(inc==0):\n cir=(b-2)//2\n ans=(a+cir)*(a+cir+1)+a\n print(ans%1000000007)\n else:\n cir=b//2\n ans=(a+cir-1)*(a+cir)\n ans=(ans+a+2*cir)\n print(ans%1000000007)\nexcept:\n pass", "for i in range(int(input())):\n n,k=map(int,input().split())\n if(n!=0):\n d=(k-1)//2\n z=n**2+(k//2)*(2*n)+d*(d+1)\n z=z%(10**9+7)\n print(z)\n else:\n z=k*(k-1)\n z=z%(10**9+7)\n print(z)", "import math\r\nmod=(10**9)+7\r\nT=int(input())\r\nfor _ in range(T):\r\n N,K=list(map(int,input().split()))\r\n if (N==0):\r\n print(((K*(K-1)))%mod)\r\n else:\r\n pos=(math.ceil((K-1)/2)+N)\r\n if ((K)%2==0 or K==1):\r\n et=N\r\n else:\r\n et=pos+pos-N\r\n t=((pos*(pos-1))+et)%mod\r\n print(t%mod)\r\n", "t=int(input())\nfor hh in range(0,t):\n n,k=[int(x) for x in input().split()]\n # 2 3\n m=1000000007\n pos=n\n if(n==0):\n rem=k-1\n cur=(rem*(rem+1))%m\n print(cur)\n elif(k==1):\n prev=(pos*(pos-1))%m\n curr=(prev+pos)%m\n print(curr)\n else:\n # if(k%2==1):\n # p=k//2\n # # p=1\n # inipos=pos\n # pos=pos+p-1\n # prev=pos*(pos+1)\n # print(prev,pos)\n # curr=prev+inipos\n # print(curr)\n # else:\n # p=k//2 -1 \n # inipos=pos\n # # pos=4 k = 6 p=2\n # pos=pos+p-1\n # prev=pos*(pos+1)\n # now=inipos+p\n # rem=now-inipos\n # print(prev,now,pos,p,rem)\n # curr=prev+now+rem\n # print(curr)\n if(k%2==1):\n k-=1\n p=k//2\n # p=1\n ans=2*pos\n inipos=pos\n # pos=4 k = 6 p=2\n pos=(pos+p-1)%m\n prev=(pos*(pos+1))%m\n now=(inipos+p)%m\n rem=(now-inipos+m)%m\n # print(prev,now,pos,p,rem)\n curr=(prev+now+rem)%m\n print(curr)\n else:\n k-=1\n p=k//2\n # p=1\n # pos =4 k =6 k=5 p=2\n inipos=pos\n pos=(pos+p)%m\n prev=(pos*(pos+1))%m\n # print(prev,pos)\n curr=(prev+inipos)%m\n print(curr)", "# cook your dish here\nt=int(input())\nM=1000000007\nfor z in range(t):\n N,K=list(map(int,input().split()))\n if N==0:\n K=K-1\n t=(K*(K+1))%M\n print(t)\n continue\n if K%2==0:\n s=N+K//2-1\n t=((s*(s+1))%M+N)%M\n else:\n s=N+K//2\n t=((s*(s+1))%M-N)%M\n print(t)", "for i in range(int(input())):\n n,k=map(int,input().split())\n if(n!=0):\n d=(k-1)//2\n z=n**2+(k//2)*(2*n)+d*(d+1)\n z=z%(10**9+7)\n print(z)\n else:\n z=k*(k-1)\n z=z%(10**9+7)\n print(z)", "from math import *\r\nt=int(input())\r\np=1000000007\r\nwhile(t):\r\n t-=1\r\n x,k=list(map(int,input().split()))\r\n y=ceil(k/2)\r\n if(x==0):\r\n if(k==1):\r\n print(0)\r\n continue\r\n k-=1\r\n y=(k*(k+1))\r\n y=y//2\r\n y=y*2\r\n print(y%p)\r\n continue\r\n if(k==1):\r\n print((x*x)%p)\r\n elif(k==2):\r\n z=x*x\r\n z+=2*x\r\n print(z%p)\r\n elif(k%2):\r\n minus=(x*(x+1))\r\n minus=minus//2\r\n fi=x*x\r\n y=x+(k//2)\r\n fac=((y*(y+1))//2)\r\n fac-=minus\r\n fac=fac*2\r\n fi+=fac\r\n print(fi%p)\r\n else:\r\n minus=(x*(x+1))\r\n minus=minus//2\r\n # print(minus)\r\n se=(x*x)+(2*x)\r\n y=x+((k-1)//2)\r\n fac=((y*(y+1))//2)\r\n #print(fac)\r\n fac-=minus\r\n fac=fac*2\r\n se+=fac\r\n print(se%p)\r\n\r\n \r\n", "from math import *\r\nt=int(input())\r\np=10**9+7\r\nfor i in range(t):\r\n \r\n \r\n n,k=list(map(int,input().split()))\r\n ans=(n+ceil((k-1)/2))%p\r\n r=ans\r\n \r\n ans=(((((ans+1)*(ans))//2)*2))%p\r\n \r\n \r\n if(k==0):\r\n print(0)\r\n continue\r\n k=k-1\r\n if(n==0):\r\n print((((k*(k+1))//2)*2)%p)\r\n continue\r\n\r\n if(k!=0):\r\n if(k%2==0):\r\n ans=ans-(r-(r-n))\r\n \r\n else:\r\n ans=ans-r-(r-n)\r\n else:\r\n ans=ans-r\r\n print(ans%p)\r\n", "# cook your dish here\nt=int(input())\nfor i in range(t):\n a,b=input().split()\n a,b=int(a),int(b)\n if a==0:\n b=b*2\n ans=pow(a,2)+int(b/2)*2*a+pow(int(b/2)-1,2)+int(b/2)-1\n if b%2!=0:\n ans=ans+b-1\n print(ans%1000000007)", "def solve(n,k):\r\n ans=0\r\n if n==0:\r\n if k==1:\r\n return 0\r\n else:\r\n ans=(k-1) * (k)\r\n return ans%1000000007\r\n if k==1:\r\n return (n*n)%1000000007\r\n if k%2==0:\r\n ans= n*n + n*k + int(int((k-1)/2) * int((k-1)/2 + 1))\r\n if k%2!=0:\r\n ans= n*n + (2*n)*(max(0,int((k-1)/2))) + int(int((k-1)/2) * int((k-1)/2 + 1))\r\n return ans%1000000007\r\n\r\nt=int(input())\r\nfor qw in range(t):\r\n n,k=list(map(int, input().split()))\r\n print(solve(n,k))\r\n", "for t in range(int(input())):\n n,k=map(int,input().split())\n mod=10**9+7\n if n==0:\n if k==1:\n print(0)\n else:\n print(k*(k-1)%mod)\n else:\n if k%2==0:\n a=n+k//2-1\n print((a*(a+1)+n)%mod)\n else:\n a=n+k//2 \n print((a*(a+1)-n)%mod)", "import math\r\nfor _ in range(int(input())):\r\n n, k = list(map(int, input().split()))\r\n t = math.floor(k/2)\r\n r = n + t\r\n s = r*(r+1)\r\n if k % 2 == 1:\r\n s -= n\r\n else:\r\n s = s - r\r\n s = s - t\r\n if n == 0:\r\n k = k - 1 \r\n s = int(k*(k+1))\r\n print(s % 1000000007)\r\n", "# cook your dish here\nimport sys\nmsg = sys.stdin.readlines()\n\nl=[]\n\nfor i in msg:\n l.append (list (map (int, i.split())))\n \nsm = lambda x: int(x*(x+1)*1)\n\ndef timew (n, k):\n if n==0:\n time = sm(k-1)\n else:\n if k == 1:\n time = (n-1)*(n) + n\n else:\n if k%2==1:\n pre_rounds = (k-1)//2\n time = sm(n+pre_rounds-1) + n + 2*(pre_rounds)\n else:\n pre_rounds = (k)//2\n time = sm(n+pre_rounds-1) + n\n return time%1000000007\n \nfor i in l[1:]:\n [n, k] = i\n print(timew (n, k))", "#This code sucks, you know it and I know it. \n#Move on and call me an idiot later.\n\nt = int(input())\nwhile t:\n\tn, k = map(int, input().split())\n\tx = k // 2\n\t\n\tif(n == 0):\n\t\tprint(k * (k-1) % 1000000007)\n\telse:\n\t\tif(k%2 == 0):\n\t\t\tprint(((n + x)*(n + x) - x) % 1000000007)\n\t\telse:\n\t\t\tprint(((n + x)*(n + x) + x) % 1000000007)\n\tt -= 1"]

{"inputs": [["5", "0 1", "1 1", "2 1", "1 3", "4 6"]], "outputs": [["0", "1", "4", "5", "46"]]}

INTERVIEW

PYTHON3

CODECHEF

13,497

0232f2731d017d78d773236f6488dcf7

UNKNOWN

Chef Ada is building a new restaurant in the following way: - First, $N$ points $X_1, X_2, \ldots, X_N$ are chosen on the $x$-axis. - Then, $N$ columns (numbered $1$ through $N$) are made. For simplicity, the columns are represented as vertical segments; for each valid $i$, the height of the $i$-th segment is $H_i$. - Ada assigns a column to each of the points $X_1, X_2, \ldots, X_N$ in an arbitrary way (each column must be assigned to exactly one point). - Finally, Ada constructs the roof of the restaurant, represented by a polyline with $N$ vertices. Let's denote the column assigned to the $i$-th point by $P_i$. For each valid $i$, the $i$-th of these vertices is $(X_i, H_{P_i})$, i.e. the polyline joins the tops of the columns from left to right. Ada wants the biggest restaurant. Help her choose the positions of the columns in such a way that the area below the roof is the biggest possible. Formally, she wants to maximise the area of the polygon whose perimeter is formed by the roof and the segments $(X_N, H_{P_N}) - (X_N, 0) - (X_1, 0) - (X_1, H_{P_1})$. Let $S$ be this maximum area; you should compute $2 \cdot S$ (it is guaranteed that $2 \cdot S$ is an integer). -----Input----- - The first line of the input contains a single integer $T$ denoting the number of test cases. The description of $T$ test cases follows. - The first line of each test case contains a single integer $N$. - $N$ lines follow. For each valid $i$, the $i$-th of these lines contains two space-separated integers $X_i$ and $H_i$. -----Output----- For each test case, print a single line containing one integer $2 \cdot S$. -----Constraints----- - $1 \le T \le 3 \cdot 10^5$ - $2 \le N \le 10^5$ - $0 \le X_1 < X_2 < \ldots < X_N \le 2 \cdot 10^9$ - $1 \le H_i \le 10^9$ for each valid $i$ - the sum of $N$ over all test cases does not exceed $10^6$ -----Example Input----- 1 5 1 1 2 2 3 3 4 4 5 5 -----Example Output----- 27 -----Explanation-----

["# cook your dish here\nt = int(input())\nfor _ in range(t):\n n = int(input())\n a = []\n b = []\n for i in range(n):\n x,y = list(map(int, input().split()))\n a.append(x)\n b.append(y)\n b.sort()\n xcor = []\n xcor.append(a[1]-a[0])\n xcor.append(a[n-1]-a[n-2])\n for i in range(1,n-1):\n xcor.append(a[i+1]-a[i-1])\n xcor.sort()\n ans = 0\n #print(xcor)\n #print(b)\n for i in range(n):\n ans = ans + xcor[i]*b[i]\n print(ans) \n", "t=int(input())\nwhile(t):\n t-=1\n n=int(input())\n x = []\n h = []\n for i in range (n):\n xi,hi = [int(i) for i in input().split()]\n x.append(xi)\n h.append(hi)\n diff = [x[1]-x[0],x[n-1]-x[n-2]]\n for i in range (1,n-1):\n diff.append(x[i+1]-x[i-1])\n diff.sort()\n h.sort()\n ans = 0\n for i in range (n):\n ans+=h[i]*diff[i]\n print(ans)", "# cook your dish here\nfor _ in range(int(input())):\n n = int(input())\n xloli=[]\n hloli=[]\n d1=[]\n d2=[]\n for i in range(n):\n (x,h)=(int(x) for x in input().split())\n xloli.append(x)\n hloli.append(h)\n for i in range(1,n):\n d1.append(xloli[i]-xloli[i-1])\n d2.append(d1[0])\n for i in range(n-2):\n d2.append(d1[i+1]+d1[i])\n d2.append(d1[-1])\n kaori=0\n hloli.sort()\n d2.sort()\n for i in range(n):\n kaori+=hloli[i]*d2[i]\n print(kaori)\n", "t=int(input())\nfor i in range(t):\n n=int(input())\n xl=[]\n hl=[]\n for j in range(n):\n x,h=list(map(int,input().strip().split()))\n xl.append(x)\n hl.append(h)\n a=[0 for j in range(n)]\n a[0]=xl[1]-xl[0]\n for j in range(1,n-1):\n a[j]=xl[j+1]-xl[j-1]\n a[n-1]=xl[n-1]-xl[n-2]\n a.sort()\n hl.sort()\n sum=0\n for j in range(n):\n sum+=a[j]*hl[j]\n print(sum)\n", "t = int(input())\nfor _ in range(t):\n n = int(input())\n a, b = [], []\n for _ in range(n):\n x, h = input().split()\n a.append(int(x))\n b.append(int(h))\n a = [y - x for x, y in zip(a, a[1:])]\n a = sorted(x + y for x, y in zip([0] + a, a + [0]))\n print(sum(x * y for x, y in zip(a, sorted(b))))", "def find(X,H):\n if len(X) == 2:\n return (X[1]-X[0])*(sum(H))\n \n X = sorted(X)\n W = []\n for i in range(1,len(H)-1):\n W += [X[i+1]-X[i-1]]\n W += [X[1]-X[0]]\n W += [X[-1]-X[-2]]\n W = sorted(W)\n H = sorted(H)\n return sum([W[i]*H[i] for i in range(len(W))])\n\nfor _ in range(int(input())):\n N = int(input())\n X = []\n H = []\n for i in range(N):\n x,h = list(map(int,input().strip().split()))\n X += [x]\n H += [h]\n print(find(X,H))", "'''a,b,c=map(int,input().split())\nif a-b>>31 and a-c>>31:\n print(a)\nelif b-c>>31 and b-a>>31:\n print(b)\nelse:\n print(c)'''\n\n\n\n#*******************************************************************************\u00a0\u00a0\u00a0\u00a0************************\n\n\n'''n=int(input())\nc=0\na=[i for i in range(1,n+1)]\nfor i in range(n-1):\n for j in range(i,n):\n if a[i]^a[j]>n:\n c+=1\n print('('+str(i+1)+','+str(j+1)+')')\nprint(c)'''\n\n\n#*******************************************************************************\u00a0\u00a0\u00a0\u00a0***************************\n\n\n'''l=[0 for i in range(64)]\na=[str(i) for i in range(10)]+[chr(j) for j in range(65,91)]+[chr(k) for k in \u00a0\u00a0\u00a0\u00a0range(97,123)]+['-','_']\n\nfor i in range(64):\n count=0\n for j in range(64):\n if i&j==i:\n count+=1\n l[i]=2*count-1\nprint(l)\n\nfor _ in range(int(input())):\n s=input()\n res=1\n for i in s:\n res*=l[a.index(i)]\n print(res%1000000007)'''\n\n\n\n#*******************************************************************************\u00a0\u00a0\u00a0\u00a0*****************************\n\nfor _ in range(int(input())):\n n=int(input())\n X=[0 for i in range(n)]\n H=[0 for i in range(n)]\n for i in range(n):\n x,h=list(map(int,input().split()))\n X[i]=x\n H[i]=h\n X1=[0 for i in range(n)]\n for i in range(n-2):\n X1[i]=X[i+2]-X[i]\n X1[n-2],X1[n-1]=X[1]-X[0],X[n-1]-X[n-2]\n X1.sort()\n H.sort()\n res=0\n for i in range(n):\n res+=X1[i]*H[i]\n print(res)\n", "for _ in range(int(input())):\n n=int(input())\n x=[]\n p=[]\n for j in range(n):\n a,b=list(map(int,input().split()))\n x.append(a)\n p.append(b)\n differences=[]\n for u in range(n-1,1,-1):\n differences.append(x[u]-x[u-2])\n differences.append(x[-1]-x[-2])\n differences.append(x[1]-x[0])\n differences.sort()\n p.sort()\n answer=0\n while(len(differences)>0):\n answer=answer+(p.pop()*differences.pop())\n print(answer)\n", "# cook your dish here\nfor i in range(int(input())):\n n=int(input())\n arr1=[]\n arr2=[]\n for i in range(n):\n l=input().split()\n arr1.append(int(l[0]))\n arr2.append(int(l[1]))\n arr1.append(arr1[-1])\n arr1.insert(0,arr1[0])\n arr2.sort()\n base=[]\n for i in range(1,n+1):\n base.append(arr1[i+1]-arr1[i-1])\n base.sort()\n ans=0\n for i in range(n):\n ans+=base[i]*arr2[i]\n print(ans)\n", "# cook your dish here\n# cook your dish here\nt=int(input(''))\nfor k in range (t):\n n=int(input(''))\n li=[]\n li1=[]\n li2=[]\n for i in range (n):\n p,q=input().split()\n p=int(p)\n q=int(q)\n li.append(p)\n li1.append(q)\n r=li[1]-li[0]\n #print(r)\n li2.append(r)\n for i in range (1,n-1):\n p=li[i+1]-li[i-1]\n li2.append(p)\n li2.append(li[n-1]-li[n-2])\n li2.sort()\n li1.sort()\n ans=0\n for i in range (n):\n ans=ans+li1[i]*li2[i]\n #print(li2[i])\n print(ans)", "for t in range(int(input())):\n x = []\n y = []\n z = []\n \n res = 0\n n = int(input(\"\"))\n for i in range(n):\n temp1,temp2 = input(\"\").split()\n x.append(int(temp1))\n y.append(int(temp2))\n \n z.insert(0,x[1] - x[0])\n z.insert(-1,x[-1] - x[-2])\n \n for i in range(1,n-1):\n z.insert(i,x[i+1] - x[i-1])\n \n y.sort(reverse = True)\n z.sort(reverse = True)\n for i in range(n):\n res = res + y[i] * z[i]\n \n print(res)", "# cook your dish here\nt = int(input())\nfor _ in range(t):\n n = int(input())\n a, b = [], []\n for _ in range(n):\n x, h = input().split()\n a.append(int(x))\n b.append(int(h))\n a = [y - x for x, y in zip(a, a[1:])]\n a = sorted(x + y for x, y in zip([0] + a, a + [0]))\n print(sum(x * y for x, y in zip(a, sorted(b))))", "# cook your dish here\nfor _ in range(int(input())):\n n = int(input())\n x1, h1 = map(int, input().split())\n x2, h2 = map(int, input().split())\n l1 = [x2-x1]\n l2 = [h1, h2]\n for i in range(2, n):\n x, h = map(int, input().split())\n l1.append(x-x1)\n l2.append(h)\n x1 = x2\n x2 = x\n l1.append(x2-x1)\n l1.sort()\n l2.sort()\n a = 0\n for i in range(n):\n a += l1[i]*l2[i]\n print(a)", "# cook your dish here\nfrom sys import stdin\n\nt = int(stdin.readline())\n\nwhile t:\n n = int(stdin.readline())\n\n diff_prev = 0\n d, D = [], []\n h = [0]\n\n x_prev, h[0] = [int(x) for x in stdin.readline().split()]\n\n for i in range(n-1):\n x, ht = [int(x) for x in stdin.readline().split()]\n\n h.append(ht)\n d.append(x - x_prev)\n D.append(diff_prev + d[i])\n diff_prev = d[i]\n x_prev = x\n \n D.append(d[n-2])\n \n D.sort()\n h.sort()\n\n ans = 0\n for i in range(n):\n ans += D[i]*h[i]\n\n print(ans)\n\n t -= 1", "# cook your dish here\nfrom sys import stdin\n\nt = int(stdin.readline())\n\nwhile t:\n n = int(stdin.readline())\n\n diff_prev = 0\n d, D = [], []\n h = [0]\n\n x_prev, h[0] = [int(x) for x in stdin.readline().split()]\n\n for i in range(n-1):\n x, ht = [int(x) for x in stdin.readline().split()]\n\n h.append(ht)\n d.append(x - x_prev)\n D.append(diff_prev + d[i])\n diff_prev = d[i]\n x_prev = x\n \n D.append(d[n-2])\n \n D.sort()\n h.sort()\n\n ans = 0\n for i in range(n):\n ans += D[i]*h[i]\n\n print(ans)\n\n t -= 1", "# cook your dish here\n\nT = int(input())\nt = 0\nwhile t < T:\n t += 1\n N = int(input())\n h,x = list(), list()\n for i in range(N):\n a,b=list(map(int, input().split()))\n h.append(b)\n x.append(a)\n \n v=[]\n for i in range(N):\n v.append(x[min(i+1,N-1)]-x[max(i-1,0)])\n h.sort()\n v.sort()\n \n ans = 0\n for i in range(N):\n ans += h[i] * v[i]\n \n print(ans)\n \n", "for t in range(int(input())):\n n=int(input())\n height=[]\n d=[]\n prev=0\n points=[]\n nex=0\n for i in range(n):\n x,h=[int(x) for x in input().split()]\n height.append(h)\n points.insert(i,x)\n for i in range(1,n):\n diff=points[i]-points[i-1]\n d.append(diff)\n points=[]\n for i in range(n-1):\n num=d[i]+prev\n prev=d[i]\n points.append(num)\n points.append(d[n-2])\n points.sort(reverse=True)\n height.sort(reverse=True)\n s=0\n for i in range(n):\n s+=(height[i]*points[i])\n print(s)\n \n \n \n \n", "for _ in range(int(input())):\n n=int(input())\n a=[]\n g=[]\n h=[]\n I=list(map(int,input().split()))\n P=list(map(int,input().split()))\n a.append(I[0])\n a.append(P[0])\n h.append(I[1])\n h.append(P[1])\n g.append(a[1]-a[0])\n for i in range(2,n):\n L=list(map(int,input().split()))\n a.append(L[0])\n g.append(a[i]-a[i-2])\n h.append(L[1])\n g.append(a[-1]-a[-2])\n g.sort()\n h.sort()\n var=0\n for i in range(n):\n var+=h[i]*g[i]\n print(var)\n \n \n \n", "t = int(input())\nfor _ in range(t):\n n = int(input())\n x, p = [], []\n for __ in range(n):\n line = list(map(int, input().split()))\n x.append(line[0])\n p.append(line[1])\n g = []\n for i in range(n-1):\n g.append(x[i+1] - x[i])\n bois = []\n bois.append(g[0])\n for k in range(n-2):\n bois.append(g[k+1] + g[k])\n bois.append(g[n-2])\n bois.sort()\n p.sort()\n ans = 0\n for i in range(n):\n ans += p[i] * bois[i]\n print(ans)\n \n \n", "t = int(input())\nfor _ in range(t):\n n = int(input())\n x, p = [], []\n for __ in range(n):\n line = list(map(int, input().split()))\n x.append(line[0])\n p.append(line[1])\n g = []\n for i in range(n-1):\n g.append(x[i+1] - x[i])\n bois = []\n bois.append(g[0])\n for k in range(n-2):\n bois.append(g[k+1] + g[k])\n bois.append(g[n-2])\n bois.sort()\n p.sort()\n ans = 0\n for i in range(n):\n ans += p[i] * bois[i]\n print(ans)\n", "# cook your dish here\nT = int(input())\nfor _ in range(T):\n n = int(input())\n a, b = [], []\n for _ in range(n):\n x, h = input().split()\n a.append(int(x))\n b.append(int(h))\n a = [y - x for x, y in zip(a, a[1:])]\n a = sorted(x + y for x, y in zip([0] + a, a + [0]))\n print(sum(x * y for x, y in zip(a, sorted(b))))", "for _ in range(int(input())):\n n = int(input())\n arr = []\n height = []\n d = []\n final = []\n for i in range(n):\n x,y = map(int,input().split())\n arr.append(x)\n height.append(y)\n for x in range(1,n):\n d.append(arr[x]-arr[x-1])\n final.append(d[0])\n for i in range(len(d)-1):\n final.append(d[i]+d[i+1])\n final.append(d[-1])\n height.sort()\n final.sort()\n ans = 0\n for x in range(n):\n ans+=(final[x]*height[x])\n print(ans)", "for _ in range(int(input())):\n n = int(input())\n x_arr = []\n h_arr = []\n d = []\n D = []\n for i in range(n):\n x,y = map(int,input().split())\n x_arr.append(x)\n h_arr.append(y)\n for x in range(1,n):\n d.append(x_arr[x]-x_arr[x-1])\n D.append(d[0])\n for i in range(len(d)-1):\n D.append(d[i]+d[i+1])\n D.append(d[-1])\n h_arr.sort()\n D.sort()\n ans = 0\n for x in range(n):\n ans+=(D[x]*h_arr[x])\n print(ans)", "t=int(input())\nwhile t:\n dd=[]\n l=[]\n h=[]\n pr=0\n d=[]\n n=int(input())\n for i in range(n):\n x,hi=map(int,input().split())\n l.append(x)\n h.append(hi)\n l.sort()\n for i in range(1,n):\n dd.append(l[i]-l[i-1])\n d.append(dd[0])\n for i in range(1,n-1):\n d.append(dd[i]+dd[i-1])\n d.append(dd[-1])\n d.sort()\n h.sort()\n pr=0\n #print(d,h)\n for i in range(n):\n pr+=d[i]*h[i]\n print(pr)\n t-=1"]

{"inputs": [["1", "5", "1 1", "2 2", "3 3", "4 4", "5 5"]], "outputs": [["27"]]}

INTERVIEW

PYTHON3

CODECHEF

11,372

08882683f53f827e144260f1e16a4b60

UNKNOWN

Roman has no idea, why this problem is called Stone. He also has no idea on how to solve the followong problem: given array of N integers A and a number K. During a turn the maximal value over all Ai is chosen, let's call it MAX. Then Ai = MAX - Ai is done for every 1 <= i <= N. Help Roman to find out how will the array look like after K turns. -----Input----- The numbers N and K are given in the first line of an input. Then N integers are given in the second line which denote the array A. -----Output----- Output N numbers on a single line. It should be the array A after K turns. -----Constraints----- - 1 <= N <= 105 - 0 <= K <= 109 - Ai does not exceed 2 * 109 by it's absolute value. -----Example----- Input: 4 1 5 -1 7 0 Output: 2 8 0 7

["n, k = list(map(int, input().split()))\nA = list(map(int, input().split()))\nmaximum = max(A)\nminimum = min(A)\nif k == 0:\n for i in A:\n print(i, end=' ')\nelif k&1:\n for i in A:\n print(maximum - i, end=' ')\nelse:\n for i in A:\n print(i - minimum, end=' ')\n", "n,k = input().split()\nn=int(n)\nk=int(k)\na=list(int(x) for x in input().split())\nif k==0:\n print(\" \".join(str(x) for x in a))\nelif k%2 ==0:\n m=max(a)\n a=[m-x for x in a]\n m=max(a)\n a=[m-x for x in a]\n print(\" \".join(str(x) for x in a))\nelse:\n m=max(a)\n a=[m-x for x in a]\n print(\" \".join(str(x) for x in a))", "n,k = list(map(int,input().split()))\na = list(map(int,input().split()))\n\nif k == 0:\n ans = a\nelse:\n t = max(a)\n for i in range(n):\n a[i] = t-a[i]\n \n if k%2==0:\n t = max(a)\n for i in range(n):\n a[i] = t-a[i]\n \nfor i in a:\n print(i, end=' ')\n\nprint()", "def pf(a):\n M = max(a)\n for j in range(len(a)):\n a[j] = M-a[j]\n\nn,k = list(map(int, input().split()))\na=list(map(int, input().split()))\nif k > 0:\n pf(a)\n if k % 2 == 0:\n pf(a)\n\nprint(\" \".join(map(str, a)))\n\n\n# while True:\n# cmd = raw_input(\"=> \")\n# if cmd == 'e': \n# print(\"bye\")\n# break\n# elif cmd == 'r': \n# pf()\n# print(a)\n# else: print(\"command not implemented\")\n", "import sys\ndef stone(s):\n n,k = list(map(int,s.split()))\n l = list(map(int,sys.stdin.readline().split()))\n if k%2 == 1:\n k = 1\n \n elif k%2 == 0 and k != 0:\n k = 2\n else:\n k = 0\n for j in range(k):\n m = max(l)\n for i in range(n):\n l[i] = m - l[i]\n s1 = ''\n for i in range(n):\n s1 += (str(l[i]) + ' ')\n print(s1)\nstone(sys.stdin.readline()) ", "# your code goes here\ndef printo(arr):\n for i in range(len(arr)):\n print(arr[i], end=' ')\n print('')\n\nn,k=(int(e) for e in input().strip().split())\n\narr=[int(e) for e in input().strip().split()]\nflag=0\nif k==0:\n printo(arr)\n flag=1\nif flag==0:\n mx=max(arr)\n for i in range(n):\n arr[i]=mx-arr[i]\n if k%2==1:\n printo(arr)\n else:\n mx=max(arr)\n for i in range(n):\n arr[i]=mx-arr[i]\n printo(arr)", "line1 = input().split(' ')\nline2 = input().split(' ')\nn = int(line1[0])\nk = int(line1[1])\nmoves = k%2\n\na = [0 for x in range(n)]\n\nfor i in range(n):\n a[i] = int(line2[i])\n\nif moves==0:\n moves=2\n \nwhile moves>0:\n m = -20000000000\n for i in range(n):\n if a[i]>m:\n m = a[i]\n \n for i in range(n):\n a[i] = m-a[i]\n \n moves-=1\n \nans = \"\"\n\nfor i in range(n):\n ans+=(str(a[i])+\" \")\nif k==0:\n ans=\"\"\n for i in range(n):\n ans+=(line2[i]+\" \") \n \n\nprint(ans)\n", "k1=input()\nk1=list(map(int,k1.split(\" \")))\nk=k1[1]\nar=input()\nar=list(map(int,ar.split(\" \")))\nif(k==0):\n for i in ar:\n print(i, end=' ')\nelif(k%2==1):\n max1=max(ar)\n for i in range(0,len(ar)):\n ar[i]=max1-ar[i]\n for i in ar:\n print(i, end=' ')\nelse: \n for l in range(0,2):\n max1=max(ar)\n for i in range(0,len(ar)):\n ar[i]=max1-ar[i]\n for i in ar:\n print(i, end=' ')", "n,k=list(map(int,input().split()))\na=list(map(int,input().split()))\nmax1=max(a)\nmin1=min(a)\nif k==0:\n for i in range(n):\n print(a[i], end=' ')\nelif k%2==1:\n for i in range(n):\n print(max1-a[i], end=' ') \nelse:\n for i in range(n):\n print(a[i]-min1, end=' ')\n", "\"\"\"\nhttp://www.codechef.com/MAY14/problems/RRSTONE\n\"\"\"\n\nN,K = list(map(int,input().split()))\n#print N,K\nA = list(map(int,input().split()))\n#print A\n\nfor i in range(min(K,K%2+2)) :\n m = max(A)\n A = [m-j for j in A]\n #print A\n\nprint(\" \".join(map(str,A)))\n\n", "n,k=input().split()\nn,k=int(n),int(k)\na=list(map(int,input().split()))\nmaxi=0\nmini=0\nif k!=0:\n maxi=max(a)\n mini=min(a)\nmini=maxi-mini\nfor i in range(n):\n a[i]=maxi-a[i]\nif k%2==0:\n for i in range(n):\n a[i]=mini-a[i]\nprint(\" \".join(map(str,a)))", "import sys\n\n\ndef solve(n, k, a):\n for i in range(k):\n max_a = max(a)\n for i in range(len(a)):\n a[i] = max_a - a[i]\n print(' '.join([str(x) for x in a]))\n\ndef main():\n parts = sys.stdin.readline().strip().split(' ')\n n = int(parts[0])\n k = int(parts[1])\n if k > 2:\n k %= 2\n if k == 0:\n k = 2\n a = [int(x) for x in sys.stdin.readline().strip().split(' ')]\n solve(n, k, a)\nmain()", "\nN=input()\nA=input()\nN=N.split()\nA=A.split()\nN = list(map(int, N))\nA= list(map(int, A))\nMAX=max(A)\nMIN=min(A)\nif N[1]==0:\n for i in range(N[0]):\n print(A[i], end=' ')\nelse:\n if N[1]%2==1:\n for i in range(N[0]):\n A[i]=MAX-A[i]\n print(A[i], end=' ')\n else:\n for i in range(N[0]):\n A[i]=A[i]-MIN\n print(A[i], end=' ')\n", "def Turn(a, n):\n m = max(a)\n for i in range(n):\n a[i] = m - a[i]\n\nn, k = list(map(int, input().split()))\na = list(map(int, input().split()))\nif k > 0:\n Turn(a, n)\n k -= 1\n if k & 1 == 1:\n Turn(a, n)\nprint(' '.join(map(str,a)))\n", "#import time\n\nline = input().split()\nN = int(line[0])\nK = int(line[1])\nb = list(map(int, input().split()))\ni = 0\nif K == 0:\n print(' '.join(str(x) for x in b))\nelse:\n mx = max(b)\n for j in range(0, N):\n b[j] = mx - b[j]\n if K % 2 == 0:\n mx = max(b)\n for j in range(0, N):\n b[j] = mx - b[j]\n print(' '.join(str(x) for x in b))\n else:\n print(' '.join(str(x) for x in b))", "n,k=list(map(int,input().split()))\na=list(map(int,input().split()))\nb=0\nc=110000000\nfor d in a:\n b=max(b,d)\n c=min(d,c)\nif k==0:\n for x in a:\n print(x, end=' ')\nelse:\n if k%2==0:\n for x in a:\n print(x-c, end=' ')\n else:\n for x in a:\n print(b-x, end=' ')\n", "import sys\n\ndef __starting_point():\n n,k = [int(u) for u in sys.stdin.readline().strip().split()]\n val = [int(u) for u in sys.stdin.readline().strip().split()]\n ans = \"\"\n if k > 0:\n maxval = max(val)\n for i in range(n):\n val[i] = maxval - val[i]\n maxval = max(val)\n if k%2 == 0:\n for i in range(n):\n ans += str(maxval - val[i]) + ' '\n print(ans[:-1])\n else:\n for i in range(n):\n ans += str(val[i]) + ' '\n print(ans[:-1])\n else:\n for i in range(n):\n ans += str(val[i]) + ' '\n print(ans[:-1])\n\n__starting_point()", "n,k = list(map(int,input().split()))\na = list(map(int,input().split()))\nm1 = max(a)\nm2 = min(a)\nif k == 0 :\n for i in a:\n print(i, end=' ')\nelif k % 2 == 1:\n for i in a:\n print(m1 - i, end=' ')\nelse :\n for i in a:\n print(i - m2, end=' ')\n", "import sys\nn,k=list(map(int,input().split()))\na=list(map(int,input().split()))\nif k==0:\n print(\" \".join(map(str,a)))\nelif k%2==1:\n ma=max(a)\n print(\" \".join(map(str,[ma-i for i in a])))\nelse:\n mi=min(a)\n print(\" \".join(map(str,[i-mi for i in a]))) \nreturn "]

{"inputs": [["4 1", "5 -1 7 0"]], "outputs": [["2 8 0 7"]]}

INTERVIEW

PYTHON3

CODECHEF

6,630

f2a9ee7b72b2c9803330cad5083c53dc

UNKNOWN

Chef just got a box of chocolates as his birthday gift. The box contains $N$ chocolates in a row (numbered $1$ through $N$), where $N$ is even. For each valid $i$, the $i$-th chocolate has a sweetness value $W_i$. Chef wants to eat all the chocolates in the first half of the box and leave all chocolates in the second half uneaten. Since he does not like chocolates that are too sweet, he will be unhappy if at least one of the chocolates he eats has the maximum sweetness among all the chocolates in the box. A right cyclic shift by $k$ chocolates ($0 \le k < N$) consists of moving the last $k$ chocolates in the row to the beginning in the same order and moving each of the remaining $N-k$ chocolates $k$ places to the right. Before eating the first half of the chocolates, Chef wants to perform some right cyclic shift in such a way that he will not be unhappy after eating them. Find the number of ways to do this, i.e. the number of valid integers $k$ such that if Chef performs the right cyclic shift by $k$ chocolates and then eats the first half of the chocolates in the box, he does not become unhappy. -----Input----- - The first line of the input contains a single integer $T$ denoting the number of test cases. The description of $T$ test cases follows. - The first line of each test case contains a single integer $N$. - The second line contains $N$ space-separated integers $W_1, W_2, \ldots, W_N$. -----Output----- For each test case, print a single line containing one integer ― the number of shifts for which Chef does not become unhappy. -----Constraints----- - $1 \le T \le 5$ - $1 \le N \le 10^5$ - $N$ is even - $1 \le W_i \le 10^5$ for each valid $i$ -----Example Input----- 2 6 1 1 2 1 1 1 6 1 1 2 1 1 2 -----Example Output----- 3 0 -----Explanation----- Example case 1: The three valid right shifts and the contents of the box for these shifts are: - shift by $k = 1$: $(1, 1, 1, 2, 1, 1)$ - shift by $k = 2$: $(1, 1, 1, 1, 2, 1)$ - shift by $k = 3$: $(1, 1, 1, 1, 1, 2)$

["from collections import deque\nt=int(input())\n\nfor i in range(t):\n n=int(input())\n N=[i for i in range(1, n+1)]\n w=list(map(int, input().split()))\n max_sweetness=max(w)\n sizes=[]\n cnt=0\n for i in range(n):\n if w[i]!=max_sweetness:\n cnt+= 1 \n else:\n sizes.append(cnt)\n cnt=0\n \n if cnt!=0:\n sizes[0]=(cnt+sizes[0])\n \n res=0\n for i in range(len(sizes)):\n res+=max(sizes[i]-n//2+1, 0)\n \n print(res)", "# cook your dish here\nt=int(input())\nfor i in range(t):\n a=int(input())\n cho =list(map(int, input().split()))\n maxc=max(cho)\n start=cho.index(maxc)\n mid =int(len(cho)/2)\n for j in range(len(cho)-1, 0, -1):\n if(cho[j]==maxc):\n end = j\n break\n ans =((len(cho))-end)-(mid-start)\n print(max(0,ans))", "# cook your dish here\ndef answer():\n m=max(w)\n count=[]\n c=0\n for i in w:\n if(i==m):\n count.append(c)\n c=-1\n c+=1\n\n if(c):\n count.append(c)\n\n first=(w[0]!=m)\n last=(w[-1]!=m)\n\n if(first and last):\n count[0]+=count[-1]\n count.pop()\n\n k=0 \n for i in count:\n if(i >= n//2):\n k+=i-n//2+1\n return k\n \n \n\nfor T in range(int(input())):\n n=int(input())\n w=list(map(int,input().split()))\n\n print(answer())\n", "# cook your dish here\nt = int(input())\nfor _ in range(t):\n n = int(input())\n arr = list(map(int, input().split()))\n maxi = max(arr)\n for i in range(n-1,-1,-1):\n if(arr[i]==maxi):\n r = i\n break\n for i in range(n):\n if(arr[i]==maxi):\n r = r-i\n break\n if((n//2)-r<0):\n print(0)\n else:\n print((n//2)-r)", "# cook your dish here\nt = int(input())\nfor _ in range(t):\n n = int(input())\n arr = list(map(int, input().split()))\n maxi = max(arr)\n for i in range(n-1,-1,-1):\n if(arr[i]==maxi):\n r = i\n break\n for i in range(n):\n if(arr[i]==maxi):\n r = r-i\n break\n if((n//2)-r<0):\n print(0)\n else:\n print((n//2)-r)\n", "t=int(input())\nwhile(t>0):\n t-=1\n n=int(input())\n l=list(map(int,input().split()))\n m=max(l)\n a=[]\n for i in range(n):\n if(m==l[i]):\n a.append(i+1)\n b=[]\n for i in range(1,len(a)):\n b.append(a[i]-a[i-1])\n if(len(a)>1):\n b.append(n-a[-1]+a[0])\n k=max(b)\n if(k>=n//2):\n print(k-(n//2))\n else:\n print(0)\n else:\n print((n+1)//2)\n\n", "from sys import maxsize, stdout, stdin\nmod = int(1e9 + 7)\ndef I(): return int(stdin.readline())\ndef lint(): return [int(x) for x in stdin.readline().split()]\ndef S(): return input().strip()\ndef grid(r, c): return [lint() for i in range(r)]\nfor _ in range(I()):\n n = I()\n ls = lint()\n cnt =0\n arr =[0]*n\n m = max(ls)\n idx = ls.index(m)\n ideal = n//2\n shift = ideal - idx\n for i in range(n):\n arr[i]= (ls[(i-shift)%n])\n if m in arr[:n//2 ]:\n print(0)\n else:\n for j in range(n-1,n//2 -1 ,-1):\n if arr[j]!=m:\n cnt+=1\n else:break\n print(cnt+1)\n", "# cook your dish here\nfor _ in range(int(input())):\n q = int(input())\n arr = list(map(int,input().split()))\n t = max(arr)\n for i in range(q-1,-1,-1):\n if(arr[i]==t):\n r = i\n break\n for i in range(q):\n if(arr[i]==t):\n r = r-i\n break\n if((q//(1+1))-r < 0):\n print(0)\n else:\n print((q//(1+1))-r)", "# cook your dish here\nfor _ in range(int(input())):\n n=int(input())\n l=list(map(int,input().split()))\n mid=n//2-1\n max_beg=max(l)\n f_o=l.index(max_beg)\n l.reverse()\n l_o=l.index(max_beg)\n l_o=n-1-l_o\n if l_o-f_o>=mid:\n print(0)\n else:\n if f_o==l_o:\n f_o=mid \n print(n-1-f_o)\n else:\n gap=l_o-f_o \n f_o=mid \n l_o=f_o+gap \n print(n-1-l_o)\n \n \n", "# cook your dish here\ntry:\n T = int(input())\n while T>0:\n N = int(input())\n midway = (N//2) - 1\n num = list(map(int, input().split()[:N]))\n max_beg = max(num)\n first_occr = num.index(max_beg)\n num.reverse()\n last_occr = num.index(max_beg)\n last_occr = N-1-last_occr\n \n if last_occr-first_occr >= midway:\n print(0)\n else:\n if first_occr==last_occr:\n first_occr=midway\n print(N-1-first_occr)\n else:\n gap = last_occr-first_occr\n first_occr=midway\n last_occr=first_occr+gap\n print(N-1-last_occr)\n T-=1\n\nexcept EOFError as e:\n print(\"\")", "try:\n T = int(input())\n while T>0:\n N = int(input())\n midway = (N//2) - 1\n num = list(map(int, input().split()[:N]))\n max_beg = max(num)\n first_occr = num.index(max_beg)\n num.reverse()\n last_occr = num.index(max_beg)\n last_occr = N-1-last_occr\n \n if last_occr-first_occr >= midway:\n print(0)\n else:\n if first_occr==last_occr:\n first_occr=midway\n print(N-1-first_occr)\n else:\n gap = last_occr-first_occr\n first_occr=midway\n last_occr=first_occr+gap\n print(N-1-last_occr)\n T-=1\n\nexcept EOFError as e:\n print(\"\")", "for _ in range(int(input())):\n n = int(input())\n w = (*map(int, input().split()),)\n m = 0\n for i in range(n):\n if w[i] > w[m]: m = i\n count = 0\n gap = 0\n for i in range(m+1, m+n+1):\n if w[i%n] == w[m]:\n count += max(0,gap-n//2+1)\n gap = 0\n else: gap += 1\n print(count)", "for _ in range(int(input())):\n n=int(input())\n l=list(map(int,input().split()))\n u=[]\n k=0\n t=max(l)\n for i in range(n):\n if l[i]==t:\n break\n y=i+1\n while y!=i:\n if l[y] !=t:\n k+=1\n else:\n u.append(k)\n k=0\n y=(y+1)%n\n if k!=0:\n u.append(k)\n s=0\n for i in range(len(u)):\n s+=max(0,u[i]-n//2+1)\n print(s)", "for _ in range(int(input())):\n n=int(input())\n l=list(map(int,input().split()))\n u=[]\n k=0\n t=max(l)\n for i in range(n):\n if l[i]==t:\n break\n y=i+1\n while y!=i:\n if l[y] !=t:\n k+=1\n else:\n u.append(k)\n k=0\n y=(y+1)%n\n if k!=0:\n u.append(k)\n s=0\n for i in range(len(u)):\n s+=max(0,u[i]-n//2+1)\n print(s)", "for _ in range(int(input())):\n n=int(input())\n l=list(map(int,input().split()))\n u=[]\n k=0\n t=max(l)\n for i in range(n):\n if l[i]==t:\n break\n y=i+1\n while y!=i:\n if l[y] !=t:\n k+=1\n else:\n u.append(k)\n k=0\n y=(y+1)%n\n if k!=0:\n u.append(k)\n s=0\n for i in range(len(u)):\n s+=max(0,u[i]-n//2+1)\n print(s)", "for _ in range(int(input())):\n n=int(input())\n l=list(map(int,input().split()))\n u=[]\n k=0\n t=max(l)\n for i in range(n):\n if l[i]==t:\n break\n y=i+1\n while y!=i:\n if l[y] !=t:\n k+=1\n else:\n u.append(k)\n k=0\n y=(y+1)%n\n if k!=0:\n u.append(k)\n s=0\n for i in range(len(u)):\n s+=max(0,u[i]-n//2+1)\n print(s)\n", "t = int(input())\nwhile t>0:\n t -= 1\n n = int(input())\n a = [int(x) for x in input().split()]\n m = max(a)\n ind = []\n for i in range(n):\n if a[i] == m:\n ind.append(i)\n if len(ind) == 1:\n print(n//2)\n continue\n f = ind[0]\n l = ind[-1]\n width = l-f+1\n if width > n//2:\n print(0)\n else:\n print(n//2-width+1)\n# cook your dish here\n", "t = int(input())\nwhile t>0:\n t -= 1\n n = int(input())\n a = [int(x) for x in input().split()]\n m = max(a)\n ind = []\n for i in range(n):\n if a[i] == m:\n ind.append(i)\n if len(ind) == 1:\n print(n//2)\n continue\n f = ind[0]\n l = ind[-1]\n width = l-f+1\n if width > n//2:\n print(0)\n else:\n print(n//2-width+1)\n\n\n\n\n\n\n\n\n", "test = int(input())\nfor _ in range(test):\n n=int(input())\n array = list(map(int, input().split()))\n maxi = max(array)\n index=[]\n for i in range(n):\n if array[i]==maxi:\n index.append(i)\n \n if len(index)==1:\n print(n//2)\n else:\n if index[len(index)-1]-index[0]>=n//2:\n print(0)\n else:\n print(n//2 - (index[len(index)-1]-index[0]))", "t = int(input())\n#for each test cases\nfor i in range(t):\n n=int(input())\n s=list(map(int,input().split()))\n m=max(s)\n c=[]\n for i in range(n):\n if(s[i]==m):\n c.append(i)\n if (len(c)==1):\n print(n//2)\n else:\n if (c[-1]-c[0]+1>n//2):\n print(0)\n else:\n x=c[-1]-c[0]\n print(n//2-x)", "for _ in range(int(input())):\n N = int(input())\n seq = list(map(int,input().split()))\n maxx = max(seq)\n count = 0\n seq = seq+seq\n max_cont = 0\n for i in range(2*N):\n if seq[i] != maxx:\n count +=1\n else:\n if count > max_cont:\n max_cont = count\n count = 0\n if count > max_cont:\n max_cont = count\n print(max(max_cont-N//2+1,0))", "from collections import defaultdict\ntest=int(input())\nfor _ in range(test):\n r=int(input())\n s=list(map(int,input().split()))\n m=max(s)\n l=int(r/2)\n step=0\n index=[]\n for i in range(len(s)):\n if s[i]==m:\n index.append(i)\n if len(index)==1:\n print(l)\n else:\n diff=index[-1]-index[0]\n if diff+1 > l:\n print(0)\n else:\n print(l-diff)", "class node:\n def __init__(self, size, elements):\n self.size = size\n self.elements = elements\n\n\ndef solve(ele, s):\n m = max(ele)\n i, j = 0, 0\n flag = True\n for k in range(s):\n if ele[k] == m:\n j = k\n if flag:\n flag = False\n i = k\n if i == j:\n return s//2\n elif (j-i) >= s//2:\n return 0\n else:\n i, j = s//2, j + s//2 - i\n return s-j\n\n\ndef __starting_point():\n t = int(input())\n inputs = []\n for i in range(t):\n inputs.append(node(int(input()), list(map(int, input().split()))))\n for i in inputs:\n print(solve(i.elements, i.size))\n\n__starting_point()"]

{"inputs": [["2", "6", "1 1 2 1 1 1", "6", "1 1 2 1 1 2"]], "outputs": [["3", "0"]]}

INTERVIEW

PYTHON3

CODECHEF

9,051

af41fe00d667c136d17c5def6f06ecca

UNKNOWN

The Fibonacci sequence $F_0, F_1, \ldots$ is a special infinite sequence of non-negative integers, where $F_0 = 0$, $F_1 = 1$ and for each integer $n \ge 2$, $F_n = F_{n-1} + F_{n-2}$. Consider the sequence $D$ of the last decimal digits of the first $N$ Fibonacci numbers, i.e. $D = (F_0 \% 10, F_1 \% 10, \ldots, F_{N-1} \% 10)$. Now, you should perform the following process: - Let $D = (D_1, D_2, \ldots, D_l)$. - If $l = 1$, the process ends. - Create a new sequence $E = (D_2, D_4, \ldots, D_{2 \lfloor l/2 \rfloor})$. In other words, $E$ is the sequence created by removing all odd-indexed elements from $D$. - Change $D$ to $E$. When this process terminates, the sequence $D$ contains only one number. You have to find this number. -----Input----- - The first line of the input contains a single integer $T$ denoting the number of test cases. The description of $T$ test cases follows. - The first and only line of each test case contains a single integer $N$. -----Output----- For each test case, print a single line containing one integer ― the last remaining number. -----Constraints----- - $1 \le T \le 10^5$ - $1 \le N \le 10^{18}$ -----Subtasks----- Subtask #1 (20 points): - $1 \le T \le 10^5$ - $1 \le N \le 10^7$ Subtask #2 (80 points): original constraints -----Example Input----- 1 9 -----Example Output----- 3 -----Explanation----- Example case 1: The first $N$ Fibonacci numbers are $(0, 1, 1, 2, 3, 5, 8, 13, 21)$. The sequence $D$ is $(0, 1, 1, 2, 3, 5, 8, 3, 1) \rightarrow (1, 2, 5, 3) \rightarrow (2, 3) \rightarrow (3)$.

["import math\n\nt = int(input())\n\na = [-1, 0, 1]\n\nfor i in range(58):\n temp = a[-1] + a[-2]\n temp = temp%10\n a.append(temp)\n \nfor _ in range(t):\n n = int(input())\n \n temp = len(bin(n)) - 3\n temp = 2**temp\n temp = temp%60\n \n print(a[temp])", "import math\n\ndef logBase2(n):\n res = 0\n fact = 1\n while((fact << (res+1)) <= n):\n res+=1\n return res\n\nt = int(input())\n\na = [-1, 0, 1]\n\nfor i in range(58):\n temp = a[-1] + a[-2]\n temp = temp%10\n a.append(temp)\nfor _ in range(t):\n n = int(input())\n \n n = 1<<int(math.log2(n))\n \n print(a[n%60]) \n", "import math\n\ndef logBase2(n):\n res = 0\n fact = 1\n while((fact << (res+1)) <= n):\n res+=1\n return res\n\nt = int(input())\n\na = [-1, 0, 1]\n\nfor i in range(58):\n temp = a[-1] + a[-2]\n temp = temp%10\n a.append(temp)\nfor _ in range(t):\n n = int(input())\n \n n = 1<<logBase2(n)\n \n print(a[n%60]) \n", "import math\n\nt = int(input())\n\na = [-1, 0, 1]\n\nfor i in range(58):\n temp = a[-1] + a[-2]\n temp = temp%10\n a.append(temp)\n\nfor _ in range(t):\n n = int(input())\n \n n = math.floor(math.log(n, 2))\n n = (2**n)%60\n print(a[n])\n", "import math\n\nt = int(input())\n\na = [-1, 0, 1]\n\nfor i in range(61):\n temp = a[-1] + a[-2]\n temp = temp%10\n a.append(temp)\n \nfor _ in range(t):\n n = int(input())\n \n n = int(math.log(n, 2))\n \n n = (2**n)%60\n print(a[n])\n", "import math\ndef fib(n):\n if n<2:\n return n\n dp = [0]*(n+1)\n dp[1] = 1\n for i in range(2, n+1):\n dp[i] = (dp[i-1] + dp[i-2]) % 10;\n # print(n, dp) \n return dp[n]\n \nt=int(input())\n\nfor _ in range(t):\n n = int(input())\n exp = int(math.floor(math.log(n, 2)))\n arg = (2**exp -1) % 60\n \n print( fib(arg) )", "import math\ndef r(n):\n cycle = 60\n index = (1 << len(bin(n))-3) % cycle\n cur = 0\n next = 1 \n for i in range(1, index):\n nextNext = (cur + next) % 10\n cur = next\n next = nextNext\n return cur\n\n\nt = int(input())\nfor i in range(t):\n c = int(input())\n print(r(c))", "import math\ndef r(n):\n cycle = 60\n index = (1 << int(math.floor(math.log2(n)))) % cycle\n cur = 0\n next = 1 \n for i in range(1, index):\n nextNext = (cur + next) % 10\n cur = next\n next = nextNext\n return cur\n\n\nt = int(input())\nfor i in range(t):\n c = int(input())\n print(r(c))", "import math\n\nt = int(input())\n\na = [-1, 0, 1]\n\nfor i in range(58):\n temp = a[-1] + a[-2]\n temp = temp%10\n a.append(temp)\n \nfor _ in range(t):\n n = int(input())\n \n n = int(math.log(n, 2))\n \n n = (2**n)%60\n print(a[n])", "def fib(n):\n index = -1\n while n > 0:\n index += 1\n n = n // 2\n return index\n\n\nfirst60Sequence = [ 0, 1, 1, 2, 3, 5, 8, 3, 1, 4, 5, 9, 4, 3, 7,\n 0, 7, 7, 4, 1, 5, 6, 1, 7, 8, 5, 3, 8, 1, 9,\n 0, 9, 9, 8, 7, 5, 2, 7, 9, 6, 5, 1, 6, 7, 3,\n 0, 3, 3, 6, 9, 5, 4, 9, 3, 2, 5, 7, 2, 9, 1]\n\ntest = int(input())\nfor i in range(test):\n number = int(input())\n respectiveIndex = (2 ** fib(number)) % 60\n print(first60Sequence[respectiveIndex - 1])", "# cook your dish here\ndef f(n):\n i=-1\n \n while n>0:\n i+=1\n n=n//2\n \n return i\n\nfo= [ 0, 1, 1, 2, 3, 5, 8, 3, 1, 4, 5, 9, 4, 3, 7,\n 0, 7, 7, 4, 1, 5, 6, 1, 7, 8, 5, 3, 8, 1, 9,\n 0, 9, 9, 8, 7, 5, 2, 7, 9, 6, 5, 1, 6, 7, 3,\n 0, 3, 3, 6, 9, 5, 4, 9, 3, 2, 5, 7, 2, 9, 1]\n\nl = int(input())\n\nfor _ in range(l):\n n = int(input())\n d = (2**f(n))%60\n print(fo[d-1])\n", "# cook your dish here\ndef f(n):\n i=-1\n \n while n>0:\n i+=1\n n=n//2\n \n return i\n\nfo= [ 0, 1, 1, 2, 3, 5, 8, 3, 1, 4, 5, 9, 4, 3, 7,\n 0, 7, 7, 4, 1, 5, 6, 1, 7, 8, 5, 3, 8, 1, 9,\n 0, 9, 9, 8, 7, 5, 2, 7, 9, 6, 5, 1, 6, 7, 3,\n 0, 3, 3, 6, 9, 5, 4, 9, 3, 2, 5, 7, 2, 9, 1]\n\nl = int(input())\n\nfor _ in range(l):\n n = int(input())\n d = (2**f(n))%60\n print(fo[d-1])\n", "# cook your dish here\n# cook your dish here\n\ndef fib(n):\n i=-1\n \n while n>0:\n i+=1\n n=n//2\n \n return i\n\nfl = [ 0, 1, 1, 2, 3, 5, 8, 3, 1, 4, 5, 9, 4, 3, 7,\n 0, 7, 7, 4, 1, 5, 6, 1, 7, 8, 5, 3, 8, 1, 9,\n 0, 9, 9, 8, 7, 5, 2, 7, 9, 6, 5, 1, 6, 7, 3,\n 0, 3, 3, 6, 9, 5, 4, 9, 3, 2, 5, 7, 2, 9, 1]\n\nt = int(input())\n\nfor _ in range(t):\n n = int(input())\n d = (2**fib(n))%60\n print(fl[d-1])\n #print(d)\n", "# cook your dish here\n\ndef fib(n):\n i=-1\n \n while n>0:\n i+=1\n n=n//2\n \n return i\n\nfl = [ 0, 1, 1, 2, 3, 5, 8, 3, 1, 4, 5, 9, 4, 3, 7,\n 0, 7, 7, 4, 1, 5, 6, 1, 7, 8, 5, 3, 8, 1, 9,\n 0, 9, 9, 8, 7, 5, 2, 7, 9, 6, 5, 1, 6, 7, 3,\n 0, 3, 3, 6, 9, 5, 4, 9, 3, 2, 5, 7, 2, 9, 1]\n\nt = int(input())\n\nfor _ in range(t):\n n = int(input())\n d = (2**fib(n))%60\n print(fl[d-1])\n #print(d)\n", "# cook your dish here\nfl = [ 0, 1, 1, 2, 3, 5, 8, 3, 1, 4, 5, 9, 4, 3, 7,\n 0, 7, 7, 4, 1, 5, 6, 1, 7, 8, 5, 3, 8, 1, 9,\n 0, 9, 9, 8, 7, 5, 2, 7, 9, 6, 5, 1, 6, 7, 3,\n 0, 3, 3, 6, 9, 5, 4, 9, 3, 2, 5, 7, 2, 9, 1]\n\ndef log2(num) :\n i = -1\n while num>0 :\n i+=1\n num//=2\n return i\n\ncycle = 60\nfor _ in range(int(input())) :\n n = int(input())\n target = (2**(log2(n)))%60\n print(fl[target-1])", "# cook your dish here\nfl = [ 0, 1, 1, 2, 3, 5, 8, 3, 1, 4, 5, 9, 4, 3, 7,\n 0, 7, 7, 4, 1, 5, 6, 1, 7, 8, 5, 3, 8, 1, 9,\n 0, 9, 9, 8, 7, 5, 2, 7, 9, 6, 5, 1, 6, 7, 3,\n 0, 3, 3, 6, 9, 5, 4, 9, 3, 2, 5, 7, 2, 9, 1]\n\ndef log2(num) :\n i = -1\n while num>0 :\n i+=1\n num//=2\n return i\n\ncycle = 60\nfor _ in range(int(input())) :\n n = int(input())\n target = (2**(log2(n)))%60\n print(fl[target-1])", "# cook your dish here\nfl = [ 0, 1, 1, 2, 3, 5, 8, 3, 1, 4, 5, 9, 4, 3, 7,\n 0, 7, 7, 4, 1, 5, 6, 1, 7, 8, 5, 3, 8, 1, 9,\n 0, 9, 9, 8, 7, 5, 2, 7, 9, 6, 5, 1, 6, 7, 3,\n 0, 3, 3, 6, 9, 5, 4, 9, 3, 2, 5, 7, 2, 9, 1]\n\ndef log2(num) :\n i = -1\n while num>0 :\n i+=1\n num//=2\n return i\n\ncycle = 60\nfor _ in range(int(input())) :\n n = int(input())\n target = (2**(log2(n)))%60\n print(fl[target-1])", "# cook your dish here\nfl = [ 0, 1, 1, 2, 3, 5, 8, 3, 1, 4, 5, 9, 4, 3, 7,\n 0, 7, 7, 4, 1, 5, 6, 1, 7, 8, 5, 3, 8, 1, 9,\n 0, 9, 9, 8, 7, 5, 2, 7, 9, 6, 5, 1, 6, 7, 3,\n 0, 3, 3, 6, 9, 5, 4, 9, 3, 2, 5, 7, 2, 9, 1]\n\ndef log2(num) :\n i = -1\n while num>0 :\n i+=1\n num//=2\n return i\n\ncycle = 60\nfor _ in range(int(input())) :\n n = int(input())\n target = (2**(log2(n)))%60\n print(fl[target-1])", "# cook your dish here\nfl = [ 0, 1, 1, 2, 3, 5, 8, 3, 1, 4, 5, 9, 4, 3, 7,\n 0, 7, 7, 4, 1, 5, 6, 1, 7, 8, 5, 3, 8, 1, 9,\n 0, 9, 9, 8, 7, 5, 2, 7, 9, 6, 5, 1, 6, 7, 3,\n 0, 3, 3, 6, 9, 5, 4, 9, 3, 2, 5, 7, 2, 9, 1]\n\ndef log2(num) :\n i = -1\n while num>0 :\n i+=1\n num//=2\n return i\n\ncycle = 60\nfor _ in range(int(input())) :\n n = int(input())\n target = (2**(log2(n)))%60\n print(fl[target-1])", "# cook your dish here\nfl = [ 0, 1, 1, 2, 3, 5, 8, 3, 1, 4, 5, 9, 4, 3, 7,\n 0, 7, 7, 4, 1, 5, 6, 1, 7, 8, 5, 3, 8, 1, 9,\n 0, 9, 9, 8, 7, 5, 2, 7, 9, 6, 5, 1, 6, 7, 3,\n 0, 3, 3, 6, 9, 5, 4, 9, 3, 2, 5, 7, 2, 9, 1]\n\ndef log2(num) :\n i = -1\n while num>0 :\n i+=1\n num//=2\n return i\n\ncycle = 60\nfor _ in range(int(input())) :\n n = int(input())\n target = (2**(log2(n)))%60\n print(fl[target-1])", "# cook your dish here\nfl = [ 0, 1, 1, 2, 3, 5, 8, 3, 1, 4, 5, 9, 4, 3, 7,\n 0, 7, 7, 4, 1, 5, 6, 1, 7, 8, 5, 3, 8, 1, 9,\n 0, 9, 9, 8, 7, 5, 2, 7, 9, 6, 5, 1, 6, 7, 3,\n 0, 3, 3, 6, 9, 5, 4, 9, 3, 2, 5, 7, 2, 9, 1]\n\ndef log2(num) :\n i = -1\n while num>0 :\n i+=1\n num//=2\n return i\n\ncycle = 60\nfor _ in range(int(input())) :\n n = int(input())\n target = (2**(log2(n)))%60\n print(fl[target-1])", "# cook your dish here\nfl = [ 0, 1, 1, 2, 3, 5, 8, 3, 1, 4, 5, 9, 4, 3, 7,\n 0, 7, 7, 4, 1, 5, 6, 1, 7, 8, 5, 3, 8, 1, 9,\n 0, 9, 9, 8, 7, 5, 2, 7, 9, 6, 5, 1, 6, 7, 3,\n 0, 3, 3, 6, 9, 5, 4, 9, 3, 2, 5, 7, 2, 9, 1]\n\ndef log2(num) :\n i = -1\n while num>0 :\n i+=1\n num//=2\n return i\n\ncycle = 60\nfor _ in range(int(input())) :\n n = int(input())\n target = (2**(log2(n)))%60\n print(fl[target-1])", "# cook your dish here\n\ndef fib(n):\n i=-1\n \n while n>0:\n i+=1\n n=n//2\n \n return i\n\nfl = [ 0, 1, 1, 2, 3, 5, 8, 3, 1, 4, 5, 9, 4, 3, 7,\n 0, 7, 7, 4, 1, 5, 6, 1, 7, 8, 5, 3, 8, 1, 9,\n 0, 9, 9, 8, 7, 5, 2, 7, 9, 6, 5, 1, 6, 7, 3,\n 0, 3, 3, 6, 9, 5, 4, 9, 3, 2, 5, 7, 2, 9, 1]\n\nt = int(input())\n\nfor _ in range(t):\n n = int(input())\n d = (2**fib(n))%60\n print(fl[d-1])\n #print(d)\n"]

{"inputs": [["1", "9"]], "outputs": [["3"]]}

INTERVIEW

PYTHON3

CODECHEF

8,291

a806d32dcd45e159492f3e8aa2aa1a1b

UNKNOWN

The bustling town of Siruseri has just one sports stadium. There are a number of schools, colleges, sports associations, etc. that use this stadium as the venue for their sports events. Anyone interested in using the stadium has to apply to the Manager of the stadium indicating both the starting date (a positive integer $S$) and the length of the sporting event in days (a positive integer $D$) they plan to organise. Since these requests could overlap it may not be possible to satisfy everyone. Also, there should be at least one gap day between any two approved events, so that the stadium can be cleaned. It is the job of the Manager to decide who gets to use the stadium and who does not. The Manager, being a genial man, would like to keep as many organisations happy as possible and hence would like to allocate the stadium so that maximum number of events are held. Suppose, for example, the Manager receives the following 4 requests: $ $ Event No. Starting Date Length 1 2 5 2 9 7 3 15 6 4 9 3 $ $ He would allot the stadium to events $1$, $4$ and $3$. Event $1$ begins on day $2$ and ends on day $6$, event $4$ begins on day $9$ and ends on day $11$ and event $3$ begins on day $15$ and ends on day $20$. You can verify that it is not possible to schedule all the $4$ events (since events $2$ and $3$ overlap and only one of them can get to use the stadium). Your task is to help the manager find the best possible allotment (i.e., the maximum number of events that can use the stadium). -----Input:----- The first line of the input will contain a single integer $N$ indicating the number of events for which the Manager has received a request. Lines $2,3,...,N+1$ describe the requirements of the $N$ events. Line $i+1$ contains two integer $S_i$ and $D_i$ indicating the starting date and the duration of event $i$. -----Output:----- Your output must consist of a single line containing a single integer $M$, indicating the maximum possible number of events that can use the stadium. -----Constraints:----- - $1 \leq N \leq 100000$. - $1 \leq S_i \leq 1000000$. - $1 \leq D_i \leq 1000$. - $50 \%$ of test cases will also satisfy $1 \leq N \leq 10000$. -----Sample input:----- 4 2 5 9 7 15 6 9 3 -----Sample output:----- 3

["# cook your dish here\nn=(int(input()))\nx=[]\nfor _ in range(n):\n a,b=map(int,input().split())\n a=[a,a+b]\n x.append(a)\nx = sorted(x, key= lambda i:i[1])\ny=-1\nc=0\nfor i in range(len(x)):\n if x[i][0]>y:\n c+=1\n y=x[i][1]\nprint(c)", "# cook your dish here\nn=(int(input()))\nx=[]\nfor _ in range(n):\n a,b=map(int,input().split())\n a=[a,a+b]\n x.append(a)\nx.sort()\ny=-1\nc=0\nfor i in range(len(x)):\n if x[i][0]>y:\n c+=1\n y=x[i][1]\nprint(c)", "arr=[]\r\nfor _ in range(int(input())) :\r\n start,end=[int(x) for x in input().split()]\r\n arr.append((start,start+end))\r\narr.sort()\r\nval=[]\r\nfor j in range (len(arr)-1) :\r\n check=arr[j][1]\r\n ans=1\r\n if len(val) >0 and len(arr)-j > max(val) :\r\n break\r\n for i in range(1,len(arr)) :\r\n if arr[i][0] > check :\r\n ans+=1\r\n check = arr[i][1]\r\n val.append(ans)\r\nprint(max(val))", "arr=[]\r\nfor _ in range(int(input())) :\r\n start,end=[int(x) for x in input().split()]\r\n arr.append((start,start+end))\r\narr.sort()\r\nans=1\r\ncheck=arr[0][1]\r\nfor i in range(1,len(arr)) :\r\n if arr[i][0] > check :\r\n ans+=1\r\n check = arr[i][1]\r\nprint(ans)\r\n"]

{"inputs": [["4", "2 5", "9 7", "15 6", "9 3", "Sample output:", "3"]], "outputs": [[]]}

INTERVIEW

PYTHON3

CODECHEF

1,271

2a330741cbcf50a6fa4d57b4b357f486

UNKNOWN

Chef Loves to listen to remix songs, but currently he had already finished the entire playlist of remix songs. As Chef is smart, so he thought let's make my own remix songs of the original songs. Chef is not having much knowledge of making remix songs, so he came up with the simple technique in which he will pick the word which contains the smallest number of characters from the lyrics of the song, and then he will append that word to the start and end of the lyrics, also Chef will insert this word between every two words of the lyrics. Note: While inserting a new word Chef will also insert extra white-spaces, so that every word in the final remixed lyrics is separated by space. It is Recommended to use fast Input/Ouput techniques. -----Input:----- - The input contains the text $S$, which denotes the lyrics of the song. -----Output:----- - Print the Remixed, lyrics as done by Chef. -----Constraints:----- - $1 \leq Length of text $S$ \leq 10^7$ -----Sample Input:----- Mai Hu Jiyaan -----Sample Output:----- Hu Mai Hu Hu Hu Jiyaan Hu

["m= 9999999\r\nword=''\r\np= ''\r\ntry:\r\n s=input().split()\r\n for i in s:\r\n if(len(i) <= m):\r\n m = len(i)\r\n word = i\r\n p = word\r\n for i in s:\r\n p+= (' '+i+' '+ word)\r\n \r\n print(p)\r\n\r\n \r\nexcept EOFError:\r\n\r\n pass", "s=input()\ns=s.split(\" \")\n\n# print(s)\na=[]\ns1=[]\nfor _ in range(len(s)):\n if s[_]!='':\n s1.append(s[_]) \nfor _ in range(len(s1)):\n a.append(len(s1[_]))\n# print(a) \naa=a.index(min(a))\nss=s1[aa]\nprint(ss,end=\" \")\nfor _ in range(len(s1)):\n print(s1[_],ss,end=\" \")\n # print(ss,end=\" \") ", "from math import inf\nfrom sys import stdin\ninput=stdin.readline\na=input().split()\nmi=inf\nind=0\nn=len(a)\nfor i in range(n):\n if mi>len(a[i]):\n mi=len(a[i])\n ind=i\nfor i in range(n):\n print(a[ind],a[i],end=\" \")\nprint(a[ind])", "# cook your dish here\ns=list(input().split())\na=min(s,key=len)\nfor i in s:\n print(a,i,end=\" \")\nprint(a)\n", "l=input().split()\nmins=l[0]\nfor s in l:\n if len(s)<len(mins):\n mins=s\nans=mins\nfor s in l:\n ans+=\" \"+s+\" \"+mins\nprint(ans)", "def f(inp): \n length = len(inp) \n si = ei = 0\n min_length = length \n min_start_index = max_length = max_start_index = 0\n \n # loop to find the length and stating index \n # of both longest and shortest words \n while ei <= length: \n if (ei < length) and (inp[ei] != \" \"): \n ei += 1\n else: \n curr_length = ei - si \n \n # condition checking for the shortest word \n if curr_length < min_length: \n min_length = curr_length \n min_start_index = si \n \n # condition for the longest word \n if curr_length > max_length: \n max_length = curr_length \n max_start_index = si \n ei += 1\n si = ei \n \n # extracting the shortest word using \n # it's starting index and length \n minWord = inp[min_start_index : \n min_start_index + min_length] \n \n # extracting the longest word using \n # it's starting index and length \n maxWord = inp[max_start_index : max_length] \n \n # printing the final result \n return minWord\n #print(\"Minimum length word: \", minWord) \n #print(\"Maximum length word: \", maxWord) \n\ns=input().strip()\nw=f(s)\ns=list(s.split())\nprint(w,end=' ')\nfor i in s:\n print(i,end=' ')\n print(w,end=' ')", "lyrics = list(map(str, input().rstrip().split(\" \")))\r\nmini1 = lyrics[0]\r\nfor i in lyrics:\r\n if len(i) < len(mini1):\r\n mini1 = i\r\nt = 0\r\nremix = []\r\nwhile True:\r\n try:\r\n remix.append(mini1)\r\n remix.append(lyrics[t])\r\n t+=1\r\n except IndexError:\r\n break\r\nprint(\" \".join(remix), end=\"\")", "s=input().split()\r\nk = min(s,key=len)\r\nn= len(s)\r\nprint(k,end=\" \")\r\nfor i in range(n):\r\n print(s[i],k,end=\" \")", "l=list(map(str,input().split()))\r\nma=float(\"inf\")\r\nfor i in l:\r\n if(len(i)<ma):\r\n ma=len(i)\r\n v=i\r\nn=len(l)\r\nk=[]\r\nfor i in range(n):\r\n k.append(l[i])\r\n if(i!=n-1):\r\n k.append(v)\r\nk.append(v)\r\nk.insert(0,v)\r\nst=\" \".join(k)\r\nprint(st)\r\n", "S = input().split()\nN=len(S)\nsml=len(S[0])\nval=S[0]\nfor i in S:\n if len(i)<sml:\n sml=len(i)\n val=i\nprint(val,end=' ')\ni=0\nwhile i<N:\n print(S[i],val,end=' ')\n i+=1", "# cook your dish here\ns = input().strip()\n\ns_arr = s.split()\n\nres = \"z\" * 100000000\nfor ele in s_arr:\n if len(res) > len(ele):\n res = ele\n elif len(res) == len(ele):\n res = min(res, ele)\n \nprint(res, end = \" \")\nfor ele in s_arr:\n print(ele, end = \" \")\n print(res, end = \" \")", "str=input()\nss=str.split()\nxcr=None\nxcxc=None\nfor wd in ss:\n if xcxc is None:\n xcr= len(wd)\n xcxc=wd\n else:\n if(len(wd)<xcr):\n xcr=len(wd)\n xcxc=wd\n \nprint(xcxc,end=' ')\nfor wd in ss:\n print(wd,xcxc,end=' ')", "s=list(input().split())\nmin=999999999\nr=\"\"\nfor i in range(len(s)):\n if(len(s[i])<min):\n min=len(s[i])\n r=s[i]\nprint(r,end=' ')\nfor i in s:\n print(i + \" \" + r,end=' ')\n#print(r,min)", "import math\ndef solve(s):\n li=s.split()\n n=len(li)\n l=len(li[0])\n m=\"\"\n for i in range(1,n):\n if l>=len(li[i]):\n l=len(li[i])\n m=li[i]\n \n res=\"\"\n res+=m\n for i in li:\n res+=\" \"\n res+=i\n res+=\" \"\n res+=m\n print(res)\n\n\ndef __starting_point():\n try:\n s=input().strip()\n solve(s)\n except:\n pass\n__starting_point()", "s = input()\r\nl = s.split()\r\na = 1000000000000000000\r\nsmallest = 'z'*100000000\r\nfor i in range(0, len(l)):\r\n if len(l[i])<a:\r\n smallest = l[i]\r\n a = len(l[i])\r\nll = []\r\nfor i in range(len(l)):\r\n print(smallest, end=' ')\r\n print(l[i], end=' ')\r\nprint(smallest, end='')", "# cook your dish here\na=list(map(str, input().split()))\nb=[]\nfor j in a:\n b.append(len(j))\nx=b.index(min(b))\ny=a[x]\ni=0\nwhile(i<len(a)):\n print(y,end=' ')\n print(a[i],end=' ')\n i+=1\nprint(y)\n", "lst=input().split()\r\nm=min(lst, key=len)\r\nfor i in range(len(lst)):\r\n print(m,lst[i],end=\" \")\r\nprint(m)", "l=list(map(str,input().split()))\r\nma=float(\"inf\")\r\nfor i in l:\r\n if(len(i)<ma):\r\n ma=len(i)\r\n v=i\r\nn=len(l)\r\nk=[]\r\nfor i in range(n):\r\n k.append(l[i])\r\n if(i!=n-1):\r\n k.append(v)\r\nk.append(v)\r\nk.insert(0,v)\r\nst=\" \".join(k)\r\nprint(st)\r\n", "x=[str(x)for x in input ().split()]\ny=x[:]\nx.sort(key=len)\nele=x[0]\nleng=len(x)\nfor i in range(0,leng):\n print(ele+\" \"+y[i],end=\" \")\nprint(ele)\n\n", "S=list(input().split())\r\nmin=S[0]\r\nml=len(S[0])\r\nans=[]\r\nfor i in S:\r\n if len(i)<ml:\r\n ml=len(i)\r\n min=i\r\nfor j in range(len(S)):\r\n print(min,end=\" \")\r\n print(S[j],end=\" \")\r\nprint(min)", "try:\r\n str1=list(map(str,input().rstrip().split()))\r\n z=[]\r\n m=[]\r\n for i in range(len(str1)):\r\n a=len(str1[i])\r\n m.append(a)\r\n k=min(m)\r\n l=m.index(k)\r\n for i in range(len(str1)):\r\n z.append(str1[i])\r\n z.append(str1[l])\r\n z.insert(0,str1[l])\r\n print(*z)\r\nexcept:pass\r\n", "try:\r\n a=input().split()\r\n l=[*[len(i) for i in a]]\r\n b=a[l.index(min(l))]\r\n print(b+\" \" +\" {} \".format(b).join(a)+ \" \" +b)\r\nexcept: pass\r\n", "s = list(map(str,input().split()))\r\nres = min(s,key = len)\r\nfor i in range(len(s)):\r\n print(res,s[i],end=' ')\r\nprint(res)"]

{"inputs": [["Mai Hu Jiyaan"]], "outputs": [["Hu Mai Hu Hu Hu Jiyaan Hu"]]}

INTERVIEW

PYTHON3

CODECHEF

6,989

aa809cabe3ad0e94e59046e553e31359

UNKNOWN

----- Statement ----- You need to find a string which has exactly K positions in it such that the character at that position comes alphabetically later than the character immediately after it. If there are many such strings, print the one which has the shortest length. If there is still a tie, print the string which comes the lexicographically earliest (would occur earlier in a dictionary). -----Input----- The first line contains the number of test cases T. Each test case contains an integer K (≤ 100). -----Output----- Output T lines, one for each test case, containing the required string. Use only lower-case letters a-z. -----Sample Input ----- 2 1 2 -----Sample Output----- ba cba

["for i in range(int(input())):\n N = int(input())\n s = 'zyxwvutsrqponmlkjihgfedcba'\n r = ''\n while True:\n r = s[-N-1:] + r \n if N < 26:\n break\n N -= 25\n print(r)", "s='abcdefghijklmnopqrstuvwxyz'\nfor u in range(int(input())):\n n=int(input())\n r=''\n while(1):\n r=s[n::-1]+r\n if(n<26):\n break\n n=n-25\n print(r)", "s='abcdefghijklmnopqrstuvwxyz'\nfor u in range(int(input())):\n n=int(input())\n r=''\n while(1):\n r=s[n::-1]+r\n if(n<26):\n break\n n-=25\n print(r)", "t = int(input())\n\nwhile t:\n k = int(input())\n \n r = k % 25\n k -= r\n q = k // 25\n \n if r != 0:\n for i in range(r+97,96,-1):\n print(chr(i), end = \"\")\n \n while q:\n for i in range(122,96,-1):\n print(chr(i), end = \"\")\n q -= 1\n \n print(end = \"\\n\")\n \n t -= 1", "l=\"abcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxy\u00a0\u00a0\u00a0\u00a0zabcdefghijklmnopqrstuvwxyz\"\nfor _ in range(int(input())):\n n=int(input())\n #print(len(l))\n x=n//25\n if(n%25==0):\n x=x-1\n x=n+1+x\n s=l[:x]\n print(s[::-1]) \n", "def printrev(start):\n for s in range(start , ord('a')-1, -1) :\n print(chr(s), end='')\n\ntestcase = int(input())\nwhile testcase:\n \n k = int(input())\n \n \n rem = k % 25\n quo = k // 25 \n if rem != 0 :\n printrev(97 + rem)\n \n for _ in range(quo) :\n printrev(ord('z'))\n \n print()\n \n \n \n testcase -= 1\n \n \n \n \n \n \n \n \n \n ", "def printrev(start):\n for s in range(start , ord('a')-1, -1) :\n print(chr(s), end='')\n\ntestcase = int(input())\nwhile testcase:\n \n k = int(input())\n \n if k > 25 :\n rem = k % 25\n quo = k // 25 \n if rem != 0 :\n printrev(97 + rem)\n \n for _ in range(quo) :\n printrev(ord('z'))\n \n print()\n \n else:\n printrev(97 + k)\n print()\n \n testcase -= 1\n \n \n \n \n \n \n \n \n \n ", "# cook your dish here\ns=\"abcdefghijklmnopqrstuvwxyz\"\nfor _ in range(0,int(input())):\n n=int(input())\n a=''\n while True:\n a=s[n::-1]+a\n if n<26: \n break\n n=n-25\n print(a)", "for t in range(int(input())):\n n=int(input())\n s, ans = \"abcdefghijklmnopqrstuvwxyz\", \"\"\n while True:\n ans=s[n::-1] + ans\n if n<26:\n break\n else:\n n-=25\n print(ans)", "# cook your dish here\nfor _ in range(int(input())):\n n=int(input())\n s, ans=\"abcdefghijklmnopqrstuvwxyz\", \"\"\n while True:\n ans = s[n::-1] + ans\n if n<26:\n break\n else:\n n -= 25\n print(ans)", "for _ in range(int(input())):\n n=int(input())\n s, ans=\"abcdefghijklmnopqrstuvwxyz\", \"\"\n while True:\n ans = s[n::-1] + ans\n if n<26:\n break\n else:\n n -= 25\n print(ans)", "# cook your dish here\nt=int(input())\nfor _ in range(t):\n n=int(input())\n res='abcdefghijklmnopqrstuvwxyz'\n ans=''\n \n while True:\n \n ans = res[n::-1] + ans\n \n if n<26:\n break\n \n else:\n n-=25\n \n print(ans)", "for _ in range(int(input())):\n k=int(input())\n ar=[]\n for i in range(97,123,1):\n ar.append(chr(i))\n st=\"\".join(ar)\n an=\"\"\n while 1:\n an=st[k::-1]+an\n if k<26:\n break\n k-=25\n \n \n print(an)\n", "t = int(input())\ns = 'abcdefghijklmnopqrstuvwxyz'\nl = []\nfor i in range(t):\n n = int(input())\n a=n//25\n b=n%25\n if(n%25==0):\n p = s[::-1]*(a)\n else:\n p = s[:1+b][::-1] + s[::-1]*(a)\n l.append(p)\nfor i in l:\n print(i)\n", "T = int(input())\nans = []\n\n# S = 'zyxwvutsrqponmlkjihgfedcba'\nS = 'abcdefghijklmnopqrstuvwxyz'\n\nfor _ in range(T):\n K = int(input())\n\n if(K%25==0):\n a = S[::-1]*(K//25)\n else:\n a = S[:1+K%25][::-1] + S[::-1]*(K//25)\n ans.append(a)\n\nfor i in ans:\n print(i)", "s='abcdefghijklmnopqrstuvwxyz'\nt=int(input())\nfor i in range(t):\n s1=''\n n=int(input())\n while(1):\n s1=s[n::-1]+s1\n if(n<26):\n break\n n=n-25\n print(s1)", "s='abcdefghijklmnopqrstuvwxyz'\nt=int(input())\nfor i in range(t):\n s1=''\n n=int(input())\n while(1):\n s1=s[n::-1]+s1\n if(n<26):\n break\n n=n-25\n print(s1)", "az='abcdefghijklmnopqrstuvwxyz'\nfor _ in range(int(input())):\n s=''\n a=int(input())\n while 1:\n s=az[a::-1]+s\n if a<26:\n break \n a=a-25 \n print(s)\n", "x='abcdefghijklmnopqrstuvwxyz'\nfor _ in range(int(input())):\n s=''\n a=int(input())\n while 1:\n s=x[a::-1]+s\n if a<26:\n break \n a=a-25 \n print(s)\n \n", "# cook your dish here\nx='abcdefghijklmnopqrstuvwxyz'\nfor _ in range(int(input())):\n s=''\n a=int(input())\n while 1:\n s=x[a::-1]+s\n if a<26:\n break \n a=a-25 \n print(s)", "# cook your dish here\nx='abcdefghijklmnopqrstuvwxyz'\nfor _ in range(int(input())):\n s=''\n a=int(input())\n while 1:\n s=x[a::-1]+s\n if a<26:\n break \n a=a-25 \n print(s)\n \n \n", "x = 'abcdefghijklmnopqrstuvwxyz'\nfor i in range(int(input())):\n num = int(input())\n r = ''\n while 1:\n r = x[num::-1]+r\n if num<26:\n break\n num-=25\n print(r)\n", "s='abcdefghijklmnopqrstuvwxyz'\nfor u in range(int(input())):\n n=int(input())\n r=''\n while(1):\n r=s[n::-1]+r\n if(n<26):\n break\n n-=25\n print(r)", "s='abcdefghijklmnopqrstuvwxyz'\nfor u in range(int(input())):\n n=int(input())\n r=''\n while(1):\n r=s[n::-1]+r\n if(n<26):\n break\n n-=25\n print(r)\n"]

{"inputs": [["2", "1", "2"]], "outputs": [["ba", "cba"]]}

INTERVIEW

PYTHON3

CODECHEF

5,132

08e7a923bf9b2b12686e47484de04b2b

UNKNOWN

You are given a grid with $R$ rows (numbered $1$ through $R$) and $C$ columns (numbered $1$ through $C$). A cell in row $r$ and column $c$ is denoted by $(r, c)$. Two cells in the grid are adjacent if they have a common side. For each valid $i$ and $j$, there is a value $a_{i, j}$ written in cell $a_{i, j}$. A cell in the grid is stable if the number of cells in the grid which are adjacent to this cell is strictly greater than the value written in this cell. The whole grid is stable if all cells in the grid are stable. Can you determine whether the grid is stable? -----Input----- - The first line of the input contains a single integer $T$ denoting the number of test cases. The description of $T$ test cases follows. - The first line of each test case contains two space-separated integers $R$ and $C$. - $R$ lines follow. For each $i$ ($1 \le i \le R$), the $i$-th of these lines contains $C$ space-separated integers $a_{i, 1}, a_{i, 2}, \ldots, a_{i, C}$. -----Output----- For each test case, print a single line containing the string "Stable" if the grid is stable or "Unstable" if it is unstable (without quotes). -----Constraints----- - $1 \le T \le 3,000$ - $3 \le R, C \le 10$ - $0 \le a_{i, j} \le 4$ for each valid $i, j$ -----Example Input----- 2 3 3 1 2 1 2 3 2 1 2 1 3 4 0 0 0 0 0 0 0 0 0 0 4 0 -----Example Output----- Stable Unstable -----Explanation----- Example case 1: Each cell of the grid is stable, so the grid is stable. Example case 2: The cell in row $3$ and column $3$ is unstable since the number of cells adjacent to this cell is $3$.

["for _ in range(int(input())):\n r,c = map(int,input().split())\n l = []\n for k in range(r):\n a = list(map(int,input().split()))\n l.append(a)\n ans = \"Stable\" \n for i in range(r):\n for j in range(c):\n p = l[i][j]\n count=0\n if i-1>=0 and j>=0:\n count+=1 \n if i>=0 and j-1>=0:\n count+=1 \n if i+1<=r-1 and j<=c-1:\n count+=1 \n if i<=r-1 and j+1<=c-1:\n count +=1\n if count<=p:\n ans = \"Unstable\"\n break\n print(ans) ", "# cook your dish here\ndef checkStability(inp_arr,R,C,i,j):\n cell_cnt=0\n for coordinates in ((i,j-1),(i,j+1),(i-1,j),(i+1,j)):\n r,c=coordinates\n if(r>=0\n and c>=0\n and r<R\n and c<C):\n cell_cnt+=1\n \n if(inp_arr[i][j]>=cell_cnt):\n return False\n return True\n \nfor _ in range(int(input())):\n R,C=(int(i) for i in input().strip(' ').split(' '))\n inp_arr=[]\n stableFlag=True\n printStr='Stable'\n for i in range(R):\n inp_arr.append(tuple(int(i) for i in input().strip(' ').split(' ')))\n for i in range(R):\n if(stableFlag==True):\n for j in range(C):\n stableFlag=checkStability(inp_arr,R,C,i,j)\n if(stableFlag==False):\n printStr='Unstable'\n break\n print(printStr)\n", "def adjacent(i,j,r,c):\n if i==0 or i==r-1:\n if j==0 or j==c-1:\n return 2\n else:\n return 3\n else:\n if j==0 or j==c-1:\n return 3\n else:\n return 4\n \n# cook your dish here\nfor _ in range(int(input())):\n r,c=map(int,input().split(\" \"))\n grid=[]\n flag=0\n for i in range(r):\n grid.append(list(map(int,input().split(\" \"))))\n for i in range(r):\n for j in range(c):\n if adjacent(i,j,r,c)<=grid[i][j]:\n flag=1\n break\n if flag==1:\n break\n if flag==1:\n print(\"Unstable\")\n else:\n print(\"Stable\")", "import numpy as np\nt = int(input())\nfor t in range(0,t):\n q= list(map (int, input().rstrip().split()))\n r=q[0]\n c=q[1]\n sum=0\n a = np.array([[int(x) for x in input().split()] for i in range(r)]) \n if(a[0][0]<2 and a[0][c-1]<2 and a[r-1][0]<2 and a[r-1][c-1]<2):\n sum+=4\n for j in range(1,c-1):\n if(a[0][j]<3 and a[r-1][j]<3):\n sum=sum+2\n \n for i in range(1,r-1):\n if(a[i][0]<3 and a[i][c-1]<3):\n sum=sum+2\n for j in range(1,r-1):\n for i in range(1,c-1):\n if(a[j][i]<4):\n sum=sum+1\n if(sum==r*c):\n print(\"Stable\")\n else:\n print(\"Unstable\")\n \n \n \n", "# cook your dish here\nimport math\nt=int(input())\n#t=1\n#res=[]\nfor i in range(t):\n #n=int(input())\n r,c=list(map(int,input().split()))\n #l=list(map(int,input().split()))\n res=[]\n for j in range(r):\n l=list(map(int,input().split()))\n res.append(l)\n flag=1\n for a in range(r):\n for b in range(c):\n adj=4\n if a==0 or a==r-1:\n adj-=1\n if b==0 or b==c-1:\n adj-=1\n if res[a][b]>=adj:\n flag=0\n break\n if (flag):\n print(\"Stable\")\n else:\n print(\"Unstable\")\n", "def check(r, c, a):\n for i in range(r):\n for j in range(c):\n adj = 4\n if i == 0 or i == r-1:\n adj -= 1\n if j == 0 or j == c-1:\n adj -= 1\n if a[i][j]>=adj:\n return \"Unstable\"\n \n return \"Stable\"\n\nfor _ in range(int(input())):\n d = input().split()\n r = int(d[0])\n c = int(d[1])\n a = []\n for i in range(r):\n a.append(list(map(int, input().split())))\n print(check(r, c, a))", "for _ in range(int(input())):\n N, M = map(int, input().split())\n L = []\n for i in range(N):\n L.append(list(map(int, input().split())))\n flag = True\n for i in range(N):\n for j in range(M):\n k = 0\n if i-1 >= 0:\n k += 1\n if i+1 < N:\n k += 1 \n if j-1 >= 0:\n k += 1 \n if j+1 < M:\n k += 1 \n if k <= L[i][j]:\n flag = False\n break\n if not flag:\n break\n print('Stable' if flag else 'Unstable')", "t = int(input())\n\ndef numOfCordinates(arr, raw_arr, r, c):\n num = 0\n possibleCords = [[r-1, c], [r+1,c], [r, c+1], [r, c-1]]\n \n for cords in possibleCords:\n if cords in raw_arr:\n num+=1\n \n return num\n \n\nfor _ in range(1,t + 1):\n \n (r,c) = map(int, input().split(\" \"))\n \n arr = []\n for i in range(r):\n ri = list(map(int, input().split(\" \")))[:c]\n arr.append(ri)\n \n\n raw_arr = []\n for ri in range(r):\n \n for ci in range(c):\n raw_arr.append([ri,ci])\n \n\n for r in range(len(arr)):\n \n for c in range(len(arr[r])):\n no_cords = numOfCordinates(arr, raw_arr, r, c) \n \n if no_cords == -1:\n arr[r][c] = -1\n \n elif arr[r][c] < no_cords:\n arr[r][c] = 0\n \n else:\n arr[r][c] = -1\n \n \n s = 0\n for ls in arr:\n s += sum(ls)\n \n if s==0:\n print(\"Stable\")\n else:\n print(\"Unstable\")", "# cook your dish here\nfor _ in range(int(input())):\n r, c = map(int, input().split())\n a = []\n for i in range(r):\n a.append(list(map(int, input().split())))\n cont = True\n for i in range(r):\n for j in range(c):\n if ((i == 0 and j == c-1) or (i == r-1 and j == 0)\n or (i == r-1 and j == c-1) or (i == 0 and j == 0)):\n if a[i][j] >1:\n cont = False\n break\n elif i == 0 or i == r-1 or j == 0 or j == c-1:\n if a[i][j] > 2:\n cont = False\n break\n else:\n if a[i][j] >3:\n cont = False\n break\n if cont == False:\n print('Unstable')\n break\n else:\n print('Stable')"]

{"inputs": [["2", "3 3", "1 2 1", "2 3 2", "1 2 1", "3 4", "0 0 0 0", "0 0 0 0", "0 0 4 0"]], "outputs": [["Stable", "Unstable"]]}

INTERVIEW

PYTHON3

CODECHEF

5,204

613f634fa50b1a659f5185accf6f2fa0

UNKNOWN

There is a rectangular grid of cells consisting of n rows and m columns. You will place a robot on one of the grid cells and provide it with a command string s, consisting of characters ‘L’, ‘R’, ‘U’, ‘D’. After being placed, the robot will follow the instructions of the command string, where 'L' corresponds moving to the left, 'R' towards the right, 'U' for moving up, and 'D' means down. You have already selected the command string s, and are wondering if it is possible to place the robot in one of the grid cells initially and have it always stay entirely within the grid upon execution of the command string s. Output “safe” if there is a starting cell for which the robot doesn’t fall off the grid on following command s, otherwise, output "unsafe". -----Input----- The first line of input will contain an integer T, the number of test cases. Each test case will be on two lines. The first line will have two space separated integers n,m. The second line will have the command string s. -----Output----- For each test case, output "safe" (without quotes) or "unsafe" (without quotes) in a new line. -----Constraints----- - 1 ≤ T ≤ 1,000 - 1 ≤ n,m ≤ 10 - 1 ≤ |s| ≤ 10 -----Example----- Input: 5 1 1 R 2 3 LLRU 3 2 LLRU 4 3 ULURUDRDLD 3 6 RURUR Output: unsafe safe unsafe safe safe -----Explanation----- For the first case, there is only one grid square, so we must place our robot there. When the robot follows the command, it'll fall off, so it is unsafe. For the second case, we can place the robot on the bottom right grid square. Here is an image denoting the moves that the robot will make.

["# cook your dish here\ntest=int(input())\nfor _ in range(test):\n b=list(map(int,str(input()).split(' ')))\n c=str(input())\n li1=[0]\n li2=[0]\n for i1 in range(len(c)):\n if c[i1]=='R':\n li1.append(li1[len(li1)-1]+1)\n elif c[i1]=='L':\n li1.append(li1[len(li1)-1]-1)\n elif c[i1]=='U':\n li2.append(li2[len(li2)-1]+1)\n else:\n li2.append(li2[len(li2)-1]-1)\n if (max(li1)-min(li1)+1)<=b[1] and (max(li2)-min(li2)+1)<=b[0]:\n print('safe')\n else:\n print('unsafe')", "# cook your dish here\na = int(input())\nfor i in range(a):\n b = list(map(int,str(input()).split(' ')))\n c = str(input())\n li1 = [0]\n li2 = [0]\n for i1 in range(len(c)):\n if c[i1]=='R':\n li1.append(li1[len(li1)-1]+1)\n elif c[i1]=='L':\n li1.append(li1[len(li1)-1]-1)\n elif c[i1]=='U':\n li2.append(li2[len(li2)-1]+1)\n else:\n li2.append(li2[len(li2)-1]-1)\n if (max(li1)-min(li1)+1)<=b[1] and (max(li2)-min(li2)+1)<=b[0]:\n print('safe')\n else:\n print('unsafe')", "for u in range(int(input())):\n n,m=map(int,input().split())\n st=input()\n f=0\n for i in range(n):\n for j in range(m):\n x=i \n y=j\n for k in range(len(st)):\n if st[k]=='L':\n y=y-1\n elif st[k]=='R':\n y=y+1\n elif st[k]=='U':\n x=x-1\n elif st[k]=='D':\n x=x+1\n if x>=0 and x<n and y>=0 and y<m:\n ll=0\n else:\n break\n if x>=0 and x<n and y>=0 and y<m:\n f=1\n if f==1:\n print(\"safe\")\n else:\n print(\"unsafe\")", "for _ in range(int(input())):\n n,m=map(int,input().split())\n s=input()\n t1,t2,t3,t4=0,0,0,0\n # d={'L':0,'R':1,'U':2,'D':3}\n # l=[0,0,0,0]\n xp,xn,yp,yn=0,0,0,0\n c1,c2=0,0\n for i,x in enumerate(s):\n if x=='L':\n c1-=1\n elif x=='R':\n c1+=1\n elif x=='U':\n c2+=1\n else:\n c2-=1\n xp=max(xp,c1) \n xn=min(xn,c1)\n yp=max(yp,c2)\n yn=min(yn,c2) \n if abs(xp-xn+1)<=m and abs(yp-yn+1)<=n:\n print('safe')\n else:\n print('unsafe')", "# cook your dish here\n# cook your dish here\nt=int(input())\nfor i in range(t):\n s=input().split()\n n=int(s[0])\n m=int(s[1])\n st=input()\n f=0\n for i in range(n):\n for j in range(m):\n x=i \n y=j\n for k in range(len(st)):\n if st[k]=='L':\n y=y-1\n elif st[k]=='R':\n y=y+1\n elif st[k]=='U':\n x=x-1\n elif st[k]=='D':\n x=x+1\n if x>=0 and x<n and y>=0 and y<m:\n ll=0\n else:\n break\n if x>=0 and x<n and y>=0 and y<m:\n f=1\n if f==1:\n print(\"safe\")\n else:\n print(\"unsafe\")\n", "# cook your dish here\nt=int(input())\nfor i in range(t):\n s=input().split()\n n=int(s[0])\n m=int(s[1])\n st=input()\n f=0\n for i in range(n):\n for j in range(m):\n x=i \n y=j\n for k in range(len(st)):\n if st[k]=='L':\n y=y-1\n elif st[k]=='R':\n y=y+1\n elif st[k]=='U':\n x=x-1\n elif st[k]=='D':\n x=x+1\n if x>=0 and x<n and y>=0 and y<m:\n ll=0\n else:\n break\n if x>=0 and x<n and y>=0 and y<m:\n f=1\n if f==1:\n print(\"safe\")\n else:\n print(\"unsafe\")\n", "def is_safe(n,m,i,j,s):\n for k in s:\n if(k=='L'):\n j-=1\n if(k=='R'):\n j+=1\n if(k=='U'):\n i-=1\n if(k=='D'):\n i+=1\n if((i<1 or i>n) or (j<1 or j>m)):\n return -1\n return 1\nfor _ in range(int(input())):\n n,m=[int(x) for x in input().split()]\n s=input()\n flag=0\n l,r,u,d=0,0,0,0\n for i1 in range(1,n+1):\n for i2 in range(1,m+1):\n res=is_safe(n,m,i1,i2,s)\n if res==1:\n flag=1\n break\n else:\n continue\n break\n\n if(flag==1):\n print(\"safe\")\n else:\n print(\"unsafe\")", "for _ in range(int(input())):\n n,m=[int(x) for x in input().split()]\n command=input()\n maxL=0\n maxR=0\n hom=0\n maxU=0\n maxD=0\n vem=0\n for co in command:\n if(co==\"L\"):\n hom+=1\n elif(co==\"R\"):\n hom-=1\n elif(co==\"U\"):\n vem+=1\n else:\n vem-=1\n if(hom>maxL):\n maxL=hom\n if(hom<maxR):\n maxR=hom\n if(vem>maxU):\n maxU=vem\n if(vem<maxD):\n maxD=vem\n if(maxL-maxR<m and maxU-maxD<n):\n print(\"safe\")\n else:\n print(\"unsafe\")\n", "for _ in range(int(input())):\n n,k=map(int,input().split())\n s=input()\n a, b = [0], [0]\n x = y = 0\n for i in s:\n if i == 'U':\n x -= 1\n a.append(x)\n elif i == 'D':\n x += 1\n a.append(x)\n elif i == 'L':\n y -= 1\n b.append(y)\n elif i == 'R':\n y += 1\n b.append(y)\n\n row = max(a) - min(a) + 1\n col = max(b) - min(b) + 1\n if row > n or col > k:\n print('unsafe')\n else:\n print('safe')", "for _ in range(int(input())):\n n,k=map(int,input().split())\n s=input()\n a, b = [0], [0]\n x = y = 0\n for i in s:\n if i == 'U':\n x -= 1\n a.append(x)\n elif i == 'D':\n x += 1\n a.append(x)\n elif i == 'L':\n y -= 1\n b.append(y)\n elif i == 'R':\n y += 1\n b.append(y)\n\n row = max(a) - min(a) + 1\n col = max(b) - min(b) + 1\n if row > n or col > k:\n print('unsafe')\n else:\n print('safe')", "for _ in range(int(input())):\n n, m = map(int, input().split())\n s = input()\n ans = 'unsafe'\n\n for i in range(n):\n for j in range(m):\n x, y = i, j\n res = 1\n for k in s:\n if k == 'L':\n y -= 1\n elif k == 'U':\n x -= 1\n elif k == 'R':\n y += 1\n else:\n x += 1\n if x < 0 or x >= n or y < 0 or y >= m:\n res = 0\n break\n\n if res:\n ans = 'safe'\n break \n print(ans)", "t=int(input())\nfor l in range(t):\n n,m=list(map(int,input().split()))\n a=False\n s=input()\n for i in range(1,n+1):\n \n for j in range(1,m+1):\n x=i\n y=j\n loulou=False\n for h in range(len(s)):\n \n if s[h]=='L':\n y=y-1\n elif s[h]=='R':\n y=y+1\n elif s[h]=='U':\n x=x+1\n else:\n x=x-1\n if x<1 or x>n or y<1 or y>m :\n loulou=True\n \n break\n \n \n \n if loulou==False :\n a=True\n \n print('safe')\n break\n if a==True:\n break\n if a==False:\n print('unsafe')\n", "t=int(input())\nfor _ in range(t):\n n,m=list(map(int,input().split()))\n s=input()\n flag=False\n for i in range(n):\n for j in range(m):\n x,y=i,j\n c=True\n for k in s:\n if k=='L':\n y-=1\n elif k=='U':\n x+=1\n elif k=='D':\n x-=1\n else:\n y+=1\n if x<0 or x>n-1 or y<0 or y>m-1:\n c=False\n break\n if c:\n flag=True\n break\n if flag:\n break\n if flag:\n print('safe')\n else:\n print('unsafe')\n", "for _ in range(int(input())):\n n , m = list(map(int,input().split()))\n s = input()\n r = c = 0\n arr = [0,0,0,0]\n for i in s:\n if i == 'R':\n c += 1\n elif i == 'L':\n c -= 1\n elif i == 'U':\n r += 1\n elif i == 'D':\n r -= 1\n if r<0:\n if arr[0] < abs(r):\n arr[0] = abs(r)\n else:\n if arr[1] < r:\n arr[1] = r\n\n if c<0:\n if arr[2] < abs(c):\n arr[2] = abs(c)\n else:\n if arr[3] < c :\n arr[3] = c\n if arr[0]+arr[1]>=n or arr[2]+arr[3]>=m:\n print('unsafe')\n else:\n print('safe')\n r=c=0\n \n", "\n\nt = int(input())\n\n\nfor _ in range(t):\n n,m = list(map(int,input().split()))\n s = input()\n flag = 0\n for i in range(n):\n for j in range(m):\n x = i\n y = j\n for k in s:\n if k == 'L':\n y-=1\n elif k == 'U':\n x-=1\n elif k == 'D':\n x+=1\n elif k == 'R':\n y+=1\n\n if x<0 or x>=n or y<0 or y>=m:\n break\n\n if 0<=x<=n-1 and 0<=y<=m-1:\n flag = 1\n break\n if flag == 1:\n break\n if flag == 1:\n print('safe')\n else:\n print('unsafe')\n\n\n\n\n\n\n", "import math\nt=int(input())\nfor test in range(t):\n n,m=list(map(int,input().split()))\n up=0\n down=0\n left=0\n right=0\n s=input()\n f=0\n for i in s:\n if i==\"L\":\n left+=1\n if right>0:\n right-=1\n if left==m:\n break\n if i==\"R\":\n right+=1\n if left>0:\n left-=1\n if right==m:\n break\n if i==\"U\":\n up+=1\n if down>0:\n down-=1\n if up==n:\n break\n if i==\"D\":\n down+=1\n if up>0:\n up-=1\n if down==n:\n break\n if abs(down)<n and abs(up)<n and abs(left)<m and abs(right)<m:\n print(\"safe\")\n else:\n print(\"unsafe\")\n", "import math\nt=int(input())\nfor test in range(t):\n n,m=list(map(int,input().split()))\n up=0\n down=0\n left=0\n right=0\n s=input()\n f=0\n for i in s:\n if i==\"L\":\n left+=1\n if right>0:\n right-=1\n if left==m:\n break\n if i==\"R\":\n right+=1\n if left>0:\n left-=1\n if right==m:\n break\n if i==\"U\":\n up+=1\n if down>0:\n down-=1\n if up==n:\n break\n if i==\"D\":\n down+=1\n if up>0:\n up-=1\n if down==n:\n break\n if abs(down)<n and abs(up)<n and abs(left)<m and abs(right)<m:\n print(\"safe\")\n else:\n print(\"unsafe\")\n", "for _ in range(int(input())):\n n,m = map(int,input().split())\n s = input()\n r,l,u,d=0,0,0,0 #displacement from starting position\n x,y=0,0\n for i in s:\n if i=='U':\n y+=1\n elif i=='D':\n y-=1\n elif i=='R':\n x+=1\n else:\n x-=1\n if x>r:\n r=x\n elif x<l:\n l=x\n elif y>u:\n u=y\n elif y<d:\n d=y\n #print(u,d,l,r)\n if n>abs(u)+abs(d) and m>abs(l)+abs(r):\n print(\"safe\")\n else:\n print(\"unsafe\")"]

{"inputs": [["5", "1 1", "R", "2 3", "LLRU", "3 2", "LLRU", "4 3", "ULURUDRDLD", "3 6", "RURUR"]], "outputs": [["unsafe", "safe", "unsafe", "safe", "safe"]]}

INTERVIEW

PYTHON3

CODECHEF

9,048

fd93760d21214e26a0b9e8d4c121db51

UNKNOWN

Consider the infinite x$x$ axis. There are N$N$ impacts on this X-axis at integral points (X1$X_1$,X2$X_2$,....XN$X_N$) (all distinct) . An impact at a point X$X$i propagates such that at a point X$X$0, the effect of the impact is K|Xi−X0|$K^{|X_i - X_0|}$. Given the point X0$X_0$, N$N$ and K$K$. Assume the total impact on X0$X_0$ is M$M$, find if it is possible to do so.Note: You are not required to find the set X Formally print "yes" if this is possible and "no" if not possible. -----Input:----- - First line will contain T$T$, number of testcases. Then the testcases follow. - Each testcase contains of a single line of input, four integers N$N$,K$K$,M$M$,X$X$0 -----Output:----- - The output of each test case is either "yes" or "no" -----Constraints ----- - 1≤T≤1000$1\leq T \leq 1000$ - 1≤N≤100$1\leq N \leq 100$ - 1≤K≤1000$1\leq K \leq 1000$ - 1≤M≤1018$1\leq M \leq 10^{18}$ - −109≤X0≤109$-10^9 \leq X_0 \leq 10^9$ -----Sample Input:----- 2 4 3 10 10 2 3 10 10 -----Sample Output:----- no yes

["# cook your dish here\nT = int(input())\nfor i in range(T):\n l = list(map(int, input().split()))\n n, k, m, x = l[0], l[1], l[2], l[3]\n if k == 1:\n if n == m:\n print(\"yes\")\n else:\n print(\"no\")\n elif m % k > 1:\n print(\"no\")\n elif k == 2:\n stack = []\n var = 0\n while m != 0:\n var += m % k\n stack.append(m % k)\n m //= k\n if var > n:\n print(\"no\")\n elif var == n:\n print(\"yes\")\n else:\n for p in range(100):\n for q in range(2, len(stack)):\n if stack[q - 1] == 0 and stack[q] >= 1:\n stack[q-1] = 2\n stack[q] -= 1\n var += 1\n if var == n:\n print(\"yes\")\n if var < n:\n print(\"no\")\n else:\n temp = 0\n rog = 1\n while m != 0:\n if m % k > 2:\n rog = 0\n print(\"no\")\n temp += m % k\n m //= k\n if rog:\n if temp == n:\n print(\"yes\")\n else:\n print(\"no\")\n\n", "# cook your dish here\nT = int(input())\nfor i in range(T):\n l = list(map(int, input().split()))\n n, k, m, x = l[0], l[1], l[2], l[3]\n if k == 1:\n if n == m:\n print(\"yes\")\n else:\n print(\"no\")\n elif m % k > 1:\n print(\"no\")\n elif k == 2:\n stack = []\n var = 0\n while m != 0:\n var += m % k\n stack.append(m % k)\n m //= k\n if var > n:\n print(\"no\")\n elif var == n:\n print(\"yes\")\n else:\n for p in range(100):\n for q in range(2, len(stack)):\n if stack[q - 1] == 0 and stack[q] >= 1:\n stack[q-1] = 2\n stack[q] -= 1\n var += 1\n if var == n:\n print(\"yes\")\n if var < n:\n print(\"no\")\n else:\n temp = 0\n rog = 1\n while m != 0:\n if m % k > 2:\n rog = 0\n print(\"no\")\n temp += m % k\n m //= k\n if rog:\n if temp == n:\n print(\"yes\")\n else:\n print(\"no\")\n", "T = int(input())\nfor i in range(T):\n l = list(map(int, input().split()))\n n, k, m, x = l[0], l[1], l[2], l[3]\n if k == 1:\n if n == m:\n print(\"yes\")\n else:\n print(\"no\")\n elif m % k > 1:\n print(\"no\")\n elif k == 2:\n stack = []\n var = 0\n while m != 0:\n var += m % k\n stack.append(m % k)\n m //= k\n if var > n:\n print(\"no\")\n elif var == n:\n print(\"yes\")\n else:\n for p in range(1000):\n for q in range(2, len(stack)):\n if stack[q - 1] == 0 and stack[q] >= 1:\n stack[q-1] = 2\n stack[q] -= 1\n var += 1\n if var == n:\n print(\"yes\")\n if var < n:\n print(\"no\")\n else:\n temp = 0\n rog = 1\n while m != 0:\n if m % k > 2:\n rog = 0\n print(\"no\")\n temp += m % k\n m //= k\n if rog:\n if temp == n:\n print(\"yes\")\n else:\n print(\"no\")\n\n", "# cook your dish here\nfrom math import log\ntry:\n for i in range (int(input())):\n a = input().split(\" \")\n n,k,x,m = map(int,a)\n ans = \"no\"\n u = 0\n \n if k != 2 and k != 1:\n if x%k == 0:\n x //= k\n u = -1\n elif x%k == 1:\n n -= 1\n x //= k\n u = -1\n \n if u == -1: \n while x != 0:\n if x%k == 0:\n x //= k\n elif x%k == 1:\n x //= k\n n -= 1\n elif x%k == 2:\n x //= k\n n -= 2\n else:\n break\n \n if n == 0 and x == 0:\n ans = \"yes\"\n \n elif k == 1:\n if x == n:\n ans = \"yes\"\n \n else:\n lst = []\n p = 0\n N = n\n while x != 0:\n if x%2 == 0:\n x //= 2\n p += 1\n elif x%2 == 1:\n x //= 2\n n -= 1\n p += 1\n lst.append(2**(p-1))\n \n if len(lst) == N:\n ans = \"yes\"\n \n if len(lst) < N:\n k = 0\n g = len(lst)\n if lst[0] > 2:\n g += int(log(lst[0])//log(2))-1\n k = 1\n for i in range(1,len(lst)):\n if k == 1:\n g += int(log(lst[i]//lst[i-1],2))\n elif lst[i] > 2*lst[i-1]:\n g += int(log(lst[i]//lst[i-1],2))-1\n k = 1\n else:\n k = 0\n if g >= N:\n ans = \"yes\"\n \n print(ans)\nexcept EOFError as e : pass\n ", "from math import log\ntry:\n for i in range (int(input())):\n a = input().split(\" \")\n n,k,x,m = map(int,a)\n ans = \"no\"\n u = 0\n \n if k != 2 and k != 1:\n if x%k == 0:\n x //= k\n u = -1\n elif x%k == 1:\n n -= 1\n x //= k\n u = -1\n \n if u == -1: \n while x != 0:\n if x%k == 0:\n x //= k\n elif x%k == 1:\n x //= k\n n -= 1\n elif x%k == 2:\n x //= k\n n -= 2\n else:\n break\n \n if n == 0 and x == 0:\n ans = \"yes\"\n \n elif k == 1:\n if x == n:\n ans = \"yes\"\n \n else:\n lst = []\n p = 0\n N = n\n while x != 0:\n if x%2 == 0:\n x //= 2\n p += 1\n elif x%2 == 1:\n x //= 2\n n -= 1\n p += 1\n lst.append(2**(p-1))\n \n if len(lst) == N:\n ans = \"yes\"\n \n if len(lst) < N:\n k = 0\n g = len(lst)\n if lst[0] > 2:\n g += int(log(lst[0])//log(2))-1\n k = 1\n for i in range(1,len(lst)):\n if k == 1:\n g += int(log(lst[i]//lst[i-1],2))\n elif lst[i] > 2*lst[i-1]:\n g += int(log(lst[i]//lst[i-1],2))-1\n k = 1\n else:\n k = 0\n if g >= N:\n ans = \"yes\"\n \n print(ans)\nexcept EOFError as e : pass\n ", "from math import log\r\nfor i in range (int(input())):\r\n a = input().split(\" \")\r\n n,k,x,m = map(int,a)\r\n ans = \"no\"\r\n u = 0\r\n\r\n if k != 2 and k != 1:\r\n if x%k == 0:\r\n x //= k\r\n u = -1\r\n elif x%k == 1:\r\n n -= 1\r\n x //= k\r\n u = -1\r\n\r\n if u == -1: \r\n while x != 0:\r\n if x%k == 0:\r\n x //= k\r\n elif x%k == 1:\r\n x //= k\r\n n -= 1\r\n elif x%k == 2:\r\n x //= k\r\n n -= 2\r\n else:\r\n break\r\n\r\n if n == 0 and x == 0:\r\n ans = \"yes\"\r\n\r\n elif k == 1:\r\n if x == n:\r\n ans = \"yes\"\r\n\r\n else:\r\n lst = []\r\n p = 0\r\n N = n\r\n while x != 0:\r\n if x%2 == 0:\r\n x //= 2\r\n p += 1\r\n elif x%2 == 1:\r\n x //= 2\r\n n -= 1\r\n p += 1\r\n lst.append(2**(p-1))\r\n\r\n if len(lst) == N:\r\n ans = \"yes\"\r\n \r\n if len(lst) < N:\r\n k = 0\r\n g = len(lst)\r\n if lst[0] > 2:\r\n g += int(log(lst[0])//log(2))-1\r\n k = 1\r\n for i in range(1,len(lst)):\r\n if k == 1:\r\n g += int(log(lst[i]//lst[i-1],2))\r\n elif lst[i] > 2*lst[i-1]:\r\n g += int(log(lst[i]//lst[i-1],2))-1\r\n k = 1\r\n else:\r\n k = 0\r\n if g >= N:\r\n ans = \"yes\"\r\n\r\n print(ans)\r\n", "T = int(input())\r\nfor i in range(T):\r\n l = list(map(int, input().split()))\r\n n, k, m, x = l[0], l[1], l[2], l[3]\r\n if k == 1:\r\n if n == m:\r\n print(\"yes\")\r\n else:\r\n print(\"no\")\r\n elif m % k > 1:\r\n print(\"no\")\r\n elif k == 2:\r\n stack = []\r\n var = 0\r\n while m != 0:\r\n var += m % k\r\n stack.append(m % k)\r\n m //= k\r\n if var > n:\r\n print(\"no\")\r\n elif var == n:\r\n print(\"yes\")\r\n else:\r\n for p in range(100):\r\n for q in range(2, len(stack)):\r\n if stack[q - 1] == 0 and stack[q] >= 1:\r\n stack[q-1] = 2\r\n stack[q] -= 1\r\n var += 1\r\n if var == n:\r\n print(\"yes\")\r\n if var < n:\r\n print(\"no\")\r\n else:\r\n temp = 0\r\n rog = 1\r\n while m != 0:\r\n if m % k > 2:\r\n rog = 0\r\n print(\"no\")\r\n temp += m % k\r\n m //= k\r\n if rog:\r\n if temp == n:\r\n print(\"yes\")\r\n else:\r\n print(\"no\")\r\n\r\n", "T = int(input())\r\nfor i in range(T):\r\n l = list(map(int, input().split()))\r\n n, k, m, x = l[0], l[1], l[2], l[3]\r\n if k == 1:\r\n if n == m:\r\n print(\"yes\")\r\n else:\r\n print(\"no\")\r\n elif m % k > 1:\r\n print(\"no\")\r\n elif k == 2:\r\n stack = []\r\n var = 0\r\n while m != 0:\r\n var += m % k\r\n stack.append(m % k)\r\n m //= k\r\n if var > n:\r\n print(\"no\")\r\n elif var == n:\r\n print(\"yes\")\r\n else:\r\n for p in range(1000):\r\n for q in range(2, len(stack)):\r\n if stack[q - 1] == 0 and stack[q] >= 1:\r\n stack[q-1] = 2\r\n stack[q] -= 1\r\n var += 1\r\n if var == n:\r\n print(\"yes\")\r\n if var < n:\r\n print(\"no\")\r\n else:\r\n temp = 0\r\n rog = 1\r\n while m != 0:\r\n if m % k > 2:\r\n rog = 0\r\n print(\"no\")\r\n temp += m % k\r\n m //= k\r\n if rog:\r\n if temp == n:\r\n print(\"yes\")\r\n else:\r\n print(\"no\")\r\n\r\n"]

{"inputs": [["2", "4 3 10 10", "2 3 10 10"]], "outputs": [["no", "yes"]]}

INTERVIEW

PYTHON3

CODECHEF

12,492

c69353d45f3a19ed29ab4afa788da335

UNKNOWN

You are given a sequence $A_1, A_2, \ldots, A_N$. You have to split the array into maximum number of non-empty subarrays such that the gcd of elements of each subarray is equal to 1. -----Input:----- - The first line of the input contains a single integer $T$ denoting the number of test cases. The description of $T$ test cases follows. - The first line of each test case contains a single integer $N$. - The second line contains $N$ space-separated integers $A_1, A_2, \ldots, A_N$. -----Output:----- For each test case, print a single line containing one integer ― the maximum number of subarrays formed, or $-1$ if the array cannot be split while satisfying the above condition. -----Constraints----- - $1 \le T \le 3$ - $1 \le N \le 5 \cdot 10^5$ - $1 \le A_i \le 10^6$ for each valid $i$ -----Sample Input:----- 2 3 2 2 3 4 2 3 3 2 -----Sample Output:----- 1 2

["'''input\n2\n3\n2 2 3\n4\n2 3 3 2\n'''\nimport math\n\nfor _ in range(int(input())):\n n = int(input())\n a = list(map(int, input().split()))\n count = 0\n i = 0\n while i < len(a):\n if a[i] == 1:\n count += 1\n i += 1\n continue\n curr_gcd = a[i]\n while i < len(a) and curr_gcd != 1:\n curr_gcd = math.gcd(curr_gcd, a[i])\n if curr_gcd == 1:\n count += 1\n i += 1\n # print(i)\n break\n i += 1\n print(count)\n", "MOD = 1000000007\nMOD2 = 998244353\nii = lambda: int(input())\nsi = lambda: input()\ndgl = lambda: list(map(int, input()))\nf = lambda: map(int, input().split())\nil = lambda: list(map(int, input().split()))\nls = lambda: list(input())\nfrom math import gcd\nfor _ in range(ii()):\n n=ii()\n l=il()\n c=0\n g=0\n for i in range(n):\n g = gcd(g,l[i])\n if g==1:\n c+=1\n g=0\n print(c)", "import math\nT = int(input())\nfor i in range(T):\n N = int(input())\n lis = list(map(int,input().split()))\n count = 0\n temp = lis[0]\n for j in lis[1:]:\n if temp==1:\n count += 1\n temp = j\n temp = math.gcd(temp,j)\n if temp==1:\n count += 1\n print(count)", "import math\n\ndef solve(arr,n):\n g = 0\n count = 0\n for i in arr:\n g = math.gcd(max(i,g),min(i,g))\n if g == 1:\n g = 0\n count += 1\n\n if g > 1 and count == 0:\n print(-1)\n return\n \n print(count)\n\ndef main():\n t = int(input())\n for i in range(t):\n n = int(input())\n arr = list(map(int,input().split()))\n solve(arr,n)\n \n\nmain()\n"]

{"inputs": [["2", "3", "2 2 3", "4", "2 3 3 2"]], "outputs": [["1", "2"]]}

INTERVIEW

PYTHON3

CODECHEF

1,473

be16604c0f234ad6e2bce7e8afe36203

UNKNOWN

Abhi Ram analyses london stock exchange and invests in a software company C-.gate . He wants to sell his shares after 5 weeks. Given the investment m, increase or decrease of share prices of 5 weeks(+/- pi) , help him to calculate his net profit or loss percentage(n%) of his investment to establish his own company KMC. -----Input:----- - The first line contains an integer T which denotes the number of test cases. - Each test case comprises of two lines: the first line contains the integer m which denotes the amount invested. The second line consists of five space separated integers(p1, p2, p3, p4, p5) each preceeded by + (increase) or - (decrease) which give the percentage of change in share prices over 5 weeks. . -----Output:----- The output contains a single number n which gives the percentage of profit or loss preceeded by + (profit) or - (loss). -----Constraints:----- - 1 ≤ T ≤ 100 - 1 ≤ m ≤ 105 - -100 ≤ pi ≤ 100 -----Example:----- Input: 2 10000 +5 -3 -2 +10 +15 6256250 -24 +22 +4 -16 +20 Output: +26.2634 -2.79977

["for i in range(int(input())):\n\t n = int(input())\n\t P = list(map(float, input().split()))\n\t pr = 1\n\t for p in P:\n\t\t a = 100+p\n\t\t pr = (pr*a)/100\n\t pr = (pr-1)*100\n\t x = 6-len(str(int(abs(pr))))\n \t if (x==1):\n \t \t if (pr==0):\n \t \t \tprint(0)\n\t\t elif (pr>0):\n\t\t \tprint(\"+\"+str(\"%.1f\" % round(pr,x)))\n\t\t else:\n\t\t \tprint(str(\"%.1f\" % round(pr,x)))\n\t elif (x==2):\n \t \t if (pr==0):\n \t \t \tprint(0)\n\t\t elif (pr>0):\n\t\t \tprint(\"+\"+str(\"%.2f\" % round(pr,x)))\n\t\t else:\n\t\t \tprint(str(\"%.2f\" % round(pr,x)))\n\t elif (x==3):\n \t \t if (pr==0):\n \t \t \tprint(0)\n\t\t elif (pr>0):\n\t\t \tprint(\"+\"+str(\"%.3f\" % round(pr,x)))\n\t\t else:\n\t\t \tprint(str(\"%.3f\" % round(pr,x)))\n\t elif (x==4):\n \t \t if (pr==0):\n \t \t \tprint(0)\n\t\t elif (pr>0):\n\t\t \tprint(\"+\"+str(\"%.4f\" % round(pr,x)))\n\t\t else:\n\t\t \tprint(str(\"%.4f\" % round(pr,x)))\n\t elif (x==5):\n \t \t if (pr==0):\n \t \t \tprint(0)\n\t\t elif (pr>0):\n\t\t \tprint(\"+\"+str(\"%.5f\" % round(pr,x)))\n\t\t else:\n\t\t \tprint(str(\"%.5f\" % round(pr,x)))\n\t elif (x==6):\n \t \t if (pr==0):\n \t \t \tprint(0)\n\t\t elif (pr>0):\n\t\t \tprint(\"+\"+str(\"%.6f\" % round(pr,x)))\n\t\t else:\n\t\t \tprint(str(\"%.6f\" % round(pr,x)))"]

{"inputs": [["2", "10000", "+5 -3 -2 +10 +15", "6256250", "-24 +22 +4 -16 +20"]], "outputs": [["+26.2634", "-2.79977"]]}

INTERVIEW

PYTHON3

CODECHEF

1,315

fcb93f3bafdb1974f72977bfdf9f22c9

UNKNOWN

Chef published a blog post, and is now receiving many queries about it. On day $i$, he receives $Q_i$ queries. But Chef can answer at most $k$ queries in a single day. Chef always answers the maximum number of questions that he can on any given day (note however that this cannot be more than $k$). The remaining questions (if any) will be carried over to the next day. Fortunately, after $n$ days, the queries have stopped. Chef would like to know the first day during which he has some free time, i.e. the first day when he answered less than $k$ questions. -----Input:----- - First line will contain $T$, the number of testcases. Then the testcases follow. - The first line of each testcase contains two space separated integers $n$ and $k$. - The second line of each testcase contains $n$ space separated integers, namely $Q_1, Q_2, ... Q_n$. -----Output:----- For each testcase, output in a single line the first day during which chef answers less than $k$ questions. -----Constraints----- - $1 \leq T \leq 10^5$ - $1 \leq $ sum of $n$ over all testcases $ \leq 10^5$ - $1 \leq k \leq 10^8$ - $0 \leq Q_i \leq 10^8$ -----Subtasks----- - Subtask 1 - 20% points - Sum of $Q_i$ over all testcases and days $\leq 3 . 10^6$ - Subtask 2 - 80% points - Original constraints -----Sample Input:----- 2 6 5 10 5 5 3 2 1 1 1 100 -----Sample Output:----- 6 101 -----Explanation:----- Test Case 1 On the first day, chef answers 5 questions and leaves the remaining 5 (out of the 10) for the future days. On the second day, chef has 10 questions waiting to be answered (5 received on the second day and 5 unanswered questions from day 1). Chef answers 5 of these questions and leaves the remaining 5 for the future. On the third day, chef has 10 questions waiting to be answered (5 received on the third day and 5 unanswered questions from earlier). Chef answers 5 of these questions and leaves the remaining 5 for later. On the fourth day, chef has 8 questions waiting to be answered (3 received on the fourth day and 5 unanswered questions from earlier). Chef answers 5 of these questions and leaves the remaining 3 for later. On the fifth day, chef has 5 questions waiting to be answered (2 received on the fifth day and 3 unanswered questions from earlier). Chef answers all 5 of these questions. On the sixth day, chef has 1 question, which he answers. This is the first day he answers less than 5 questions, and so the answer is 6. Test Case 2 Chef answers 1 question a day for the first 100 days. On day 101, he is free.

["# cook your dish here\n\nt=int(input())\nwhile(t):\n t=t-1\n n,k=list(map(int,input().split()))\n q=list(map(int,input().split()))\n days,rem=0,0\n for i in range(n):\n rem+=q[i]\n if(rem>=k):\n rem-=k\n else:\n days=i+1\n break\n days+=1\n if(rem>=k):\n days+=(rem//k)+1\n print(days)\n", "# cook your dish here\ntry:\n t=int(input())\n while(t):\n t=t-1\n n,k=map(int,input().split())\n q=list(map(int,input().split()))\n days,rem=0,0\n for i in range(n):\n rem+=q[i]\n if(rem>=k):\n rem-=k\n else:\n days=i+1\n break\n days+=1\n if(rem>=k):\n days+=(rem//k)+1\n print(days)\nexcept:\n pass", "def calFirstFreeDay(r, k, count):\n if((r-k)<k):\n print(count+2)\n else:\n calFirstFreeDay(r-k, k, count+1)\n \n\nT = int(input())\nfor i in range(0, T):\n list = input().split()\n n = int(list[0])\n k = int(list[1])\n \n pq = 0\n outputDone=False;\n arr = input().split()\n if(n==1):\n print((int(int(arr[0])/k))+1)\n outputDone = True\n if(not outputDone):\n for j in range(0, n):\n q = int(arr[j])\n if((q+pq)<k):\n print((j+1));\n outputDone = True;\n break;\n else:\n pq = (q+pq)-k;\n if(not outputDone):\n calFirstFreeDay(pq, k, n)\n", "def calFirstFreeDay(r, k, count):\n if((r-k)<k):\n print(count+2)\n else:\n calFirstFreeDay(r-k, k, count+1)\n \n\nT = int(input())\nfor i in range(0, T):\n list = input().split()\n n = int(list[0])\n k = int(list[1])\n pq = 0\n outputDone=False;\n arr = input().split()\n for j in range(0, n):\n q = int(arr[j])\n if((q+pq)<k):\n print((j+1));\n outputDone = True;\n break;\n else:\n pq = (q+pq)-k;\n if(not outputDone):\n calFirstFreeDay(pq, k, n)\n", "def solve(n, k, q):\n leftq = 0\n for i in range(n):\n leftq = leftq + q[i]\n if leftq < k:\n return i+1\n leftq = leftq - k\n \n return n + leftq//k + 1\n\nt = int(input())\n\nfor _ in range(t):\n n, k = list(map(int , input().split()))\n queries = list(map(int , input().split()))\n print( solve(n, k, queries))\n \n", "# cook your dish here\nt=int(input())\n#print(t)\nfor _ in range(t):\n #print(t)\n p = list(map(int, input().split()))\n n = p[0]\n k = p[1]\n l = list(map(int, input().split()))\n #print(l)\n s=0\n f=1\n for i in range(0,n):\n s += l[i]\n if(s<k):\n print(i+1)\n f=0\n break\n s = s-k\n \n if(f):\n print( sum(l)//k + 1)\n", "try:\n t = int(input())\n for _ in range(t):\n n, k = map(int, input().split())\n qArr = list(map(int, input().split()))\n res = (sum(qArr)//k) + 1\n print(res)\nexcept:\n pass", "for i in range(int(input())):\n n,k=list(map(int,input().split()))\n q=[int(z) for z in input().split()]\n carry,flag=0,0\n for i in range(n):\n if q[i]+carry>=k:\n carry+=q[i]-k\n else:\n flag=1\n print(i+1)\n break\n if carry>0 and flag!=1:\n print(carry//k +1+n)\n elif carry==0 and flag!=1:\n print(n+1)\n \n", "for i in range(int(input())):\n n,k=list(map(int,input().split()))\n q=[int(z) for z in input().split()]\n count=n-1\n for i in range(n-1):\n if q[i]>k:\n q[i+1]+=q[i]-k\n if q[n-1]<=k:\n count+=1\n else:\n count+=(q[n-1]//k)+1\n print(count)\n \n", "for _ in range(int(input())):\n n, k = list(map(int, input().split()))\n arr = list(map(int, input().split()))\n left = 0\n total_q = 0\n flag = 0\n for i in range(n):\n total_q += arr[i]\n if total_q < k:\n flag= 1\n break\n total_q = total_q - k\n left = total_q\n\n if flag:\n print(i+1)\n else:\n if not left:\n print(n)\n else:\n print(n + int(left / k) + 1)\n", "for _ in range(int(input())):\n n, k = list(map(int, input().split()))\n arr = list(map(int, input().split()))\n left = 0\n total_q = 0\n\n for i in range(n):\n total_q += arr[i]\n total_q = total_q - k if total_q - k > 0 else 0\n left = total_q\n\n if not left:\n print(n)\n else:\n print(n + int(left / k) + 1)\n", "for _ in range(int(input())):\n n, k = list(map(int, input().split()))\n arr = list(map(int, input().split()))\n left = 0\n total_q = 0\n\n for i in range(n-1):\n total_q += int(arr[i])\n total_q = total_q - k if total_q - k > 0 else 0\n left = total_q\n\n left += arr[n-1]\n if left < k:\n print(n)\n elif left == k:\n print(n + 1)\n else:\n left = left - k\n print(n+int(left/k)+1)\n", "for i in range(int(input())):\n n, k = map(int, input().split())\n arr = list(map(int, input().split()))\n s = sum(arr)\n print(max(int(s/k)+1, n))", "for _ in range(int(input())):\n i=0\n n,k=map(int,input().split())\n l=list(map(int,input().split()))\n so=l[i]\n result=sum(l)\n r=result//k\n if(r<=k):\n print(r+1)\n else:\n print(r+k//so+1)", "for _ in range(int(input())):\n n,k=map(int,input().split())\n l=list(map(int,input().split()))\n result=sum(l)\n r=result//k\n print(r+1)", "# cook your dish here\nt = int(input())\nwhile(t > 0):\n n,k = map(int,input().split())\n q = [int(x) for x in input().split()]\n carry = 0\n flag = 0\n for i in range(n):\n if(q[i]+carry>=k):\n carry = q[i] + carry - k\n else:\n flag = 1\n print(i+1)\n break\n if(carry > 0 and flag != 1):\n rem = carry//k + 1 + n\n print(rem)\n elif(carry == 0 and flag != 1):\n print(n+1)\n t -= 1", "# cook your dish here\nt = int(input())\nwhile(t > 0):\n n,k = map(int,input().split())\n q = [int(x) for x in input().split()]\n carry = 0\n for i in range(n):\n if(q[i]+carry>=k):\n carry = q[i] + carry - k\n else:\n print(i+1)\n break\n if(carry > 0 and k != 0):\n rem = carry//k + 1 + n\n print(rem)\n elif(carry == 0):\n print(n+1)\n t -= 1", "# cook your dish here\nt = int(input())\nwhile(t > 0):\n n,k = map(int,input().split())\n q = [int(x) for x in input().split()]\n carry = 0\n for i in range(n):\n if(q[i]+carry>=k):\n carry = q[i] + carry - k\n else:\n print(i+1)\n break\n if(carry > 0):\n rem = carry//k + 1 + n\n print(rem)\n elif(carry == 0):\n print(n+1)\n t -= 1", "# cook your dish here\nt = int(input())\nwhile(t > 0):\n n,k = map(int,input().split())\n q = [int(x) for x in input().split()]\n carry = 0\n for i in range(n):\n if(q[i]+carry>=k):\n carry = q[i] + carry - k\n elif(q[i]+carry<k):\n print(i+1)\n break\n else:\n print(i+1)\n break\n if(carry > 0):\n rem = carry//k + 1 + n\n print(rem)\n t -= 1", "# cook your dish here\nt = int(input())\nwhile(t > 0):\n n,k = map(int,input().split())\n q = [int(x) for x in input().split()]\n carry = 0\n for i in range(n):\n if(q[i]+carry>=k):\n carry = q[i] + carry - k\n else:\n print(i+1)\n break\n if(carry > 0):\n rem = carry//k + 1 + n\n print(rem)\n t -= 1", "t=int(eval(input('')))\nfor i in range(t):\n n, k = [int(n) for n in input(\" \").split()]\n lst = list(map(int, input().split()))\n j=0\n leftover=0\n ans=0\n for i in range(n):\n j=lst[i]+leftover\n leftover=j-k\n if(j<k):\n ans=i+1 \n break\n if(leftover>=0):\n ans=n+(leftover//k)+1 \n print(ans)\n", "t=int(input())\nfor each in range(t):\n n,k=map(int,input().split())\n q=list(map(int,input().split()))\n i=0\n while True:\n if i<n:\n if i==0:\n if q[i]<k:\n print(i+1)\n break\n r=q[i]-k\n i+=1\n else:\n if (r+q[i])<k:\n print(i+1)\n break\n r=(r+q[i])-k\n i=i+1 \n else:\n print(i+(r//k)+1)\n break", "# sai ram\nfor _ in range(int(input())):\n n,k=[int(x) for x in input().split()]\n q=[int(x) for x in input().split()]\n \n \n print((sum(q)//k)+1)\n \n \n"]

{"inputs": [["2", "6 5", "10 5 5 3 2 1", "1 1", "100"]], "outputs": [["6", "101"]]}

INTERVIEW

PYTHON3

CODECHEF

7,311

941fecd17affbeed734ce75b4fd48c1c

UNKNOWN

Due to the COVID pandemic, people have been advised to stay at least $6$ feet away from any other person. Now, people are lining up in a queue at the local shop and it is your duty to check whether they are all following this advice. There are a total of $N$ spots (numbered $1$ through $N$) where people can stand in front of the local shop. The distance between each pair of adjacent spots is $1$ foot. Each spot may be either empty or occupied; you are given a sequence $A_1, A_2, \ldots, A_N$, where for each valid $i$, $A_i = 0$ means that the $i$-th spot is empty, while $A_i = 1$ means that there is a person standing at this spot. It is guaranteed that the queue is not completely empty. For example, if $N = 11$ and the sequence $A$ is $(0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 1)$, then this is a queue in which people are not following the advice because there are two people at a distance of just $3$ feet from each other. You need to determine whether the people outside the local shop are following the social distancing advice or not. As long as some two people are standing at a distance smaller than 6 feet from each other, it is bad and you should report it, since social distancing is not being followed. -----Input----- - The first line of the input contains a single integer $T$ denoting the number of test cases. The description of $T$ test cases follows. - The first line of each test case contains a single integer $N$. - The next line contains $N$ space-separated integers $A_1, A_2, \ldots, A_N$. -----Output----- For each test case, print a single line containing the string "YES" if social distancing is being followed or "NO" otherwise (without quotes). -----Constraints----- - $1 \le T \le 100$ - $1 \le N \le 100$ - $0 \le A_i \le 1$ for each valid $i$ - at least one spot is occupied -----Subtasks----- Subtask #1 (100 points): original constraints -----Example Input----- 3 3 1 0 1 7 1 0 0 0 0 0 1 11 0 1 0 0 0 0 0 1 0 0 1 -----Example Output----- NO YES NO -----Explanation----- Example case 1: The first and third spots are occupied and the distance between them is $2$ feet. Example case 2: The first and seventh spots are occupied and the distance between them is $6$ feet.

["# cook your dish here\nt=int(input())\nwhile t>0:\n n=int(input())\n l=list(map(int,input().split()))\n l1=[]\n c=1\n for i in range(len(l)):\n if l[i]==1:\n l1.append(i)\n for j in range(len(l1)-1):\n if l1[j+1]-l1[j]<6:\n c=0\n break\n if c:\n print(\"YES\")\n else:\n print(\"NO\")\n \n t-=1", "T=int(input())\nfor i in range(T):\n N=int(input())\n L=list(map(int,input().split()))[:N]\n a,b=[],[]\n for j in range(len(L)):\n if L[j]==1:\n a.append(j)\n for k in range(len(a)-1):\n b.append(a[k+1]-a[k])\n for l in range(len(b)):\n if b[l]<6:\n print(\"NO\")\n break\n else:\n print(\"YES\")", "T=int(input())\nfor i in range(T):\n N=int(input())\n L=list(map(int,input().split()))[:N]\n a,b=[],[]\n for j in range(len(L)):\n if L[j]==1:\n a.append(j)\n for k in range(len(a)-1):\n b.append(a[k+1]-a[k])\n for l in range(len(b)):\n if b[l]<6:\n print(\"NO\")\n break\n else:\n print(\"YES\")", "T=int(input())\nfor i in range(T):\n N=int(input())\n L=list(map(int,input().split()))[:N]\n a,b=[],[]\n for j in range(len(L)):\n if L[j]==1:\n a.append(j)\n for k in range(len(a)-1):\n b.append(a[k+1]-a[k])\n for l in range(len(b)):\n if b[l]<6:\n print(\"NO\")\n break\n else:\n print(\"YES\")\n", "# cook your dish here\nfor _ in range(int(input())) :\n N = int(input().strip())\n A = list(map(int, input().split()))\n m1 = 0\n ma = 0\n mc = 1\n for i in range(N) :\n if A[i] == 1 :\n ma = ma + 1\n if ma > 1 and m1 < 5 :\n mc = 0\n print(\"NO\")\n break\n m1 = 0\n else :\n m1 = m1 + 1\n # print(i, A[i], ma, m1)\n if mc == 1 :\n print(\"YES\")", "# cook your dish here\nfor _ in range(int(input())):\n n = int(input())\n l = list(map(int,input().split()))\n # 101 --- 1000001 ----\n f = True\n for i in range(n):\n if(l[i]==1):\n if(i+1 < n):\n if(l[i+1]==1):\n f=False\n break\n if(i+2 < n):\n if(l[i+2]==1):\n f=False\n break\n if(i+3 < n):\n if(l[i+3]==1):\n f=False\n break\n if(i+4 < n):\n if(l[i+4]==1):\n f=False\n break\n if(i+5 < n):\n if(l[i+5]==1):\n f=False\n break\n if(f==True):\n print('YES')\n else:\n print('NO')", "# cook your dish here\nfor _ in range(int(input())):\n n=int(input())\n l1=list(map(int,input().split()))\n flag=0\n l2=[]\n for i in range(len(l1)):\n if l1[i]==1:\n l2.append(i)\n for i in range(len(l2)-1):\n if l2[i+1]-l2[i]<6:\n flag=1\n break\n if flag==0:\n print(\"YES\")\n else:\n print(\"NO\")\n", "# cook your dish here\nt=int(input())\nfor i in range(t):\n n=int(input())\n a=[]\n a=list(map(int,input().split()))\n x=[]\n for j in range(n):\n if a[j]==1:\n x.append(j)\n k=len(x)\n flag=0\n for j in range(k-1):\n if abs(x[j]-x[j+1])<6:\n flag=1\n break\n if flag==0:\n print('YES')\n else:\n print(\"NO\")\n ", "for _ in range(int(input())):\n n = int(input())\n l = list(map(int,input().split()))\n ans = \"YES\"\n if n<=6:\n x = l.count(1)\n if x>1:\n ans = \"NO\"\n else:\n for i in range(n-5):\n x = l[i:i+6].count(1)\n if x>1:\n ans = \"NO\"\n break \n print(ans) ", "# cook your dish here\nt=int(input())\nfor _ in range(t):\n n=int(input())\n l=list(map(int,input().split()))\n l=[ i for i in range(len(l)) if l[i] == 1 ]\n social_distance=True\n for i in range(1,len(l)):\n if l[i]-l[i-1]<6:\n social_distance=False\n break\n if social_distance==False:\n print('NO')\n else:\n print('YES')\n ", "# cook your dish here\nt=int(input())\nfor _ in range(t):\n n=int(input())\n l=list(map(int,input().split()))\n l=[ i for i in range(len(l)) if l[i] == 1 ]\n social_distance=True\n for i in range(1,len(l)):\n if l[i]-l[i-1]<6:\n social_distance=False\n if social_distance==False:\n print('NO')\n else:\n print('YES')\n ", "# cook your dish here\nfor T in range(int(input())):\n n = int(input())\n ls = list(map(int,input().split()))\n flag1 = 0\n lr = []\n for i in range(n):\n if ls[i]==1:\n lr.append(i+1)\n # print(lr)\n if len(lr)==1:\n print(\"YES\")\n else:\n for j in range(1,len(lr)):\n if (lr[j]-lr[j-1])>=6:\n flag1 = 1 \n else:\n flag1 = 0 \n break\n \n if flag1==1:\n print(\"YES\")\n else:\n print(\"NO\")\n ", "# cook your dish here\ndef covid(n,m):\n p=False\n for j in range(len(m)):\n if(m[j]==1 and p==False):\n k=j\n p=True\n elif(m[j]==1 and p):\n if(j-k<6):\n return \"NO\"\n else:\n k=j\n return \"YES\"\nt=int(input())\nfor i in range(t):\n n=int(input())\n m=list(map(int,input().split()))\n print(covid(n,m))\n ", "# cook your dish here\nt=int(input())\nwhile t>0:\n n=int(input())\n l=list(map(int,input().split()))\n l1=[]\n c=True\n for i in range(len(l)):\n if l[i]==1:\n l1.append(i)\n for j in range(len(l1)-1):\n if l1[j+1]-l1[j]<6:\n c=False\n break\n if c:\n print(\"YES\")\n else:\n print(\"NO\")\n \n t-=1", "# cook your dish here\nfor _ in range(int(input())):\n n=int(input())\n a=list(map(int,input().split()))\n pos=[]\n for i in range(len(a)):\n if a[i]==1:\n pos.append(i)\n for i in range(1,len(pos)):\n if pos[i]-pos[i-1]<6:\n print('NO')\n break\n else:\n print('YES')", "for test_ in range(int(input())):\r\n n = int(input())\r\n a = list(map(int,input().strip().split()))\r\n temp = []\r\n for i in range(n):\r\n if a[i] == 1:\r\n temp.append(i)\r\n if len(temp) == 1:\r\n print(\"YES\")\r\n else:\r\n dist = []\r\n for i in range(1,len(temp)):\r\n dist.append(temp[i]-temp[i-1])\r\n print(\"YES\" if min(dist)>=6 else \"NO\")", "# cook your dish here\nt=int(input())\nwhile t>0:\n n=int(input())\n l=list(map(int,input().split()))\n m=[]\n for i in range(n):\n if l[i]==1:\n m.append(i)\n if len(m)==1:\n print(\"YES\")\n else:\n diff=[]\n for i in range(1,len(m)):\n diff.append(m[i]-m[i-1])\n for i in diff:\n if i<6:\n print(\"NO\")\n break\n else:\n print(\"YES\")\n t-=1", "# cook your dish here\nfor _ in range(int(input())):\n N=int(input())\n inp_lst=tuple(i for i in input().strip().split(' '))\n idx_lst=[]\n printStr='YES'\n for i in range(N):\n if(inp_lst[i]=='1'):\n idx_lst.append(i)\n \n for i in range(1,len(idx_lst)):\n if(idx_lst[i]-idx_lst[i-1]<6):\n printStr='NO'\n break\n \n print(printStr)\n \n", "import sys\ncases = int(sys.stdin.readline().rstrip())\nfor case in range(cases):\n N = int(sys.stdin.readline().rstrip())\n p = list(map(int,sys.stdin.readline().rstrip().split(\" \")))\n idxs=[]\n for (i,v) in enumerate(p):\n if(v == 1):\n idxs.append(i)\n error = False\n for i in range(len(idxs)-1):\n if idxs[i+1] - idxs[i] < 6:\n error = True\n break\n if(error):\n print(\"NO\")\n else :\n print(\"YES\")\n \n \n", "for _ in range(int(input())):\r\n # x,y,s = map(int,input().split())\r\n n = int(input())\r\n a = input()\r\n if '1 1' in a or '1 0 1' in a or '1 0 0 1' in a or '1 0 0 0 1' in a or '1 0 0 0 0 1' in a :\r\n print('NO')\r\n else :\r\n print('YES')\r\n", "import sys\ncases = int(sys.stdin.readline().rstrip())\nfor case in range(cases):\n N = int(sys.stdin.readline().rstrip())\n p = list(map(int,sys.stdin.readline().rstrip().split(\" \")))\n idxs=[]\n for (i,v) in enumerate(p):\n if(v == 1):\n idxs.append(i)\n error = False\n for i in range(len(idxs)-1):\n if idxs[i+1] - idxs[i] < 6:\n error = True\n break\n if(error):\n print(\"NO\")\n else :\n print(\"YES\")\n \n ", "# cook your dish here\nfor _ in range(int(input())):\n N = int(input())\n A = list(map(int,input().strip().split()))\n Positions = []\n not_followed = 0\n for i in range(N):\n if A[i] == 1 : \n Positions.append(i+1)\n for i in range(len(Positions)-1):\n if (Positions[i+1] - Positions[i]) < 6 : not_followed += 1\n if not_followed == 0 : print('YES')\n else : print('NO')", "t = int(input())\n\nfor _ in range(t):\n n = int(input())\n arr = [int(x) for x in input().split()]\n \n one = [i for i, x in enumerate(arr) if x == 1]\n \n flag = 0\n \n for i in range(1, len(one)):\n if(one[i]-one[i-1] < 6):\n flag = 1\n break\n \n if(flag == 1):\n print(\"NO\")\n else:\n print(\"YES\")", "for _ in range(int(input())):\n n=int(input())\n s=list(map(int,input().split()))\n l=[]\n c=0\n for i in range(n):\n if s[i]==1:\n l.append(i)\n for i in range(len(l)-1):\n if l[i+1]-l[i]<6:\n c+=1\n if c>0:\n print(\"NO\")\n else:\n print(\"YES\")\n \n ", "t=int(input())\r\n\r\nwhile t>0:\r\n t-=1\r\n n=int(input())\r\n \r\n l1=[int(i) for i in input().split(\" \")]\r\n \r\n ans=\"\"\r\n \r\n flag=0\r\n k=0\r\n for i in l1:\r\n if flag==1 and i!=1:\r\n k+=1\r\n elif i==1 and flag==0:\r\n flag=1\r\n elif i==1 and flag==1:\r\n if k>=5:\r\n k=0\r\n else:\r\n ans=\"NO\"\r\n break\r\n if ans==\"\":\r\n ans=\"YES\"\r\n print(ans)\r\n "]

{"inputs": [["3", "3", "1 0 1", "7", "1 0 0 0 0 0 1", "11", "0 1 0 0 0 0 0 1 0 0 1", ""]], "outputs": [["NO", "YES", "NO"]]}

INTERVIEW

PYTHON3

CODECHEF

10,968

ae2b1dac138d29ab2cc8609982ad248a

UNKNOWN

"What do you know about happiness?" — Yoda Chef is happy only if three conditions hold: - Chef finished cooking a delicious meal - Chef got AC for a programming problem with an almost correct code - Chef got a new problem with a sequence of integers Today, all three conditions are satisfied. Chef would like you to feel his happiness and provide him with a solution for this new problem with a sequence of integers. The problem is as follows. You are given a sequence $A_1, A_2, \dots, A_N$. You need to determine if it is possible to choose two indices $i$ and $j$ such that $A_i \neq A_j$, but $A_{A_i}$ = $A_{A_j}$. (If it was possible, Chef would be truly happy.) -----Input----- - The first line of the input contains a single integer $T$ denoting the number of test cases. The description of $T$ test cases follows. - The first line of each test case contains a single integer $N$. - The second line contains $N$ space-separated integers $A_1, A_2, \ldots, A_N$. -----Output----- For each test case, print a single line containing the string "Truly Happy" if it is possible to choose required indices or "Poor Chef" otherwise. -----Constraints----- - $1 \le T \le 1,000$ - $1 \le N \le 10^5$ - $1 \le A_i \le N$ for each valid $i$ - the sum of $N$ over all test cases does not exceed $2 \cdot 10^5$ -----Subtasks----- Subtask #1 (27 points): $1 \le N \le 1,000$ Subtask #2 (73 points): original constraints -----Example Input----- 4 4 1 1 2 3 4 2 1 3 3 5 5 4 4 3 1 5 3 2 1 1 4 -----Example Output----- Truly Happy Poor Chef Poor Chef Truly Happy -----Explanation----- Example case 1: Chef is truly happy because $A_{A_3} = A_{A_1}$ and $A_3 \neq A_1$. Example case 2: There is no pair of indices which would make Chef truly happy. For instance, $A_{A_3} = A_{A_4}$, but $A_3 = A_4$,

["# cook your dish here\n\nt=int(input())\n\nfor i in range(t):\n n=int(input())\n a=list(map(int,input().split()))\n d={}\n for i in range(n):\n if a[i]-1 not in d:\n d[a[i]-1]=[i]\n else:\n d[a[i]-1].append(i)\n ans=False\n d1={}\n \n for i in d:\n if ans==True:\n break\n for j in d:\n if i!=j:\n if a[i]==a[j] and i!=j:\n ans=True\n break\n if ans==True:\n print('Truly Happy')\n else:\n print('Poor Chef')\n", "# cook your dish here\n\nt=int(input())\n\nfor i in range(t):\n n=int(input())\n a=list(map(int,input().split()))\n d={}\n for i in range(n):\n if a[i]-1 not in d:\n d[a[i]-1]=[i]\n else:\n d[a[i]-1].append(i)\n ans=False\n d1={}\n for i in range(len(a)):\n d1[i]=a[i]\n for i in d:\n if ans==True:\n break\n for j in d:\n if i!=j:\n if d1[i]==d1[j] and i!=j:\n ans=True\n break\n if ans==True:\n print('Truly Happy')\n else:\n print('Poor Chef')\n", "# cook your dish here\n\nt=int(input())\n\nfor i in range(t):\n n=int(input())\n a=list(map(int,input().split()))\n d={}\n for i in range(n):\n if a[i]-1 not in d:\n d[a[i]-1]=[i]\n else:\n d[a[i]-1].append(i)\n ans=False\n for i in d:\n if ans==True:\n break\n for j in d:\n if i!=j:\n if a[i]==a[j] and i!=j:\n ans=True\n break\n if ans==True:\n print('Truly Happy')\n else:\n print('Poor Chef')\n", "# cook your dish here\n\nt=int(input())\n\nfor i in range(t):\n n=int(input())\n a=list(map(int,input().split()))\n d={}\n for i in range(n):\n if a[i]-1 not in d:\n d[a[i]-1]=[i]\n else:\n d[a[i]-1].append(i)\n ans=False\n for i in d:\n if ans==True:\n break\n for j in d:\n if ans==True:\n break\n if i!=j:\n if a[i]==a[j] and i!=j:\n \n ans=True\n if ans==True:\n print('Truly Happy')\n else:\n print('Poor Chef')\n", "# cook your dish here\nt = int(input())\nfor _ in range(t):\n n = int(input())\n arr = list(map(int, input().split()))\n seti1 = set(arr)\n l = [arr[i-1] for i in arr]\n seti2 = set(l)\n if len(seti1)<=len(seti2):\n print(\"Poor Chef\")\n else:\n print(\"Truly Happy\")\n \n \n \n \n", "\nfor _ in range(int(input())):\n n=int(input())\n l=list(map(int,input().split()))\n ln1=len(set(l))\n l1=[]\n for i in l:\n l1.append(l[i-1])\n ln2=len(set(l1))\n if(ln1==ln2):\n print(\"Poor Chef\")\n else:\n print(\"Truly Happy\")\n", "for _ in range(int(input())):\n n=int(input())\n a=list(map(int,input().split()))\n ans=\"Poor Chef\"\n sa=set(a)\n l=[a[i-1] for i in a]\n sb=set(l)\n if len(sa)>len(sb):\n ans=\"Truly Happy\"\n print(ans)", "# cook your dish here\ndef __starting_point():\n t = int(input())\n for q in range(t):\n n = int(input())\n l = list(map(int,input().split()))\n \n count = 0\n for i in range(n-1):\n for j in range(i+1,n):\n if l[i]!=l[j]:\n if l[l[i]-1]==l[l[j]-1]:\n count += 1\n break\n if count==0:\n print('Poor Chef')\n else :\n print('Truly Happy')\n\n__starting_point()", "for _ in range(int(input())):\n n=int(input())\n l=list(map(int,input().split()))\n ans=\"Poor Chef\"\n for i in range(n):\n for j in range(i+1,n):\n if l[i]==l[j]:\n if i+1 in l and j+1 in l:\n ans=\"Truly Happy\"\n print(ans)\n", "for _ in range(int(input())):\n a = int(input())\n array = list(map(int,input().split()))\n common = list()\n for x in array:\n if array.count(x)>1:\n common.append(x)\n \n if len(common)==0:\n print(\"Poor Chef\")\n continue\n \n ind = dict()\n flag = 0\n for x in common:\n if x not in ind:\n ind[x]=list()\n for y in range(len(array)):\n if array[y]==x:\n ind[x].append(y+1)\n lis = ind[x]\n for m in lis:\n for n in lis:\n if m!=n and m in array and n in array:\n print(\"Truly Happy\")\n flag = 1\n break\n if flag == 1:\n break\n if flag == 1:\n break\n \n else:\n if flag == 0:\n print(\"Poor Chef\") \n", "for _ in range(int(input())):\n a = int(input())\n array = list(map(int,input().split()))\n common = list()\n for x in array:\n if array.count(x)>1:\n common.append(x)\n \n if len(common)==0:\n print(\"Poor Chef\")\n continue\n \n ind = dict()\n for x in common:\n if x not in ind:\n ind[x]=list()\n for y in range(len(array)):\n if array[y]==x:\n ind[x].append(y+1)\n \n flag = 0\n for x in ind:\n lis = ind[x]\n for m in lis:\n for n in lis:\n if m!=n and m in array and n in array:\n print(\"Truly Happy\")\n flag = 1\n break\n if flag == 1:\n break\n if flag == 1:\n break\n else:\n if flag == 0:\n print(\"Poor Chef\")\n \n", "# cook your dish here\n\ndef solve(A,n):\n for i in range(n):\n for j in range(n):\n if i != j:\n if A[i] == A[j]:\n if i+1 in A and j+1 in A:\n return True\n return False\n\n\n\n \n\ntry:\n T = int(input())\n for l in range(T):\n \n n = int(input())\n path = [int(i) for i in input().strip().split(\" \")]\n if solve(path,n):\n print(\"Truly Happy\")\n else:\n print(\"Poor Chef\")\n \n \n \n \n \nexcept EOFError:\n pass\n\n \n \n", "# cook your dish here\nt = int(input())\nwhile t != 0:\n n = int(input())\n a = list(map(int, input().split()))[:n]\n happy = False \n for i in range(n-1):\n for j in range(i+1, n):\n if a[i] != a[j]:\n k, r = a[i], a[j]\n if a[k-1] == a[r-1]:\n happy = True\n break\n if happy == True:\n print('Truly Happy')\n else:\n print('Poor Chef')\n t -= 1", "try:\n t=int(input())\n for i in range(t):\n n=int(input())\n z=0\n a=[int(j) for j in input().split(\" \")]\n # print(a)\n for k in range(n-1):\n # print(\"a\")\n for x in range(k+1,n):\n #print(a[k],a[x])\n if a[k]!=a[x] :\n if a[a[k]-1]==a[a[x]-1] :\n print(\"Truly Happy\")\n # print(\"c\")\n z=1\n break\n if z==1:\n break\n \n if z==0:\n #print(\"e\")\n print(\"Poor Chef\")\n #print(\".................................\"\nexcept:\n pass", "# cook your dish here\nt = int(input())\nfor _ in range(t):\n N = int(input())\n dict1 = {}\n flag = False\n S = [int(x) for x in input().split()]\n for i in range(N):\n if S[i] in dict1.keys():\n dict1[S[i]].append(i+1)\n else:\n dict1[S[i]] = [i+1]\n for key,val in dict1.items():\n if len(val) == 1:\n continue\n count = 0\n for e in val:\n if e in dict1.keys():\n count += 1\n if count == 2:\n flag = True\n break\n if flag == True:\n break\n if flag == True:\n print(\"Truly Happy\")\n else:\n print(\"Poor Chef\")", "# cook your dish here\nt = int(input())\nfor h in range(t):\n l = int(input())\n li = list(map(int,input().split()))\n li.insert(0,0)\n status = True\n for i in range(1,len(li)):\n for j in range(1,len(li)):\n if i!=j and li[i]!=li[j]:\n if li[li[i]] == li[li[j]]:\n print(\"Truly Happy\")\n status = False\n break\n if not status:\n break\n if status:\n print(\"Poor Chef\")", "T = int(input())\nfor i in range(T):\n N = int(input())\n seq = [int(s) for s in input().split()]\n ans = 0\n for i in range(len(seq)):\n a = seq[i]\n c = seq[a-1]\n for j in range(i+1, len(seq)):\n b = seq[j]\n d = seq[b-1]\n if(a!=b and c==d):\n ans = 1\n break\n if(ans == 1):\n break\n if(ans == 1):\n print(\"Truly Happy\")\n else:\n print(\"Poor Chef\")", "t=int(input())\nwhile t>0:\n n=int(input())\n a=list(map(int,input().split(' ')))\n d={}\n k={}\n for i in a:\n k[i]=1\n flag=0\n for i in range(len(a)):\n if d.get(a[i],0)==0:\n d[a[i]]=[i+1]\n else:\n d[a[i]].append(i+1)\n \n for i in list(d.keys()):\n c=0\n for j in d[i]:\n if k.get(j,0)==1:\n c+=1\n if c>=2:\n flag=1\n break\n if flag==1:\n print('Truly Happy')\n else:\n print('Poor Chef')\n t-=1\n", "for _ in range(int(input())):\n n = int(input())\n arr = list(map(int,input().split()))\n A = set(arr)\n B = set(arr[i-1] for i in A)\n if A == B:\n print(\"Poor Chef\")\n else:\n print(\"Truly Happy\")", "for _ in range(int(input())):\n n = int(input())\n arr = list(map(int,input().split()))\n status = False\n if n == 1:\n print(\"Poor Chef\")\n else:\n for i in range(n):\n a = arr[i]\n for j in range(i+1,n):\n b = arr[j]\n if (a != b) and (arr[a-1] == arr[b-1]):\n status = True\n break\n if status == True:\n break\n if status == True:\n print(\"Truly Happy\")\n else:\n print(\"Poor Chef\")", "for _ in range(int(input())):\n n = int(input())\n arr = list(map(int,input().split()))\n status = False\n for i in range(n):\n a = arr[i]\n for j in range(i+1,n):\n b = arr[j]\n if (a != b) and (arr[a-1] == arr[b-1]):\n status = True\n break\n if status == True:\n break\n if status == True:\n print(\"Truly Happy\")\n else:\n print(\"Poor Chef\")", "from collections import defaultdict\nx=int(input())\nfor __ in range(x):\n n=int(input())\n a=list(map(int,input().split()))\n d=defaultdict(list)\n for i in range(n):\n d[a[i]].append(i)\n b=set(a)\n for i in b:\n c=0\n if len(d[i])>1:\n for j in d[i]:\n if len(d[j+1])>0:\n c+=1\n if c==2:\n break\n if c==2:\n break\n if c==2:\n print(\"Truly Happy\")\n else:\n print(\"Poor Chef\")", "from collections import defaultdict\nt=int(input())\nwhile t:\n t-=1\n n=int(input())\n a=list(map(int,input().split()))\n dd=defaultdict(list)\n boo=False\n se=set(a)\n for i in range(len(a)):\n if (a[i] in se and a[a[i]-1] in dd ):\n for j in dd[a[a[i]-1]]:\n if a[i]!=j:\n boo=True\n break\n if boo:\n break\n \n\n dd[a[a[i]-1]].append(a[i])\n if boo:\n print('Truly Happy')\n else:\n print('Poor Chef')", "# cook your dish here\nfor i in range(int(input())):\n c=0\n n=int(input())\n a=list(map(int,input().split()))\n for i in range(len(a)):\n for j in range(len(a)):\n try:\n if a[i]!=a[j] and a[a[i]-1]==a[a[j]-1]:\n c+=1\n else:\n pass\n except:\n pass\n if c==0:\n print('Poor Chef')\n else:\n print('Truly Happy')"]

{"inputs": [["4", "4", "1 1 2 3", "4", "2 1 3 3", "5", "5 4 4 3 1", "5", "3 2 1 1 4"]], "outputs": [["Truly Happy", "Poor Chef", "Poor Chef", "Truly Happy"]]}

INTERVIEW

PYTHON3

CODECHEF

9,820

df7d25501a1e69a3946ebf9fd10c648f

UNKNOWN

Lots of geeky customers visit our chef's restaurant everyday. So, when asked to fill the feedback form, these customers represent the feedback using a binary string (i.e a string that contains only characters '0' and '1'. Now since chef is not that great in deciphering binary strings, he has decided the following criteria to classify the feedback as Good or Bad : If the string contains the substring "010" or "101", then the feedback is Good, else it is Bad. Note that, to be Good it is not necessary to have both of them as substring. So given some binary strings, you need to output whether according to the chef, the strings are Good or Bad. -----Input----- The first line contains an integer T denoting the number of feedbacks. Each of the next T lines contains a string composed of only '0' and '1'. -----Output----- For every test case, print in a single line Good or Bad as per the Chef's method of classification. -----Constraints----- - 1 ≤ T ≤ 100 - 1 ≤ |S| ≤ 105 Sum of length of all strings in one test file will not exceed 6*106. -----Example----- Input: 2 11111110 10101010101010 Output: Bad Good -----Explanation----- Example case 1. The string doesn't contain 010 or 101 as substrings. Example case 2. The string contains both 010 and 101 as substrings.

["# cook your dish here\nt=int(input())\nfor i in range(t):\n s=input()\n fl=-1\n n=len(s)\n for i in range(n-2):\n if(s[i:i+3]==\"010\" or s[i:i+3]==\"101\"):\n fl=0\n print(\"Good\")\n break\n\n if(fl==-1):\n print(\"Bad\")\n", "# cook your dish here\nt=int(input())\nfor i in range(t):\n s=input()\n fl=-1\n n=len(s)\n for i in range(n-2):\n if(s[i:i+3]==\"010\" or s[i:i+3]==\"101\"):\n fl=0\n print(\"Good\")\n break\n\n if(fl==-1):\n print(\"Bad\")\n", "for _ in range(int(input())):\n input_1 = str(input())\n str1 = \"010\"\n str2 = \"101\"\n \n if input_1.find(str1) == -1 and input_1.find(str2)== -1:\n print(\"Bad\")\n else: \n print(\"Good\")", "# cook your dish here\nfor _ in range(int(input())):\n bstr = input()\n # if '101' in bstr or '010' in bstr:\n # print(\"Good\")\n # else:\n # print(\"Bad\")\n opval = \"Bad\"\n for i in range(len(bstr)-2):\n if bstr[i] == bstr[i+2] and bstr[i]!=bstr[i+1]:\n opval = \"Good\"\n break\n print(opval)", "# cook your dish here\nfor _ in range(int(input())):\n bstr = input()\n if '101' in bstr or '010' in bstr:\n print(\"Good\")\n else:\n print(\"Bad\")", "# cook y\nfor i in range(int(input())):\n s=input()\n p=\"Bad\"\n for i in range(len(s)-2):\n if '0' in s[i] and '1' in s[i+1] and '0' in s[i+2]:\n p=\"Good\"\n if '1' in s[i] and '0' in s[i+1] and '1' in s[i+2]:\n p=\"Good\"\n print(p)\n \n", "# cook your dish here\nt = int(input())\nfor _ in range(t):\n s = input()\n if ((\"010\" in s) or (\"101\" in s)):\n print(\"Good\")\n else:\n print(\"Bad\")\n", "for _ in range(int(input())):\n s=input()\n if s.count('101')>0 or s.count('010')>0:\n print('Good')\n else:\n print('Bad')", "for _ in range(int(input())):\n s=input()\n if s.count('101')>0 or s.count('010')>0:\n print('Good')\n else:\n print('Bad')", "t=int(input())\nwhile t:\n t=t-1\n n=input()\n if (\"101\" in n or \"010\" in n):\n print(\"Good\")\n else:\n print(\"Bad\")\n", "# cook your dish here\n\nfor i in range(int(input().strip())):\n binst = input()\n result = \"Bad\"\n for i in range(len(binst)-2):\n st = binst[i:i+3]\n if st=='101' or st=='010':\n result = \"Good\"\n break\n\n print(result)", "\nT = int(input())\n\nfor _ in range(T):\n string = input()\n if \"101\" in string or \"010\" in string:\n print(\"Good\")\n else:\n print(\"Bad\")", "# binary string as the feedback form\n# chef classifies each feedback as GOOD or BACK\nt=int(input())\nfor i in range(t):\n s=input()\n ans=False\n for j in range(len(s)-2):\n if(s[j]=='0'):\n if(s[j+1]=='1'):\n if(s[j+2]=='0'):\n ans=True\n break\n else:\n if(s[j+1]=='0'):\n if(s[j+2]=='1'):\n ans=True\n break\n if(ans):\n print(\"Good\")\n else:\n print(\"Bad\")", "# binary string as the feedback form\n# chef classifies each feedback as GOOD or BACK\nt=int(input())\nfor i in range(t):\n s=input()\n ans=False\n for j in range(len(s)-2):\n if(s[j]=='0'):\n if(s[j+1]=='1'):\n if(s[j+2]=='0'):\n ans=True\n break\n else:\n if(s[j+1]=='0'):\n if(s[j+2]=='1'):\n ans=True\n break\n if(ans):\n print(\"Good\")\n else:\n print(\"Bad\")", "t = int(input())\nfor _ in range(t):\n n = input()\n if \"010\" in n:\n print(\"Good\")\n elif \"101\" in n:\n print(\"Good\")\n else:\n print(\"Bad\")\n\n", "# cook your dish here\nfor i in range(int(input())):\n s = input()\n if '101' in s:\n print(\"Good\")\n elif '010' in s:\n print(\"Good\")\n else:\n print(\"Bad\")", "for _ in range(int(input())):\n s=input()\n if '101' in s:\n print(\"Good\")\n elif '010' in s:\n print(\"Good\")\n else:\n print(\"Bad\")", "for _ in range(int(input())):\n s = input()\n if \"010\" in s or \"101\" in s:\n print(\"Good\")\n else: \n print(\"Bad\")", "for _ in range(int(input())):\n i='101'\n j='010'\n n=input()\n if i in n or j in n:\n print('Good')\n else:\n print('Bad')", "n=int(input())\nfor i in range(n):\n s=input()\n if \"010\" in s or \"101\" in s:\n print(\"Good\")\n else:\n print(\"Bad\")", "# cook your dish here\nfor _ in range(int(input())):\n n=input()\n good=['010','101']\n t=False\n for x in good:\n if x in n:\n print(\"Good\")\n t=True\n break\n if not t:\n print(\"Bad\")\n", "# cook your dish here\nfor _ in range(int(input())):\n n=input()\n good=['010','101']\n t=False\n for x in good:\n if x in n:\n print(\"Good\")\n t=True\n break\n if not t:\n print(\"Bad\")\n \n", "# cook your dish here\nt=int(input())\nwhile t>0:\n s=input()\n n=len(s)\n c=s.find('101',0,n)+s.find('010',0,n)\n if c==-2:\n print('Bad')\n else :\n print('Good')\n t=t-1\n", "for _ in range(int(input())):\n s = input()\n flag = False\n if not s.find(\"101\")==-1:\n flag = True\n elif not s.find(\"010\")==-1:\n flag = True\n if(flag):\n print(\"Good\")\n else:\n print(\"Bad\")"]

{"inputs": [["2", "11111110", "10101010101010"]], "outputs": [["Bad", "Good"]]}

INTERVIEW

PYTHON3

CODECHEF

4,808

1c4a1077793786c810bfcb74feb802fc

UNKNOWN

-----Problem----- Nikki's latest work is writing a story of letters. However, she finds writing story so boring that, after working for three hours, she realized that all she has written are M long words consisting entirely of letters A and B. Having accepted that she will never finish the story in time, Nikki has decided to at least have some fun with it by counting bubbly words. Now Nikki is connecting pairs of identical letters (A with A, B with B) by drawing lines above the word. A given word is bubbly if each letter can be connected to exactly one other letter in such a way that no two lines intersect. So here is your task. Help Nikki count how many words are bubbly. -----Input----- - The first line of input contains the positive integer M, the number of words written down by Nikki. - Each of the following M lines contains a single word consisting of letters A and B, with length between 2 and 10^5, inclusive. The sum of lengths of all words doesn't exceed 10^6. -----Output----- The first and only line of output must contain the number of bubbly words. -----Constraints----- - 1 ≤ M ≤ 100 -----Sample Input----- 3 ABAB AABB ABBA -----Sample Output----- 2 -----Explanation----- - ABAB - It is not bubbly as A(indexed 1) will connect to A(indexed 3) by a line and when we try to connect B(indexed 2) with B(indexed 4) by a line then it will intersect with the line b/w A and A. - AABB - It is bubbly as line b/w A and A will not intersect with the line b/w B and B. - ABBA -It is also bubbly as lines will not intersect. We can draw line b/w A and A above the line b/w B and B. p { text-align:justify }

["def check(s):\n arr=[s[0]]\n l=len(s)\n f1=0\n for i in range(1,l):\n if arr==[]: arr.append(s[i])\n elif arr[-1]!=s[i]:arr.append(s[i])\n else: del arr[-1]\n if arr==[]: return True\n else: return False\n \ncount = 0\nfor t in range(eval(input())):\n s=input().strip()\n if check(s): count+=1\nprint(count)", "count = 0\nfor t in range(int(input())):\n l = []\n s = input()\n for c in s:\n l.append(c)\n if (len(l)==1):\n continue\n else:\n if (l[-1]==l[-2]):\n l = l[:-2]\n if (len(l)==0):\n count+=1\nprint(count)"]

{"inputs": [["3", "ABAB", "AABB", "ABBA"]], "outputs": [["2"]]}

INTERVIEW

PYTHON3

CODECHEF

534

055a58070b55400df17380a944630cfa

UNKNOWN

Chef would like go shopping to buy ingredients for his special dish. The local grocery store has some special discount offers. If you want to buy some set of ingredients you will pay for all ingredients except the cheapest one. Chef would like to spend as little money as possible. You have to help him. :) The store is pretty small and stocks only one unit of each ingredients. Opposite each ingredient is a hanging price tag corresponding to it. The salesman walked away for a minute, giving Chef an opportunity to swap some price tags. He would like to swap some tags to minimize his purchase cost. -----Input----- The first line of the input contains an integer T denoting the number of test cases. The description of T test cases follows. The first line of each test case contains a single integer N denoting the number of ingredients Chef needs to buy. The second line contains N space-separated integers A1, A2, ... , AN denoting the value written on the price tags opposite the needed ingredients. The third line contains a single integer M denoting the number of special offers. The following M lines lists inventory of special offers, one offer per line. Each line contains an integer Ci followed by Ci integers denoting the indices of ingredients constituting the ith discount offer. -----Output----- For each test case, output a single line containing the minimal purchase cost. -----Constraints----- - T ≤ 5 - 1 ≤ N ≤ 15 - 1 ≤ Ai ≤ 106 - 0 ≤ M ≤ 2N-1 - 2 ≤ Ci ≤ N - Subtask 1 (15 points): 1 ≤ N ≤ 5 - Subtask 2 (25 points): 1 ≤ N ≤ 10 - Subtask 3 (60 points): 1 ≤ N ≤ 15 -----Example----- Input: 1 4 1 2 3 4 3 2 1 2 2 3 4 3 1 2 3 Output: 6

["from itertools import permutations as p\ndef disc(a,b):\n for ai in a:\n for bi in b:\n if ai==bi:\n return False\n return True\n\nfor i in range(eval(input())):\n n = eval(input())\n arr = list(map(int,input().split()))\n perms = list(p(arr))\n m = eval(input())\n offer = {}\n for i in range(m):\n dup = list(map(int,input().split()))\n try:\n offer[dup[0]].append(dup[1:])\n except:\n offer[dup[0]] = [dup[1:]]\n ans = sum(arr)\n if n==1:\n print(ans)\n elif n==2:\n try:\n if len(offer[2])>=1:\n ans -= min(arr)\n except:\n pass\n print(ans)\n elif n==3:\n try:\n if len(offer[3])>=1:\n ans -= min(arr)\n except:\n pass\n try:\n if len(offer[2])>=1:\n value = 9999999999\n for item in perms:\n cur = 0\n cur += item[0]\n cur += max(item[1],item[2])\n if cur<value:\n value = cur\n if value<ans:\n ans = value\n except:\n pass\n print(ans)\n elif n==4:\n try:\n if len(offer[4])>=1:\n ans -= min(arr)\n except:\n pass\n #print ans\n try:\n if len(offer[3])>=1:\n value = 9999999999\n for item in perms:\n cur = 0\n cur = sum(item)\n cur -= min(item[1],item[2],item[3])\n if cur<value:\n value = cur\n if value<ans:\n ans = value\n except:\n pass\n #print ans\n try:\n if len(offer[2])>=1:\n value = 9999999999\n for item in perms:\n cur = 0\n cur = sum(item)\n cur -= min(item[1],item[2])\n if cur<value:\n value = cur\n if value<ans:\n ans = value\n #print ans\n #print offer[2]\n if len(offer[2])>=2:\n flg = False\n end = len(offer[2])\n for i in range(end):\n for j in range(i+1,end):\n if disc(offer[2][i],offer[2][j]):\n flg = True\n break\n #print flg\n if flg:\n value = 9999999999\n for item in perms:\n cur = 0\n cur = sum(item)\n cur -= min(item[1],item[0])\n cur -= min(item[2],item[3])\n if cur<value:\n value = cur\n if value<ans:\n ans = value\n except:\n pass\n print(ans)\n elif n==5:\n try:\n if len(offer[5])>=1:\n ans -= min(arr)\n except:\n pass\n try:\n if len(offer[4])>=1:\n value = 9999999999\n for item in perms:\n cur = 0\n cur = sum(item)\n cur -= min(item[1],item[2],item[3],item[4])\n if cur<value:\n value = cur\n if value<ans:\n ans = value\n except:\n pass\n try:\n if len(offer[2])>=1:\n value = 9999999999\n for item in perms:\n cur = 0\n cur = sum(item)\n cur -= min(item[1],item[2])\n if cur<value:\n value = cur\n if value<ans:\n ans = value\n if len(offer[2])>=2:\n flg = False\n end = len(offer[2])\n for i in range(end):\n for j in range(i+1,end):\n if disc(offer[2][i],offer[2][j]):\n flg = True\n break\n if flg:\n value = 9999999999\n for item in perms:\n cur = 0\n cur = sum(item)\n cur -= min(item[1],item[0])\n cur -= min(item[2],item[3])\n if cur<value:\n value = cur\n if value<ans:\n ans = value\n except:\n pass\n try:\n if len(offer[3])>=1:\n value = 9999999999\n for item in perms:\n cur = 0\n cur = sum(item)\n cur -= min(item[1],item[2],item[3])\n if cur<value:\n value = cur\n if value<ans:\n ans = value\n except:\n pass\n try:\n if len(offer[3])>=1 and len(offer[2])>=1:\n flg = False\n for i in offer[3]:\n for j in offer[2]:\n if disc(i,j):\n flg = True\n break\n if flg:\n value = 9999999999\n for item in perms:\n cur = 0\n cur = sum(item)\n cur -= min(item[1],item[0])\n cur -= min(item[2],item[3],item[4])\n if cur<value:\n value = cur\n if value<ans:\n ans = value\n except:\n pass\n print(ans)\n\n\n"]

{"inputs": [["1", "4", "1 2 3 4", "3", "2 1 2", "2 3 4", "3 1 2 3"]], "outputs": [["6"]]}

INTERVIEW

PYTHON3

CODECHEF

3,826

8a12d8c60725598209d8d7d89f50da1e

UNKNOWN

Nexus 4.O is going to be organized by ASME, GLA University. Shubhanshu, Head of Finance Team is working for it. He has $N$ number of bills of different values as $a$$1$,$ a$$2$, $a$$3$…$a$$n$. He is interested in a game in which one has to do the addition of the bills. But due to privacy concerns, he cannot share the details with others. He can only trust his best friend Avani with such a confidential thing. So, he asked her to play this game. Rules of the game : - Avani needs to answer $Q$ queries. - Every $Q$$i$ query has 2 values $X$$i$ and $Y$$i$. - Avani needs to find the sum of the values between $X$$i$ and $Y$$i$ (inclusive). So, you need to help Avani in answering the $Q$ queries -----Input:----- - First line will contain $T$, number of testcases. Then the testcases follow. - The first line of each test case contains the value $N$ and $Q$. - The second line of each test case contains the $N$ space-separated values as $a$$1$,$ a$$2$, $a$$3$…$a$$n$. - The next line of each test case containing $Q$ query with $X$$i$ and $Y$$i$. -----Output:----- For each test case, Print the total amount between $X$$i$ and $Y$$i$ for $Q$ number of queries. -----Constraints----- - $1 \leq T \leq 100$ - $1 \leq N \leq 10^5$ - $1 \leq Q \leq 10^5$ - $1 \leq a$$i$$ \leq 10^9$ -----Subtasks (25 points) :----- - $1 \leq N \leq 10^2$. - $1 \leq Q \leq 10^2$. - $1 \leq a$$i$$ \leq 10^5$. -----Subtasks (25 points) :----- - $1 \leq N \leq 10^3$. - $1 \leq Q \leq 10^3$. - $1 \leq a$$i$$ \leq 10^5$. -----Subtasks (50 points) :----- - $Original Constraints$. -----Sample Input:----- 1 8 3 1 2 3 4 5 6 7 8 2 3 1 6 5 8 -----Sample Output:----- 5 21 26 -----EXPLANATION:----- $Q$$1$ : (2,3) 2+3=5 $Q$$2$ : (1,6) 1+2+3+4+5+6=21 $Q$$3$ : (5,8) 5+6+7+8=26

["\nt=int(input())\nfor i in range(t):\n l=list(map(int,input().split(' ')))\n a=l[0]\n b=l[1]\n \n l1=list(map(int,input().split(' ')))\n for i in range(b):\n l2=list(map(int,input().split(' ')))\n a1=l2[0]\n b1=l2[1]\n su=0\n for j in range(a1-1,b1):\n su=(su+l1[j])%1000000000\n print(su) ", "\nt=int(input())\nfor i in range(t):\n l=list(map(int,input().split(' ')))\n a=l[0]\n b=l[1]\n \n l1=list(map(int,input().split(' ')))\n for i in range(b):\n l2=list(map(int,input().split(' ')))\n a1=l2[0]\n b1=l2[1]\n su=0\n for j in range(a1-1,b1):\n su=(su+l1[j])%1000000000\n print(su) ", "tc=int(input())\nfor i in range(0,tc):\n n,q=list(map(int,input().split()))\n l=[]\n l=list(map(int,input().split()))\n for j in range(0,q):\n x,y=list(map(int,input().split()))\n sum=0\n for k in range(x,y+1):\n sum=sum+l[k-1]\n print(sum) \n", "import math\nt=int(input())\nfor ii in range(t):\n n,q=[int(x) for x in input().split()]\n arr=[int(x) for x in input().split()]\n pre=[]\n s=0\n for i in arr:\n s+=i\n pre.append(s)\n for i in range(q):\n l,r=[int(x) for x in input().split()]\n l-=1\n r-=1\n if(l==0):\n print(pre[r])\n else:\n print(pre[r]-pre[l-1])\n", "# cook your dish here\nfor _ in range(int(input())):\n N,Q=input().split()\n L=list(map(int,input().split()))\n for i in range(int(Q)):\n X,Y=map(int,input().split())\n s=0\n for i in range(X-1,Y):\n s+=L[i]\n print(s)", "# cook your dish here\nfor _ in range(int(input())):\n N,Q=list(map(int,input().split()))\n L=list(map(int,input().split()))\n for i in range(Q):\n X,Y=list(map(int,input().split()))\n print(sum(L[X-1:Y]))\n", "\nt=int(input())\nfor i in range(t):\n l=list(map(int,input().split(' ')))\n a=l[0]\n b=l[1]\n \n l1=list(map(int,input().split(' ')))\n for i in range(b):\n l2=list(map(int,input().split(' ')))\n a1=l2[0]\n b1=l2[1]\n su=0\n for j in range(a1-1,b1):\n su=(su+l1[j])%1000000000\n print(su) ", "# cook your dish here\nn=int(input())\nfor i in range(n):\n a,b=input().split()\n b=int(b)\n l=list(map(int,input().split()))\n x=[0]\n for j in l: \n x.append(x[-1]+j)\n for j in range(b):\n e,f=input().split()\n print(x[int(f)]-x[int(e)-1])\n", "\nfor case in range(int(input())):\n n, q = list(map(int, input().split()))\n arr = list(map(int, input().split()))\n\n dic = {0:0}\n for i in range(1,n+1):\n dic[i] = dic[i-1] + arr[i-1]\n \n for que in range(q):\n xi, yi = list(map(int, input().split()))\n\n print(dic[yi] - dic[xi-1])\n", "T = int(input())\nfor i in range(T):\n a = input().split(\" \")\n N = int(a[0])\n Q = int(a[1])\n if(N>=1 and N<=100000 and Q>=1 and Q<=100000):\n b = input().split(\" \")\n l = list(map(int,b))\n l1 = []\n for k in range(Q):\n q = input().split(\" \")\n l1.extend(q)\n \n l2 = list(map(int,l1))\n m = 0\n while(m<len(l2)-1):\n s = 0\n c = l2[m]\n d = l2[m+1]\n for t in range(c-1,d):\n s = s + l[t] \n print(s)\n m = m+2\n", "T=int(input())\nwhile(T!=0):\n n,q=[int(x) for x in input().split(' ')]\n N=[int(x) for x in input().split(' ')]\n while(q!=0):\n s=0\n x,y=[int(x) for x in input().split(' ')]\n for i in range(x-1,y):\n s=s+N[i]\n print(s)\n q-=1\n T-=1", "# cook your dish here\nfor u in range(int(input())):\n n,k=map(int,input().split())\n l=list(map(int,input().split()))\n for q in range(k):\n x,y=map(int,input().split())\n print(sum(l[x-1:y]))", "# cook your dish here\nfor u in range(int(input())):\n n,k=list(map(int,input().split()))\n l=list(map(int,input().split()))\n for q in range(k):\n x,y=list(map(int,input().split()))\n s=0\n for i in range(x-1,y):\n s=s+l[i]\n\n print(s)\n", "# cook your dish here\nt=int(input())\nwhile t>0:\n t-=1\n n,tt=map(int,input().split())\n #print(tt)\n l=list(map(int,input().split()))\n while tt>0:\n a,b=map(int,input().split())\n print(sum(l[a-1:b]))\n tt -= 1", "for _ in range(int(input())):\n n, q = map(int, input().split())\n a = list(map(int, input().split()))\n\n p = [0]\n\n for i in a:\n p.append(p[-1] + i)\n\n for _ in range(q):\n x, y = map(int, input().split())\n\n print(p[y] - p[x - 1])", "# cook your dish here\nt=int(input())\nfor i in range(t):\n l=list(map(int,input().split(' ')))\n a=l[0]\n b=l[1]\n \n l1=list(map(int,input().split(' ')))\n for i in range(b):\n l2=list(map(int,input().split(' ')))\n a1=l2[0]\n b1=l2[1]\n print(sum(l1[a1-1:b1]))\n", "# cook your dish here\nn=int(input())\nfor i in range(n):\n a,b=input().split()\n b=int(b)\n l=list(map(int,input().split()))\n for j in range(b):\n x,y=input().split()\n x=int(x)-1\n y=int(y)\n print(sum(l[x:y]))\n", "# cook your dish here\nnoofcases=int(input())\nfor _ in range(noofcases):\n numqui=input().split()\n data=list(map(int,input().split()))\n for _ in range(int(numqui[1])):\n sum=0\n startstop=list(map(int,input().split()))\n for j in range(startstop[0]-1,startstop[1]):\n sum+=data[j]\n print(sum)", "# cook your dish here\nT = int(input())\nfor i in range(T):\n N,Q = map(int,input().split())\n lis = list(map(int,input().split()))\n cumSum = [0]\n for j in lis:\n cumSum.append(cumSum[-1]+j)\n for j in range(Q):\n x,y = map(int,input().split())\n print(cumSum[y]-cumSum[x-1])", "for _ in range(int(input())):\n n,q=map(int,input().split())\n arr=list(map(int,input().split()))\n prefix_sum=[0]\n for i in range(n):\n prefix_sum.append(prefix_sum[-1]+arr[i])\n for i in range(q):\n x,y=map(int,input().split())\n print(prefix_sum[y]-prefix_sum[x-1])", "n=int(input())\nwhile(n>0):\n l=list(map(int,input().split()))\n l1=list(map(int,input().split()))\n while(l[1]>0):\n l2=list(map(int,input().split()))\n s=0\n for i in range(l2[0]-1,l2[1]):\n s=s+l1[i]\n print(s)\n l[1]=l[1]-1\n n=n-1\n", "# cook your dish here\ndef program():\n n,q=map(int, input().split())\n l=list(map(int, input().split()))\n\n for i in range(q):\n a,b=map(int, input().split())\n print(sum(l[a-1:b]))\n\n\nt=int(input())\nfor i in range(t):\n program()"]

{"inputs": [["1", "8 3", "1 2 3 4 5 6 7 8", "2 3", "1 6", "5 8"]], "outputs": [["5", "21", "26"]]}

INTERVIEW

PYTHON3

CODECHEF

5,951