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
| starter_code
stringlengths 0
956
|
|---|---|---|---|---|---|---|---|---|---|
8e64cd52cacb00d45a47c25883ba88c6 | UNKNOWN | Amit is going on a date and he wants to gift his date an array of positive numbers. But he is running short on money. He already has an array of numbers in design. Cost of an array of numbers is the sum of elements in it. But he wants to minimize the cost of making it.
So he does the following number of operations one by one for any number of times:
He chooses two adjacent elements ,replace them by one element with value = XOR of the two numbers. This operation reduces length of array (and elements are re-numerated accordingly)
Find the minimum amount of money that Amit needs to spend to gift his date.
-----Input:-----
- First line will contain $T$, number of testcases. Then the testcases follow.
- Each testcase contains of $2$ lines of input, first line contains a single integer $N$ and the second line contains $N$ elements - $A1,A2,A3,.....,AN$
-----Output:-----
For each testcase, output in a single line answer denoting the minimum cost
-----Constraints-----
- $1 \leq T \leq 10$
- $1 \leq N \leq 10^5$
- $0 \leq Ai \leq 10^9$ for $1\leq i \leq N$
-----Sample Input:-----
3
5
8 4 1 5 0
5
1 2 4 0 8
2
10 10
-----Sample Output:-----
8
15
0
-----EXPLANATION:-----
For first case,
This array is :
$[8,4,1,5,0] -> [8,4,4,0] -> [8,0,0]$. Sum=$8$ So the answer is 8. | ["for _ in range(int(input())):\r\n n=int(input())\r\n l=list(map(int,input().split()))\r\n su=l[0]\r\n for i in range(1,n):\r\n su^=l[i]\r\n print(su)", "# cook your dish here\nt = int(input())\nfor _ in range(t):\n n = int(input())\n a = list(map(int,input().split()))\n x = 0\n for i in range(0,len(a)):\n x = x^a[i]\n print(x)", "# cook your dish here\nt = int(input())\nfor _ in range(t):\n n = int(input())\n a = list(map(int,input().split()))\n x = 0\n for i in range(0,len(a)):\n x = x^a[i]\n print(x)", "for _ in range(int(input())):\n n=int(input())\n a=[int(X ) for X in input().split()]\n x=0\n for i in a:\n x^=i\n print(x)# cook your dish here\n", "for _ in range(int(input())):\n n=int(input())\n l=list(map(int,input().split()))\n s=0\n for i in l:\n s^=i\n print(s)", "# cook your dish here\nfor _ in range(int(input())):\n n=int(input())\n li=list(map(int,input().split()))\n l=len(li)\n res=li[0]\n for i in range(1,l):\n res=res^li[i]\n print(res)", "# cook your dish here\nt=int(input())\nfor _ in range(t):\n n=int(input())\n l=list(map(int,input().split()))\n s=0\n l.sort()\n for i in range(n):\n s=s^l[i]\n #s=s^i\n print(s) ", "from functools import reduce\nfor _ in range(int(input())) :\n n = int(input())\n arr = list(map(int, input().split()))\n arr.sort()\n print(reduce(lambda x, y: x^y, arr))", "# cook your dish here\nt=int(input())\nwhile(t):\n n=int(input())\n #n,k=map(int,input().split())\n l=list(map(int,input().split()))\n ans=0\n for i in range(len(l)):\n #print(ans^l[i])\n ans=(ans^l[i])\n \n print(ans)\n t-=1", "t=int(input())\r\n\r\nfor t1 in range(t):\r\n n=int(input())\r\n a=list(map(int,input().split()))\r\n s=bin(a[0])[2:]\r\n s1=a[0]\r\n for i in range(1,n):\r\n x=bin(a[i])[2:]\r\n \r\n if len(s)>len(x):\r\n j=1\r\n s1=''\r\n while j<=len(x):\r\n if s[-j]==x[-j]:\r\n s1+=\"0\"\r\n else:\r\n s1+=\"1\"\r\n j+=1\r\n \r\n while j<=len(s):\r\n s1+=s[-j]\r\n j+=1\r\n \r\n s=s1[::-1]\r\n else:\r\n j=1\r\n s1=''\r\n while j<=len(s):\r\n if s[-j]==x[-j]:\r\n s1+=\"0\"\r\n else:\r\n s1+=\"1\"\r\n j+=1\r\n\r\n while j<=len(x):\r\n s1+=x[-j]\r\n j+=1\r\n \r\n s=s1[::-1]\r\n \r\n s=\"0b\"+s\r\n print(int(s,2))\r\n\r\n \r\n\r\n\r\n", "t=int(input())\r\n\r\nfor t1 in range(t):\r\n n=int(input())\r\n a=list(map(int,input().split()))\r\n s=bin(a[0])[2:]\r\n s1=a[0]\r\n for i in range(1,n):\r\n x=bin(a[i])[2:]\r\n \r\n if len(s)>len(x):\r\n j=1\r\n s1=''\r\n while j<=len(x):\r\n if s[-j]==x[-j]:\r\n s1+=\"0\"\r\n else:\r\n s1+=\"1\"\r\n j+=1\r\n \r\n while j<=len(s):\r\n s1+=s[-j]\r\n j+=1\r\n \r\n s=s1[::-1]\r\n else:\r\n j=1\r\n s1=''\r\n while j<=len(s):\r\n if s[-j]==x[-j]:\r\n s1+=\"0\"\r\n else:\r\n s1+=\"1\"\r\n j+=1\r\n\r\n while j<=len(x):\r\n s1+=x[-j]\r\n j+=1\r\n \r\n s=s1[::-1]\r\n \r\n s=\"0b\"+s\r\n print(int(s,2))\r\n\r\n \r\n\r\n\r\n", "t=int(input())\nfor _ in range(t):\n n=int(input())\n l=list(map(int,input().split()))\n s=[l[0]]\n for i in range(0,n-1):\n s.append(s[i]^l[i+1])\n print(s[-1])", "for i in range(int(input())):\n n = int(input())\n a = list(map(int, input().split()))\n x = a[0]\n for j in range(1, n):\n x = a[j] ^ x\n \n print(x)", "for i in range(int(input())):\r\n n=int(input())\r\n lst=list(map(int,input().split()))\r\n x=0\r\n for j in range(n):\r\n x^=lst[j]\r\n \r\n\r\n\r\n print(x)", "# cook your dish here\ntest = int(input())\n\nfor i in range(test):\n n = int(input())\n val = list(map(int,input().split()))\n\n\n x = 0\n if(len(val)==n):\n for i in val:\n x^=i\n print(x)\n", "for i in range(int(input())):\r\n n=int(input())\r\n a=list(map(int,input().split()))\r\n s=a[0]\r\n for i in range(1,n):\r\n s=s^a[i]\r\n print(s)", "# cook your dish here\ntc = int(input())\nwhile tc:\n tc -= 1\n n = int(input())\n lst = list(map(int, input().split()))\n t = 0\n for x in lst:\n t = t^x\n print(t)", "t=int(input())\r\nwhile t>0:\r\n t=t-1\r\n n=int(input())\r\n l=list(map(int,input().split()))\r\n q=0\r\n for i in l:\r\n q=q^i\r\n print(q)", "# cook your dish here\nfor i in range(int(input())):\n n=int(input())\n arr=list(map(int,input().split()))\n ans=0\n for i in arr:\n ans^=i\n print(ans)", "import sys\r\nimport math\r\nimport bisect\r\nfrom sys import stdin,stdout\r\nfrom math import gcd,floor,sqrt,log\r\nfrom collections import defaultdict as dd\r\nfrom bisect import bisect_left as bl,bisect_right as br\r\n\r\nsys.setrecursionlimit(100000000)\r\n\r\nii =lambda: int(input())\r\nsi =lambda: input()\r\njn =lambda x,l: x.join(map(str,l))\r\nsl =lambda: list(map(str,input().strip()))\r\nmi =lambda: list(map(int,input().split()))\r\nmif =lambda: list(map(float,input().split()))\r\nlii =lambda: list(map(int,input().split()))\r\n\r\nceil =lambda x: int(x) if(x==int(x)) else int(x)+1\r\nceildiv=lambda x,d: x//d if(x%d==0) else x//d+1\r\n\r\nflush =lambda: stdout.flush()\r\nstdstr =lambda: stdin.readline()\r\nstdint =lambda: int(stdin.readline())\r\nstdpr =lambda x: stdout.write(str(x))\r\n\r\nmod=1000000007\r\n\r\n\r\n#main code\r\nfor _ in range(ii()):\r\n n=ii()\r\n arr=lii()\r\n sol=0\r\n for ele in arr:\r\n sol=sol^ele\r\n print(sol)\r\n \r\n", "for _ in range(int(input())):\n n = int(input())\n ls = list(map(int,input().rstrip().split(\" \")))\n res=ls[0]\n for i in range(1,n):\n \n res=res^ls[i]\n print(res)\n", "\n\nfor _ in range(int(input())):\n n=int(input())\n l=list(map(int,input().split()))\n ans=0\n for i in l:\n ans^=i\n print(ans)\n\n\n\n\n\n", "for _ in range(int(input())):\r\n n=int(input())\r\n a=list(map(int,input().split()))\r\n a.sort()\r\n r= a[0]^a[1]\r\n for i in range(2,n): \r\n r=r^a[i]\r\n\r\n print(r) \r\n \r\n\r\n", "\n\nfor _ in range(int(input())):\n n=int(input())\n l=list(map(int,input().split()))\n ans=0\n for i in l:\n ans^=i\n print(ans)\n\n\n\n\n\n", "# cook your dish here\nt=int(input())\nw=[]\nfor _ in range(t):\n n=int(input())\n s=list(map(int,input().split()))\n a=s[0]^s[1]\n for i in range(n-2):\n a=a^s[i+2]\n w.append(a)\nfor i in w:\n print(i)\n\n\n\n\n"] | {"inputs": [["3", "5", "8 4 1 5 0", "5", "1 2 4 0 8", "2", "10 10"]], "outputs": [["8", "15", "0"]]} | INTERVIEW | PYTHON3 | CODECHEF | 7,462 | |
41f517608c8e1154daa3de678a12b50b | UNKNOWN | We all know Gru loves Agnes very much. One day Agnes asked Gru to answer some of her queries. She lined up $N$ minions in a straight line from $1$ to $N$.
You are given an array $A$ which contains the height of minions. Agnes will ask him several queries. In each query, Gru has to tell whether the bitwise AND of $A[L \ldots R]$ is EVEN or ODD. Since Gru is busy planning the biggest heist on Earth, he asks for your help.
-----Input:-----
- First line of the input contains an integer $T$ denoting the number of test cases.
For each test case:-
- First line contains an integer $N$ denoting the number of elements.
- Second line contains $N$ spaced integer representing array elements.
- Third line contains $Q$ representing number of query.
- Next $Q$ lines contains two integer $L$ and $R$ as defined above.
-----Output:-----
For each query, output "EVEN" or "ODD" without quotes.
-----Constraints-----
- $1 \leq T \leq 10$
- $1 \leq N \leq 10^5$
- $1 \leq A_i \leq 10^5$
- $1 \leq Q \leq 10^5$
-----Sample Input:-----
1
5
1 3 2 4 5
3
1 2
1 5
3 4
-----Sample Output:-----
ODD
EVEN
EVEN
-----Explanation-----
- For the first query, the bitwise AND of 1 and 3 is 1, which is Odd. Hence the first output is ODD.
- For the third query, the bitwise AND of 2 and 4 is 0, which is Even. Hence the third output is EVEN. | ["# cook your dish here\nfor _ in range(int(input())):\n n=int(input())\n a=[int(x) for x in input().split()]\n sum=0\n for i in range(n):\n if a[i]%2==0:\n sum+=1\n a[i]=sum \n q=int(input())\n while q:\n l,r=map(int,input().split())\n if l!=1:\n c=a[r-1]-a[l-2]\n else:\n c=a[r-1] \n if c==0:\n print(\"ODD\")\n else:\n print(\"EVEN\")\n q-=1", "t=int(input())\nfor o in range(t):\n n=int(input())\n l=list(map(int,input().split()))\n q=int(input())\n l1=[]\n c=0\n for i in l:\n if i%2==0:\n c+=1\n l1.append(c)\n else:\n l1.append(c)\n #print(l1)\n for v in range(q):\n l,r=map(int,input().split())\n l-=1\n r-=1 \n if l==0:\n if l1[r]>0:\n print(\"EVEN\")\n else:\n print(\"ODD\")\n else:\n l-=1\n x=l1[r]-l1[l]\n if x>0:\n print(\"EVEN\")\n else:\n print(\"ODD\")", "for _ in range(int(input())):\n \n t = int(input())\n arr = list(map(int, input().split()))\n prearr = [0]\n cnt = 0\n \n for i in range(t):\n if arr[i]%2==0:\n cnt+=1\n \n prearr.append(cnt)\n \n for _ in range(int(input())):\n l,r = map(int, input().split())\n \n tot = prearr[r]-prearr[l-1]\n print(\"EVEN\") if tot>0 else print(\"ODD\")", "for _ in range(int(input())):\n n=int(input())\n l=list(map(int,input().split()))\n k,c=[],0\n for i in l:\n if i%2==0:\n c+=1\n k.append(c)\n q=int(input())\n for i in range(q):\n a,b=map(int,input().split())\n a-=1\n b-=1\n if a==0:\n if k[b]>0:\n print(\"EVEN\")\n else:\n print(\"ODD\")\n else:\n a-=1\n x=k[b]-k[a]\n if x>0:\n print(\"EVEN\")\n else:\n print(\"ODD\")", "# def find_and(arr):\n# ans = arr[0] \n# for i in range(1, len(arr)):\n# ans = ans&arr[i]\n# return ans\n# def checkEvenOdd(arr, n):\n# for i in range(n) :\n# if arr[i] % 2 == 0:\n# print(\"EVEN\")\n# return\n# print(\"ODD\")\n# t = int(input())\n# for _ in range(t):\n# N = int(input())\n# lst = list(map(int, input().split()))\n# Q = int(input())\n# Nlst = []\n# for _ in range(Q):\n# L, R = map(int, input().strip().split())\n# z = checkEvenOdd(lst[L-1:R], len(lst[L-1:R]))\nfor _ in range(int(input())):\n n=int(input())\n lis=list(map(int,input().split()))\n q=int(input())\n s=''\n for i in range(n):\n if (lis[i]&1)==0:\n s+='0'\n else:\n s+='1'\n for _ in range(q):\n x=list(map(int,input().split()))\n l=x[0]\n r=x[1]\n temp='1'*((r+1)-l)\n if temp==s[l-1:r]:\n print(\"ODD\")\n else:\n print(\"EVEN\")", "t = int(input())\nfor cases in range(t):\n n = int(input())\n arr = list(map(int,input().strip().split()))\n odd = [0]*n\n if arr[0]%2==1:\n odd[0] = 1\n for i in range(1,n):\n if arr[i]%2==1:\n odd[i] = 1\n odd[i] += odd[i-1]\n qu = int(input())\n for q in range(qu):\n l,r = map(int,input().split())\n l = l-1\n r = r-1\n flag = 0\n c = odd[r]\n if l>0:\n c -= odd[l-1]\n if c == (r-l+1):\n print(\"ODD\")\n else:\n print(\"EVEN\")", "t=int(input())\nfor _ in range(t):\n n=int(input())\n m=list(map(int,input().split()))\n p=[]\n temp=0\n for i in range(n):\n if(m[i]%2==0):\n m[i]=0\n else:\n m[i]=1\n temp=temp+m[i]\n p.append(temp)\n \n ans=[]\n q=int(input())\n for i in range(q):\n a,b=list(map(int,input().split()))\n a,b=a-1,b-1\n if(a>=1):\n temp=p[b]-p[a-1]\n else:\n temp=p[b]\n if(temp==(b-a+1)):\n print(\"ODD\")\n else:\n print(\"EVEN\")", "t=int(input())\nwhile(t):\n t=t-1\n n=int(input())\n a=list(map(int,input().split()))\n fin=[]\n fin.append(0)\n \n for i in range(n):\n if(a[i]%2==0):\n p=fin[-1]\n fin.append(p+1)\n else:\n p=fin[-1]\n fin.append(p)\n \n \n q=int(input())\n while(q>0):\n q=q-1\n r,ti=list(map(int,input().split()))\n m=fin[ti]\n n=fin[r-1]\n even=m-n\n if(even==0):\n print(\"ODD\")\n else:\n print(\"EVEN\")\n", "t=int(input())\nwhile(t):\n t=t-1\n n=int(input())\n a=list(map(int,input().split()))\n fin=[]\n fin.append(0)\n \n for i in range(n):\n if(a[i]%2==0):\n p=fin[-1]\n fin.append(p+1)\n else:\n p=fin[-1]\n fin.append(p)\n \n \n que=int(input())\n while(que>0):\n que=que-1\n r,ti=list(map(int,input().split()))\n m=fin[ti]\n n=fin[r-1]\n even=m-n\n if(even==0):\n print(\"ODD\")\n else:\n print(\"EVEN\")\n \n", "t = int(input())\nfor _ in range(t):\n n = int(input())\n arr = list(map(int,input().split()))\n q = int(input())\n s = [0 for i in range(n)]\n ev = 0\n for i in range(n):\n if arr[i]%2==0:\n ev+=1\n s[i] = ev\n for i in range(q):\n l,r = list(map(int,input().split()))\n l-=1\n r-=1\n if arr[l]%2==0 or arr[r]%2==0:\n print('EVEN')\n continue\n diff = s[r] - s[l]\n if diff>0:\n print('EVEN')\n else:\n print('ODD')\n", "for i in range(int(input())):\n n = int(input())\n y = [int(x) for x in input().split()]\n y = [x%2 for x in y]\n \n lst=[0]\n lst.extend(y)\n for j in range(n+1):\n if lst[j]==0:\n lst[j] = lst[j-1]+1\n else:\n lst[j]=lst[j-1]\n \n for j in range(int(input())):\n l,r =map(int,input().split())\n if lst[r]-lst[l-1]>0:\n print(\"EVEN\")\n else:\n print(\"ODD\")", "for _ in range(int(input())):\n lens=int(input())\n arrs=[int(x) for x in input().split()]\n even=[i for i,x in enumerate(arrs) if x%2==0]\n nbq=int(input())\n for _ in range(nbq):\n answer=\"ODD\"\n l,r=[int(x) for x in input().split()]\n for j in even:\n if(l-1)<=j<r: \n answer=\"EVEN\"\n break\n print(answer)", "# cook your dish here\n# your code goes here\nfor _ in range(int(input())):\n n = int(input())\n l=list(map(int,input().split()))\n m= int(input())\n prefix = [0 for i in range(n)]\n if l[0]%2==0:\n prefix[0]=1\n else:\n prefix[0]=0\n for k in range(1,n):\n if l[k]%2==0:\n prefix[k]=prefix[k-1]+1\n else:\n prefix[k]=prefix[k-1]\n #print(prefix)\n for i in range(m):\n l,r =list(map(int,input().split()))\n l-=1\n r-=1\n if prefix[r]-prefix[max(0,l-1)]>0:\n print(\"EVEN\")\n else:\n print(\"ODD\")\n", "x=int(input())\nfor y in range(x):\n N=int(input())\n Z=list(map(int,input().split()))\n P=int(input())\n Z1=[0]\n count=0\n for q in range(N):\n if(Z[q]%2==0):\n count+=1\n Z1.append(count)\n \n for t in range(P):\n i,j=list(map(int,input().split()))\n if((Z1[j]-Z1[i-1])>0):\n print(\"EVEN\")\n else:\n print(\"ODD\")\n", "t = int(input());\nfor test in range(t):\n n = int(input());\n arr = list(map(int,input().split()));\n check = [0 for i in range(n+2)];\n for i in range(n):\n check[i+1]=check[i];\n if(arr[i]%2==0):\n check[i+1]+=1;\n q = int(input());\n for i in range(q):\n l,r = list(map(int,input().split()));\n if(check[r]-check[l-1])>0:\n print(\"EVEN\");\n else:\n print(\"ODD\");\n \n", "# cook your dish here\nfor _ in range(int(input())):\n n = int(input())\n a = list(map(int,input().split()))\n sum = []\n temp = 0\n for i in range(n):\n temp += a[i]%2\n sum.append(temp)\n q = int(input())\n # print(sum)\n while q!=0:\n q -= 1 \n l,r = [int(x) for x in input().split()]\n l -= 1 \n r -= 1 \n if sum[r]-sum[l]+a[l]%2==r-l+1:\n print(\"ODD\")\n else:\n print(\"EVEN\")\n", "from bisect import *\nt=int(input())\nwhile(t):\n t-=1\n n=int(input())\n a=list(map(int,input().split()))\n a.append(0)\n ref=[]\n l=1\n r=0\n for i in range(n+1):\n if(a[i]%2):\n r+=1\n else:\n if(l and r):\n ref.append([l,r+l-1])\n l=i+2\n r=0\n l=i+2\n ref1=[]\n for i in ref:\n ref1.append([i[1],i[0]])\n #print(ref)\n q=int(input())\n while(q):\n q-=1\n l,r=list(map(int,input().split()))\n it=bisect_left(ref1,[l])\n if(l>=ref1[it][1] and r<=ref1[it][0]):\n print(\"ODD\")\n else:\n print(\"EVEN\")\n", "for _ in range(int(input())):\n n=int(input())\n m=[0]\n c=0\n l1=list(map(int,input().split()))\n for i in range(len(l1)):\n if(l1[i]%2==0):\n c+=1\n m.append(c)\n #print(m)\n for _ in range(int(input())):\n l,r=list(map(int,input().split()))\n s=m[r]-m[l-1]\n if(s==0):\n print(\"ODD\")\n else:\n print(\"EVEN\")\n", "for _ in range(int(input())):\n n=int(input())\n a=list(map(int,input().split()))\n MAT=[0]\n cur=0\n for i in range(n):\n if a[i]%2==0:\n cur+=1\n MAT.append(cur)\n for i in range(int(input())):\n l,r=map(int,input().split())\n if MAT[r]-MAT[l-1]==0:\n print(\"ODD\")\n else:\n print(\"EVEN\")", "for _ in range(int(input())):\n n=int(input())\n a=list(map(int,input().split()))\n MAT=[0]\n cur=0\n for i in range(n):\n a[i]=str(bin(a[i]))[-1]\n if a[i]=='0':\n cur+=1\n MAT.append(cur)\n for i in range(int(input())):\n l,r=map(int,input().split())\n if MAT[r]-MAT[l-1]==0:\n print(\"ODD\")\n else:\n print(\"EVEN\")", "# cook your dish here\nt = int(input())\nwhile t > 0:\n n = int(input())\n a = [int(ele) for ele in input().split()]\n for i in range(n):\n num = bin(a[i])\n if num[-1] == '1':\n a[i] = 1\n else:\n a[i] = 0\n if i != 0:\n a[i] += a[i-1]\n q = int(input())\n while q > 0:\n l, r = [int(ele) for ele in input().split()]\n x = a[r-1]\n if l==1:\n y = 0\n else:\n y = a[l-2]\n if (x-y == (r-l+1)):\n print(\"ODD\")\n else:\n print(\"EVEN\")\n q -= 1\n t -= 1\n \n", "for _ in range(int(input())):\n n = int(input())\n a = list(map(int,input().split()))\n p = []; cnt = 0\n for i in range(n):\n if a[i]%2==0:\n cnt += 1\n p.append(cnt)\n cnt += 1\n continue\n p.append(cnt)\n for _ in range(int(input())):\n l,r = list(map(int,input().split()))\n if p[r-1]-p[l-1]>0:\n print('EVEN')\n else:\n print('ODD')\n", "for _ in range(int(input())):\n n = int(input())\n a = list(map(int,input().split()))\n p = []; cnt = 0\n for i in range(n):\n if a[i]%2==0:\n cnt += 1\n p.append(cnt)\n cnt += 1\n continue\n p.append(cnt)\n for _ in range(int(input())):\n l,r = list(map(int,input().split()))\n if p[r-1]-p[l-1]>0:\n print('EVEN')\n else:\n print('ODD')\n", "# cook your dish here\nt=int(input())\nwhile t>0:\n t-=1\n n=int(input())\n li=[]\n lis=list(map(int,input().split()))\n for i in range(n):\n if(lis[i]%2==0):\n li.append(i)\n q=int(input())\n for i in range(q):\n l,r=map(int,input().split())\n f=0\n for j in li:\n if(l-1<=j and j<r):\n f=1\n break\n if(j>=r):\n break\n if(f==1):\n print(\"EVEN\")\n else:\n print(\"ODD\")"] | {"inputs": [["1", "5", "1 3 2 4 5", "3", "1 2", "1 5", "3 4"]], "outputs": [["ODD", "EVEN", "EVEN"]]} | INTERVIEW | PYTHON3 | CODECHEF | 10,204 | |
dad96ca38a493b4eae76182861093577 | UNKNOWN | Motu wants to learn Cricket from a coach, but firstly coach wants to test his IQ level, so he gave Motu $1$ $Red$ $ball$ and $1$ $Black$ $ball$ , and asked him to buy other $x – 1$ red balls and other $y – 1$ black balls from the market. But he put some conditions on buying balls, that if he has $R$ red and $B$ black balls then he can either buy $B$ red balls or $R$ black balls in one operation. He can perform this operation as many times as he want. But as Motu is not so good in solving problems so he needs your help. So you have to tell him whether his coach’s task possible or not.
-----Input:-----
- First line will contain $T$, number of testcases. Then the testcases follow.
- Each testcase contains of a single line of input, two integers $x , y$.
-----Output:-----
For each testcase, print $YES$, if it is possible to complete coach task, else print $NO$(without quotes) in a separate line.
-----Constraints-----
- $1 \leq T \leq 100000$
- $1 \leq x, y \leq$ 10^18
-----Sample Input:-----
2
1 2
2 3
-----Sample Output:-----
YES
YES | ["T=int(input())\nwhile T:\n x,y=map(int,input().split())\n while(y): \n x, y = y, x % y\n if x==1:\n print(\"YES\")\n else:\n print(\"NO\")\n T-=1", "import math\nT=int(input())\nwhile T:\n\ta,b=map(int,input().split())\n\tif math.gcd(a,b)==1:\n\t\tprint(\"YES\")\n\telse:\n\t\tprint(\"NO\")\n\tT-=1", "\nimport math\nt=int(input())\nfor _ in range(t):\n a,b=(list(map(int,input().split())))\n if (math.gcd(a,b)==1):\n print(\"YES\")\n else:\n print(\"NO\")\n \n", "# cook your dish here\nfor t in range(int(input())):\n R, B = [int(i) for i in input().split(\" \")]\n while(R > 1 and B > 1):\n if R > B:\n R = R - (B * int(R/B))\n elif R < B:\n B = B - (R * int(B/R))\n else:\n break\n # print(\"R: \" + str(R) + \" B: \" + str(B))\n if R == 1 or B == 1:\n print(\"YES\")\n else:\n print(\"NO\")", "import math\r\nfor _ in range(int(input())):\r\n x,y=map(int,input().split())\r\n if math.gcd(x,y)==1:\r\n print(\"YES\")\r\n continue\r\n print(\"NO\")", "def gcd(a, b):\n while b:\n a, b = b, a % b\n return a\n\n\ndef sol(x, y):\n return 'YES' if gcd(x, y) == 1 else 'NO'\n\n\ndef main():\n T = int(input())\n for i in range(T):\n x, y = list(map(int, input().split()))\n print(sol(x, y))\n\n\ndef __starting_point():\n main()\n\n__starting_point()", "from math import gcd\r\nfor _ in range(int(input())):\r\n x,y=list(map(int,input().split()))\r\n if gcd(x,y)>1:\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")\r\n", "from math import *\r\nt=int(input())\r\nfor _ in range(t):\r\n x,y=map(int,input().split())\r\n k=gcd(x,y)\r\n if k==1:\r\n print('YES')\r\n else:\r\n print('NO')", "# cook your dish here\nfrom fractions import gcd\n# def gcd(a,b):\n# if a==0:\n# return b\n# elif b==0:\n# return a\n# if a>=b:\n# return gcd(b,a/b)\n# else:\n# return gcd(b,a)\nt=int(input())\nwhile t:\n x,y=[int(i) for i in input().split(' ')]\n if gcd(x,y)==1:\n print(\"YES\")\n else:\n print(\"NO\")\n t-=1", "# cook your dish here\ndef gcd(a,b):\n if(a == 0):\n return b\n return gcd(b%a,a)\n\ntestcases = int(input())\nwhile(testcases):\n testcases -= 1\n x,y = map(int,input().split())\n if(gcd(x,y) == 1):\n print('YES')\n else:\n print('NO')", "def rec(x,y):\r\n if x==1 or y==1:\r\n return True\r\n if x==0 or y==0:\r\n return False\r\n l = max(x,y)\r\n m = min(x,y)\r\n return rec(l%m,m)\r\n\r\nt = int(input())\r\nfor _ in range(t):\r\n a, b = (int(x) for x in input().split())\r\n if rec(a,b):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "# cook your dish here\ndef gcd(a, b):\n while b != 0:\n a, b = b, a % b\n return a\n\nfor test in range(int(input())):\n a = [int(s) for s in input().split()]\n if gcd(a[0], a[1]) == 1: print(\"YES\")\n else: print(\"NO\")", "import math\r\nfor i in range(int(input())):\r\n\ta,b=list(map(int,input().split()))\r\n\tif math.gcd(a,b)==1:\r\n\t\tprint('YES')\r\n\telse:\r\n\t\tprint('NO')\r\n\r\n", "#for _ in range(int(input())):\n#dt = {} for i in x: dt[i] = dt.get(i,0)+1\n#dt = {k:v for k,v in sorted(x.items(), key=lambda i: i[1])}\nipnl = lambda n: [int(input()) for _ in range(n)]\ninp = lambda :int(input())\nip = lambda :[int(w) for w in input().split()]\nmp = lambda :map(int,input().split())\n\nimport math\nfor _ in range(int(input())):\n x,y = mp()\n if math.gcd(x,y)==1:\n print(\"YES\")\n else:\n print(\"NO\")", "#for _ in range(int(input())):\n#dt = {} for i in x: dt[i] = dt.get(i,0)+1\n#dt = {k:v for k,v in sorted(x.items(), key=lambda i: i[1])}\nipnl = lambda n: [int(input()) for _ in range(n)]\ninp = lambda :int(input())\nip = lambda :[int(w) for w in input().split()]\nmp = lambda :map(int,input().split())\nimport math\n\ndef per(x): \n s = int(math.sqrt(x))\n return s*s == x \ndef isfibo(n): \n return per(5*n*n + 4) or per(5*n*n - 4)\n\nfor _ in range(int(input())):\n x,y = mp()\n if math.gcd(x,y)==1:\n print(\"YES\")\n else:\n print(\"NO\")", "def hcf(x, y):\n while(y):\n x, y = y, x % y\n return x\n\ndef __starting_point():\n for _ in range(int(input())):\n x,y=list(map(int,input().split()))\n if hcf(x,y)==1:\n print(\"YES\")\n else:\n print(\"NO\") \n\n__starting_point()", "t = int(input())\ndef gcd(a, b) : \n \n if (a == 0) : \n return b \n \n return gcd(b % a, a)\nwhile(t>0):\n x = input().split()\n a = int(x[0])\n b = int(x[1])\n if(gcd(a,b)==1):\n print(\"YES\")\n else:\n print(\"NO\")\n t-=1", "for _ in range(int(input())):\n a,b=list(map(int,input().split()))\n \n flag=0\n while 1:\n if a==b and a!=1 :\n print(\"NO\")\n flag=1\n break\n \n elif a==1 or b==1:\n print(\"YES\")\n flag=1\n break\n \n elif a>b and a%b==0:\n print(\"NO\")\n flag=1\n break\n \n elif b>a and b%a==0:\n print(\"NO\")\n flag=1\n break\n \n if a>b:\n a,b=a%b,b\n else:\n a,b=a,b%a\n \n \n \n", "import math\n\nfor _ in range(int(input())):\n x,y = list(map(int,input().split()))\n r=1\n b=1\n temp=(math.gcd(x,y))\n if(temp==1):\n print(\"YES\")\n else:\n print(\"NO\")\n", "for _ in range(int(input())):\r\n x,y = map(int,input().split())\r\n Flag = False\r\n while x>=1 and y >= 1: \r\n if x==1 or y==1:\r\n Flag = True\r\n break\r\n elif x==y and x!=1:\r\n break\r\n elif x > y:\r\n x = x - (x//y)*y\r\n else:\r\n y = y - (y//x)*x\r\n if Flag:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "import math\nfor _ in range(int(input())):\n ab = input()\n a,b = list(map(int,ab.split(' ')))\n if a < b:\n a,b = (b,a)\n if math.gcd(a,b) > 1:\n print('NO')\n else:\n print('YES')\n", "for _ in range(int(input())):\n x,y = list(map(int,input().split()))\n a = max(x,y)\n b = min(x,y)\n while a%b!=0:\n a = a%b\n p = a\n q = b\n a = max(p,q)\n b = min(p,q)\n \n if a==1 or b==1:\n print('YES')\n else:\n print('NO')\n", "def main():\r\n for _ in range(int(input())):\r\n a,b=list(map(int,input().split()))\r\n while(not (a==1 and b==1)):\r\n if(a==b or a==0 or b==0):\r\n break\r\n if(a==max(a,b)):\r\n a=a%b\r\n else:\r\n b=b%a\r\n # print(a,b)\r\n if((a==1 and b==0 ) or (a==0 and b==1)):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nmain()", "t=int(input())\nfor c in range(t):\n x,y=list(map(int,input().split()))\n f=0\n while(x!=1 and y!=1 and f==0):\n if(y>x and y%x==0):\n f=1\n elif(y>x):\n y=y%x\n elif(x>y and x%y==0):\n f=1\n elif(x>y):\n x=x%y\n elif(x==y and x!=1):\n f=1\n if(f==0):\n print(\"YES\")\n else:\n print(\"NO\")\n", "import math\r\nfor i in range(int(input().strip())):\r\n\ta, b = [ int(i) for i in input().strip().split(' ')]\r\n\tif math.gcd(a,b)==1:\r\n\t\tprint('YES')\r\n\telse:\r\n\t\tprint('NO')\r\n"] | {"inputs": [["2", "1 2", "2 3"]], "outputs": [["YES", "YES"]]} | INTERVIEW | PYTHON3 | CODECHEF | 7,747 | |
d008aedc507844a61970c098b47c4ed7 | UNKNOWN | The Little Elephant from the Zoo of Lviv is going to the Birthday Party of the Big Hippo tomorrow. Now he wants to prepare a gift for the Big Hippo.
He has N balloons, numbered from 1 to N. The i-th balloon has the color Ci and it costs Pi dollars. The gift for the Big Hippo will be any subset (chosen randomly, possibly empty) of the balloons such that the number of different colors in that subset is at least M.
Help Little Elephant to find the expected cost of the gift.
-----Input-----
The first line of the input contains a single integer T - the number of test cases. T test cases follow. The first line of each test case contains a pair of integers N and M. The next N lines contain N pairs of integers Ci and Pi, one pair per line.
-----Output-----
In T lines print T real numbers - the answers for the corresponding test cases. Your answer will considered correct if it has at most 10^-6 absolute or relative error.
-----Constraints-----
- 1 ≤ T ≤ 40
- 1 ≤ N, Ci≤ 40
- 1 ≤ Pi ≤ 1000000
- 0 ≤ M ≤ K, where K is the number of different colors in the test case.
-----Example-----
Input:
2
2 2
1 4
2 7
2 1
1 4
2 7
Output:
11.000000000
7.333333333 | ["# cook your dish here\nfor _ in range(int(input())):\n n,m = list(map(int,input().split()))\n colors = [0]*41; cost = [0]*41\n color = 0\n for i in range(n):\n cc,pp = list(map(int,input().split()))\n colors[cc] += 1\n cost[cc] += pp\n for i in colors:\n if i>0: color += 1\n dp2 = [[0]*41 for i in range(color+1)]\n dp2[0] = [1]*41\n for i in range(1,color+1):\n for j in range(1,41):\n dp2[i][j] = dp2[i][j-1]+dp2[i-1][j-1]*(2**colors[j]-1)\n dp1 = [[0]*41 for i in range(color+1)]\n for i in range(1,color+1):\n for j in range(1,41):\n dp1[i][j] = dp1[i][j-1]+dp1[i-1][j-1]*(2**colors[j]-1)+dp2[i-1][j-1]*cost[j]*(2**(colors[j]-1))\n num=den=0\n for i in range(m,color+1):\n num += dp1[i][40]\n den += dp2[i][40]\n print(num/den)"] | {"inputs": [["2", "2 2", "1 4", "2 7", "2 1", "1 4", "2 7"]], "outputs": [["11.000000000", "7.333333333"]]} | INTERVIEW | PYTHON3 | CODECHEF | 853 | |
b9b5403c33798d5cad118b05567df28b | UNKNOWN | You are given $n$ intervals on the $X$ axis. Each interval $i$ is specified by its ends $[L_i, R_i]$. You want to color each interval either blue or yellow. After coloring all the intervals, the $X$ axis will will have $4$ colors:
- White, the part of $X$ axis contained in no interval
- Blue, the part of $X$ axis contained in atleast one blue colored interval and no yellow colored interval.
- Yellow, the part of $X$ axis contained in atleast one yellow colored interval and no blue colored interval.
- Green, the part of $X$ axis contained in at least one blue colored interval and at least one yellow colored interval.
You want to color the intervals so that the total length of the part colored green is maximized. If there are multiple ways to color which maximize the green part, you can output any of them.
-----Input:-----
- First line will contain $T$, number of testcases. Then the testcases follow.
- The first line of each testcase contains $n$, the number of intervals.
- The $i^{\text{th}}$ of the next $n$ lines contains two integers $L_i$ and $R_i$ describing the $i^{\text{th}}$ interval.
-----Output:-----
For each testcase, output a single string on a new line, whose $i^{\text{th}}$ character is $0$ if you color the $i^{\text{th}}$ interval blue, and $1$ if you color it yellow.
-----Constraints-----
- $ 1 \leq T \leq 10^5 $
- $ 1 \leq n \leq 10^5 $
- The sum of $n$ over all testcases doesn't exceed $10^5$.
- $ 1 \leq L_i \leq R_i \leq 10^9 $ for al $ 1 \leq i \leq n$.
-----Sample Input:-----
1
3
3 7
2 5
6 9
-----Sample Output:-----
100
-----Explanation:-----
The intervals are $[3, 7]$, $[2, 5]$, $[6, 9]$. It is optimal to color them in yellow, blue and blue respectively. In this coloring:
- $[2, 3) \cup (7, 9]$ is colored blue.
- $(5, 6)$ is colored yellow.
- $[3, 5] \cup [6, 7]$ is colored green, with a total length of $(5 - 3) + (7 - 6) = 3$.
- Rest of the $X$ axis is colored white.
Please note that colors at the endpoints of the intervals don't matter when computing the lengths, and we can ignore them. Open and closed intervals have been used in the explanation section only for clarity, and it doesn't matter whether they are open or closed.
Note that 011 is also a valid output. | ["for _ in range(int(input())):\n n = int(input())\n ls = []\n rs = []\n lrs = []\n\n for i in range(n):\n l, r = map(int, input().split())\n ls.append(l)\n rs.append(r)\n lrs.append((l, r, i))\n\n lrs.sort()\n\n c = 0\n maxi = -1\n\n res = [-1] * n\n for l, r, i in lrs:\n if ls[i] > maxi:\n maxi = rs[i]\n res[i] = c\n\n elif rs[i] <= maxi:\n res[i] = 1^c\n\n else:\n maxi = rs[i]\n c ^= 1\n res[i] = c\n\n print(*res, sep='')", "for _ in range(int(input())):\n n = int(input())\n ls = []\n rs = []\n lrs = []\n\n for i in range(n):\n l, r = map(int, input().split())\n ls.append(l)\n rs.append(r)\n lrs.append((l, r, i))\n\n lrs.sort()\n\n c = 0\n maxi = -1\n\n res = [-1] * n\n for l, r, i in lrs:\n if ls[i] >= maxi:\n maxi = rs[i]\n res[i] = c\n\n elif rs[i] <= maxi:\n res[i] = 1^c\n\n else:\n maxi = rs[i]\n c ^= 1\n res[i] = c\n\n print(*res, sep='')", "# cook your dish here\ndef f (arr: list):\n arr.sort()\n # print(arr)\n pl, pr, pc = float('-inf'), float('-inf'), 0\n col = [0 for x in range(len(arr))]\n for i in arr:\n nl, nr = i[0], i[1]\n if nl > pr:\n i.append(0)\n pl, pr, pc = nl, nr, 0\n else:\n nc = 0 if pc == 1 else 1\n i.append(nc)\n pc = nc if nr > pr else pc\n pr = max(pr, nr)\n col[i[2]] = str(i[3])\n return \"\".join(col)\n\nT = int(input())\nfor t in range(T):\n n = int(input())\n arr = []\n for i in range(n):\n l, r = [int(x) for x in input().split()]\n arr.append([l,r,i])\n print(f(arr))", "# cook your dish here\ndef f (arr: list):\n arr.sort()\n # print(arr)\n pl, pr, pc = float('-inf'), float('-inf'), 0\n col = [0 for x in range(len(arr))]\n for i in arr:\n nl, nr = i[0], i[1]\n if nl > pr:\n i.append(0)\n pl, pr, pc = nl, nr, 0\n else:\n nc = 0 if pc == 1 else 1\n i.append(nc)\n pc = nc if nr > pr else pc\n pr = max(pr, nr)\n col[i[2]] = str(i[3])\n return \"\".join(col)\n\nT = int(input())\nfor t in range(T):\n n = int(input())\n arr = []\n for i in range(n):\n l, r = [int(x) for x in input().split()]\n arr.append([l,r,i])\n print(f(arr))\n \n \n \n \n \n \n \n \n \n \n \n"] | {"inputs": [["1", "3", "3 7", "2 5", "6 9"]], "outputs": [["100"]]} | INTERVIEW | PYTHON3 | CODECHEF | 2,102 | |
655d103d4efc50a04abe4f07e6270592 | UNKNOWN | Doubleville, a small town in Texas, was attacked by the aliens. They have abducted some of the residents and taken them to the a spaceship orbiting around earth. After some (quite unpleasant) human experiments, the aliens cloned the victims, and released multiple copies of them back in Doubleville. So now it might happen that there are 6 identical person named Hugh F. Bumblebee: the original person and its 5 copies. The Federal Bureau of Unauthorized Cloning (FBUC) charged you with the task of determining how many copies were made from each person. To help you in your task, FBUC have collected a DNA sample from each person. All copies of the same person have the same DNA sequence, and different people have different sequences (we know that there are no identical twins in the town, this is not an issue).
-----Input-----
The input contains several blocks of test cases. Each case begins with a line containing two integers: the number 1 <= n <= 20000 people, and the length 1 <= m <= 20 of the DNA sequences. The next n lines contain the DNA sequences: each line contains a sequence of m characters, where each character is either 'A', 'C', 'G' or 'T'.
The input is terminated by a block with n = m = 0 .
-----Output-----
For each test case, you have to output n lines, each line containing a single integer. The first line contains the number of different people that were not copied. The second line contains the number of people that were copied only once (i.e., there are two identical copies for each such person.) The third line contains the number of people that are present in three identical copies, and so on: the i -th line contains the number of persons that are present in i identical copies. For example, if there are 11 samples, one of them is from John Smith, and all the others are from copies of Joe Foobar, then you have to print '1' in the first and the tenth lines, and '0' in all the other lines.
-----Example-----
Input:
9 6
AAAAAA
ACACAC
GTTTTG
ACACAC
GTTTTG
ACACAC
ACACAC
TCCCCC
TCCCCC
0 0
Output:
1
2
0
1
0
0
0
0
0 | ["def main():\n while True:\n [n, m] = [int(i) for i in input().split()]\n if n == m and n == 0:\n break\n cache = {}\n for i in range(n):\n dna = input().rstrip('\\n')\n if dna in cache:\n cache[dna] = 1 + cache[dna]\n else:\n cache[dna] = 1\n c = [0 for i in range(n + 1)]\n for dna in cache:\n c[cache[dna]] = 1 + c[cache[dna]]\n for i in range(1, n + 1):\n print(c[i])\n \ndef __starting_point():\n main()\n__starting_point()"] | {"inputs": [["9 6", "AAAAAA", "ACACAC", "GTTTTG", "ACACAC", "GTTTTG", "ACACAC", "ACACAC", "TCCCCC", "TCCCCC", "0 0", "", ""]], "outputs": [["1", "2", "0", "1", "0", "0", "0", "0", "0"]]} | INTERVIEW | PYTHON3 | CODECHEF | 750 | |
58c2132a315889e6fc4cd9d3d80a87b3 | UNKNOWN | Chef likes problems which using some math. Now he asks you to solve next one. You have 4 integers, Chef wondering is there non-empty subset which has sum equals 0.
-----Input-----
The first line of input contains T - number of test cases.
Each of the next T lines containing four pairwise distinct integer numbers - a, b, c, d.
-----Output-----
For each test case output "Yes", if possible to get 0 by choosing non-empty subset of {a, b, c, d} with sum equal 0, or "No" in another case.
-----Constraints-----
- 1 ≤ T ≤ 103
- -106 ≤ a, b, c, d ≤ 106
-----Example-----
Input:
3
1 2 0 3
1 2 4 -1
1 2 3 4
Output:
Yes
Yes
No
-----Explanation-----
Example case 1. We can choose subset {0}
Example case 2. We can choose subset {-1, 1} | ["# cook your dish here\n\n# cook your dish here\n\n \n\nt = int(input())\nwhile t:\n t-=1\n c=0\n ar=[int(i) for i in input().strip().split()]\n for i in range(1,16):\n b=bin(i)[2:].zfill(4)\n s=0\n for i in range(4):\n if b[i]=='1':\n s+=ar[i]\n \n if(s==0):\n c=1\n break\n \n print(\"Yes\" if c==1 else \"No\")\n", "def subset(n,s,l):\n t=1<<n\n for i in range(1,t):\n temp=0\n for j in range(n):\n if i&(1<<j):\n temp+=l[j]\n if temp==s:\n return True\n return False\nfor _ in range(int(input())):\n l=list(map(int,input().split()))\n #l.sort()\n print(\"Yes\" if subset(len(l),0,l) else \"No\")", "def subset(n,s,l):\n for i in range(1,2**n):\n temp=0\n for j in range(n):\n if i&(1<<j):\n temp+=l[j]\n if temp==s:\n return True\n return False\nfor _ in range(int(input())):\n l=list(map(int,input().split()))\n #l.sort()\n print(\"Yes\" if subset(len(l),0,l) else \"No\")", "# cook your dish here\nfor _ in range(int(input())):\n arr= list(map(int,input().strip().split()))\n flag=1\n for p in range(1,16):\n sum=0\n for i in range(0,4):\n f=1<<i\n if (p&f)!=0:\n sum+=arr[i]\n if sum==0:\n flag=0\n print(\"Yes\")\n if flag==1:\n print(\"No\")\n", "# cook your dish here\ndef ss(a,su,i,cnt):\n if su==0 and cnt!=0:\n return 1\n if i<0:\n return 0\n return ss(a,su+a[i],i-1,cnt+1)+ss(a,su,i-1,cnt)\nfor _ in range(int(input())):\n a=[int(x) for x in input().split()]\n if ss(a,0,3,0):\n print(\"Yes\")\n else:\n print(\"No\")", "# cook your dish here\nfrom collections import defaultdict as dd\nfrom collections import deque\nimport bisect\nimport heapq\nimport sys \ninput=sys.stdin.readline\n \ndef ri():\n return int(input())\n \ndef rl():\n return list(map(int, input().split()))\n \n \n\nt =ri()\nfor _ in range(t):\n aa = rl()\n n = len(aa)\n answer = \"No\"\n for mask in range(1, 2**n):\n sum = 0\n for k in range(n):\n if mask & (1 << k):\n sum += aa[k]\n if sum == 0:\n answer = \"Yes\"\n break\n print(answer)", "for _ in range(int(input())):\n a=list(map(int,input().split()))\n c=0\n for i in range(1,16):\n s=0\n for j in range(4):\n if i & (1<<j): \n s+=a[j]\n if s==0:\n c=1\n print(\"Yes\")\n break\n if c==0:\n print(\"No\")", "# cook your dish here\nfor h in range(int(input())):\n a,b,c,d=map(int,input().split())\n if a+b+c+d==0 or a+b+c==0 or a+b==0 or a==0:\n print('Yes')\n elif b==0 or c==0 or d==0 or a+c==0 or a+d==0 or a+b+d==0:\n print('Yes')\n elif a+c+d==0 or b+c+d==0 or b+c==0 or b+d==0 or c+d==0:\n print('Yes')\n else:\n print('No')", "# cook your dish here\nt=int(input())\nfor _ in range(t):\n a,b,c,d=list(map(int,input().split()))\n if a+b+c+d==0:\n print('Yes')\n elif a+b+c==0 or a+b+d==0 or b+c+d==0 or a+c+d==0:\n print('Yes')\n elif a+b==0 or a+c==0 or a+d==0 or b+c==0 or b+d==0 or c+d==0:\n print('Yes')\n elif a==0 or b==0 or c==0 or d==0:\n print('Yes')\n else:\n print('No')\n \n", "for i in range(int(input())):\n a,b,c,d= list(map(int,input().split()))\n if a==0 or b==0 or c==0 or d==0:\n print('Yes')\n elif a+b+c+d==0:\n print('Yes')\n elif a+b+c==0 or a+b+d==0 or a+c+d==0 or b+c+d==0:\n print('Yes')\n elif a+b==0 or b+c==0 or c+d==0 or a+c==0 or a+d==0 or b+d==0:\n print('Yes')\n else:\n print('No')\n \n\n", "t = int(input())\nfor _ in range(t):\n ar = list(map(int, input().split()))\n ok = False\n for i in range(1, 16):\n csum = 0\n for j in range(len(ar)):\n if (i & (1 << j)) > 0:\n csum += ar[j]\n if csum == 0:\n ok = True\n break\n if ok:\n print(\"Yes\")\n else:\n print(\"No\")", "# cook your dish here\nfor _ in range(int(input())):\n a,b,c,d=list(map(int,input().split()))\n flag=0\n if a==0 or b==0 or c==0 or d==0:\n print('Yes')\n flag=1 \n l=[a,b,c,d]\n if flag==0:\n for i in range(len(l)):\n for j in range(i+1,len(l)):\n if l[i]+l[j]==0:\n print('Yes')\n flag=1\n break \n if flag==0:\n if a+c+d==0 or b+c+d==0 or a+b+c==0 or a+b+d==0:\n flag=1 \n print('Yes')\n if flag==0:\n if a+b+c+d==0:\n print('Yes')\n flag=1 \n if flag==0:\n print('No')\n \n", "# cook your dish here\nt = int(input())\nfor _ in range(t):\n ar = list(map(int, input().split()))\n ok = False\n for i in range(1, 16):\n csum = 0\n for j in range(len(ar)):\n if (i & (1 << j)) > 0:\n csum += ar[j]\n if csum == 0:\n ok = True\n break\n if ok:\n print(\"Yes\")\n else:\n print(\"No\")", "for _ in range(int(input())):\n a,b,c,d= [int(x) for x in input().split()]\n ls =[a,b,c,d]\n f =0\n for i in range(2**4):\n s =0\n arr =[]\n for j in range(4):\n if i & (1<<j) > 0:\n s+=ls[j]\n arr.append(ls[j])\n if s==0 and len(arr)>0:\n print(\"Yes\")\n f=1\n break\n if f ==0:\n print(\"No\")", "# cook your dish here\nt=int(input())\nfor _ in range(t):\n l=list(map(int,input().split(\" \")))\n flag=False\n tot=1<<len(l)\n for i in range(tot):\n sum=0\n c=0\n for j in range(len(l)):\n k=1<<j\n if(i&k!=0):\n sum=sum+l[j]\n c=c+1\n if(sum==0 and c!=0):\n print(\"Yes\")\n flag=True\n break\n if(flag==False):\n print(\"No\")\n", "# cook your dish here\nfor _ in range(int(input())):\n a=list(map(int, input().split()))\n n=4\n test=0\n for mask in range(1,1<<n):\n s=set()\n for i in range(n):\n f=1<<i\n if mask & f!=0:\n s.add(a[i])\n if sum(s)==0:\n test=1\n break\n if test:\n print('Yes')\n else:\n print('No')", "# cook your dish here\nfor _ in range(int(input())):\n a = [int(x) for x in input().split()]\n n = 4\n tot = 1<<n\n flag = False\n for mask in range(tot):\n s =[]\n for i in range(n):\n f = 1<<i \n if mask&f!=0:\n s.append(a[i])\n if len(s)!=0 and sum(s)==0:\n flag = True\n break\n if flag:print('Yes')\n else:print('No')", "# cook your dish here\nfor _ in range(int(input())):\n a=list(map(int, input().split()))\n test=0\n n=4\n for mask in range(1,1<<n):\n s=0\n\n for i in range(n):\n if mask & 1<<i:\n s+=a[i]\n if s==0:\n test=1\n print('Yes')\n break\n if not test:\n print('No')\n\n \n \n", "# cook your dish here\nt = int(input())\n\nPOW = 1 << 4\nfor _ in range(t):\n nums = list(map(int,input().split(' ')))\n f = 1\n for k in range(POW):\n s = -1\n for i,j in enumerate(nums):\n f = 1 << i\n if f & k != 0:\n if s == -1:\n s = 0\n s += j\n # print('')\n if s == 0:\n f = 0\n break\n print(['No','Yes'][f == 0])\n\n", "from itertools import combinations\nfor _ in range(int(input())):\n l=list(map(int,input().split()))\n c=0\n for i in range(1,5):\n if c:\n break\n a=list(combinations(l,i))\n for j in a:\n if sum(j)==0:\n c=1\n break\n if c:\n print('Yes')\n else:\n print('No')", "# cook your dish here\nt=int(input())\nwhile(t):\n a=[int(x) for x in input().split()]\n tot=1<<4\n flag=0\n for i in range(1,tot):\n sum=0\n for j in range(4):\n f=1<<j\n if(f&i):\n sum+=a[j]\n if(sum==0):\n flag=1\n break\n print( 'Yes' if sum==0 else 'No') \n t-=1", "# cook your dish here\nfrom itertools import permutations\n\ndef check_0(arr):\n if sum(arr)==0: return 'Yes'\n arr_len=len(arr)\n for perm in permutations(arr):\n for j in range(1,arr_len):\n if sum(perm[:j])==0: return 'Yes'\n return 'No'\n\nfor i in range(int(input())):\n arr=[int(x) for x in input().split()]\n print(check_0(arr))", "# cook your dish here\nt=int(input())\nfor x in range(t):\n m=0\n \n l=[int(i) for i in input().split()]\n for i in range(0,1<<4):\n ans=0\n for j in range(0,4):\n f=1<<j\n if i&f!=0:\n ans=ans+l[j]\n if ans==0:\n m=1\n print(\"Yes\")\n break\n if m==1:\n break\n else:\n print(\"No\")\n \n"] | {"inputs": [["3", "1 2 0 3", "1 2 4 -1", "1 2 3 4"]], "outputs": [["Yes", "Yes", "No"]]} | INTERVIEW | PYTHON3 | CODECHEF | 7,591 | |
62a202535ca0711210c52558f8dd2879 | UNKNOWN | Corruption is on the rise in the country of Freedonia, Gru's home. Gru wants to end this for good and for that he needs the help of his beloved minions.
This corruption network can be represented in the form of a tree having N$N$ nodes and N−1$N-1$ edges. The nodes are numbered from 1$1$ to N$N$, and the tree is rooted at node 1$1$. These nodes represent the corrupt officials and each corrupt official works under some other corrupt official except the Boss who is represented by node 1$1$.
Gru believes in divide and conquer and thinks that this network needs to be divided into as many sub-networks as possible.
He commands the minions to kill some of the corrupt officials in order to break the network into maximum sub-networks. But as you know, these corrupt officials are very sharp, and hence these assassinations need to be done very smartly and silently, without leaving any traces. To achieve this Gru devises a strategy, in which he designs an operation, and that operation can be applied by the minions any number of times (even 0).
In one operation the minions can select any one leaf node official [that is an official who does not have any other official beneath him] in the graph and kill him along with all his ancestors$ancestors$ officials till the root$root$ of the tree in which the operation is applied (this is done to wipe all traces of the operation). This deleted all those nodes from the graph, and also, while doing so, all the associated edges/connections$edges/connections$ of the leaf node and its ancestors are also destroyed. Hence after applying this operation on any tree, it breaks into some connected components which are also trees, which are the new sub-networks.
Now the minions are a bit lazy and will do the task someday, but they need to submit a report to Gru containing the number of the maximum$maximum$ connected$connected$ components$components$ that they could achieve by applying the operation any number of times. To do this, the minions require your help. So help the minions by finding out the maximum$maximum$ no.$no.$ of$of$ connected$connected$ components$components$ that can be achieved.
Note: After each operation, the topmost node (node with the lowest level. It can be proved that there will always be a unique node with the lowest level in each tree) of each of the remaining trees becomes the root of that particular tree (that is, after the first operation it can be visualized that the graph converts into a forest of rooted trees)
-----Input:-----
- First line will contain N$N$, number of nodes in the tree.
- Next N−1$N-1$ lines contains 2 integers U$U$, V$V$ denoting the endpoints of the ith$i^{th}$ edge.
-----Output:-----
- Print the maximum number of connected components you can obtain after doing the operation any number of times.
-----Constraints-----
- 1≤N≤106$1 \leq N \leq 10^6$
- 1≤U,V≤N$1 \leq U,V \leq N$
-----Sample Input:-----
7
1 2
1 3
2 4
2 5
3 6
3 7
-----Sample Output:-----
2
-----EXPLANATION:-----
We have 4 leaf nodes in this tree: 4 5 6 7. Suppose we delete node 5, then along with it we also delete node 2 and node 1. so after the deletion we are left with 2 trees, one consisting of only node 4 as the root node of that particular tree, and the other consisting of node 3,6,7 with node 3 as the root node. This can also be achieved by deleting any of the other leaf nodes and it can be proved that we cannot obtain more than 2 connected components in this example. | ["from sys import stdin,stdout\r\ninput=stdin.readline\r\nn=int(input())\r\na=[[] for i in range(n)]\r\nfor i in range(n-1):\r\n u,v=map(int,input().split())\r\n a[u-1].append(v-1)\r\n a[v-1].append(u-1)\r\nb=[0]*n\r\nvis=[0]*n\r\nst=[(0,0)]\r\nvis[0]=1\r\npa=[0]*n\r\nwhile st:\r\n x,y=st.pop()\r\n b[x]=y\r\n for i in a[x]:\r\n if vis[i]==0:\r\n pa[i]=x\r\n vis[i]=1\r\n if x==0:\r\n st.append((i,y+len(a[x])-1))\r\n else:\r\n st.append((i,y+len(a[x])-2))\r\nc=[]\r\nfor i in range(1,n):\r\n if len(a[i])==1:\r\n c.append((b[i],i))\r\nc.sort()\r\nans=0\r\nwhile c:\r\n x,y=c.pop()\r\n m=y\r\n p=0\r\n while y!=0 and pa[y]!=-1:\r\n y=pa[y]\r\n if pa[y]==-1:\r\n break\r\n if y!=0:\r\n p+=(len(a[y])-2)\r\n else:\r\n p+=(len(a[y])-1)\r\n if p>=1:\r\n p=0\r\n while m!=0 and pa[m]!=-1:\r\n x=m\r\n if pa[m]==-1:\r\n break\r\n m=pa[m]\r\n pa[x]=-1\r\n if m!=0:\r\n p+=(len(a[m])-2)\r\n else:\r\n p+=(len(a[m])-1)\r\n if y==0:\r\n pa[0]=-1\r\nfor i in range(n):\r\n if pa[i]!=-1:\r\n st=[i]\r\n pa[i]=-1\r\n while st:\r\n x=st.pop()\r\n for j in a[x]:\r\n if pa[j]!=-1:\r\n pa[j]=-1\r\n st.append(j)\r\n ans+=1\r\nprint(ans)", "from sys import stdin,stdout\r\ninput=stdin.readline\r\nn=int(input())\r\na=[[] for i in range(n)]\r\nfor i in range(n-1):\r\n u,v=map(int,input().split())\r\n a[u-1].append(v-1)\r\n a[v-1].append(u-1)\r\nb=[0]*n\r\nvis=[0]*n\r\nst=[(0,0)]\r\nvis[0]=1\r\npa=[0]*n\r\nwhile st:\r\n x,y=st.pop()\r\n b[x]=y\r\n for i in a[x]:\r\n if vis[i]==0:\r\n pa[i]=x\r\n vis[i]=1\r\n if x==0:\r\n st.append((i,y+len(a[x])-1))\r\n else:\r\n st.append((i,y+len(a[x])-2))\r\nc=[]\r\nfor i in range(1,n):\r\n if len(a[i])==1:\r\n c.append((b[i],i))\r\nc.sort()\r\nans=0\r\nwhile c:\r\n x,y=c.pop()\r\n m=y\r\n p=0\r\n while y!=0 and pa[y]!=-1:\r\n y=pa[y]\r\n if pa[y]==-1:\r\n break\r\n if y!=0:\r\n p+=(len(a[y])-2)\r\n else:\r\n p+=(len(a[y])-1)\r\n if p>=1:\r\n p=0\r\n while m!=0 and pa[m]!=-1:\r\n x=m\r\n if pa[m]==-1:\r\n break\r\n m=pa[m]\r\n pa[x]=-1\r\n if m!=0:\r\n p+=(len(a[m])-2)\r\n else:\r\n p+=(len(a[m])-1)\r\n if y==0:\r\n pa[0]=-1\r\nfor i in range(n):\r\n if pa[i]!=-1:\r\n st=[i]\r\n pa[i]=-1\r\n while st:\r\n x=st.pop()\r\n for j in a[x]:\r\n if pa[j]!=-1:\r\n pa[j]=-1\r\n st.append(j)\r\n ans+=1\r\nprint(ans)", "from sys import stdin,stdout\r\ninput=stdin.readline\r\nn=int(input())\r\na=[[] for i in range(n)]\r\nfor i in range(n-1):\r\n u,v=map(int,input().split())\r\n a[u-1].append(v-1)\r\n a[v-1].append(u-1)\r\nb=[0]*n\r\nvis=[0]*n\r\nst=[(0,0)]\r\nvis[0]=1\r\npa=[0]*n\r\nwhile st:\r\n x,y=st.pop()\r\n b[x]=y\r\n for i in a[x]:\r\n if vis[i]==0:\r\n pa[i]=x\r\n vis[i]=1\r\n if x==0:\r\n st.append((i,y+len(a[x])-1))\r\n else:\r\n st.append((i,y+len(a[x])-2))\r\nc=[]\r\nfor i in range(1,n):\r\n if len(a[i])==1:\r\n c.append((b[i],i))\r\nc.sort()\r\nans=0\r\nwhile c:\r\n x,y=c.pop()\r\n m=y\r\n p=0\r\n while y!=0 and pa[y]!=-1:\r\n y=pa[y]\r\n if pa[y]==-1:\r\n break\r\n if y!=0:\r\n p+=(len(a[y])-2)\r\n else:\r\n p+=(len(a[y])-1)\r\n if p>=1:\r\n p=0\r\n while m!=0 and pa[m]!=-1:\r\n x=m\r\n if pa[m]==-1:\r\n break\r\n m=pa[m]\r\n pa[x]=-1\r\n if m!=0:\r\n p+=(len(a[m])-2)\r\n else:\r\n p+=(len(a[m])-1)\r\n if y==0:\r\n pa[0]=-1\r\nfor i in range(n):\r\n if pa[i]!=-1:\r\n st=[i]\r\n pa[i]=-1\r\n while st:\r\n x=st.pop()\r\n for j in a[x]:\r\n if pa[j]!=-1:\r\n pa[j]=-1\r\n st.append(j)\r\n ans+=1\r\nprint(ans)", "from sys import stdin,stdout\r\ninput=stdin.readline\r\nn=int(input())\r\na=[[] for i in range(n)]\r\nfor i in range(n-1):\r\n u,v=map(int,input().split())\r\n a[u-1].append(v-1)\r\n a[v-1].append(u-1)\r\nb=[0]*n\r\nvis=[0]*n\r\nst=[(0,0)]\r\nvis[0]=1\r\npa=[0]*n\r\nwhile st:\r\n x,y=st.pop()\r\n b[x]=y\r\n for i in a[x]:\r\n if vis[i]==0:\r\n pa[i]=x\r\n vis[i]=1\r\n if x==0:\r\n st.append((i,y+len(a[x])-1))\r\n else:\r\n st.append((i,y+len(a[x])-2))\r\nc=[]\r\nfor i in range(1,n):\r\n if len(a[i])==1:\r\n c.append((b[i],i))\r\nc.sort()\r\nans=0\r\nwhile c:\r\n x,y=c.pop()\r\n m=y\r\n p=0\r\n while y!=0 and pa[y]!=-1:\r\n y=pa[y]\r\n if pa[y]==-1:\r\n break\r\n if y!=0:\r\n p+=(len(a[y])-2)\r\n else:\r\n p+=(len(a[y])-1)\r\n if p>=1:\r\n p=0\r\n while m!=0 and pa[m]!=-1:\r\n x=m\r\n if pa[m]==-1:\r\n break\r\n m=pa[m]\r\n pa[x]=-1\r\n if m!=0:\r\n p+=(len(a[m])-2)\r\n else:\r\n p+=(len(a[m])-1)\r\n if y==0:\r\n pa[0]=-1\r\nfor i in range(n):\r\n if pa[i]!=-1:\r\n st=[i]\r\n pa[i]=-1\r\n while st:\r\n x=st.pop()\r\n for j in a[x]:\r\n if pa[j]!=-1:\r\n pa[j]=-1\r\n st.append(j)\r\n ans+=1\r\nprint(ans)", "from sys import stdin,stdout\r\ninput=stdin.readline\r\nn=int(input())\r\na=[[] for i in range(n)]\r\nfor i in range(n-1):\r\n u,v=map(int,input().split())\r\n a[u-1].append(v-1)\r\n a[v-1].append(u-1)\r\nb=[0]*n\r\nvis=[0]*n\r\nst=[(0,0)]\r\nvis[0]=1\r\npa=[0]*n\r\nwhile st:\r\n x,y=st.pop()\r\n b[x]=y\r\n for i in a[x]:\r\n if vis[i]==0:\r\n pa[i]=x\r\n vis[i]=1\r\n if x==0:\r\n st.append((i,y+len(a[x])-1))\r\n else:\r\n st.append((i,y+len(a[x])-2))\r\nc=[]\r\nfor i in range(1,n):\r\n if len(a[i])==1:\r\n c.append((b[i],i))\r\nc.sort()\r\nans=0\r\nwhile c:\r\n x,y=c.pop()\r\n m=y\r\n p=0\r\n while y!=0 and pa[y]!=-1:\r\n y=pa[y]\r\n if pa[y]==-1:\r\n break\r\n if y!=0:\r\n p+=(len(a[y])-2)\r\n else:\r\n p+=(len(a[y])-1)\r\n if p>=1:\r\n p=0\r\n while m!=0 and pa[m]!=-1:\r\n x=m\r\n if pa[m]==-1:\r\n break\r\n m=pa[m]\r\n pa[x]=-1\r\n if m!=0:\r\n p+=(len(a[m])-2)\r\n else:\r\n p+=(len(a[m])-1)\r\n if y==0:\r\n pa[0]=-1\r\nfor i in range(n):\r\n if pa[i]!=-1:\r\n st=[i]\r\n pa[i]=-1\r\n while st:\r\n x=st.pop()\r\n for j in a[x]:\r\n if pa[j]!=-1:\r\n pa[j]=-1\r\n st.append(j)\r\n ans+=1\r\nprint(ans)"] | {"inputs": [["7", "1 2", "1 3", "2 4", "2 5", "3 6", "3 7"]], "outputs": [["2"]]} | INTERVIEW | PYTHON3 | CODECHEF | 7,785 | |
805c01765752cf8cc16807417a0bb5ed | UNKNOWN | Our Chef is doing what he is best at, COOKING A BARBECUE for his guests. He has invited all of us, and taking the help of his apprentice to smoke the barbecues. The chef has got BBQ sticks, each can take N fillings, and he presents N distinctly filled sticks in front his guests forming a N*N matrix
But here is the problem, he has got only two type of fillings, meat and capsicum, but still wants the N sticks to look "presentable", he is very particular about it. As a solution he fills the main diagonal of the N*N matrix with the same type of filling (either meat or capsicum) forming a "presentable" set
The Chef's apprentice is a fool, so the Chef asks him to cook M distinctly filled sticks ,so that the Chef is sure that among M there exist N sticks forming a "presentable" set. Your job is to determine smallest possible value of M.
-----Input-----
T, the number of test cases, followed by T lines.
Each line containing the positive integer N >= 4
-----Output-----
T lines of output, each line contain the positive integer M
-----Example-----
Input:
1
4
Output:
5 | ["testcase = int(input())\nfor case in range(testcase):\n n = int(input())\n print(2**(n-2)+1)\n print('\\n') ", "# Author: Karlheinz Jung\n# Compiler: Python @ ideone.com\n# Computer: Rabbit 286\n# Contest: ALGOTHIKA 2012\n# Problem: Barbeque sticks (ALGBBQ)\n\nN=eval(input())\nfor t in range(N):\n print(2**(eval(input())-2)+1)\n", "#!/bin/python\ntc=int(input())\nwhile tc:\n tc-=1\n n=int(input())\n ans=2**(n-2)\n ans+=1\n print(ans)", "import sys\n\nt = int(sys.stdin.readline())\nfor _ in range(t):\n n = int(sys.stdin.readline())\n print((1<<(n-2))+1)", "#!/usr/bin/python\nt = int(input())\nwhile t :\n n= int(input())\n k =(2**(n-2))+1\n print(k)\n t = t-1 ", "#!/usr/bin/python\nt = int(input())\nwhile t :\n n= int(input())\n k =(2**(n-2))+1\n print(k)\n t = t-1 ", "import math\nn=int(input())\nwhile(n>0):\n a=int(input())\n print(1+pow(2,a-2))\n n=n-1", "import math\nn=int(input())\nwhile(n>0):\n a=int(input())\n print(1+pow(2,a-2))\n n=n-1", "import math\nn=int(input())\nwhile(n>0):\n a=int(input())\n print(1+pow(2,a-2))\n n=n-1\n", "T=eval(input())\nfor t in range(T):\n N=eval(input())\n print(pow(2, N-2)+1)\n", "import sys\n\n\nT=int(sys.stdin.readline().strip())\nwhile T > 0:\n n=int(sys.stdin.readline().strip())\n m = 2**(n-2) + 1\n print(m)\n T=T-1;\n", "n=int(input(''))\nwhile n :\n k=int(input(''))\n k=k-2\n fact=2**k\n fact=fact+1\n n=n-1\n print(fact)", "'''\nBBG Sticks (Set II)\nCreated on Mar 10, 2012\n@author: Andy Huang\n'''\nt = eval(input())\nwhile t:\n t -= 1\n n = eval(input())\n n -= 2\n print(2 ** n + 1)", "t = eval(input())\nfor i in range( 1 , t + 1 ) :\n n = eval(input()) \n ans = pow(2,n-2) + 1\n print(ans)", "import math\nt = eval(input())\nfor i in range( 1 , t + 1 ) :\n n=eval(input())\n n=n-2\n result = pow(2,n) + 1\n print(result)", "t = eval(input())\nfor i in range( 1 , t + 1 ) :\n n = eval(input()) \n n = n - 2 \n ans = pow(2,n) + 1\n print(ans)", "def dfac ( n ) :\n ans = pow(2,n) + 1\n print(ans)\n \nt = eval(input())\nfor i in range( 1 , t + 1 ) :\n n = eval(input()) \n dfac ( n - 2 )"] | {"inputs": [["1", "4"]], "outputs": [["5"]]} | INTERVIEW | PYTHON3 | CODECHEF | 2,065 | |
8418b298f31cca3cd2e77f1fd75bdf63 | UNKNOWN | Let's consider a rectangular table R consisting of N rows and M columns. Rows are enumerated from 1 to N from top to bottom. Columns are enumerated from 1 to M from left to right. Each element of R is a non-negative integer. R is called steady if the sum of elements in the ith row is not less then the sum of elements in the (i-1)th row for each i where 2 ≤ i ≤ N and the sum of elements in the Nth row is less than or equal to M. Your task is to find the number of different steady tables of size N x M modulo 1 000 000 000.
-----Input-----
The first line of input contains a single integer T denoting number of test cases. First and the only line of each test case contains two space separated integers N and M denoting the number of rows and columns respectively.
-----Output-----
For each test case, print a single integer corresponding to the answer.
-----Constraints-----
- 1 ≤ T ≤ 10
- 1 ≤ N, M ≤ 2000
-----Subtasks-----
- Subtask 1 : 1 ≤ T ≤ 10 , 1 ≤ N,M ≤ 50 : ( 23 pts )
- Subtask 2 : 1 ≤ T ≤ 10 , 1 ≤ N,M ≤ 500 : ( 29 pts )
- Subtask 3 : 1 ≤ T ≤ 10 , 1 ≤ N,M ≤ 2000 : ( 48 pts )
-----Example-----
Input:
3
1 1
2 2
2 3
Output:
2
25
273
-----Explanation-----
Test case 1 : There are only 2 such grids possible 0 and 1. | ["# This is not my code, it's Snehasish Karmakar's. Refer to http://www.codechef\u00a0\u00a0\u00a0\u00a0.com/viewsolution/7153774\n# for original version.\n# Submitting it to try and work out if it can be sped up.\n\ndef compute_nCr(n,r) :\n C[0][0]=1\n for i in range(1,n+1) :\n# print \"i\",i\n C[i][0]=1\n for j in range(1,min(i,r)+1) :\n if i!=j :\n C[i][j]=(C[i-1][j-1]+C[i-1][j])%MOD\n else :\n C[i][j]=1\n \n \ndef solve(n,m) :\n store=[C[m+i-1][i] for i in range(m+1)]\n \n for i in range(1,n+1) :\n s=1\n for j in range(1,m+1) :\n s=(s+store[j])%MOD\n store[j]=(s*C[m+j-1][j])%MOD\n # print \"a[%d][%d]=%d\"%(i,j,s)\n \n return s \n \nMOD=1000000000\nLIMIT=2000\n \nC=[[0] * (LIMIT + 1) for _ in range(2*LIMIT+1)]\ncompute_nCr(2*LIMIT,LIMIT)\nt=int(input())\n \nwhile t :\n n,m=list(map(int,input().split()))\n print(solve(n,m))\n t-=1", "# This is not my code, it's Snehasish Karmakar's. Refer to http://www.codechef\u00a0\u00a0\u00a0\u00a0.com/viewsolution/7153774\n# for original version.\n# Submitting it to try and work out if it can be sped up.\n\ndef compute_nCr(n,r) :\n C[0][0]=1\n for i in range(1,n+1) :\n# print \"i\",i\n C[i][0]=1\n for j in range(1,min(i,r)+1) :\n if i!=j :\n C[i][j]=(C[i-1][j-1]+C[i-1][j])%MOD\n else :\n C[i][j]=1\n \n \ndef solve(n,m) :\n store=[C[m+i-1][i] for i in range(m+1)]\n \n for i in range(1,n+1) :\n s=1\n for j in range(1,m+1) :\n s=(s+store[j])%MOD\n store[j]=(s*C[m+j-1][j])%MOD\n # print \"a[%d][%d]=%d\"%(i,j,s)\n \n return s \n \nMOD=1000000000\nLIMIT=2000\n \nC=[[0 for x in range(LIMIT+1)] for y in range(2*LIMIT+1)]\ncompute_nCr(2*LIMIT,LIMIT)\nt=int(input())\n \nwhile t :\n n,m=list(map(int,input().split()))\n print(solve(n,m))\n t-=1", "import sys\n \nMOD = 1000000000\n \nT = int(sys.stdin.readline())\n \n \ndef gcd(a, b):\n return a if b == 0 else gcd(b, a % b)\n \n \ndef solve(n, r):\n if r > n - r:\n r = n - r\n \n num = 1\n den = 1\n j = 1\n for i in range(n - r + 1, n + 1):\n num *= i\n den *= j\n j += 1\n \n return (num / den) % MOD\n \nfor t in range(T):\n n, r = list(map(int, sys.stdin.readline().split()))\n t=r-1\n q=0\n li=[]\n for i in range(r+1):\n li.append(solve(t,q))\n t+=1\n q+=1\n arr=li[:]\n temp=0\n for i in range(1,n):\n summ=sum(arr)\n for j in range(r+1):\n if(j==0):\n summ+=0\n else:\n summ-=temp\n temp=arr[j]\n arr[j]=(li[j]*(summ%MOD))%MOD\n print(sum(arr)%MOD) "] | {"inputs": [["3", "1 1", "2 2", "2 3"]], "outputs": [["2", "25", "273"]]} | INTERVIEW | PYTHON3 | CODECHEF | 2,449 | |
b7cd22b3e4e187954b4d2f51abd89316 | UNKNOWN | Limak has a string S, that consists of N lowercase English letters.
Limak then created a new string by repeating S exactly K times.
For example, for S = "abcb" and K = 2, he would get "abcbabcb".
Your task is to count the number of subsequences "ab" (not necessarily consecutive) in the new string.
In other words, find the number pairs of indices i < j, such that the i-th and j-th characters in the new string are 'a' and 'b' respectively.
-----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 two integers N and K, denoting the length of the initial string S and the number of repetitions respectively.
The second line contains a string S.
Its length is exactly N, and each of its characters is a lowercase English letter.
-----Output-----
For each test case, output a single line containing one integer — the number of subsequences "ab" in the new string.
For the given constraints, it can be proved that the answer fits in the 64-bit signed type.
-----Constraints-----
- 1 ≤ T ≤ 10
- 1 ≤ N ≤ 105
- 1 ≤ N * K ≤ 109 (in other words, the new string has length up to 109)
-----Example-----
Input:
3
4 2
abcb
7 1
aayzbaa
12 80123123
abzbabzbazab
Output:
6
2
64197148392731290
-----Explanation-----
Test case 1. Limak repeated the string "abcb" 2 times, and so he got "abcbabcb". There are 6 occurrences of the subsequence "ab":
- ABcbabcb (the two letters marked uppercase)
- AbcBabcb
- AbcbaBcb
- AbcbabcB
- abcbABcb
- abcbAbcB
Test case 2. Since K = 1, the new string is equal to the given S ("aayzbaa"). There are 2 occurrences of the subsequence "ab" in this string: AayzBaa and aAyzBaa. | ["try:\r\n t=int(input())\r\n for i in range(t):\r\n n,k=map(int,input().split())\r\n s=input()\r\n l=[-1]*len(s)\r\n numb=s.count('b')\r\n x=numb\r\n for j in range(len(s)):\r\n if(s[j]=='a'):\r\n l[j]=numb\r\n if(s[j]=='b'):\r\n numb=numb-1\r\n #print(l)\r\n count1=0\r\n for j in range(len(l)):\r\n if(l[j]>0):\r\n count1=count1+(k*(2*l[j]+(k-1)*x))//2\r\n elif(l[j]==0):\r\n count1=count1+(k*(2*0+(k-1)*x))//2\r\n print(count1)\r\nexcept:\r\n pass\r\n", "# cook your dish here\n# cook your dish here\nfor u in range(int(input())):\n n,k=map(int,input().split())\n s=input()\n d=0\n c=0\n x=s.count('b')\n for i in range(n):\n if(s[i]=='b'):\n c+=1\n elif(s[i]=='a'):\n d+=(k*(k+1)//2)*x-(k*c)\n print(d)\n", "# cook your dish here\nfor u in range(int(input())):\n n,k=map(int,input().split())\n s=input()\n d=0\n c=0\n x=s.count('b')\n for i in range(n):\n if(s[i]=='b'):\n c+=1\n elif(s[i]=='a'):\n d+=(k*(k+1)//2)*x-(k*c)\n print(d)\n", "for _ in range(int(input())):\r\n n,k=map(int,input().split())\r\n s=[x for x in input().strip()]\r\n c1=s.count('a')\r\n c2=s.count('b')\r\n ans=0\r\n m=0\r\n for x in s:\r\n if x=='b':\r\n m+=1\r\n if x=='a':\r\n ans+=(((k*(k+1))//2)*c2)-(k*m)\r\n print(ans)", "# cook your dish here\nfor _ in range(int(input())):\n n,k=map(int,input().split())\n st=input()\n a=st.count('a')\n b=st.count('b')\n c=0 \n ca=0\n for i in range(n):\n if st[i]=='a':\n ca+=1\n if st[i]=='b':\n c+=ca\n \n print(a*b*(k*(k-1)//2)+c*k)", "\r\ntry:\r\n for _ in range(int(input())):\r\n n,k= map(int, input().split())\r\n string = input()\r\n cnta=cntb=ab=0\r\n for i in string:\r\n if i=='a':\r\n cnta+=1 \r\n elif i=='b':\r\n cntb+=1 \r\n ab+=cnta #for each b considers all a \r\n \r\n final=ab*k \r\n final+=k*(k-1)*cnta*cntb//2 \r\n \r\n print(final)\r\n \r\nexcept:\r\n pass\r\n", "#Coded By Ujjwal Bharti\ntulu = int(input())\nfor _ in range(tulu):\n n,k = [int(x) for x in input().split()]\n data = input()\n counterA =0\n counterB = 0\n indexListOfA =[]\n indexListOfB = []\n for i in range(n):\n if(data[i]=='a'):\n counterA += 1\n indexListOfA.append(i)\n if(data[i]=='b'):\n counterB+= 1\n indexListOfB.append(i)\n sumOfOneData = 0\n for j in indexListOfA:\n lenB = len(indexListOfB)\n if(lenB==0):\n break\n flag= False\n while len(indexListOfB)>0 and flag==False:\n if(j<indexListOfB[0]):\n sumOfOneData += len(indexListOfB)\n flag=True\n else:\n indexListOfB.pop(0)\n lulu = (k*(k-1))//2\n result = lulu*counterB*counterA + k*sumOfOneData\n print(result)", "#Coded By Ujjwal Bharti\ntulu = int(input())\nfor _ in range(tulu):\n n,k = [int(x) for x in input().split()]\n data = input()\n counterA =0\n counterB = 0\n sumOfOneData =0\n indexListOfB = []\n for i in range(n):\n if(data[i]=='a'):\n counterA += 1\n if(data[i]=='b'):\n counterB+= 1\n sumOfOneData += counterA\n lulu = (k*(k-1))//2\n result = (lulu*counterB*counterA) + (k*sumOfOneData)\n print(result)", "# import sys\r\n# sys.stdin=open('input.txt','r')\r\nfor _ in range(int(input())):\r\n n,k=map(int,input().split())\r\n s=input()\r\n t=0\r\n a,b=0,0\r\n for i in range(len(s)-1,-1,-1):\r\n if s[i]=='b':\r\n a+=1\r\n elif s[i]=='a':\r\n b+=a\r\n t=(s.count('a'))*(s.count('b'))*k*(k-1)//2\r\n print(b*k+t)", "T=int(input())\r\nfor _ in range(T):\r\n N, K = map(int, input().split())\r\n word=input()\r\n b_count=0\r\n a_count=0\r\n left_count=0\r\n right_count=0\r\n b_count=word.count(\"b\")\r\n curr_b=0\r\n for x in range(N):\r\n if word[x] == \"b\":\r\n curr_b+=1\r\n elif word[x] == \"a\":\r\n left_count+=curr_b\r\n right_count+=(b_count-curr_b)\r\n # print(x, left_count, right_count)\r\n res = K*(K+1)\r\n res = res//2\r\n res = res*(left_count+right_count)\r\n res-=K*left_count\r\n print(res)", "t=int(input())\nfor _1 in range(t):\n\tn, k=map(int, input().split())\n\ts=input().strip()\n\ta, b, ab=0, 0, 0\n\tfor x in range(len(s)):\n\t\tif s[x]=='a':a+=1\n\t\tif s[x]=='b':\n\t\t\tb+=1\n\t\t\tab+=a\n\tprint(ab*k+a*b*((k-1)*k)//2)\n", "t=int(input())\nfor _ in range(t):\n n,k=map(int,input().split())\n ans=0\n total=0\n b=0\n s=input()\n for i in range(n):\n if s[i]=='a':\n ans+=1\n if s[i]=='b':\n total+=ans\n b+=1\n x = b*ans\n sum = (2*total+(k-1)*x)\n sum=(sum*k)//2\n print(sum)\n", "# cook your dish here\nT = int(input())\nwhile T != 0:\n\tT = T-1\n\tN,K = map(int,input().split())\n\tS = input()\n\tS1 = S+S\n\tsub = 'ab'\n\tlookup = [[0]*(2*N+1) for _ in range(3)]\n\tfor i in range(0,(2*N+1)):\n\t\tlookup[0][i] = 1\n\t#print(lookup)\n\tfor i in range(1,(2*N+1)):\n\t\tfor j in range(1,3):\n\t\t\tif S1[i-1] == sub[j-1]:\n\t\t\t\tlookup[j][i] = lookup[j-1][i-1] + lookup[j][i-1]\n\t\t\telse:\n\t\t\t\tlookup[j][i] = lookup[j][i-1]\n\t#print(lookup)\n\tbase = lookup[2][N]\n\t#print('base='+str(base))\n\tinc = lookup[2][2*N] - 2*base\n\t#print('inc='+str(inc))\n\tans = K*base + ((K-1)*(K)*inc)//2\n\tprint(ans)\n\t", "# cook your dish here\nfor i in range(int(input())):\n n , k = map(int , input().split())\n s = input()\n ac = 0\n bc = 0 \n t = 0 \n for i in range (n):\n if (s[i]=='a'):\n ac+=1\n if(s[i]=='b'):\n bc+=1\n t+=ac\n r =k * t\n r+=k*(k-1)//2*ac*bc\n print(r)", "def get_ans(n, k, s):\r\n totalB = s.count('b')\r\n initialB = totalB * k\r\n\r\n ans = 0\r\n\r\n for i in s:\r\n if i == 'b':\r\n initialB -= 1\r\n elif i == 'a':\r\n APa = initialB\r\n APd = -totalB\r\n APn = k\r\n\r\n ans += APn * (2 * APa + (APn - 1) * APd) // 2\r\n return ans\r\n\r\nfor _ in range(int(input())):\r\n n, k = map(int, input().split())\r\n s = input()\r\n print(get_ans(n, k, s))\r\n", "t=int(input())\nfor x in range(t):\n n,k=input().split()\n n,k=int(n),int(k)\n str=input()\n i=0\n count1=0\n total=0\n i=0\n while(i<n):\n if(str[i]=='a'):\n count1=count1+1\n i=i+1 \n count2,count3=0,0\n i=0\n while(i<n):\n if(str[i]=='a'):\n count2=count2+1\n elif(str[i]=='b'):\n total=total+(k*count2+k*(k-1)*(count1)//2)\n i=i+1 \n print(total) ", "for i in range(int(input())):\r\n n,k=map(int,input().split())\r\n l=[str(i) for i in input()]\r\n ac=l.count('a')\r\n bc=l.count('b')\r\n u=0\r\n co=ac*bc*k*(k-1)//2\r\n for i in range(n):\r\n if(l[i]=='a'):\r\n u=u+bc\r\n elif(l[i]=='b'):\r\n bc=bc-1\r\n co=co+u*k\r\n print(co)", "t = int(input())\r\nfor i in range(t):\r\n n,k = map(int,input().split())\r\n s = input()\r\n na = s.count('a')\r\n nb = s.count('b')\r\n temp =nb\r\n #print(na,nb)\r\n summ = 0\r\n for i in range(len(s)):\r\n if(s[i]=='a'):\r\n summ += nb\r\n elif(s[i]=='b'):\r\n nb -=1\r\n else:\r\n pass\r\n #print(summ)\r\n ans = summ*k + ((k*(k-1))//2)*na*temp\r\n print(ans)\r\n", "# cook your dish here\ndef binarySearch (arr, l, r, x):\n\n\n if r >= l:\n\n mid = l + (r - l)//2\n\n\n if arr[mid] == x:\n return mid\n\n\n elif arr[mid] > x:\n return binarySearch(arr, l, mid-1, x)\n\n else:\n return binarySearch(arr, mid + 1, r, x)\n\n else:\n if l<len(arr):\n return l\n else:\n return -1\n\nt = int(input())\n\nfor _ in range(t):\n n,k = map(int,input().split())\n s = input()\n posn = []\n for i in range(len(s)):\n if s[i] == 'b':\n posn.append(i)\n # print(posn)\n tot = 0\n for i in range(n):\n if posn == []:\n break\n else:\n if s[i] == 'a':\n z = binarySearch(posn,0,len(posn)-1,i)\n\n if z!=-1 and posn[z]<len(s):\n\n # print(posn[z])\n if s[posn[z]] == 'b':\n z+=1\n tot+=len(posn)-z+1\n tot*=k\n k1 = s.count('a')\n k2 = s.count('b')\n # k1*=(k-1)\n tot+=((k1*k2)*(k-1)*k)//2\n print(tot)\n\n\n\n", "t=int(input())\r\nfor i in range(t):\r\n a=input()\r\n n,k=int(a.split()[0]),int(a.split()[1])\r\n s=input()\r\n l=list(s)\r\n ac=l.count('a')\r\n bc=l.count('b')\r\n u=0\r\n co=ac*bc*k*(k-1)//2\r\n for i in range(n):\r\n if(l[i]=='a'):\r\n u=u+bc\r\n elif(l[i]=='b'):\r\n bc=bc-1\r\n co=co+u*k\r\n print(co)", "from functools import reduce\r\nT=int(input())\r\nfor i in range(T):\r\n count=0\r\n a=0\r\n b=0\r\n Count=0\r\n N,K=map(int,input().split())\r\n S=str(input().lower())\r\n for j in S:\r\n if j=='a':\r\n a+=1\r\n elif j=='b':\r\n b+=1\r\n count+=a\r\n Count=(K*(K-1)*a*b)//2\r\n Count=Count+K*count\r\n print(Count)", "for _ in range(int(input())):\r\n n,k=map(int,input().split())\r\n s=input()\r\n if 'a' not in s:\r\n print(0)\r\n continue \r\n cnta=0 \r\n cntb=0 \r\n c=0 \r\n for i in s:\r\n if i=='a':\r\n cnta+=1 \r\n elif i=='b':\r\n cntb+=1 \r\n c+=cnta \r\n ans=c*k \r\n ans=ans+k*(k-1)//2*cnta*cntb\r\n print(ans)"] | {"inputs": [["3", "4 2", "abcb", "7 1", "aayzbaa", "12 80123123", "abzbabzbazab", "", ""]], "outputs": [["6", "2", "64197148392731290"]]} | INTERVIEW | PYTHON3 | CODECHEF | 10,353 | |
67a0f194555547d081b16b5ac2868fe4 | UNKNOWN | Chef lives in a big apartment in Chefland. The apartment charges maintenance fees that he is supposed to pay monthly on time. But Chef is a lazy person and sometimes misses the deadlines. The apartment charges 1000 Rs per month as maintenance fees. Also, they also charge a one-time fine of 100 Rs for each of the late payments. It does not matter how late the payment is done, the fine is fixed to be Rs.100.
Chef has been living in the apartment for N months. Now, he wants to switch the apartment, so he has to pay the entire dues to the apartment. The deadline for the N-th month is also over. From his bank statement, he finds the information whether he paid apartment rent for a particular month for not. You are given this information by an array A of size N, where Ai (can be either 0 or 1) specifies whether he has paid the 1000Rs in the i-th month or not. Assume that Chef paid the fees in the i-th month, then this fees will be considered for the earliest month for which Chef has not yet paid the fees.
For example, assume Chef did not pay any money in first month and 1000Rs in the second month. Then this rent of 1000Rs will be considered for 1st month. But this counts as late payment for the first month's fees, and hence he will have to pay Rs. 100 for that. And since the payment he made in the second month is not accounted for the second month, but rather for the first month, he will incur a fine of Rs.100 even for the second month.
He has not paid any of the fines so far. Can you please help in finding Chef total due (all the fines, plus all the unpaid maintenance fees) that he has to pay to apartment?
-----Input-----
First line of the input contains an integer T denoting number of test cases. The description of T test cases follows.
The first line of each test cases contains an integer N denoting the number of months for which you have to calculate the total amount of money that Chef has to pay at the end of the n month to clear all of his dues.
Next line of each test case contains N space separated integers (each of them can be either 0 or 1) denoting whether Chef paid the 1000Rs fees in the corresponding month or not. If the corresponding integer is 1, it means that Chef paid the maintenance fees for that month, whereas 0 will mean that Chef did not pay the maintenance fees that month.
-----Output-----
For each test case, output a single integer denoting the total amount including fine that Chef has to pay.
-----Constraints-----Constraints
- 1 ≤ T ≤ 25
- 0 ≤ Ai ≤ 1
-----Subtasks-----
Subtask #1 (30 points)
- 1 ≤ N ≤ 103
Subtask #2 (70 points)
- 1 ≤ N ≤ 105
-----Example-----
Input
4
2
1 1
2
0 0
3
0 1 0
2
0 1
Output
0
2200
2300
1200
-----Explanation-----
Example case 1. Chef paid maintenance fees for both the months. So, he does not have any dues left.
Example case 2. Chef did not pay the maintenance fees for any of the months. For the first month, he has to pay 1000Rs, and 100Rs fine as a late payment. For second month payments, he just have to pay 1100Rs. So, in total he has a due of 1100 + 1100 = 2200 Rs.
Example case 3. In the first month, Chef did not pay his maintenance fees. He paid the maintenance of first in the second month. So, he paid a fine of 100Rs for first month. For second and third month, Chef did not pay the maintenance fees. So, he has to pay 1000Rs + 100Rs (of fine) for second month and only 1000Rs + 100Rs (of fine) for third month. In total, Chef has got to pay 100 + 1100 + 1100 = 2300 Rs.
Example case 4. In the first month, Chef did not pay his maintenance fees. He paid the maintenance of first in the second month. So, he paid a fine of 100Rs for first month. For second month, Chef did not pay the maintenance fees. So, he has to pay 1000Rs + 100Rs (of fine) for second month. In total, Chef has got to pay 100 + 1100 = 1200 Rs. | ["for i in range(int(input())):\n a=int(input())\n b=input().split()\n if '0' in b:\n print(100*(a-b.index('0'))+b.count('0')*1000)\n else:\n print(0)\n", "for i in range(int(input())):\r\n x=int(input())\r\n y=input().split()\r\n if '0' in y:\r\n print(100*(x-y.index('0'))+y.count('0')*1000)\r\n else:\r\n print(0) ", "# cook your dish here\nfor t in range(int(input())):\n total=0\n n=int(input())\n a=list(map(int,input().split()))\n \n for i in range(0,n):\n \n if a[i]==0:\n total=total+1100\n else:\n if total>=1100:\n \n total=total-1000\n total=total+1100\n print(total)\n \n \n \n ", "for i in range(int(input())):\r\n x=int(input())\r\n y=input().split()\r\n if '0' in y:\r\n print(100*(x-y.index('0'))+y.count('0')*1000)\r\n else:\r\n print(0) \r\n\r\n", "for _ in range(int(input())):\n n=int(input())\n s=list(map(int,input().split()))\n total=0\n for i in range(0,n):\n if s[i]==0:\n total+=1100\n else:\n if total>=1100:\n total-=1000\n total+=1100\n print(total)", "# cook your dish here\nfor _ in range(int(input())):\n N=int(input())\n inp_arr=tuple(int(i) for i in input().strip().split())\n fine=0\n maxMaint=1000*N\n for i in range(N):\n if(inp_arr[i]==0):\n if(fine==0):\n fine=100*(N-i)\n else:\n maxMaint-=1000\n \n print(maxMaint+fine)\n \n", "T=int(input())\nfor i in range(T):\n N=int(input())\n A=[int(i) for i in input().split()]\n m=0\n for i in range(N):\n if A[i]==0:\n m=m+1000\n for i in range(N):\n if A[i]==0:\n k=len(A)-i\n break\n else:\n k=0\n n=m+k*100\n print(n)\n \n \n \n", "T=int(input())\nfor i in range(T):\n N=int(input())\n A=[int(i) for i in input().split()]\n m=0\n for i in range(N):\n if A[i]==0:\n m=m+1000\n for i in range(N):\n if A[i]==0:\n k=len(A)-i\n break\n else:\n k=0\n n=m+k*100\n print(n)\n \n \n \n", "for _ in range(int(input())):\n n=int(input())\n l=list(map(int,input().split()))\n c=0\n if l.count(1)==n:\n print(0)\n else: \n print(l.count(0)*1000+(n-l.index(0))*100)\n \n ", "for _ in range(int(input())):\n n=int(input())\n l=list(map(int,input().split()))\n c=0\n if l.count(1)==n:\n print(0)\n else: \n for i in range(n):\n if l[i]==0:\n c+=1000\n print(c+(n-l.index(0))*100)\n \n ", "for _ in range(int(input())):\n n=int(input())\n l=list(map(int,input().split()))\n c=0\n if l.count(1)==n:\n print(0)\n else: \n for i in range(n):\n if l[i]==0:\n c+=(n-i)*100\n break\n t=c+l.count(0)*1000 \n print(t)\n \n ", "for _ in range(int(input())):\n n = int(input())\n statement = list(map(int, input().split()))\n fine = 0\n for i, v in enumerate(statement):\n if v == 0:\n fine = (n-i)*100 \n break\n \n total = fine + 1000*statement.count(0)\n print(total)\n ", "# cook your dish here\ntry:\n for _ in range(int(input())):\n N = int(input())\n Log = input().split()\n if '0' in Log:\n print((100*(N-Log.index('0')))+Log.count('0')*1000)\n else:\n print(Log.count('0')*1000)\nexcept:\n pass", "# cook your dish here\nt=int(input())\nfor i in range(t):\n n=int(input())\n l1=list(map(int,input().split()))\n c=0\n flag=0\n for i in range(n):\n if(l1[i]==0):\n c+=1100\n flag=1\n elif(l1[i]==1):\n if(flag==1):\n c+=100\n print(c)", "# cook your dish here\nfor _ in range(int(input())):\n n = int(input())\n l = list(map(int,input().split()))\n c = 0\n flg = 0\n for i in range(n):\n if l[i]==0:\n c+=1100\n flg=1\n elif l[i]==1:\n if flg==1:\n c+=100\n print(c)", "# cook your dish here\nfor _ in range(int(input())):\n n = int(input())\n arr = input().split()\n i = 0\n while i != n and arr[i] != '0':\n i += 1\n sum = 0\n for j in range(i,n):\n if arr[j] == '0':\n sum += 1100\n else:\n sum += 100\n print(sum)\n\n", "for _ in range(int(input())):\n N = int(input())\n L = list(map(int, input().split()))\n \n late = False\n lN = 0\n for i in L:\n if i == 0: late = True\n if late: lN += 1 \n \n print(L.count(0)*1000 + lN*100)", "# cook your dish here\nfor h in range(int(input())):\n n=int(input())\n l=list(map(int,input().split()))\n s=0\n if l.count(1)==n:\n print(0)\n else:\n for i in l:\n if i==0:\n s+=1100 \n elif s!=0:\n s+=100 \n print(s)", "t=int(input())\r\nfor i in range(t):\r\n n=int(input())\r\n l=list(map(int,input().split()))\r\n if len(set(l))==1 and l[0]==1:\r\n print(0)\r\n elif len(set(l))==1 and l[0]==0:\r\n print(n*1100)\r\n else:\r\n f=1\r\n c=0\r\n for j in range(n):\r\n if l[j]==1 and f==0:\r\n c=c+100\r\n elif l[j]==0:\r\n c=c+1100\r\n f=0\r\n print(c)", "# cook your dish here\ntry:\n for T in range(int(input())):\n N = int(input())\n Log = input().split()\n if '0' in Log:\n print((100*(N-Log.index('0')))+Log.count('0')*1000)\n else:\n print(Log.count('0')*1000)\nexcept:\n pass"] | {"inputs": [["4", "2", "1 1", "2", "0 0", "3", "0 1 0", "2", "0 1", "", ""]], "outputs": [["0", "2200", "2300", "1200"]]} | INTERVIEW | PYTHON3 | CODECHEF | 6,080 | |
9ad89a9e9cd58c7878d1838585c8ff3b | UNKNOWN | Zonal Computing Olympiad 2013, 10 Nov 2012
N teams participate in a league cricket tournament on Mars, where each pair of distinct teams plays each other exactly once. Thus, there are a total of (N × (N-1))/2 matches. An expert has assigned a strength to each team, a positive integer. Strangely, the Martian crowds love one-sided matches and the advertising revenue earned from a match is the absolute value of the difference between the strengths of the two matches. Given the strengths of the N teams, find the total advertising revenue earned from all the matches.
For example, suppose N is 4 and the team strengths for teams 1, 2, 3, and 4 are 3, 10, 3, and 5 respectively. Then the advertising revenues from the 6 matches are as follows:
Match Team A Team B Ad revenue 1 1 2 7 2 1 3 0 3 1 4 2 4 2 3 7 5 2 4 5 6 3 4 2
Thus the total advertising revenue is 23.
-----Input format-----
Line 1 : A single integer, N.
Line 2 : N space-separated integers, the strengths of the N teams.
-----Output format-----
A single integer, the total advertising revenue from the tournament.
-----Sample input-----
4
3 10 3 5
-----Sample output-----
23
-----Test data-----
In all subtasks, the strength of each team is an integer between 1 and 1,000 inclusive.
- Subtask 1 (30 marks) : 2 ≤ N ≤ 1,000.
- Subtask 2 (70 marks) : 2 ≤ N ≤ 200,000.
-----Live evaluation data-----
- Subtask 1: Testcases 0,1,2.
- Subtask 2: Testcases 3,4,5.
-----Note-----
The answer might not fit in a variable of type int. We recommend that type long long be used for computing all advertising revenues. If you use printf and scanf, you can use %lld for long long. | ["# cook your dish here\n# cook your dish here\nfrom itertools import combinations\nn = int(input())\nt = list(combinations(list(map(int, input().split())), 2))\nar = 0\nfor i in t:\n ar += abs(i[0] - i[1])\nprint(ar)", "# cook your dish here\nn=int(input())\nstrength=list(map(int,input().split()))\nrevenue=0\nfor i in range(0,n-1):\n for j in range(i+1,n):\n x=abs(strength[i]-strength[j])\n revenue+=x\nprint(revenue)", "t=input()\narr=input().split()\narr=[int(i) for i in arr]\nc=0\nif len(arr)==t:\n for i in range(0,t):\n\t for j in range(i,t):\n\t\t c+=abs(arr[i]-arr[j])\n print(c)", "# cook your dish here\nn=int(input())\nl=list(map(int,input().split()))\nc=0\nfor i in range(0,n):\n for j in range(0,i):\n a=abs(l[i]-l[j])\n c+=a\nprint(c)", "n=int(input())\r\na=list(map(int,input().strip().split()))\r\na.sort()\r\ns=0\r\nfor i in range(len(a)):\r\n s+=a[i]*(i-(len(a)-1-i))\r\n \r\nprint(s)", "n=int(input())\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 s+=abs(a[j]-a[i])\r\nprint(s)", "n=int(input())\r\nz=[]\r\ns=list(map(int,input().split()))[:n]\r\n\r\nfor i in range(0,n):\r\n for j in range(i+1,n):\r\n p=abs(s[i]-s[j])\r\n z.append(p)\r\nprint(sum(z))", "def abs(x): \n if x < 0:\n return -x\n else: \n return x\n\n# cook your dish here\nprecalculated = {}\nN = int(input())\ntmp = input() \nwhile(tmp[-1] == \" \"): \n tmp = tmp[:-1]\nvalues = list(map(int, tmp.split(\" \")))\ntotal = 0\nsaved_sum = sum(values) \nsaved_length = len(values) - 1\nfor val in values:\n if val in precalculated:\n precalculated[val][1] += 1\n else: \n precalculated[val] = [0, 1]\nfor pre in precalculated:\n for pre1 in precalculated: \n precalculated[pre][0] += precalculated[pre1][1] * abs(pre1 - pre)\nfor pre in precalculated: \n total += precalculated[pre][0] * precalculated[pre][1]\n\nprint(total // 2)", "def abs(x): \n if x < 0:\n return -x\n else: \n return x\n\n# cook your dish here\nprecalculated = {}\nN = int(input())\ntmp = input() \nwhile(tmp[-1] == \" \"): \n tmp = tmp[:-1]\nvalues = list(map(int, tmp.split(\" \")))\ntotal = 0\nsaved_sum = sum(values) \nsaved_length = len(values) - 1\nfor val in values:\n if val in precalculated:\n precalculated[val][1] += 1\n else: \n precalculated[val] = [0, 1]\n for val1 in values: \n precalculated[val][0] += abs(val - val1)\nfor pre in precalculated: \n total += precalculated[pre][0] * precalculated[pre][1]\nprint(total // 2)", "teams=int(input())\nstrength=list(map(int, input().split()))\nstrength.sort()\nrev=0\nfor i in range(0,teams):\n rev+=strength[i]*(i-(teams-1-i))\n\nprint(rev)", "teams=int(input())\nstrength=list(map(int, input().split()))\nstrength.sort()\nrev=0\nfor i in range(0,teams):\n for j in range(i+1,teams):\n rev+=strength[j]-strength[i]\n \nprint(rev)", "n=int(input())\nstrength=list(map(int,input().split()))\nres=0\nstrength.sort()\nfor i in range(n):\n res=res+(strength[i]*(i-((n-1)-i)))\nprint(res)\n", "n=int(input())\nstrength=list(map(int,input().split()))\nsum=0\ni=0\nwhile(i<n-1):\n j=i+1\n while(j<n):\n sum=sum+abs(strength[i]-strength[j])\n j+=1\n i+=1\nprint(sum)\n", "# cook your dish here\nn=int(input())\nstrength=list(map(int,input().split()))\nrevenue=0\nfor i in range(0,n-1):\n for j in range(i+1,n):\n x=strength[i]-strength[j]\n if x<0:\n x=0-x\n revenue+=x\nprint(revenue)", "t = int(input())\ns = list(map(int, input().split()))\nrevenue = 0\ns.sort()\ns.reverse()\n\nfor i in range(t) :\n revenue -= i * s[i]\n revenue += (t - i - 1) * s[i]\n \nprint(revenue)", "t = int(input())\ns = list(map(int, input().split()))\nrevenue = 0\n\nfor i in range(t-1) : \n for j in range(i+1, t) :\n add = s[i] - s[j]\n if add > 0 :\n revenue += add\n else :\n revenue -= add\n\nprint(revenue)", "t = int(input())\ns = list(map(int, input().split()))\ni = 0\nj = t\nrevenue = 0\n\nfor i in range(t-1) : \n for j in range(i+1, t) :\n revenue += ((s[i]>s[j])*((2*s[i])-(2*s[j])) + s[j]-s[i])\n\nprint(revenue)", "teams=int(input())\nstrength=list(map(int, input().split()))\nrev=0\nfor i in range(0,teams):\n for j in range(i+1,teams):\n if(strength[i]>strength[j]):\n rev+=strength[i]-strength[j]\n \n else:\n rev+=strength[j]-strength[i]\n \nprint(rev)\n", "teams=int(input())\nstrength=list(map(int, input().split()))\nrev=0\nfor i in range(0,teams):\n for j in range(i,teams):\n if(i==j):\n continue\n elif(strength[i]>strength[j]):\n rev+=strength[i]-strength[j]\n \n else:\n rev+=strength[j]-strength[i]\n \nprint(rev)\n", "# cook your dish here\nN = int(input())\nl = list(map(int, input().strip().split(\" \")))\ns=0\nfor i in range(N):\n for j in range(i+1, N):\n s+= abs(l[j]-l[i])\nprint(s)\n\n\n\"\"\"\nl.sort()\n\ns = 0\nfor i in range(len(l)):\n s -= (len(l) - i - 1) * l[i]\n s += i * l[i]\nprint(s)\n\"\"\"", "# cook your dish here\nN = int(input())\nl = list(map(int, input().strip().split(\" \")))\n\nl.sort()\n\ns = 0\nfor i in range(len(l)):\n s -= (len(l) - i - 1) * l[i]\n s += i * l[i]\nprint(s)", "# cook your dish here\ndef gcd(x, y):\n while y:\n x, y = y, x % y\n return x\n\ndef lcm(x, y):\n return (x*y)//(gcd(x,y))\n\n\nabc=\"abcdefghijklmnopqrstuvwxyz\"\n\npi=3.141592653589793238\n\nn = int(input())\narr = list(map(int,input().split()))\nrevenue = 0\nfor i in range(n-1):\n for j in range(i+1,n):\n cur = abs(arr[i] - arr[j])\n revenue += cur\nprint(revenue)", "n = int(input())\r\nstrengths = list(map(int, input().split()))\r\nstrengths.sort(reverse = True)\r\nsumm = 0\r\nfor i in range(0, len(strengths)):\r\n summ += strengths[i]*(len(strengths)-2*(i+1)+1)\r\nprint(summ)", "n = int(input())\r\nl = list(map(int,input().split()))\r\nl.sort()\r\nc,sum = 0,0\r\nfor i in l:\r\n if c < len(l):\r\n c+=1 \r\n for x in l[c:]:\r\n sum = sum + abs(i-x)\r\n\r\nprint(sum)\r\n"] | {"inputs": [["4", "3 10 3 5", "Sample output", "23", "Test data", "In all subtasks, the strength of each team is an integer between 1 and 1,000 inclusive.", "Subtask 1 (30 marks) : 2 \u2264 N \u2264 1,000.", "Subtask 2 (70 marks) : 2 \u2264 N \u2264 200,000.", "Live evaluation data", "Subtask 1 : Testcases 0,1,2.", "Subtask 2 : Testcases 3,4,5.", "Note", "The answer might not fit in a variable of type int . We recommend that type long\u00a0long be used for computing all advertising revenues. If you use printf and scanf , you can use %lld for long\u00a0long ."]], "outputs": [[]]} | INTERVIEW | PYTHON3 | CODECHEF | 6,355 | |
06a0355ed33e37794a637cb06b9dd285 | UNKNOWN | Vivek was quite bored with the lockdown, so he came up with an interesting task. He successfully completed this task and now, he would like you to solve it.
You are given two strings $A$ and $B$, each with length $N$. Let's index the characters in each string from $0$ ― for each $i$ ($0 \le i < N$), the $i+1$-th characters of $A$ and $B$ are denoted by $A_i$ and $B_i$ respectively. You should convert $A$ to $B$ by performing operations of the following type:
- Choose a subset $S$ of the set $\{0, 1, \ldots, N-1\}$.
- Let $c$ be the alphabetically smallest character among $A_x$ for all $x \in S$.
- For each $x \in S$, replace $A_x$ by $c$.
You should find the smallest necessary number of operations or report that it is impossible to convert $A$ to $B$. If it is possible, you also need to find one way to convert $A$ to $B$ using this smallest number of operations. If there are multiple solutions, you may find any one.
-----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 a single string $A$.
- The third line contains a single string $B$.
-----Output-----
For each test case:
- If it is impossible to convert $A$ to $B$, print a single line containing the integer $-1$.
- Otherwise, first, print a line containing a single integer $K$ ― the minimum number of operations.
- Then, print $K$ lines describing the operations. Each of these lines should contain a positive integer $Z$, followed by a space and $Z$ pairwise distinct space-separated integers from the set $\{0, 1, \ldots, N-1\}$ ― the elements of $S$.
-----Constraints-----
- $1 \le T \le 20$
- $1 \le N \le 10^3$
- $|A| = |B| = N$
- $A$ and $B$ contain only lowercase English letters
-----Subtasks-----
Subtask #1 (30 points): $B$ contains only characters 'a' and 'b'
Subtask #2 (70 points): original constraints
-----Example Input-----
3
5
abcab
aabab
3
aaa
aab
2
de
cd
-----Example Output-----
2
3 1 2 4
3 0 1 3
-1
-1
-----Explanation-----
Example case 1:
- First, we can choose $S = (1, 2, 4)$, so the character $c$ is 'b' and the string $A$ after this operation is "abbab".
- Then, we choose $S = (0, 1, 3)$, so $c$ is 'a', and $A$ becomes "aabab".
- There is no way to convert $A$ to $B$ in only one operation.
Example case 2: We can see that it is impossible to convert $A$ to $B$ since $c$ is always 'a'.
Example case 3: We can see again that it is impossible to convert $A$ to $B$ since $c$ cannot be 'c'. | ["for _ in range(int(input())):\n n=int(input())\n a=input()\n b=input()\n l=[]\n flag=0\n for i in range(n):\n if b[i]!=a[i]:\n if b[i] in a and b[i]<a[i]:\n l.append(b[i])\n else:\n flag=1\n break\n if flag==1:\n print(-1)\n else:\n if l==[]:\n print(0)\n else:\n l = sorted(list(set(l)), reverse = True)\n print(len(l))\n for i in range(len(l)):\n q=[]\n r=[]\n for j in range(len(a)):\n if l[i]==b[j]:\n q.append(j)\n r.append(a[j])\n if l[i] not in r:\n for k in range(len(a)):\n if a[k]==l[i]:\n q.append(k)\n print(len(q),*q)\n \n", "# cook your dish here\nt = int(input())\nfor _ in range(t):\n n = int(input())\n a = input()\n b = input()\n a = list(a)\n b = list(b)\n l = []\n f = 1\n for i in range(n):\n if b[i]!=a[i]:\n if b[i] in a and b[i]<a[i]:\n l.append(b[i])\n else:\n f = 0\n break\n if f==0:\n print(-1)\n else:\n if l == []:\n print(0)\n else:\n l = sorted(list(set(l)), reverse = True)\n print(len(l))\n for i in range(len(l)):\n Q=[]\n R=[]\n for j in range(len(a)):\n if b[j]==l[i]:\n Q.append(j)\n R.append(a[j])\n if l[i] not in R:\n for k in range(n):\n if a[k]==l[i]:\n Q.append(k)\n break\n print(len(Q),*Q)", "from collections import deque\nt = int(input())\nwhile t>0:\n t -= 1\n n = int(input())\n a = input()\n b = input()\n amap = {}\n bmap = {}\n for i, char in enumerate(a):\n if char in amap:\n amap[char].append(i)\n else:\n amap[char] = [i]\n for i, char in enumerate(b):\n if char in bmap:\n bmap[char].append(i)\n else:\n bmap[char] = [i]\n ans = []\n flag = False\n for letter in range(25, -1, -1):\n char = chr(ord('a')+letter)\n if char in bmap:\n if char not in amap:\n flag = True\n break\n else:\n ans.append([])\n for ind in bmap[char]:\n if a[ind] < char:\n flag = True\n break\n elif a[ind] == char:\n pass\n else:\n ans[-1].append(ind)\n if len(ans[-1]):\n ans[-1].append(amap[char][0])\n else:\n ans.pop()\n if flag:\n break\n if flag:\n print(-1)\n else:\n print(len(ans))\n for item in ans:\n print(len(item), end=' ')\n print(*item)", "t = int(input())\n\nfor i in range(t):\n n = int(input())\n A = list(input())\n B = list(input())\n flag = 0\n if(A == B):\n print(0)\n else:\n\n for i in range(n):\n if(B[i] not in A or ord(A[i]) < ord(B[i])):\n print(-1)\n flag = 1\n break\n \n \n\n\n\n if(flag == 0): \n count = 0\n small_ele = list(set(B))\n seti = []\n \n\n for j in small_ele:\n temp = []\n ind = A.index(j)\n if(A != B):\n temp.append(ind)\n for k in range(n):\n if(B[k] == j and A[k] != j):\n A[k] = j\n temp.append(k)\n count = count + 1\n seti.append(temp)\n else:\n break\n \n print(count)\n for i in seti:\n d = len(i)\n print(d,end=\" \")\n for j in range(d):\n print(i[j],end=\" \")\n print(end=\"\\n\")\n \n \n\n\n\n \n\n", "t = int(input())\n\nfor i in range(t):\n n = int(input())\n A = list(input())\n B = list(input())\n flag = 0\n if(A == B):\n print(0)\n else:\n\n for i in range(n):\n if(B[i] not in A or ord(A[i]) < ord(B[i])):\n print(-1)\n flag = 1\n break\n \n \n\n\n\n if(flag == 0): \n count = 0\n small_ele = list(set(B))\n seti = []\n small_ele.sort()\n small_ele.reverse()\n\n for j in small_ele:\n temp = []\n ind = A.index(j)\n if(A != B):\n temp.append(ind)\n for k in range(n):\n if(B[k] == j and A[k] != j):\n A[k] = j\n temp.append(k)\n count = count + 1\n seti.append(temp)\n else:\n break\n \n print(count)\n for i in seti:\n d = len(i)\n print(d,end=\" \")\n for j in range(d):\n print(i[j],end=\" \")\n print(end=\"\\n\")\n \n \n\n\n\n \n\n", "for _ in range(int(input())):\n N = int(input())\n c_str = str(input())\n target_str = str(input())\n no_match = False\n\n for i in range(N):\n\n if c_str[i] < target_str[i]: \n no_match = True\n break \n \n if target_str[i] not in c_str : \n no_match = True\n break\n \n if no_match : \n print(-1)\n \n else:\n indices = {char : index for index, char in enumerate(c_str)}\n m_match = {}\n for i in range(N):\n # c_str[i] is greater than target_str[i]\n if c_str[i] != target_str[i] : \n if m_match.get(target_str[i]) : \n m_match[target_str[i]].append(str(i))\n \n else : \n m_match[target_str[i]] = [str(i)]\n \n \n print(len(m_match))\n\n for i in sorted(m_match.keys(), reverse=True):\n\n print(len(m_match[i])+1,\" \".join(m_match[i]), indices[i])", "for _ in range(int(input())):\n N = int(input())\n c_str = str(input())\n target_str = str(input())\n no_match = False\n\n for i in range(N):\n\n if c_str[i] < target_str[i]: \n no_match = True\n break \n \n if target_str[i] not in c_str : \n no_match = True\n break\n \n if no_match : \n print(-1)\n \n else:\n indices = {char : index for index, char in enumerate(c_str)}\n m_match = {}\n for i in range(N):\n # c_str[i] is greater than target_str[i]\n if c_str[i] != target_str[i] : \n if m_match.get(target_str[i]) : \n m_match[target_str[i]].append(str(i))\n \n else : \n m_match[target_str[i]] = [str(i)]\n \n \n print(len(m_match))\n\n for i in sorted(m_match.keys(), reverse=True):\n\n print(len(m_match[i])+1,\" \".join(m_match[i]), indices[i])", "for _ in range(int(input())):\n N = int(input())\n c_str = str(input())\n target_str = str(input())\n no_match = False\n\n for i in range(N):\n\n if c_str[i] < target_str[i]: \n no_match = True\n break \n \n if target_str[i] not in c_str : \n no_match = True\n break\n \n if no_match : \n print(-1)\n \n else:\n indices = {char : index for index, char in enumerate(c_str)}\n m_match = {}\n for i in range(N):\n # c_str[i] is greater than target_str[i]\n if c_str[i] != target_str[i] : \n if m_match.get(target_str[i]) : \n m_match[target_str[i]].append(str(i))\n \n else : \n m_match[target_str[i]] = [str(i)]\n \n \n print(len(m_match))\n\n for i in sorted(m_match.keys(), reverse=True):\n\n print(len(m_match[i])+1,\" \".join(m_match[i]), indices[i])", "# cook your dish here\ndef conv(a, b):\n stop = 0\n n = len(a)\n for i in range(0,n):\n if ord(a[i]) - ord(b[i]) < 0:\n print(-1)\n stop = 1 \n \n if stop == 0:\n for i in range (0,n):\n flag =0\n for j in range (0,n):\n if b[i] == a[j]:\n flag = 1\n break\n if flag == 0:\n print(-1)\n stop = 1 \n break\n if stop ==0:\n distinctArr = []\n for i in range (0,n):\n dontAdd = 0\n if a[i] != b[i]:\n for j in range (0,len(distinctArr)):\n if b[i] == distinctArr[j]:\n dontAdd = 1\n if dontAdd == 0:\n distinctArr.append(b[i])\n distinctArr.sort(reverse = True)\n print(len(distinctArr))\n \n for i in range (0,len(distinctArr)):\n arr = []\n for j in range(0,n):\n if distinctArr[i]==b[j] and b[j]!=a[j]:\n arr.append(j)\n for j in range (0,n):\n if distinctArr[i] == a[j]:\n arr.append(j)\n break\n arr.sort()\n print(len(arr), end =\" \")\n for k in range (0,len(arr)):\n if k == len(arr)-1:\n print(arr[k])\n else:\n print(arr[k], end=\" \")\n #print(distinctArr)\n \nt = int(input())\nfor i in range (0,t):\n n = int(input())\n a = input()\n b = input()\n arr1 = list(a)\n arr2 = list(b)\n conv(arr1, arr2)\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n ", "T = int(input())\nfor _ in range(T):\n N = int(input())\n A = list(input())\n B = list(input())\n if(not set(B).issubset(set(A))):\n print(-1)\n else:\n l1 = []\n flag = 1\n for (i,(x,y)) in enumerate(list(zip(A,B))):\n if(y>x):\n flag = 0\n break\n elif(y==x):\n pass\n else:\n l1.append((i,(x,y)))\n if(flag):\n s = set(list(reversed(list(sorted([y for i,(x,y) in l1])))))\n number_of_ops = len(s)\n print(number_of_ops)\n for char in s:\n answer = []\n for item in l1:\n if(char == item[1][1]):\n answer.append(item[0])\n answer.append(list(A).index(char))\n answer.insert(0,len(answer))\n print(' '.join(list(map(str,answer))))\n else:\n print(-1)\n \n \n \n", "'''for _ in range(int(input())):\n N = int(input())\n a = list(input())\n b = list(input())\n aset = set(a)\n bset = set(b)\n if(a == b):\n print(0)\n\n elif(bset.issubset(aset)):\n d = {}\n wr = {}\n f = 0\n for i in range(N):\n if(a[i] != b[i]):\n if b[i] in d:\n d[b[i]].append(i)\n wr[b[i]].append(a[i])\n else:\n d[b[i]] = []\n wr[b[i]] = []\n d[b[i]].append(i)\n wr[b[i]].append(a[i])\n #print(wr,d)\n\n for k,v in sorted(wr.items(),reverse=True):\n # print(k,v)\n for i in v:\n # print(k,i)\n if ord(k)>ord(i):\n f=1\n break\n if f==1:\n break\n # print(flag)\n if f==1:\n print(-1)\n else:\n print(len(d))\n for k,v in sorted(d.items(),reverse=True):\n print(len(d[k])+1,end=\" \")\n print(d[k],a.index(k))\n\n\n\n else:\n print(-1)''' \n\n\nfor _ in range(int(input())):\n n=int(input())\n \n a=list(input())\n \n b=list(input())\n if(a==b):\n print(0)\n else:\n l=[]\n c=0\n for i in range(n):\n if(b[i] not in l):\n if(b[i] not in a):\n c=1\n break\n l.append(b[i])\n if(c):\n print(-1)\n else:\n l.sort()\n l.reverse()\n truthy=0\n list1=[]\n for i in range(len(l)):\n current=l[i]\n posb=[]\n one=None\n for j in range(n):\n if(one==None):\n if(a[j]==current):\n one=j\n if(b[j]==current):\n posb.append(j)\n for j in range(len(posb)):\n if(a[posb[j]]<current):\n truthy=1\n break\n if(truthy==1):\n break\n else:\n \n if(one not in posb):\n posb.append(one)\n qq=0\n for j in range(len(posb)):\n if(a[posb[j]]!=current):\n qq=1\n if(qq):\n for j in range(len(posb)):\n a[posb[j]]=current\n list1.append(posb)\n if(truthy):\n print(-1)\n else:\n print(len(list1))\n for i in range(len(list1)):\n print(len(list1[i]),end=\" \")\n for j in range(len(list1[i])):\n print(list1[i][j],end=\" \")\n print(\"\\n\")", "import string\n\nASCII_ASC = string.ascii_lowercase\nASCII_DSC = sorted(ASCII_ASC, reverse=True)\n\ndef int_input():\n return int(input())\n\ndef array_input(data_type=int):\n if data_type != str:\n return list(map(data_type, input().split(\"\")))\n else:\n return list(map(str, input()))\n\ndef solve():\n N = int_input()\n A = array_input(data_type=str)\n B = array_input(data_type=str)\n for i in range(N):\n if A[i] < B[i]:\n print(-1)\n return\n res = []\n for ch in ASCII_DSC:\n idx_pos = []\n chk = False\n\n for i in range(0, N):\n if B[i] == ch and A[i] != ch:\n # print(\"ch\",ch)\n idx_pos.append(i)\n # print(\"idx_pos\", idx_pos)\n if chk is False and len(idx_pos):\n for i in range(0, N):\n if A[i] == ch:\n # print(\"setting chk = True\")\n chk = True\n idx_pos.append(i)\n # print(\"now idx_pos\",idx_pos)\n if chk is False and len(idx_pos):\n print(-1)\n return\n if len(idx_pos):\n res.append(idx_pos)\n for idx in idx_pos:\n A[idx] = ch\n print(len(res))\n for arr in res:\n print(len(arr), \" \".join(map(str, arr)))\n\n\n \nt = int_input()\nwhile t > 0:\n t -= 1\n solve()\n", "for _ in range (int(input())):\n n=int(input())\n a1=input()\n b1=input()\n a=[]\n b=[]\n for i in a1:\n a.append(ord(i)-97)\n for i in b1:\n b.append(ord(i)-97)\n ind = [-1]*26\n for i in range (n):\n ind[a[i]]=i\n ans=[]\n temp = 0\n for i in range(n):\n if b[i]>a[i]:\n temp = 1\n break\n for i in range (n):\n if ind[b[i]]==-1:\n temp = 1\n for i in range (24,-1,-1):\n ans.append([])\n ans[-1].append(ind[i])\n for j in range (n):\n if a[j]>i and b[j]==i and ind[i]!=-1:\n ans[-1].append(j)\n if temp == 1:\n break\n if temp == 1:\n print(-1)\n else:\n l = 0\n for i in ans:\n if len(i)!=1:\n l+=1\n print(l)\n for i in ans:\n if len(i)!=1:\n print(len(i),end=\" \")\n print(*i)\n", "from collections import defaultdict\ndef fn(a,b,n):\n l=[]\n da=defaultdict(lambda:[])\n db=defaultdict(lambda:[])\n idx=jdx=0\n for i,j in zip(a,b):\n if i<j or j not in a:\n print(-1)\n return\n da[i].append(idx)\n db[j].append(jdx)\n idx+=1\n jdx+=1\n c=0\n #print(b)\n while a!=b:\n mx=max(db)\n tc=[]\n for i in db[mx]:\n if a[i]!=b[i]:\n tc.append(i)\n da[a[i]].remove(i)\n a[i]=mx\n da[mx].append(i)\n \n for i in da[mx]:\n if a[i]==mx:\n tc.append(i)\n break\n\n del db[mx]\n #print(a)\n l.append(tc)\n c+=1\n print(c)\n for i in range(c):\n print(len(l[i]),end=' ')\n for j in l[i]:\n print(j,end=' ')\n print()\n\n\n\n\nt=int(input())\nfor i in range(t):\n n=int(input())\n a=input()\n a=[i for i in a]\n b=input()\n b=[i for i in b]\n fn(a,b,n)\n", "from collections import defaultdict\ndef fn(a,b,n):\n l=[]\n da=defaultdict(lambda:[])\n db=defaultdict(lambda:[])\n idx=jdx=0\n for i,j in zip(a,b):\n if i<j or j not in a:\n print(-1)\n return\n da[i].append(idx)\n db[j].append(jdx)\n idx+=1\n jdx+=1\n c=0\n #print(b)\n while a!=b:\n mx=max(db)\n tc=[da[mx][0]]\n for i in db[mx]:\n if a[i]!=b[i]:\n tc.append(i)\n da[a[i]].remove(i)\n a[i]=mx\n da[mx].append(i)\n\n del db[mx]\n #print(a)\n l.append(tc)\n c+=1\n print(c)\n for i in range(c):\n print(len(l[i]),end=' ')\n for j in l[i]:\n print(j,end=' ')\n print()\n\n\n\n\nt=int(input())\nfor i in range(t):\n n=int(input())\n a=input()\n a=[i for i in a]\n b=input()\n b=[i for i in b]\n fn(a,b,n)\n", "from collections import defaultdict\ndef fn(a,b,n):\n l=[]\n da=defaultdict(lambda:[])\n db=defaultdict(lambda:[])\n idx=jdx=0\n for i,j in zip(a,b):\n if i<j or j not in a:\n print(-1)\n return\n da[i].append(idx)\n db[j].append(jdx)\n idx+=1\n jdx+=1\n c=0\n #print(b)\n while a!=b:\n mx=max(db)\n tc=[da[mx][0]]\n for i in db[mx]:\n if a[i]!=b[i]:\n tc.append(i)\n a[i]=mx\n del db[mx]\n #print(a)\n l.append(tc)\n c+=1\n print(c)\n for i in range(c):\n print(len(l[i]),end=' ')\n for j in l[i]:\n print(j,end=' ')\n print()\n\n\n\n\nt=int(input())\nfor i in range(t):\n n=int(input())\n a=input()\n a=[i for i in a]\n b=input()\n b=[i for i in b]\n fn(a,b,n)\n", "for _ in range(int(input())):\n n = int(input())\n a = input()\n b = input()\n flag = 1\n for i in range(n):\n if a[i] < b[i]:\n flag = 0\n break\n if b[i] not in set(a):\n flag = 0\n break\n \n if flag == 1:\n d = {}\n for i in range(n):\n if a[i]!=b[i]:\n if b[i] not in d:\n d[b[i]]=[0]\n d[b[i]][0] += 1 \n d[b[i]] += [i]\n # print(d)\n \n cov = sorted(d,reverse=True)\n # print(cov)\n ans = []\n opr = len(cov)\n for i in cov:\n t = [d[i][0]+1]+[a.index(i)]+d[i][1:]\n # print(i)\n # print(t)\n ans.append(t)\n print(opr)\n for i in ans:\n print(*i, sep=' ')\n else:\n print(-1)", "# cook your dish here\nfor _ in range(int(input())):\n n = int(input())\n firstString = list(input())\n secondString = list(input())\n firstStringSet = set(firstString)\n secondStringSet = set(secondString)\n if firstString==secondString:\n print(0)\n \n elif secondStringSet.issubset(firstStringSet):\n d={}\n wr = {}\n f=0\n for i in range(n):\n if firstString[i]!=secondString[i]:\n if secondString[i] in d:\n d[secondString[i]].append(i)\n wr[secondString[i]].append(firstString[i])\n else:\n d[secondString[i]]=[]\n wr[secondString[i]]=[]\n d[secondString[i]].append(i)\n wr[secondString[i]].append(firstString[i])\n\n # print(wr,d)\n for k,v in sorted(wr.items(),reverse=True):\n # print(k,v)\n for i in v:\n # print(k,i)\n if ord(k)>ord(i):\n f=1\n break\n if f==1:\n break\n # print(flag)\n if f==1:\n print(-1)\n else:\n print(len(d))\n for k,v in sorted(d.items(),reverse=True):\n print(len(d[k])+1,end=\" \")\n print(*d[k],firstString.index(k))\n \n \n else:\n print(-1)", "T=int(input())\nfor _ in range(T):\n N=int(input())\n A=input()\n B=input()\n dupdel=list(dict.fromkeys(B))\n def notpossible(A,B,dupdel):\n for i in range(len(dupdel)):\n if dupdel[i] not in A:\n return -1\n for i in range(len(A)):\n if A[i]<B[i]:\n return -1\n if notpossible(A,B,dupdel)==-1:\n print(-1)\n continue\n else:\n L=[]\n for i in range(len(A)):\n if A[i]!=B[i]:\n L.append(B[i])\n #print(L)\n P=list(dict.fromkeys(L))\n print(len(P))\n P.sort(reverse=True)\n for i in range(len(P)):\n Q=[]\n R=[]\n for j in range(len(A)):\n if B[j]==P[i]:\n Q.append(j)\n R.append(A[j])\n if P[i] not in R:\n for k in range(N):\n if A[k]==P[i]:\n Q.append(k)\n break\n print(len(Q),*Q)\n", "# cook your dish here\ntry:\n import string \n alphabets=string.ascii_lowercase\n test=int(input())\n #ans=[]\n\n def solve():\n \n ans=[]\n n=int(input())\n string1=[]\n string2=[]\n present=[None]*26\n \n string1=list(input())\n string2=list(input())\n\n for i in range(n):\n if string1[i]<string2[i]:\n print(-1)\n return\n \n for i in range(n):\n present[ord(string1[i])-ord('a')]=1\n\n for i in range(n):\n if (present[ord(string2[i])-ord('a')]!=1):\n print(-1)\n return\n\n for alpha in alphabets[::-1]:\n index=[]\n \n for i in range(n):\n if(string1[i]!=alpha and string2[i]==alpha):\n index.append(i)\n\n \n if index:\n for i in range(n):\n if string1[i]==alpha:\n index.append(i)\n\n\n if index:\n ans.append(index)\n\n for i in range(len(index)):\n idx=index[i]\n string1[idx]=alpha \n\n\n print(len(ans))\n for i in ans:\n i.sort()\n print(len(i),*i)\n #for i in ans:\n #print(\" \".join(map(str,i)))\n\n for _ in range(test):\n solve()\n\n\n\n \nexcept:\n pass", "# -*- s_oding: utf-8 -*-\n\"\"\"\ns_reated on Sat May 30 19:42:30 2020\n\n@author: trinzya\n\"\"\"\n\nimport string\n\n\nt=int(input())\nfor i in range(t):\n n=int(input())\n a=list(input())\n b=list(input())\n #print(a,b)\n s=[]\n c=[]\n count=0\n s_=[]\n \n if not set(b).issubset(set(a)):\n #print(\"okay\")\n print(-1)\n continue\n\n abs_=string.ascii_lowercase\n\n\n for k in range(len(abs_)-1,-1,-1):\n #print(count)\n flag=0\n f=0\n j=abs_[k]\n #print(j)\n if a==b:\n break\n if j not in c:\n #print(c)\n s=[]\n for i in range(n):\n #print( j,b[i]==j )\n \n if ((a[i]!=b[i]) and( b[i]==j )and (a[i]>j)):\n f=1\n #print(j)\n s.append(i)\n if a[i]==j:\n flag=1\n s.append(i)\n \n if len(s)!=0:\n count=count+1\n if len(s)==1:\n \n #p#rint(\"s\")\n s=[]\n count=count-1\n continue\n if (flag==0 and f==1 )or( flag==1 and f==0):\n #print(\"f\",f)\n #print(\"flag\",flag)\n \n #print(s)\n count=count-1\n continue\n for i in s:\n #print(i)\n \n \n a[i]=j\n \n s_.append(s)\n c.append(j)\n if a!=b:\n #print(a,b)\n print(-1)\n continue\n \n print(count)\n if count!=0:\n for i in s_:\n i=list(map(str,i))\n print(len(i),\" \".join(i))\n \n\n\n\n\n \n\n\n\n\n \n \n \n \n \n \n \n\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n"] | {"inputs": [["3", "5", "abcab", "aabab", "3", "aaa", "aab", "2", "de", "cd"]], "outputs": [["2", "3 1 2 4", "3 0 1 3", "-1", "-1"]]} | INTERVIEW | PYTHON3 | CODECHEF | 19,482 | |
8f3ad41a654dbaa132ea5c944e3ff513 | UNKNOWN | Bear Limak has a sequence of N non-negative integers A1, A2, ..., AN. He defines the score of a segment (consecutive subsequence) as its sum of elements modulo P (not necessarily prime). Find the maximum score of a non-empty segment, and also find the number of segments with this maximum score.
-----Input-----
First line of the input contains an integer T denoting the number of test cases. The description of T test cases follows.
For each test case, the first line of the input contains two space separated integers, N and P.
The second line contains N space separated integers denoting the sequence.
-----Output-----
For each test case, output two space separated integers denoting the maximum score of a segment and the number of segments with the score, respectively.
-----Constraints-----
- 1 ≤ T ≤ 10
- 1 ≤ N ≤ 105
- 1 ≤ P ≤ 109
- 0 ≤ Ai ≤ 109
Subtask #1: (25 points)
- 1 ≤ N ≤ 100
Subtask #2: (25 points)
- 1 ≤ N ≤ 1000
Subtask #3: (50 points)
- original constraints
-----Example-----
Input:
4
2 3
1 2
3 5
2 4 3
3 100
1 3 5
4 3
1 2 3 4
Output:
2 1
4 2
9 1
2 2
-----Explanation-----
Example case 1. There are three segments - [1], [2] and [1, 2]. Sum of these segments are 1, 2 and 3 respectively. Sum of these segments modulo 3 will be 1, 2 and 0. Maximum score among these is 2. There is also only one segment with this score.
Example case 2. There are six segments - [2], [4], [3], [2, 4], [4, 3] and [2, 4, 3]. Sum of these segments are 2, 4, 3, 6, 7, 9 respectively. Sum of these segments modulo 5 will be 2, 4, 3, 1, 2, 4. Maximum score among these is 4. And there are two segments with this score. | ["for _ in range(int(input())):\n n,m=input().split()\n n,m=int(n),int(m)\n x=y=c=0\n l=list(map(int,input().split()))\n for i in range(n):\n for j in range(i,n):\n x=x+l[j]\n if (x%m)>y:\n y=x%m\n c=1\n elif y==(x%m):\n c+=1\n x = 0\n print(y,c)\n\n", "for _ in range(int(input())):\n n,p=map(int,input().split())\n l=[int(i) for i in input().split()]\n pre=[0]*(n+1)\n for i in range(1,n+1):\n pre[i]=pre[i-1]+l[i-1]\n pre[i]%=p \n cmaxi=0 \n maxi=0 \n for i in range(n):\n for j in range(i,n):\n curr=(pre[j+1]-pre[i]+p)%p \n #print(curr)\n if curr>maxi:\n maxi=curr \n cmaxi=1 \n elif curr==maxi:\n cmaxi+=1 \n print(maxi,cmaxi)", "# cook your dish here\nt=int(input())\nfor _ in range(t):\n n,p=map(int,input().split())\n l=list(map(int,input().split()))\n for i in range(n):\n l[i]=l[i]%p\n d={}\n for i in range(n):\n c=0\n for j in range(i,n):\n c+=l[j]\n try:\n d[c%p]+=1\n except:\n d[c%p]=1\n x=max(list(d.keys()))\n print(x,d[x])", "# cook your dish here\nt=int(input())\nfor _ in range(t):\n n,p=map(int,input().split())\n l=list(map(int,input().split()))\n d={}\n for i in range(n):\n c=0\n for j in range(i,n):\n c+=l[j]\n try:\n d[c%p]+=1\n except:\n d[c%p]=1\n x=max(list(d.keys()))\n print(x,d[x])"] | {"inputs": [["4", "2 3", "1 2", "3 5", "2 4 3", "3 100", "1 3 5", "4 3", "1 2 3 4"]], "outputs": [["2 1", "4 2", "9 1", "2 2"]]} | INTERVIEW | PYTHON3 | CODECHEF | 1,283 | |
d9c7db8f9889e5a7a4bc0bf4e4578759 | UNKNOWN | Chef has a sequence $A_1, A_2, \ldots, A_N$. This sequence has exactly $2^N$ subsequences. Chef considers a subsequence of $A$ interesting if its size is exactly $K$ and the sum of all its elements is minimum possible, i.e. there is no subsequence with size $K$ which has a smaller sum.
Help Chef find the number of interesting subsequences of the sequence $A$.
-----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 interesting subsequences.
-----Constraints-----
- $1 \le T \le 10$
- $1 \le K \le N \le 50$
- $1 \le A_i \le 100$ for each valid $i$
-----Subtasks-----
Subtask #1 (30 points): $1 \le N \le 20$
Subtask #2 (70 points): original constraints
-----Example Input-----
1
4 2
1 2 3 4
-----Example Output-----
1
-----Explanation-----
Example case 1: There are six subsequences with length $2$: $(1, 2)$, $(1, 3)$, $(1, 4)$, $(2, 3)$, $(2, 4)$ and $(3, 4)$. The minimum sum is $3$ and the only subsequence with this sum is $(1, 2)$. | ["def fact(n):\n if n<2:\n return 1\n return n * fact(n-1)\n \ndef ncr(n, r):\n return fact(n)// (fact(r)*fact(n-r))\n \nt=int(input())\n\nfor _ in range(t):\n n, k = list(map(int, input().split()))\n a = list(map(int, input().split()))\n a.sort()\n count_z = a.count(a[k-1])\n count_z_seq = a[:k].count(a[k-1])\n \n print(ncr(count_z, count_z_seq))\n", "import math\nt = int(input())\ndef t_min(li,k):\n x = 0\n for i in range(k):\n x += li[i]\n return x\ndef cnt(li,x):\n n = 0\n for i in li:\n if x == i:\n n += 1\n return n\ndef num_of_occur(li,k):\n z = li[k-1]\n y = 0\n for i in range(k):\n if(li[i] == z):\n y += 1\n return y\ndef factorials(z,y):\n return (math.factorial(z)/(math.factorial(y)*math.factorial((z - y))))\n \nfor a in range(t):\n n,k = [int(x) for x in input().split()]\n lis = [int(x) for x in input().split()]\n lis.sort()\n sumn = t_min(lis,k)\n y = num_of_occur(lis,k)\n z = cnt(lis,lis[k-1])\n print(int(factorials(z,y)))\n", "import math\nt = int(input())\ndef t_min(li,k):\n x = 0\n for i in range(k):\n x += li[i]\n return x\ndef cnt(li,x):\n n = 0\n for i in li:\n if x == i:\n n += 1\n return n\ndef num_of_occur(li,k):\n z = li[k-1]\n y = 0\n for i in range(k):\n if(li[i] == z):\n y += 1\n return y\ndef factorials(z,y):\n return (math.factorial(z)/(math.factorial(y)*math.factorial((z - y))))\n \nfor a in range(t):\n n,k = [int(x) for x in input().split()]\n lis = [int(x) for x in input().split()]\n lis.sort()\n sumn = t_min(lis,k)\n y = num_of_occur(lis,k)\n z = cnt(lis,lis[k-1])\n print(int(factorials(z,y)))\n \n", "import math\ndef fact(n):\n return math.factorial(n)\nt=int(input())\nfor _ in range(t):\n n,k=map(int,input().split())\n arr=list(map(int,input().split()))\n arr.sort()\n tot=0\n for i in range(k):\n tot+=arr[i]\n count=0\n for i in range(n):\n if arr[i]==arr[k-1]:\n count+=1\n\n orig_count=0\n for i in range(k):\n if arr[i]==arr[k-1]:\n orig_count+=1\n print(fact(count)//(fact(orig_count)*fact(count-orig_count)))", "from math import factorial as fact \nt=int(input())\nwhile t>0:\n n,k=map(int,input().split()) \n y=list(map(int,input().split())) \n y.sort() \n k1=[]\n for i in range(len(y)):\n if i>k-1:\n if y[i]!=k1[-1]:\n break\n else:\n k1.append(y[i]) \n else:\n k1.append(y[i])\n c=k1[k-1] \n ans=0 \n for i in range(k): \n if k1[i]==c: \n ans+=1 \n ans2=k1.count(c) \n print(fact(ans2)//(fact(ans)*fact(ans2-ans))) \n \n \n \n \n \n \n t-=1", "t=int(input())\nwhile t>0:\n n,k=map(int,input().split()) \n y=list(map(int,input().split())) \n y.sort() \n k1=[]\n for i in range(len(y)):\n if i>k-1:\n if y[i]!=k1[-1]:\n break\n else:\n k1.append(y[i]) \n else:\n k1.append(y[i])\n from itertools import combinations\n ans=list(combinations(k1,k)) \n l=[]\n for i in ans:\n l.append(sum(i))\n print(l.count(min(l)))\n \n \n t-=1", "def fact(n): \n \n res = 1\n \n for i in range(2, n+1): \n res = res * i \n \n return res \n\ndef nCr(n, r): \n \n return (fact(n) / (fact(r) \n * fact(n - r))) \nfor _ in range(int(input())):\n n, k = map(int,input().split())\n arr = list(map(int,input().split()))\n arr = sorted(arr)\n last_index_of_k = arr[k-1]\n count = 0\n for i in range(n):\n if(arr[i] == last_index_of_k):\n count += 1\n num = 0\n for i in range(k):\n if(arr[i] == last_index_of_k):\n num += 1\n print(int(nCr(count,num)))", "# cook your dish here\n# cook your dish here\ndef fact(n):\n res=1\n for i in range(1,n+1):\n res*=i\n return res\nt=int(input())\nfor _ in range(t):\n n,k=list(map(int,input().split()))\n arr=list(map(int,input().split()))\n arr.sort()\n tot=0\n for i in range(k):\n tot+=arr[i]\n count=0\n for i in range(n):\n if arr[i]==arr[k-1]:\n count+=1\n\n orig_count=0\n for i in range(k):\n if arr[i]==arr[k-1]:\n orig_count+=1\n print(fact(count)//(fact(orig_count)*fact(count-orig_count)))\n", "# cook your dish here\n# cook your dish here\ndef fact(n):\n res=1\n for i in range(1,n+1):\n res*=i\n return res\nt=int(input())\nfor _ in range(t):\n n,k=list(map(int,input().split()))\n arr=list(map(int,input().split()))\n arr.sort()\n tot=0\n for i in range(k):\n tot+=arr[i]\n count=0\n for i in range(n):\n if arr[i]==arr[k-1]:\n count+=1\n\n orig_count=0\n for i in range(k):\n if arr[i]==arr[k-1]:\n orig_count+=1\n print(fact(count)//(fact(orig_count)*fact(count-orig_count)))\n \n \n \n", "# cook your dish here\ndef fact(n):\n res=1\n for i in range(1,n+1):\n res*=i\n return res\nt=int(input())\nfor _ in range(t):\n n,k=list(map(int,input().split()))\n arr=list(map(int,input().split()))\n arr.sort()\n tot=0\n for i in range(k):\n tot+=arr[i]\n count=0\n for i in range(n):\n if arr[i]==arr[k-1]:\n count+=1\n\n orig_count=0\n for i in range(k):\n if arr[i]==arr[k-1]:\n orig_count+=1\n print(fact(count)//(fact(orig_count)*fact(count-orig_count)))\n \n \n \n", "from itertools import combinations\nfor i in range(int(input())):\n n,k=map(int, input().split())\n x=list(map(int,input().split(maxsplit=n)))\n y=list(combinations(x,k))\n z=[]\n for i in range(len(y)):\n z.append(sum(y[i]))\n print(z.count(min(z)))", "from itertools import combinations\nt=int(input())\nfor i in range(t):\n n,k=map(int, input().split())\n x=list(map(int,input().split(maxsplit=n)))\n y=list(combinations(x,k))\n z=[]\n for i in range(len(y)):\n z.append(sum(y[i]))\n print(z.count(min(z)))", "# cook your dish here\nfrom itertools import combinations\nt=int(input())\nfor i in range(t):\n n,k=map(int, input().split())\n num=list(map(int,input().split(maxsplit=n)))\n y=list(combinations(num,k))\n num1=[]\n for i in range(len(y)):\n num1.append(sum(y[i]))\n print(num1.count(min(num1)))", "# cook your dish here\nimport itertools\nt=int(input())\nfor i in range(t):\n n,k=map(int, input().split())\n num=list(map(int,input().split(maxsplit=n)))\n y=list(itertools.combinations(num,k))\n num1=[]\n for i in range(len(y)):\n num1.append(sum(y[i]))\n print(num1.count(min(num1)))", "# cook your dish here\nimport itertools\nt=int(input())\nfor i in range(t):\n n,k=map(int, input().split())\n num=list(map(int,input().split(maxsplit=n)))\n y=list(itertools.combinations(num,k))\n num1=[]\n for i in range(len(y)):\n num1.append(sum(y[i]))\n print(num1.count(min(num1)))", "# cook your dish here\nimport itertools\nt=int(input())\nfor i in range(t):\n n,k=map(int, input().split())\n num=list(map(int,input().split()))\n y=list(itertools.combinations(num,k))\n num1=[]\n for i in range(len(y)):\n num1.append(sum(y[i]))\n print(num1.count(min(num1)))", "# cook your dish here\nimport itertools\nt=int(input())\nfor i in range(t):\n n,k=map(int, input().split())\n num=list(map(int,input().split()))\n y=list(itertools.combinations(num,k))\n num1=[]\n for i in range(len(y)):\n num1.append(sum(y[i]))\n x=min(num1)\n print(num1.count(x))", "# cook your dish here\nfrom math import factorial\nt=int(input())\nfor i in range(t):\n n,k=map(int,input().split())\n l=list(map(int,input().split()))\n l.sort()\n x=0\n y=0\n if k>0:\n for j in range(n):\n if l[j]==l[k-1] and j<k:\n x+=1\n elif l[j]==l[k-1] and j>=k:\n y+=1\n elif l[j]>l[k-1]:\n break\n s=int((factorial(x+y))//((factorial(x))*factorial(y)))\n print(s)\n else:\n print(1)", "# cook your dish here\nfrom math import factorial\nt=int(input())\nfor i in range(t):\n n,k=list(map(int,input().split()))\n l=list(map(int,input().split()))\n l.sort()\n x=0\n y=0\n for j in range(n):\n if l[j]==l[k-1] and j<k:\n x+=1\n elif l[j]==l[k-1] and j>=k:\n y+=1\n elif l[j]>l[k]:\n break\n s=int((factorial(x+y))//((factorial(x))*factorial(y)))\n print(s)\n", "# cook your dish here\nimport itertools\nt=int(input())\nfor i in range(t):\n n,k=list(map(int, input().split()))\n num=list(map(int,input().split()))\n y=list(itertools.combinations(num,k))\n num1=[]\n for i in range(len(y)):\n num1.append(sum(y[i]))\n x=min(num1)\n print(num1.count(x))\n \n", "# cook your dish here\nimport itertools\nt=int(input())\nfor i in range(t):\n def subset(num,k):\n return(list(itertools.combinations(num,k)))\n n,k=list(map(int, input().split()))\n num=list(map(int,input().split()))\n y=subset(num,k)\n num1=[]\n for i in range(len(y)):\n num1.append(sum(y[i]))\n x=min(num1)\n print(num1.count(x))\n \n"] | {"inputs": [["1", "4 2", "1 2 3 4"]], "outputs": [["1"]]} | INTERVIEW | PYTHON3 | CODECHEF | 8,270 | |
da8ab24da2a99f4a32d97936ec890069 | UNKNOWN | Galileo's latest project involves determining the density of stars in certain regions of the sky. For this purpose he started looking for datasets online, and discovered a dataset on Newton's blog. Newton had decomposed the night sky into a Voronoi tessellation with the generators arranged in a grid. He has stored the number of stars in a Voronoi cell at a position in a matrix that corresponds to the position of the generator in the grid.
This dataset does not directly help Galileo, because he needs to be able to query the number of stars in a rectangular portion of the sky. Galileo tried to write a program that does this on his own, but it turned out to be too slow. Can you help him?
-----Input Format-----
The first line contains two integers n and m that denote the height and width of the matrix respectively. This is followed by n lines each containing m integers each.
The line following this would contain a single integer t, the number of queries to be run. Each query line consists of 4 integers px, py, qx, qy. The first two integers denote the row and column numbers of the upper left corner of the rectangular region, and the second pair of numbers correspond to the lower right corner.
-----Output Format-----
For each query output a single line containing the number of stars in that rectangular region.
-----Example-----
Input:
3 3
10 10 10
10 10 10
10 10 10
4
1 1 1 1
1 1 3 3
2 1 3 3
3 1 3 3
Output:
10
90
60
30 | ["import sys\n\ndef main():\n s=sys.stdin.readline\n n, m = list(map(int, s().split()))\n nums={}\n for i in range(1, n+1):\n nums[i]=list(map(int, s().split()))\n cases=int(s())\n for case in range(cases):\n px, py, qx, qy = list(map(int, s().split()))\n ans=[]\n for i in range(px, qx+1):\n for j in range(py-1, qy):\n ans.append(nums[i][j])\n print(sum(ans))\n\ndef __starting_point():\n main()\n__starting_point()", "arr = {}\ntemp = input().split(\" \")\nn = int(temp[0])\nm = int(temp[1])\nfor i in range(n):\n temp1 = input().split(\" \")\n for j in range(m):\n arr[i ,j] = int(temp1[j])\n\nt = eval(input())\nfor k in range(int(t)):\n temp2 = input().split(\" \")\n x1 = int(temp2[0])\n y1 = int(temp2[1])\n x2 = int(temp2[2])\n y2 = int(temp2[3])\n total = 0\n for l in range(x1,x2+1):\n for m in range(y1,y2+1):\n total = total + arr[l-1,m-1]\n print(total)\n", "m,n = [int(i) for i in input().split()]\na = []\nfor i in range (0,m):\n x = [int(j) for j in input().split()]\n a.append (x)\n\nt = int(input())\nfor ctr in range(0,t):\n sum = 0\n x1, y1, x2, y2 = [int(i)-1 for i in input().split()]\n for i in range(x1, x2+1):\n for j in range(y1,y2+1):\n sum += a[i][j]\n print(sum)\n", "while True:\n try:\n n,m = list(map(int,input().strip().split()))\n matrix = []\n for row in range(n):\n matrix.append(list(map(int,input().strip().split())))\n #for row in matrix: print row\n \n queries = int(input())\n for q in range(queries):\n y1,x1,y2,x2 = list(map(int,input().strip().split()))\n s = 0\n for y in range(y1-1,y2):\n s += sum(matrix[y][x1-1:x2])\n print(s)\n except: break\n"] | {"inputs": [["3 3", "10 10 10", "10 10 10", "10 10 10", "4", "1 1 1 1", "1 1 3 3", "2 1 3 3", "3 1 3 3"]], "outputs": [["10", "90", "60", "30"]]} | INTERVIEW | PYTHON3 | CODECHEF | 1,633 | |
def5e134aff7a921cc1728fab8fa6eaf | UNKNOWN | Striver$Striver$ wants to strive hard in order to reach his goals, hence asks his mentor to give him a question for which he has to strive hard.
The mentor gives Striver$Striver$ a N$N$ X N$N$ matrix consisting of lowercase characters (′a′$'a'$ to ′z′$'z'$) and Q$Q$ queries. Every query consists of X$X$ and Y$Y$. From any position in the matrix, one can either move towards the right or towards down. He asks striver to write down all the paths from (1,1)$(1, 1)$ to (X,Y)$(X, Y)$ and find out which string has the maximum number of character ′a′$'a'$ in it and answer him the number of characters which are not 'a' in that string.
Striver wants to strive hard but also wants to impress his mentor. He asks for your help to answer Q$Q$ queries given by his mentor as fast as he can so that he can impress his mentor also. Can you help him to answer the Q queries?
-----Input:-----
- First line will contain T$T$, number of test cases. Then the test cases follow.
- First line of every test case contains a number N$N$ and Q$Q$ which denotes the dimensions of the matrix and number of queries respectively.
- N lines follow, which contains N numbers each denoting the elements of the matrix.
- Q line follow, every line contains X and Y.
-----Output:-----
For every test case, print a single integer which prints the answer to mentor's every query.
-----Constraints-----
- 1≤T≤10$1 \leq T \leq 10$
- 1≤N≤103$1 \leq N \leq 10^3$
- 1≤Q≤105$1 \leq Q \leq 10^5$
- 1≤X,Y≤N$1 \leq X, Y \leq N$
-----Sample Input:-----
1
3 2
a b a
a c d
b a b
1 3
3 3
-----Sample Output:-----
1
2
-----EXPLANATION:-----
Query-1: There is only one path from (1,1) to (1,3) i.e.,"aba" and the number of characters which are not 'a' is 1.
Query-2: The path which has the maximum number of 'a' in it is "aabab", hence non 'a' characters are 2. | ["a=int(input())\r\nfor _ in range(a):\r\n c,d=list(map(int,input().split()))\r\n crr=[[[0,0] for i in range(c+1)] for j in range(c+1)]\r\n trr=[]\r\n for i in range(c):\r\n kk=list(input().split())\r\n trr.append(kk)\r\n for i in range(1,c+1):\r\n for j in range(1,c+1):\r\n if(trr[i-1][j-1]=='a'):\r\n crr[i][j][0]=max(crr[i-1][j][0],crr[i][j-1][0])+1\r\n if(j==1):\r\n crr[i][j][1]=crr[i-1][j][1]+1\r\n elif(i==1):\r\n crr[i][j][1]=crr[i][j-1][1]+1\r\n elif(crr[i-1][j][0]>crr[i][j-1][0]):\r\n crr[i][j][1]=crr[i-1][j][1]+1\r\n else:\r\n crr[i][j][1]=crr[i][j-1][1]+1\r\n else:\r\n crr[i][j][0]=max(crr[i-1][j][0],crr[i][j-1][0])\r\n if(j==1):\r\n crr[i][j][1]=crr[i-1][j][1]+1\r\n elif(i==1):\r\n crr[i][j][1]=crr[i][j-1][1]+1\r\n elif(crr[i-1][j][0]>crr[i][j-1][0]):\r\n crr[i][j][1]=crr[i-1][j][1]+1\r\n else:\r\n crr[i][j][1]=crr[i][j-1][1]+1\r\n \r\n for i in range(d):\r\n m,n=list(map(int,input().split()))\r\n print(crr[m][n][1]-crr[m][n][0])\r\n \r\n", "t=int(input())\r\nfor _ in range(t):\r\n n,q=list(map(int,input().split()))\r\n main=[[0]*(n+1)]\r\n final=[[0]*(n+1)]\r\n const=[[0]*(n+1)]\r\n for i in range(n):\r\n l=[0]*(n+1)\r\n z=[0]*(n+1)\r\n w=list(input().split())\r\n w.insert(0,0)\r\n final.append(w)\r\n main.append(l)\r\n const.append(z)\r\n\r\n for i in range(1,n+1):\r\n for j in range(1,n+1):\r\n \r\n main[i][j]=max(main[i-1][j],main[i][j-1])\r\n if final[i][j]=='a':\r\n main[i][j]+=1\r\n if main[i-1][j]>main[i][j-1]:\r\n const[i][j]+=const[i-1][j]\r\n else:\r\n const[i][j]+=const[i][j-1]\r\n if final[i][j]!='a':\r\n const[i][j]+=1\r\n \r\n \r\n \r\n for i in range(q):\r\n s,d=list(map(int,input().split()))\r\n print(s+d-1-main[s][d])\r\n \r\n \r\n", "t=int(input())\r\nfor sai in range(t):\r\n n,m=[int(x) for x in input().split()]\r\n a=[]\r\n for i in range(n):\r\n a.append(input().split())\r\n for i in range(n):\r\n for j in range(n):\r\n if(a[i][j]=='a'):\r\n a[i][j]=[1,-1]\r\n else:\r\n a[i][j]=[0,-1]\r\n a[0][0][1]=1\r\n for i in range(1,n):\r\n a[0][i][0]=a[0][i-1][0]+a[0][i][0]\r\n a[0][i][1]=a[0][i-1][1]+1\r\n for i in range(1,n):\r\n a[i][0][0]=a[i-1][0][0]+a[i][0][0]\r\n a[i][0][1]=a[i-1][0][1]+1\r\n\r\n for i in range(1,n):\r\n for j in range(1,n):\r\n if(a[i-1][j][0]>a[i][j-1][0]):\r\n a[i][j][0]=a[i-1][j][0]+a[i][j][0]\r\n a[i][j][1]=a[i-1][j][1]+1\r\n else:\r\n a[i][j][0]=a[i][j-1][0]+a[i][j][0]\r\n a[i][j][1]=a[i][j-1][1]+1\r\n for i in range(m):\r\n p,q=[int(x) for x in input().split()]\r\n print(a[p-1][q-1][1]-a[p-1][q-1][0])\r\n \r\n \r\n \r\n \r\n \r\n"] | {"inputs": [["1", "3 2", "a b a", "a c d", "b a b", "1 3", "3 3"]], "outputs": [["1", "2"]]} | INTERVIEW | PYTHON3 | CODECHEF | 3,442 | |
c2fbb34ee1d420f86627704e1d3cfff8 | UNKNOWN | Chef is stuck in a two dimensional maze having N rows and M columns. He needs to get out of the maze as soon as possible and arrive at the kitchen in order to serve his hungry customers. But, he can get out of the maze only if he is able to successfully find any magical path in the given maze.
A path is defined as magical if it starts from any of the cell (a,b) of the maze and ends at the cell (c,d) such that the following conditions are satisfied :-
- |a - c| + |b - d| = 1
- All the cells in the maze are traversed exactly once.
- It is allowed to move only in the four directions - up, down, left and right from the current cell.
-----Input-----
- First line of the input contains an integer T denoting the number of different types of scenarios.
- Each of the next T lines will contain two integers N, M denoting the dimensions of the maze.
-----Output-----
For each of the T scenarios, output a single line containing "Yes" or "No" (without quotes) denoting whether the Chef can get out of the maze or not.
-----Constraints-----
- 1 ≤ T ≤ 105
- 1 ≤ N, M ≤ 1018
-----Subtasks-----
Subtask #1 : (30 points)
- 1 ≤ T ≤ 100
- 1 ≤ N, M ≤ 10
Subtask #2 : (70 points)
Original Constraints
-----Example-----
Input:
1
2 2
Output:
Yes
-----Explanation-----
Example case 1.
Chef can start from (1,1), move down to (2,1), then move right to (2,2) and finally move upwards to reach (1,2). As, he is able to visit all the cells exactly once and sum of absolute differences of corresponding x and y dimension is 1, we can call this path a magical path. | ["t = eval(input())\nfor _ in range(t):\n n, m = list(map(int, input().split()))\n if n*m == 2:\n print('Yes')\n elif (n*m)%2 == 0 and m != 1 and n != 1:\n print('Yes')\n else:\n print('No')", "t=int(input())\nfor _ in range(t):\n n,m=input().strip().split()\n if (n=='1' and m=='2') or (n=='2' and m=='1'):\n print(\"Yes\")\n elif n=='1' or m=='1':\n print(\"No\")\n elif int(n[-1])%2==0 or int(m[-1])%2==0:\n print(\"Yes\")\n else:\n print(\"No\") ", "t=int(input())\nfor _ in range(t):\n n,m=input().strip().split()\n if (n=='1' and m=='2') or (n=='2' and m=='1'):\n print(\"Yes\")\n elif n=='1' or m=='1':\n print(\"No\")\n elif int(n[-1])%2==0 or int(m[-1])%2==0:\n print(\"Yes\")\n else:\n print(\"No\") ", "t=int(input())\nfor _ in range(t):\n n,m=input().strip().split()\n if (n=='1' and m=='2') or (n=='2' and m=='1'):\n print(\"Yes\")\n elif n=='1' or m=='1':\n print(\"No\")\n elif int(n[-1])%2==0 or int(m[-1])%2==0:\n print(\"Yes\")\n else:\n print(\"No\") ", "t=int(input())\nwhile t>0:\n t-=1\n m,n=list(map(int,input().split()))\n if m==1 and n>2:\n print('No')\n continue\n elif n==1 and m>2:\n print('No')\n continue\n if m%2==0 or n%2==0:\n print('Yes')\n elif m==1 and n==1:\n print('No')\n else:\n print('No')", "t=input()\nt=int(t)\nwhile t>0:\n n,m = input().split()\n \n \n \n if int(n)==1 and int(m)==2 :\n print(\"Yes\")\n elif int(n)==2 and int(m)==1 :\n print(\"Yes\") \n elif int(n)==1 or int(m)==1 :\n print(\"No\")\n elif int(n[-1])%2==0 or int(m[-1])%2==0 :\n print(\"Yes\")\n else : print(\"No\")\n t=t-1 ", "def __starting_point():\n T = int(input())\n\n for i in range(T):\n N, M = list(map(int, input().split()))\n\n if N == 1 and M == 2:\n print(\"Yes\")\n elif M == 1 and N == 2:\n print(\"Yes\")\n elif N == 1 or M == 1:\n print(\"No\")\n elif (N * M) % 2 == 0:\n print(\"Yes\")\n else:\n print(\"No\")\n\n__starting_point()", "t=eval(input())\nwhile t>0:\n a,b=input().split(' ');\n a=int(a)\n b=int(b)\n t-=1\n if a==1 and b==2:\n print(\"Yes\")\n continue\n elif a==2 and b==1:\n print(\"Yes\")\n continue\n elif a==1 or b==1:\n print(\"No\")\n continue\n elif a%2==0 or b%2==0:\n print(\"Yes\")\n continue\n else:\n print(\"No\")\n \n", "def checkval(m,n):\n if m==1:\n if n==2: return 1;\n return 0;\n if n==1:\n if m==2: return 1;\n return 0;\n if (not(n&1) or not(m&1)):\n return 1;\n return 0;\n \nt = int(input())\nwhile t:\n t-=1\n n,m = input().split()\n n = int(n)\n m = int(m)\n if(checkval(m,n)): print(\"Yes\")\n else: print(\"No\")\n \n", "# cook your code here\nt = int(input().strip())\n\nwhile t > 0 :\n t = t - 1\n a , b = [ int(x.strip()) for x in input().split() ]\n \n\n if (a*b)%2 == 0 and a != 1 and b != 1 : \n print(\"Yes\")\n elif ( a == 1 or b == 1 ) and a*b == 2 :\n print(\"Yes\")\n else: \n print(\"No\")", "for i in range(eval(input())):\n a=list(map(int,input().split()))\n a.sort()\n if a[0]==1 and a[1]==2:\n print(\"Yes\")\n elif a[0]==1 and a[1]%2==0:\n print(\"No\")\n elif a[0]!=1 and a[1]%2==0:\n print(\"Yes\")\n elif (a[0]%2==0 and a[1]%2!=0) or (a[1]%2==0 and a[0]%2!=0):\n print(\"Yes\")\n else:\n print(\"No\")\n\n", "t=eval(input())\nwhile t>0:\n t-=1\n r,c=list(map(int,input().split()))\n if ((r==1 and c==2) or (c==1 and r==2)):\n print(\"Yes\")\n elif (r>1 and c>1 and (r%2==0 or c%2==0)):\n print(\"Yes\")\n else:\n print(\"No\")", "# cook your code here\nT = int(input())\nwhile T > 0:\n N,M = list(map(int,input().split()))\n #print N,M\n if N == 1:\n if M == 2:\n print('Yes')\n else:\n print('No')\n elif M == 1:\n if N == 2:\n print('Yes')\n else:\n print('No')\n elif N%2 == 1 and M%2 == 1:\n print('No')\n else:\n print('Yes')\n T = T - 1", "def __starting_point():\n t = int(input())\n while t:\n l = input().split(' ')\n nl = [int(i) for i in l]\n m, n = nl\n if (m == 1 and n > 2) or (n == 1 and m > 2):\n print(\"No\")\n else:\n print(\"No\" if m % 2 and n % 2 else \"Yes\")\n t -= 1\n__starting_point()", "import sys\n\nfor i in range(int(sys.stdin.readline().strip())):\n n, m = list(map(int, sys.stdin.readline().strip().split()))\n \n if n == 1:\n if m == 2:\n print(\"Yes\")\n else:\n print(\"No\")\n elif m == 1:\n if n == 2:\n print(\"Yes\")\n else:\n print(\"No\")\n else:\n if n * m & 1:\n print(\"No\")\n else:\n print(\"Yes\")", "t = int(input(\"\"))\nwhile(t):\n \n a ,b = input().split(\" \")\n a = int(a)\n b = int(b)\n min1 = min(a,b)\n max1 =max(a,b)\n if(min1==1):\n if(max1==2):\n print(\"Yes\")\n else:\n print(\"No\")\n else:\n if(max1%2==0 or min1%2 ==0):\n print(\"Yes\")\n else:\n print(\"No\")\n t -=1 ", "T = int(input())\nwhile (T > 0):\n T -= 1\n N,M = list(map(int, input().split(' ')))\n if N == 1 or M == 1:\n x = max(N, M)\n if x == 1:\n print(\"No\")\n elif x == 2:\n print(\"Yes\")\n else:\n print(\"No\")\n elif M % 2 == 0 or N % 2 == 0:\n print(\"Yes\")\n else:\n print(\"No\")", "def minimumchanges():\n n = int(input().strip())\n for i in range(0,n):\n N,M = list(map(int, input().strip().split(' ')))\n if((N == 1 and M == 2) or (N == 2 and M == 1)):\n print(\"Yes\")\n elif N == 1 or M == 1:\n print(\"No\")\n elif N%2 == 0 or M%2 == 0:\n print(\"Yes\")\n else:\n print(\"No\")\n \n\n\nminimumchanges()", "# cook your code here\nt=int(input())\nwhile(t>0):\n t-=1\n n,m = list(map(int,input().split()))\n if n%2!=0 and m%2!=0:\n print(\"No\")\n elif m==1 and n==2:\n print(\"Yes\")\n elif n==1 and m==2:\n print(\"Yes\")\n elif m<2 or n<2:\n print(\"No\")\n else:\n print(\"Yes\")\n", "for _ in range(eval(input())):\n n,m = list(map(int,input().split()))\n if n*m==1:\n print(\"No\")\n elif (n*m)%2==0:\n if (n==1 and m!=2) or (m==1 and n!=2):\n print(\"No\")\n else:\n print(\"Yes\")\n else:\n print(\"No\") ", "# your code goes here\nt = int(input())\nfor sc in range(t):\n n,m = list(map(int, input().split()))\n if n == 1 or m == 1:\n if n*m == 2:\n print(\"Yes\")\n else:\n print(\"No\")\n elif (n*m) % 2 == 0:\n print(\"Yes\")\n else:\n print(\"No\")", "t = input()\nt = int(t)\nwhile t:\n n,m = input().split()\n n = int(n)\n m = int(m)\n if (n*m)==2:\n print(\"Yes\")\n elif n==1 or m==1:\n print(\"No\")\n elif n%2 == 0 or m%2 ==0:\n print(\"Yes\")\n else:\n print(\"No\") \n \n t-=1"] | {"inputs": [["1", "2 2"]], "outputs": [["Yes"]]} | INTERVIEW | PYTHON3 | CODECHEF | 6,310 | |
830114ee9c4884240160ac61463302ed | UNKNOWN | Little Egor is a huge movie fan. He likes watching different kinds of movies: from drama movies to comedy movies, from teen movies to horror movies. He is planning to visit cinema this weekend, but he's not sure which movie he should watch.
There are n movies to watch during this weekend. Each movie can be characterized by two integers Li and Ri, denoting the length and the rating of the corresponding movie. Egor wants to watch exactly one movie with the maximal value of Li × Ri. If there are several such movies, he would pick a one with the maximal Ri among them. If there is still a tie, he would pick the one with the minimal index among them.
Your task is to help Egor to pick a movie to watch during this weekend.
-----Input-----
The first line of the input contains an integer T denoting the number of test cases.
The first line of the test case description contains an integer n.
The second line of the test case description contains n integers L1, L2, ...,Ln. The following line contains n integers R1, R2, ..., Rn.
-----Output-----
For each test case, output a single integer i denoting the index of the movie that Egor should watch during this weekend. Note that we follow 1-based indexing.
-----Constraints-----
- 1 ≤ T ≤ 5
- 1 ≤ n ≤ 100
- 1 ≤ Li, Ri ≤ 100
-----Example-----
Input:
2
2
1 2
2 1
4
2 1 4 1
2 4 1 4
Output:
1
2
-----Explanation-----
In the first example case, both films have the same value of L × R, but the first film has a better rating.
In the second example case, the second and the fourth movies are equally good, but the second movie has a smaller index. | ["def bestMovie():\n tests=int(input())\n for t in range(tests):\n n = int(input())\n L = list(map(int, input().split()))\n R = list(map(int, input().split()))\n maxIndex = -1\n maxValue = 0\n for i in range(n):\n prod = L[i]*R[i]\n if maxValue < prod:\n maxValue = prod\n maxIndex = i\n elif maxValue == prod:\n if R[maxIndex] < R[i]:\n maxIndex = i\n print(maxIndex+1)\n\nbestMovie()", "__author__ = 'Hacktivist'\n\ntest = int(input())\nfor testCases in range(test):\n n = int(input())\n l = list(map(int, input().split()))\n r = list(map(int, input().split()))\n hackmul = 0\n hackIndex = 0\n hackFound = False\n for item in range(len(l)):\n hackVar = l[item]*r[item]\n if hackVar > hackmul:\n hackmul = l[item]*r[item]\n hackIndex = item\n hackVar = 0\n if hackVar == hackmul:\n hackFound = True\n if hackFound:\n print(r.index(max(r)) + 1)\n else:\n print(hackIndex + 1)", "# cook your code here\nfor tests in range(eval(input())):\n n = eval(input())\n L = list(map(int,input().split()))\n R = list(map(int,input().split()))\n \n pro = 0\n index = 0\n tmp = 1\n r = 0\n for i in range(n):\n tmp = L[i]*R[i]\n \n if(tmp>pro):\n pro = tmp\n index = i+1\n if(tmp==pro):\n if(R[i]>r):\n index = i+1\n r = R[i]\n print(index)", "t = int(input())\n\nfor e in range(t):\n\n n = int(input())\n l_str = input()\n r_str = input()\n\n l_str = l_str.strip().split(\" \")\n r_str = r_str.strip().split(\" \")\n\n lr_str = []\n for x in range(n):\n lr_str.append(int(l_str[x]) * int(r_str[x]))\n\n lr_max = 0\n maxIndex = 0\n for x in range(n):\n if int(lr_str[x]) > lr_max:\n lr_max = lr_str[x]\n maxIndex = x\n\n max_r = 0\n for x in range(n):\n if int(lr_str[x]) == lr_max:\n if int(r_str[x]) > max_r:\n max_r = int(r_str[x])\n maxIndex = x\n\n max_i = 0\n for x in range(n):\n if int(lr_str[x]) == lr_max:\n if int(r_str[x]) == max_r:\n print(x + 1)\n break", "t = int(input())\n\nfor e in range(t):\n\n n = int(input())\n l_str = input()\n r_str = input()\n\n l_str = l_str.strip().split(\" \")\n r_str = r_str.strip().split(\" \")\n\n max_p = 0\n for i in range(len(l_str)):\n if int(l_str[i]) * int(r_str[i]) > max_p:\n max_p = int(l_str[i]) * int(r_str[i])\n\n max_r = 0\n for i in range(len(l_str)):\n if int(l_str[i]) * int(r_str[i]) >= max_p:\n if int(r_str[i]) > max_r:\n max_r = int(r_str[i])\n\n for i in range(len(l_str)):\n if int(l_str[i]) * int(r_str[i]) >= max_p and int(r_str[i]) >= max_r:\n print(i + 1)\n break", "# MOVIEWKN.py\n\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 m = 0;\n for i in range(n):\n m = max(m,a[i]*b[i])\n ans = -1;\n r = 0;\n for i in range(n):\n if m == a[i]*b[i]:\n if r < b[i]:\n ans = i;\n r = b[i];\n print(ans+1);", "# your code goes here\nfor _ in range(eval(input())):\n n=eval(input())\n l=list(map(int,input().split()))\n r=list(map(int,input().split()))\n max1,index,rc=0,0,0\n for i in range(len(l)):\n temp=l[i]*r[i]\n if(max1<temp or (max1==temp and r[i]>rc)):\n max1=temp\n rc=r[i]\n index=i\n print(index+1)\n", "import sys\n\ndef main():\n t=int(input())\n for z in range(t):\n movie=int(input())\n leng=[]\n rating=[]\n opt=[]\n leng=list(map(int, input().split()))\n rating=list(map(int, input().split()))\n\n i=0\n opt.append(leng[i]*rating[i])\n \n index=i\n rate=rating[i]\n value=opt[i]\n \n \n for i in range(1, movie):\n opt.append(leng[i]*rating[i])\n \n if opt[i]>value:\n value=opt[i]\n rate=rating[i]\n index=i\n elif opt[i]==value:\n if rating[i]>rate:\n value=opt[i]\n rate=rating[i]\n index=i\n print(index+1)\nmain()\n \n", "for _ in range(eval(input())):\n n = eval(input())\n l = list(map(int, input().split()))\n r = list(map(int, input().split()))\n max,rat,ind = l[0] * r[0],r[0], 1\n for i in range(1,n):\n if l[i]*r[i] >= max:\n if rat < r[i]:\n max = l[i]*r[i]\n ind = i+1\n rat = r[i]\n print(ind)", "# -*- coding: utf-8 -*-\n\"\"\"\nCreated on Sun Apr 17 21:28:56 2016\n\n@author: Harry\n\"\"\"\nimport collections\nno_of_testcases = int(input())\nfor each in range(no_of_testcases):\n to_watch = []\n length = []\n rating = []\n no_of_movies = int(input())\n length = list(map(int,input().split()))\n rating = list(map(int,input().split()))\n for e in range(no_of_movies):\n l_x_r = length[e]*rating[e]\n to_watch.append(l_x_r)\n counter = collections.Counter(to_watch)\n test = max(counter.keys())\n if counter[test] > 1:\n rating_indexes = [0]\n i = 0\n for x in to_watch:\n if x == test:\n if rating[i] > rating_indexes[0]:\n high_ratng = rating[i]\n rating_indexes = [high_ratng]\n i = i+1\n print(rating.index(high_ratng) +1)\n else:\n print(to_watch.index(test)+1)\n \n \n", "def find_movie(T,R):\n e = []\n for d in range(len(T)):\n f = [] \n f.append(int(T[d])*int(R[d]))\n f.append(int(R[d]))\n f.append(int(T[d]))\n e.append(f)\n max_val = []\n max_val = max(e)\n index = e.index(max_val)\n return (index+1) \n \nt = int(input())\nfor x in range(t):\n n = int(input())\n timing = []\n timing = str(input())\n timing = timing.split()\n rating = []\n rating = str(input())\n rating = rating.split()\n index = find_movie(timing,rating)\n print(index)\n \n", "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 c=[]\n for j in range(len(a)):\n c.append(a[j]*b[j])\n #print c.index(max(c))\n mx=max(c)\n ndx=[]\n temp=[]\n for j in range(len(c)):\n if c[j]==mx:\n ndx.append(j)\n for j in ndx:\n temp.append(b[j])\n print(b.index(max(temp))+1)\n", "t=int(input())\nfor i in range(t):\n n=int(input())\n l=list(map(int,input().split()))\n r=list(map(int,input().split()))\n maxv=-1\n for i in range(n):\n a=l[i]*r[i]\n if a >= maxv:\n if a==maxv:\n if prevr < r[i]:\n index=i\n prevr=r[i]\n else:\n index=i\n prevr=r[i]\n maxv=a\n print(index+1)\n", "for t in range(eval(input())):\n n = eval(input())\n l = list(map(int, input().split()))\n r = list(map(int, input().split()))\n lr = []\n for i in range(n):\n lr.append(l[i]* r[i])\n maxim = max(lr)\n index = -1\n maxR = -1\n for i, value in enumerate(lr):\n if maxim == value :\n if maxR < r[i]:\n maxR = r[i]\n index = i\n\n print(index+1)", "T=int(input())\nfor i in range(T):\n N=int(input())\n l=list(map(int,input().split()))\n r=list(map(int,input().split()))\n maxi=0\n index_min=0\n ratmax=0\n for j in range(N):\n prod=l[j]*r[j]\n if(prod>maxi):\n maxi=prod\n index_min=j\n ratmax=r[j]\n elif(prod==maxi):\n if(r[j]>ratmax):\n ratmax=r[j]\n index_min=j\n print(index_min+1)", "for _ in range(int(input())):\n n=int(input())\n L=list(map(int,input().split()))\n R=list(map(int,input().split()))\n pos=0\n Rmax=R[0]\n maxx=0\n for i in range(n):\n temp=L[i]*R[i]\n \n if temp>maxx:\n maxx=temp\n Rmax=R[i]\n pos=i\n \n elif temp==maxx:\n if R[i]>Rmax:\n Rmax=R[i]\n pos=i\n print(pos+1)\n \n \n \n", "t = int(input())\nwhile t:\n n = int(input())\n l = list(map(int, input().split()))\n r = list(map(int, input().split()))\n i = 0\n m = 1\n LR = [0,0]\n I = 0\n while i<n:\n if l[i] * r[i] > m:\n m = l[i] * r[i]\n LR = [l[i],r[i]]\n I = i\n elif LR[1] < r[i] and l[i] * r[i] == m:\n m = l[i] * r[i]\n LR = [l[i],r[i]]\n I = i\n i += 1\n print(I+1)\n t -= 1\n \n\n", "t=eval(input())\nfor i in range(t):\n big=[0,0]\n n=eval(input())\n a=list(map(int,input().strip().split(' ')))\n b=list(map(int,input().strip().split(' ')))\n for k in range(n):\n if a[k]*b[k]>big[0]:\n big[0]=a[k]*b[k]\n big[1]=b[k]\n c=k+1\n elif a[k]*b[k]==big[0]:\n if big[1]<b[k]:\n c=k+1\n big[1]=b[k]\n print(c)", "t = int(input())\nfor test in range(t):\n n = int(input())\n l = list(map(int,input().split()))\n r = list(map(int,input().split()))\n m = -1\n rv = -1\n t = -1\n for x in range(n):\n if t < l[x]*r[x]:\n m = x+1\n t = l[x]*r[x]\n rv = r[x]\n elif t == l[x]*r[x]:\n if rv < r[x]:\n m = x+1\n t = l[x]*r[x]\n rv = r[x]\n print(m)"] | {"inputs": [["2", "2", "1 2", "2 1", "4", "2 1 4 1", "2 4 1 4"]], "outputs": [["1", "2"]]} | INTERVIEW | PYTHON3 | CODECHEF | 8,162 | |
77a95c5a2505b9267d028a33d5d5fbc3 | UNKNOWN | Find sum of all the numbers that are multiples of 10 and are less than or equal to a given number "N". (quotes for clarity and be careful of integer overflow)
-----Input-----
Input will start with an integer T the count of test cases, each case will have an integer N.
-----Output-----
Output each values, on a newline.
-----Constraints-----
- 1 ≤ T ≤ 10
- 1 ≤ N ≤1000000000
-----Example-----
Input:
1
10
Output:
10
-----Explanation-----
Example case 1. Only integer that is multiple 10 that is less than or equal to 10 is 10 | ["for t in range(eval(input())):\n n=eval(input())\n n-=n%10\n n/=10\n print(n*(n+1)/2*10)", "def tenn():\n t=eval(input())\n for i in range(t):\n a=eval(input())\n r=a/10\n t=(r*(r+1))/2\n print(t*10)\ntenn()\n", "t = int(input())\nl = list()\n\nfor i in range(t):\n n = int(input()) / 10\n l.append(n)\n \nfor n in l:\n print(int(n * (n + 1) / 2.0 * 10))\n", "\ndef main():\n t=int(input())\n while(t!=0):\n t=t-1\n N=int(input())\n print(5*int(N/10)*(int(N/10)+1))\n return(0)\n\nmain()", "t=int(input())\nwhile t:\n n=int(input())\n t-=1\n r=n/10\n r=10*(r*(r+1))/2\n print(r)"] | {"inputs": [["1", "10"]], "outputs": [["10"]]} | INTERVIEW | PYTHON3 | CODECHEF | 589 | |
485168bede73448727f9fc9db39205bb | UNKNOWN | Chef and his girlfriend are going to have a promenade. They are walking along the straight road which consists of segments placed one by one. Before walking Chef and his girlfriend stay at the beginning of the first segment, they want to achieve the end of the last segment.
There are few problems:
- At the beginning Chef should choose constant integer - the velocity of mooving. It can't be changed inside one segment.
- The velocity should be decreased by at least 1 after achieving the end of some segment.
- There is exactly one shop on each segment. Each shop has an attractiveness. If it's attractiveness is W and Chef and his girlfriend move with velocity V then if V < W girlfriend will run away into the shop and the promenade will become ruined.
Chef doesn't want to lose her girl in such a way, but he is an old one, so you should find the minimal possible velocity at the first segment to satisfy all conditions.
-----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 segments. The second line contains N space-separated integers W1, W2, ..., WN denoting the attractiveness of shops.
-----Output-----
- For each test case, output a single line containing the minimal possible velocity at the beginning.
-----Constraints-----
- 1 ≤ T ≤ 10
- 1 ≤ N ≤ 10^5
- 1 ≤ Wi ≤ 10^6
-----Example-----
Input:
2
5
6 5 4 3 2
5
3 4 3 1 1
Output:
6
5
-----Explanation-----
Example case 1.
If we choose velocity 6, on the first step we have 6 >= 6 everything is OK, then we should decrease the velocity to 5 and on the 2nd segment we'll receive 5 >= 5, again OK, and so on.
Example case 2.
If we choose velocity 4, the promanade will be ruined on the 2nd step (we sould decrease our velocity, so the maximal possible will be 3 which is less than 4). | ["T = int(input())\nfor i in range(T):\n x = int(input())\n l= [int(x) for x in input().split()]\n t=[]\n for i in range(len(l)):\n t.append(l[i]+i) \n print(max(t))", "# cook your dish here\nt=int(input())\nwhile t:\n t=t-1\n n = int(input())\n l = list(map(int,input().split()))\n l.reverse()\n c = 0\n for i in range(n):\n if(c>=l[i]):\n pass\n else:\n c = l[i]\n c = c+1\n print(c-1)", "# cook your dish here\nfor i in range(int(input())):\n n = int(input())\n l = list(map(int,input().split()))\n l.reverse()\n c = 0\n for i in range(n):\n if(c>=l[i]):\n pass\n else:\n c = l[i]\n c = c+1\n print(c-1)\n \n", "T = int(input())\nfor i in range(T):\n x = int(input())\n l= [int(x) for x in input().split()]\n t=[]\n for i in range(len(l)):\n t.append(l[i]+i) \n print(max(t))\n", "for _ in range(int(input())):\n n=int(input())\n l=[int(x) for x in input().split()]\n l.reverse();\n x=l[0]\n x=x+1\n for i in range(1,n):\n x=max(x,l[i])\n x+=1\n print(x-1)", "for _ in range(int(input())):\n n=int(input())\n l=[int(x) for x in input().split()]\n l.reverse()\n x=l[0]\n x=x+1 \n for i in range(1,n):\n x=max(x,l[i])\n x=x+1 \n print(x-1)\n \n", "t=int(input())\nwhile(t>0):\n n=int(input())\n l=list(map(int,input().split()))\n ans=l[0]\n for i in range(1,n):\n ans=max(ans,l[i]+i)\n print(ans)\n t-=1", "# cook your dish here\nfor _ in range(0,int(input())):\n n=int(input())\n l=list(map(int,input().split()))\n a=[]\n for i in range(0,n):\n a.append(i+l[i])\n a.sort(reverse=True)\n print(a[0])", "# cook your dish here\nt=int(input())\nfor _ in range(t):\n n=int(input())\n m=list(map(int,input().split()))\n temp,speed=m[0],m[0]\n for i in range(1,n):\n if temp<m[i]:\n speed+=m[i]-temp\n temp=speed-i-1\n else:\n temp-=1 \n print(speed)\n \n", "t = int(input())\nwhile t:\n t -= 1 \n n = int(input()) \n L = [int(x) for x in input().split()]\n L.reverse()\n count = 0 \n for i in range(n):\n if L[i] > count:\n count = L[i]\n count += 1 \n print(count-1)", "case = int(input())\nfor i in range(case):\n n = int(input())\n ls = list(map(int,input().split()))\n ls.reverse()\n cnt = 0\n for j in range(n):\n if cnt >= ls[j]:\n pass\n else :\n cnt = ls[j]\n cnt += 1\n print(cnt-1)", "# cook your dish here\nt=int(input())\nfor _ in range(t):\n n=int(input())\n l = list(map(int,input().split()))\n \n temp,speed = l[0],l[0]\n \n for i in range(1,n):\n \n if temp < l[i]:\n \n speed += l[i] - temp\n temp = speed-i-1\n \n else:\n temp -= 1\n \n print(speed)", "# cook your dish here\nt=int(input())\nfor _ in range(t):\n n=int(input())\n l = list(map(int,input().split()))\n \n temp,speed = l[0],l[0]\n \n for i in range(1,n):\n \n if temp < l[i]:\n \n speed += l[i] - temp\n temp = speed-i-1\n \n else:\n temp -= 1\n \n print(speed)", "def find(arr):\n hello=[]\n for i in range(len(arr)):\n hello.append(arr[i]+i)\n return max(hello)\n\nt = int(input())\nfor i in range(t):\n n = int(input())\n arr = list(map(int, input().strip().split()))\n print(find(arr))", "for i in range(int(input())):\n x=int(input())\n l= [ int(x) for x in input().split()]\n t=[]\n for i in range(len(l)):\n t.append(l[i]+i)\n print(max(t))\n# cook your dish here\n", "for _ in range(int(input())):\n n=int(input())\n ar=[int(x) for x in input().split()]\n an=max(ar)\n d=1\n for i in range(1,n):\n if an-d<ar[i]:\n an+=ar[i]-(an-d)\n d+=1\n print(an)\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 m=l[0]\n index=0\n for i in range(len(l)-1,-1,-1):\n if l[i]+i>m:\n index=i\n m=l[i]+i\n \n \n print(m)\n", "# cook your dish here\nfor i in range(int(input())):\n n = int(input())\n arr = list(map(int, input().split()))\n res = []\n for i in range(n):\n res.append(arr[i]+i)\n print(max(res)) ", "for _ in range(int(input())):\n n = int(input())\n lis = list(map(int,input().split()))\n maxx = []\n for i in range(n):\n maxx.append(lis[i]+i)\n print(max(maxx))", "T = int(input())\nans = []\n\nfor _ in range(T):\n N = int(input())\n W = [int(i) for i in input().split()]\n\n for i in range(N):\n W[i] += i\n\n ans.append(max(W))\n\nfor i in ans:\n print(i)\n", "t = int(input())\nfor _ in range(t):\n n = int(input())\n wlist = list(map(int, input().split()))\n maxi = 0\n for j in range(0,n):\n if wlist[j] + j > maxi:\n maxi = wlist[j] + j\n print(maxi)\n", "for _ in range(int(input())):\n n=int(input())\n a=list(map(int,input().split()))\n a=a[::-1]\n m=0\n b=[i for i in a]\n for i in range(1,n):\n b[i]=b[i-1]+1\n for i in range(n):\n m=max(m,a[i]-b[i])\n print(max(b[n-1]+m,b[n-1]))", "for _ in range(int(input())):\n input()\n a = list(map(int, input().split()))\n print(max(a[i]+i for i in range(len(a))))\n", "for _ in range(int(input())):\n N=int(input())\n arr=list(map(int,input().split()))\n s=[]\n for i in range(len(arr)):\n s.append(arr[i]+i)\n print(max(s))", "t=int(input().strip())\nfor _ in range(t):\n n = int(input().strip())\n w = list(map(int,input().strip().split(\" \")))\n ans = 0\n for i in range(len(w)):\n ans = max(w[i]+i,ans)\n print(ans)"] | {"inputs": [["2", "5", "6 5 4 3 2", "5", "3 4 3 1 1"]], "outputs": [["6", "5"]]} | INTERVIEW | PYTHON3 | CODECHEF | 5,129 | |
cbb23b951d0873f927cbfde03854127e | UNKNOWN | Dhiraj loves Chocolates.He loves chocolates so much that he can eat up to $1000$ chocolates a day. But his mom is fed up by this habit of him and decides to take things in her hand.
Its diwali Season and Dhiraj has got a lot of boxes of chocolates and Dhiraj's mom is afraid that dhiraj might eat all boxes of chocolates.
So she told Dhiraj that he can eat only exactly $k$ number of chocolates and dhiraj has to finish all the chocolates in box selected by him and then move on to next box of chocolate.Now Dhiraj is confused that whether he will be able to eat $k$ number of chocolates or not. Since dhiraj is weak at maths,he asks for your help to tell him whether he can eat $k$ number of chocolates or not.
So given number of chocolates are $k$ which dhiraj has to eat and the boxes of chocolates each containing some number of chocolates, tell whether dhiraj will be able to eat $k$ number of chocolates or not.
-----Input:-----
- First line will contain $T$, number of testcases. Then the testcases follow.
- $k$, representing the number of chocolates dhiraj has to eat.
- the third line contains $N$ representing the no. of boxes of chocolates.
- fourth line contains list of $a[]$ size $N$ specifying the number of chocolates in each Box.
-----Output:-----
- For each testcase, output in a single line answer $0$ or $1$.
- $0$ if dhiraj cant eat $k$ chocolates from given combination and $1$ if he can eat $k$ chocolates from given combination.
-----Constraints-----
- $1 \leq T \leq 100$
- $1 \leq K \leq 10^7$
- $1 \leq N \leq 800$
- $1 \leq a[i] \leq 10^3$
-----Sample Input:-----
2
20
5
8 7 2 10 5
11
4
6 8 2 10
-----Sample Output:-----
1
0 | ["def isSubsetSum(arr, n, sum): \n subset = [ [False for j in range(sum + 1)] for i in range(3) ] \n for i in range(n + 1): \n for j in range(sum + 1): \n if (j == 0):subset[i % 2][j] = True\n elif (i == 0):subset[i % 2][j] = False\n elif (arr[i - 1] <= j):subset[i % 2][j] = subset[(i + 1) % 2][j - arr[i - 1]] or subset[(i + 1)% 2][j] \n else:subset[i % 2][j] = subset[(i + 1) % 2][j] \n return subset[n % 2][sum] \nfor _ in range(int(input())):\n k,n,a = int(input()),int(input()),list(map(int,input().split()))\n if sum(a) < k or k < min(a):print(0);continue\n print(1) if isSubsetSum(a, n, k) else print(0)", "def isSubsetSum(arr, n, sum): \n \n # The value of subset[i%2][j] will be true \n # if there exists a subset of sum j in \n # arr[0, 1, ...., i-1] \n subset = [ [False for j in range(sum + 1)] for i in range(3) ] \n \n for i in range(n + 1): \n for j in range(sum + 1): \n # A subset with sum 0 is always possible \n if (j == 0): \n subset[i % 2][j] = True\n \n # If there exists no element no sum \n # is possible \n elif (i == 0): \n subset[i % 2][j] = False\n elif (arr[i - 1] <= j): \n subset[i % 2][j] = subset[(i + 1) % 2][j - arr[i - 1]] or subset[(i + 1) \n % 2][j] \n else: \n subset[i % 2][j] = subset[(i + 1) % 2][j] \n \n return subset[n % 2][sum] \n\t\t\n# Driver program to test above function \nfor _ in range(int(input())):\n k = int(input())\n n = int(input())\n a = list(map(int,input().split()))\n if sum(a) < k or k < min(a):\n print(0)\n continue\n if (isSubsetSum(a, n, k) == True): \n\t print(1) \n else: \n\t print(0)", "def isSubsetSum(set, n, sum):\r\n # The value of subset[i][j] will be\r\n # true if there is a \r\n # subset of set[0..j-1] with sum equal to i \r\n subset = ([[False for i in range(sum + 1)]\r\n for i in range(n + 1)])\r\n\r\n # If sum is 0, then answer is true \r\n for i in range(n + 1):\r\n subset[i][0] = True\r\n\r\n # If sum is not 0 and set is empty, \r\n # then answer is false \r\n for i in range(1, sum + 1):\r\n subset[0][i] = False\r\n\r\n # Fill the subset table in botton up manner \r\n for i in range(1, n + 1):\r\n for j in range(1, sum + 1):\r\n if j < set[i - 1]:\r\n subset[i][j] = subset[i - 1][j]\r\n if j >= set[i - 1]:\r\n subset[i][j] = (subset[i - 1][j] or\r\n subset[i - 1][j - set[i - 1]])\r\n\r\n # uncomment this code to print table\r\n # for i in range(n + 1): \r\n # for j in range(sum + 1): \r\n # print(subset[i][j], end =\" \") \r\n # print() \r\n return subset[n][sum]\r\n\r\nfor _ in range(int(input())):\r\n K = int(input())\r\n N = int(input())\r\n array = list(map(int, input().split()))\r\n if K > sum(array):\r\n print(0)\r\n elif isSubsetSum(array, N , K):\r\n print(1)\r\n else:\r\n print(0)"] | {"inputs": [["2", "20", "5", "8 7 2 10 5", "11", "4", "6 8 2 10"]], "outputs": [["1", "0"]]} | INTERVIEW | PYTHON3 | CODECHEF | 3,321 | |
787a0123d8b523fecfb9a36a7d22b9b7 | UNKNOWN | The chef is trying to solve 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 50$
- $1 \leq K \leq 50$
-----Sample Input:-----
4
1
3
5
7
-----Sample Output:-----
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
-----EXPLANATION:-----
No need, else pattern can be decode easily. | ["def func(num):\r\n for i in range(num):\r\n if i < num//2 + 1:\r\n print(' '*i, end='')\r\n print('*')\r\n else:\r\n print(' '*(num-i-1), end='')\r\n print('*')\r\n\r\n\r\n\r\nfor _ in range(int(input())):\r\n num = int(input())\r\n func(num)\r\n", "# cook your dish here\nT=int(input())\n\nfor _ in range(T):\n \n K=int(input())\n V=(K+1)//2\n\n for i in range(1,V+1):\n line=''\n for j in range(1,i+1):\n if j==i:\n line=line+'*'\n else:\n line=line+' '\n print(line)\n\n for i in range(V-1,0,-1):\n line=''\n for j in range(1,i+1):\n if j==i:\n line=line+'*'\n\n else:\n line=line+' '\n\n print(line)", "t=int(input())\nwhile(t):\n n=int(input())\n p=int(n/2)\n p=p+1\n for i in range(0,p):\n for j in range(0,i):\n if(j>=0):\n print(end=\" \")\n print(\"*\")\n p=p-2\n for i in range(p,0,-1):\n for j in range(0,i):\n print(end=\" \")\n print(\"*\")\n \n if(n>1):\n print(\"*\")\n t=t-1\n", "for _ in range(int(input())):\n n=int(input())\n x=0\n for _ in range(1,n+1):\n if _<=(n+1)//2:\n print(' '*x,end=\"\")\n print('*')\n x+=1\n else:\n if _==((n+1)//2)+1:\n x=x-2\n print(' '*x,end=\"\")\n print('*')\n x-=1\n \n \n ", "# cook your dish here\nfor _ in range(int(input())):\n n = int(input())\n count = 0\n for i in range(n):\n for j in range(count):\n print(\" \",end=\"\")\n print(\"*\")\n if i<n//2:\n count += 1\n else:\n count -= 1", "# cook your dish here\nfor i in range(int(input())):\n n=int(input())\n a=(n//2)+1\n l=a-2\n for j in range(1,a+1):\n space=j-1\n print(' '*space,end='')\n print('*')\n for j in range(a+1,n+1):\n space=l\n print(' '*space,end='')\n print('*')\n l-=1\n ", "# cook your dish here\nfor _ in range(int(input())):\n n = int(input())\n for i in range(n//2 +1):\n for j in range(i):\n print(' ',end = '')\n print('*')\n for i in range(n//2 -1,0,-1):\n for j in range(i):\n print(' ',end = '')\n print('*')\n if(n>1):\n print('*')", "for _ in range(int(input())):\r\n n = int(input())\r\n print('*')\r\n for i in range(1, n // 2):\r\n print(' ' * (i) + '*')\r\n for i in range(n // 2, 0, -1):\r\n print(' ' * (i) + '*')\r\n if n > 1:\r\n print('*')\r\n", "# cook your dish here\n# cook your dish here\ndef solve():\n n = int(input())\n #n,m = input().split()\n #n = int(n)\n #m = int(m)\n #s = input()\n #a = list(map(int, input().split()))\n k=n//2\n for i in range(n):\n j=0\n if i<=k : z=i\n else: z=n-i-1\n while j!=z :\n print(\" \",end=\"\")\n j+=1\n print(\"*\")\n \n \n \n \ndef __starting_point():\n T = int(input())\n for i in range(T):\n #a = solve()\n #n = len(a)\n #for i in range(n):\n # if i==n-1 : print(a[i])\n # else: print(a[i],end=\" \")\n (solve())\n__starting_point()", "# cook your dish here\nfor _ in range(int(input())):\n n=int(input())\n mid=n//2\n for i in range(n):\n if(i>mid):\n break\n print(\" \"*i+\"*\")\n \n for i in range(mid-1,-1,-1):\n print(\" \"*i+\"*\")", "def solve(n):\r\n if n == 1:\r\n print('*')\r\n return\r\n s = 0\r\n ms = n//2\r\n o = 1\r\n for i in range(n):\r\n if s==ms:\r\n o = -1\r\n x = '*'\r\n x = x.rjust(1+s)\r\n s+=o\r\n print(x)\r\n\r\ndef main():\r\n t = int(input())\r\n for i in range(t):\r\n n = int(input())\r\n solve(n)\r\nmain()\r\n\r\n", "# cook your dish here\n\nfor _ in range(int(input())):\n n=int(input())\n for i in range(n):\n if i<(n//2):\n print(' '*i,end='')\n else:\n print(' '*(n-i-1),end=\"\")\n\n print(\"*\")", "# cook your dish here\ndef f(n):\n if n==1:\n print('*')\n return\n if n==2:\n print('*')\n print(\"*\")\n return\n k=n//2\n j=2 \n print('*')\n while j<=k:\n print(j*\" \"+\"*\")\n j+=1\n while j>1:\n print(j*\" \"+'*')\n j-=1\n print(\"*\")\n return\n\n\n\n\nt=int(input())\nfor i in range(t):\n n=int(input())\n f(n)\n", "def f(n):\n # odd number is 2k + 1\n k = (n+1) // 2\n line = lambda i: print(\" \"*(i-1) + \"*\")\n \n for i in range(1, k+1):\n line(i)\n i = k-1\n while i>0:\n line(i)\n i -= 1\n \nt = int(input())\nquestions = list()\nfor _ in range(t):\n n = int(input())\n questions.append(n)\n\nfor question in questions:\n f(question)", "import sys\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\nfor _ in range(int(input())):\n n = int(input())\n k = 0\n for i in range(n//2+1):\n for i in range(k):\n print(\" \", end =\"\")\n print(\"*\")\n k = k+1\n #print(\"*\")\n k = k-2\n for i in range(n//2):\n for i in range(k):\n print(\" \",end=\"\")\n print(\"*\")", "t = int(input())\r\nfor _ in range(t):\r\n n = int(input())\r\n\r\n k = n//2 + 1\r\n \r\n ans = [[\" \" for i in range(k) ] for j in range(n)]\r\n \r\n for i in range(k):\r\n ans[i][i] = \"*\"\r\n\r\n c = k-2\r\n\r\n for i in range(k,n):\r\n\r\n ans[i][c] = '*'\r\n c-=1\r\n\r\n for i in range(n):\r\n for j in range(k):\r\n print(ans[i][j],end=\" \")\r\n\r\n print()\r\n", "# cook your dish here\nfor _ in range(int(input())):\n n=int(input())\n for i in range((n+1)//2):\n for j in range(i):\n print(end=\" \") \n print(\"*\\r\")\n \n for i in range((n//2)-1,-1,-1):\n for j in range(i):\n print(end=\" \") \n print(\"*\\r\")\n\n\n\n \n ", "# cook your dish here\nt = int(input())\nwhile(t):\n n = int(input())\n for i in range (1,n+1):\n if(i==1 or i==n):\n print(\"*\")\n continue\n print(\" \"*min(i-1, n-i) + \"*\")\n t -= 1\n \n \n", "# cook your dish here\nfor _ in range(int(input())):\n n = int(input())\n space = 0\n for i in range(n):\n print(i * \" \", end=\"\")\n print(\"*\")\n", "t = int(input())\nfor _ in range(t):\n k = int(input())\n for i in range(k):\n for j in range(int(k/2)+1):\n if i <= j:\n if i==j:\n print('*',end='')\n elif i<j:\n print(' ',end='')\n else:\n if i+j==k-1:\n print('*',end='')\n elif i>j:\n print(' ',end='')\n print()\n", "for _ in range(int(input())):\r\n n=int(input())\r\n r=(n+1)//2\r\n dr=[]\r\n for i in range(r):\r\n t=\" \"*i +\"*\"\r\n dr.append(t)\r\n\r\n for i in range(r):\r\n print(dr[i])\r\n for i in range(r-2,-1,-1):\r\n print(dr[i])", "# cook your dish here\nt = int(input())\nfor _ in range(t):\n k =int(input())\n i = 0\n l = k-1\n for j in range(k):\n print((\" \"*min(i,l))+\"*\")\n i += 1\n l -= 1\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# segment tree for range minimum query\r\n# sys.setrecursionlimit(10**5)\r\n# n = int(input())\r\n# a = list(map(int,input().split()))\r\n# st = [float('inf') for i in range(4*len(a))]\r\n# def build(a,ind,start,end):\r\n# if start == end:\r\n# st[ind] = a[start]\r\n# else:\r\n# mid = (start+end)//2\r\n# build(a,2*ind+1,start,mid)\r\n# build(a,2*ind+2,mid+1,end)\r\n# st[ind] = min(st[2*ind+1],st[2*ind+2])\r\n# build(a,0,0,n-1)\r\n# def query(ind,l,r,start,end):\r\n# if start>r or end<l:\r\n# return float('inf')\r\n# if l<=start<=end<=r:\r\n# return st[ind]\r\n# mid = (start+end)//2\r\n# return min(query(2*ind+1,l,r,start,mid),query(2*ind+2,l,r,mid+1,end))\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\ntc = 1\r\ntc, = inp()\r\nfor _ in range(tc):\r\n n, = inp()\r\n for i in range(n//2):\r\n print(' '*i+'*')\r\n print()\r\n print(' '*(n//2)+'*')\r\n for i in range(n//2-1,-1,-1):\r\n print()\r\n print(' '*i+'*')\r\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 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 (j>=i and i==j):\n print(\"*\",end=\"\")\n else:\n print(\" \",end=\"\")\n print()"] | {"inputs": [["4", "1", "3", "5", "7"]], "outputs": [["*", "*", "*", "*", "*", "*", "*", "*", "*", "*", "*", "*", "*", "*", "*", "*"]]} | INTERVIEW | PYTHON3 | CODECHEF | 12,072 | |
fbb5e7a2c7489af423034163d9f35578 | UNKNOWN | The Petrozavodsk camp takes place in about one month. Jafar wants to participate in the camp, but guess what? His coach is Yalalovichik.
Yalalovichik is a legendary coach, famous in the history of competitive programming. However, he is only willing to send to the camp students who solve really hard problems on Timus. The deadline that Yalalovichik set before has passed and he refuses to send Jafar to the camp.
Jafar decided to make Yalalovichik happy in hopes of changing his decision, so he invented a new sequence of numbers and named them Yalalovichik numbers. Jafar is writing a research paper about their properties and wants to publish it in the Science Eagle yearly journal.
A Yalalovichik number is created in the following way:
- Consider an integer $N$ in decimal notation; let's call it the base of the Yalalovichik number $Y_N$. $N$ may not contain the digit $0$.
- Treat $N$ as a decimal string. Compute all left shifts of this string $N_0, N_1, \ldots, N_{|N|-1}$ ($|N|$ denotes the number of digits of $N$); specifically, $N_k$ denotes the string formed by moving the first $k$ digits of $N$ to the end in the same order.
- Concatenate the strings $N_0, N_1, \ldots, N_{|N|-1}$. The resulting string is the decimal notation of $Y_N$.
For example, if $N = 123$, the left shifts are $123, 231, 312$ and thus $Y_N = 123231312$.
You are given the base $N$. Calculate the value of $Y_N$ modulo $10^9+7$.
-----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 decimal integer $N$.
-----Output-----
For each test case, print a single line containing one integer — the value of the Yalalovichik number $Y_N$ modulo $10^9+7$.
-----Constraints-----
- $1 \le T \le 200$
- $|N| \le 10^5$
- $N$ does not contain the digit $0$
- the sum of $|N|$ over all test cases does not exceed $10^6$
-----Example Input-----
1
123
-----Example Output-----
123231312 | ["M = 10 ** 9 + 7\nfor _ in range(int(input())):\n s,p,m,r = list(map(int, input())),0,1,0\n for d in reversed(s):\n p += d * m\n m = m * 10 % M\n for d in s:\n r = (r * m + p) % M\n p = (p * 10 - (m - 1) * d) % M\n print(r)", "M = 10 ** 9 + 7\n\nt = int(input())\nfor _ in range(t):\n s = list(map(int, input()))\n p, m = 0, 1\n for d in reversed(s):\n p += d * m\n m = m * 10 % M\n r = 0\n for d in s:\n r = (r * m + p) % M\n p = (p * 10 - (m - 1) * d) % M\n print(r)\n\n ", "T=int(input())\r\nm=10**9+7\r\nwhile(T>0):\r\n\r\n num=list(map(int,input()))\r\n n=0\r\n for i in range(len(num)):\r\n n=(n*10)\r\n n=(n+num[i])%m\r\n rs=n\r\n y=10**(len(num))%m\r\n for i in range(len(num)-1):\r\n n=(n*10-(y-1)*num[i])%m\r\n rs=(rs*(y)+n)%m\r\n print(rs)\r\n T-=1", "m=10**9+7\r\nT=int(input())\r\nwhile(T>0):\r\n num=list(map(int,input()))\r\n n=0\r\n for i in range(len(num)):\r\n n=(n*10)%m\r\n n=(n+num[i])%m\r\n rs=n\r\n y=10**(len(num))%m\r\n for i in range(len(num)-1):\r\n n=(n*10-(y-1)*num[i])%m\r\n rs=(rs*(y)+n)%m\r\n print(rs)\r\n T-=1", "M = 10 ** 9 + 7\nfor _ in range(int(input())):\n s = list(map(int, input()))\n p, m = 0, 1\n for d in reversed(s):\n p += d * m\n m = m * 10 % M\n r = 0\n for d in s:\n r = (r * m + p) % M\n p = (p * 10 - (m - 1) * d) % M\n print(r)", "M = 10 ** 9 + 7\n\nt = int(input())\nfor _ in range(t):\n s = list(map(int, input()))\n p, m = 0, 1\n for d in reversed(s):\n p += d * m\n m = m * 10 % M\n r = 0\n for d in s:\n r = (r * m + p) % M\n p = (p * 10 - (m - 1) * d) % M\n print(r)", "t = int(input())\r\ndecimal = [1]\r\nmod = 10**9 + 7\r\nfor i in range(10**5 + 1):\r\n decimal.append((decimal[-1]*10) % mod)\r\n\r\n\r\ndef num(n):\r\n ans = 0\r\n length = len(n)\r\n for i in range(0, length):\r\n ans += (int(n[i])*decimal[length - i - 1])%mod\r\n\r\n return ans\r\n\r\n\r\nfor i in range(0, t):\r\n n = input()\r\n length = len(n)\r\n p = (10 ** length)%mod\r\n p1 = (10 ** (length-1))%mod\r\n mul = [1]\r\n for j in range(0, length-1):\r\n mul.append((mul[-1]*p)%mod)\r\n value = num(n)\r\n\r\n ans = 0\r\n for j in range(length-1, -1, -1):\r\n temp = (value * mul[j])%mod\r\n ans += temp\r\n value = value - int(n[length - 1 - j]) * p1\r\n value = (value * 10 + int(n[length - 1 - j])) % mod\r\n print(ans%mod)", "M = 10 ** 9 + 7\n\nt = int(input())\nfor _ in range(t):\n s = list(map(int, input()))\n p, m = 0, 1\n for d in reversed(s):\n p += d * m\n m = m * 10 % M\n r = 0\n for d in s:\n r = (r * m + p) % M\n p = (p * 10 - (m - 1) * d) % M\n print(r)", "M = 10 ** 9 + 7\r\nt = int(input())\r\nfor _ in range(t):\r\n s = list(map(int, input()))\r\n p, m = 0, 1\r\n for d in reversed(s):\r\n p += d * m\r\n m = m * 10 % M\r\n r = 0\r\n for d in s:\r\n r = (r * m + p) % M\r\n p = (p * 10 - (m - 1) * d) % M\r\n print(r)", "M = 10 ** 9 + 7\r\n\r\nt = int(input())\r\nfor _ in range(t):\r\n s = input()\r\n p, m = 0, 1\r\n for d in reversed(s):\r\n p += (ord(d) - 48) * m\r\n m = m * 10 % M\r\n r = 0\r\n for d in s:\r\n r = (r * m + p) % M\r\n p = (p * 10 - (m - 1) * (ord(d) - 48)) % M\r\n print(r)", "from bisect import bisect_right as br\r\nfrom bisect import bisect_left as bl\r\nfrom collections import defaultdict\r\nfrom itertools import combinations\r\nimport functools\r\nimport sys\r\nimport math\r\nMAX = sys.maxsize\r\nMAXN = 10**6+10\r\nMOD = 10**9+7\r\ndef isprime(n):\r\n n = abs(int(n))\r\n if n < 2:\r\n return False\r\n if n == 2: \r\n return True \r\n if not n & 1: \r\n return False\r\n for x in range(3, int(n**0.5) + 1, 2):\r\n if n % x == 0:\r\n return False\r\n return True\r\n\r\ndef mhd(a,b,x,y):\r\n return abs(a-x)+abs(b-y)\r\n\r\ndef numIN():\r\n return(map(int,sys.stdin.readline().strip().split()))\r\n\r\ndef charIN():\r\n return(sys.stdin.readline().strip().split())\r\n\r\nt = [0]*1000010\r\n\r\ndef create(a,n):\r\n\tglobal t\r\n\tfor i in range(n,2*n):\r\n\t\tt[i] = a[i-n]\r\n\tfor i in range(n-1,0,-1):\r\n\t\tt[i] = t[2*i]+t[2*i+1]\r\n\r\n\r\ndef cal(n,k):\r\n\tres = 1\r\n\tc = [0]*(k+1)\r\n\tc[0]=1\r\n\tfor i in range(1,n+1):\r\n\t for j in range(min(i,k),0,-1):\r\n\t c[j] = (c[j]+c[j-1])%MOD\r\n\treturn c[k]\r\n\r\n\r\nfor i in range(int(input())):\r\n\tn = int(input())\r\n\ta = str(n)\r\n\tl = len(a)\r\n\tans = n\r\n\tp1 = pow(10,l,MOD)\r\n\tp2 = pow(10,l-1,MOD)\r\n\tfor j in range(l-1):\r\n\t\tn-=(int(a[j])*p2)\r\n\t\tn%=MOD\r\n\t\tn*=10\r\n\t\tn%=MOD\r\n\t\tn+=int(a[j])\r\n\t\tn%=MOD\r\n\t\tans*=p1\r\n\t\tans%=MOD\r\n\t\tans+=n\r\n\t\tans%=MOD\r\n\r\n\tprint(ans)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "t = int(input())\r\nfor _ in range(t):\r\n s = input()\r\n\r\n if len(s) == 1:\r\n print(s)\r\n\r\n else:\r\n mod = 10**9+7\r\n l = len(s)\r\n curr = 0\r\n for i in s:\r\n curr *= 10\r\n curr += int(i)\r\n curr %= mod\r\n\r\n ans = curr\r\n p1 = 1\r\n p2 = 1\r\n\r\n for i in range(l):\r\n p1 *= 10\r\n p1 %= mod\r\n\r\n for i in range(l-1):\r\n p2 *= 10\r\n p2 %= mod\r\n\r\n for i in range(l-1):\r\n curr -= (p2 * int(s[i])) % mod\r\n curr *= 10\r\n curr += int(s[i])\r\n curr %= mod\r\n ans *= p1\r\n ans %= mod\r\n ans += curr\r\n ans %= mod\r\n\r\n print(ans)\r\n", "M = 10 ** 9 + 7\r\n\r\nt = int(input())\r\nfor _ in range(t):\r\n s = list(map(int, input()))\r\n p, m = 0, 1\r\n for d in reversed(s):\r\n p += d * m\r\n m = m * 10 % M\r\n ans = 0\r\n for d in s:\r\n ans = (ans * m + p) % M\r\n p = (p * 10 - (m - 1) * d) % M\r\n print(ans)", "t=int(input())\r\nmodval=(10**9)+7\r\nfor _ in range(t):\r\n\tval=list(input())\r\n\tinp=0\r\n\tres=0\r\n\tmultiplier=1\r\n\tfor i in val:\r\n\t\tinp=((inp*10)+int(i))%modval\r\n\t\tmultiplier=(multiplier*10)%modval\r\n\tfor i in val:\r\n\t\tres=((res*multiplier)+inp)%modval\r\n\t\tinp=(inp*10 - (multiplier-1)*int(i))%modval\r\n\tprint(res)", "M = 10 ** 9 + 7\r\n\r\nt = int(input())\r\nfor _ in range(t):\r\n s = list(map(int, input()))\r\n p, m = 0, 1\r\n for d in reversed(s):\r\n p += d * m\r\n m = m * 10 % M\r\n r = 0\r\n for d in s:\r\n r = (r * m + p) % M\r\n p = (p * 10 - (m - 1) * d) % M\r\n print(r)\r\n", "MOD=10**9+7\r\ndef main():\r\n\tt=int(input())\r\n\tfor i in range(t):\r\n\t\ts=list(map(int,input()))\r\n\t\tp,m=0,1\r\n\t\tfor d in reversed(s):\r\n\t\t\tp+=d*m\r\n\t\t\tm=m*10%MOD\r\n\t\tr=0\r\n\t\tfor d in s:\r\n\t\t\tr=(r*m+p)%MOD\r\n\t\t\tp=(p*10-(m-1)*d)%MOD\r\n\t\tprint(r)\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\nmain()", "M = 10 ** 9 + 7\r\n\r\nt = int(input())\r\nfor _ in range(t):\r\n s = list(map(int, input()))\r\n p, m = 0, 1\r\n for d in reversed(s):\r\n p += d * m\r\n m = m * 10 % M\r\n r = 0\r\n for d in s:\r\n r = (r * m + p) % M\r\n p = (p * 10 - (m - 1) * d) % M\r\n print(r)\r\n", "from operator import mul\n\nM = 10 ** 9 + 7\nN = 100001\n\np10 = [None] * N\nk = 1\nfor i in range(N):\n p10[i] = k\n k = k * 10 % M \n\nt = int(input())\nfor _ in range(t):\n s = list(map(int, input()))\n m = p10[len(s)]\n p = sum(map(mul, reversed(s), p10))\n r = 0\n for d in s:\n r = (r * m + p) % M\n p = (p * 10 - (m - 1) * d) % M\n print(r)\n", "from operator import mul\n\nM = 10 ** 9 + 7\nN = 100001\n\np10 = [None] * N\np10[0] = 1\nfor i in range(1, N):\n p10[i] = p10[i - 1] * 10 % M \n\nt = int(input())\nfor _ in range(t):\n s = list(map(int, input()))\n m = p10[len(s)]\n p = sum(map(mul, reversed(s), p10))\n r = 0\n for d in s:\n r = (r * m + p) % M\n p = (p * 10 - (m - 1) * d) % M\n print(r)\n", "M = 10 ** 9 + 7\nN = 100001\n\np10 = [None] * N\np10[0] = 1\nfor i in range(1, N):\n p10[i] = p10[i - 1] * 10 % M \n\nt = int(input())\nfor _ in range(t):\n s = list(map(ord, input()))\n p = sum((x - 48) * y for x, y in zip(reversed(s), p10))\n m = p10[len(s)]\n r = 0\n for d in s:\n r = (r * m + p) % M\n p = (p * 10 - (m - 1) * (d - 48)) % M\n print(r)\n", "from operator import mul\n\nM = 10 ** 9 + 7\nN = 100001\n\np10 = [None] * N\np10[0] = 1\nfor i in range(1, N):\n p10[i] = p10[i - 1] * 10 % M \n\nt = int(input())\nfor _ in range(t):\n s = list(map(int, input()))\n p = sum(map(mul, reversed(s), p10))\n m = p10[len(s)]\n r = 0\n for d in s:\n r = (r * m + p) % M\n p = (p * 10 - (m - 1) * d) % M\n print(r)\n", "M = 10 ** 9 + 7\r\n\r\nt = int(input())\r\nfor _ in range(t):\r\n s = list(map(int, input()))\r\n p, m = 0, 1\r\n for d in reversed(s):\r\n p += d * m\r\n m = m * 10 % M\r\n r = 0\r\n for d in s:\r\n r = (r * m + p) % M\r\n p = (p * 10 - (m - 1) * d) % M\r\n print(r)\r\n", "M = 10 ** 9 + 7\r\n\r\nt = int(input())\r\nfor _ in range(t):\r\n s = list(map(int, input()))\r\n p, m = 0, 1\r\n for d in reversed(s):\r\n p += d * m\r\n m = m * 10 % M\r\n r = 0\r\n for d in s:\r\n r = (r * m + p) % M\r\n p = (p * 10 - (m - 1) * d) % M\r\n print(r)\r\n", "T = int(input())\r\nfor i in range(T):\r\n N = int(input())\r\n ans = N\r\n M = N\r\n L = len(str(N))\r\n ls = list(str(N))\r\n key = (10**L)%(10**9+7)\r\n for i in range(L-1):\r\n a0 = int(ls[i])\r\n M = (10*M + a0*(1-key))%(10**9+7)\r\n ans = (ans*key + M)%(10**9+7)\r\n print(ans%(10**9+7))\r\n"] | {"inputs": [["1", "123", ""]], "outputs": [["123231312"]]} | INTERVIEW | PYTHON3 | CODECHEF | 10,181 | |
d540cd2e0574fd840b4e10dc80afe98c | 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:-----
3
5
3
4
-----Sample Output:-----
1 1
2 2
3
4 4
5 5
1 1
2
3 3
1 1
22
33
4 4
-----EXPLANATION:-----
No need, else pattern can be decode easily. | ["t=int(input())\r\nfor _ in range(t):\r\n n=int(input())\r\n b=1\r\n if n%2:\r\n c=n-2\r\n for j in range(n//2):\r\n print(\" \"*j+str(b) +\" \"*c+ str(b))\r\n b+=1\r\n c-=2\r\n print(\" \"*(n//2)+str(b)+\" \"*(n//2))\r\n b+=1\r\n c=1\r\n for j in range(n//2):\r\n print(\" \"*(n//2-j-1)+str(b)+\" \"*c+ str(b))\r\n b+=1\r\n c+=2\r\n else:\r\n c=n-2\r\n for j in range(n//2):\r\n print(\" \"*j+str(b)+\" \"*c+str(b))\r\n b+=1\r\n c-=2\r\n c=0\r\n for j in range(n//2):\r\n print(\" \"*(n//2-j-1)+str(b) +\" \"*c+ str(b))\r\n b+=1\r\n c+=2\r\n \r\n \r\n \r\n \r\n \r\n \r\n", "try:\r\n t = int(input())\r\n for a in range(t):\r\n k = int(input())\r\n x = 0\r\n y = k-1\r\n n = 1\r\n for i in range(k):\r\n for j in range(k):\r\n if (j==x or j==y):\r\n print(n,end=\"\")\r\n else:\r\n print(\" \",end=\"\")\r\n x+=1\r\n y-=1\r\n n+=1\r\n print()\r\nexcept EOFError:\r\n pass", "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==j or i+j==n-1:\n print(str(i+1),end=\"\")\n else: print(\" \", end=\"\")\n print()", "for _ in range(int(input())):\r\n n = int(input())\r\n l = [[' '] * n for _ in range(n)]\r\n\r\n for i in range(n):\r\n l[i][i] = str(i+1)\r\n l[i][n-i-1] = str(i+1)\r\n\r\n for i in l:\r\n print(*i, sep='')\r\n", "for tc in range(int(input())):\r\n N = int(input())\r\n ar = [[' '] * N for i in range(N)]\r\n\r\n a = b = 0\r\n for i in range(N):\r\n ar[a][b] = str(i + 1)\r\n a += 1\r\n b += 1\r\n\r\n a = 0; b = N - 1\r\n for i in range(N):\r\n ar[a][b] = str(i + 1)\r\n a += 1\r\n b -= 1\r\n\r\n for row in ar:\r\n print(''.join(row))"] | {"inputs": [["3", "5", "3", "4"]], "outputs": [["1 1", "2 2", "3", "4 4", "5 5", "1 1", "2", "3 3", "1 1", "22", "33", "4 4"]]} | INTERVIEW | PYTHON3 | CODECHEF | 3,183 | |
70efd00c04dd28ac3bdbcc379724c170 | UNKNOWN | You are given N integer sequences A1, A2, ..., AN. Each of these sequences contains N elements. You should pick N elements, one from each sequence; let's denote the element picked from sequence Ai by Ei. For each i (2 ≤ i ≤ N), Ei should be strictly greater than Ei-1.
Compute the maximum possible value of E1 + E2 + ... + EN. If it's impossible to pick the elements E1, E2, ..., EN, print -1 instead.
-----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 N space-separated integers Ai1, Ai2, ..., AiN denoting the elements of the sequence Ai.
-----Output-----
For each test case, print a single line containing one integer — the maximum sum of picked elements.
-----Constraints-----
- 1 ≤ T ≤ 10
- 1 ≤ N ≤ 700
- 1 ≤ sum of N in all test-cases ≤ 3700
- 1 ≤ Aij ≤ 109 for each valid i, j
-----Subtasks-----
Subtask #1 (18 points): 1 ≤ Aij ≤ N for each valid i, j
Subtask #2 (82 points): original constraints
-----Example-----
Input:
1
3
1 2 3
4 5 6
7 8 9
Output:
18
-----Explanation-----
Example case 1: To maximise the score, pick 3 from the first row, 6 from the second row and 9 from the third row. The resulting sum is E1+E2+E3 = 3+6+9 = 18. | ["t=int(input())\nfor _ in range(t):\n n=int(input())\n \n grid=[]\n for _ in range(n):\n temp=[]\n temp=list(map(int,input().strip().split()))\n temp.sort()\n grid.append(temp)\n \n \n curr=max(grid[n-1])\n total=curr\n for i in range(n-2,0-1,-1):\n flag=0\n for j in range(n-1,0-1,-1):\n if grid[i][j]<curr:\n flag=1\n curr=grid[i][j]\n total+=curr\n break\n \n if flag==0:\n total=-1\n break\n \n print(total)\n \n \n \n \n \n \n", "# cook your dish here\nfor _ in range(int(input())):\n n=int(input())\n mat=[]\n for x in range(n):\n mat.append([int(i) for i in input().split()])\n ans=[0]*n\n flag=True\n ans[-1] = max(mat[-1])\n for i in range(n-2,-1,-1):\n for ele in mat[i]:\n if ele<ans[i+1]:\n ans[i]=max(ans[i],ele)\n if ans[i]==0:\n flag=False\n break\n if flag:\n print(sum(ans))\n else:\n print(-1)", "# cook your dish here\nt=int(input())\nfor cases in range(t):\n n=int(input())\n lis=[]\n for i in range(n):\n lis1=sorted(list(map(int,input().split())))\n lis.append(lis1)\n summ=lis[-1][-1]\n maxx=summ\n c=1\n for i in range(n-2,-1,-1):\n for j in range(n-1,-1,-1):\n if lis[i][j]<maxx:\n maxx=lis[i][j]\n c+=1\n summ+=lis[i][j]\n break\n if c==n:\n print(summ)\n else:\n print(-1)\n print()\n \n", "def largest_smaller_than(a,N,key):\n start = 0\n end = N\n\n ans = -1\n\n while(end>=start):\n mid = (start+end)//2\n if(mid>=N or mid<0):\n break\n elif(a[mid]<key):\n ans = mid\n start = mid+1\n elif(a[mid]>=key):\n end = mid-1\n if(ans!=-1):\n return a[ans]\n else:\n return -1\n\nT = int(input())\nans = []\n\nfor _ in range(T):\n N = int(input())\n\n A = []\n for i in range(N):\n x = [int(i) for i in input().split()]\n A.append(sorted(x))\n\n\n start = float('inf')\n sum = 0\n for i in range(N-1,-1,-1):\n start = largest_smaller_than(A[i],N,start)\n if(start==-1):\n sum = -1\n break\n sum += start\n ans.append(sum)\n\nfor i in ans:\n print(i)\n", "try:\n for i in range(int(input())):\n nm=int(input())\n lst=[]\n for j in range(nm):\n lst.append(sorted([int(x) for x in input().split()]))\n \n sm=lst[-1][-1]\n mx=lst[-1][-1]\n c=1\n for m in range(nm-2,-1,-1):\n for n in range(nm-1,-1,-1):\n if lst[m][n]<mx:\n sm+=lst[m][n]\n mx=lst[m][n]\n c+=1\n break\n if c==nm:\n print(sm)\n else:\n print(-1)\n \nexcept:\n pass", "for i in range(int(input())):\n nm=int(input())\n lst=[]\n for j in range(nm):\n lst.append(sorted([int(x) for x in input().split()]))\n \n sm=lst[-1][-1]\n mx=lst[-1][-1]\n c=1\n for m in range(nm-2,-1,-1):\n for n in range(nm-1,-1,-1):\n if lst[m][n]<mx:\n sm+=lst[m][n]\n mx=lst[m][n]\n c+=1\n break\n if c==nm:\n print(sm)\n else:\n print(-1)", "for _ in range(int(input())):\n n = int(input())\n s = 0\n m = []\n \n for i in range(n): \n l = []\n l = [int(i) for i in input().split()] \n l.sort()\n m.append(l)\n \n answer = m[n-1][n-1]; last = m[n-1][n-1]\n \n s = 1\n \n for i in range(n-2,-1,-1):\n for j in range(n-1,-1,-1):\n if m[i][j]<last:\n answer += m[i][j]\n last = m[i][j]\n s+=1\n break\n \n if s==n:print(answer)\n else:print(-1)", "for _ in range(int(input())):\n n = int(input())\n s = 0\n mat = []\n \n for i in range(n): \n a = []\n a = [int(i) for i in input().split()] \n a.sort()\n mat.append(a)\n \n ans = mat[n-1][n-1]; last = mat[n-1][n-1]\n \n s = 1\n \n for i in range(n-2,-1,-1):\n for j in range(n-1,-1,-1):\n if mat[i][j]<last:\n ans += mat[i][j]\n last = mat[i][j]\n s+=1\n break\n \n if s==n:print(ans)\n else:print(-1)", "# cook your dish here\nfor _ in range(int(input())):\n a=[]\n n=int(input())\n for t in range(n):\n p=list(map(int,input().split()))\n a.append(p)\n c=[0]*n\n c[n-1]=max(a[n-1])\n f=0\n s=0\n for i in range(n-2,-1,-1):\n c[i]=0\n for j in range(n):\n if a[i][j]<c[i+1]:\n c[i]=max(c[i],a[i][j])\n if c[i]==0:\n f=1 \n break\n else:\n s+=c[i] \n \n if f==1:\n print(-1)\n else:\n print(s+c[n-1])\n", "# cook your dish here\nfor _ in range(int(input())):\n a=[]\n n=int(input())\n for t in range(n):\n p=list(map(int,input().split()))\n a.append(p)\n c=[0]*n\n c[n-1]=max(a[n-1])\n f=0\n s=0\n for i in range(n-2,-1,-1):\n c[i]=0\n for j in range(n):\n if a[i][j]<c[i+1]:\n c[i]=max(c[i],a[i][j])\n if c[i]==0:\n f=1 \n break\n else:\n s+=c[i] \n \n if f==1:\n print(-1)\n else:\n print(s+c[n-1])\n", "# cook your dish here\nfor _ in range(int(input())):\n n=int(input())\n l=[]\n for i in range(n):\n l1 = list(map(int, input().split()))\n l1.sort()\n l.append(l1)\n\n ans=l1[-1]\n p=ans\n\n for i in range(n-2, -1, -1):\n flag=0\n for j in range(n-1, -1, -1):\n if l[i][j]<p:\n p=l[i][j]\n ans+=p \n flag=1 \n break\n \n if flag==0:\n print(-1)\n flag=2 \n break\n \n if flag!=2:\n print(ans)", "for i in range(int(input())):\n n=int(input())\n b=[]\n counter=0\n for j in range(n):\n b.append(list(map(int,input().split())))\n c=max(b[-1])\n sum=c\n for k in range(1,n):\n for x in b[-k-1]:\n if(x<c and x>counter):\n counter=x\n if(counter==0):\n print(-1)\n sum=0\n break\n else:\n sum=sum+counter\n c=counter\n counter=0\n if(sum!=0):\n print(sum)\n", "# cook your dish here\ndef maxScore():\n for t in range(int(input())):\n n=int(input())\n l=[]\n for i in range(n):\n temp=sorted([int(x) for x in input().split()])\n l.append(temp)\n s=l[n-1][n-1]\n cdt_o=l[n-1][n-1]\n for i in range(n-2,-1,-1):\n success=1\n for j in range(n-1,-1,-1):\n cdt_t=l[i][j]\n if cdt_t<cdt_o:\n s+=cdt_t\n cdt_o=cdt_t\n break\n elif j==0:\n success=0\n break\n elif cdt_t>=cdt_o:\n continue\n if success==0:\n break\n if success==0:\n print(-1)\n else:\n print(s)\nmaxScore()\n", "def score(qn):\n \n import math\n maximum = math.inf\n score = 0\n for i in reversed(list(range(0, len(qn)))):\n \n temp = -1\n for j in qn[i]:\n \n if j > temp and j < maximum:\n temp = j\n if temp == -1:\n return -1\n else:\n score += temp\n maximum = temp\n return score\n\n\nimport sys\nc = 0\nfor line in sys.stdin:\n if c == 0:\n t = int(line.strip())\n c = 2\n else:\n if c%2 == 0:\n new = line.split()\n N = int(new[0].strip())\n qn = []\n c = 5\n count = 1\n elif c ==5:\n a = list(map(int, line.split()))\n \n qn.append(a)\n count += 1\n if count == N+1:\n c = 2\n print(score(qn))\n", "testCases = int(input())\nlines = 0\nfor _ in range(testCases):\n lines = int(input())\n arr = []\n for _ in range(lines):\n arr.append(sorted(list(map(int,input().split())),reverse=True))\n\n maximum = max(arr[lines-1])\n choosen = maximum\n bool = True\n for index in range(lines-2,-1,-1):\n secondBool = True\n for j in range(lines):\n if arr[index][j] < maximum:\n choosen += arr[index][j]\n maximum = arr[index][j]\n secondBool = False\n break\n if secondBool == True:\n bool = False\n break\n if bool == True:\n print(choosen)\n else:\n print(-1)\n", "# cook your dish here\ntest=int(input())\nfor _ in range(test):\n n=int(input())\n ls=[]\n for _ in range(n):\n ls.append(sorted(list(map(int,input().split())),reverse=True))\n m=max(ls[n-1])\n s=m\n d=0\n for i in range(n-2,-1,-1):\n f=0\n for j in range(n):\n if(ls[i][j]<m):\n s+=ls[i][j]\n m=ls[i][j]\n f=1\n break\n if(f==0):\n d=1\n break\n if(d==0):\n print(s)\n else:\n print(-1)\n", "for u in range(int(input())):\n n=int(input())\n l=[]\n for i in range(n):\n l.append(sorted(list(map(int,input().split())),reverse=True))\n m=max(l[n-1])\n s=m\n d=0\n for i in range(n-2,-1,-1):\n f=0\n for j in range(n):\n if(l[i][j]<m):\n s+=l[i][j]\n m=l[i][j]\n f=1\n break\n if(f==0):\n d=1\n break\n if(d==0):\n print(s)\n else:\n print(-1)\n", "def check(m,arr):\n s=-1\n for i in arr:\n if i<m:\n s=max(s,i)\n return s\n\nt=int(input())\nfor _ in range(t):\n n=int(input())\n a=[]\n for i in range(n):\n a.append(list(map(int,input().split())))\n s=max(a[-1])\n m=s\n for i in range(n-2,-1,-1):\n m=check(m,a[i])\n if m!=-1:\n s+=m\n else:\n s=-1\n break\n print(s)\n \n", "def check(m,arr):\n s=-1\n for i in arr:\n if i<m:\n s=max(s,i)\n return s\n\nt=int(input())\nfor _ in range(t):\n n=int(input())\n a=[]\n for i in range(n):\n a.append(list(map(int,input().split())))\n s=max(a[-1])\n m=s\n for i in range(n-2,-1,-1):\n m=check(m,a[i])\n if m!=-1:\n s+=m\n else:\n s=-1\n break\n print(s)\n \n", "# cook your dish here\nfor i in range(int(input())):\n n=int(input())\n rows=[]\n for i in range(n):\n rows.append(list(map(int,input().split())))\n c=max(rows[-1])\n add=c \n try:\n for j in range(n-2,-1,-1):\n c=max([i for i in rows[j] if i<c])\n add+=c \n print(add)\n except ValueError:\n print(-1)", "import numpy as np\nT = int(input())\n\nfor case in range(T):\n n = int(input())\n l = []\n for i in range(n):\n l.append(list(map(int, input().split())))\n l.reverse()\n ans = max(l[0])\n m = max(l[0])\n for i in range(1, n):\n a = np.array(l[i])\n a = a[a < m]\n if len(a) == 0:\n ans = -1\n break\n else:\n m = max(a)\n ans += m\n print(ans)", "t=int(input())\nwhile(t>0):\n l=[]\n n=int(input())\n for i in range(n):\n l.append(list(map(int,input().split())))\n x=max(l[-1])\n w=0\n s=x\n for i in range(n-2,-1,-1):\n l[i].sort(reverse=True)\n q=0\n for j in l[i]:\n if(j<x):\n x=j\n q=1\n s+=x\n break\n if(q==0):\n w=1\n print(-1)\n break\n if(w==0):\n print(s)\n t-=1", "for _ in range(int(input())):\n res=0\n mat=[]\n n=int(input())\n for _ in range(n):\n a=list(map(int,input().split()))\n mat.append(sorted(a))\n count=mat[n-1][n-1]\n temp=mat[n-1][n-1]\n c=0\n k=0\n for i in range(n-2,-1,-1):\n for j in range(n-1,-1,-1):\n if mat[i][j]<temp:\n count+=mat[i][j]\n temp=mat[i][j]\n c+=1\n break\n if c==0:\n print(-1)\n k=1\n break\n else:\n c=0\n \n if k==0:\n print(count)\n", "# cook your dish here\nt=int(input())\nwhile t:\n n=int(input())\n l=[]\n for i in range(n):\n l1=list(map(int,input().split()))\n l1=sorted(l1)\n l.append(l1)\n #print(l)\n count=l[n-1][n-1]\n m=l[n-1][n-1]\n c=0\n k=0\n for i in range(n-2,-1,-1):\n for j in range(n-1,-1,-1):\n if(l[i][j]<m):\n #print(count)\n count+=l[i][j]\n m=l[i][j]\n c+=1\n break\n if(c==0):\n print(-1)\n k+=1\n break\n else:\n c-=1\n if(k==0):\n print(count)\n t-=1", "for _ in range(int(input())):\n n=int(input())\n l=[]\n while n>0:\n k=[]\n k=[int(i) for i in input().split()]\n k=sorted(k)\n l.append(k)\n n -= 1\n\n count = [l[-1][-1]]\n flag = 0\n for i in range(len(l)-2,-1,-1):\n for j in range(len(l)-1,-1,-1):\n if l[i][j]< count[-1]:\n count.append(l[i][j])\n break\n else:\n flag = 1\n break\n if flag == 1: break\n if flag == 1: print(-1)\n else: print(sum(count))\n\n\n\n\n\n"] | {"inputs": [["1", "3", "1 2 3", "4 5 6", "7 8 9"]], "outputs": [["18"]]} | INTERVIEW | PYTHON3 | CODECHEF | 10,927 | |
3761f15f8b3bbedcfa20b75b64373d6b | UNKNOWN | Little kids, Jack and Evan like playing their favorite game Glass-and-Stone. Today they want to play something new and came across Twitter on their father's laptop.
They saw it for the first time but were already getting bored to see a bunch of sentences having at most 140 characters each. The only thing they liked to play with it is, closing and opening tweets.
There are N tweets on the page and each tweet can be opened by clicking on it, to see some statistics related to that tweet. Initially all the tweets are closed. Clicking on an open tweet closes it and clicking on a closed tweet opens it. There is also a button to close all the open tweets. Given a sequence of K clicks by Jack, Evan has to guess the total number of open tweets just after each click. Please help Evan in this game.
-----Input-----
First line contains two integers N K, the number of tweets (numbered 1 to N) and the number of clicks respectively (1 ≤ N, K ≤ 1000). Each of the following K lines has one of the following.
- CLICK X , where X is the tweet number (1 ≤ X ≤ N)
- CLOSEALL
-----Output-----
Output K lines, where the ith line should contain the number of open tweets just after the ith click.
-----Example-----
Input:
3 6
CLICK 1
CLICK 2
CLICK 3
CLICK 2
CLOSEALL
CLICK 1
Output:
1
2
3
2
0
1
Explanation:
Let open[x] = 1 if the xth tweet is open and 0 if its closed.
Initially open[1..3] = { 0 , 0 , 0 }. Here is the state of open[1..3] after each click and corresponding count of open tweets.
CLICK 1 : { 1, 0, 0 }, open count = 1
CLICK 2 : { 1, 1, 0 }, open count = 2
CLICK 3 : { 1, 1, 1 }, open count = 3
CLICK 2 : { 1, 0, 1 }, open count = 2
CLOSEALL : { 0, 0, 0 }, open count = 0
CLICK 1 : { 1, 0, 0 }, open count = 1 | ["def getInput():\n N_k = input().split()\n N =int(N_k[0])\n k =int(N_k[1])\n list = []\n output = []\n count = 0\n for i in range(0,k):\n val = input()\n if(val!=\"CLOSEALL\"):\n val=val.split()\n val = int (val[1])\n if val not in list:\n count= count +1\n list.append(val)\n else:\n list.remove(val)\n count= count -1\n else:\n count =0\n while len(list) > 0: \n list.pop()\n output.append(count)\n for each in output:\n print(each)\ngetInput()", "N, K = list(map(int, input().split()))\nestado = [False]*N\nnumAbiertos=0\nfor _l in range(K):\n cmd = input().strip()\n if cmd==\"CLOSEALL\":\n estado=[False]*N\n numAbiertos=0\n else :\n num = int(cmd.split()[1])-1\n if estado[num] :\n estado[num]=False\n numAbiertos -= 1\n else :\n estado[num]=True\n numAbiertos += 1\n \n print(numAbiertos)\n", "import string\na=input()\nb=a.split()\nn=int(b[1])\narray=[0]*int(b[0])\nfor i in range(0,n):\n c=input()\n d=c.split()\n if d == ['CLOSEALL']:\n array=[0]*int(b[0])\n else:\n e=int(d[1])\n if array[e-1]==0:\n array[e-1]=1\n else:\n array[e-1]=0\n f=array.count(1)\n print(f)", "open_tweets = []\nstring = input()\na, b = string.split(\" \")\nn = int(a)\nk = int(b)\ncounter = 0\nfor x in range(k):\n command = input()\n if command == \"CLOSEALL\":\n counter = 0\n open_tweets = []\n print(counter)\n continue\n click, tweetnum = command.split(\" \")\n if tweetnum in open_tweets:\n open_tweets.remove(tweetnum)\n counter -= 1\n print(counter)\n else:\n open_tweets.append(tweetnum)\n counter += 1\n print(counter)", "tweets,clicks = list(map(int,input().split()))\nopenl = []\n\nfor i in range(clicks):\n action = input() .upper()\n if(action == \"CLOSEALL\"):\n openl = []\n print(0)\n else:\n if(action not in openl ):\n openl.append(action)\n print(len(openl))\n elif(action in openl):\n openl.remove(action)\n print(len(openl))", "tmp=input().split(' ',2)\nm=int(tmp[0])\nn=int(tmp[1])\nlis=[0]*m\n\nfor k in range(n):\n s=input()\n if s=='CLOSEALL':\n for o in range(m):\n lis[o]=0\n else:\n s=s.replace('CLICK ','')\n s=int(s)\n if lis[s-1]==1:\n lis[s-1]=0\n else:\n lis[s-1]=1\n \n sum=0\n for u in range(m):\n sum+=lis[u]\n print(sum) ", "import sys\n\ndef main():\n s = sys.stdin.readline\n n, k = list(map(int, s().split()))\n save = {}\n for i in range(1, n+1):\n save[i] = 0\n for i in range(k):\n try:\n c, v = s().split()\n v = int(v)\n if save[v] == 1:\n save[v] = 0\n elif save[v] == 0:\n save[v] = 1\n ans = 0\n for i in range(1, n+1):\n if save[i] == 1:\n ans+=1\n print(ans)\n except:\n for i in range(1, n+1):\n save[i] = 0\n print(0)\n\ndef __starting_point():\n main()\n__starting_point()", "n,k=list(map(int,input().split()))\nhit=[0]*n\ncount=0\nfor i in range(k):\n cmd=input().split()\n if cmd[0]=='CLICK':\n idx=int(cmd[1])-1\n if hit[idx]==0:\n hit[idx]=1\n count+=1\n else:\n hit[idx]=0\n count-=1\n else:\n hit=[0]*n\n count=0\n print(count)\n", "n, k = list(map(int, input().split()))\n\narr = [True for i in range(n)]\n\nopen = 0\n\nfor i in range(k):\n temp = input().split()\n if temp[0] == \"CLICK\":\n cl = int(temp[1])-1\n if arr[cl]:\n open += 1\n arr[cl] = False\n else:\n open -= 1\n arr[cl] = True\n \n else:\n open = 0\n arr = [True for i in range(n)]\n print(open)", "n,k=list(map(int,input().split()))\nhit=[0]*n\ncount=0\nfor i in range(k):\n cmd=input().split()\n if cmd[0]=='CLICK':\n idx=int(cmd[1])-1\n if hit[idx]==0:\n hit[idx]=1\n count+=1\n else:\n hit[idx]=0\n count-=1\n else:\n hit=[0]*n\n count=0\n print(count)\n", "import sys\n\nN, K = list(map(int, sys.stdin.readline().split()))\nopen = [False for i in range(N + 1)]\ncount = 0\n\nfor i in range(K):\n line = sys.stdin.readline().split()\n if len(line) == 1:\n count = 0\n open = [False for i in range(N + 1)]\n else:\n action, num = line\n num = int(num)\n if open[num]:\n count -= 1\n else:\n count += 1\n open[num] = not open[num]\n print(count)", "#data = open(\"P5.txt\")\nn,k = list(map(int,input().split()))\ntweets = [False]*n\ncount = 0\nfor _ in range(k):\n stuff = input().split()\n if stuff[0] == \"CLICK\":\n i = int(stuff[1])-1\n if tweets[i]:\n count -= 1\n else:\n count += 1\n tweets[i] = not tweets[i]\n else:\n tweets = [False]*n\n count = 0\n print(count)", "s = input().split()\nn = int(s[0])\nk = int(s[1])\ntweet = [0]*k\nfor t in range(k):\n s = input().split()\n if len(s) == 1:\n tweet = [0] * k\n print(0)\n continue\n s = int(s[1])\n if tweet[s-1] == 1:\n tweet[s-1] = 0\n else: tweet[s-1] = 1\n ans=0\n for i in range(k):\n if(tweet[i] == 1): ans+=1\n print(ans)\n", "#!/usr/bin/env python\n\ndef main():\n N, K = list(map(int, input().strip().split()[:2]))\n T = [0] * N\n for k in range(K):\n X = input().strip().split()\n if len(X) == 2:\n T[int(X[1])-1] = 1 - T[int(X[1])-1]\n else:\n T = [0] * N\n print(T.count(1))\n\nmain()\n\n", "import sys\nopened = set()\nfirst = True\nfor line in sys.stdin:\n if first:\n first = False\n continue\n\n tok = line.split()\n if len(tok) == 1: opened = set()\n else:\n x = int(tok[1])\n if x in opened: opened.remove(x)\n else: opened.add(x)\n \n print(len(opened))\n"] | {"inputs": [["3 6", "CLICK 1", "CLICK 2", "CLICK 3", "CLICK 2", "CLOSEALL", "CLICK 1"]], "outputs": [["1", "2", "3", "2", "0", "1"]]} | INTERVIEW | PYTHON3 | CODECHEF | 5,258 | |
e7963f87973a48667a35e37a39993b8a | UNKNOWN | Give me Biscuit
Sunny wants to make slices of biscuit of size c * d into identical pieces.
but each piece is a square having maximum possible side length with no left over piece of biscuit.
Input Format
The first line contains an integer N.
N lines follow. Each line contains two space separated integers c and d.
which denote length and breadth of the biscuit.
Constraints
1 <= N <= 1000
1 <= c,d <= 1000
Output Format
N lines, each containing an integer that denotes the number of squares of maximum size, when the biscuit is cut as per the given condition.
Sample Input
2
2 2
6 9
Sample Output
1
6
Explanation
The 1st testcase has a biscuit whose original dimensions are 2 X 2, the biscuit is uncut and is a square.
Hence the answer is 1.
The 2nd testcase has a biscuit of size 6 X 9 . We can cut it into 54 squares of size 1 X 1 , 6 of size 3 X 3 . For other sizes we will have leftovers.
Hence, the number of squares of maximum size that can be cut is 6. | ["def __gcd(a, b): \n \n # Everything divides 0 \n if (a == 0 or b == 0): \n return 0; \n \n # base case \n if (a == b): \n return a; \n \n # a is greater \n if (a > b): \n return __gcd(a - b, b); \n return __gcd(a, b - a); \n \n# Function to find \n# number of squares \ndef NumberOfSquares(x, y): \n \n # Here in built PHP \n # gcd function is used \n s = __gcd(x, y); \n \n ans = (x * y) / (s * s); \n \n return int(ans);\n \nn=int(input())\nwhile n:\n n=n-1\n c,d=map(int,input().split())\n print(NumberOfSquares(c, d))", "# cook your dish here\nfor _ in range(int(input())):\n l,b=map(int,input().split())\n for i in range(1,min(l,b)+1):\n if l%i==0 and b%i==0:\n s=(l*b)//i**2\n print(s)", "# cook your dish here\ndef __gcd(a, b): \n if (a == 0 or b == 0): \n return 0; \n if (a == b): \n return a; \n if (a > b): \n return __gcd(a - b, b); \n return __gcd(a, b - a); \nfor _ in range(int(input())):\n x,y=list(map(int,input().split()))\n s = __gcd(x, y); \n ans = (x * y) / (s * s); \n print(int(ans))\n", "import math\n\nfor _ in range(int(input())):\n a,b = map(int,input().split())\n _gcd = math.gcd(a,b)\n tmp = (a*b)//(_gcd*_gcd)\n print(tmp)", "import math\nn = int(input())\nfor _ in range(n):\n a, b = map(int, input().split())\n ans = (a//math.gcd(a, b))*(b//math.gcd(a, b))\n print(ans)", "import math as m\nfor _ in range(int(input())):\n a,b=map(int,input().split())\n g=m.gcd(a,b)\n print(a//g * b//g)", "import math\nn = int(input())\nfor i in range(n):\n c = list(map(int, input().split()))\n d = math.gcd(c[0], c[1])\n h = int((c[0]*c[1])/(d**2))\n print(h)", "\n\n\n# Python3 code for calculating\n# the number of squares\n\n# Recursive function to\n# return gcd of a and b\ndef __gcd(a, b):\n # Everything divides 0\n if (a == 0 or b == 0):\n return 0;\n\n # base case\n if (a == b):\n return a;\n\n # a is greater\n if (a > b):\n return __gcd(a - b, b);\n return __gcd(a, b - a);\n\n\n# Function to find\n# number of squares\ndef NumberOfSquares(x, y):\n # Here in built PHP\n # gcd function is used\n s = __gcd(x, y);\n\n ans = (x * y) / (s * s);\n\n return int(ans);\n\n\n# Driver Code\n\nt = int(input())\nfor i in range(t):\n m,n = list(map(int,input().split(' ')))\n# Call the function\n# NumberOfSquares\n print((NumberOfSquares(m, n)));\n\n# This code is contributed\n# by mit\n", "import math\n\nfor _ in range(int(input())):\n c,d = list(map(int, input().split()))\n\n size = int(math.sqrt(c*d))\n\n while size > 0:\n if (c*d)%(size*size) == 0:\n k = (c*d)/(size*size)\n if c%size == 0 and d%size == 0:\n print(int(k))\n break\n\n size-=1\n", "import math\nfor _ in range(int(input())):\n a,b=map(int,input().split())\n g=math.gcd(a,b)\n res=((a*b)/(g*g))\n print(int(res))", "t = int(input())\n\nfor i in range(t):\n m,n = map(int,input().split())\n \n mul = m*n\n \n while(m!=n):\n if (m>n):\n m-=n\n else:\n n-=m\n print(mul//(m*n))"] | {"inputs": [["2", "2 2", "6 9"]], "outputs": [["1", "6"]]} | INTERVIEW | PYTHON3 | CODECHEF | 2,908 | |
ac0642309b5d7cee1c7409fa67384ec6 | UNKNOWN | -----Problem Statement-----
Harry Potter has one biscuit and zero rupee in his pocket. He will perform the following operations exactly $K$ times in total, in the order he likes:
- Hit his pocket, which magically increases the number of biscuits by one.
- Exchange $A$ biscuits to $1$ rupee.
- Exchange $1$ rupee to $B$ biscuits.
Find the maximum possible number of biscuits in Harry's pocket after $K$ operations.
-----Input-----
Input is given in the following format:
K A B
-----Output-----
Print the maximum possible number of biscuits in Harry's pocket after $K$operations.
-----Constraints-----
- $1 \leq K, A, B \leq 10^9$
- $K$, $A$ and are integers.
-----Sample Input-----
4 2 6
-----Sample Output-----
7
-----EXPLANATION-----
The number of biscuits in Harry's pocket after $K$ operations is maximized as follows:
- Hit his pocket. Now he has $2$ biscuits and $0$ rupee.
- Exchange $2$ biscuits to $1$ rupee in his pocket .Now he has $0$ biscuits and $1$ rupee.
- Hit his pocket. Now he has $1$ biscuits and $1$ rupee.
- Exchange $1$ rupee to $6$ biscuits. his pocket. Now he has $7$ biscuits and $0$ rupee. | ["K,A,B = map(int,input().split())\r\n \r\nif A + 2 > B:\r\n print(K + 1)\r\n return\r\n \r\nstart = A - 1\r\nK -= start\r\nans = K//2 * (B-A) + K%2 + start + 1\r\nprint(ans)", "import sys\r\n# sys.stdin = open('input.txt', 'r') \r\n# sys.stdout = open('output.txt', 'w')\r\n \r\nimport math\r\nimport collections\r\nfrom sys import stdin,stdout,setrecursionlimit\r\nimport bisect as bs\r\nsetrecursionlimit(2**20)\r\nM = 10**9+7\r\n\r\n# T = int(stdin.readline())\r\nT = 1\r\n\r\nfor _ in range(T):\r\n # n = int(stdin.readline())\r\n n,a,b = list(map(int,stdin.readline().split()))\r\n # h = list(map(int,stdin.readline().split()))\r\n # q = int(stdin.readline())\r\n # a = list(map(int,stdin.readline().split()))\r\n # b = list(map(int,stdin.readline().split()))\r\n if(a>(n-1)):\r\n print(n+1)\r\n continue\r\n if(b-a-2>0):\r\n ans = a\r\n op = n-(a-1)\r\n ans += (op//2)*(b-a)\r\n ans += (op%2)\r\n print(ans)\r\n continue\r\n print(n+1)", "import sys\nimport math,bisect\nsys.setrecursionlimit(10 ** 5)\nfrom collections import defaultdict\nfrom itertools import groupby,accumulate\nfrom heapq import heapify,heappop,heappush\nfrom collections import deque,Counter,OrderedDict\ndef I(): return int(sys.stdin.readline())\ndef neo(): return list(map(int, sys.stdin.readline().split()))\ndef Neo(): return list(map(int, sys.stdin.readline().split()))\nk,a,b = neo()\nif k+1 < a:\n print(k+1)\n return\nk -= a-1\nq = a+k\nif b > a:\n t = k//2\n a += (b-a)*t\n if k-t*2 > 0:\n a += 1\n print(max(a,q))\n return\nprint(q)\n", "import sys\nimport math\nfrom collections import defaultdict,Counter\n\n# input=sys.stdin.readline\n# def print(x):\n# sys.stdout.write(str(x)+\"\\n\")\n\n# sys.stdout=open(\"CP3/output.txt\",'w')\n# sys.stdin=open(\"CP3/input.txt\",'r')\n\n# mod=pow(10,9)+7\nk,a,b=list(map(int,input().split()))\nif b<=a+2 or k<=a:\n\tans=1+k\nelse:\n\tk-=a-1\n\tans=a+k//2*(b-a)\n\tif k&1:\n\t\tans+=1\nprint(ans)\n", "k, a, b = map(int, input().split())\nif (b-a) <= 2: print(k+1)\nelse:\n count = a\n k = k-(a-1)\n count += (b-a)*(k>>1)\n count += k&1\n print(count)", "import sys\nimport math\n#from queue import *\nimport random\n#sys.setrecursionlimit(int(1e6))\ninput = sys.stdin.readline\n \n############ ---- USER DEFINED INPUT FUNCTIONS ---- ############\ndef inp():\n return(int(input()))\ndef inara():\n return(list(map(int,input().split())))\ndef insr():\n s = input()\n return(list(s[:len(s) - 1]))\ndef invr():\n return(list(map(int,input().split())))\n################################################################\n############ ---- THE ACTUAL CODE STARTS BELOW ---- ############\n\nk,a,b=invr()\n\nif k<a-1:\n\tprint(1+k)\n\treturn\n\nnow=a\nk-=(a-1)\n\nif b-a>=3:\n\tnow=a+(k//2)*(b-a)+k%2\nelse:\n\tnow=a+k\n\nprint(now)\n\t\n\t\t\n", "import sys \nimport math as mt\nimport bisect\ninput=sys.stdin.readline\n#t=int(input())\nt=1 \n \n \n \nfor _ in range(t):\n #n=int(input())\n #n,k=map(int,input().split())\n k,a,b=list(map(int,input().split()))\n #n,h=(map(int,input().split()))\n #l1=list(map(int,input().split()))\n #l2=list(map(int,input().split()))\n #mat=[[0 for j in range(c+1)] for i in range(r+1)]\n ans=k+1\n ans1=1\n op1=min(a-ans1,k)\n k-=op1\n if k>0:\n ex=k//2\n ans1=(a+ex*(b-a))\n if k%2!=0:\n ans1+=1\n print(max(ans,ans1)) \n"] | {"inputs": [["4 2 6"]], "outputs": [["7"]]} | INTERVIEW | PYTHON3 | CODECHEF | 3,530 | |
942afeabd5cc6895883b23fa4c6cbc27 | UNKNOWN | Did you know that the people of America eat around 100 acres of pizza per day ? Having read this fact on internet, two chefs from the Elephant city, Arjuna and Bhima are set to make pizza popular in India. They organized a social awareness camp, where N people ( other than these two ) sit around a large pizza. To make it more interesting, they make some pairs among these N people and the two persons in a pair, feed each other.
Each person should be a part of at most one pair and most importantly, to make feeding easy, any two pairs should not cross each other ( see figure for more clarity ). Arjuna and Bhima decided to play a game on making the pairs. In his turn, a player makes a pair ( selects two persons, as long as its valid ) and this pair start feeding each other. Arjuna and Bhima take turns alternately, by making a pair in each turn, and they play optimally ( see Notes for more clarity ). The one who can not make a pair in his turn, loses. Given N, find who wins the game, if Arjuna starts first.
-----Notes-----
- 'Optimally' means, if there is a possible move a person can take in his turn that can make him win finally, he will always take that. You can assume both are very intelligent.
-----Input-----
First line contains an integer T ( number of test cases, around 1000 ). Each of the next T lines contains an integer N ( 2 <= N <= 10000 )
-----Output-----
For each test case, output the name of the winner ( either "Arjuna" or "Bhima" ( without quotes ) ) in a new line.
-----Example-----
Input:
4
2
4
5
6
Output:
Arjuna
Arjuna
Bhima
Arjuna
Explanation:
Let the people around the table are numbered 1, 2, ... , N in clock-wise order as shown in the image
Case 1 : N = 2. Only two persons and Arjuna makes the only possible pair (1,2)
Case 2 : N = 4. Arjuna can make the pair (1,3). Bhima can not make any more pairs ( without crossing the pair (1,3) )
Case 3 : N = 5. No matter which pair Arjuna makes first, Bhima can always make one more pair, and Arjuna can not make any further | ["a= [0, 0, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 0, 5, 2, 2, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 2, 7, 4, 0, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 2, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2]\n \nt = int(input())\n \nfor i in range(t):\n\tn = int(input())\n\tif a[n]>0:\n\t\tprint(\"Arjuna\")\n\telse:\n\t\tprint(\"Bhima\") ", "m=[0, 0, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 0, 5, 2, 2, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 2, 7, 4, 0, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 2, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2]\n\nfor T in range(eval(input())):\n n=eval(input())\n if m[n]>0:print(\"Arjuna\")\n else:print(\"Bhima\")\n"] | {"inputs": [["4", "2", "4", "5", "6"]], "outputs": [["Arjuna", "Arjuna", "Bhima", "Arjuna"]]} | INTERVIEW | PYTHON3 | CODECHEF | 60,263 | |
ef4437abaac45933c57aa080079e5cfe | UNKNOWN | Coach Moony wants the best team to represent their college in ICPC. He has $N$ students standing in a circle with certain rating $X_i$ on a competitive coding platform. It is an established fact that any coder with more rating on the platform is a better coder.
Moony wants to send his best $3$ coders based upon their rating. But all coders only want to have their friends in their team and every coder is friends with four other coders, adjacent two on left side in the circle, and adjacent two on right. So Moony comes up with a solution that team with maximum cumulative rating of all three members in a team shall be representing their college.
You need to give the cumulative score of the team that will be representing the college.
-----Input:-----
- First line will contain $T$, number of testcases.
- First line of each test case contains a single integer $N$.
- Second line of each test case takes $N$ integers, denoting rating of $ith$ coder.
-----Output:-----
For each testcase, output a single integer denoting cumulative rating of the team.
-----Constraints-----
- $1 \leq T \leq 10$
- $7 \leq N \leq 10^5$
- $0 \leq X_i \leq 10^9$
-----Sample Input:-----
1
7
10 40 30 30 20 0 0
-----Sample Output:-----
100 | ["# cook your dish here\r\n#Moony and ICPC team\r\nT = int(input())\r\n\r\nfor i in range(T):\r\n N,data = int(input()),list(map(int,input().split()))\r\n if(N==3):\r\n print(sum(data))\r\n else:\r\n best = data[0]+data[1]+data[2]\r\n overall = best\r\n k=len(data)\r\n for i in range(1,k-2):\r\n overall=overall - data[i-1] + data[i+2]\r\n if(overall>best):\r\n best = overall\r\n j=max(data[1],data[-2])\r\n l= data[-1]+data[0]+j\r\n if(best < l):\r\n best = l\r\n print(best)", "def func(n,l):\r\n if(n<=3):\r\n return sum(l)\r\n else:\r\n s=0\r\n for i in range(n-2):\r\n temp = sum(l[i:i+3:])\r\n if(temp>s):\r\n s = temp\r\n temp = l[n-1]+l[0]+l[1]\r\n if(temp>s):\r\n s = temp\r\n temp = l[n-1]+l[n-2]+l[0]\r\n if(temp>s):\r\n s = temp\r\n \r\n return s\r\nt = int(input())\r\nfor i in range(t):\r\n n = int(input())\r\n l = list(map(int,input().split()))\r\n print(func(n,l))\r\n \r\n", "for i in range(int(input())):\n\tn = int(input())\n\tarr = list(map(int,input().split()))\n\tarr_sum = []\n\tfor i in range(len(arr)):\n\t\tarr_sum.append(arr[i]+arr[(i+1)%n]+arr[(i+2)%n])\n\tprint(max(arr_sum))\n", "t=int(input())\nfor s in range(0,t):\n n=int(input())\n l=list(map(int,input().strip().split()))\n a=len(l)\n i=0\n max=-999999\n while(i<a):\n sum=0\n if(i==(a-1)):\n sum=l[i]+l[0]+l[1]\n elif(i==(a-2)):\n sum=l[i]+l[i+1]+l[0]\n else:\n sum=l[i]+l[i+1]+l[i+2]\n if(sum>max):\n max=sum\n i=i+1\n print(max)", "'''t = int(input())\nfor i in range(t):\n n = int(input())\n l = list(map(int, input().strip().split()))\n if(n==3):\n print(l[0]+l[1]+l[2])\n elif(n==4):\n print(sum(l)-min(l))\n else:\n ans=0\n for i in range(n):\n k = [0 for i in range(5)]\n k[0]=l[i]\n k[1]=l[(i+n+1)%n]\n k[2] = l[(i+n+2)%n]\n k[3] = l[i-1]\n k[4] = l[i-2]\n k.sort()\n p = k[2]+k[3]+k[4]\n if(p>ans):\n ans=p\n print(ans)'''\nt = int(input())\nfor i in range(t):\n n = int(input())\n l = list(map(int, input().strip().split()))\n if(n==3):\n print(sum(l))\n else:\n ans=0\n for j in range(n):\n p = l[j]+l[(j+n+1)%n]+l[(j+n+2)%n]\n if(p>ans):\n ans=p\n p = l[n-2]+l[n-1]+l[0]\n if(p>ans):\n ans=p\n p = l[1]+l[n-1]+l[0]\n if(p>ans):\n ans=p\n print(ans)\n \n \n", "m=int(input())\r\nfor i in range(0,m):\r\n n=int(input())\r\n a=list(map(int,input().strip().split()))\r\n l=len(a)\r\n j=0\r\n max=-999999\r\n while(j<l):\r\n sum=0\r\n if(j==(l-1)):\r\n sum=a[j]+a[0]+a[1]\r\n elif(j==(l-2)):\r\n sum=a[j]+a[j+1]+a[0]\r\n else:\r\n sum=a[j]+a[j+1]+a[j+2]\r\n if(sum>max):\r\n max=sum\r\n j=j+1\r\n print(max)", "try:\n t=int(input())\n for s in range(0,t):\n n=int(input())\n l=list(map(int,input().strip().split()))\n a=len(l)\n i=0\n max=-999999\n while(i<a):\n sum=0\n if(i==(a-1)):\n sum=l[i]+l[0]+l[1]\n elif(i==(a-2)):\n sum=l[i]+l[i+1]+l[0]\n else:\n sum=l[i]+l[i+1]+l[i+2]\n if(sum>max):\n max=sum\n i=i+1\n print(max)\nexcept:\n pass", "t=int(input())\r\nfor s in range(0,t):\r\n n=int(input())\r\n l=list(map(int,input().strip().split()))\r\n a=len(l)\r\n i=0\r\n max=-999999\r\n while(i<a):\r\n sum=0\r\n if(i==(a-1)):\r\n sum=l[i]+l[0]+l[1]\r\n elif(i==(a-2)):\r\n sum=l[i]+l[i+1]+l[0]\r\n else:\r\n sum=l[i]+l[i+1]+l[i+2]\r\n if(sum>max):\r\n max=sum\r\n i=i+1\r\n print(max)", "t=int(input())\r\nfor s in range(0,t):\r\n n=int(input())\r\n l=list(map(int,input().strip().split()))\r\n a=len(l)\r\n i=0\r\n max=-999999\r\n while(i<a):\r\n sum=0\r\n if(i==(a-1)):\r\n sum=l[i]+l[0]+l[1]\r\n elif(i==(a-2)):\r\n sum=l[i]+l[i+1]+l[0]\r\n else:\r\n sum=l[i]+l[i+1]+l[i+2]\r\n if(sum>max):\r\n max=sum\r\n i=i+1\r\n print(max)", "# cook your dish here\nfrom sys import stdin,stdout\n\ns=\"\"\nt=int(stdin.readline())\nfor _ in range(t):\n\tn=int(stdin.readline())\n\ta=list(map(int,stdin.readline().split()))\n\tm=0\n\tfor i in range(-1,n-2):\n\t\tx=a[i]+a[i+1]+a[i+2]\n\t\tif m<x:\n\t\t\tm=x\n\tx=a[n-2]+a[n-1]+a[0]\n\tif m<x:\n\t\tm=x\n\ts+=str(m)+\"\\n\"\n\t\nstdout.write(s)", "t=int(input()) \r\nwhile t>0:\r\n n=int(input())\r\n li=list(map(int,input().strip().split()))[:n]\r\n sum = 0; start = 0; end = 3 - 1; \r\n for i in range(3) : \r\n sum += li[i]; \r\n ans = sum; \r\n for i in range(3, n + 3) : \r\n sum += li[i % n] - li[(i - 3) % n]; \r\n if (sum > ans) : \r\n ans = sum; \r\n start = (i - 3 + 1) % n; \r\n end = i % n;\r\n print(ans)\r\n t=t-1\r\n\r\n\r\n\r\n", "# cook your dish here\nimport sys\n\ntt=int(sys.stdin.readline())\n\nfor _ in range(tt):\n nn=int(sys.stdin.readline())\n arr=list(map(int,sys.stdin.readline().split()))\n maxx=arr[0]+arr[1]+arr[2]\n summ=maxx\n for i in range(nn-3):\n summ=summ-arr[i]+arr[i+3]\n maxx=max(summ,maxx)\n if(arr[-1]+arr[-2]+arr[0]>maxx):\n maxx=arr[-1]+arr[-2]+arr[0]\n print(maxx)", "# cook your dish here\nt=int(input())\nfor s in range(0,t):\n n=int(input())\n l=list(map(int,input().strip().split()))\n a=len(l)\n i=0\n max=-999999\n while(i<a):\n sum=0\n if(i==(a-1)):\n sum=l[i]+l[0]+l[1]\n elif(i==(a-2)):\n sum=l[i]+l[i+1]+l[0]\n else:\n sum=l[i]+l[i+1]+l[i+2]\n if(sum>max):\n max=sum\n i=i+1\n print(max)", "# cook your dish here\r\nfor _ in range(int(input())):\r\n n=int(input())\r\n x=list(map(int, input().split()))\r\n x.append(x[0])\r\n x.append(x[1])\r\n n+=2\r\n s=0\r\n if(n<=3):\r\n print(sum(x))\r\n continue\r\n for i in range(n-3):\r\n if(sum(x[i:i+3])>s):\r\n s=sum(x[i:i+3])\r\n print(s)", "for _ in range(int(input())):\n n=int(input())\n x=list(map(int, input().split()))\n x.append(x[0])\n x.append(x[1])\n n+=2\n s=0\n if(n<=3):\n print(sum(x))\n continue\n for i in range(n-3):\n if(sum(x[i:i+3])>s):\n s=sum(x[i:i+3])\n print(s)", "try:\n t=int(input())\n for s in range(0,t):\n n=int(input())\n l=list(map(int,input().strip().split()))\n a=len(l)\n i=0\n max=-999999\n while(i<a):\n sum=0\n if(i==(a-1)):\n sum=l[i]+l[0]+l[1]\n elif(i==(a-2)):\n sum=l[i]+l[i+1]+l[0]\n else:\n sum=l[i]+l[i+1]+l[i+2]\n if(sum>max):\n max=sum\n i=i+1\n print(max)\nexcept:\n pass\n", "try:\n t=int(input())\n for s in range(0,t):\n n=int(input())\n l=list(map(int,input().strip().split()))\n a=len(l)\n i=0\n max=-999999\n while(i<a):\n sum=0\n if(i==(a-1)):\n sum=l[i]+l[0]+l[1]\n elif(i==(a-2)):\n sum=l[i]+l[i+1]+l[0]\n else:\n sum=l[i]+l[i+1]+l[i+2]\n if(sum>max):\n max=sum\n i=i+1\n print(max)\nexcept:\n pass\n", "# cook your dish here\nT = int(input())\n\nfor i in range(T):\n N,data = int(input()),list(map(int,input().split()))\n if(N==3):\n print(sum(data))\n else:\n best = data[0]+data[1]+data[2]\n overall = best\n for i in range(1,len(data)-2):\n overall=overall - data[i-1] + data[i+2]\n if(overall>best):\n best = overall\n if(best < data[-1]+data[0]+max(data[1],data[-2])):\n best = data[-1] + data[0] + max(data[1],data[-2])\n print(best)", "t=int(input())\r\nfor i in range(t):\r\n\tn=int(input())\r\n\tarr=list(map(int,input().split()))\r\n\tans=[]\r\n\tfor j in range(n):\r\n\t\tm=sum([arr[j%n],arr[(j+1)%n],arr[(j+2)%n]])\r\n\t\tans.append(m)\r\n\tprint(max(ans))\r\n", "# cook your dish here\nimport sys\n\nt=int(sys.stdin.readline())\n\nfor _ in range(t):\n n=int(sys.stdin.readline())\n arr=list(map(int,sys.stdin.readline().split()))\n maxx=arr[0]+arr[1]+arr[2]\n summ=maxx\n for i in range(n-3):\n summ=summ-arr[i]+arr[i+3]\n maxx=max(summ,maxx)\n if(arr[-1]+arr[-2]+arr[0]>maxx):\n maxx=arr[-1]+arr[-2]+arr[0]\n print(maxx)", "# cook your dish here\nt = int(input())\nfor _ in range(t):\n n = int(input())\n max_rating = 0\n arr = list(map(int,input().split()))\n for i in range(1,len(arr)):\n if i < n-1:\n x = arr[i-1]+arr[i]+arr[i+1]\n else:\n x = arr[i-1]+arr[i]+arr[(i+1)%n]\n max_rating = max(x,max_rating)\n print(max_rating)", "T=int(input())\r\nfor t in range(T):\r\n N=int(input())\r\n X=list(map(int,input().split())) \r\n mx=0\r\n for i in range(N):\r\n if mx<X[i%N]+X[(i+1)%N]+X[(i+2)%N]:\r\n mx=X[i%N]+X[(i+1)%N]+X[(i+2)%N]\r\n print(mx) ", "# cook your dish here\nt = int(input())\n\nfor _ in range(t):\n l = []\n n = int(input())\n temp = list(map(int, input().split()))\n l = temp[n - 2: n]\n l.extend(temp)\n l.extend(temp[: 3])\n tx = sum(l[:3])\n mx = tx\n for i in range(3, len(l)):\n \n mx = max(mx, tx - l[i - 3] + l[i])\n tx = tx - l[i - 3] + l[i]\n \n print(mx)", "J = int(input())\n\nfor i in range(J):\n N,data = int(input()),list(map(int,input().split()))\n if(N==3):\n print(sum(data))\n else:\n best = data[0]+data[1]+data[2]\n overall = best\n for i in range(1,len(data)-2):\n overall=overall - data[i-1] + data[i+2]\n if(overall>best):\n best = overall\n if(best < data[-1]+data[0]+max(data[1],data[-2])):\n best = data[-1] + data[0] + max(data[1],data[-2])\n print(best)", "J = int(input())\n\nfor i in range(J):\n N,data = int(input()),list(map(int,input().split()))\n if(N==3):\n print(sum(data))\n else:\n best = data[0]+data[1]+data[2]\n overall = best\n for i in range(1,len(data)-2):\n overall=overall - data[i-1] + data[i+2]\n if(overall>best):\n best = overall\n if(best < data[-1]+data[0]+max(data[1],data[-2])):\n best = data[-1] + data[0] + max(data[1],data[-2])\n print(best)"] | {"inputs": [["1", "7", "10 40 30 30 20 0 0"]], "outputs": [["100"]]} | INTERVIEW | PYTHON3 | CODECHEF | 11,320 | |
7e86e5ab4764b6bfffba41cd95c22c7a | UNKNOWN | We all know how great ABD aka AB-DE-VILLIERS is. However his team mates were jealous of him and posed a problem for him to solve.The problem description is as follows :
Given an array of integers,find the length of the largest subarray(contiguous) of the given array with the maximum possible GCD (Greatest Common Divisor).
For info on GCD ,see this link: https://en.wikipedia.org/wiki/Greatest_common_divisor
GCD of the subarray is defined as the GCD of all the elements of the subarray.
As ABD is not aware of competitive programming he asks your help. Help him!
-----Input-----
First line will contain integer N denoting the size of array.
Second line will contain N integers denoting array elements.
-----Output-----
The answer as specified in the problem statement .
-----Constraints-----
1 <= N <= 1000000
1 <= array[i] <=100000000000
-----Example-----
Input:
4
2 4 8 3
Output:
1
Explanation
GCD of all possible subarrays of the given array are : 2 , 2 , 2 , 1 , 4 , 4, 1 , 8 , 1 , 3
Largest GCD possible : 8
Length of the largest subarray with GCD as 8 is 1
Hence answer is 1 . | ["n=eval(input())\na=list(map(int,input().split()))\nc=m=0\nmaxi=max(a)\nfor i in range(n):\n if a[i]==maxi:\n c+=1\n m=max(c,m)\n else:\n c=0\nprint(m) ", "from fractions import gcd as G\nn=eval(input())\nflag=1\narr=list(map(int,input().split()))\na=max(arr)\nbest = 0\nI_I = 0\nwhile I_I<n:\n if arr[I_I]==a:\n k=I_I\n while k<n and arr[k]==a:\n k+=1\n best = max(best, k-I_I)\n I_I = k\n else: I_I+=1\n\nprint(best)\n\n", "n = int(input())\na = list(map(int,input().split()))\nm = max(a)\nans = 0\ni = 0\nwhile (i<n):\n temp = 0\n if (a[i]==m):\n while (i<n and a[i]==m):\n i+=1\n temp+=1\n ans = max(ans,temp)\n else:\n i+=1\n \nprint(ans)"] | {"inputs": [["4", "2 4 8 3"]], "outputs": [["1"]]} | INTERVIEW | PYTHON3 | CODECHEF | 662 | |
d2eb45ecb073cd7819dfd49aa68052f8 | UNKNOWN | Chef has a sequence of positive integers $A_1, A_2, \ldots, A_N$. He wants to split this sequence into two non-empty (not necessarily contiguous) subsequences $B$ and $C$ such that $\mathrm{GCD}\,(B) + \mathrm{GCD}\,(C)$ is maximum possible. Help him find this maximum value.
Note: The greatest common divisor (GCD) of a sequence of positive integers is the largest positive integer that divides each element of this sequence. For example, the GCD of the sequence $(8, 12)$ is $4$.
-----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 value of $\mathrm{GCD}\,(B) + \mathrm{GCD}\,(C)$.
-----Constraints-----
- $1 \le T \le 10$
- $2 \le N \le 10^5$
- $1 \le A_i \le 10^9$ for each valid $i$
-----Subtasks-----
Subtask #1 (20 points): $2 \le N \le 20$
Subtask #2 (80 points): original constraints
-----Example Input-----
1
4
4 4 7 6
-----Example Output-----
9
-----Explanation-----
Example case 1: For example, the sequence $A$ can be divided into subsequences $B = (4, 4, 6)$ and $C = (7)$. | ["from math import gcd\r\n\r\n__author__ = 'Prateek'\r\n\r\n\r\ndef test():\r\n n = int(input())\r\n a = list(map(int, input().split()))\r\n a = list(set(a))\r\n n = len(a)\r\n if len(a) == 1:\r\n print(2 * a[0])\r\n return\r\n g1 = [0 for i in range(n)]\r\n g2 = [0 for i in range(n)]\r\n g1[0] = a[0]\r\n g2[n - 1] = a[n - 1]\r\n for i in range(1, n):\r\n g1[i] = gcd(g1[i - 1], a[i])\r\n for i in range(n - 2, -1, -1):\r\n g2[i] = gcd(g2[i + 1], a[i])\r\n ans = 0\r\n for i in range(n):\r\n if i == 0:\r\n ans = max(ans, g2[i + 1] + a[i])\r\n elif i == n - 1:\r\n ans = max(ans, g1[i - 1] + a[i])\r\n else:\r\n ans = max(ans, gcd(g1[i - 1], g2[i + 1]) + a[i])\r\n print(ans)\r\n\r\n\r\nif __author__ == 'Prateek':\r\n t = int(input())\r\n for _ in range(t):\r\n test()\r\n", "from math import gcd\r\nfrom functools import reduce\r\nfor _ in range(int(input())):\r\n ans = 0\r\n n = int(input())\r\n a = list(map(int,input().split()))\r\n a = list(set(a))\r\n if len(a) == 1:\r\n print(a[0]*2)\r\n continue\r\n for i in range(len(a)):\r\n k = a[i]\r\n del(a[i])\r\n ans = max(ans, k + reduce(gcd,a))\r\n a.insert(i,k)\r\n print(ans)", "# cook your dish here\nimport math \nfor _ in range(int(input())):\n n=int(input())\n a=list(map(int,input().split()))\n newa=list(set(a))\n if len(newa)==1:\n print(newa[0]*2)\n elif len(newa)==2:\n print(sum(newa))\n else:\n newa.sort()\n m1=newa.pop()\n m2=newa.pop()\n gcd=newa[0]\n for i in range(1,len(newa)):\n gcd=math.gcd(gcd,newa[i])\n if gcd==1:\n break\n s1=math.gcd(gcd,m1)\n s2=math.gcd(gcd,m2)\n print(max(s1+m2,s2+m1))", "# cook your dish here\nimport math \nfor _ in range(int(input())):\n n=int(input())\n a=list(map(int,input().split()))\n newa=list(set(a))\n if len(newa)==1:\n print(newa[0]*2)\n elif len(newa)==2:\n print(sum(newa))\n else:\n newa.sort()\n m1=newa.pop()\n m2=newa.pop()\n gcd=newa[0]\n for i in range(1,len(newa)):\n gcd=math.gcd(gcd,newa[i])\n if gcd==1:\n break\n s1=math.gcd(gcd,m1)\n s2=math.gcd(gcd,m2)\n print(max(s1+m2,s2+m1))", "# cook your dish here\nimport math \nfor _ in range(int(input())):\n n=int(input())\n a=list(map(int,input().split()))\n newa=list(set(a))\n if len(newa)==1:\n print(newa[0]*2)\n elif len(newa)==2:\n print(sum(newa))\n else:\n newa.sort()\n m1=newa.pop()\n m2=newa.pop()\n gcd=newa[0]\n for i in range(1,len(newa)):\n gcd=math.gcd(gcd,newa[i])\n if gcd==1:\n break\n s1=math.gcd(gcd,m1)\n s2=math.gcd(gcd,m2)\n print(max(s1+m2,s2+m1))\n", "# cook your dish here\nimport math \nfor _ in range(int(input())):\n n=int(input())\n a=list(map(int,input().split()))\n newa=list(set(a))\n if len(newa)==1:\n print(newa[0]*2)\n elif len(newa)==2:\n print(sum(newa))\n else:\n newa.sort()\n m1=newa.pop()\n m2=newa.pop()\n gcd=newa[0]\n for i in range(1,len(newa)):\n gcd=math.gcd(gcd,newa[i])\n if gcd==1:\n break\n s1=math.gcd(gcd,m1)\n s2=math.gcd(gcd,m2)\n print(max(s1+m2,s2+m1))\n", "# cook your dish here\nimport math \nfor _ in range(int(input())):\n n=int(input())\n a=list(map(int,input().split()))\n newa=list(set(a))\n if len(newa)==1:\n print(newa[0]*2)\n elif len(newa)==2:\n print(sum(newa))\n else:\n newa.sort()\n m1=newa.pop()\n m2=newa.pop()\n gcd=newa[0]\n for i in range(1,len(newa)):\n gcd=math.gcd(gcd,newa[i])\n if gcd==1:\n break\n s1=math.gcd(gcd,m1)\n s2=math.gcd(gcd,m2)\n print(max(s1+m2,s2+m1))\n#import math as m\n# for _ in range(int(input())):\n# length = int(input())\n# arr = list(map(int,input().split()))\n# if (length==2):\n# print(arr[0]+arr[1])\n# else:\n# tmparr=list(set(arr))\n# tmparr.sort()\n# fmax =tmparr.pop()\n# smax=tmparr.pop()\n# p = len(tmparr)\n# if (p==0):\n# print(fmax+smax)\n# else: \n# result = tmparr[0]\n# for i in range(1,p):\n# result = m.gcd(tmparr[i],result)\n# gcd0 = result\n# gcdH = m.gcd(gcd0,fmax)\n# gcdSH = m.gcd(gcd0,smax)\n# case11 = fmax+gcdSH\n# case22 = smax+gcdH\n# print(max(case11,case22))\n", "# cook your dish here\nimport math as m\n# for _ in range(int(input())):\n# n=int(input())\n# a=list(map(int,input().split()))\n# newa=list(set(a))\n# if len(newa)==1:\n# print(newa[0]*2)\n# elif len(newa)==2:\n# print(sum(newa))\n# else:\n# newa.sort()\n# m=newa.pop()\n# gcd=newa[0]\n# for i in range(1,len(a)):\n# gcd=math.gcd(gcd,a[i])\n# if gcd==1:\n# break\n# print(m+gcd)\n\nfor _ in range(int(input())):\n length = int(input())\n arr = list(map(int,input().split()))\n if (length==2):\n print(arr[0]+arr[1])\n else:\n tmparr=list(set(arr))\n tmparr.sort()\n fmax =tmparr.pop()\n smax=tmparr.pop()\n p = len(tmparr)\n if (p==0):\n print(fmax+smax)\n else: \n result = tmparr[0]\n for i in range(1,p):\n result = m.gcd(tmparr[i],result)\n gcd0 = result\n gcdH = m.gcd(gcd0,fmax)\n gcdSH = m.gcd(gcd0,smax)\n case11 = fmax+gcdSH\n case22 = smax+gcdH\n print(max(case11,case22))\n", "import math\r\nfor i in range(int(input())):\r\n n=int(input())\r\n a=list(map(int,input().split()))\r\n if len(set(a))==1:\r\n print(2*a[0])\r\n else:\r\n a=list(set(a))\r\n x,p=0,0\r\n z=max(a)\r\n a.remove(z)\r\n for i in range(len(a)):\r\n x=math.gcd(x,a[i])\r\n\r\n y=max(a)\r\n a.append(z)\r\n a.remove(y)\r\n for i in range(len(a)):\r\n p=math.gcd(p,a[i])\r\n print(max(z+x,p+y))", "from math import gcd\ndef gh(a,b):\n if len(a) and len(b):\n x=a[0]\n y=b[0]\n for i in a[1:]:\n x=gcd(x,i)\n for i in b[1:]:\n y=gcd(y,i)\n return x+y\n return 0\ndef abc(l):\n s=2**len(l)\n i=0\n d=\"{0:0\"+str(len(l))+\"b}\"\n ans=0\n while i<s:\n x=d.format(i)\n a=[]\n b=[]\n for j in range(len(l)):\n if x[j]=='1':\n a.append(l[j])\n else:\n b.append(l[j])\n ans=max(ans,gh(a,b))\n i+=1\n return ans\n \nimport random \nfor _ in range(int(input())):\n n=int(input())\n l=list(map(int,input().split()))\n #\n d={}\n for i in l:\n try:\n d[i]+=1\n except:\n d[i]=1\n x=list(d.keys())\n x.sort()\n if len(x)==1:\n print(2*l[0])\n else:\n ans=x[-1]\n c=x[0]\n for i in range(len(x)-1):\n c=gcd(c,x[i])\n vy=ans+c\n ans=x[-2]\n c=0\n for i in range(len(x)-2):\n c=gcd(c,x[i])\n c=gcd(c,x[-1])\n vx=ans+c\n print(max(vx,vy))\n \n \n", "import math\r\n\r\ndef __starting_point():\r\n for _ in range(int(input())):\r\n n=int(input())\r\n a=list(set(map(int, input().split())))\r\n n=len(a)\r\n flag=0\r\n if n==1:\r\n print(a[0]*2)\r\n else:\r\n Lgcd=[0]\r\n Rgcd=[0]\r\n for i in range(n):\r\n gcd=math.gcd(Lgcd[i],a[i])\r\n Lgcd.append(gcd)\r\n a=a[::-1]\r\n for i in range(n):\r\n gcd=math.gcd(Rgcd[i],a[i])\r\n Rgcd.append(gcd)\r\n Rgcd=Rgcd[::-1]\r\n \r\n a=a[::-1]\r\n ans=[]\r\n for i in range(n):\r\n gcd=a[i] + math.gcd(Lgcd[i],Rgcd[i+1])\r\n ans.append(gcd)\r\n # print(ans)\r\n print(max(ans))\r\n \r\n \r\n \r\n \r\n \r\n\r\n\r\n\r\n\r\n\n__starting_point()", "# cook your dish here\r\ndef gcd(x, y): \r\n while(y): \r\n x, y = y, x % y \r\n return x \r\ndef gcdlist(l):\r\n if(len(l)== 1):\r\n return l[0]\r\n else:\r\n num1 = l[0] \r\n num2 = l[1] \r\n gcdfinal = gcd(num1, num2) \r\n for i in range(2, len(l)): \r\n gcdfinal = gcd(gcdfinal, l[i]) \r\n return(gcdfinal)\r\nfor i in range(int(input())):\r\n n = int(input())\r\n a = list(map(int,input().split()))\r\n if(n==1):\r\n print(a[0])\r\n elif(n == 2):\r\n print(a[0]+a[1])\r\n else :\r\n max1 = 0 \r\n max2 = 0 \r\n for i in range(1,n):\r\n if (a[i] > max1):\r\n max2 = max1 \r\n max1 = a[i] \r\n elif (a[i] >max2 and a[i] !=max1) :\r\n max2= a[i]\r\n a1 = []\r\n a2 = []\r\n for i in range(n):\r\n\t if(a[i] != max1 ):\r\n\t a1.append(a[i])\r\n\t if (a[i] != max2):\r\n\t a2.append(a[i])\r\n if ( len(a1)== 0 ):\r\n\t print(a[0])\r\n else :\r\n g1=gcdlist(a1)\r\n g2 = gcdlist(a2)\r\n print(max(g1 + max1 ,g2+max2))\r\n\t \r\n \r\n \r\n ", "import math\r\nfor i in range(int(input())):\r\n n=int(input())\r\n a=list(map(int,input().split()))\r\n if len(set(a))==1:\r\n print(2*a[0])\r\n else:\r\n a=list(set(a))\r\n x,p=0,0\r\n z=max(a)\r\n a.remove(z)\r\n for i in range(len(a)):\r\n x=math.gcd(x,a[i])\r\n\r\n y=max(a)\r\n a.append(z)\r\n a.remove(y)\r\n for i in range(len(a)):\r\n p=math.gcd(p,a[i])\r\n print(max(z+x,p+y))", "# cook your dish here\nimport math\nfor _ in range(int(input())):\n n=int(input())\n a=list(map(int,input().split()))\n if len(set(a))==1:\n print(2*a[0])\n else:\n a=list(set(a))\n x,p=0,0\n z=max(a)\n a.remove(z)\n for i in range(len(a)):\n x=math.gcd(x,a[i])\n\n y=max(a)\n ##print(y)\n a.append(z)\n a.remove(y)\n for i in range(len(a)):\n p=math.gcd(p,a[i])\n print(max(z+x,p+y))", "# cook your dish here\nimport math\nfor _ in range(int(input())):\n n=int(input())\n a=list(map(int,input().split()))\n a=list(set(a))\n x,p=0,0\n z=max(a)\n a.remove(z)\n for i in range(len(a)):\n x=math.gcd(x,a[i])\n\n y=max(a)\n ##print(y)\n a.append(z)\n a.remove(y)\n for i in range(len(a)):\n p=math.gcd(p,a[i])\n print(max(z+x,p+y))\n", "def gcd(a,b):\n if b==0:\n return a\n else:\n return gcd(b,a%b)\n\n\nt=int(input())\nfor _ in range(t):\n n=int(input())\n l=list(map(int,input().split()))\n l=list(set(l))\n n=len(l)\n if(len(l)==1):\n print(l[0]*2)\n continue\n p=[0 for x in range(n)]\n s=[0 for x in range(n)]\n ans1=0\n p[0]=l[0]\n for i in range(1,n):\n p[i]=gcd(l[i],p[i-1])\n s[n-1]=l[n-1]\n for i in range(n-2,-1,-1):\n s[i]=gcd(l[i],s[i+1])\n #print(p)\n #print(s)\n for i in range(n):\n if(i==0):\n ans=s[i+1]+l[0]\n elif(i==n-1):\n ans=p[n-2]+l[n-1]\n else:\n ans=gcd(p[i-1],s[i+1])+l[i]\n #print(ans)\n ans1=max(ans1,ans)\n print(ans1)\n ", "def gcd(a,b):\n if b==0:\n return a\n else:\n return gcd(b,a%b)\n\n\nt=int(input())\nfor _ in range(t):\n n=int(input())\n l=list(map(int,input().split()))\n l=list(set(l))\n n=len(l)\n if(len(l)==1):\n print(l[0]*2)\n p=[0 for x in range(n)]\n s=[0 for x in range(n)]\n ans1=0\n p[0]=l[0]\n for i in range(1,n):\n p[i]=gcd(l[i],p[i-1])\n s[n-1]=l[n-1]\n for i in range(n-2,-1,-1):\n s[i]=gcd(l[i],s[i+1])\n #print(p)\n #print(s)\n for i in range(n):\n if(i==0):\n ans=s[i+1]+l[0]\n elif(i==n-1):\n ans=p[n-2]+l[n-1]\n else:\n ans=gcd(p[i-1],s[i+1])+l[i]\n #print(ans)\n ans1=max(ans1,ans)\n print(ans1)\n ", "from math import gcd\nfor _ in range(int(input())):\n input()\n li=sorted(list(set(list(int(i) for i in input().split()))))\n if len(li)==1:print(2*li[0])\n elif len(li)==2:print(sum(li))\n else:\n g=li[0]\n for i in range(1,len(li)-2):g=gcd(li[i],g)\n m=gcd(g,li[-2])+li[-1]\n n=gcd(g,li[-1])+li[-2]\n print(max(m,n))", "import math\r\nt=int(input())\r\nfor _ in range (t) :\r\n n=int(input())\r\n arr=[int(x)for x in input().split()]\r\n arr=list(dict.fromkeys(arr))\r\n arr.sort(reverse=True)\r\n if(len(arr)==1) :\r\n ans=2*arr[0]\r\n print(ans)\r\n continue\r\n n=len(arr)\r\n b=arr[0]\r\n c=arr[1]\r\n if(n>=3) :\r\n temp=arr[2]\r\n for i in range (2, n) :\r\n temp=math.gcd(temp,arr[i])\r\n bval=math.gcd(b,temp)\r\n cval=math.gcd(c,temp)\r\n ans=max(bval+c , b+cval)\r\n else :\r\n ans=b+c\r\n print(ans)\r\n \r\n", "# cook your dish here\n# cook your dish here\nhm={}\ndef gcd(a,b):\n if b>a:\n a,b=b,a\n if b==0:\n return a\n else:\n return gcd(b,a%b)\ndef gcd_list(l,n):\n gcd1=l[0]\n for i in range (1,n):\n gcd1=gcd(gcd1,l[i])\n return gcd1\n \nfor _ in range (int(input())):\n n=int(input())\n x=[int(n) for n in input().split()]\n l2=[]\n l=list(set(x))\n n=len(l)\n if n>2:\n hm={}\n temp=[]\n max1=max(l[0],l[1]) \n max2=min(l[0],l[1]) \n for i in range(2,len(l)): \n if l[i]>max1: \n max2=max1\n max1=l[i] \n else: \n if l[i]>max2: \n max2=l[i] \n m1=max1\n m2=max2\n l.remove(m1)\n l.remove(m2)\n gcd_1=l[0]\n for i in range (1,n-2):\n gcd_1=gcd(gcd_1,l[i])\n s1=gcd(gcd_1,m2)+m1\n s2=gcd(gcd_1,m1)+m2\n print(max(s1,s2))\n else:\n if n==1:\n print(l[0]*2)\n else:\n print(sum(l))\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n ", "import math\r\ndef cal_gcd(a):\r\n\tfirst=a[0]\r\n\tfor i in range(1,len(a)):\r\n\t\tfirst=math.gcd(first,a[i])\r\n\r\n\treturn first\r\n\r\nfor _ in range(int(input())):\r\n\tn=int(input())\r\n\ta=list(set(map(int,input().split())))\r\n\tn=len(a)\r\n\tif(n==1):\r\n\t\tprint(2*a[0])\r\n\telse:\r\n\t\ta.sort(reverse=True)\r\n\t\tb1=a[0]\r\n\t\tb2=a[1]\r\n\t\tif(n>=3):\r\n\t\t\tfirst=a[2]\r\n\t\t\tfor i in range(3,len(a)):\r\n\t\t\t\tfirst=math.gcd(first,a[i])\r\n\t\t\tprint(max(b1+math.gcd(first,b2), b2+math.gcd(first,b1)))\r\n\t\telse:\r\n\t\t\tprint(b1+b2)"] | {"inputs": [["1 ", "4 ", "4 4 7 6 ", ""]], "outputs": [["9"]]} | INTERVIEW | PYTHON3 | CODECHEF | 15,890 | |
81685b240bcc8a42c8ee869a228d1a20 | UNKNOWN | Mr. X has come up with a new string compression algorithm. Consider a string of length N which contains up to K distinct characters. The compression algorithm works as follows: Replace each maximal contiguous substring containing only one distinct character (repeated an arbitrary number of times) and replace it by 2 values: the character and the length of the substring.
For example, the string "aabbaaa" will be compressed to "a, 2, b, 2, a, 3". Thus the length of the compressed string is 6.
Since Mr. X is living in advanced times, the length of any integer is considered to be 1. For example, if a string is compressed to "a, 111, b, 13", then its length after compression is considered to be 4.
To test his algorithm, he needs to know the expected length of the compressed string for given N and K if the input string is randomly uniformly chosen from all possibilities. He wants to run this experiment multiple times for different N, K and needs your help.
-----Input-----
The first line of the input contains an integer T denoting the number of queries. The description of T test cases follows.
The first and only line of each test case contains two integers N and K denoting the number of letters in the input string and the maximum number of distinct characters that can be present in the string.
-----Output-----
For each test case, output a single line containing the expected length of the compressed string.
Your answer will be considered correct if the absolute error is less than 10-2
-----Constraints-----
- 1 ≤ T ≤ 105
- 1 ≤ N, K ≤ 109
-----Example-----
Input:
2
3 1
3 2
Output:
2.0
4.0
-----Explanation-----Example case 1:
There is only one string: aaa with compressed string = a, 3. Therefore length = 2
Example case 2
Input strings:
"aaa": "a, 3". Length = 2
"aab": "a, 2, b, 1". Length = 4
"aba": "a, 1, b, 1, a, 1". Length = 6
"abb": "a, 1, b, 2". Length = 4
"baa": "b, 1, a, 2". Length = 4
"bab": "b, 1, a, 1, b, 1". Length = 6
"bba": "b, 2, a, 1". Length = 4
"bbb": "b, 3". Length = 2
Expected value = (2+4+6+4+4+6+4+2)/8 = 32/8 = 4 | ["for _ in range(int(input())):\n\tn,k=map(int,input().split())\n\tprint(((2*n*(k-1))+2)/k)", "for _ in range(int(input())):\r\n\tn,k=map(int,input().split())\r\n\ta=((2*n*(k-1))+2)/k\r\n\tprint(a)", "# cook your dish here\nfor _ in range(int(input())):\n n,k=map(int,input().split())\n print(2+(n-1)*((2)-(2/k)))", "for t in range(int(input())):\n n,k=map(int,input().split())\n ans=(2*n)-(2*((n-1)/k))\n print(ans)", "# cook your dish here\nt=int(input())\nfor i in range(t):\n\tn,k=map(int,input().split())\n\tprint(2*(n*k-n+1)/k)", "test = int(input())\r\nwhile(test):\r\n n,k = map(int,input().split())\r\n print(2*n-(2*(n-1)/k))\r\n test-=1", "for _ in range(int(input())):\r\n n, k = map(int, input().split())\r\n print(2 * (((k - 1) * (n - 1) + k) / k))\r\n", "for _ in range(int(input())):\r\n n,k=map(int,input().split())\r\n print(2+(n-1)*((2)-(2/k)))", "t = int(input())\r\nwhile(t>0):\r\n\ts = input()\r\n\tn,c = s.split(\" \")\r\n\tn= int(n)\r\n\tc = int(c)\r\n\toutput = 2 + (n-1)*(2-2/c)\r\n\tprint(output,end=\"\")\r\n\tif(t>1):\r\n\t\tprint()\r\n\tt-=1", "# cook your dish here\ntest = int(input())\nwhile(test):\n n,k = map(int,input().split())\n print(2*n-(2*(n-1)/k))\n test-=1", "# cook your dish here\nfor _ in range(int(input())):\n n,k=map(int, input().split())\n print(2*(n-1)*(k-1)/k + 2)", "ans = \"\"\r\nfor t in range(int(input())):\r\n\tn, k = map(float, input().split())\r\n\tans += str(2*(n - (n-1)/k)) + \"\\n\"\r\n\r\nprint(ans)", "# cook your dish here\nT=int(input())\nfor i in range(T):\n\tN,K=input().split()\n\tN=int(N)\n\tK=int(K)\n\ta=2*(N-(N-1)/K)\n\tprint(a)", "T=int(eval(input()))\nfor i in range(T):\n\tn,k=list(map(int,input().split()))\n\tprint(2.0*(n-1)*(1-1/k)+2.0)", "T=int(input())\r\nfor i in range(T):\r\n\tN,K=input().split()\r\n\tN=int(N)\r\n\tK=int(K)\r\n\ta=2*(N-(N-1)/K)\r\n\tprint(a)", "def my(n,k):\r\n num = 2*(1+(k-1)*n)\r\n den = k\r\n return num/den\r\n\r\nfor _ in range(int(input())):\r\n n, k = map(int, input().split())\r\n print(my(n, k))", "for _ in range(int(input())):\r\n n, k = map(int, input().split())\r\n print((2*(n*k-n+1))/k)", "t=int(input())\r\nwhile t:\r\n n,k=input().split(\" \")\r\n n=int(n)\r\n k=int(k)\r\n ans=2*(n-((n-1)/k))\r\n print(ans)\r\n t-=1", "for _ in range(int(input())):\r\n n,k = map(int,input().split())\r\n print(2*(n-1)*(k-1)/k + 2)", "for _ in range(int(input())):\r\n n,k = map(int,input().split(\" \"))\r\n print(2 + (n - 1) * ((2 * (k - 1)) / k))", "for _ in range(int(input())):\r\n n,k = map(int,input().split(\" \"))\r\n print((2*k + 2*(k-1)*(n-1))/k)", "for _ in range(int(input())):\r\n\tn,k = [int(x) for x in input().split()]\r\n\tans = (1 + n*(k-1))/k\r\n\tprint(ans*2)", "from sys import stdin\r\n# t = int(input())\r\n# nks = stdin.readlines()\r\n# print(nks)\r\nfor _ in range(int(input())):\r\n n,k = [int(x) for x in input().split()]\r\n # n,k = [int(x) for x in line.split()]\r\n ans = (1 + n*(k-1))/k\r\n print(ans*2)"] | {"inputs": [["2", "3 1", "3 2", ""]], "outputs": [["2.0", "4.0"]]} | INTERVIEW | PYTHON3 | CODECHEF | 3,052 | |
0b2164057f21667cb7c6264222b1e497 | UNKNOWN | The chef is trying to decode 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:-----
0
01
10
010
101
010
0101
1010
0101
1010
-----EXPLANATION:-----
No need, else pattern can be decode easily. | ["t=int(input())\nfor t in range(t):\n n=int(input())\n for i in range(0,n):\n for j in range(0,n):\n if i%2==0:\n if j%2==0:\n print(0,end=\"\")\n else:\n print(1,end=\"\")\n else:\n if j%2==0:\n print(1,end=\"\")\n else:\n print(0,end=\"\")\n print()\n \n", "from sys import*\r\ninput=stdin.readline\r\nt=int(input())\r\nfor _ in range(t):\r\n k=int(input())\r\n l=[0 for _ in range(k)]\r\n for i in range(1,k):\r\n if l[i-1]==0:\r\n l[i]=1\r\n else:\r\n l[i]=0\r\n ans=\"\".join([str(x) for x in l])\r\n l1=[1 for _ in range(k)]\r\n for i in range(1,k):\r\n if l1[i-1]==1:\r\n l1[i]=0\r\n else:\r\n l1[i]=1\r\n ans1=\"\".join([str(x) for x in l1])\r\n for i in range(k):\r\n if (i%2)==0:\r\n print(ans)\r\n else:\r\n print(ans1)\r\n", "try:\n for i in range(int(input())):\n n=int(input())\n \n for j in range(1,n+1):\n if j%2!=0:\n s=0\n else:\n s=1\n for k in range(1,n+1):\n \n print(s,end=\"\")\n s=1-s\n print(\"\\r\")\nexcept Exception:\n pass\n", "# cook your dish here\nt=int(input())\nfor _ in range(t):\n n=int(input())\n s=\"\"\n for i in range(1,n+1):\n if i%2!=0:\n s+='1'\n else:\n s+='0'\n s1=''\n for i in range(1,n+1):\n if i%2==0:\n s1+='1'\n else:\n s1+='0'\n for i in range(1,n+1):\n if i%2==0:\n print(s)\n else:\n print(s1)", "# cook your dish here\nfor _ in range(int(input())):\n k = int(input())\n x = 0\n for i in range(k):\n y = x\n for j in range(k):\n print(y,end = '')\n if y == 0:\n y = 1\n else:\n y = 0\n if x == 0:\n x = 1\n else:\n x = 0\n print()", "def solve(n):\r\n if(n%2==0):\r\n for i in range(1,n+1):\r\n if(i%2):\r\n j=0\r\n else:\r\n j=1\r\n for k in range(1,n+1):\r\n print(j,end='')\r\n if j==1:\r\n j=0\r\n else:\r\n j=1\r\n print()\r\n else:\r\n j=0\r\n for i in range(1,n+1):\r\n for k in range(1,n+1):\r\n print(j,end='')\r\n if j==1:\r\n j=0\r\n else:\r\n j=1\r\n print()\r\nfor _ in range(int(input())):\r\n n=int(input())\r\n #s=input()\r\n #a,b=map(int,input().split())\r\n #l=list(map(int,input().split()))\r\n solve(n)\r\n", "t=int(input())\nfor i in range(0,t):\n n=int(input())\n for j in range(0,n):\n if j%2==0:\n for k in range(0,n):\n if k%2==0:\n print(0,end=\"\")\n else:\n print(1,end=\"\")\n else:\n for k in range(0,n):\n if k%2==0:\n print(1,end=\"\")\n else:\n print(0,end=\"\")\n print(\" \")\n ", "t = int(input())\r\n\r\nfor i in range(t):\r\n k = int(input()) \r\n ini = [j % 2 for j in range(0, k)]\r\n for j in range(0, k):\r\n print(''.join([str((x + j) % 2) for x in ini]))", "t = int(input())\r\n\r\nfor i in range(t):\r\n k = int(input()) \r\n ini = [j % 2 for j in range(0, k)]\r\n for j in range(0, k):\r\n print(''.join([str((x + j) % 2) for x in ini]))", "try:\r\n def solve(n):\r\n res=\"\"\r\n for i in range(n):\r\n if i%2==0:\r\n res+=\"0\"\r\n else:\r\n res+=\"1\"\r\n return res\r\n t=int(input())\r\n for _ in range(t):\r\n n = int(input())\r\n z1=solve(n)\r\n z2=\"\"\r\n for i in z1:\r\n if i==\"0\":\r\n z2+=\"1\"\r\n else:\r\n z2+=\"0\"\r\n for i in range(n):\r\n if(i%2==0):\r\n print(z1)\r\n else:\r\n print(z2)\r\nexcept EOFError:\r\n pass", "for i in range(int(input())):\n n= int(input())\n \n for j in range(0,n):\n s=\"\"\n for k in range(1,n+1):\n if (j+k)%2==1:\n s+=\"0\"\n else:\n s+=\"1\"\n print(s) \n", "# cook your dish here\n\n# t = [input() for i in range(n)]\n\n\ndef fk(s: str):\n s = int(s)\n # for i in range(2, 1+1+int(s)):\n # for k in range(i, i+s):\n # print(k, end='')\n # print()\n\n t = 0\n ini = 0\n q = 1\n for i in range(1, s*s+1):\n print(ini, end='')\n ini = 1-ini\n t += 1\n if t == s:\n q += 1\n print()\n t = 0\n if q % 2 == 0:\n ini = 1\n else:\n ini = 0\n\n # res = ''\n # ini = 1\n # for i in range(s):\n # res += str(ini)\n # ini = 1-ini\n # for i in range(s):\n # print(res)\n\n\nn = input()\nn = int(n)\nt = [fk(input()) for i in range(n)]\n\n# fk(5)\n", "# cook your dish here\n\n# cook your dish here\nt = int(input())\n\nwhile t:\n n = int(input())\n\n\n for i in range(1, n + 1):\n for j in range(1, n + 1):\n if i % 2 == 1:\n if j % 2 == 1:\n print(0, end='')\n else:\n print(1, end='')\n else:\n if j % 2 == 1:\n print(1, end='')\n else:\n print(0, end='')\n \n print()\n \n t -= 1", "# cook your dish here\nfor _ in range(int(input())):\n k = int(input())\n s = \"\"\n count = 1\n for i in range(k):\n for j in range(k):\n if count == 0:\n count = 1\n else:\n count = 0\n s += str(count)\n print(s)\n s = \"\"\n if k % 2 == 0:\n if count == 0:\n count = 1\n else:\n count = 0", "for _ in range(int(input())):\r\n n=int(input())\r\n if n==1:\r\n print(\"0\")\r\n else:\r\n s=''\r\n s2=''\r\n for i in range(n):\r\n if i%2==0:\r\n s+='0'\r\n s2+='1'\r\n else:\r\n s+='1'\r\n s2+='0'\r\n for i in range(n):\r\n if i%2==0:\r\n print(s)\r\n else:\r\n print(s2)", "# cook your dish here\nfor _ in range(int(input())):\n n=int(input())\n # c=1\n for i in range(0,n):\n for j in range(0,n):\n if (i+j)%2==0:\n print('0',end='')\n else:\n print('1',end=\"\")\n # print(i+j,end=\"\")\n # c+=2\n print()", "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 print((i+j)%2, end=\"\")\n print()", "for _ in range(int(input())):\r\n n = int(input())\r\n\r\n for i in range(n):\r\n s = ''\r\n\r\n for j in range(n):\r\n if not (i+j) % 2:\r\n s += '0'\r\n else:\r\n s += '1'\r\n\r\n print(s)"] | {"inputs": [["4", "1", "2", "3", "4"]], "outputs": [["0", "01", "10", "010", "101", "010", "0101", "1010", "0101", "1010"]]} | INTERVIEW | PYTHON3 | CODECHEF | 8,759 | |
c94a2bc775c62c31f3551a40404ac058 | UNKNOWN | The new Formula 1 season is about to begin and Chef has got the chance to work with the Formula 1 technical team.
Recently, the pre-season testing ended and the technical team found out that their timing system for qualifying was a little bit buggy. So, they asked Chef to fix it before the season begins.
His task is to write a program to find the starting lineup of the race by taking the timings of the drivers in qualifying.
(If you don’t know the rules that make the starting grid in Formula 1, consider that the driver with the least time will start at the front).
Note:
- Two or more drivers can have the same name.
- Every driver will have a distinct time.
-----Input:-----
- The first line of the input consists of a single integer $T$ denoting the number of test cases.
- First line of each test case consists of a single integer $N$ denoting the number of drivers to set a time.
- The following $2*N$ lines consists of the driver’s name $S$ in one line and its timing details $X$ (in milliseconds) in the next line.
-----Output:-----
- For each test case output the starting lineup of the race i.e., name of each driver in the order they will start the race. Print each name in a new line.
-----Constraints-----
- 1 <= $T$ <= 10
- 1 <= $N$ <= 105
- 1 <= $|S|$ <= 20
- 1 <= $X$ <= 109
-----Subtasks-----
Subtask #1 (20 points):
- 1 <= $N$ <= 100
Subtask #2 (80 points):
- Original Constraints
-----Sample Input:-----
2
3
Hamilton
75000
Vettel
76000
Bottas
75500
2
Leclerc
666666
Verstappen
666777
-----Sample Output:-----
Hamilton
Bottas
Vettel
Leclerc
Verstappen
-----EXPLANATION:-----
The drivers with the least time are ahead in the lineup. | ["# cook your dish here\nt=int(input())\nfor i in range(t):\n n=int(input())\n if n<101:\n l1=[]\n l2=[]\n d=dict()\n for i in range(1,2*n+1):\n if i%2==0:\n l1.append(int(input()))\n else:\n l2.append(str(input()))\n r1=[]\n for i in l1:\n r1.append(i)\n l1.sort()\n ind=[]\n for i in l1:\n a=r1.index(i)\n ind.append(a)\n for i in ind:\n print(l2[i])\n else:\n print(0)\n break\n \n", "# cook your dish here\nt=int(input())\nfor i in range(t):\n n=int(input())\n if n<101:\n l1=[]\n l2=[]\n d=dict()\n for i in range(1,2*n+1):\n if i%2==0:\n l1.append(int(input()))\n else:\n l2.append(str(input()))\n r1=[]\n for i in l1:\n r1.append(i)\n l1.sort()\n ind=[]\n for i in l1:\n a=r1.index(i)\n ind.append(a)\n for i in ind:\n print(l2[i])\n else:\n break\n \n", "t=int(input())\nop=\"\"\nfor j in range(0,t):\n n=int(input())\n d=dict()\n for i in range(0,n):\n s=input()\n tp=int(input())\n d[tp]=s\n for k in sorted(d):\n print(d[k])\nprint(op)", "t = int(input())\nfor _ in range(t):\n n = int(input())\n time = []\n l = dict()\n for __ in range(n):\n name = input()\n t = int(input())\n l[t] = name\n time.append(t)\n time.sort()\n for i in range(n):\n print(l[time[i]])", "# cook your dish here\nt=int(input())\nfor i in range(t):\n n=int(input())\n l1=[]\n l2=[]\n d=dict()\n for i in range(1,2*n+1):\n if i%2==0:\n l1.append(int(input()))\n else:\n l2.append(str(input()))\n r1=[]\n for i in l1:\n r1.append(i)\n l1.sort()\n ind=[]\n for i in l1:\n a=r1.index(i)\n ind.append(a)\n for i in ind:\n print(l2[i])\n \n", "t = int(input())\nfor _ in range(t):\n n = int(input())\n l = 2*n\n l1 = []\n l2 = []\n for i in range(l):\n if i%2 == 0:\n s = input()\n #x = input()\n l1.append(s)\n else:\n s = int(input())\n l2.append(s)\n #print(l2)\n t1 = []\n t1 = sorted(l2)\n \n t2 = []\n #print(t1)\n for i in t1:\n #print(l2.index(i))\n t2.append(l1[l2.index(i)])\n for j in t2: \n print(j)", "# cook your dish here\ntc = int(input())\nfor t in range(tc):\n n = int(input())\n tr=['']*n\n nr=['']*n\n ck=False\n for i in range(n):\n name = input()\n tim = int(input())\n if not ck:\n ck=True\n tr[0]=tim\n nr[0]=name\n else:\n tr[i]=tim\n nr[i]=name\n key=tr[i]\n kname=nr[i]\n k=i-1\n while k>=0 and tr[k]>key:\n tr[k+1]=tr[k]\n nr[k+1]=nr[k]\n k = k - 1\n tr[k+1]=key\n nr[k+1]=kname\n print(*nr,sep='\\n')", "# cook your dish here\ntc = int(input())\nfor t in range(tc):\n n = int(input())\n tr=['']*n\n nr=['']*n\n ck=False\n for i in range(n):\n name = input()\n tim = int(input())\n if not ck:\n ck=True\n tr[0]=tim\n nr[0]=name\n else:\n tr[i]=tim\n nr[i]=name\n for j in range(i+1):\n key=tr[j]\n kname=nr[j]\n k=j-1\n while k>=0 and tr[k]>key:\n tr[k+1]=tr[k]\n nr[k+1]=nr[k]\n k = k - 1\n tr[k+1]=key\n nr[k+1]=kname\n print(*nr,sep='\\n')", "# cook your dish here\nn=int(input())\nfor i in range(n):\n num=int(input())\n d={}\n for j in range(num):\n s=input()\n a=int(input())\n d[a]=s\n \n for j in sorted (d):\n print(d[j])", "T=int(input())\nwhile T:\n alist=[]\n N=int(input())\n for _ in range(N):\n S=input()\n X=int(input())\n alist.append(tuple([S,X]))\n alist=sorted(alist,key=lambda t1 :t1[1]) \n for _ in alist:\n print(_[0])\n T-=1 ", "# cook your dish here\nt=int(input())\nname=list()\ntime=list()\nro=list()\nfor i in range(t):\n n=int(input())\n for j in range(n):\n name.append(input())\n time.append(int(input()))\n p=time.copy()\n time.sort()\n for x in range(len(time)):\n for y in range(len(p)):\n if time[x]==p[y]:\n ro.append(y)\n for m in ro:\n print(name[m])\n name.clear()\n time.clear()\n ro.clear()\n p.clear()", "t=int(input())\nfor _ in range(t):\n n=int(input())\n arr=[]\n for i in range(n):\n pos=[]\n name=input()\n time=int(input())\n pos.append(time)\n pos.append(name)\n arr.append(pos)\n arr.sort()\n for i in range(n):\n print(arr[i][1])", "# cook your dish here\nt=int(input())\nname=list()\ntime=list()\nro=list()\nfor i in range(t):\n n=int(input())\n for j in range(n):\n name.append(input())\n time.append(int(input()))\n p=time.copy()\n time.sort()\n for x in range(len(time)):\n for y in range(len(p)):\n if time[x]==p[y]:\n ro.append(y)\n for m in ro:\n print(name[m])\n name.clear()\n time.clear()\n ro.clear()", "import operator\nfor _ in range(int(input())):\n n = int(input())\n d = dict()\n for i in range(n):\n value = input()\n key = int(input())\n d[key] = value\n for v in sorted(d):\n print(d[v])\n \n \n", "import collections\nfor _ in range(int(input())):\n playerSize = int(input())\n player = []\n values = []\n newValues = []\n for i in range(playerSize):\n player.append(input())\n values.append(int(input()))\n newValues = sorted(values)\n #print(values)\n #print(player)\n #print(newValues)\n for i in range(playerSize):\n for j in range(playerSize):\n if newValues[i]==values[j]:\n print(player[j])", "# cook your dish here\nfor _ in range(int(input())):\n d={}\n for __ in range(int(input())):\n name = str(input())\n time = int(input())\n d[time] = name\n d = dict(sorted(d.items()))\n for v in d.values():\n print(v) ", "def asc_merge_sort(time,name):\n length=len(time)\n if length>1:\n # finding the middle point if the timeay\n if length%2==0:\n mid=length//2\n else:\n mid=length//2+1\n\n # for dividing the timeay into two sub parts\n l = time[:mid]\n r =time[mid:]\n ll = name[:mid]\n rr =name[mid:]\n\n # sorting the both sub timeays\n asc_merge_sort(l,ll)\n asc_merge_sort(r,rr)\n \n i=j=k=0\n while i<len(l) and j< len(r):\n if l[i]<r[j]:\n time[k]=l[i]\n name[k]=ll[i]\n i+=1\n else:\n time[k]=r[j]\n name[k]=rr[j]\n j+=1\n k+=1\n while i<len(l):\n time[k]=l[i]\n name[k]=ll[i]\n i+=1\n k+=1\n while j<len(r):\n time[k]=r[j]\n name[k]=rr[j]\n j+=1\n k+=1\n return name\nfor _ in range(int(input())):\n nm=[]\n tm=[]\n n=int(input())\n for i in range(n):\n nm.append(input())\n tm.append(int(input()))\n ot=asc_merge_sort(tm,nm)\n for k in ot:\n print(k)\n \n", "for _ in range(int(input())):\n n=int(input())\n a=[]\n b=[]\n d=[]\n for i in range(n):\n a.append(input())\n b.append(int(input()))\n c=b\n c=sorted(c)\n for i in range(n):\n for j in range(n):\n if(c[i]==b[j]):\n d.append(a[j])\n for i in d:\n print(i)\n", "\nfor _ in range(int(input())):\n ranks = []\n lens = int(input())\n for i in range(lens):\n name = input()\n timing = int(input())\n ranks.append([name, timing])\n ranks = sorted(ranks, key = lambda x:x[1])\n for i in ranks:\n print(i[0])\n", "try:\n for _ in range(int(input())):\n n=int(input())\n driver=[]\n for __ in range(n):\n name=input()\n time=int(input())\n driver.append((name,time))\n driver.sort(key=lambda x: x[1])\n for ele in driver:\n print(ele[0])\nexcept:\n pass", "try:\n for _ in range(int(input())):\n n=int(input())\n driver=[]\n for __ in range(n):\n name=input()\n time=int(input())\n driver.append((name,time))\n driver.sort(key=lambda x: x[1])\n for ele in driver:\n print(ele[0])\n \nexcept:\n pass", "# cook your dish here\ndef takeSecond(elem):\n return elem[1]\n\nt = int(input())\nfor _ in range(t):\n # Input Section\n n = int(input())\n drivers_and_time = []\n for _ in range(n):\n driver = input()\n his_time = int(input())\n drivers_and_time.append((driver, his_time))\n # Logic and Output Section\n drivers_and_time.sort(key=takeSecond)\n for item in drivers_and_time:\n print(item[0])", "# cook your dish here\n\nt = int(input())\nfor rep in range(t):\n n = int(input())\n l = []\n for i in range(n):\n s = input()\n x = int(input())\n l.append([s,x])\n l.sort(key = lambda x: x[1])\n for j in l:\n print(j[0])", "# cook your dish here\nt=int(input())\nfor i in range(0,t):\n x=[]\n n=int(input())\n for j in range(0,n):\n name=str(input())\n time=int(input())\n s=(time,name)\n x.append(s)\n x=sorted(x,key=lambda x:(x[0],x[1])) \n for j in range(0,len(x)):\n print(x[j][1])", "# cook your dish here\nT=int(input())\nfor _ in range(T):\n N=int(input())\n l=[]\n for i in range(N):\n name=input()\n time=int(input())\n l.append((name,time))\n l=sorted(l,key=lambda ele:ele[1])\n for j in range(N):\n print(l[j][0])\n"] | {"inputs": [["2", "3", "Hamilton", "75000", "Vettel", "76000", "Bottas", "75500", "2", "Leclerc", "666666", "Verstappen", "666777"]], "outputs": [["Hamilton", "Bottas", "Vettel", "Leclerc", "Verstappen"]]} | INTERVIEW | PYTHON3 | CODECHEF | 8,328 | |
d4c4dd76660e8737adc215bbe1c8f920 | UNKNOWN | A beautiful sequence is defined as a sequence that do not have any repeating elements in it.
You will be given any random sequence of integers, and you have to tell whether it is a beautiful sequence or not.
-----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 elements in the sequence.
- The next line of the input contains $N$ space-separated integers $A1, A2, A3...An$ denoting the sequence.
-----Output:-----
- Print "prekrasnyy"(without quotes) if the given sequence is a beautiful sequence, else print "ne krasivo"(without quotes)
Note: each test case output must be printed on new line
-----Constraints:-----
- $1 \leq T \leq 10^2$
- $1 \leq N \leq 10^3$
- $1 \leq A1, A2, A3...An \leq 10^5$
-----Sample Input:-----
2
4
1 2 3 4
6
1 2 3 5 1 4
-----Sample Output:-----
prekrasnyy
ne krasivo
-----Explanation:-----
-
As 1st sequence do not have any elements repeating, hence it is a beautiful sequence
-
As in 2nd sequence the element 1 is repeated twice, hence it is not a beautiful sequence | ["# cook your dish here\nfor _ in range(int(input())):\n n = int(input())\n arr = list(map(int,input().split()))\n l = []\n for i in range(0, len(arr)): \n for j in range(i+1, len(arr)): \n if(arr[i] == arr[j]): \n l.append(arr[j])\n if (len(l) ==0):\n print(\"prekrasnyy\")\n else:\n print(\"ne krasivo\")", "for _ in range(int(input())):\n n = int(input())\n seq = list(map(int,input().split()))\n r = 0\n for i in seq:\n if seq.count(i) > 1:\n r+=1\n if r == 0:\n print(\"prekrasnyy\")\n else:\n print(\"ne krasivo\")", "for _ in range(int(input())):\n n = int(input())\n arr = sorted([int(k) for k in input().split()])\n res = True\n for i in range(len(arr) - 1):\n if(arr[i] == arr[i+1]):\n res = False\n break\n if(res):\n print(\"prekrasnyy\")\n else:\n print(\"ne krasivo\")\n", "# cook your dish here\ndef check(arr,n):\n for a in range(len(arr)):\n if a<len(arr)-1:\n if arr[a]==arr[a+1]:\n return True\n break\n return False\n\ndef __starting_point():\n t=int(input())\n n=[]\n l=[]\n for j in range(t):\n n.append(int(input()))\n l.append(list(map(int,input().split())))\n l[j].sort(reverse=True)\n for k in range(t):\n res = check(l[k], n[k])\n if (res):\n print(\"ne krasivo\")\n else:\n print(\"prekrasnyy\")\n__starting_point()", "# cook your dish here\nfor i in range(int(input())):\n n=int(input())\n arr=list(map(int,input().split()[:n]))\n arr.sort()\n flag=0\n for j in range(len(arr)-1):\n if arr[j]==arr[j+1]:\n print('ne krasivo')\n flag=1\n break;\n if flag==0:\n print('prekrasnyy')\n", "# cook your dish here\ndef pure_it(L, N):\n for j in range(1, N):\n if L[j - 1] == L[j]:\n return 'ne krasivo'\n return 'prekrasnyy'\n\nt = int(input())\nfor i in range(t):\n N = int(input())\n L = list(map(int, input().split()))\n L.sort()\n print(pure_it(L, N))", "for _ in range(int(input())):\n a=input()\n l=list(map(int,input().split()))\n c=0\n for i in l:\n if l.count(i)>1:\n c=1\n break\n if c==0:\n print(\"prekrasnyy\")\n else:\n print(\"ne krasivo\")\n", "ncases = int(input())\r\n\r\nfor cases in range(ncases):\r\n nlen = int(input())\r\n testlist = list( map( int, input().split()))\r\n if not testlist:\r\n continue\r\n #if len(testlist) != nlen:\r\n # continue\r\n mydict = set()\r\n beautiful = True\r\n for a in testlist:\r\n if a not in mydict:\r\n mydict.add(a)\r\n else:\r\n beautiful = False\r\n if beautiful:\r\n print(\"prekrasnyy\")\r\n else:\r\n print(\"ne krasivo\")\r\n \r\n", "# cook your dish here\nt=int(input())\nfor i in range(t):\n n=int(input())\n lst=list(map(int,input().split()))\n \n s=list(set(lst))\n if len(s)==len(lst):\n print(\"prekrasnyy\")\n else:\n print(\"ne krasivo\")\n", "# cook your dish here\nt = int(input())\nwhile t > 0:\n n = int(input())\n arr = input()\n arr = arr.split()\n if len(arr) == len(set(arr)):\n print(\"prekrasnyy\")\n else:\n print(\"ne krasivo\")\n # print(len(arr), len(set(arr)))\n \n t -= 1", "for _ in range(int(input())):\r\n n=int(input())\r\n a=list(map(int,input().split()))\r\n b=set(a)\r\n if len(b)!=len(a):\r\n print(\"ne krasivo\")\r\n else:\r\n print(\"prekrasnyy\")", "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 d = {}\r\n for ele in arr:\r\n d[ele] = d.get(ele, 0) + 1\r\n for ele in d:\r\n if d[ele] > 1:\r\n print(\"ne krasivo\")\r\n break\r\n else:\r\n print(\"prekrasnyy\")\r\n", "def c(data):\r\n n,d=data\r\n return 'prekrasnyy'if len(set(d))==n else'ne krasivo'\r\ndef l(): return [(int(input()), [int(x) for x in input().split()]) for _ in range(int(input()))]\r\ndef __starting_point():\r\n print('\\n'.join(map(c,l())))\n__starting_point()", "def c(data):\r\n n,d=data\r\n elem=[]\r\n for i in d:\r\n if i in elem:\r\n return 'ne krasivo'\r\n elem.append(i)\r\n else:\r\n return 'prekrasnyy'\r\n\r\ndef l(): return [(int(input()), [int(x) for x in input().split()]) for _ in range(int(input()))]\r\ndef __starting_point():\r\n print('\\n'.join(map(c,l())))\n__starting_point()", "for _ in range(int(input())): n = int(input());arr = list(map(int , input().split()));print(\"prekrasnyy\") if(len(arr) == len(set(arr))) else print(\"ne krasivo\")", "for _ in range(int(input())):\n\tn = int(input());arr = list(map(int , input().split()))\n\tprint(\"prekrasnyy\") if(len(arr) == len(set(arr))) else print(\"ne krasivo\")", "# 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 d = dict()\n Flag = 0\n for i in range(N):\n if A[i] in d:\n Flag = 1\n break\n else:\n d[A[i]] = 1\n if Flag == 0:\n print(\"prekrasnyy\")\n else:\n print(\"ne krasivo\")\n \n", "t = int(input())\r\nfor x in range(t):\r\n n = int(input())\r\n arr = input().split()\r\n mySet = set(arr)\r\n if sorted(arr)==sorted(list(mySet)):\r\n print(\"prekrasnyy\")\r\n else:\r\n print(\"ne krasivo\")\r\n", "for i in range(int(input())):\n n = int(input())\n a = list(map(int, input().split()))\n if(len(a) == len(set(a))):\n print(\"prekrasnyy\")\n else:\n print(\"ne krasivo\")\n", "t=int(input())\nfor i in range(t):\n l=int(input())\n se={int(j) for j in input().split(\" \")}\n if(l==len(se)):\n print(\"prekrasnyy\")\n else:\n print(\"ne krasivo\")", "# cook your dish heret\nt=int(input())\nw=[]\nfor i in range(t):\n n=int(input())\n s=list(map(int,input().split()))\n if len(set(s))==len(s):\n w.append(\"prekrasnyy\")\n else:\n w.append(\"ne krasivo\")\nfor i in w:\n print(i)\n \n", "for i in range(int(input())):\r\n val=int(input())\r\n data=list(map(int,input().split()))\r\n data1=list(data)\r\n for j in data:\r\n if data1.pop(0) in data1:\r\n print(\"ne krasivo\")\r\n break\r\n elif len(data1)==0:\r\n print(\"prekrasnyy\")", "# cook your dish here\nt=int(input())\nfor _ in range(t):\n n=int(input())\n l=list(map(int,input().split()))\n s=set(l)\n if(len(l)==len(s)):\n print(\"prekrasnyy\")\n else:\n print(\"ne krasivo\")", "n=int(input())\r\nfor i in range(n):\r\n \r\n m=int(input())\r\n l=list(map(int,input().split()))\r\n l.sort()\r\n a=set(l)\r\n if(len(a)==len(l)):\r\n print(\"prekrasnyy\")\r\n else:\r\n print(\"ne krasivo\")\r\n \r\n \r\n"] | {"inputs": [["2", "4", "1 2 3 4", "6", "1 2 3 5 1 4"]], "outputs": [["prekrasnyy", "ne krasivo"]]} | INTERVIEW | PYTHON3 | CODECHEF | 7,279 | |
727edbd932363b1971b48239441d9fd9 | UNKNOWN | Accepts a string from the user and print the reverse string as the output without using any built-in function.
-----Input:-----
Each testcase contains of a single line of input, a string.
-----Output:-----
For each testcase, output in a single line answer, the reverse string.
-----Sample Input:-----
1
Tracy
-----Sample Output:-----
ycarT | ["oo = int(input())\r\nfor i in range(oo):\r\n\tval = input()\r\n\tprint(val[::-1])", "for _ in range(int(input())):\n s=input()\n print(s[::-1])", "# cook your dish here\nt=int(input())\nfor _ in range(t):\n a=input()\n for i in range(len(a)-1,-1,-1):print(a[i],end=\"\")\n print()\n ", "t=int(input())\nfor i in range(t):\n a=input()\n print(a[::-1])", "# cook your dish here\nt=int(input())\nfor i in range(0,t):\n x=input()\n print(x[::-1])", "# cook your dish here\nt=int(input())\nwhile (t > 0) :\n st = input()\n for i in range(0,len(st)) :\n print(st[len(st)-1-i],end=\"\")\n t-=1\n\n\n\n\n\n", "# cook your dish here\nn=int(input())\nwhile(n):\n s=input()\n print(s[::-1])\n n-=1", "number_of_testcases = int(input())\n\ndef solve(string):\n n = len(string)\n for i in range(n-1,-1,-1):\n print(string[i],end=\"\")\n print()\n \nfor i in range(0,number_of_testcases):\n input_string = input()\n solve(input_string)", "# cook your dish here\nfor _ in range(int(input())):\n s=input()\n print(s[::-1])", "# cook your dish here\nfor _ in range(int(input())):\n s=input()\n print(s[::-1])", "t=input()\r\nt=int(t)\r\nwhile(t>0):\r\n\ts=input()\r\n\tfor i in range(len(s)-1,-1,-1):\r\n\t\tprint(s[i],end=\"\")\r\n\tt-=1\r\n \t\r\n \r\n", "x=int(input())\nfor i in range(x):\n z=input()\n print(z[::-1])", "# cook your dish here\nfor i in range(int(input())):\n s=input()\n for m in range(len(s)-1,-1,-1):\n print(s[m],end=\"\")\n print()", "# cook your dish here\nfor i in range(int(input())):\n s=input()\n for m in range(len(s)-1,-1,-1):\n print(s[m],end=\"\")\n print()", "# cook your dish here\nfor i in range(int(input())):\n s=input()\n for m in range(len(s)-1,-1,-1):\n print(s[m],end=\"\")\n print()", "t=int(input())\nwhile(t):\n s=input()\n ar=[str(x) for x in s]\n print(''.join(str(x) for x in ar[::-1]))\n t-=1", "# cook your dish here\nimport math\nfor _ in range(int(input())):\n s=input()\n print(s[::-1])", "# cook your dish here\nt = int(input())\nfor i in range(t):\n s = input()\n print(s[::-1])", "# cook your dish here\nn = int(input())\nfor i in range(n):\n s=input()\n print(s[::-1])", "t= int(input())\nfor i in range(t): \n\ts= input()\n\tsl= len(s)\n\tfor j in range(sl-1,-1,-1):\n\t\tprint(s[j],end=\"\")", "t=int(input())\nwhile(t):\n s=input()\n ar=[str(x) for x in s]\n print(''.join(str(x) for x in ar[::-1]))\n t-=1", "# cook your dish here\ncount = input()\nfor i in range(int(count)):\n stringToConvert = input()\n for i in reversed(range(len(stringToConvert))):\n print(stringToConvert[i],end='')\n print('\\n')\n", "for _ in range(int(input())):\n print(str(input())[::-1])", "N=int(input())\r\nwhile(N>0):\r\n N=N-1\r\n s=str(input())\r\n print(s[::-1])\r\n", "# cook your dish here\nfor t in range(int(input())):\n st=input()\n x=''.join(reversed(st))\n print(x)\n"] | {"inputs": [["1", "Tracy"]], "outputs": [["ycarT"]]} | INTERVIEW | PYTHON3 | CODECHEF | 3,035 | |
3f774ffb7889a8ae54faef841302330f | UNKNOWN | You are given a dataset consisting of $N$ items. Each item is a pair of a word and a boolean denoting whether the given word is a spam word or not.
We want to use this dataset for training our latest machine learning model. Thus we want to choose some subset of this dataset as training dataset. We want to make sure that there are no contradictions in our training set, i.e. there shouldn't be a word included in the training set that's marked both as spam and not-spam. For example item {"fck", 1}, and item {"fck, 0"} can't be present in the training set, because first item says the word "fck" is a spam, whereas the second item says it is not, which is a contradiction.
Your task is to select the maximum number of items in the training set.
Note that same pair of {word, bool} can appear multiple times in input. The training set can also contain the same pair multiple times.
-----Input-----
- First line will contain $T$, number of test cases. Then the test cases follow.
- 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 a string $w_i$, followed by a space and an integer(boolean) $s_i$, denoting the $i$-th item.
-----Output-----
For each test case, output an integer corresponding to the maximum number of items that can be included in the training set in a single line.
-----Constraints-----
- $1 \le T \le 10$
- $1 \le N \le 25,000$
- $1 \le |w_i| \le 5$ for each valid $i$
- $0 \le s_i \le 1$ for each valid $i$
- $w_1, w_2, \ldots, w_N$ contain only lowercase English letters
-----Example Input-----
3
3
abc 0
abc 1
efg 1
7
fck 1
fck 0
fck 1
body 0
body 0
body 0
ram 0
5
vv 1
vv 0
vv 0
vv 1
vv 1
-----Example Output-----
2
6
3
-----Explanation-----
Example case 1: You can include either of the first and the second item, but not both. The third item can also be taken. This way the training set can contain at the very max 2 items.
Example case 2: You can include all the items except the second item in the training set. | ["t = int(input())\n\nfor _ in range(t):\n n = int(input())\n \n a = {}\n \n for i in range(n):\n l = input()\n \n if l not in a:\n a[l] = 1\n else:\n a[l] += 1\n \n done = []\n ans = 0\n \n for i in a:\n if a[i] != 0:\n temp = [x for x in i.split()]\n v = temp[0]\n \n v0 = v + \" 0\"\n v1 = v + \" 1\"\n \n if(v0 in a and v1 in a):\n if a[v0] > a[v1]:\n ans += a[v0]\n else:\n ans += a[v1]\n \n a[v0] = a[v1] = 0\n elif(v0 in a):\n ans += a[v0]\n a[v0] = 0\n elif(v1 in a):\n ans += a[v1]\n a[v1] = 0\n \n print(ans)", "t=int(input())\nans=[]\nfor i in range(t):\n count=0\n d=dict()\n n=int(input())\n count=0\n for j in range(n):\n x,y=input().split()\n y=int(y)\n if(x not in d):\n d[x]=[0,0]\n d[x][y]+=1\n for i in d:\n count+=max(d[i])\n ans.append(count)\nfor i in ans:\n print(i)", "t=int(input())\nans=[]\nfor i in range(t):\n count=0\n d=dict()\n n=int(input())\n count=0\n for j in range(n):\n x,y=input().split()\n y=int(y)\n if(x not in d):\n d[x]=[0,0]\n d[x][y]+=1\n for i in d:\n count+=max(d[i])\n ans.append(count)\nfor i in ans:\n print(i)", "t=int(input())\nans=[]\nfor i in range(t):\n count=0\n d=dict()\n n=int(input())\n count=0\n for j in range(n):\n x,y=input().split()\n y=int(y)\n if(x not in d):\n d[x]=[0,0]\n d[x][y]+=1\n for i in d:\n count+=max(d[i])\n ans.append(count)\nfor i in ans:\n print(i)", "from collections import OrderedDict\r\n\r\nfor i in range(int(input())):\r\n N = int(input())\r\n dic = OrderedDict()\r\n for i in range(N):\r\n n, m = list(input().split())\r\n if n in dic :\r\n if m=='1':\r\n dic[n][1]+=1\r\n else :\r\n dic[n][0]+=1\r\n else :\r\n if m=='1':\r\n dic[n] = [0,1]\r\n else :\r\n dic[n]=[1,0]\r\n count = 0\r\n for k,v in dic.items():\r\n count+= max(v[0],v[1])\r\n print(count)", "# cook your dish here\nfrom collections import defaultdict\nfor _ in range(int(input())):\n mp = defaultdict(lambda:0)\n sat = set()\n for _ in range(int(input())):\n w,s = input().split()\n mp[w,s]+=1\n sat.add(w)\n ans = 0\n for i in sat:\n ans += max(mp[i,'0'],mp[i,'1'])\n print(ans)\n \n ", "#by nikkipinky\nfor _ in range(int(input())):\n n=int(input())\n countPairs=dict()\n for i in range(n):\n word,spam=input().split()\n spam=int(spam)\n if(word not in countPairs):\n countPairs[word]=[0,0]\n countPairs[word][spam]+=1\n finalcount=0\n for i in countPairs:\n finalcount+=max(countPairs[i])\n print(finalcount)", "for _ in range(int(input())):\n d = dict()\n count = 0\n for i in range(int(input())):\n ip = input().split()\n if ip[0] in d:\n if int(ip[1]) == 1:\n d[ip[0]][1] += 1\n else:\n d[ip[0]][0] += 1\n else:\n if int(ip[1]) == 1:\n d.update({\n ip[0]: {0: 0, 1: 1}\n })\n else:\n d.update({\n ip[0]: {0: 1, 1: 0}\n })\n for j in d.values():\n count += max(j.values())\n print(count)", "# cook your dish here\nT = int(input())\nfor i in range(T):\n n=int(input())\n d=dict()\n for i in range(n):\n x,y=input().split()\n y=int(y)\n if x not in d:\n d[x]=[0,0]\n d[x][y]+=1\n res=0\n for i in d:\n res+=max(d[i])\n print(res)", "# cook your dish here\nfor _ in range(int(input())):\n n=int(input())\n d=dict()\n for i in range(n):\n x,y=input().split()\n y=int(y)\n if x not in d:\n d[x]=[0,0]\n d[x][y]+=1\n ans=0\n for i in d:\n ans+=max(d[i])\n \n \n print(ans)\n ", "t=int(input())\r\nfor T in range(0,t):\r\n n=int(input())\r\n dict0 = {}\r\n dict1 = {}\r\n total = 0\r\n listset = set()\r\n for i in range(0,n):\r\n a,b=map(str,input().split())\r\n listset.add(a)\r\n if b == '0':\r\n if a in dict0 :\r\n dict0[a] += 1\r\n else:\r\n dict0[a] = 1\r\n else:\r\n if a in dict1 :\r\n dict1[a] += 1\r\n else:\r\n dict1[a] = 1\r\n\r\n for j in listset:\r\n if j in dict0 and j in dict1:\r\n if dict0[j]<dict1[j]:\r\n total += dict1[j]\r\n else:\r\n total += dict0[j]\r\n elif j in dict0:\r\n total += dict0[j]\r\n else:\r\n total += dict1[j]\r\n print(total)", "T=int(input())\nfor q in range(T):\n n=int(input())\n d=dict()\n for i in range(n):\n x,y=input().split()\n y=int(y)\n if x not in d:\n d[x]=[0,0]\n d[x][y]+=1\n tot=0\n for j in d:\n tot+=max(d[j])\n print(tot)", "# cook your dish here\r\ntry:\r\n t=int(input())\r\n while(t>0):\r\n t-=1\r\n n=int(input())\r\n check={}\r\n sm=0\r\n for i in range(n):\r\n st,bl=input().split(' ')\r\n if st in check:\r\n if bl=='0':\r\n check[st][0]+=1\r\n else:\r\n check[st][1]+=1\r\n else:\r\n if bl=='0':\r\n check[st]=[1,0]\r\n else:\r\n check[st]=[0,1]\r\n for i in check:\r\n sm=sm+max(check[i])\r\n print(sm)\r\nexcept EOFError:\r\n pass", "# cook your dish here\ntry:\n t=int(input())\n while(t>0):\n t-=1\n n=int(input())\n check={}\n sm=0\n for i in range(n):\n st,bl=input().split(' ')\n if st in check:\n if bl=='0':\n check[st][0]+=1\n else:\n check[st][1]+=1\n else:\n if bl=='0':\n check[st]=[1,0]\n else:\n check[st]=[0,1]\n for i in check:\n sm=sm+max(check[i])\n print(sm)\nexcept EOFError:\n pass", "try:\n t=int(input())\n while(t>0):\n t-=1\n n=int(input())\n check={}\n sm=0\n for i in range(n):\n st,bl=input().split(' ')\n if st in check:\n if bl=='0':\n check[st][0]+=1\n else:\n check[st][1]+=1\n else:\n if bl=='0':\n check[st]=[1,0]\n else:\n check[st]=[0,1]\n for i in check:\n sm=sm+max(check[i])\n print(sm)\nexcept EOFError:\n pass\n \n", "for _ in range(int(input())):\n n = int(input())\n D = dict()\n for i in range(n):\n word,tp = map(str,input().split())\n tp = int(tp)\n \n if tp==1:\n if D.get(word,0)!=0 : D[word][0]+=1\n else : D[word] = [1,0]\n else : \n if D.get(word,0)!=0 : D[word][1]+=1\n else : D[word] = [0,1]\n max_select = 0\n for a,b in D.values():\n max_select+=max(a,b)\n print(max_select)\n ", "# cook your dish here\nfor _ in range(int(input())):\n N = int(input())\n A= {}\n for i in range(N):\n w, s = input().split()\n s = int(s)\n if w not in A:\n A[w] = [1,0] if s == 0 else [0,1]\n else:\n if s == 0:\n A[w][0] += 1 \n else:\n A[w][1] += 1 \n c = 0\n for i in A.values():\n c += max(i)\n print(c)\n", "t = int(input())\nfor _ in range(t):\n n = int(input())\n d = {}\n l = []\n count = 0\n for i in range(n):\n a,b = input().split()\n l.append(a)\n if (a,b) not in d:\n d[(a,b)] = 0\n d[(a,b)] += 1\n l = set(l)\n for i in l:\n count += d.get((i,'0'),0) if d.get((i,'0'),0) > d.get((i,'1'),0) else d.get((i,'1'),0)\n print(count)\n \n ", "# cook your dish here\nfor _ in range(int(input())):\n N = int(input())\n S = {}\n for i in range(N):\n w, s = input().split()\n s = int(s)\n if w not in S:\n S[w] = [1,0] if s == 0 else [0,1]\n else:\n if s == 0:\n S[w][0] += 1 \n else:\n S[w][1] += 1 \n c = 0\n for i in S.values():\n c += max(i)\n print(c)", "for _ in range(int(input())):\r\n n=int(input())\r\n k={}\r\n for i in range(n):\r\n a,b=map(str,input().split())\r\n b=int(b)\r\n if a not in k:\r\n s=[0,0]\r\n if b==0:\r\n s[0]=1\r\n else:\r\n s[1]=1\r\n k[a]=s\r\n else:\r\n if b==0:\r\n k[a][0]+=1\r\n else:\r\n k[a][1]+=1\r\n c=0 \r\n for i in k.values():\r\n c+=max(i)\r\n print(c) \r\n \r\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 #n,q=map(int,input().split())\n #l=list(map(int,input().split()))\n l={}\n for j in range(n):\n w,s=input().split()\n s=int(s)\n if w not in l:\n l[w]=[1,0] if s==0 else [0,1]\n else:\n if s==0:\n l[w][0]+=1\n else:\n l[w][1]+=1\n c=0\n for i in l.values():\n c+=max(i)\n print(c)\n\n ", "for _ in range(int(input())):\n N = int(input())\n S = {}\n for i in range(N):\n w, s = input().split()\n s = int(s)\n if w not in S:\n S[w] = [1,0] if s == 0 else [0,1]\n else:\n if s == 0:\n S[w][0] += 1 \n else:\n S[w][1] += 1 \n c = 0\n for i in S.values():\n c += max(i)\n print(c)\n", "for _ in range(int(input())):\n N = int(input())\n S = {}\n for i in range(N):\n w, s = input().split()\n s = int(s)\n if w not in S:\n S[w] = [1,0] if s == 0 else [0,1]\n else:\n if s == 0:\n S[w][0] += 1 \n else:\n S[w][1] += 1 \n c = 0\n for i in S.values():\n c += max(i)\n print(c)", "t=int(input())\nfor i in range(t):\n n=int(input())\n c=0\n dict1=dict()\n dict2=dict()\n for i in range(n):\n w,s1=input().split()\n s=0\n s=int(s1)\n if(s==0):\n if(w not in dict2):\n dict2[w]=1\n elif(w in dict2):\n dict2[w]+=1\n if(s==1):\n if(w not in dict1):\n dict1[w]=1\n elif(w in dict1):\n dict1[w]+=1\n for i in dict1:\n if(i not in dict2):\n c+=dict1[i]\n elif(i in dict2):\n c+=max(dict1[i],dict2[i])\n for i in dict2:\n if(i not in dict1):\n c+=dict2[i]\n print(c)\n \n \n \n \n", "t = int(input())\r\nfor asdf in range(t):\r\n n = int(input())\r\n dic = {}\r\n for sdfd in range(n):\r\n inp = input()\r\n split = inp.split(\" \")\r\n if not split[0] in dic: \r\n if int(split[1])==1:\r\n dic[split[0]] = [0, 1]\r\n else:\r\n dic[split[0]] = [1, 0]\r\n else:\r\n if int(split[1])==1:\r\n dic[split[0]][1] += 1\r\n else:\r\n dic[split[0]][0] += 1\r\n \r\n total = 0\r\n for x in dic:\r\n if dic[x][0]>= dic[x][1]:\r\n total += dic[x][0]\r\n else:\r\n total += dic[x][1]\r\n print(total)"] | {"inputs": [["3", "3", "abc 0", "abc 1", "efg 1", "7", "fck 1", "fck 0", "fck 1", "body 0", "body 0", "body 0", "ram 0", "5", "vv 1", "vv 0", "vv 0", "vv 1", "vv 1", ""]], "outputs": [["2", "6", "3"]]} | INTERVIEW | PYTHON3 | CODECHEF | 12,509 | |
c8a9546abf82450031e1c5c4e4bc5629 | UNKNOWN | Problem description.
Dominic Toretto has taken his crew to compete in this years' Race Wars, a crew-on-crew tournament in which each member of one crew competes with a member of the other crew in a quarter mile drag race. Each win counts as one point for the winning crew. Draws and loses are awarded zero points. In the end the crew with more points is declared the winner of that round and can advance while the losing crew is knocked out. One member can compete in only one race per round and all crews have the same number of members.
Dom and his crew have a reputation of being the best and naturally everyone expects them to win this year as well.
However, during the tournament he spots a new crew of racers who are participating for the first time in this event. People expect them to be a dark horse so naturally Dom wants to keep an eye on their performance.
Being the experienced racer that he is, Dom has figured out the time in which each racer of the opposing crew completes his quarter mile race.
He also knows his own crew inside out and can estimate with absolute certainty, the time it would take each of his members to complete the race. Dominic is the reigning champion and thus has an advantage that he can select the order of the matches i.e.: he can select which member of his crew will go up against which member of the opposition. Given this data he wants to figure out the number of races he will win should his crew come face to face with their newest rivals.
Unfortunately he is a racer and not a problem solver so he comes to you for help.
Given the time each member of the two crews take to complete the race you have to figure out a way to arrange the matches so that Dominic can win maximum points possible for him.
-----Input-----
The first line of input is the T, the number of test cases.
Each test case starts with a single number N, the number of racers on each crew.
This is followed by two lines, each having N space separated integers containing the time taken by each member of Dominic's crew and the rival crew respectively.
-----Output-----
Output a single integer. The maximum number of points that Dominic can get.
-----Constraints-----
1<=T<=100
1<=N<=100
Time taken by each member will be between 1 and 500
-----Example-----
Input:
1
3
5 4 1
5 4 1
Output:
2
-----Explanation-----
If Dom selects Racer 1 of his team to go against Racer 2 of the other team, Racer 2 of his team against Racer 3 of the other team and Racer 3 of his team against Racer 1 of the other team then he ends up with two wins and a loss which gives him 2 points. ... | ["testcases = int(input())\n\nfor i in range(testcases):\n n = int(input())\n my = list(map(int,input().split()))\n opp = list(map(int,input().split()))\n \n my.sort(reverse = True)\n opp.sort(reverse = True)\n \n j = 0\n k = 0\n while(k < n):\n if(my[j] > opp[k]):\n j += 1\n k += 1\n\n print(j)"] | {"inputs": [["1", "3", "5 4 1", "5 4 1"]], "outputs": [["2"]]} | INTERVIEW | PYTHON3 | CODECHEF | 302 | |
ba809166d7596ff13ae6fc6acd07618b | UNKNOWN | For Diwali, Chef arranges all $K$ laddus in a row in his sweet shop. Whenever a customer comes to buy laddus, chef follows a rule that each customer must buy all laddus on odd position. After the selection of the laddu, a new row is formed, and again out of these only laddus on odd position are selected. This continues until the chef left with the last laddu. Find out the position of that last laddu in the original row.
-----Input:-----
- First line will contain $T$, number of testcases. Then the testcases follow.
- Each testcase contains of a single line of input, one integer $K$.
-----Output:-----
For each testcase, print the position of that laddu who is left, in the original row.
-----Constraints-----
- $1 \leq T \leq 10^5$
- $1 \leq K \leq 10^5$
-----Sample Input:-----
3
1
5
8
-----Sample Output:-----
1
4
8
-----EXPLANATION:-----
For 1) Only one laddu which is last so print 1.
For 2) Customer 1: [1, 3, 5]
New row = [2, 4]
Customer 2: [2]
Last laddu = 4 | ["# cook your dish here\nt=int(input())\nwhile t>0:\n n=int(input())\n if n==1:\n print(1)\n else:\n c,num=1,2\n while num<n:\n num*=2\n if num==n:\n print(num)\n else:\n print(num//2)\n t-=1", "# cook your dish here\nfrom math import log\nt=int(input())\nfor _ in range(t):\n k=int(input())\n print(pow(2,int(log(k,2))))", "from math import log2,floor\r\nfor _ in range(int(input())):\r\n n=int(input())\r\n\r\n ans=floor(log2(n))\r\n print(2**ans)\r\n", "# cook your dish here\nfor _ in range(int(input())):\n\tn = int(input())\n\tc = list(bin(n)[2:])\n\tfor i in range(1,len(c)):\n\t\tc[i] = \"0\"\n\tc = ''.join(c)\n\tprint(int(c,2))\n", "for i in range(int(input())):\r\n n = int(input())\r\n print(2 ** (len(bin(n)[2:]) - 1))"] | {"inputs": [["3", "1", "5", "8"]], "outputs": [["1", "4", "8"]]} | INTERVIEW | PYTHON3 | CODECHEF | 835 | |
86917a228f8206c9a464c2a65f7de0fa | UNKNOWN | Voritex a big data scientist collected huge amount of big data having structure of two rows and n columns.
Voritex is storing all the valid data for manipulations and pressing invalid command when data not satisfying the constraints.
Voritex likes brute force method and he calls it as BT, he decided to run newly created BT engine for getting good result.
At each instance when BT engine is outputting a newly created number Voritex calls it as BT number.
Voritex is daydreaming and thinking that his engine is extremely optimised and will get an interview call in which he will be explaining the structure of BT engine and which will be staring from 1 and simultaneously performing $i$-th xor operation with $i$ and previously(one step before) obtained BT number.
BT engine is outputting the $K$-th highest BT number in the first $N$ natural numbers.
Chef : (thinking) I also want to create BT engine……..
-----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 line of each test case contains a two integers $N$ and $K$.
-----Output:-----
For each test case, print a single line containing integer $K$-th highest number else print -$1$ when invalid command pressed.
-----Constraints-----
- $1 \leq T \leq 100000$
- $1 \leq N \leq 100000$
- $1 \leq K \leq N$
-----Sample Input:-----
2
4 2
5 5
-----Sample Output:-----
2
0
-----EXPLANATION:-----
For first valid constraints generating output as 0 2 1 5
1^1 first BT number is 0
2^0 second BT number is 2
3^2 third BT number is 1
4^1 fourth BT number is 5
Hence the answer is 2. | ["import math\r\nimport os\r\nimport random\r\nimport re\r\nimport sys\r\n\r\n\r\nr = 100000\r\nprev = 1\r\ns = set()\r\nfor i in range(1, r+1):\r\n now = i ^ prev\r\n s.add(now)\r\n prev = now\r\ns = list(s)\r\nt = int(input())\r\nwhile t > 0:\r\n t -= 1\r\n n, k = list(map(int, input().split()))\r\n\r\n if n > 3:\r\n if n % 2 == 0:\r\n size = (n//2) + 2\r\n else:\r\n size = ((n-1)//2) + 2\r\n else:\r\n size = n\r\n if size - k >= 0:\r\n print(s[size-k])\r\n else:\r\n print(-1)\r\n"] | {"inputs": [["2", "4 2", "5 5"]], "outputs": [["2", "0"]]} | INTERVIEW | PYTHON3 | CODECHEF | 573 | |
b6f78cc4f53bd528ad130c8198f0732a | UNKNOWN | Minion Chef likes to eat bananas a lot. There are N piles of bananas in front of Chef; for each i (1 ≤ i ≤ N), the i-th pile contains Ai bananas.
Chef's mother wants her to eat the bananas and be healthy. She has gone to the office right now and will come back in H hours. Chef would like to make sure that she can finish eating all bananas by that time.
Suppose Chef has an eating speed of K bananas per hour. Each hour, she will choose some pile of bananas. If this pile contains at least K bananas, then she will eat K bananas from it. Otherwise, she will simply eat the whole pile (and won't eat any more bananas during this hour).
Chef likes to eat slowly, but still wants to finish eating all the bananas on time. Therefore, she would like to choose the minimum K such that she is able to eat all the bananas in H hours. Help Chef find that value of K.
-----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 H denoting the number of piles and the number of hours after which Chef's mom will come home.
- The second line contains N space-separated integers A1, A2, ..., AN.
-----Output-----
For each test case, print a single line containing one integer — the minimum possible value of K.
-----Constraints-----
- 1 ≤ T ≤ 10
- 1 ≤ N ≤ 105
- N ≤ H ≤ 109
- 1 ≤ Ai ≤ 109 for each valid i
-----Subtasks-----
Subtask #1 (30 points):
- 1 ≤ N ≤ 100
- Ai ≤ 103 for each valid i
Subtask #2 (70 points): original constraints
-----Example-----
Input:
3
3 3
1 2 3
3 4
1 2 3
4 5
4 3 2 7
Output:
3
2
4
-----Explanation-----
Example case 1: With a speed of K = 3 bananas per hour, Chef can finish eating all the bananas in 3 hours. It's the minimum possible speed with which she can eat all the bananas in 3 hours. With a speed of 2 bananas per hour, she would take at least 4 hours and with a speed of 1 banana per hour, she would take at least 6 hours. | ["# cook your dish here\nimport math\nT = int(input())\nfor _ in range(T):\n N, H = map(int, input().split())\n A = list(map(int, input().split()))\n low, high = 1, max(A)\n while low != high:\n time = 0\n mid = (low + high) // 2\n for i in range(N):\n time += math.ceil(A[i] / mid)\n \n if time <= H :\n high = mid\n else:\n low = mid + 1\n print(high)", "# cook your dish here\nimport math\nT = int(input())\nfor _ in range(T):\n N, H = map(int, input().split())\n A = list(map(int, input().split()))\n low = 1\n high = max(A)\n while low != high:\n time = 0\n mid = (low + high) // 2\n for i in range(N):\n time += math.ceil(A[i] / mid)\n \n if time <= H :\n high = mid\n else:\n low = mid + 1\n print(high)", "# cook your dish here\nimport math\nT = int(input())\nfor _ in range(T):\n N, H = map(int, input().split())\n A = list(map(int, input().split()))\n low = 1\n high = max(A)\n while low != high:\n time = 0\n mid = low + (high - low) // 2\n for i in range(N):\n time += math.ceil(A[i] / mid)\n \n if time <= H :\n high = mid\n else:\n low = mid + 1\n print(high)", "# cook your dish here\nimport math\nT = int(input())\nfor _ in range(T):\n N, H = map(int, input().split())\n A = list(map(int, input().split()))\n low = 1\n high = max(A)\n ans = 1\n while low <= high:\n time = 0\n mid = low + (high - low) // 2\n for i in range(N):\n time += int((A[i] + mid - 1) / mid)\n \n if time <= H :\n ans = mid\n high = mid - 1\n else:\n low = mid + 1\n print(ans)", "# cook your dish here\nimport math\nT = int(input())\nfor _ in range(T):\n N, H = map(int, input().split())\n A = list(map(int, input().split()))\n A.sort()\n low = 1\n high = max(A)\n ans = 1\n while low <= high:\n time = 0\n mid = low + (high - low) // 2\n for i in range(N):\n time += int((A[i] + mid - 1) / mid)\n \n if time <= H :\n ans = mid\n high = mid - 1\n else:\n low = mid + 1\n print(ans)", "from math import *\ndef check(arr,n,mid):\n l=0\n for i in range(n):\n l+=ceil(arr[i]/mid)\n return l \n\nfor u in range(int(input())):\n n,k=list(map(int,input().split()))\n l=list(map(int,input().split()))\n x,y=1,max(l)\n while(x!=y):\n m=(x+y)//2\n s=check(l,n,m)\n \n if(s<=k):\n y=m\n else:\n x=m+1\n print(x)\n", "# cook your dish here\nimport math\nfor _ in range(int(input())):\n n,hour=list(map(int,input().split()))\n l=list(map(int,input().split()))\n low,h=1,max(l)\n while low!=h:\n mid=(low+h)//2 \n count=0 \n for i in l:\n count+=math.ceil(i/mid)\n if count<=hour:\n h=mid \n else:\n low=mid+1 \n print(low)\n \n", "from math import *\nfor u in range(int(input())):\n n,k=list(map(int,input().split()))\n l=list(map(int,input().split()))\n x,y=1,max(l)\n while(x!=y):\n m=(x+y)//2\n s=0\n for i in l:\n s+=ceil(i/m)\n if(s<=k):\n y=m\n else:\n x=m+1\n print(x)\n", "from math import ceil\n\nfor _ in range(int(input())):\n n,h=list(map(int,input().split()))\n arr=list(map(int,input().split()))\n low,high=1,max(arr)\n while(low <= high):\n check=0\n mid=(low+high)//2\n for i in range(n):\n check+=(ceil(arr[i]/mid))\n #print(check,low,mid,high)\n if check<=h:\n high=mid-1\n else:\n low=mid+1\n print(low)\n", "from math import ceil\n\nfor _ in range(int(input())):\n n,h=list(map(int,input().split()))\n arr=list(map(int,input().split()))\n low,high=1,max(arr)\n while(low != high):\n check=0\n mid=(low+high)//2\n for i in range(n):\n check+=(ceil(arr[i]/mid))\n #print(check,low,mid,high)\n if check<=h:\n high=mid\n else:\n low=mid+1\n print(low)\n \n", "# cook your dish here\ndef MinimumHours(n,h,a):\n a.sort()\n b=a[0]\n c=0\n s=0\n j=0\n m=1\n while 1:\n for i in a[-1:-(n+2):-1]:\n if i%m==0:\n s+=i//m\n else:\n s+=(i//m)+1\n if s>h:\n break\n if s<=h:\n return m\n m+=1\n s=0\n \n \n \np=[]\nfor i in range(int(input())):\n n,h=input().split()\n p.append(MinimumHours(int(n),int(h),[int(i) for i in input().split()]))\n \nfor i in p:\n print(i)\n", "# cook your dish here\ndef MinimumHours(n,h,a):\n a.sort()\n j=0\n mi=a[j]\n s=0\n c=0\n c2=0\n while 1:\n for i in a[-1:-(n+2):-1]:\n if i%mi==0:\n s+=(i//mi)\n else:\n s+=(i//mi)+1\n if s>h:\n c=1\n if c2==1:\n return mi+1\n break\n if c2==0 and c==1:\n pmi=mi\n j+=1\n mi=a[j]\n c=0\n s=0\n continue\n c2=1\n mi-=1\n s=0\n \n\n \n \n \n \np=[]\nfor i in range(int(input())):\n n,h=input().split()\n p.append(MinimumHours(int(n),int(h),[int(i) for i in input().split()]))\n \nfor i in p:\n print(i)\n", "# cook your dish here\ndef MinimumHours(n,h,a):\n a.sort()\n pmi=a[-1]\n mi=a[-1]\n s=0\n while 1:\n for i in a:\n if i%mi==0:\n s+=(i//mi)\n else:\n s+=(i//mi)+1\n if s<=h:\n pmi=mi\n mi-=1\n s=0\n continue\n return pmi\n \n \n \n \np=[]\nfor i in range(int(input())):\n n,h=input().split()\n p.append(MinimumHours(int(n),int(h),[int(i) for i in input().split()]))\n \nfor i in p:\n print(i)\n", "# cook your dish here\ndef MinimumHours(n,h,a):\n a.sort()\n j=0\n mie=2\n mio=1\n s1=0\n s2=0\n c1=0\n c2=0\n while 1:\n for i in a[-1:-(n+1):-1]:\n if i%mie==0:\n s1+=(i//mie)\n else:\n s1+=(i//mie)+1\n if i%mio==0:\n s2+=(i//mio)\n else:\n s2+=(i//mio)+1\n if s1>h :\n c1=1\n \n if s2>h :\n c2=1\n if c1==c2==1:\n break\n \n if c1==c2==1:\n c1=0\n s1=0\n c2=0\n s2=0\n mie+=2\n mio+=2\n else:\n if c2==c1==0:\n return min(mie,mio)\n if c1==0:\n return mie\n return mio \n \np=[]\nfor i in range(int(input())):\n n,h=input().split()\n p.append(MinimumHours(int(n),int(h),[int(i) for i in input().split()]))\n \nfor i in p:\n print(i)\n", "# cook your dish here\ndef MinimumHours(n,h,a):\n a.sort()\n j=0\n mi=0\n s=0\n c=0\n while 1:\n mi+=1\n for i in a[-1:-(n+1):-1]:\n if i%mi==0:\n s+=(i//mi)\n else:\n s+=(i//mi)+1\n if s>h:\n c=1\n break\n if c==1:\n c=0\n s=0\n else:\n return mi\n \n \np=[]\nfor i in range(int(input())):\n n,h=input().split()\n p.append(MinimumHours(int(n),int(h),[int(i) for i in input().split()]))\n \nfor i in p:\n print(i)\n", "from math import ceil\ndef within(l,k,h):\n s=0\n for i in range(len(l)):\n t=ceil(l[i]/k)\n s+=t\n if s<=h:\n return True\n else:\n return False\nfor _ in range(int(input())):\n n,h=map(int,input().split())\n l=list(map(int,input().split()))\n l_1=1\n r_1=max(l)\n while l_1!=r_1:\n mid=l_1+((r_1-l_1)//2)\n if within(l,mid,h)==True:\n r_1=mid\n else:\n l_1=mid+1\n print(l_1)", "import math\nfor i in range(int(input())):\n n,k=list(map(int,input().split()))\n a=list(map(int,input().split()))\n m=math.ceil(sum(a)/k)\n if k==n:\n print(max(a))\n elif k>=sum(a):\n print(1)\n else:\n for i in range(m,max(a)+1):\n s=0\n for j in a:\n s+=math.ceil(j/i)\n if s<=k:\n print(i)\n break\n", "import math\nfor i in range(int(input())):\n n,k=list(map(int,input().split()))\n a=list(map(int,input().split()))\n m=math.ceil(sum(a)/k)\n if k==n:\n print(max(a))\n else:\n for i in range(m,max(a)+1):\n s=0\n for j in a:\n s+=math.ceil(j/i)\n if s<=k:\n print(i)\n break\n", "# cook your dish here\nfrom math import ceil\nT = int(input())\nfor a in range (T):\n N,H = map(int, input().split())\n A = list(map(int, input().split()))\n x = 1\n y = 10**9\n hr = 0\n k = 10000000000000000\n while x <= y:\n b = x + (y-x)//2\n hr = 0\n for i in range (N):\n hr += ceil(A[i]/b)\n if hr <= H:\n k = min(k, b)\n y = b - 1\n else:\n x = b + 1\n print(k)", "# cook your dish here\nfrom math import ceil\nT = int(input())\nfor a in range (T):\n N,H = map(int, input().split())\n A = list(map(int, input().split()))\n x = 1\n y = 10**9\n hr = 0\n k = 10000000000\n while x <= y:\n b = x + (y-x)//2\n hr = 0\n for i in range (N):\n hr += ceil(A[i]/b)\n if hr <= H:\n k = min(k, b)\n y = b - 1\n else:\n x = b + 1\n print(k)", "import math\ndef b(l,s,h):\n o=0\n for i in l:\n o+=math.ceil(i/s)\n if o<=h:\n return True\n else:\n return False\nt=int(input())\nfor z in range(t):\n n,h=map(int,input().split())\n l=list(map(int,input().split()))\n q=1 \n r=max(l)\n while q!=r:\n s=(q+r)//2\n if b(l,s,h):\n r=s \n else:\n q=s+1 \n print(r)", "a=int(input())\nimport math\nwhile(a>0):\n n,h=map(int,input().split())\n l=list(map(int,input().split()))\n l.sort()\n x=l[-1]\n m=l[n//2]\n for k in range(1,x+1):\n y=math.ceil(m/k)\n if(y*n<=h):\n c=0\n for i in l:\n c+=math.ceil(i/k)\n if(c<h):\n k-=1\n w=0\n for i in l:\n w+=math.ceil(i/k)\n if(w<=h):\n print(k)\n else:\n print(k+1)\n break\n elif(c==h):\n w=0\n for i in l:\n w+=math.ceil(i/k)\n if(w==h):\n print(k)\n elif(w>h):\n print(k+1)\n break\n a-=1"] | {"inputs": [["3", "3 3", "1 2 3", "3 4", "1 2 3", "4 5", "4 3 2 7"]], "outputs": [["3", "2", "4"]]} | INTERVIEW | PYTHON3 | CODECHEF | 8,766 | |
8b00724eea0797b38ee5d73fe3a1fdbd | UNKNOWN | Recall the definition of the Fibonacci numbers:
f1 := 1
f2 := 2
fn := fn-1 + fn-2 (n>=3)
Given two numbers a and b, calculate how many Fibonacci numbers are in the range [a,b].
-----Input-----
The input contains several test cases. Each test case consists of two non-negative integer numbers a and b. Input is terminated by a=b=0. Otherwise, a<=b<=10^100. The numbers a and b are given with no superfluous leading zeros.
-----Output-----
For each test case output on a single line the number of Fibonacci numbers fi with a<=fi<=b.
-----Example-----
Input:
10 100
1234567890 9876543210
0 0
Output:
5
4 | ["#!/usr/bin/env python\n\nF = [1,1]\ndef fibo():\n for i in range(500):\n F.append(F[-2] + F[-1])\n\ndef main():\n fibo()\n #print len(str(F[-1]))\n #print len(str(10**100))\n while True:\n try:\n A, B = list(map(int, input().strip().split()[:2]))\n if A == 0 and B == 0: break\n print(len([x for x in F if x >= A and x <= B]))\n except:\n break\n\nmain()\n\n"] | {"inputs": [["10 100", "1234567890 9876543210", "0 0"]], "outputs": [["5", "4"]]} | INTERVIEW | PYTHON3 | CODECHEF | 373 | |
a34494ef0f4cd78243fa4cdaf51a38dd | UNKNOWN | As we all know, Dhoni loves drinking milk. Once he and Sir Jadeja were invited in the inauguration of a Dairy company in Ranchi.
The company had arranged n jars of milk from various breeds of cows , jar number i containing a[i] litres of milk. Since Dhoni loves driking milk more than Sir Jadeja, so Kohli suggested a plan for them. His plan was that each time Dhoni will choose a jar containing the maximum amount of milk. If this jar has less than k litres of milk or if Dhoni has already drunk more than m number of times from this jar, then the milk contained in the jar will be drunk by Sir Jadeja. Sir Jadeja will drink all the milk left in that jar. Otherwise Dhoni will drink exactly k litres of milk from the jar and put it back at its position. Dhoni will do so until he has given all jars to Sir Jadeja.
You have to calculate how much milk Sir Jadega will get after Dhoni satisfies his hunger modulo 1,000,000,007.
-----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 integer N , M, K denoting the number of milk jars, maximum number of time Dhoni will drink from any jar and maximum amount of milk Dhoni will drink at any time respectively. The second line contains N space-separated integers A1, A2, ..., AN denoting the amount of milk in each jar.
-----Output-----
- For each test case, output a single line containing the amount of milk Sir Jadega will get modulo 1,000,000,007.
-----Constraints-----
- 1 ≤ T ≤ 10
- 1 ≤ N ≤ 10^5
- 0 ≤ M ≤ 10^6
- 1 ≤ K ≤ 10^6
- 0 ≤ Ai ≤ 10^9
-----Example-----
Input:
1
3 3 3
15 8 10
Output:
9 | ["cases = int(input())\n\nfor case in range(cases):\n N, M, K = [int(i) for i in input().split()]\n A = [int(i) for i in input().split()]\n jad = 0\n P = M*K\n\n for milk in A:\n if(milk>P):\n jad += milk-P\n else:\n jad += milk%K\n\n print(jad%1000000007)\n", "import sys\n\nMOD = 10**9+7\nfor __ in range(eval(input())) :\n n , m , k = list(map(int,sys.stdin.readline().split()))\n lists = list(map(int,sys.stdin.readline().split()))\n ans = 0\n for i in lists :\n msd = i/k\n if msd > m :\n jaddu = i-(m*k)\n else :\n jaddu = i%k\n ans += jaddu%MOD\n print(ans%MOD)\n"] | {"inputs": [["1", "3 3 3", "15 8 10"]], "outputs": [["9"]]} | INTERVIEW | PYTHON3 | CODECHEF | 586 | |
75025e1525376500d97055836b8c29e6 | UNKNOWN | The government has invited bids from contractors to run canteens at all railway stations. Contractors will be allowed to bid for the catering contract at more than one station. However, to avoid monopolistic price-fixing, the government has declared that no contractor may bid for a pair of neighbouring stations.
The railway network has exactly one route between any pair of stations. Each station is directly connected by a railway line to at most $50$ neighbouring stations.
To help contractors plan their bids, the government has provided data on the number of passengers who pass through each station each year. Contractors would like to bid for stations with a higher volume of passenger traffic to increase their turnover.
For instance, suppose the railway network is as follows, where the volume of passenger traffic is indicated by the side of each station.
In this network, the best option for the contractor is to bid for stations $1, 2, 5$ and $6$, for a total passenger volume of $90$.
Your task is to choose a set of stations that the contractor should bid for so that the total volume of traffic across all the stations in the bid is maximized.
-----Input:-----
The first line of the input contains one integer $N$ indicating the number of railways stations in the network. The stations are numbered $1,2,...,N$. This is followed by $N$ lines of input, lines $2, 3,..., N+1$, indicating the volume of traffic at each station. The volume of traffic at station $i, 1 \leq i \leq N$, is given by a single integer in line $i+1$. The next $N-1$ lines of input, lines $N+2, N+3, ..., 2N$, describe the railway network. Each of these lines contains two integers, denoting a pair of stations that are neighbours.
-----Output:-----
The output should be a single integer, corresponding to the total volume of traffic across the set of stations in the optimal bid made by the contractor.
-----Constraints:-----
- $1 \leq N \leq 100000$.
- Each railway station has at most $50$ neighbours.
-----Sample Input-----
6
10
20
25
40
30
30
4 5
1 3
3 4
2 3
6 4
-----Sample Output-----
90 | ["n=int(input())\r\nl=[]\r\ndp=[]\r\nd={}\r\nfor i in range(n):\r\n\tl.append(int(input()))\r\n\td[i]=[]\r\n\tdp.append([0,0])\r\n\r\nfor i in range(n-1):\r\n\ta,b=list(map(int,input().split()))\r\n\td[a-1].append(b-1)\r\n\td[b-1].append(a-1)\r\n#print(l)\r\n#print(d)\r\n\r\ndef dfs(ch,pa,visited):\r\n\tdp[ch][1]=l[ch]\r\n\t#print(dp[ch],ch+1)\r\n\tfor i in range(len(d[ch])):\r\n\t\tif d[ch][i] not in visited:\r\n\t\t\tvisited.add(d[ch][i])\r\n\t\t\tdfs(d[ch][i],ch,visited)\r\n\t\t\tdp[ch][0]+=max(dp[d[ch][i]][0],dp[d[ch][i]][1])\r\n\t\t\tdp[ch][1]+=dp[d[ch][i]][0]\r\n\t\t\t#print(ch+1,dp[ch])\r\nv=set()\r\nv.add(0)\r\ndfs(0,-1,v)\r\n\r\n#print(dp)\r\nprint(max(dp[0][0],dp[0][1]))\r\n\r\n\t\r\n\r\n\r\n"] | {"inputs": [["6", "10", "20", "25", "40", "30", "30", "4 5", "1 3", "3 4", "2 3", "6 4"]], "outputs": [["90"]]} | INTERVIEW | PYTHON3 | CODECHEF | 713 | |
a3bd98dbd875c2cfe626567a8b0e8769 | UNKNOWN | These days, chef is very much interested in Mathematics. He has started attending Recitations too! His hunger for problems is increasing day by day!
Today, chef was a given a crumpled maths problem, which he is stuck with . He needs your help to do it
Here's what his teacher said: "Find sum of all numbers till N, do not include numbers which are powers of K from K, K2, K3... which are less than or equal to N"
Easy, right? Can you solve it?
-----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 contains two integers N and K, as per the above given problem specification.
-----OUTPUT-----
For each test case, output a single line printing the sum of the each test case, in format Case #T: S, where T is the Tth test case running and S is sum of corresponding test case.
-----CONSTRAINTS-----
10 < T < 50
10 < N < 104
0 < K < 100
-----EXAMPLE-----
Input:
2
10 3
20 2
Output:
Case #1: 43
Case #2: 180 | ["testCases = int(input())\nfor c in range(testCases):\n n, k = list(map(int, input().split()))\n sum = 0\n i = 0\n power = 1\n while i <= n:\n if k**power == i:\n power += 1\n else:\n sum += i\n i +=1 \n answer = \"Case #\" + str(c + 1) + \": \" + str(sum)\n print(answer)", "for j in range(int(input())):\n n,k = list(map(int, input().split()))\n s = (n*(n+1))/2\n i = k\n while i<=n:\n s -= i\n i *= k\n print(\"Case #%d: %d\" % (j+1, s))"] | {"inputs": [["2", "10 3", "20 2"]], "outputs": [["Case #1: 43", "Case #2: 180"]]} | INTERVIEW | PYTHON3 | CODECHEF | 452 | |
d42a67b7565a11209b4b2cf505478c5c | UNKNOWN | Given N, count how many permutations of [1, 2, 3, ..., N] satisfy the following property.
Let P1, P2, ..., PN denote the permutation. The property we want to satisfy is that there exists an i between 2 and n-1 (inclusive) such that
- Pj > Pj + 1 ∀ i ≤ j ≤ N - 1.
- Pj > Pj - 1 ∀ 2 ≤ j ≤ i.
-----Input-----
First line contains T, the number of test cases. Each test case consists of N in one line.
-----Output-----
For each test case, output the answer modulo 109+7.
-----Constraints-----
- 1 ≤ T ≤ 100
- 1 ≤ N ≤ 109
-----Subtasks-----
- Subtask #1(40 points): 1 ≤ N ≤ 1000
- Subtask #2(60 points): original constraints
-----Example-----
Input:
2
2
3
Output:
0
2
-----Explanation-----
Test case 1:
No permutation satisfies.
Test case 2:
Permutations [1, 3, 2] and [2, 3, 1] satisfy the property. | ["try:\n \n for _ in range(int(input())):\n n = int(input())\n print(0) if(n==1) else print(pow(2,n-1,10**9+7)-2) \nexcept EOFError:\n pass\n\n ", "for _ in range(int(input())):\n n = int(input())\n print(0) if(n==1) else print(pow(2,n-1,10**9+7)-2) ", "for _ in range(int(input())):\n n = int(input())\n if(n==1):\n print(0)\n else:\n print(pow(2,n-1,10**9+7)-2)", "m = 10**9+7\nfor _ in range(int(input())):\n n = int(input())\n if(n==1):\n print(0)\n else:\n g = pow(2,n-1,m)-2;\n print(g)", "m = 10**9+7\nfor _ in range(int(input())):\n n = int(input())\n if(n==1):\n print(0)\n else:\n g = pow(2,n-1)-2;\n print(g%m)"] | {"inputs": [["2", "2", "3"]], "outputs": [["0", "2"]]} | INTERVIEW | PYTHON3 | CODECHEF | 634 | |
0f0a087f30bfdcdbeea58cd49e2abe91 | UNKNOWN | There are n chef's in Chefland. There is a festival in Chefland in which each chef is asked to vote a person as his best friend. Obviously, a person can't vote himself as his best friend. Note that the best friend relationship is not necessarily bi-directional, i.e. it might be possible that x is best friend of y, but y is not a best friend of x.
Devu was the election commissioner who conducted this voting. Unfortunately, he was sleeping during the voting time. So, he could not see the actual vote of each person, instead after the voting, he counted the number of votes of each person and found that number of votes of i-th person was equal to ci.
Now he is wondering whether this distribution of votes corresponds to some actual voting or some fraudulent voting has happened. If the current distribution of votes does not correspond to any real voting, print -1. Otherwise, print any one of the possible voting which might have lead to the current distribution. If there are more than one possible ways of voting leading to the current distribution, you can print any one of them.
-----Input-----
- First line of the input contains a single integer T denoting number of test cases.
- First line of each test case, contains a single integer n.
- Second line of each test case, contains n space separated integers denoting array c.
-----Output-----
For each test case,
- If there is no real voting corresponding to given distribution of votes, print -1 in a single line.
- Otherwise, print n space separated integers denoting a possible voting leading to current distribution of votes. i-th integer should denote the index of the person (1 based indexing) whom i-th person has voted as his best friend.
-----Constraints and Subtasks-----
- 1 ≤ T ≤ 500
- 1 ≤ n ≤ 50
- 0 ≤ ci ≤ n
-----Example-----
Input:
3
3
1 1 1
3
3 0 0
3
2 2 0
Output:
2 3 1
-1
-1
-----Explanation-----
Example 1: In this example, each person has received one vote. One possible example of real voting leading to this distribution is {2, 3, 1}. In this distribution, number of votes of all three persons are equal to 1. Also it is real voting because no person votes himself as his best friend.
You can also output another possible distribution {3, 1, 2} too.
Example 2: There is no real voting corresponding to this voting distribution.
Example 3: There is no real voting corresponding to this voting distribution. | ["t=int(input())\nfor _ in range(t):\n n=int(input())\n l=list(map(int,input().split()))\n if sum(l)!=n or max(l)==n:\n print('-1')\n else:\n d=dict()\n ans=[-1]*n\n for i in range(0,n):\n d[i]=1\n for i in range(n):\n if l[i]!=0:\n count=l[i]\n for k,v in list(d.items()):\n if count>0 and v==1 and i!=k:\n d[k]=0\n ans[k]=i+1\n count-=1\n ind=-1\n for i in range(0,len(ans)):\n if ans[i]==-1:\n ind=i\n if ind==-1:\n print(*ans)\n else:\n for i in range(len(ans)):\n if ans[i]!=ind+1:\n \n \n ans[ind]=ans[i]\n ans[i]=ind+1\n break\n print(*ans)\n \n \n \n \n\n \n \n \n\n \n", "t=int(input())\nfor _ in range(t):\n n=int(input())\n l=list(map(int,input().split()))\n if sum(l)!=n or max(l)==n:\n print('-1')\n else:\n ans=[]\n for i in range(n):\n for j in range(l[i]):\n ans.append(i+1)\n #final_ans=[-1]*n\n for i in range(len(ans)):\n if ans[i]==i+1:\n \n for j in range(len(ans)):\n if ans[j]!=i+1 :\n ans[i],ans[j]=ans[j],ans[i]\n break\n print(*ans)\n \n \n \n \n\n \n \n \n\n \n", "for _ in range(int(input())):\n n = int(input())\n c = [int(i) for i in input().split()]\n if n == 1:\n print(-1)\n continue\n if sum(c) != n or n in c:\n print(-1)\n continue\n res = []\n for p in range(n):\n for q in range(c[p]):\n res.append(p+1)\n for p in range(len(res)):\n if res[p] == p+1:\n for q in range(len(res)):\n if res[q] != p+1:\n res[p], res[q] = res[q], res[p]\n break\n print(*res)\n", "for _ in range(int(input())):\n n=int(input())\n a=list(map(int,input().split()))\n if sum(a)!=n or max(a)==n:\n print(-1)\n continue\n else:\n rg=[]\n for i in range(n):\n if a[i]>0:\n rg.append([i,a[i]])\n new=[0 for _ in range(n)]\n new[rg[0][0]]=rg[-1][0]+1\n rg[-1][1]-=1\n for i in range(1,len(rg)):\n new[rg[i][0]]=rg[i-1][0]+1\n rg[i-1][1]-=1\n j=0 \n i=0\n while i<=n-1:\n if new[i]==0:\n if rg[j][1]>0:\n new[i]=rg[j][0]+1\n rg[j][1]-=1\n i+=1\n else:\n j+=1\n if rg[j][1]==0:\n j+=1\n else:\n i+=1\n\n\n \n print(*new)\n"] | {"inputs": [["3", "3", "1 1 1", "3", "3 0 0", "3", "2 2 0"]], "outputs": [["2 3 1", "-1", "-1"]]} | INTERVIEW | PYTHON3 | CODECHEF | 2,148 | |
5b8a8ce17b6613ef30639ffe6f0aa0f0 | UNKNOWN | For her next karate demonstration, Ada will break some bricks.
Ada stacked three bricks on top of each other. Initially, their widths (from top to bottom) are W1,W2,W3.
Ada's strength is S. Whenever she hits a stack of bricks, consider the largest k≥0 such that the sum of widths of the topmost k bricks does not exceed S; the topmost k bricks break and are removed from the stack. Before each hit, Ada may also decide to reverse the current stack of bricks, with no cost.
Find the minimum number of hits Ada needs in order to break all bricks if she performs the reversals optimally. You are not required to minimise the number of reversals.
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 S, W1, W2 and W3.Output
For each test case, print a single line containing one integer ― the minimum required number of hits.Constraints
- 1≤T≤64
- 1≤S≤8
- 1≤Wi≤2 for each valid i
it is guaranteed that Ada can break all bricksExample Input
3
3 1 2 2
2 1 1 1
3 2 2 1
Example Output
2
2
2
Explanation
Example case 1:
Ada can reverse the stack and then hit it two times. Before the first hit, the widths of bricks in the stack (from top to bottom) are (2,2,1). After the first hit, the topmost brick breaks and the stack becomes (2,1). The second hit breaks both remaining bricks.
In this particular case, it is also possible to hit the stack two times without reversing. Before the first hit, it is (1,2,2). The first hit breaks the two bricks at the top (so the stack becomes (2)) and the second hit breaks the last brick. | ["T = int(input())\nfor _ in range(T):\n W = list(map(int, input().strip().split()))\n S = W[0]\n W = W[1:]\n W = W[::-1]\n i = 0\n c = 0\n flag = 0\n while (len(W) != 0 or flag != 1) and i<len(W):\n k = i\n su = 0\n while su <= S and k<len(W)-1:\n su += W[k]\n k += 1\n if su-W[k-1]<=S:\n c += 1\n else:\n flag = 1\n i += 1\n print(c-1) \n", "T = int(input())\nfor _ in range(T):\n W = list(map(int, input().strip().split()))\n S = W[0]\n W = W[1:]\n W = W[::-1]\n i = 0\n c = 0\n flag = 0\n while (len(W) != 0 or flag != 1) and i<len(W):\n k = i\n su = 0\n while su <= S and k<len(W)-1:\n su += W[k]\n k += 1\n if su-W[k-1]<=S:\n c += 1\n else:\n flag = 1\n i += 1\n print(c-1) \n", "# cook your dish here\nt=int(input())\nwhile(t):\n t=t-1\n l=list(map(int,input().split()))\n S=l[0]\n W1=l[1]\n W2=l[2]\n W3=l[3]\n hits=0\n if(W1+W2+W3<=S):\n hits=1\n elif(W1+W2<=S):\n hits=2\n elif(W2+W3<=S):\n hits=2\n else:\n hits=3\n print(hits)", "# cook your dish here\nimport math\nfor i in range(int(input())):\n test_list=list(map(int,input().split()))\n y=test_list.pop(0)\n print(math.ceil(sum(test_list)/y))", "# cook your dish here\nt=int(input())\nwhile(t):\n t=t-1\n l=list(map(int,input().split()))\n S=l[0]\n W1=l[1]\n W2=l[2]\n W3=l[3]\n hits=0\n if(W1+W2+W3<=S):\n hits=1\n elif(W1+W2<=S):\n hits=2\n elif(W2+W3<=S):\n hits=2\n else:\n hits=3\n print(hits)", "# cook your dish here\nimport math\nfor i in range(int(input())):\n li=list(map(int,input().split()))\n y=li.pop(0)\n print(math.ceil(sum(li)/y))\n", "# cook your dish here\nt=int(input())\nfor i in range(t):\n r=[int(x) for x in input().split()]\n [s,w1,w2,w3]=r\n x=0\n if sum(r)<=s:\n print(1)\n else:\n if (w1+w2)<=s or (w2+w3)<=s:\n print(2)\n else:\n print(3)\n \n \n \n \n \n \n \n", "\n\nfor z in range(int(input().strip())):\n a=list(map(int,input().strip().split(' ')))\n b=a[:0:-1]\n s=0\n k=0\n for i in range(len(b)):\n s+=b[i]\n if(s<a[0]):\n if(i==len(b)-1):\n k+=1\n continue\n elif(s>a[0]):\n k+=1\n s=b[i]\n if(s<a[0]):\n continue\n else:\n s=0\n k+=1\n else:\n s=0\n k+=1\n print(k)\n \n \n \n\n \n \n", "# cook your dish here\na=int(input())\nfor i in range(a):\n l=list(map(int,input().split()))\n k=l[0]\n l.remove(l[0])\n b=0\n for i in range(len(l)-1):\n c=l[i]\n if(c<=k):\n b+=1\n c=c+l[i+1]\n print(b)", "# cook your dish here\nt=int(input())\nfor _ in range(t):\n a=[int(x) for x in input().split()]\n q=0\n c=0\n for i in range(1,4):\n if(q+a[i]<=a[0]):\n q=q+a[i]\n c+=1\n else:\n q=0\n if(c==0):\n print(1)\n else:\n print(c)", "T=int(input())\nres=[]\nfor i in range (T):\n a=input()\n a=list(a.split())\n s=int(a[0])\n w1=int(a[1])\n w2=int(a[2])\n w3=int(a[3])\n b=0\n hits=0\n if (w1+w2<=s):\n if (w1+w2+w3<=s):\n hits+=1\n else:\n hits+=2\n elif (w1+w2>s):\n if (w1<=s):\n hits+=1\n if (w2+w3>s):\n if (w2<=s):\n hits+=2\n else:\n hits+=1\n else:\n hits+=1\n b=hits\n hit=0\n if (w3+w2<=s):\n if (w1+w2+w3<=s):\n hit+=1\n else:\n hit+=2\n elif (w3+w2>s):\n if (w3<=s):\n hit+=1\n if (w2+w1>s):\n if (w2<=s):\n hit+=2\n else:\n hit+=1\n else:\n hit+=1\n if (b>hit):\n b=hit\n res.append(b)\nfor num in res:\n print(num)\n", "T=int(input())\nres=[]\nfor i in range (T):\n a=input()\n a=list(a.split())\n s=int(a[0])\n w1=int(a[1])\n w2=int(a[2])\n w3=int(a[3])\n b=0\n hits=0\n if (w1+w2<=s):\n if (w1+w2+w3<=s):\n hits+=1\n else:\n hits+=2\n elif (w1+w2>s):\n if (w1<=s):\n hits+=1\n if (w2+w3>s):\n if (w2<=s):\n hits+=2\n else:\n hits+=1\n else:\n hits+=1\n b=hits\n hit=0\n if (w3+w2<=s):\n if (w1+w2+w3<=s):\n hit+=1\n else:\n hit+=2\n elif (w3+w2>s):\n if (w3<=s):\n hit+=1\n if (w2+w1>s):\n if (w2<=s):\n hit+=2\n else:\n hit+=1\n else:\n hit+=1\n if (b>hit):\n b=hit\n res.append(b)\nfor num in res:\n print(num)\n", "for _ in range(int(input())):\n s, a, b, c = list(map(int, input().split()))\n if s >= (a + b + c ):\n ans = 1\n elif s >= (a + b) or s >= (b +c):\n ans = 2\n else:\n ans = 3\n print(ans)\n \n", "# cook your dish here\nfor _ in range(int(input())):\n l = list(map(int, input().split()))\n s = l[0]\n w = []\n for i in range(1, len(l)):\n w.append(l[i])\n s1 = 0\n hit = 0\n if s>=w[0]+w[1]+w[2]:\n print(1)\n elif s>=w[0]+w[1]:\n hit += 2\n print(hit)\n elif s>=w[1]+w[2]:\n hit += 2\n print(hit)\n elif s==w[0]==w[1]==w[2]:\n print(3)\n\n\n", "# cook your dish here\nn=int(input())\nfor i in range(n):\n s,w1,w2,w3=list(map(int,input().split()))\n if(w2>w1):\n z1=w2\n z2=min(w2,w3)\n if(s==w1+w2 and w3<=s):\n print(2)\n elif(s==w2+w3 and w1<=s):\n print(2)\n \n elif(w1==w2+w3 and w1<s):\n print(2)\n else:\n print(3)\n \n", "for i in range(int(input())):\n count=0\n (strength,w1,w2,w3)=map(int,input().split())\n if w1+w2+w3<=strength:\n count=count+1\n elif w1+w2<=strength:\n count=count+2\n elif w1+w2>strength:\n if w2+w3<=strength:\n count=count+2\n elif w3<=strength:\n count=count+3\n elif w1<=strength:\n count=count+3\n print(count)", "# cook your dish here\nimport math\nfor t in range(int(input())):\n l = [int(i) for i in input().split(\" \")]\n if l[0] > sum(l[1:]):\n print(1)\n else:\n print(math.ceil(sum(l[1:])/l[0]))", "x=[]\nfor t in range(int(input())):\n s,w1,w2,w3=list(map(int,input().strip().split()))\n z=w1+w2+w3\n c=0\n while z>0:\n z=z-s\n c=c+1\n x.append(c)\nfor i in x:\n print(i)\n \n", "t=int(input())\nfor i in range(t):\n list1=list(map(int,input().split()))\n s=list1[0]\n list2=list1[1:]\n if(sum(list2)<=list1[0]):\n print(\"1\")\n else:\n \n if(list2[0]+list2[1]<=s and list2[2]<=s):\n print(\"2\")\n elif(list2[2]+list2[1]<=s and list2[0]<=s):\n print(\"2\")\n elif(list2[0]<=s and list2[1]<=s and list2[2]<=s):\n print(\"3\")", "# cook your dish here\nimport collections\n\n\ndef hit(bricks):\n if len(bricks) == 3:\n if sum(bricks) <= S:\n bricks.clear()\n else:\n if bricks[0] + bricks[1] <= S:\n bricks.popleft()\n bricks.popleft()\n else:\n if bricks[1] + bricks[2] <= S:\n bricks.pop()\n bricks.pop()\n else:\n if bricks[2] <= S:\n bricks.pop()\n elif len(bricks) == 2:\n if bricks[0] + bricks[1] <= S:\n bricks.popleft()\n bricks.popleft()\n else:\n if bricks[1] <= S:\n bricks.pop()\n elif len(bricks) == 1:\n if bricks[0] <= S:\n bricks.pop()\n else:\n raise ValueError(\"Last brick too stronk\")\n\n return bricks\n\n\nT = int(input())\n\nfor _ in range(T):\n S, W1, W2, W3 = list(map(int, input().split()))\n bricks = collections.deque([W1, W2, W3])\n count = 0\n\n while len(bricks) > 0:\n bricks = hit(bricks)\n count += 1\n\n print(count)\n", "t=int(input())\nfor i in range(t):\n s,w1,w2,w3=list(map(int, input().split()))\n list1=[]\n list1.append(w1)\n list1.append(w2)\n list1.append(w3)\n list1.sort()\n if((list1[0]+list1[1]+list1[2])<=s):\n print(1)\n elif((list1[0]+list1[1])<=s):\n print(2)\n else:\n print(3)\n", "for _ in range(int(input())):\n s,a,b,c=list(map(int,input().split()))\n l=[]\n l.extend([c,b,a])\n c=0\n sum=0\n for i in range(3):\n x=l.pop()\n sum+=x\n if sum<s:\n pass\n elif sum==s:\n c+=1\n sum=0\n else:\n c+=1\n sum=x\n if sum<s and sum!=0:\n c+=1\n print(c)\n \n", "# n,k = map(int,input().strip().split(\" \")) takes two number as input in a \u00a0\u00a0\u00a0\u00a0single line\n# arr = list(map(int,input().split())) takes an array as a input in a single \u00a0\u00a0\u00a0\u00a0line\n# arr = [int(input()) for i in range(n)] takes an array as input in different \u00a0\u00a0\u00a0\u00a0lines\n\n\ndef solve() :\n s,w1,w2,w3 = list(map(int,input().split()))\n k = w1+w2+w3\n if k<=s :\n ans = 1\n elif (k-w3 <= s) or (k-w1 <= s) :\n ans = 2\n else :\n ans = 3\n print(ans)\n \nt = int(input())\nwhile t>0 :\n solve()\n t -= 1\n", "# cook your dish here\nfor i in range(0,int(input())):\n power,x,y,z=list(map(float,input().split()))\n summ=x+y+z\n a=x+y\n b=y+z\n flagg=0\n if(x==y and y==z):\n flagg==0\n \n else:\n flagg=0\n \n if(power>=summ):\n print('1')\n else:\n if(flagg==1):\n if((x+y)>=power):\n print('2')\n else:\n print('3')\n else:\n \n if((power-z)>=y):\n \n print('2')\n \n else:\n if((power-y)>=x):\n print('2')\n else:\n print('3')", "# cook your dish here\nfor i in range(int(input())):\n s,w1,w2,w3=map(int,input().split())\n if s>= w1+w2+w3:\n print(1)\n else:\n if s>= w1+w2:\n if s>=w3:\n print(2)\n else:\n print(1+w3//s)\n elif s>=w2+w3:\n if s>=w1:\n print(2)\n else:\n print(1+w1//s)\n else:\n print(w1//s+w2//s+w3//s)"] | {"inputs": [["3", "3 1 2 2", "2 1 1 1", "3 2 2 1"]], "outputs": [["2", "2", "2"]]} | INTERVIEW | PYTHON3 | CODECHEF | 8,652 | |
7102782a6af5f65c54487d5cca054bf3 | UNKNOWN | "It does not matter how slowly you go as long as you do not stop." - Confucius
You are given an array $A_1, A_2, \ldots, A_N$ and an integer $K$. For each subarray $S = [A_l, A_{l+1}, \ldots, A_r]$ ($1 \le l \le r \le N$):
- Let's define an array $B$ as $S$ concatenated with itself $m$ times, where $m$ is the smallest integer such that $m(r-l+1) \ge K$.
- Next, let's sort $B$ and define $X = B_K$, i.e. as a $K$-th smallest element of $B$. Note that $|B| \ge K$.
- Then, let's define $F$ as the number of occurrences of $X$ in $S$.
- The subarray $S$ is beautiful if $F$ occurs in $S$ at least once.
Find the number of beautiful subarrays of $A$. Two subarrays $A_l, A_{l+1}, \ldots, A_r$ and $A_p, A_{p+1}, \ldots, A_q$ are different if $l \neq p$ or $r \neq q$.
-----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 beautiful subarrays.
-----Constraints-----
- $1 \le T \le 5$
- $1 \le N \le 2,000$
- $1 \le K \le 10^9$
- $1 \le A_i \le 2000$ for each valid $i$
-----Subtasks-----
Subtask #1 (20 points): $1 \le N \le 200$
Subtask #2 (80 points): original constraints
-----Example Input-----
1
3 3
1 2 3
-----Example Output-----
3
-----Explanation-----
Example case 1: There are six subarrays of $A$: $[1]$, $[2]$, $[3]$, $[1, 2]$, $[2, 3]$, $[1, 2, 3]$. The corresponding arrays $B$ are $[1, 1, 1]$, $[2, 2, 2]$, $[3, 3, 3]$, $[1, 2, 1, 2]$, $[2, 3, 2, 3]$, $[1, 2, 3]$.
Three of the subarrays are beautiful: $[1]$, $[1, 2]$ and $[1, 2, 3]$. For these subarrays, $X$ is $1$, $2$ and $3$ respectively (for example, for $S = [1, 2]$, $B = [1, 2, 1, 2]$ is sorted to $[1, 1, 2, 2]$ and $X = 2$ is the $3$-rd element). Then, $F = 1$ for each of these subarrays, and each of these subarrays contains $1$. | ["from bisect import insort\nfrom math import ceil\nfor _ in range(int(input())):\n n,k=list(map(int,input().split( )))\n array=list(map(int,input().split( )))\n ans=0\n index=[]\n for i in range(1,n+1):\n index.append(ceil(k/(ceil(k/i))))\n for i in range(n):\n count=[0]*(2001)\n temp=[]\n for j in range(i,n):\n count[array[j]]+=1\n insort(temp,array[j])\n #m=ceil(k/(j-i+1)) precalculate thes values in index array\n #t=ceil(k/m)\n x=temp[index[j-i]-1]\n f=count[x]\n if count[f]:\n ans+=1\n print(ans)\n", "from bisect import insort\nfrom math import ceil\nfor _ in range(int(input())):\n n,k=map(int,input().split( ))\n array=list(map(int,input().split( )))\n ans=0\n for i in range(n):\n count=[0]*(2001)\n temp=[]\n for j in range(i,n):\n count[array[j]]+=1\n insort(temp,array[j])\n m=ceil(k/(j-i+1))\n t=ceil(k/m)\n x=temp[t-1]\n f=count[x]\n if count[f]:\n ans+=1\n print(ans)", "from math import ceil\ndef Beauty(array,f,n):\n i=0\n j=i\n ans=0\n while i<n and j<n:\n if array[j]==f:\n ans+=(n-j)*(j-i)+(n-j)\n i=j+1\n j=i\n else:\n j+=1\n return ans\nfrom collections import defaultdict\nfor _ in range(int(input())):\n n,k=map(int,input().split( ))\n array=list(map(int,input().split( )))\n s=defaultdict(int)\n for v in array:\n s[v]+=1\n res=0\n for i in range(n):\n for j in range(i,n):\n b=array[i:j+1]\n b.sort()\n m=ceil(k/(j-i+1))\n t=ceil(k/m)\n x=b[t-1]\n f=b.count(x)\n if f in b:\n res+=1\n #res+=Beauty(array,f,n)\n print(res)", "import bisect\nfor t in range(int(input())):\n n, k = map(int, input().split())\n arr = list(map(int, input().split()))\n arr.insert(0,0)\n c = 0\n pre = [0 for k in range(2001)]\n for i in range(1, 2001):\n m = (int(k / i)) + 1\n if(k % i == 0):\n m = m - 1\n x = (int(k / m)) + 1\n if(k % m == 0):\n x = x - 1\n pre[i] = x\n for i in range(1, n + 1):\n brr = [0 for k in range(2001)]\n lis = []\n for j in range(i, n + 1):\n brr[arr[j]] = brr[arr[j]] + 1\n bisect.insort(lis, arr[j])\n size = j - i + 1\n xt = pre[size]\n y = lis[xt-1]\n f = brr[y]\n if brr[f] > 0:\n c = c + 1\n print(c)", "import sys\ninput=sys.stdin.readline \nfrom collections import defaultdict\nfrom math import ceil \nfrom bisect import bisect_left as bl ,insort\nfor _ in range(int(input())):\n n,k=map(int,input().split())\n l=[int(i) for i in input().split()]\n ans=0\n for i in range(n):\n curr=[]\n cnt=[0]*(2002)\n for j in range(i,n):\n add=ceil(k/(j-i+1))\n #ind=bl(curr,l[j])\n insort(curr,l[j])\n cnt[l[j]]+=1 \n if k<=j-i+1:\n x=curr[k-1]\n else:\n x=curr[ceil(k/add)-1]\n z=cnt[x]\n if cnt[z]:\n ans+=1 \n print(ans)", "import sys\ninput=sys.stdin.readline \nfrom collections import defaultdict\nfrom math import ceil \nfrom bisect import bisect_left as bl \nfor _ in range(int(input())):\n n,k=map(int,input().split())\n l=[int(i) for i in input().split()]\n cnt=0\n for i in range(n):\n curr=[]\n d=defaultdict(int)\n for j in range(i,n):\n add=ceil(k/(j-i+1))\n ind=bl(curr,l[j])\n curr.insert(ind,l[j])\n d[l[j]]+=1 \n if k<=j-i+1:\n x=curr[k-1]\n else:\n x=curr[ceil(k/add)-1]\n z=d[x]\n if d[z]:\n cnt+=1 \n print(cnt)", "for _ in range(int(input())):\n n,k=map(int,input().split())\n from math import ceil \n l=[int(i) for i in input().split()]\n cnt=0 \n from collections import defaultdict\n from bisect import bisect_left as bl \n for i in range(n):\n curr=[]\n d=defaultdict(int)\n for j in range(i,n):\n add=ceil(k/(j-i+1))\n ind=bl(curr,l[j])\n curr.insert(ind,l[j])\n d[l[j]]+=1 \n if k<=j-i+1:\n x=curr[k-1]\n else:\n x=curr[ceil(k/add)-1]\n z=d[x]\n if d[z]:\n cnt+=1 \n print(cnt)", "for _ in range(int(input())):\n n,k=map(int,input().split())\n from math import ceil \n l=[int(i) for i in input().split()]\n cnt=0 \n for i in range(n):\n for j in range(i,n):\n add=ceil(k/(j-i+1))\n curr=l[i:j+1]\n curr.sort()\n if k<=j-i+1:\n x=curr[k-1]\n else:\n x=curr[ceil(k/add)-1]\n z=curr.count(x)\n if z in curr:\n cnt+=1 \n print(cnt)", "import bisect\nimport sys\nfrom sys import stdin, stdout\ntest = int(sys.stdin.readline())\nwhile test > 0:\n test = test - 1\n nk = [int(x) for x in sys.stdin.readline().split()]\n n = nk[0]\n k = nk[1]\n arr = [int(x) for x in sys.stdin.readline().split()]\n arr.insert(0,0)\n c = 0\n pre = [0 for k in range(2001)]\n for i in range(1, 2001):\n m = (int(k / i)) + 1\n if(k % i == 0):\n m = m - 1\n x = (int(k / m)) + 1\n if(k % m == 0):\n x = x - 1\n pre[i] = x\n for i in range(1, n + 1):\n #print(arr[i], end = \" \")\n brr = [0 for k in range(2001)]\n lis = []\n for j in range(i, n + 1):\n brr[arr[j]] = brr[arr[j]] + 1\n bisect.insort(lis, arr[j])\n #print(lis)\n size = j - i + 1\n xt = pre[size]\n y = lis[xt-1]\n f = brr[y]\n if brr[f] > 0:\n #print(i,\" \",j,\" \",y)\n c = c + 1\n print(c)", "from math import ceil\nfrom bisect import insort\nfor z in range(int(input())):\n n,k=list(map(int,input().split()))\n a=list(map(int,input().split()))\n c=0\n i=0\n pos=[]\n while i<n:\n pos.append(ceil(k/(ceil(k/(i+1)))))\n i+=1\n i=0\n while i<n-1:\n h=[]\n cl=[0]*2001\n j=0\n while i+j<n:\n cl[a[i+j]]+=1\n insort(h,a[i+j])\n x=h[pos[j]-1]\n f=cl[x]\n if cl[f]:c+=1\n j+=1\n i+=1\n print(c)\n", "from math import ceil\nfrom bisect import insort\nfor z in range(int(input())):\n n,k=list(map(int,input().split()))\n a=list(map(int,input().split()))\n i=0\n c=0\n while i<n-1:\n h=[]\n cl=[0]*2001\n j=0\n while i+j<n:\n cl[a[i+j]]+=1\n insort(h,a[i+j])\n m=ceil(k/(j+1))\n p=ceil(k/m)\n x=h[p-1]\n f=cl[x]\n if cl[f]:c+=1\n j+=1\n i+=1\n print(c)\n", "from bisect import bisect_left\n\ndef BinarySearch(a, x):\n i = bisect_left(a, x)\n if i != len(a) and a[i] == x:\n return True\n else:\n return False\n\nimport math\nfor _ in range(int(input())):\n #arnab sucks\n ans=0\n N,k=[int(x) for x in input().split()]\n a=[int(x) for x in input().split()]\n for i in range(N):\n for j in range(i,N):\n S=a[i:j+1]\n S.sort()\n god=math.ceil(k/len(S))\n\n X=S[math.ceil(k/god)-1]\n F=0\n for z in S:\n if z ==X:\n F+=1\n if BinarySearch(S,F):\n ans+=1\n print(ans)\n", "import heapq\n\nt=int(input())\nfor y in range(t):\n (n, k )=(int(x) for x in input().split())\n places=[]\n for l in range(1,n+1):\n m=(k-1)//l+1\n shoot=m*l-k\n place=shoot//m+1\n places.append(place)\n A=[int(x) for x in input().split()]\n heaps=[[-x] for x in A]\n assert(len(A)==n)\n ans=A.count(1)\n for l in range(1,n):\n elements=[0]*2001\n for e in A[:l+1]:\n try:\n elements[e]+=1\n except:\n elements[e]=1\n for s in range(0,n-l):\n heapq.heappush(heaps[s],-A[s+l]) \n if places[l]>2:\n reserve=[]\n for i in range(places[l]):\n reserve.append(heapq.heappop( heaps[s]))\n for r in reserve:\n heapq.heappush(heaps[s],r)\n x=-reserve[-1]\n elif (places[l]==2):\n x=max(-heaps[s][1],heaps[s][2])\n else:\n x=-heaps[s][0]\n f=elements[x]\n try:\n if elements[f]>0:\n ans+=1\n except:\n pass\n if s<n-l-1:\n try:\n elements[A[s]]-=1\n elements[A[s+l+1]]+=1\n except: \n elements[A[s+l+1]]=1\n print(ans)", "import bisect\nimport math\nt=int(input())\nwhile t>0:\n fp=0\n n,k=map(int,input().split())\n a=list(map(int,input().split()))\n \n for i in range(n):\n left=[]\n \n arr=[0]*2005\n for j in range(i,n):\n bisect.insort(left, a[j])\n arr[a[j]]+=1\n uhoy=math.ceil(k/(j-i+1))\n mc=int(((k-1)/uhoy))\n kpop=arr[left[mc]]\n if arr[kpop]>=1:\n fp+=1\n print(fp)\n t-=1", "import bisect\nimport math\nt=int(input())\nwhile t>0:\n fp=0\n n,k=map(int,input().split())\n a=list(map(int,input().split()))\n \n for i in range(n):\n left=[]\n \n arr=[0]*2050\n for j in range(i,n):\n right = a[j]\n bisect.insort(left, right)\n arr[a[j]]+=1\n uhoy=math.ceil(k/(j-i+1))\n mc=int(math.ceil(k/uhoy))\n kpop=arr[left[mc-1]]\n if arr[kpop]>=1:\n fp+=1\n print(fp)\n t-=1", "import bisect\nimport math\nt=int(input())\nwhile t>0:\n fp=0\n n,k=map(int,input().split())\n a=[int(o) for o in input().split()]\n \n for i in range(n):\n left=[]\n \n arr=[0]*2050\n for j in range(i,n):\n right = a[j]\n #pos = bisect.bisect(left, right)\n bisect.insort(left, right)\n arr[a[j]]+=1\n uhoy=math.ceil(k/(j-i+1))\n mc=int(math.ceil(k/uhoy))\n kpop=arr[left[mc-1]]\n if arr[kpop]>=1:\n fp+=1\n print(fp)\n t-=1", "import bisect as b\nt=int(input())\nwhile(t):\n t-=1\n n,k=map(int,(input().split()))\n a=list(map(int,input().split()))\n c=0\n for i in range(n):\n x=[0]\n d=dict()\n for j in range(i,n):\n b.insort(x,a[j])\n y=k/(len(x)-1)\n if(d.get(a[j],-1)==-1):\n d[a[j]]=1\n else:\n d[a[j]]+=1\n if(int(y)!=y):\n y=int(y)+1\n y=int(y)\n z=k/y\n if(int(z)!=z):\n z=int(z)+1\n z=int(z)\n #print(d,x[z])\n q=d[x[z]]\n if(d.get(q,-1)!=-1):\n c+=1\n print(c)", "import bisect as b\nt=int(input())\nwhile(t):\n t-=1\n n,k=map(int,(input().split()))\n a=list(map(int,input().split()))\n c=0\n for i in range(n):\n x=[0]\n d=dict()\n for j in range(i,n):\n b.insort(x,a[j])\n y=k/(len(x)-1)\n if(d.get(a[j],-1)==-1):\n d[a[j]]=1\n else:\n d[a[j]]+=1\n if(int(y)!=y):\n y=int(y)+1\n y=int(y)\n z=k/y\n if(int(z)!=z):\n z=int(z)+1\n z=int(z)\n #print(d,x[z])\n q=d[x[z]]\n if(d.get(q,-1)!=-1):\n c+=1\n print(c)", "import bisect as b\nt=int(input())\nwhile(t):\n t-=1\n n,k=map(int,(input().split()))\n a=list(map(int,input().split()))\n c=0\n for i in range(n):\n x=[0]\n for j in range(i,n):\n b.insort(x,a[j])\n y=k/(len(x)-1)\n if(int(y)!=y):\n y=int(y)+1\n y=int(y)\n z=k/y\n if(int(z)!=z):\n z=int(z)+1\n z=int(z)\n q=1\n l=z-1\n while(l>=0):\n if(x[l]!=x[z]):\n break\n q+=1\n l-=1\n l=z+1\n #print(x,l)\n while(l<len(x)):\n if(x[l]!=x[z]):\n break\n l+=1\n q+=1\n l=b.bisect(x,q)\n if(x[l-1]==q):\n c+=1\n print(c)", "import bisect as b\nt=int(input())\nwhile(t):\n t-=1\n n,k=map(int,(input().split()))\n a=list(map(int,input().split()))\n c=0\n for i in range(n):\n x=[0]\n for j in range(i,n):\n b.insort(x,a[j])\n y=k/(len(x)-1)\n if(int(y)!=y):\n y=int(y)+1\n y=int(y)\n z=k/y\n if(int(z)!=z):\n z=int(z)+1\n z=int(z)\n if(x.count(x[z]) in x):\n c+=1\n print(c)", "import bisect as b\nt=int(input())\nwhile(t):\n t-=1\n n,k=map(int,(input().split()))\n a=list(map(int,input().split()))\n c=0\n for i in range(n):\n x=[0]\n for j in range(i,n):\n b.insort(x,a[j])\n y=k/(len(x)-1)\n if(int(y)!=y):\n y=int(y)+1\n y=int(y)\n z=k/y\n if(int(z)!=z):\n z=int(z)+1\n z=int(z)\n if(x.count(x[z]) in x):\n c+=1\n print(c)", "from collections import Counter\nfrom math import ceil\ntest=int(input())\nfor _ in range(test):\n n,k=list(map(int,input().split()))\n a=list(map(int,input().split()))\n total=0\n for i in range(n):\n for j in range(i+1,n+1):\n subarray=a[i:j]\n length=j-i\n c=Counter(subarray)\n m = (k//length) if (k%length==0) else (k//length+1)\n kth=sorted(subarray)[ceil(k/m)-1]\n F=c[kth]\n if F in c:\n total+=1\n print(total)\n \n \n", "import math\nimport heapq\ndef counting_sort(array1, max_val):\n m = max_val + 1\n count = [0] * m\n for a in array1:\n count[a] += 1\n i = 0\n for a in range(m):\n for c in range(count[a]):\n array1[i] = a\n i += 1\n return array1\nfor _ in range(int(input())):\n n,k=list(map(int,input().split()))\n l=list(map(int,input().split()))\n M=[]\n ans=0\n for i in range(n):\n for j in range(i,n):\n m=math.ceil(k/(j-i+1))\n gt=(k-1)//m\n M.append(gt)\n break\n for i in range(n):\n max=-1\n s=set()\n d={}\n hallo_frnd={}\n for j in range(i,n):\n x=None\n value=M[j-i]\n if l[j] not in d:\n d[l[j]]=1\n else:\n d[l[j]]+=1\n if l[j]>max:\n max=l[j]\n if value not in s:\n ####\n s.add(value)\n x=max\n hallo_frnd[value]=max\n else:\n if l[j]<hallo_frnd[value]:\n yt=l[i:j+1]\n heapq.heapify(yt)\n x=heapq.nsmallest(value+1,yt)[-1]\n hallo_frnd[value]=x\n else:\n x=hallo_frnd[value]\n if d[x] in d:\n ans+=1\n print(ans)\n"] | {"inputs": [["1", "3 3", "1 2 3"]], "outputs": [["3"]]} | INTERVIEW | PYTHON3 | CODECHEF | 12,300 | |
86a22eb1170e2eca30e1ff956b348959 | UNKNOWN | The entire network is under the inspection and direct control of the Decepticons. They have learned our language through the World Wide Web and can easily understand the messages which are being sent. Sam is trying to send the information to Autobots to locate “ALL SPARK” which is the only source of energy that can be used to create universe. He is bit cautious in sending the message. He is sending the messages in a form of special pattern of string that contains important message in form of substrings. But Decepticons have learnt to recognize the Data Mining and string comparison patterns. He is sending a big message in form of a string (say M) and let there are N smaller substrings. Decepticons have to find whether each of these N substrings is a sub-string of M. All strings consist of only alphanumeric characters.
-----Input-----
Input to the program consists of two line. The first line contains the string M (where size of M should be <=40). The next line contain a string S.
-----Output-----
Output should consist of a line with a character 'Y'/'N' indicating whether the string S is a sub-string of String M or not.
-----Example-----
Input:
techtrishna online event
onlin
Output:
Y | ["x = input()\ny = input()\nz = x.find(y)\nif z == -1 :\n print('N')\nelse :\n print('Y')", "m=input().strip().lower()\ns=input().strip().lower()\n\nif m.find(s)==-1:\n print('N')\nelse:\n print('Y')", "import sys\n\ndef main():\n s = sys.stdin.readline\n a = s().strip()\n b = s().strip()\n if b in a:\n print(\"Y\")\n else:\n print(\"N\")\n\ndef __starting_point():\n main()\n\n__starting_point()"] | {"inputs": [["techtrishna online event", "onlin"]], "outputs": [["Y"]]} | INTERVIEW | PYTHON3 | CODECHEF | 402 | |
a0ffdf19f5203d07a9733e88f709e2eb | UNKNOWN | We say that a binary string (a string containing only characters '0' and '1') is pure if it does not contain either of the strings "0101" or "1010" as a subsequence.
Recall that string T is a subsequence of string S if we can delete some of the letters of S (possibly none) such that the resulting string will become T.
You are given a binary string $S$ with length $N$. We want to make this string pure by deleting some (possibly zero) characters from it. What is the minimum number of characters we have to delete?
-----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 string $S$ with length $N$.
-----Output-----
For each test case, print a single line containing one integer — the minimum number of characters we have to delete from $S$.
-----Constraints-----
- $1 \le T \le 40$
- $1 \le N \le 1,000$
- $S$ contains only characters '0' and '1'
-----Example Input-----
4
010111101
1011100001011101
0110
111111
-----Example Output-----
2
3
0
0
-----Explanation-----
Example case 1: We can delete the first and third character of our string. There is no way to make the string pure by deleting only one character.
Example case 3: The given string is already pure, so the answer is zero. | ["# cook your dish here\nimport math;\nfrom math import gcd,sqrt,floor,factorial,ceil\nfrom bisect import bisect_left,bisect_right\nimport bisect;\nimport sys;\nfrom sys import stdin,stdout\nimport os\nsys.setrecursionlimit(pow(10,7))\nimport collections\nfrom collections import defaultdict,Counter\nfrom statistics import median\n# input=stdin.readline\n# print=stdout.write\nfrom queue import Queue\ninf = float(\"inf\")\nfrom operator import neg;\nmod=pow(10,9)+7\ndef fun(l):\n m=[[l[0]]]\n for i in range(1,n):\n if m[-1][-1]==l[i]:\n m[-1]+=[l[i]]\n else:\n m.append([l[i]])\n count=[]\n for i in range(len(m)):\n count.append(len(m[i]))\n return count;\ndef function(l1,index,prev,count):\n tuple=(index,prev,count)\n if tuple in dict:\n return dict[tuple]\n n=len(l1)\n if index==n:\n return 0;\n if count>=3:\n if index%2==prev:\n dict[tuple]=function(l1,index+1,prev,count)\n return function(l1,index+1,prev,count)\n else:\n dict[tuple]=l1[index]+function(l1,index+1,prev,count);\n return dict[tuple]\n if prev==None:\n skip=l1[index]+function(l1,index+1,prev,count)\n not_skip=function(l1,index+1,index%2,count+1)\n maxa=min(skip,not_skip)\n dict[tuple]=maxa\n return maxa;\n\n if index%2==prev:\n dict[tuple]=function(l1,index+1,index%2,count)\n return dict[tuple]\n if index%2!=prev:\n skip=l1[index]+function(l1,index+1,prev,count)\n not_skip=function(l1,index+1,index%2,1+count)\n maxa = min(skip, not_skip)\n dict[tuple]=maxa\n return maxa;\n\nt=int(input())\nfor i in range(t):\n s=input()\n l=list(s)\n n=len(l)\n l=[int(i) for i in l]\n l1=fun(l)\n dict=defaultdict(int)\n theta=function(l1,0,None,0)\n print(theta)\n", "# cook your dish here\nimport math;\nfrom math import gcd,sqrt,floor,factorial,ceil\nfrom bisect import bisect_left,bisect_right\nimport bisect;\nimport sys;\nfrom sys import stdin,stdout\nimport os\nsys.setrecursionlimit(pow(10,7))\nimport collections\nfrom collections import defaultdict,Counter\nfrom statistics import median\ninput=stdin.readline\n# print=stdout.write\nfrom queue import Queue\ninf = float(\"inf\")\nfrom operator import neg;\nmod=pow(10,9)+7\ndef fun(l):\n m=[[l[0]]]\n for i in range(1,n):\n if m[-1][-1]==l[i]:\n m[-1]+=[l[i]]\n else:\n m.append([l[i]])\n count=[]\n for i in range(len(m)):\n count.append(len(m[i]))\n return count;\ndef function(l1,index,prev,count):\n tuple=(index,prev,count)\n if tuple in dict:\n return dict[tuple]\n n=len(l1)\n if index==n:\n return 0;\n if count>=3:\n if index%2==prev:\n\n a1=l1[index]+function(l1,index+1,prev,count)\n dict[tuple] =a1;\n return a1;\n else:\n\n dict[tuple]=function(l1,index+1,prev,count);\n return dict[tuple]\n if prev==None:\n skip=function(l1,index+1,prev,count)\n not_skip=l1[index]+function(l1,index+1,index%2,count+1)\n maxa=max(skip,not_skip)\n dict[tuple]=maxa;\n return maxa;\n\n if index%2==prev:\n dict[tuple]=l1[index]+function(l1,index+1,index%2,count)\n return dict[tuple]\n if index%2!=prev:\n skip=function(l1,index+1,prev,count)\n not_skip=l1[index]+function(l1,index+1,index%2,1+count)\n maxa = max(skip, not_skip)\n dict[tuple]=maxa\n return maxa;\n\nt=int(input())\nfor i in range(t):\n s=input()\n l=list(s)\n l.pop()\n n=len(l)\n l=[int(i) for i in l]\n l1=fun(l)\n dict=defaultdict(int)\n theta=function(l1,0,None,0)\n print(n-theta)\n", "# cook your dish here\nimport math;\nfrom math import gcd,sqrt,floor,factorial,ceil\nfrom bisect import bisect_left,bisect_right\nimport bisect;\nimport sys;\nfrom sys import stdin,stdout\nimport os\nsys.setrecursionlimit(pow(10,7))\nimport collections\nfrom collections import defaultdict,Counter\nfrom statistics import median\n# input=stdin.readline\n# print=stdout.write\nfrom queue import Queue\ninf = float(\"inf\")\nfrom operator import neg;\nmod=pow(10,9)+7\ndef fun(l):\n m=[[l[0]]]\n for i in range(1,n):\n if m[-1][-1]==l[i]:\n m[-1]+=[l[i]]\n else:\n m.append([l[i]])\n count=[]\n for i in range(len(m)):\n count.append(len(m[i]))\n return count;\ndef function(l1,index,prev,count):\n tuple=(index,prev,count)\n if tuple in dict:\n return dict[tuple]\n n=len(l1)\n if index==n:\n return 0;\n if count>=3:\n if index%2==prev:\n\n a1=l1[index]+function(l1,index+1,prev,count)\n dict[tuple] =a1;\n return a1;\n else:\n\n dict[tuple]=function(l1,index+1,prev,count);\n return dict[tuple]\n if prev==None:\n skip=function(l1,index+1,prev,count)\n not_skip=l1[index]+function(l1,index+1,index%2,count+1)\n maxa=max(skip,not_skip)\n dict[tuple]=maxa;\n return maxa;\n\n if index%2==prev:\n dict[tuple]=l1[index]+function(l1,index+1,index%2,count)\n return dict[tuple]\n if index%2!=prev:\n skip=function(l1,index+1,prev,count)\n not_skip=l1[index]+function(l1,index+1,index%2,1+count)\n maxa = max(skip, not_skip)\n dict[tuple]=maxa\n return maxa;\n\nt=int(input())\nfor i in range(t):\n s=input()\n l=list(s)\n n=len(l)\n l=[int(i) for i in l]\n l1=fun(l)\n dict=defaultdict(int)\n theta=function(l1,0,None,0)\n print(n-theta)\n", "# cook your dish here\nt = int(input())\nfor _ in range(t):\n s = input()\n n = len(s)\n o, z, oz, zo, ozo, zoz = 0,0,0,n,n,n\n for i in s:\n if i=='1':\n zo = min(zo,z)\n z = z+1\n ozo = min(ozo,oz)\n oz = oz+1\n zoz = zoz+1\n else:\n oz = min(oz, o)\n o = o+1\n zoz = min(zoz, zo)\n zo = zo+1\n ozo = ozo+1\n print(min(o, z, oz, zo, ozo, zoz))", "# cook your dish here\n# code by RAJ BHAVSAR\nfor _ in range(int(input())):\n s = str(input())\n dp = [0,0,len(s),len(s),len(s),len(s)]\n for i in s:\n if(i == '1'):\n dp[3] = min(dp[3],dp[0])\n dp[0] += 1\n dp[5] = min(dp[5],dp[2])\n dp[2] += 1\n dp[4] += 1\n else:\n dp[2] = min(dp[2],dp[1])\n dp[1] += 1\n dp[4] = min(dp[4],dp[3])\n dp[3] += 1\n dp[5] += 1\n print(min(dp))", "for _ in range(int(input())):\n bi = input().strip()\n dp = [0 if i < 2 else len(bi) for i in range(6)]\n for c in bi:\n if c == '1':\n dp[3] = min(dp[3], dp[0])\n dp[0] += 1\n dp[5] = min(dp[5], dp[2])\n dp[2] += 1\n dp[4] += 1\n else:\n dp[2] = min(dp[2], dp[1])\n dp[1] += 1\n dp[4] = min(dp[4], dp[3])\n dp[3] += 1\n dp[5] += 1\n print(min(dp))\n \n", "t = int(input())\nwhile(t>0):\n st = input()\n dp = [0 if(i<2) else len(st) for i in range(6)] # dp is a 6 element array, \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0where the first two elements signify the no. of ones and no. of zeros \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0respectively while, the 3rd and 4th element signifies the current 10 or \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a001 trend and the 5th and 6th element takes care of the 101 or 010 trend\n for c in st:\n if(c=='1'):\n dp[3] = min(dp[3],dp[1])\n dp[1]+=1\n dp[4] = min(dp[4],dp[2])\n dp[2]+=1\n dp[5]+=1\n else:\n dp[2] = min(dp[2],dp[0])\n dp[0]+=1\n dp[5] = min(dp[5],dp[3])\n dp[3]+=1\n dp[4]+=1\n print(min(dp))\n t=t-1\n", "for _ in range(int(input())):\n bi = input().strip()\n dp = [0 if i < 2 else len(bi) for i in range(6)]\n for c in bi:\n if c == '1':\n dp[3] = min(dp[3], dp[0])\n dp[0] += 1\n dp[5] = min(dp[5], dp[2])\n dp[2] += 1\n dp[4] += 1\n else:\n dp[2] = min(dp[2], dp[1])\n dp[1] += 1\n dp[4] = min(dp[4], dp[3])\n dp[3] += 1\n dp[5] += 1\n print(min(dp))\n", "import numpy as np\ni8 = np.int64\n\n\ndef solve_core(a, n):\n res = 0\n s1 = a[0]\n s2 = a[1]\n s3 = np.sum(a[2::2])\n for i in range(1, n, 2):\n t3 = s3\n for j in range(i + 1, n + 1, 2):\n res = max(res, s1 + s2 + t3)\n s2 += a[j + 1]\n t3 -= a[j]\n s1 += a[i + 1]\n s2 = a[i + 2]\n s3 -= a[i + 1]\n return res\n\n\ndef solve(S):\n N = len(S)\n a = np.zeros(N + 2, i8)\n i = 0\n prev = S[0]\n count = 0\n for c in S:\n if c == prev:\n count += 1\n else:\n a[i] = count\n prev = c\n count = 1\n i += 1\n else:\n a[i] = count\n i += 1\n if i < 4:\n return 0\n else:\n res = max(solve_core(a, i), solve_core(a[1:], i - 1))\n return N - res\n\ndef main():\n T = int(input())\n for _ in range(T):\n S = input()\n print(solve(S))\n\ndef __starting_point():\n main()\n__starting_point()", "T=int(input())\nfor _ in range(T):\n s=input()\n l=[]\n a=0\n b=0\n for i in s:\n if i=='1':\n if a!=0:\n l.append(a)\n a=0\n b+=1\n else:\n if b!=0:\n l.append(b)\n b=0\n a-=1\n if a!=0:\n l.append(a)\n if b!=0:\n l.append(b)\n A=[0]\n B=[0]\n for i in l:\n if i<0:\n A.append(-i+A[-1])\n B.append(B[-1])\n else:\n A.append(A[-1])\n B.append(i+B[-1])\n m=0\n x=len(A)-1\n for i in range(1,x+1):\n for j in range(i,x+1):\n m=max(m,A[j]-A[i-1]+B[i-1]+B[x]-B[j],B[j]-B[i-1]+A[i-1]+A[x]-A[j])\n print(len(s)-m)\n", "import sys\nfrom random import randint\n\n\ndef rec(x, y, b):\n if x == n:\n return 0\n if y == 3:\n return n\n if dp[x][y] != -1:\n return dp[x][y]\n if y == 1:\n p = b ^ 1\n else:\n p = b\n res = n\n if a[x] != p:\n res = min(res, rec(x, y+1, b))\n res = min(res, 1+rec(x+1, y, b))\n else:\n res = min(res, rec(x+1, y, b))\n dp[x][y] = res\n return dp[x][y]\n\n\nsys.setrecursionlimit(10**6)\nt = int(input())\n# t = 1\nfor _ in range(t):\n a = list(map(int, list(input())))\n # a = [randint(0, 1) for i in range(1000)]\n n = len(a)\n dp = [[-1, -1, -1] for i in range(n)]\n res = rec(0, 0, 0)\n dp = [[-1, -1, -1] for i in range(n)]\n res = min(res, rec(0, 0, 1))\n print(res)"] | {"inputs": [["4", "010111101", "1011100001011101", "0110", "111111"]], "outputs": [["2", "3", "0", "0"]]} | INTERVIEW | PYTHON3 | CODECHEF | 9,350 | |
7a1859a78939463dce6db2bac58ee1a3 | UNKNOWN | You are given a grid with $R$ rows (numbered $1$ through $R$) and $C$ columns (numbered $1$ through $C$). Initially, each cell of this grid is either empty, contains an ant or an anteater. Each ant is moving in a fixed direction: up, down, left or right. The anteaters do not move.
The movement of ants happens in discrete steps. For example, when an ant is in the cell in the $i$-th row and $j$-th column at some point in time (in some step) and it is moving down, then in the next step, it enters the cell in the $(i+1)$-th row and $j$-th column. Two ants meet each other when they enter the same cell at the same point in time (in the same step). When ants meet, they do not interact in any way and keep moving in their fixed directions.
If an ant reaches an anteater, that anteater eats the ant, so the ant completely disappears. If an ant attempts to leave the grid, it also disappears. When two ants enter a cell containing an anteater at the same time, they are eaten before they could meet.
Calculate the total number of pairs of ants that meet each other.
-----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$.
- Each of the following $R$ lines contains a single string with length $C$. For each valid $i, j$, the $j$-th character in the $i$-th string is:
- '#' if the cell in the $i$-th row and $j$-th column of the grid contains an anteater
- 'U', 'D', 'L' or 'R' if this cell contains an ant moving up, down, left or right respectively
- '-' if this cell is empty
-----Output-----
For each test case, print a single line containing one integer — the number of pairs of ants that meet.
-----Constraints-----
- $1 \le T \le 10$
- $1 \le R, C \le 50$
- each string contains only characters 'U', 'D', 'L', 'R', '#' and '-'
-----Example Input-----
10
3 3
R--
---
--U
1 4
R--R
2 2
--
--
1 4
R--L
1 4
-R-L
1 4
-R#L
3 3
R-D
-#-
R-U
3 3
R-D
---
R#U
3 3
-D-
R-L
-U-
1 7
RLLLLLL
-----Example Output-----
1
0
0
0
1
0
3
2
6
3 | ["import sys\r\n\r\nt = int(input())\r\n# print(t)\r\nfor _ in range(t):\r\n\tn,m = map(int,input().split());\r\n\ts = [];\r\n\tfor i in range(n):\r\n\t\ts.append(input())\r\n\tans = []\r\n\tfor i in range(n):\r\n\t\tans.append([])\r\n\t\tfor j in range(m):\r\n\t\t\tans[i].append([])\r\n\tfor i in range(n):\r\n\t\tfor j in range(m):\r\n\t\t\tc = 0\r\n\t\t\tif s[i][j] == 'U':\r\n\t\t\t\tfor k in range(i,-1,-1):\r\n\t\t\t\t\tif s[k][j] == '#':\r\n\t\t\t\t\t\tbreak\r\n\t\t\t\t\tans[k][j].append(c)\r\n\t\t\t\t\tc+=1\r\n\t\t\telif s[i][j] == 'D':\r\n\t\t\t\tfor k in range(i,n):\r\n\t\t\t\t\tif s[k][j] == '#':\r\n\t\t\t\t\t\tbreak\r\n\t\t\t\t\tans[k][j].append(c)\r\n\t\t\t\t\tc+=1\r\n\t\t\telif s[i][j] == 'L':\r\n\t\t\t\tfor k in range(j,-1,-1):\r\n\t\t\t\t\tif s[i][k] == '#':\r\n\t\t\t\t\t\tbreak\r\n\t\t\t\t\tans[i][k].append(c)\r\n\t\t\t\t\tc+=1\r\n\t\t\telif s[i][j] == 'R':\r\n\t\t\t\tfor k in range(j,m):\r\n\t\t\t\t\tif s[i][k] == '#':\r\n\t\t\t\t\t\tbreak\r\n\t\t\t\t\tans[i][k].append(c)\r\n\t\t\t\t\tc+=1\r\n\tfor i in range(n):\r\n\t\tfor j in range(m):\r\n\t\t\tans[i][j].sort()\r\n\tres = []\r\n\tfor i in range(n):\r\n\t\tfor j in range(m):\r\n\t\t\tc= 1\r\n\t\t\t# print(ans[i][j])\r\n\t\t\tfor k in range(1,len(ans[i][j])):\r\n\t\t\t\t# print(ans[i][j][k])\r\n\t\t\t\tif ans[i][j][k] == ans[i][j][k-1]:\r\n\t\t\t\t\tc+=1\r\n\t\t\t\telse :\r\n\t\t\t\t\tif c!=1:\r\n\t\t\t\t\t\tres.append(c)\r\n\t\t\t\t\tc = 1\r\n\t\t\t\tif k==len(ans[i][j])-1:\r\n\t\t\t\t\tif c!=1:\r\n\t\t\t\t\t\tres.append(c)\r\n\tpairs = 0\r\n\t# print(res)\r\n\tfor i in range(len(res)):\r\n\t\tpairs += ((res[i]*(res[i]-1))//2)\r\n\t\r\n\tprint(pairs)", "# cook your dish here\ndef count_ants(l, r, u, d):\n cnt = 0\n if l is False:\n cnt += 1\n if r is False:\n cnt += 1\n if u is False:\n cnt += 1\n if d is False:\n cnt += 1\n return cnt\n\n\ndef solve(m, row, col):\n ans = 0\n for i in range(row):\n for j in range(col):\n lw = True\n rw = True\n uw = True\n dw = True\n if m[i][j] == '#':\n continue\n for d in range(1, max(row, col)):\n cnt = 0\n if j - d < 0:\n lw = False\n if j + d >= col:\n rw = False\n if i - d < 0:\n uw = False\n if i + d >= row:\n dw = False\n if count_ants(lw, rw, uw, dw) > 2:\n break\n if lw and j - d >= 0:\n if m[i][j - d] == 'R':\n cnt += 1\n elif m[i][j-d] == '#':\n lw = False\n if rw and j + d < col:\n if m[i][j + d] == 'L':\n cnt += 1\n elif m[i][j+d] == '#':\n rw = False\n\n if uw and i - d >= 0:\n if m[i - d][j] == 'D':\n cnt += 1\n elif m[i-d][j] == '#':\n uw = False\n\n if dw and i + d < row:\n if m[i + d][j] == 'U':\n cnt += 1\n elif m[i+d][j] == '#':\n dw = False\n if cnt > 1:\n ans += (cnt * (cnt - 1)) // 2\n return ans\n\n\ndef read():\n t = int(input())\n for i in range(t):\n r, c = list(map(int, input().strip().split()))\n m = [[] for i in range(r)]\n for i in range(r):\n s = input().strip()\n m[i] = s\n ans = solve(m, r, c)\n print(ans)\n\nread()", "import copy\r\ndef AllDead(arr):\r\n\tvar=1\r\n\tfor x in arr:\r\n\t\tfor y in x:\r\n\t\t\tif \"U\" in y or \"D\" in y or \"L\"in y or \"R\" in y:\r\n\t\t\t\tvar=0\r\n\treturn var\r\ndef checkMeet(arr):\r\n\tans=0\r\n\tfor x in arr:\r\n\t\tfor y in x:\r\n\t\t\tif len(y)>=2 and '-' not in y:\r\n\t\t\t\tans+=(len(y)*(len(y)-1))//2\r\n\treturn ans\r\nt=int(input())\r\nfor i in range(t):\r\n\tn,m=map(int,input().split())\r\n\tlol=[['#']]*(m+2)\r\n\tarr=[lol]\r\n\tfor j in range(n):\r\n\t\tmo=[[x] for x in input()]\r\n\t\tarr+=[[['#']]+mo+[['#']]]\r\n\tarr+=[lol]\r\n\tmeet=0\r\n\twhile AllDead(arr)==0:\r\n\t\ttemp=copy.deepcopy(arr)\r\n\t\tfor x in range(1,n+1):\r\n\t\t\tfor y in range(1,m+1):\r\n\t\t\t\tfor z in arr[x][y]:\r\n\t\t\t\t\tif z=='U':\r\n\t\t\t\t\t\tif arr[x-1][y]==['#']:\r\n\t\t\t\t\t\t\tdo_nothing=1\r\n\t\t\t\t\t\telif temp[x-1][y]==['-']:\r\n\t\t\t\t\t\t\ttemp[x-1][y].remove('-')\r\n\t\t\t\t\t\t\ttemp[x-1][y]+=['U']\r\n\t\t\t\t\t\telse:\r\n\t\t\t\t\t\t\ttemp[x-1][y]+=['U']\r\n\t\t\t\t\t\ttemp[x][y].remove(z)\r\n\t\t\t\t\t\tif len(temp[x][y])==0:\r\n\t\t\t\t\t\t\ttemp[x][y]=['-']\r\n\t\t\t\t\tif z=='D':\r\n\t\t\t\t\t\tif arr[x+1][y]==['#']:\r\n\t\t\t\t\t\t\tdo_nothing=1\r\n\t\t\t\t\t\telif temp[x+1][y]==['-']:\r\n\t\t\t\t\t\t\ttemp[x+1][y].remove('-')\r\n\t\t\t\t\t\t\ttemp[x+1][y]+=['D']\r\n\t\t\t\t\t\telse:\r\n\t\t\t\t\t\t\ttemp[x+1][y]+=['D']\r\n\t\t\t\t\t\ttemp[x][y].remove(z)\r\n\t\t\t\t\t\tif len(temp[x][y])==0:\r\n\t\t\t\t\t\t\ttemp[x][y]=['-']\r\n\t\t\t\t\tif z=='L':\r\n\t\t\t\t\t\tif arr[x][y-1]==['#']:\r\n\t\t\t\t\t\t\tdo_nothing=1\r\n\t\t\t\t\t\telif temp[x][y-1]==['-']:\r\n\t\t\t\t\t\t\ttemp[x][y-1].remove('-')\r\n\t\t\t\t\t\t\ttemp[x][y-1]+=['L']\r\n\t\t\t\t\t\telse:\r\n\t\t\t\t\t\t\ttemp[x][y-1]+=['L']\r\n\t\t\t\t\t\ttemp[x][y].remove(z)\r\n\t\t\t\t\t\tif len(temp[x][y])==0:\r\n\t\t\t\t\t\t\ttemp[x][y]=['-']\r\n\t\t\t\t\tif z=='R':\r\n\t\t\t\t\t\tif arr[x][y+1]==['#']:\r\n\t\t\t\t\t\t\tdo_nothing=1\r\n\t\t\t\t\t\telif temp[x][y+1]==['-']:\r\n\t\t\t\t\t\t\ttemp[x][y+1].remove('-')\r\n\t\t\t\t\t\t\ttemp[x][y+1]+=['R']\r\n\t\t\t\t\t\telse:\r\n\t\t\t\t\t\t\ttemp[x][y+1]+=['R']\r\n\t\t\t\t\t\ttemp[x][y].remove(z)\r\n\t\t\t\t\t\tif len(temp[x][y])==0:\r\n\t\t\t\t\t\t\ttemp[x][y]=['-']\r\n\t\tarr=copy.deepcopy(temp)\r\n\t\tmeet+=checkMeet(arr)\r\n\tprint(meet)", "readFromFile = 0\r\nif readFromFile:\r\n f = open(\"inputSmall.txt\", \"r\")\r\n T = int(f.readline())\r\nelse:\r\n T = int(input())\r\n\r\ntestCases = range(T)\r\n\r\nfor case in testCases:\r\n if (readFromFile):\r\n RC = [int(x) for x in f.readline().split()]\r\n else:\r\n RC = [int(x) for x in input().split()]\r\n\r\n R = RC[0]\r\n C = RC[1]\r\n\r\n aByCols = {}\r\n aByRows = {}\r\n\r\n uAll = []\r\n dAll = []\r\n lAll = []\r\n rAll = []\r\n \r\n for r in range(R):\r\n if(readFromFile):\r\n row = f.readline()\r\n else:\r\n row = input()\r\n\r\n for c in range(C):\r\n if(row[c] == '#'):\r\n if(r not in aByRows):\r\n aByRows[r] = [] \r\n aByRows[r].append(c)\r\n if(c not in aByCols):\r\n aByCols[c] = []\r\n aByCols[c].append(r)\r\n\r\n elif(row[c] == 'U'):\r\n uAll.append((r,c))\r\n\r\n elif(row[c] == 'D'):\r\n dAll.append((r,c))\r\n\r\n elif(row[c] == 'L'):\r\n lAll.append((r,c))\r\n\r\n elif(row[c] == 'R'):\r\n rAll.append((r,c))\r\n\r\n # U ant will die if # in same column, smaller row\r\n for x in range(len(uAll)):\r\n item = uAll[x]\r\n r = item[0]\r\n c = item[1]\r\n if (c in aByCols):\r\n eaters = aByCols[c]\r\n else:\r\n eaters = []\r\n age = R\r\n for y in eaters:\r\n if (y < r):\r\n age = min(age, r-y)\r\n uAll[x] = (item[0], item[1], age)\r\n\r\n # D ant will die if # in same column, larger row\r\n for x in range(len(dAll)):\r\n item = dAll[x]\r\n r = item[0]\r\n c = item[1]\r\n if (c in aByCols):\r\n eaters = aByCols[c]\r\n else:\r\n eaters = []\r\n age = R\r\n for y in eaters:\r\n if (y > r):\r\n age = min(age, y-r)\r\n dAll[x] = (item[0], item[1], age)\r\n\r\n # L ant will die if # in same row, smaller col\r\n for x in range(len(lAll)):\r\n item = lAll[x]\r\n r = item[0]\r\n c = item[1]\r\n if (r in aByRows):\r\n eaters = aByRows[r]\r\n else:\r\n eaters = []\r\n age = C\r\n for y in eaters:\r\n if (y < c):\r\n age = min(age, c-y)\r\n lAll[x] = (item[0], item[1], age)\r\n\r\n # R ant will die if # in same row, larger col\r\n for x in range(len(rAll)):\r\n item = rAll[x]\r\n r = item[0]\r\n c = item[1]\r\n if (r in aByRows):\r\n eaters = aByRows[r]\r\n else:\r\n eaters = []\r\n age = C\r\n for y in eaters:\r\n if (y > c):\r\n age = min(age, y-c)\r\n rAll[x] = (item[0], item[1], age)\r\n\r\n uBySum = {}\r\n uByDiff = {}\r\n uByCol = {}\r\n \r\n dBySum = {}\r\n dByDiff = {}\r\n dByCol = {}\r\n \r\n rBySum = {}\r\n rByDiff = {}\r\n rByRow = {}\r\n \r\n lBySum = {}\r\n lByDiff = {}\r\n lByRow = {}\r\n\r\n for x in uAll:\r\n r = x[0]\r\n c = x[1]\r\n if (r+c not in uBySum):\r\n uBySum[r+c] = []\r\n if (r-c not in uByDiff):\r\n uByDiff[r-c] = []\r\n if (c not in uByCol):\r\n uByCol[c] = []\r\n\r\n uBySum[r+c].append((r,c,x[2]))\r\n uByDiff[r-c].append((r,c,x[2]))\r\n uByCol[c].append((r,c,x[2]))\r\n\r\n for x in dAll:\r\n r = x[0]\r\n c = x[1]\r\n if (r+c not in dBySum):\r\n dBySum[r+c] = []\r\n if (r-c not in dByDiff):\r\n dByDiff[r-c] = []\r\n if (c not in dByCol):\r\n dByCol[c] = []\r\n\r\n dBySum[r+c].append((r,c,x[2]))\r\n dByDiff[r-c].append((r,c,x[2]))\r\n dByCol[c].append((r,c,x[2]))\r\n\r\n for x in lAll:\r\n r = x[0]\r\n c = x[1]\r\n if (r+c not in lBySum):\r\n lBySum[r+c] = []\r\n if (r-c not in lByDiff):\r\n lByDiff[r-c] = []\r\n if (r not in lByRow):\r\n lByRow[r] = []\r\n\r\n lBySum[r+c].append((r,c,x[2]))\r\n lByDiff[r-c].append((r,c,x[2]))\r\n lByRow[r].append((r,c,x[2]))\r\n\r\n for x in rAll:\r\n r = x[0]\r\n c = x[1]\r\n if (r+c not in rBySum):\r\n rBySum[r+c] = []\r\n if (r-c not in rByDiff):\r\n rByDiff[r-c] = []\r\n if (r not in rByRow):\r\n rByRow[r] = []\r\n\r\n rBySum[r+c].append((r,c,x[2]))\r\n rByDiff[r-c].append((r,c,x[2]))\r\n rByRow[r].append((r,c,x[2]))\r\n\r\n uSums = set(uBySum.keys())\r\n uDiffs = set(uByDiff.keys())\r\n uCols = set(uByCol.keys())\r\n dSums = set(dBySum.keys())\r\n dDiffs = set(dByDiff.keys())\r\n dCols = set(dByCol.keys())\r\n rSums = set(rBySum.keys())\r\n rDiffs = set(rByDiff.keys())\r\n rRows = set(rByRow.keys())\r\n lSums = set(lBySum.keys())\r\n lDiffs = set(lByDiff.keys())\r\n lRows = set(lByRow.keys())\r\n\r\n total = 0\r\n\r\n ## same sums: possible collision between U and L\r\n candidates = uSums & lSums\r\n for cc in candidates:\r\n r1 = [(x[0], 1, x[2]) for x in uBySum[cc]]\r\n r2 = [(x[0], 0, x[2]) for x in lBySum[cc]]\r\n rTot = r1 + r2\r\n rTot.sort()\r\n\r\n # Collision only when row of U > row of L\r\n # both parties survive\r\n zeros = []\r\n for i in range(len(rTot)):\r\n item = rTot[i]\r\n if (item[1] == 1):\r\n for j in zeros:\r\n if (item[0] - j[0] < j[2]) and (item[0] - j[0] < item[2]):\r\n total = total + 1\r\n elif (item[1] == 0):\r\n zeros.append(item)\r\n\r\n ## same sums: possible collision between D and R\r\n candidates = dSums & rSums\r\n for cc in candidates:\r\n r1 = [(x[0], 1, x[2]) for x in rBySum[cc]]\r\n r2 = [(x[0], 0, x[2]) for x in dBySum[cc]]\r\n rTot = r1 + r2\r\n rTot.sort()\r\n\r\n # Collision only when row of R > row of D\r\n # both parties survive\r\n zeros = []\r\n for i in range(len(rTot)):\r\n item = rTot[i]\r\n if (item[1] == 1):\r\n for j in zeros:\r\n if (item[0] - j[0] < j[2]) and (item[0] - j[0] < item[2]):\r\n total = total + 1\r\n elif (item[1] == 0):\r\n zeros.append(item)\r\n\r\n ## same diffs: possible collision between U and R\r\n candidates = uDiffs & rDiffs\r\n for cc in candidates:\r\n r1 = [(x[0], 1, x[2]) for x in uByDiff[cc]]\r\n r2 = [(x[0], 0, x[2]) for x in rByDiff[cc]]\r\n rTot = r1 + r2\r\n rTot.sort()\r\n\r\n # Collision only when row of U > row of R\r\n # both parties survive\r\n zeros = []\r\n for i in range(len(rTot)):\r\n item = rTot[i]\r\n if (item[1] == 1):\r\n for j in zeros:\r\n if (item[0] - j[0] < j[2]) and (item[0] - j[0] < item[2]):\r\n total = total + 1\r\n elif (item[1] == 0):\r\n zeros.append(item)\r\n\r\n ## same diffs: possible collision between D and L\r\n candidates = dDiffs & lDiffs\r\n for cc in candidates:\r\n r1 = [(x[0], 1, x[2]) for x in lByDiff[cc]]\r\n r2 = [(x[0], 0, x[2]) for x in dByDiff[cc]]\r\n rTot = r1 + r2\r\n rTot.sort()\r\n\r\n # Collision only when row of L > row of D\r\n # both parties survive\r\n zeros = []\r\n for i in range(len(rTot)):\r\n item = rTot[i]\r\n if (item[1] == 1):\r\n for j in zeros:\r\n if (item[0] - j[0] < j[2]) and (item[0] - j[0] < item[2]):\r\n total = total + 1\r\n elif (item[1] == 0):\r\n zeros.append(item)\r\n\r\n ## same cols: possible collision between D and U\r\n candidates = dCols & uCols\r\n for cc in candidates:\r\n r1 = [(x[0], 1, x[2]) for x in uByCol[cc]]\r\n r2 = [(x[0], 0, x[2]) for x in dByCol[cc]]\r\n rTot = r1 + r2\r\n rTot.sort()\r\n\r\n # Collision only when row of U > row of D,\r\n # distance is even\r\n # both parties survive\r\n zeros = []\r\n for i in range(len(rTot)):\r\n item = rTot[i]\r\n if (item[1] == 1):\r\n for j in zeros:\r\n if ((item[0] - j[0]) % 2 == 0) and (item[0] - j[0] < 2*j[2]) and (item[0] - j[0] < 2*item[2]):\r\n total = total + 1\r\n elif (item[1] == 0):\r\n zeros.append(item)\r\n\r\n ## same rows: possible collision between L and R\r\n candidates = lRows & rRows\r\n for cc in candidates:\r\n r1 = [(x[1], 1, x[2]) for x in lByRow[cc]]\r\n r2 = [(x[1], 0, x[2]) for x in rByRow[cc]]\r\n rTot = r1 + r2\r\n rTot.sort()\r\n\r\n # Collision only when col of L > col of R, \r\n # distance is even\r\n # both parties survive\r\n zeros = []\r\n for i in range(len(rTot)):\r\n item = rTot[i]\r\n if (item[1] == 1):\r\n for j in zeros:\r\n if ((item[0] - j[0]) % 2 == 0) and (item[0] - j[0] < 2*j[2]) and (item[0] - j[0] < 2*item[2]):\r\n total = total + 1\r\n elif (item[1] == 0):\r\n zeros.append(item)\r\n\r\n print(total)", "def nCr(n, r): \r\n \r\n return (fact(n) / (fact(r) * fact(n - r))) \r\n\r\ndef fact(n):\r\n res = 1\r\n \r\n for i in range(2, n+1): \r\n res = res * i \r\n \r\n return res \r\n\r\n\r\nwhile True:\r\n try:\r\n for _ in range(int(input())):\r\n r,c = map(int,input().split())\r\n arena = [[i for i in input().strip()] for j in range(r)]\r\n\r\n #print(*arena,sep='\\n')\r\n\r\n antsInitialPositions = []\r\n antsDirection=[]\r\n antEaterPositions = []\r\n for i in range(r):\r\n for j in range(c):\r\n if arena[i][j] in ['R','U','D','L']:\r\n antsInitialPositions.append([i,j])\r\n antsDirection.append(arena[i][j])\r\n elif arena[i][j] == '#':\r\n antEaterPositions.append([i,j])\r\n\r\n #print(antsInitialPositions)\r\n #print(antEaterPositions)\r\n\r\n antCount = len(antsInitialPositions)\r\n grid = [[{} for j in range(c)] for i in range(r)]\r\n\r\n for current in range(antCount):\r\n i,j = antsInitialPositions[current]\r\n direction = antsDirection[current]\r\n movei,movej = i,j\r\n if direction == 'D':\r\n steps = 0\r\n while movei<r and arena[movei][movej] != '#':\r\n steps = abs(i-movei)\r\n if steps in grid[movei][movej]:\r\n grid[movei][movej][steps]+=1\r\n else:\r\n grid[movei][movej][steps]=1\r\n movei+=1\r\n elif direction == 'U':\r\n steps=0\r\n while movei>=0 and arena[movei][movej] != '#':\r\n steps = abs(i-movei)\r\n #print(\"steps counted \", steps,movei,movej)\r\n if steps in grid[movei][movej]:\r\n #print(\"already there in dict\")\r\n grid[movei][movej][steps]+=1\r\n else:\r\n grid[movei][movej][steps]=1\r\n movei-=1\r\n elif direction == 'L':\r\n steps=0\r\n while movej>=0 and arena[movei][movej] != '#':\r\n steps = abs(j-movej)\r\n if steps in grid[movei][movej]:\r\n grid[movei][movej][steps]+=1\r\n else:\r\n grid[movei][movej][steps]=1\r\n movej-=1\r\n elif direction == 'R':\r\n steps=0\r\n while movej<c and arena[movei][movej] != '#':\r\n steps = abs(j-movej)\r\n if steps in grid[movei][movej]:\r\n grid[movei][movej][steps]+=1\r\n else:\r\n grid[movei][movej][steps]=1\r\n movej+=1\r\n #print(*grid,sep='\\n')\r\n meetings=0\r\n for i in range(r):\r\n for j in range(c):\r\n for meets in grid[i][j].values():\r\n if meets>=2:\r\n meetings+=nCr(meets,2)\r\n print(int(meetings))\r\n\r\n\r\n except (ValueError,EOFError) as e:\r\n break", "def nCr(n, r): \r\n \r\n return (fact(n) / (fact(r) * fact(n - r))) \r\n\r\ndef fact(n):\r\n res = 1\r\n \r\n for i in range(2, n+1): \r\n res = res * i \r\n \r\n return res \r\n\r\n\r\nwhile True:\r\n try:\r\n for _ in range(int(input())):\r\n r,c = map(int,input().split())\r\n arena = [[i for i in input().strip()] for j in range(r)]\r\n\r\n #print(*arena,sep='\\n')\r\n\r\n antsInitialPositions = []\r\n antsDirection=[]\r\n antEaterPositions = []\r\n for i in range(r):\r\n for j in range(c):\r\n if arena[i][j] in ['R','U','D','L']:\r\n antsInitialPositions.append([i,j])\r\n antsDirection.append(arena[i][j])\r\n elif arena[i][j] == '#':\r\n antEaterPositions.append([i,j])\r\n\r\n #print(antsInitialPositions)\r\n #print(antEaterPositions)\r\n\r\n antCount = len(antsInitialPositions)\r\n grid = [[{} for j in range(c)] for i in range(r)]\r\n\r\n for current in range(antCount):\r\n i,j = antsInitialPositions[current]\r\n direction = antsDirection[current]\r\n movei,movej = i,j\r\n if direction == 'D':\r\n steps = 0\r\n while movei<r and arena[movei][movej] != '#':\r\n steps = abs(i-movei)\r\n if steps in grid[movei][movej]:\r\n grid[movei][movej][steps]+=1\r\n else:\r\n grid[movei][movej][steps]=1\r\n movei+=1\r\n elif direction == 'U':\r\n steps=0\r\n while movei>=0 and arena[movei][movej] != '#':\r\n steps = abs(i-movei)\r\n #print(\"steps counted \", steps,movei,movej)\r\n if steps in grid[movei][movej]:\r\n #print(\"already there in dict\")\r\n grid[movei][movej][steps]+=1\r\n else:\r\n grid[movei][movej][steps]=1\r\n movei-=1\r\n elif direction == 'L':\r\n steps=0\r\n while movej>=0 and arena[movei][movej] != '#':\r\n steps = abs(j-movej)\r\n if steps in grid[movei][movej]:\r\n grid[movei][movej][steps]+=1\r\n else:\r\n grid[movei][movej][steps]=1\r\n movej-=1\r\n elif direction == 'R':\r\n steps=0\r\n while movej<c and arena[movei][movej] != '#':\r\n steps = abs(j-movej)\r\n if steps in grid[movei][movej]:\r\n grid[movei][movej][steps]+=1\r\n else:\r\n grid[movei][movej][steps]=1\r\n movej+=1\r\n #print(*grid,sep='\\n')\r\n meetings=0\r\n for i in range(r):\r\n for j in range(c):\r\n for meets in grid[i][j].values():\r\n if meets>=2:\r\n meetings+=nCr(meets,2)\r\n print(int(meetings))\r\n\r\n\r\n except (ValueError,EOFError) as e:\r\n break", "def find_next(arr):\r\n ans=[[set() for i in range(len(arr[0]))] for j in range(len(arr))]\r\n for i in range(len(arr)):\r\n for j in range(len(arr[0])):\r\n if j>0:\r\n if 'R' in arr[i][j-1] and '#' not in arr[i][j]:\r\n ans[i][j].add('R')\r\n if j<len(arr[0])-1:\r\n if 'L' in arr[i][j+1] and '#' not in arr[i][j]:\r\n ans[i][j].add('L')\r\n if i>0:\r\n if 'D' in arr[i-1][j] and '#' not in arr[i][j]:\r\n ans[i][j].add('D')\r\n if i<len(arr)-1:\r\n if 'U' in arr[i+1][j] and '#' not in arr[i][j]:\r\n ans[i][j].add('U')\r\n if '#' in arr[i][j]:\r\n ans[i][j].add(\"#\")\r\n return ans\r\n\r\ndef cal(arr):\r\n ans=0\r\n for i in range(len(arr)):\r\n for j in range(len(arr[0])):\r\n n=len(arr[i][j])\r\n ans+=n*(n-1)//2\r\n return ans\r\nt=int(input())\r\nfor _ in range(t):\r\n r,c=list(map(int,input().split()))\r\n arr=[]\r\n for i in range(r):\r\n toadd=list(map(set,list(input())))\r\n arr+=[toadd]\r\n ans=0\r\n for i in range(max(r,c)):\r\n arr=find_next(arr)\r\n ans+=cal(arr)\r\n print(ans)\r\n \r\n", "t = int(input())\nfor x in range(t):\n r, c = map(int, input().split())\n antU = []\n antD = []\n antR = []\n antL = []\n anteater = []\n j = 0\n for y in range(r):\n s = input()\n i = 0\n for z in s:\n if(z == 'U'):\n antU.append([j, i, 0, i])\n elif(z == 'D'):\n antD.append([j, i, r - 1, i])\n elif(z == 'R'):\n antR.append([j, i, j, c - 1])\n elif(z == 'L'):\n antL.append([j, i, j, 0])\n elif(z == '#'):\n anteater.append([j, i])\n i = i + 1\n j = j + 1\n for y in anteater:\n for z in antU:\n if(y[1] == z[1] and z[0] > y[0] and z[2] <= y[0]):\n z[2] = y[0] + 1 \n for z in antD:\n if(y[1] == z[1] and z[0] < y[0] and z[2] >= y[0]):\n z[2] = y[0] - 1\n for z in antR:\n if(y[0] == z[0] and z[1] < y[1] and z[3] >= y[1]):\n z[3] = y[1] - 1\n for z in antL:\n if(y[0] == z[0] and z[1] > y[1] and z[3] <= y[1]):\n z[3] = y[1] + 1\n total = 0\n for y in antU:\n for z in antD:\n if(y[1] == z[1] and y[2] <= z[2] and y[0] > z[0]):\n if((y[0] - z[0]) % 2 == 0):\n total = total + 1\n for z in antR:\n if(y[1] - z[1] == y[0] - z[0]):\n if(y[2] <= z[0] and z[3] >= y[1]):\n if(y[0] > z[0] and y[1] > z[1]):\n total = total + 1\n for z in antL:\n if(y[1] - z[1] == z[0] - y[0]):\n if(z[3] <= y[1] and y[2] <= z[0]):\n if(y[0] > z[0] and y[1] < z[1]):\n total = total + 1\n for y in antL:\n for z in antR:\n if((y[1] - z[1]) % 2 == 0):\n if(y[0] == z[0] and y[3] <= z[3] and y[1] > z[1]):\n total = total + 1\n for z in antD:\n if(y[0] - z[0] == y[1] - z[1]):\n if(y[3] <= z[1] and z[2] >= y[0]):\n if(y[0] > z[0] and y[1] > z[1]):\n total = total + 1\n for y in antD:\n for z in antR:\n if(y[0] - z[0] == z[1] - y[1]):\n if(z[3] >= y[1] and y[2] >= z[0]):\n if(y[0] < z[0] and y[1] > z[1]):\n total = total + 1\n print(total)", "# cook your dish here\nfor i in range(int(input())):\n r,c = [int(a) for a in input().split()]\n a = []\n for i in range(r):\n a.append(input())\n \n n = max(r,c)\n lst = [0 for i in range(n)]\n complete_list = []\n for i in range(r):\n z = []\n for j in range(c):\n z.append(lst.copy())\n complete_list.append(z)\n \n for i in range(r):\n for j in range(c):\n if a[i][j] == 'R':\n l = 1\n for p in range(j+1, c):\n if a[i][p] == '#':\n break\n complete_list[i][p][l] += 1\n l += 1\n\n elif a[i][j] == 'L':\n l = 1\n for p in range(j-1,-1,-1):\n if a[i][p] == '#':\n break\n complete_list[i][p][l] += 1\n l += 1\n\n elif a[i][j] == 'D':\n l = 1\n for p in range(i+1,r):\n if a[p][j] == '#':\n break\n complete_list[p][j][l] += 1\n l += 1\n\n elif a[i][j] == 'U':\n l = 1\n for p in range(i-1,-1,-1):\n if a[p][j] == '#':\n break\n complete_list[p][j][l] += 1\n l += 1\n\n ans = 0\n for i in range(r):\n for j in range(c):\n for p in range(n):\n if complete_list[i][j][p] == 2:\n ans += 1\n elif complete_list[i][j][p] == 3:\n ans += 3\n elif complete_list[i][j][p] == 4:\n ans += 6 \n print(ans)\n \n\n \n\n ", "import copy\r\nfor t in range(int(input())):\r\n r,c = list(map(int,input().split()))\r\n grid = []\r\n cpy = []\r\n for i in range(r):\r\n grid.append(list(input()))\r\n change = True\r\n ans = 0\r\n while(change):\r\n cpy = [[\"\" for i in range(c)] for j in range(r)]\r\n change = False\r\n for i in range(r):\r\n for j in range(c):\r\n for ele in grid[i][j]:\r\n if(ele==\"D\" and i<r-1):\r\n change = True\r\n if(grid[i+1][j]!=\"#\"):\r\n cpy[i+1][j] += \"D\"\r\n elif(ele==\"U\" and i>0):\r\n change = True\r\n if(grid[i-1][j]!='#'):\r\n cpy[i-1][j] += \"U\"\r\n elif(ele==\"R\" and j<c-1):\r\n change = True\r\n if(grid[i][j+1]!=\"#\"):\r\n cpy[i][j+1] += \"R\"\r\n elif(ele==\"L\" and j>0):\r\n change = True\r\n if(grid[i][j-1]!='#'):\r\n cpy[i][j-1] += \"L\"\r\n elif(ele==\"#\"):\r\n cpy[i][j] = \"#\"\r\n for i in range(r):\r\n for j in range(c):\r\n s = cpy[i][j]\r\n ans += len(s)*(len(s)-1)/2\r\n grid[i][j] = s\r\n print(int(ans))", "for t in range(int(input())):\r\n r,c = list(map(int,input().split()))\r\n grid = []\r\n cpy = []\r\n for i in range(r):\r\n grid.append(list(input()))\r\n change = True\r\n ans = 0\r\n while(change):\r\n cpy = [[\"\" for i in range(c)] for j in range(r)]\r\n change = False\r\n for i in range(r):\r\n for j in range(c):\r\n for ele in grid[i][j]:\r\n if(ele==\"D\" and i<r-1):\r\n change = True\r\n if(grid[i+1][j]!=\"#\"):\r\n cpy[i+1][j] += \"D\"\r\n elif(ele==\"U\" and i>0):\r\n change = True\r\n if(grid[i-1][j]!='#'):\r\n cpy[i-1][j] += \"U\"\r\n elif(ele==\"R\" and j<c-1):\r\n change = True\r\n if(grid[i][j+1]!=\"#\"):\r\n cpy[i][j+1] += \"R\"\r\n elif(ele==\"L\" and j>0):\r\n change = True\r\n if(grid[i][j-1]!='#'):\r\n cpy[i][j-1] += \"L\"\r\n elif(ele==\"#\"):\r\n cpy[i][j] = \"#\"\r\n for i in range(r):\r\n for j in range(c):\r\n s = cpy[i][j]\r\n ans += len(s)*(len(s)-1)/2\r\n grid[i][j] = s\r\n print(int(ans))\r\n \r\n \r\n \r\n \r\n \r\n \r\n", "def sumOfN(n): return n*(n-1)//2\r\n\r\ndef display():\r\n\tfor i in range(r):\r\n\t\tfor j in range(c):\r\n\t\t\tprint(grid[i][j], end =\" \")\r\n\t\tprint()\r\n\t\r\n\tprint()\r\n\r\nfor t in range(int(input())):\r\n\tr,c = map(int,input().split())\r\n\tgrid = []\r\n\tpairs = 0\r\n\tfor i in range(r):\r\n\t\tto_add = []\r\n\t\tfor x in input().strip(): to_add.append([x,1])\r\n\t\tgrid.append(to_add)\t\r\n\r\n\t#display()\r\n\tsteps = max(r,c)\r\n\tfor _ in range(steps):\r\n\t\tfor i in range(r):\r\n\t\t\tfor j in range(c):\r\n\t\t\t\ts = grid[i][j][0][:grid[i][j][1]]\r\n\t\t\t\tif s==\"#\" or s==\"-\":\r\n\t\t\t\t\tcontinue\r\n\t\t\t\t\r\n\t\t\t\tfor ants in s:\r\n\t\t\t\t\tif ants==\"U\":\r\n\t\t\t\t\t\tif i>0:\r\n\t\t\t\t\t\t\tif grid[i-1][j][0]!=\"#\": grid[i-1][j][0] += \"U\"\r\n\t\t\t\t\telif ants==\"D\":\r\n\t\t\t\t\t\tif i<r-1:\r\n\t\t\t\t\t\t\tif grid[i+1][j][0]!=\"#\": grid[i+1][j][0] += \"D\"\r\n\t\t\t\t\telif ants==\"L\":\r\n\t\t\t\t\t\tif j>0:\r\n\t\t\t\t\t\t\tif grid[i][j-1][0]!=\"#\": grid[i][j-1][0] += \"L\"\r\n\t\t\t\t\telif ants==\"R\":\r\n\t\t\t\t\t\tif j<c-1:\r\n\t\t\t\t\t\t\tif grid[i][j+1][0]!=\"#\": grid[i][j+1][0] += \"R\"\r\n\r\n\t\t\t\tgrid[i][j][0] = (\"-\" if len(grid[i][j][0])==grid[i][j][1] else grid[i][j][0][grid[i][j][1]:])\r\n\r\n\t\tfor i in range(r):\r\n\t\t\tfor j in range(c):\r\n\t\t\t\tif grid[i][j][0].lstrip('-')!=\"\":\r\n\t\t\t\t\tgrid[i][j][0] = grid[i][j][0].lstrip('-')\r\n\t\t\t\t\tpairs += sumOfN(len(grid[i][j][0]))\r\n\t\t\t\tgrid[i][j][1] = len(grid[i][j][0])\r\n\t\t\r\n\t\t#display()\r\n\tprint(pairs)", "# cook your dish here\n'''test=int(input())\nfor _ in range(test):\n r,c=map(int,input().split())\n \n pathant=[]\n rc=[]\n for i in range(r):\n ci=list(map(str,input()))\n rc.append(ci)\n for j in range(c):\n if(ci[j]!='#' and ci[j]!='-'):\n pathant.append([ci[j],i,j])\n \n count=0\n parr=[]\n print(pathant)\n for i in range(len(pathant)):\n temp=[]\n if(pathant[i][0]=='L'):\n count=pathant[i][2]\n for j in range(count,-1,-1):\n if(rc[pathant[i][1]][j]=='#'):\n break\n temp.append([pathant[i][1],j])\n parr.append(temp)\n if(pathant[i][0]=='R'):\n count=pathant[i][2]\n for j in range(count,c):\n if(rc[pathant[i][1]][j]=='#'):\n break\n temp.append([pathant[i][1],j])\n parr.append(temp)\n if(pathant[i][0]=='U'):\n count=pathant[i][1]\n for j in range(count,-1,-1):\n if(rc[j][pathant[i][2]]=='#'):\n break\n temp.append([j,pathant[i][2]])\n parr.append(temp)\n if(pathant[i][0]=='D'):\n count=pathant[i][1]\n for j in range(count,r):\n if(rc[j][pathant[i][2]]=='#'):\n break\n temp.append([j,pathant[i][2]])\n parr.append(temp)\n print(parr)\n length=len(parr)\n noe=[0]*len(parr)\n nop=0\n pointer=0\n lim=max(r,c)\n temp=[]\n while pointer < lim:\n temp=[]\n for x in range(length):\n if(pointer<=len(parr[x])):\n temp.append(parr[x][pointer])'''\n \nfrom collections import defaultdict as df\nt=int(input())\nfor x in range(t):\n r,c=list(map(int,input().split()))\n p=df(list)\n a=[[0]*c for i in range(r)]\n for i in range(r):\n s=input().rstrip()\n for j in range(c):\n a[i][j]=s[j]\n for i in range(r):\n for j in range(c):\n timer=0\n if a[i][j]=='U':\n \n for k in range(i-1,-1,-1):\n if a[k][j]!='#':\n timer+=1\n p[str(k)+' '+str(j)].append(timer)\n else:\n break\n if a[i][j]=='R':\n for k in range(j+1,c):\n if a[i][k]!='#':\n timer+=1\n p[str(i)+' '+str(k)].append(timer)\n else:\n break\n if a[i][j]=='D':\n for k in range(i+1,r):\n if a[k][j]!='#':\n timer+=1\n p[str(k)+' '+str(j)].append(timer)\n else:\n break\n if a[i][j]=='L':\n for k in range(j-1,-1,-1):\n if a[i][k]!='#':\n timer+=1\n p[str(i)+' '+str(k)].append(timer)\n else:\n break\n #print(p)\n total=0\n #print(p)\n for i in p:\n y=set(p[i])\n for j in y:\n if p[i].count(j)>1:\n n1=p[i].count(j)\n total+=(n1*(n1-1))//2\n print(total)\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n ", "# cook your dish here\nfrom collections import defaultdict\nfrom math import factorial\nt = int(input())\n\nfor _ in range(t):\n n,m = map(int,input().split())\n l = []\n hash = defaultdict(int)\n for i in range(n):\n k = list(input())\n l.append(k)\n ans = 0\n for i in range(n):\n for j in range(m):\n count = 0\n if l[i][j] == 'R':\n x = i\n y = j\n\n while y<m:\n if l[x][y]!='#':\n hash[(count,x,y)]+=1\n else:\n break\n\n count+=1\n y+=1\n\n elif l[i][j] == 'L':\n x = i\n y = j\n count = 0\n while y>=0:\n if l[x][y]!='#':\n hash[(count,x,y)]+=1\n else:\n break\n\n count+=1\n\n\n y-=1\n elif l[i][j] == 'U':\n x = i\n y = j\n count = 0\n while x>=0:\n if l[x][y]!='#':\n hash[(count,x,y)]+=1\n else:\n break\n\n count+=1\n x-=1\n elif l[i][j] == 'D' :\n x = i\n y = j\n count = 0\n while x<n:\n if l[x][y]!='#':\n hash[(count,x,y)]+=1\n else:\n break\n\n count+=1\n x+=1\n\n\n for i in hash.keys():\n\n z = hash[i]\n if z>1:\n ans += factorial(z)//((factorial(z-2))*factorial(2))\n\n # print(hash.keys())\n print(ans)\n\n\n\n\n", "for _ in range(int(input())):\r\n r,c=map(int,input().split())\r\n d=[]\r\n s=0\r\n for _ in range(r):\r\n a=input()\r\n a=[i for i in a]\r\n d.append(a)\r\n for i in range(r):\r\n for j in range(c):\r\n if d[i][j]=='R':\r\n for k in range(j,c):\r\n if d[i][k]=='#':break\r\n elif d[i][k]=='L' and not((k-j) & 1):s+=1\r\n l=i+1\r\n k=j+1\r\n while k<c and l<r:\r\n f=0\r\n if d[l][k]=='U':\r\n for m in range(j,k+1):\r\n if d[i][m]=='#':\r\n f=1\r\n break\r\n if f==0:\r\n for m in range(i,l+1):\r\n if d[m][k]=='#':\r\n f=1\r\n break\r\n if f==0:s+=1\r\n k+=1\r\n l+=1\r\n elif d[i][j]=='L':\r\n l=i+1\r\n k=j-1\r\n while l<r and k>-1:\r\n if d[l][k]=='U':\r\n f=0\r\n for m in range(j,k-1,-1):\r\n if d[i][m] == '#':\r\n f = 1\r\n break\r\n if f == 0:\r\n for m in range(i,l+1):\r\n if d[m][k] == '#':\r\n f=1\r\n break\r\n if f == 0: s += 1\r\n l+=1\r\n k-=1\r\n elif d[i][j]=='D':\r\n for m in range(i,r):\r\n if d[m][j]=='#':break\r\n elif d[m][j]=='U' and not((m-i) & 1):s+=1\r\n l=i+1\r\n k=j+1\r\n while l<r and k<c:\r\n f=0\r\n if d[l][k]=='L':\r\n for m in range(i,l+1):\r\n if d[m][j] == '#':\r\n f = 1\r\n break\r\n if f == 0:\r\n for m in range(j,k+1):\r\n if d[l][m] == '#':\r\n f = 1\r\n break\r\n if f == 0: s += 1\r\n l += 1\r\n k += 1\r\n l=i+1\r\n k=j-1\r\n while l<r and k>-1:\r\n f=0\r\n if d[l][k]=='R':\r\n for m in range(i,l+1):\r\n if d[m][j]=='#':\r\n f=1\r\n break\r\n if f==0:\r\n for m in range(k,j+1):\r\n if d[l][m]=='#':\r\n f=1\r\n break\r\n if f==0:s+=1\r\n l+=1\r\n k-=1\r\n print(s)", "t=int(input())\r\nfor i in range(t):\r\n r,c=map(int,input().split())\r\n arr=[[\"\"for x in range(c)]for y in range(r)]\r\n for j in range(r):\r\n arr[j]=list(str(input()))\r\n # for j in range(r):\r\n # print(arr[j])\r\n # anrnum=0\r\n anr=['U','D','L','R']\r\n # for j in range(r):\r\n # for k in range(c):\r\n # if(arr[j][k]in anr):\r\n # anrnum+=1\r\n meet=0\r\n pos=[[[0 for z in range(c)] for y in range(r)] for x in range(max(r,c))]\r\n j=0\r\n k=0\r\n while j <r:\r\n j_init = j\r\n # if(j==r):\r\n # print(\"Fault:\"+str(j))\r\n k=0\r\n while k <c:\r\n k_init = k\r\n # if(j==r or k==c):\r\n # print(\"Fault:\"+str(j)+\" \"+str(k))\r\n # print(str(j) + \" \" + str(k))\r\n if(arr[j][k] in anr):\r\n\r\n for z in range(max(r, c)):\r\n if(j==r or k==c or arr[j][k]==\"#\" or k==-1 or j==-1):\r\n break\r\n if(pos[z][j][k]>0):\r\n meet+=pos[z][j][k]\r\n # else:\r\n # print(str(z) + \" \" + str(j) + \" \" + str(k))\r\n pos[z][j][k]+=1\r\n if(arr[j_init][k_init]=='D'):\r\n j+=1\r\n elif(arr[j_init][k_init]=='U'):\r\n j-=1\r\n elif (arr[j_init][k_init] == 'L'):\r\n k -= 1\r\n elif (arr[j_init][k_init] == 'R'):\r\n k += 1\r\n k=k_init+1\r\n j = j_init\r\n j=j_init+1\r\n print(meet)\r\n # for iter in range(max(r,c)):\r\n # print(pos[iter])\r\n\r\n\r\n\r\n", "for _ in range(int(input())):\r\n\tr, c = map(int, input().split())\r\n\tm = [[*input()] for _ in range(r)]\r\n\r\n\tans = 0\r\n\tp = []\r\n\r\n\tfor i in range(r):\r\n\t\tfor j in range(c):\r\n\t\t\tif m[i][j] in 'UDLR':\r\n\t\t\t\tp.append([i, j, m[i][j]])\r\n\r\n\tfrom collections import Counter\r\n\r\n\tfor i in range(max(r, c) + 1):\r\n\t\tz = Counter([tuple(i[:2]) for i in p])\r\n\t\tfor j in z.values():\r\n\t\t\tans += (j * (j - 1)) // 2\r\n\r\n\t\td = set()\r\n\r\n\t\tfor j in range(len(p)):\r\n\t\t\tif p[j][2] == 'U':\r\n\t\t\t\tif p[j][0] > 0 and m[p[j][0] - 1][p[j][1]] != '#':\r\n\t\t\t\t\tp[j][0] -= 1\r\n\t\t\t\telse:\r\n\t\t\t\t\td.add(j)\r\n\t\t\telif p[j][2] == 'R':\r\n\t\t\t\tif p[j][1] < c - 1 and m[p[j][0]][p[j][1] + 1] != '#':\r\n\t\t\t\t\tp[j][1] += 1\r\n\t\t\t\telse:\r\n\t\t\t\t\td.add(j)\r\n\t\t\telif p[j][2] == 'L':\r\n\t\t\t\tif p[j][1] > 0 and m[p[j][0]][p[j][1] - 1] != '#':\r\n\t\t\t\t\tp[j][1] -= 1\r\n\t\t\t\telse:\r\n\t\t\t\t\td.add(j)\r\n\t\t\telse:\r\n\t\t\t\tif p[j][0] < r - 1 and m[p[j][0] + 1][p[j][1]] != '#':\r\n\t\t\t\t\tp[j][0] += 1\r\n\t\t\t\telse:\r\n\t\t\t\t\td.add(j)\r\n\r\n\t\tp = [p[i] for i in set([*range(len(p))]) - d]\r\n\r\n\tprint(ans)", "# your code goes here\n# cook your dish here\nfrom collections import Counter\nt=int(input())\nfor x in range(t):\n inp = list(map(int,input().split()))\n r=inp[0]\n c=inp[1]\n listo=[]\n listb=set()\n pair=0\n for i in range(r):\n \n string=input()\n for j in range(len(string)):\n if(string[j]=='U'):\n listo.append([i,j,1])\n elif(string[j]=='D'):\n listo.append([i,j,2])\n elif(string[j]=='L'):\n listo.append([i,j,3])\n elif(string[j]=='R'):\n listo.append([i,j,4])\n elif(string[j]=='#'):\n listb.add((i,j))\n \n \n for y in range(max(r,c)):\n nants=Counter()\n for i in range(len(listo)):\n if(listo[i][2]!=5):\n nants[tuple(listo[i][:-1])]+=1\n for key in nants:\n pair+=(nants[key]*(nants[key]-1))//2\n \n for ant in listo:\n if(ant[2]==1):\n ant[0]-=1\n elif(ant[2]==2):\n ant[0]+=1\n elif(ant[2]==3):\n ant[1]-=1\n elif(ant[2]==4):\n ant[1]+=1\n if(tuple(ant[:-1])) in listb:\n ant[2]=5\n elif(ant[0]<0) or ant[0]>=r:\n ant[2]=5\n elif ant[1]<0 or ant[1]>=c:\n ant[2]=5\n print(pair)\n \n \n \n \n \n \n \n \n", "T = int(input())\r\n\r\nwhile T > 0:\r\n R, C = input().split()\r\n R = int(R)\r\n C = int(C)\r\n output = [ [0] * C for i in range(R) ]\r\n for i in range(R):\r\n for j in range(C):\r\n output[i][j] = dict()\r\n matrix = [0] * R\r\n for i in range(R):\r\n matrix[i] = input()\r\n for i in range(R):\r\n for j in range(C):\r\n if matrix[i][j] == 'R':\r\n column = j + 1\r\n while column < C and matrix[i][column] != '#':\r\n output[i][column][column-j] = output[i][column].get(column-j,0) + 1\r\n column = column + 1\r\n elif matrix[i][j] == 'L':\r\n column = j - 1\r\n while column >= 0 and matrix[i][column] != '#':\r\n output[i][column][j-column] = output[i][column].get(j-column,0) + 1\r\n column = column - 1\r\n elif matrix[i][j] == 'U':\r\n row = i - 1\r\n while row >= 0 and matrix[row][j] != '#':\r\n output[row][j][i-row] = output[row][j].get(i-row,0) + 1\r\n row = row - 1\r\n elif matrix[i][j] == 'D':\r\n row = i + 1\r\n while row < R and matrix[row][j] != '#':\r\n output[row][j][row-i] = output[row][j].get(row-i,0) + 1\r\n row = row + 1\r\n no_of_pairs = 0\r\n for i in range(R):\r\n for j in range(C):\r\n for no_of_steps, count in output[i][j].items():\r\n if count > 1:\r\n no_of_pairs = no_of_pairs + (count*(count-1)) // 2\r\n print(no_of_pairs)\r\n T = T - 1", " \nimport math as mt \ndef countPairs(arr, n): \n\n\tmp = dict() \n\tfor i in range(n): \n\t\tif arr[i] in mp.keys(): \n\t\t\tmp[arr[i]] += 1\n\t\telse: \n\t\t\tmp[arr[i]] = 1\n\tans = 0\n\tfor it in mp: \n\t\tcount = mp[it] \n\t\tans += (count * (count - 1)) // 2\n\treturn ans \n\n# cook your dish here\nfor _ in range(int(input())):\n (r,c)= map(int,input().split())\n has = []\n simple = []\n for i in range(r):\n lis = input()\n lis = list(lis)\n for j in range(c):\n if(lis[j]=='#'):\n has.append([i,j])\n elif(lis[j]!='-'):\n simple.append([lis[j],[i,j]])\n sum1=0\n for j in range(max(r,c)):\n he ,del1= [],[]\n flag = 0\n for i in simple:\n if(i[0]=='R' and i[1][1]+j+1<=c):\n if(has.count([i[1][0],i[1][1]+j+1])==0):\n he.append((i[1][0],i[1][1]+j+1))\n else:\n del1.append(i)\n elif(i[0]=='D' and i[1][0]+j+1<=r):\n if(has.count([i[1][0]+j+1,i[1][1]])==0):\n he.append((i[1][0]+j+1,i[1][1]))\n else:\n del1.append(i)\n \n elif(i[0]=='L' and i[1][1]-j-1>=0):\n if(has.count([i[1][0],i[1][1]-j-1])==0):\n he.append((i[1][0],i[1][1]-j-1))\n else:\n del1.append(i)\n \n elif(i[0]=='U' and (i[1][0]-j-1)>=0):\n if(has.count([i[1][0]-j-1,i[1][1]])==0):\n he.append((i[1][0]-j-1,i[1][1]))\n else:\n del1.append(i)\n sum1+=countPairs(he,len(he))\n for p in del1:\n simple.remove(p)\n print(sum1)", "import math\n\ndef nCr(n):\n f = math.factorial\n return f(n) // f(2) // f(n-2)\n# Python3 program to count of index pairs \n# with equal elements in an array. \nimport math as mt \n\n# Return the number of pairs with \n# equal values. \ndef countPairs(arr, n): \n\n\tmp = dict() \n\n\t# Finding frequency of each number. \n\tfor i in range(n): \n\t\tif arr[i] in mp.keys(): \n\t\t\tmp[arr[i]] += 1\n\t\telse: \n\t\t\tmp[arr[i]] = 1\n\t\t\t\n\t# Calculating pairs of each value. \n\tans = 0\n\tfor it in mp: \n\t\tcount = mp[it] \n\t\tans += (count * (count - 1)) // 2\n\treturn ans \n\n# cook your dish here\nfor _ in range(int(input())):\n (r,c)= map(int,input().split())\n has = []\n simple = []\n for i in range(r):\n lis = input()\n lis = list(lis)\n for j in range(c):\n if(lis[j]=='#'):\n has.append([i,j])\n elif(lis[j]!='-'):\n simple.append([lis[j],[i,j]])\n sum1=0\n for j in range(max(r,c)):\n he ,del1= [],[]\n flag = 0\n for i in simple:\n if(i[0]=='R' and i[1][1]+j+1<=c):\n if(has.count([i[1][0],i[1][1]+j+1])==0):\n he.append((i[1][0],i[1][1]+j+1))\n else:\n del1.append(i)\n elif(i[0]=='D' and i[1][0]+j+1<=r):\n if(has.count([i[1][0]+j+1,i[1][1]])==0):\n he.append((i[1][0]+j+1,i[1][1]))\n else:\n del1.append(i)\n \n elif(i[0]=='L' and i[1][1]-j-1>=0):\n if(has.count([i[1][0],i[1][1]-j-1])==0):\n he.append((i[1][0],i[1][1]-j-1))\n else:\n del1.append(i)\n \n elif(i[0]=='U' and (i[1][0]-j-1)>=0):\n if(has.count([i[1][0]-j-1,i[1][1]])==0):\n he.append((i[1][0]-j-1,i[1][1]))\n else:\n del1.append(i)\n sum1+=countPairs(he,len(he))\n for p in del1:\n simple.remove(p)\n print(sum1)", "def check_left_hor(mat, row, col, r,c, z, diff):\n\tif 0<=(z+diff)<c and mat[row][z+diff]==\"L\":\n\n\t\tfor q in range(z+1, z+diff):\n\t\t\tif mat[row][q] == \"#\":\n\t\t\t\treturn False\n\n\t\treturn True\n\n\treturn False\n\n\ndef check_left_ver(mat, row, col, r,c, z, diff):\n\tif 0<=(col+diff)<c and mat[z][col+diff]==\"L\":\n\n\t\tfor q in range(col+1, col+diff):\n\t\t\tif mat[z][q] == \"#\":\n\t\t\t\treturn False\n\n\t\treturn True\n\n\treturn False\n\n\ndef check_right_hor(mat, row, col, r,c, z, diff):\n\tif 0<=(z-diff)<c and mat[row][z-diff] == \"R\":\n\n\t\tfor q in range(z-1, z-diff, -1):\n\t\t\tif mat[row][q] == \"#\":\n\t\t\t\treturn False\n\n\t\treturn True\n\n\treturn False\n\n\ndef check_right_ver(mat, row, col, r,c, z, diff):\n\tif 0<=(col-diff)<c and mat[z][col-diff] == \"R\":\n\n\t\tfor q in range(col-1, col-diff, -1):\n\t\t\tif mat[z][q] == \"#\":\n\t\t\t\treturn False\n\n\t\treturn True\n\n\treturn False\n\n\ndef check_down_hor(mat, row, col, r,c, z, diff):\n\tif 0<=(row-diff)<r and mat[row-diff][z] == \"D\":\n\t\t\n\t\tfor q in range(row-diff, row):\n\t\t\tif mat[q][z] == \"#\":\n\t\t\t\treturn False\n\n\t\treturn True\n\n\treturn False\n\n\ndef check_down_ver(mat, row, col, r,c, z, diff):\n\tif 0<=(z-diff)<r and mat[z-diff][col] == \"D\":\n\t\t\n\t\tfor q in range(z-diff, z):\n\t\t\tif mat[q][col] == \"#\":\n\t\t\t\treturn False\n\n\t\treturn True\n\n\treturn False\n\n\ndef check_up_hor(mat, row, col, r,c, z, diff):\n\t# print(z, row, diff)\n\tif 0<=(row+diff)<r and mat[row+diff][z] == \"U\":\n\t\tfor q in range(row+1, row+diff):\n\t\t\tif mat[q][z] == \"#\":\n\t\t\t\treturn False\n\n\t\treturn True\n\n\treturn False\n\ndef check_up_ver(mat, row, col, r,c, z, diff):\n\n\tif 0<=(z+diff)<r and mat[z+diff][col] == \"U\":\n\t\tfor q in range(z+1, z+diff):\n\t\t\tif mat[q][col] == \"#\":\n\t\t\t\treturn False\n\n\t\treturn True\n\n\treturn False\n\n\nt = int(input())\n\nfor i in range(t):\n\tr, c = map(int, input().split())\n\n\tmat = []\n\tcount = 0\n\n\tfor j in range(r):\n\t\ttemp = []\n\t\ts = input()\n\n\t\tfor a in range(c):\n\t\t\ttemp.append(s[a])\n\t\t\tif s[a]!=\"-\" and s[a]!=\"#\":\n\t\t\t\t# print(s[a]==\"-\")\n\t\t\t\tcount+=1\n\n\t\tmat.append(temp)\n\n\t# print(count, mat)\n\tmeets = 0\n\n\tfor row in range(r):\n\n\t\tfor col in range(c):\n\n\t\t\tif mat[row][col]==\"-\" or mat[row][col]==\"#\":\n\t\t\t\tcontinue\n\n\t\t\telse:\n\n\t\t\t\tif mat[row][col] == \"U\":\n\n\t\t\t\t\tfor z in range(row-1, -1, -1):\n\t\t\t\t\t\tif mat[z][col] == \"#\":\n\t\t\t\t\t\t\tbreak\n\n\t\t\t\t\t\telse:\n\t\t\t\t\t\t\tdiff = row-z\n\t\t\t\t\t\t\tif check_left_ver(mat, row, col, r, c, z, diff):\n\t\t\t\t\t\t\t\tmeets+=1\n\n\t\t\t\t\t\t\tif check_right_ver(mat, row, col, r, c, z, diff):\n\t\t\t\t\t\t\t\tmeets+=1\n\n\t\t\t\t\t\t\tif check_down_ver(mat, row, col, r, c, z, diff):\n\t\t\t\t\t\t\t\tmeets+=1\n\n\n\t\t\t\tif mat[row][col] == \"D\":\n\n\t\t\t\t\tfor z in range(row+1, r):\n\t\t\t\t\t\tif mat[z][col] == \"#\":\n\t\t\t\t\t\t\tbreak\n\n\t\t\t\t\t\telse:\n\t\t\t\t\t\t\t# print(col-row+z, col, row, z)\n\t\t\t\t\t\t\tdiff = z-row\n\t\t\t\t\t\t\tif check_left_ver(mat, row, col, r, c, z, diff):\n\t\t\t\t\t\t\t\tmeets+=1\n\n\t\t\t\t\t\t\tif check_right_ver(mat, row, col, r, c, z, diff):\n\t\t\t\t\t\t\t\tmeets+=1\n\n\t\t\t\t\t\t\tif check_up_ver(mat, row, col, r, c, z, diff):\n\t\t\t\t\t\t\t\tmeets+=1\n\n\t\t\t\tif mat[row][col] == \"L\":\n\n\t\t\t\t\tfor z in range(col-1, -1, -1):\n\t\t\t\t\t\tif mat[row][z] == \"#\":\n\t\t\t\t\t\t\tbreak\n\n\t\t\t\t\t\telse:\n\t\t\t\t\t\t\tdiff = col-z\n\t\t\t\t\t\t\t# print(col-row+z, col, row, z)\n\t\t\t\t\t\t\tif check_down_hor(mat, row, col, r, c, z, diff):\n\t\t\t\t\t\t\t\tmeets+=1\n\n\t\t\t\t\t\t\tif check_right_hor(mat, row, col, r, c, z, diff):\n\t\t\t\t\t\t\t\tmeets+=1\n\n\t\t\t\t\t\t\tif check_up_hor(mat, row, col, r, c, z, diff):\n\t\t\t\t\t\t\t\tmeets+=1\n\n\t\t\t\tif mat[row][col] == \"R\":\n\n\t\t\t\t\tfor z in range(col+1, c):\n\t\t\t\t\t\tif mat[row][z] == \"#\":\n\t\t\t\t\t\t\tbreak\n\n\t\t\t\t\t\telse:\n\t\t\t\t\t\t\t# print(col-row+z, col, row, z)\n\t\t\t\t\t\t\tdiff = z-col\n\t\t\t\t\t\t\tif check_down_hor(mat, row, col, r, c, z, diff):\n\t\t\t\t\t\t\t\tmeets+=1\n\n\t\t\t\t\t\t\tif check_left_hor(mat, row, col, r, c, z, diff):\n\t\t\t\t\t\t\t\tmeets+=1\n\n\n\t\t\t\t\t\t\tif check_up_hor(mat, row, col, r, c, z, diff):\n\t\t\t\t\t\t\t\tmeets+=1\n\n\n\tprint(meets//2)", "for _ in range(int(input())):\r\n r, c = map(int, input().split())\r\n board = []\r\n for i in range(r):\r\n x = input()\r\n board.append(x)\r\n\r\n coll = []\r\n for i in range(r):\r\n coll.append([])\r\n for j in range(c):\r\n coll[i].append([])\r\n\r\n for i in range(r):\r\n for j in range(c):\r\n if board[i][j]=='-' or board[i][j]=='#':\r\n pass\r\n else:\r\n cnt = 1\r\n if board[i][j]=='D':\r\n for k in range(i+1,r):\r\n if board[k][j]=='#':\r\n break\r\n coll[k][j].append(cnt)\r\n cnt+=1\r\n\r\n if board[i][j]=='U':\r\n for k in range(i-1,-1,-1):\r\n if board[k][j]=='#':\r\n break\r\n coll[k][j].append(cnt)\r\n cnt+=1\r\n \r\n if board[i][j]=='R':\r\n for k in range(j+1,c):\r\n if board[i][k]=='#':\r\n break\r\n coll[i][k].append(cnt)\r\n cnt+=1\r\n \r\n if board[i][j]=='L':\r\n for k in range(j-1,-1,-1):\r\n if board[i][k]=='#':\r\n break\r\n coll[i][k].append(cnt)\r\n cnt+=1\r\n cnts = 0\r\n for i in range(r):\r\n for j in range(c):\r\n if len(coll[i][j])>1:\r\n sets = set(coll[i][j])\r\n counts = {}\r\n for k in sets:\r\n counts[k]=0\r\n for k in coll[i][j]:\r\n counts[k]+=1\r\n for k in counts.values():\r\n if k>1:\r\n cnts+=int(k*(k-1)//2)\r\n #print(counts)\r\n print(cnts)\r\n", "# Contest Code: PRACTICE Problem Code: ANTEATER\n#\n# Author: Keyur Shroff\n# Date: 24 June 2019\n\nimport math\nfrom collections import defaultdict\n\n# --- Function to calculate nCr\ndef nCr(n,r):\n f = math.factorial\n return (f(n) // f(r)) // f(n-r)\n\n# --- Main Program ---\ndef main() :\n t = int(input())\n for _ in range(t) :\n r, c = map(int, input().split())\n matrix = []\n for i in range(r) :\n data = list(input())\n matrix.append(data)\n \n timeHorizon = defaultdict(int)\n for i in range(r) :\n for j in range(c) :\n if (matrix[i][j] == \"U\") :\n step = 1\n for k in range(i-1, -1, -1) :\n if (matrix[k][j] == \"#\") :\n break\n timeHorizon[(step,k,j)] += 1\n step += 1\n elif (matrix[i][j] == \"D\") :\n step = 1\n for k in range(i+1, r, 1) :\n if (matrix[k][j] == \"#\") :\n break\n timeHorizon[(step,k,j)] += 1\n step += 1\n elif (matrix[i][j] == \"L\") :\n step = 1\n for k in range(j-1, -1, -1) :\n if (matrix[i][k] == \"#\") :\n break\n timeHorizon[(step,i,k)] += 1\n step += 1\n elif (matrix[i][j] == \"R\") :\n step = 1\n for k in range(j+1, c, 1) :\n if (matrix[i][k] == \"#\") :\n break\n timeHorizon[(step,i,k)] += 1\n step += 1\n \n # Count total number of pairs of ants that meet each other\n count = 0\n for key in timeHorizon :\n if (timeHorizon[key] > 1) :\n ants = timeHorizon[key]\n count += nCr(ants, 2)\n \n print(count)\n\n\ndef __starting_point():\n #import profile\n #profile.run('main()')\n main()\n \n__starting_point()", "t = int(input())\r\nfor _ in range(t):\r\n r, c = map(int, input().split())\r\n a = [list(input()) for _ in range(r)]\r\n ans = 0\r\n for i, row in enumerate(a):\r\n for j, x in enumerate(row):\r\n if x == 'R':\r\n for k, y in enumerate(row[j + 1:]):\r\n if y == '#':\r\n break\r\n if k % 2 and y == 'L':\r\n ans += 1\r\n elif x in 'UD':\r\n b = a[i + 1:] if x == 'D' else reversed(a[:i])\r\n for k, row1 in enumerate(b, 1):\r\n if row1[j] == '#':\r\n break\r\n if k % 2 == 0 and row1[j] == 'UD'[x == 'U']:\r\n ans += 1\r\n m = j - k\r\n if m >= 0 and row1[m] == 'R' and '#' not in row1[m + 1: j]:\r\n ans += 1\r\n m = j + k\r\n if m < c and row1[m] == 'L' and '#' not in row1[j + 1: m]:\r\n ans += 1\r\n a[i][j] = None\r\n print(ans)\r\n"] | {"inputs": [["10", "3 3", "R--", "---", "--U", "1 4", "R--R", "2 2", "--", "--", "1 4", "R--L", "1 4", "-R-L", "1 4", "-R#L", "3 3", "R-D", "-#-", "R-U", "3 3", "R-D", "---", "R#U", "3 3", "-D-", "R-L", "-U-", "1 7", "RLLLLLL", ""]], "outputs": [["1", "0", "0", "0", "1", "0", "3", "2", "6", "3"]]} | INTERVIEW | PYTHON3 | CODECHEF | 62,412 | |
d96a9f635f3230d00c0996abd18704a5 | UNKNOWN | Appy and Chef are participating in a contest. There are $N$ problems in this contest; each problem has a unique problem code between $1$ and $N$ inclusive. Appy and Chef decided to split the problems to solve between them ― Appy should solve the problems whose problem codes are divisible by $A$ but not divisible by $B$, and Chef should solve the problems whose problem codes are divisible by $B$ but not divisible by $A$ (they decided to not solve the problems whose codes are divisible by both $A$ and $B$).
To win, it is necessary to solve at least $K$ problems. You have to tell Appy whether they are going to win or lose.
-----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$, $A$, $B$ and $K$.
-----Output-----
For each test case, print a single line containing the string "Win" if they can solve at least $K$ problems or "Lose" otherwise (without quotes).
-----Constraints-----
- $1 \le T \le 15$
- $1 \le K \le N \le 10^{18}$
- $1 \le A, B \le 10^9$
-----Subtasks-----
Subtask #1 (15 points):
- $1 \le T \le 15$
- $1 \le K \le N \le 10^6$
- $1 \le A, B \le 10^3$
Subtask #2 (85 points): original constraints
-----Example Input-----
1
6 2 3 3
-----Example Output-----
Win
-----Explanation-----
Example case 1: Appy is solving the problems with codes $2$ and $4$, Chef is solving the problem with code $3$. Nobody is solving problem $6$, since $6$ is divisible by both $2$ and $3$. Therefore, they can solve $3$ problems and win. | ["for t in range(int(input())):\n n, a , b , k = map(int,input().split())\n solvedbychef = 0\n solvedbyappy = 0\n for i in range(n+1):\n if i % a == 0 and i % b == 0 :\n continue\n elif i%a == 0 :\n solvedbyappy+=1\n elif i%b == 0:\n solvedbychef+=1\n totalsolved = solvedbychef + solvedbyappy\n if totalsolved>=k:\n print(\"Win\")\n else :\n print(\"Lose\")", "import math\nfor i in range(int(input())):\n z,a,b,k=list(map(int,input().split())) \n n=0\n x1=z//a \n x2=z//b \n x3=(a*b)//math.gcd(a,b) \n p1=x1-z//x3 \n p2=x2-z//x3 \n if p1+p2>=k:\n print('Win') \n else:\n print('Lose') \n \n", "for i in range(int(input())):\n z,a,b,k=list(map(int,input().split())) \n n=0\n for j in range(1,z+1):\n if j%a==0 and j%b==0:\n pass \n elif j%a==0:\n n+=1 \n elif j%b==0:\n n+=1 \n if n>=k:\n print('Win') \n else:\n print('Lose') \n \n", "for i in range(int(input())):\n z,a,b,k=list(map(int,input().split())) \n n=0\n for j in range(1,z+1):\n if j%a==0 and j%b==0:\n pass \n elif j%a==0:\n n+=1 \n elif j%b==0:\n n+=1 \n if n>=k:\n print('Win') \n else:\n print('Lose') \n \n", "# cook your dish here\nimport math\nt=int(input())\nwhile t>0:\n n,a,b,k=list(map(int,input().split()))\n l=(a*b)//math.gcd(a,b)\n c=n//b+n//a-2*(n//l)\n if c>=k:\n print(\"Win\")\n else:\n print(\"Lose\")\n t=t-1\n", "# cook your dish here\nt=int(input())\nwhile t>0:\n n,a,b,k=list(map(int,input().split()))\n c=0\n for i in range(n):\n if i%a==0 and i%b!=0:\n c=c+1\n if i%b==0 and i%a!=0:\n c=c+1\n if c>=k:\n print(\"Win\")\n else:\n print(\"Lose\")\n t=t-1\n", "import math\nfor i in range(int(input())):\n n,a,b,k=list(map(int,input().split()))\n lcm=(a*b)/math.gcd(a,b)\n #print(lcm)\n z=(n//a) + (n//b)-2*(n//lcm)\n #print(z)\n if z>=k:\n print(\"Win\")\n else:\n print(\"Lose\")\n", "# cook your dish here\nfor i in range(int(input())):\n n,a,b,k=list(map(int,input().split()))\n s=0\n j=2\n while s<k and j<n+1:\n if j%a==0 and j%b!=0:\n s+=1\n elif j%b==0 and j%a!=0:\n s+=1\n j+=1\n if s==k:\n print(\"Win\")\n else:\n print(\"Lose\")\n\n", "def gcd(a, b):\n if b == 0:\n return a\n return gcd(b, a%b)\n\nfor _ in range(int(input())):\n N, A, B, K = map(int, input().split())\n\n lcm = (A * B) // gcd(A, B)\n appy = (N // A) - (N // lcm)\n chef = (N // B) - (N // lcm)\n\n print(\"Win\") if appy + chef >= K else print(\"Lose\")", "for _ in range(int(input())):\n N, A, B, K = map(int, input().split())\n cnt = 0\n\n for i in range(1, N+1):\n a, b = i % A, i % B\n if a == 0 and b != 0:\n cnt += 1\n elif a != 0 and b == 0:\n cnt += 1\n\n if cnt >= K:\n print(\"Win\")\n break\n else:\n print(\"Lose\")", "from math import gcd as g\nt=int(input())\nwhile t!=0:\n n,a,b,k=map(int,input().split())\n lcm=(a*b)//g(a,b)\n div_a=(n//a)-(n//lcm)\n div_b=(n//b)-(n//lcm)\n net=div_a+div_b\n if net>=k:\n print('Win')\n else:\n print('Lose')\n t-=1", "from math import gcd as g\nt=int(input())\nwhile t!=0:\n n,a,b,k=list(map(int,input().split()))\n lcm=(a*b)//g(a,b)\n div_a=(n//a)-(n//lcm)\n div_b=(n//b)-(n//lcm)\n net=div_a+div_b\n if net>=k:\n print('Win')\n else:\n print('Lose')\n t-=1\n", "from math import gcd as g\n\nt = int(input())\nwhile t != 0:\n n, a, b, k = map(int, input().split())\n lcm = (a * b) // g(a, b)\n\n div_a = (n // a) - (n // lcm)\n div_b = (n // b) - (n // lcm)\n\n net = div_a + div_b\n\n if net >= k:\n print('Win')\n else:\n print('Lose')\n t -= 1", "n=int(input())\nfor i in range(n):\n l=list(map(int,input().split()))\n l1=list(_ for _ in range(1,l[0]+1))\n count=0\n for j in l1:\n if j%l[1]==0 and j%l[2]!=0:\n count+=1\n elif j%l[1]!=0 and j%l[2]==0:\n count+=1\n if count>=l[3]:\n break\n if count>=l[3]:\n print(\"Win\")\n else:\n print(\"Lose\")", "n=int(input())\nfor i in range(n):\n l=list(map(int,input().split()))\n l1=list(_ for _ in range(1,l[0]+1))\n count=0\n for j in l1:\n if j%l[1]==0 and j%l[2]!=0:\n count+=1\n elif j%l[1]!=0 and j%l[2]==0:\n count+=1\n \n if count>=l[3]:\n print(\"Win\")\n else:\n print(\"Lose\")", "t=int(input())\nfor i in range(t):\n n,a,b,k=list(map(int,input().split()))\n l=[]\n p1=[]\n p2=[]\n for i in range(1,n+1):\n if(i%a==0 and i%b!=0):\n p1.append(i)\n if(i%b==0 and i%a!=0):\n p2.append(i)\n if((len(p1)+len(p2))>=k):\n print(\"Win\")\n else:\n print(\"Lose\")\n \n \n \n", "from math import gcd as g\n\nt = int(input())\nwhile t != 0:\n n, a, b, k = map(int, input().split())\n lcm = (a * b) // g(a, b)\n\n div_a = (n // a) - (n // lcm)\n div_b = (n // b) - (n // lcm)\n\n net = div_a + div_b\n\n if net >= k:\n print('Win')\n else:\n print('Lose')\n t -= 1", "import math\nT=int(input())\nfor i in range(T):\n n, a, b, k = list(map(int, input().split()))\n lcm = (a * b) // math.gcd(a, b)\n\n div_a = (n // a) - (n // lcm)\n div_b = (n // b) - (n // lcm)\n\n net = div_a + div_b\n\n if net >= k:\n print('Win')\n else:\n print('Lose')\n", "import math\nT=int(input())\nfor i in range(T):\n N,A,B,K=list(map(int,input().split()))\n c=0\n lcm=(A*B)//math.gcd(A,B)\n for j in range(1,N+1):\n if j%A==0 and j%lcm!=0:\n c+=1\n elif j%B==0 and j%lcm!=0:\n c+=1\n if c>=K:\n print(\"Win\")\n else:\n print(\"Lose\")\n", "T=int(input())\nfor i in range(T):\n N,A,B,K=list(map(int,input().split()))\n c=0\n for j in range(1,N+1):\n if j%A==0 and j%B!=0:\n c+=1\n elif j%A!=0 and j%B==0:\n c+=1\n if c>=K:\n print(\"Win\")\n else:\n print(\"Lose\")\n \n", "# cook your dish here\nimport math\ndef gcd(a,b):\n if a == 0:\n return b\n return gcd(b%a,a)\ndef lcm(a,b):\n return (a*b)//gcd(a,b)\n \nt = int(input())\nwhile(t>0):\n n,a,b,k = map(int,input().split())\n prob = 0\n \n rem1 = n // a\n rem2 = n // b\n if a>=b:\n rem3 = n // lcm(b,a)\n else:\n rem3 = n // lcm(a,b)\n res = (rem1 - rem3) + (rem2 - rem3)\n if(res < k):\n print(\"Lose\")\n else:\n print(\"Win\")\n t -= 1", "# cook your dish here\nt = int(input())\nwhile(t>0):\n n,a,b,k = map(int,input().split())\n prob = 0\n if(a == 1 and b == 1):\n print(\"Lose\")\n elif(a == 1):\n rem = n // b\n prob = n - rem\n if(prob < k):\n print(\"Lose\")\n else:\n print(\"Win\")\n elif(b == 1):\n rem = n // a\n prob = n - rem\n if(prob < k):\n print(\"Lose\")\n else:\n print(\"Win\")\n else:\n for i in range(1,n+1):\n if(i%a ==0 and i%b == 0):\n continue\n elif(i%a == 0 and i%b != 0):\n prob += 1\n if(prob>=k):\n print(\"Win\")\n break\n elif(i%b == 0 and i%a != 0):\n prob += 1\n if(prob>=k):\n print(\"Win\")\n break\n if(prob < k):\n print(\"Lose\")\n t -= 1", "# cook your dish here\nt = int(input())\nwhile(t>0):\n n,a,b,k = map(int,input().split())\n prob = 0\n if(a == 1 and b == 1):\n print(\"Lose\")\n # elif(a == 1):\n # for i in range(1,n+1):\n # if(i%a ==0 and i%b == 0):\n # continue\n # elif(i%a == 0 and i%b != 0):\n # prob += 1\n # if(prob>=k):\n # print(\"Win\")\n # break\n # elif(b == 1):\n # for i in range(1,n+1):\n # if(i%a ==0 and i%b == 0):\n # continue\n # elif(i%b == 0 and i%a != 0):\n # prob += 1\n # if(prob>=k):\n # print(\"Win\")\n # break\n else:\n for i in range(1,n+1):\n if(i%a ==0 and i%b == 0):\n continue\n elif(i%a == 0 and i%b != 0):\n prob += 1\n if(prob>=k):\n print(\"Win\")\n break\n elif(i%b == 0 and i%a != 0):\n prob += 1\n if(prob>=k):\n print(\"Win\")\n break\n if(prob < k):\n print(\"Lose\")\n t -= 1", "# cook your dish here\nt = int(input())\nwhile(t>0):\n n,a,b,k = map(int,input().split())\n prob = 0\n if(a == 1 and b == 1):\n print(\"Lose\")\n else:\n for i in range(1,n+1):\n if(i%a ==0 and i%b == 0):\n continue\n elif(i%a == 0 and i%b != 0):\n prob += 1\n elif(i%b == 0 and i%a != 0):\n prob += 1\n if(prob >= k):\n print(\"Win\")\n else:\n print(\"Lose\")\n t -= 1", "# cook your dish here\nt = int(input())\nwhile(t>0):\n n,a,b,k = map(int,input().split())\n prob = 0\n for i in range(1,n+1):\n if(i%a and i%b):\n continue\n elif(i%a or i%b):\n prob += 1\n if(prob >= k):\n print(\"Win\")\n else:\n print(\"Lose\")\n t -= 1"] | {"inputs": [["1", "6 2 3 3"]], "outputs": [["Win"]]} | INTERVIEW | PYTHON3 | CODECHEF | 8,309 | |
d7b872be45cadd1d5462d15d03c0d72e | UNKNOWN | The following graph G is called a Petersen graph and its vertices have been numbered from 0 to 9. Some letters have also been assigned to vertices of G, as can be seen from the following picture:
Let's consider a walk W in graph G, which consists of L vertices W1, W2, ..., WL, such that Wi is connected with Wi + 1 for 1 ≤ i < L. A string S of L letters 'A'-'E' is realized by walk W if the sequence of letters written along W is equal to S. Vertices can be visited multiple times while walking along W.
For example, S = 'ABBECCD' is realized by W = (0, 1, 6, 9, 7, 2, 3).
Your task is to determine whether there is a walk W which realizes a given string S in graph G, and if so, find the lexicographically least such walk.
-----Input-----
The first line of the input contains one integer T denoting the number of testcases to process.
The only line of each testcase contains one string S. It is guaranteed that S only consists of symbols 'A'-'E'.
-----Output-----
The output should contain exactly T lines, one line per each testcase in the order of their appearance. For each testcase, if there is no walk W which realizes S, then output -1. Otherwise, you should output the least lexicographical walk W which realizes S. Since all of the vertices are numbered from 0 to 9, then it can be encoded as a string consisting of symbols '0'-'9' (see the "Examples" section for more details).
-----Constraints-----
1 ≤ T ≤ 8;
1 ≤ |S| ≤ 100000(105).
-----Examples-----
Input:
2
AAB
AABE
Output:
501
-1 | ["let_to_num = {'A':[0,5], 'B':[1,6], 'C':[2,7], 'D':[3,8], 'E':[4,9]}\n\nnum_to_let = {0:'A', 1:'B', 2:'C', 3:'D', 4:'E',\n 5:'A', 6:'B', 7:'C', 8:'D', 9:'E'}\n\nconnections = {0:(1,4,5), 1:(0,2,6), 2:(1,3,7), 3:(2,4,8), 4:(0,3,9), 5:(0,7,8),\n 6:(1,8,9), 7:(2,5,9), 8:(3,5,6), 9:(4,6,7)}\n\nT = int(input())\n\nfor i in range(T):\n s = input()\n out_1, out_2= [],[]\n flag1, flag2 = True, True\n for c in range(len(s)):\n #print out_1, out_2, flag1, flag2\n if c == 0:\n out_1.append(let_to_num[s[c]][0])\n out_2.append(let_to_num[s[c]][1])\n #print out_1, out_2, '\\n'\n else:\n if flag1:\n conn_1 = set(connections[out_1[-1]])\n to_conn_1 = set(let_to_num[s[c]])\n \n if len(conn_1.intersection(to_conn_1))==0:\n flag1 = False\n else:\n out_1.extend(list(conn_1.intersection(to_conn_1)))\n \n #print 'out1',conn_1, to_conn_1, flag1, conn_1.intersection(to_conn_1)\n if flag2:\n conn_2 = set(connections[out_2[-1]])\n to_conn_2 = set(let_to_num[s[c]])\n \n if len(conn_2.intersection(to_conn_2))==0:\n flag2 = False\n else:\n out_2.extend(list(conn_2.intersection(to_conn_2)))\n #print 'out2', conn_2, to_conn_2, flag2, conn_2.intersection(to_conn_2)\n #print out_1, out_2, flag1, flag2, '\\n'\n if (not flag1) and (not flag2):\n break\n if (not flag1) and (not flag2):\n print(-1)\n continue\n elif flag1 and (not flag2):\n print(''.join(str(k) for k in out_1))\n continue\n elif flag2 and (not flag1):\n print(''.join(str(k) for k in out_2))\n continue\n else:\n print(min(''.join(str(k) for k in out_1), ''.join(str(k) for k in out_2)))\n continue\n", "G = {0:[1,4,5],1:[0,2,6],2:[1,3,7],3:[2,4,8],4:[3,0,9],5:[0,7,8],6:[1,8,9],7:[2,5,9],8:[3,5,6],9:[4,6,7]}\nL = {0:'A',1:'B',2:'C',3:'D',4:'E',5:'A',6:'B',7:'C',8:'D',9:'E'}\n\ndef Check(S):\n result = ''\n possibleStart = [k for k in list(L.keys()) if L[k] == S[0]]\n isBreak = False\n for c in S:\n found = False\n if result=='':\n result = result+str(possibleStart[0])\n last = possibleStart[0]\n found = True\n else:\n for k in G[last]:\n if L[k] == c:\n result = result+str(k)\n last = k\n found = True\n if not found:\n isBreak = True\n break\n #print result\n if not isBreak:\n return result\n result = ''\n #print 'nextstart'\n for c in S:\n found = False\n if result=='':\n result = result+str(possibleStart[1])\n last = possibleStart[1]\n found = True\n else:\n for k in G[last]:\n if L[k] == c:\n result = result+str(k)\n last = k\n found = True\n if not found:\n return str(-1)\n #print result\n return result \n\n\nT = int(input())\nwhile T > 0:\n T = T - 1\n S = input()\n R = Check(S)\n print(R)\n", "D = {0: [1, 4, 5], 1: [0, 2, 6], 2: [1, 3, 7],\n 3: [2, 4, 8], 4: [0, 3, 9], 5: [0, 7, 8],\n 6: [1, 8, 9], 7: [2, 5, 9], 8: [3, 5, 6], 9: [4, 6, 7]}\n\nE = ['A', 'B', 'C', 'D', 'E', 'A', 'B', 'C', 'D', 'E']\n\nfor _ in range(eval(input())):\n S = input()\n solved = False\n for i in range(10):\n if not solved:\n if E[i] == S[0]:\n solved = True\n ans = str(i)\n for x in S[1:]:\n for y in D[int(ans[-1])]:\n if E[y] == x:\n ans += str(y)\n break\n else:\n solved = False\n if solved:\n print(ans)\n else:\n print(-1)\n"] | {"inputs": [["2", "AAB", "AABE", "", ""]], "outputs": [["501", "-1"]]} | INTERVIEW | PYTHON3 | CODECHEF | 4,215 | |
f64832239aa8beda708c755a3efa3363 | UNKNOWN | ZCO is approaching, and you want to be well prepared!
There are $N$ topics to cover and the $i^{th}$ topic takes $H_i$ hours to prepare (where $1 \le i \le N$). You have only $M$ days left to prepare, and you want to utilise this time wisely. You know that you can't spend more than $S$ hours in a day preparing, as you get tired after that. You don't want to study more than one topic in a day, and also, don't want to spend more than two days on any topic, as you feel that this is inefficient.
Given these constraints, can you find the maximum number of topics you can prepare, if you choose the topics wisely?
-----Input:-----
- First line will contain $T$, number of testcases. Then the testcases follow.
- The first line of each test case contains three space-separated integers: $N$, $M$ and $S$, denoting the number of topics, the number of days remaining and the number of hours you can study in a day.
- The second line of each test case contains $N$ space-separated integers $H_i$, denoting the number of hours needed to prepare for the $i^{th}$ topic.
-----Output:-----
For each testcase, output in a single line: the maximum number of topics you can prepare.
-----Constraints-----
- $1 \leq T \leq 10$
- $1 \leq N \leq 10^5$
- $1 \leq M \leq 10^5$
- $1 \leq S \leq 16$
- $1 \leq H_i \leq 50$
-----Subtasks-----
- 30 points : Every topic takes the same number of hours to prepare (i.e. all $H_i$ are equal).
- 70 points : Original constraints.
-----Sample Input:-----
2
5 4 10
10 24 30 19 40
5 4 16
7 16 35 10 15
-----Sample Output:-----
2
4
-----Explanation:-----
Testcase 1:
You can choose topics $1$ and $4$. Topic $1$ will consume a single day , while topic $4$ will consume two days. Thus, you'll be able to prepare these two topics within the 4 remaining days. But you can check that you cannot do any better.
Testcase 2:
You can choose topics $1$, $2$, $4$, and $5$. Each of them will consume one day each. Thus you'll be able to cover $4$ topics. | ["import math\nT=int(input())\nfor i in range(T):\n N,M,S=input().split()\n N=int(N)\n M=int(M)\n S=int(S)\n ls=list(map(int,input().split()))\n maxx=max(ls)\n if S<17 and maxx<=50:\n ls.sort()\n total_sum = M * S\n count = 0\n sum = 0\n for i in ls:\n if i / S > 2:\n continue\n else:\n sum = sum + math.ceil(i / S) * S\n if sum <= total_sum:\n count = count + 1\n print(count)\n# cook your dish here\n", "# cook your dish here\nfor _ in range(int(input())):\n n,m,s=list(map(int,input().split()))\n arr=list(map(int,input().split()))\n arr.sort()\n count=0\n for a in arr:\n if a<=s and m>=1:\n count+=1\n m-=1\n elif a<=2*s and m>=2:\n count+=1\n m-=2\n print(count)\n", "for _ in range(int(input())):\n n,m,s=map(int,input().split())\n l=list(map(int,input().split()))\n l.sort()\n x=m*s\n c=0\n for i in l:\n if i<=s and m>=1:\n c+=1\n m-=1\n else: \n if i<=2*s and m>=2:\n c+=1\n m-=2\n print(c)", "for _ in range(int(input())):\n n,m,s=map(int,input().split())\n l=list(map(int,input().split()))\n l.sort()\n x=m*s\n c=0\n for i in l:\n if i<=s and m>=1:\n c+=1\n m-=1\n else: \n if i<=2*s and m>=2:\n c+=1\n m-=2\n print(c)", "for _ in range(int(input())):\n n, m, s = list(map(int, input().split()))\n arr2 = list(map(int, input().split()))\n count = 0\n arr2.sort()\n j = n\n arr3 = arr2.copy()\n count2 = 0\n for k in range(len(arr3)):\n if arr3[k] > s * 2:\n j = k\n break\n arr2 = arr2[:j]\n for kk in arr2:\n if count >= m:\n break\n elif kk <= s:\n count += 1\n count2 += 1\n else:\n count += 2\n count2 += 1\n if count <= m:\n print(count2)\n else:\n print(count2 - 1)\n", "for _ in range(int(input())):\n n, m, s = list(map(int, input().split()))\n arr2 = list(map(int, input().split()))\n count = 0\n arr2.sort()\n arr3 = arr2.copy()\n count2 = 0\n for k in arr3:\n if k > s * 2:\n arr2.remove(k)\n for kk in arr2:\n if count >= m:\n break\n elif kk <= s:\n count += 1\n count2 += 1\n else:\n count += 2\n count2 += 1\n if count <= m:\n print(count2)\n else:\n print(count2 - 1)\n", "for _ in range(int(input())):\n N,m,s=map(int,input().split())\n arr=list(map(int,input().split()))\n i=0\n count=0\n arr.sort()\n while(i<len(arr) and m>1):\n if(arr[i]<=s):\n #print(arr[i])\n m-=1\n count+=1\n else:\n if(arr[i]%s==0):\n if(arr[i]//s<=2):\n #print(arr[i])\n m=m-(arr[i]//s)\n count+=1\n else:\n if((arr[i]//s+1)<=2):\n #print(arr[i])\n m=m-(arr[i]//s+1)\n count+=1\n i+=1\n while(m>0 and i<len(arr)):\n if(arr[i]<=s):\n count+=1\n m=m-1\n else:\n if(arr[i]%s==0):\n if(arr[i]//s<=m):\n m=m-(arr[i]//s)\n count+=1\n else:\n if((arr[i]//s+1)<=m):\n m=m-(arr[i]//s+1)\n count+=1\n i+=1\n print(count)", "# cook your dish here\nfor _ in range(int(input())):\n n,m,s = (int(i) for i in input().split())\n li = list(int(i) for i in input().split())\n c=0\n d=m\n for i in li:\n if i<=s:\n c+=1\n d-=1\n if m<=c:\n print(m)\n else:\n for i in li:\n if d<2:\n break\n if i>s and i<=2*s:\n c+=1\n d-=2\n print(c)\n", "for _ in range(int(input())):\n n,m,s = (int(i) for i in input().split())\n li = list(int(i) for i in input().split())\n c=0\n d=m\n for i in li:\n if i<=s:\n c+=1\n d-=1\n if m<=c:\n print(m)\n else:\n for i in li:\n if d<2:\n break\n if i>s and i<=2*s:\n c+=1\n d-=2\n print(c)\n", "# cook your dish here\nfor _ in range(int(input())):\n n,m,s=map(int,input().split())\n ls=list(map(int,input().split()))\n ls.sort()\n ans=0\n for i in range(n):\n if ls[i]<=s:\n if m>0:\n ans+=1\n m-=1\n else:\n break\n elif ls[i]<=(2*s):\n if m>1:\n ans+=1\n m-=2\n else:\n break\n else:break\n print(ans)", "# cook your dish here\nfor i in range(int(input())):\n n,m,s=map(int,input().split(\" \"))\n h1,t,count = list(map(int,input().split( ))),[],0\n t=[x for x in h1 if x<=2*s]\n if len(t)==0:print(0)\n else:\n count=sum(map(lambda x: x<=s,t))\n if count>=m:print(m) \n elif m>=count+(len(t)-count)*2:print(len(t)) \n else:print(count+(m-count)//2)", "# cook your dish here\nfor i in range(int(input())):\n n,m,s=map(int,input().split(\" \"))\n h1,t,count = list(map(int,input().split( ))),[],0\n t=[x for x in h1 if x<=2*s]\n if len(t)==0:print(0)\n else:\n count=sum(map(lambda x: x<=s,t))\n if count>=m:print(m) \n elif m>=count+(len(t)-count)*2:print(len(t)) \n else:print(count+(m-count)//2)", "for i in range(int(input())):\n n,m,s=map(int,input().split(\" \"))\n h1,t,count = list(map(int,input().split( ))),[],0\n t=[x for x in h1 if x<=2*s]\n if len(t)==0:print(0)\n else:\n count=sum(map(lambda x: x<=s,t))\n if count>=m:print(m) \n elif m>=count+(len(t)-count)*2:print(len(t)) \n else:print(count+(m-count)//2)", "T=int(input())\nfor i in range(0,T):\n t=[]\n count=0\n n,m,s=list(map(int,input().split(\" \")))\n h=list(map(int,input().split( )))\n h1=list(h)\n \n t=[x for x in h1 if x<=2*s]\n if len(t)==0:\n print(0)\n else:\n count=sum([x<=s for x in t])\n if count>=m:\n print(m)\n \n elif m>=count+(len(t)-count)*2:\n print(len(t))\n \n else:\n print(count+(m-count)//2)\n\n", "T=int(input())\nfor i in range(0,T):\n t=[]\n count=0\n n,m,s=list(map(int,input().split(\" \")))\n h=list(map(int,input().split( )))\n h1=list(h)\n \n t=[x for x in h1 if x<=2*s]\n if len(t)==0:\n print(0)\n else:\n count=sum([x<=s for x in t])\n if count>=m:\n print(m)\n elif len(t)-count<1:\n print(count)\n else:\n print(count+(m-count)//2)\n\n", "T=int(input())\nfor i in range(0,T):\n t=[]\n count=0\n n,m,s=list(map(int,input().split(\" \")))\n h=list(map(int,input().split( )))\n h1=list(h)\n \n t=[x for x in h1 if x<=2*s]\n if len(t)==0:\n print(0)\n else:\n count=sum([x<=s for x in t])\n if count>=m:\n print(m)\n elif len(t)-count<1:\n print(len(t))\n else:\n print(count+(m-count)//2)\n\n", "T=int(input())\nfor i in range(0,T):\n t=[]\n count=0\n n,m,s=list(map(int,input().split(\" \")))\n h=list(map(int,input().split( )))\n h1=list(h)\n \n t=[x for x in h1 if x<=2*s]\n if len(t)==0:\n print(0)\n else:\n count=sum([x<=s for x in t])\n if count>=m:\n print(m)\n elif len(t)-count==0:\n print(len(t))\n else:\n print(count+(m-count)//2)\n\n", "T=int(input())\nfor i in range(0,T):\n t=[]\n count=0\n a=input().split(\" \")\n n=int(a[0])\n m=int(a[1])\n s=int(a[2])\n h=list(map(int,input().split(\" \")))\n h1=list(h)\n h1.sort()\n t=[x for x in h1 if x<=2*s]\n \n if len(t)==0:\n print(0)\n \n else:\n \n count=sum([x<=s for x in t])\n if count>=m:\n print(m)\n else:\n print(count+(m-count)//2)\n", "T=int(input())\nfor i in range(0,T):\n t=[]\n count=0\n a=input().split(\" \")\n n=int(a[0])\n m=int(a[1])\n s=int(a[2])\n h=list(map(int,input().split(\" \")))\n h1=list(h)\n\n \n t=[x for x in h1 if x<=2*s]\n \n if len(t)==0:\n print(0)\n \n else:\n \n count=sum([x<=s for x in t])\n if count>=m:\n print(m)\n else:\n print(count+(m-count)//2)\n", "# cook your dish here\nimport math\nno_of_test_cases = int(input())\n\n\ndef maxTopics(hours, N, M, S):\n sorted_hours = sorted(hours)\n \n no_of_days_needed = []\n \n for x in sorted_hours:\n if math.ceil(x / S) <= 2:\n no_of_days_needed.append(math.ceil(x / S))\n \n no_of_topics_coverd = 0\n \n for x in no_of_days_needed:\n if ( M - x >= 0):\n no_of_topics_coverd += 1\n M = M - x\n \n return no_of_topics_coverd \n \n \n\nfor x in range(1, no_of_test_cases + 1):\n N, M, S = input().split(\" \")\n N = int(N)\n M = int(M)\n S = int(S)\n hours = list([int(x) for x in input().split(\" \")])\n print(maxTopics(hours, N, M, S))\n", "# cook your dish here\nt=int(input())\nfor q in range(t):\n \n u=0\n nch=0\n ch,d,h=list(map(int,input().split()))\n l=sorted(list(map(int,input().split())))\n #print(l)\n for i in l:\n k=((i-1)//h)+1\n if k<3:\n \n u+=k\n #print(u)\n if u>d:\n break\n else:\n nch+=1\n else:\n break\n print(nch)\n #print(u)\n", "# cook your dish here\nimport math\nx=int(input())\n\nfor i in range(x):\n \n a,b,c=map(int,input().strip().split())\n s=[int(i) for i in input().strip().split()]\n s.sort()\n m=0\n counter=0\n for i in range(a):\n a1=math.ceil((s[i]/c))\n if(b>=a1 and a1<=2 ):\n counter+=1\n b=b-a1\n else:\n break\n \n print(counter)", "for _ in range(int(input())):\n n,m,s=[int(x) for x in input().split()]\n h=list(map(int,input().split()))\n h.sort()\n sum=0\n count =0\n for i in h:\n if i<=s and m>0:\n m-=1\n count+=1\n elif i<=s*2 and m>1:\n m-=2\n count+=1\n if m==0:\n break\n print(count)\n", "for _ in range(int(input())):\n n,m,s=[int(x) for x in input().split()]\n h=list(map(int,input().split()))\n h.sort()\n sum=0\n count =0\n for i in h:\n if i<=s*2:\n count+=1\n if i<=s:\n m-=1\n else:\n m-=2\n if m==0:\n break\n elif m==-1:\n count-=1\n break\n print(count)\n", "# cook your dish here\nfor _ in range(int(input())):\n n,m,s=list(map(int,input().split()))\n arr=[int(a) for a in input().split()]\n count=0\n arr.sort()\n for x in arr:\n if x<=s and m>0:\n m-=1\n count+=1\n elif x<=2*s and m>1:\n m-=2\n count+=1\n print(count)\n\n"] | {"inputs": [["2", "5 4 10", "10 24 30 19 40", "5 4 16", "7 16 35 10 15"]], "outputs": [["2", "4"]]} | INTERVIEW | PYTHON3 | CODECHEF | 9,202 | |
9d416b79883a5888309ba2c50e6dc3b2 | UNKNOWN | Vanja and Miksi really like games. After playing one game for a long time, they decided to invent another game!
In this game, they have a sequence $A_1, A_2, \dots, A_N$ and two numbers $Z_1$ and $Z_2$. The rules of the game are as follows:
- The players take turns alternately, starting with Vanja.
- There is an integer $S$; at the beginning, $S = 0$.
- In each turn, the current player must choose an arbitrary element of $A$ and either add that number to $S$ or subtract it from $S$. Each element can be selected multiple times.
- Afterwards, if $S = Z_1$ or $S = Z_2$, the current player (the player who made $S$ equal to $Z_1$ or $Z_2$) is the winner of the game.
- If the game lasts for $10^{10}$ turns, Vanja and Miksi decide to declare it a tie.
Can you help the boys determine the winner of the game? Please note that the game can end in a tie (if nobody can make $S = Z_1$ or $S = Z_2$ in the first $10^{10}$ moves).
Both players play optimally, i.e. if there is a move which guarantees the current player's victory regardless of the other player's moves, the current player will make such a move. If the current player cannot win and there is a move which guarantees that the game will end in a tie, the current player will make such a move.
-----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 $N$, $Z_1$ and $Z_2$.
- 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 final result of the game:
- $1$ if Vanja (the first player) has a winning strategy
- $2$ if Miksi (the second player) has a winning strategy
- $0$ if the game ends in a tie
-----Constraints-----
- $1 \le T \le 50$
- $1 \le N \le 50$
- $|Z_1|, |Z_2| \le 10^9$
- $|A_i| \le 10^9$ for each valid $i$
-----Subtasks-----
Subtask #1 (25 points): $N = 2$
Subtask #2 (75 points): original constraints
-----Example Input-----
3
2 6 4
-4 10
1 1 -1
2
2 0 7
3 4
-----Example Output-----
1
0
2
-----Explanation-----
Example case 1: The first player can choose the value $A_1 = -4$, subtract it from $S = 0$ and obtain $S = - (-4) = 4 = Z_2$. The winner is the first player.
Example case 2: It can be proven that neither player is able to reach $S = Z_1$ or $S = Z_2$. The result is a tie. | ["import sys\nfrom collections import defaultdict as dd\nfrom collections import deque\nfrom fractions import Fraction as f\nfrom copy import *\nfrom bisect import * \nfrom heapq import *\nfrom math import *\nfrom itertools import permutations \n \ndef eprint(*args):\n print(*args, file=sys.stderr)\nzz=1\n \n#sys.setrecursionlimit(10**6)\nif zz:\n input=sys.stdin.readline\nelse: \n sys.stdin=open('input.txt', 'r')\n sys.stdout=open('all.txt','w')\ndef li():\n return [int(xx) for xx in input().split()]\ndef fli():\n return [float(x) for x in input().split()] \ndef comp(a,b):\n if(a>b):\n return 2\n return 2 if a==b else 0 \ndef gi(): \n return [xx for x in input().split()]\ndef fi():\n return int(input())\ndef swap(a,i,j):\n a[i],a[j]=a[j],a[i] \ndef si():\n return list(input().rstrip()) \ndef mi():\n return map(int,input().split()) \ndef gh():\n sys.stdout.flush()\ndef graph(n,m):\n for i in range(m):\n x,y=mi()\n a[x].append(y)\n a[y].append(x)\ndef bo(i):\n return ord(i)-ord('a')\n \n \nt=fi()\nwhile t>0:\n t-=1\n n,z1,z2=mi()\n d={}\n a=li()\n flag=0\n for i in a:\n d[i]=1\n d[-i]=1\n if i==z1 or i==z2 or i==-z1 or i==-z2:\n flag=1\n break\n if flag:\n print(1)\n continue \n for i in d:\n p=[i-z1,i-z2]\n c=1\n for j in p:\n if j in d:\n c*=0\n flag|=c \n print(0 if flag else 2) ", "# cook your dish here\nfor _ in range(int(input())):\n n, z1, z2 = [int(i) for i in input().split()]\n A = [int(i) for i in input().split()]\n t1 = [i for i in A] + [-i for i in A]\n if z1 in t1 or z2 in t1 :\n print(1)\n else :\n t2 = 2\n for val in t1 :\n t3 = [val + t for t in t1]\n if z1 not in t3 and z2 not in t3 :\n t2 = 0\n break\n print(t2)", "t = int(input())\n\nfor _ in range(t):\n n, z1, z2 = list(map(int, input().split()))\n \n arr = list(map(int, input().split()))\n\n for i in range(n):\n arr[i] = abs(arr[i])\n\n if (abs(z1) in arr) or (abs(z2) in arr):\n print(1)\n continue\n\n if (z1 == 0) or (z2 == 0):\n print(2)\n continue\n\n poss = True\n for i in arr:\n #print(z1 + i, z2 + i, z1 - i, z2 - i)\n if ((abs(z1 + i) in arr) or (abs(z2 + i) in arr)) and \\\n ((abs(z1 - i) in arr) or (abs(z2 - i) in arr)):\n pass\n else:\n poss = False\n break\n\n if poss:\n print(2)\n continue\n\n print(0)\n", "for _ in range(int(input())):\n n,z1,z2=map(int,input().split())\n num1=[int(i) for i in input().split()]\n num2=[int(i)*-1 for i in num1]\n nums=num1+num2 \n f=0 \n if z1 in nums or z2 in nums:\n f=1 \n print(1) #can directly pick and win\n continue \n cnt=0 \n for val in nums:\n if val-z1 in nums or val-z2 in nums:\n cnt+=1 \n if f==0 and cnt==n+n:\n print(2) #still_mate ...where ever u go..u will be killed\n f=2 \n if not f:\n print(0)", "import sys \n\nT = int(sys.stdin.readline())\nfor tc in range(T):\n N,Z1,Z2 = [int(c) for c in sys.stdin.readline().strip().split()]\n A = [int(c) for c in sys.stdin.readline().strip().split()]\n A.extend([-a for a in A])\n def sol(A, Z1, Z2): \n if Z1 in A or Z2 in A:\n return 1\n else:\n if all((Z1-s in A or Z2-s in A) for s in A):\n return 2\n return 0\n print(sol(A, Z1, Z2))\n \n", "for T in range(0, int(input())):\n\n n, z1, z2 = map(int, input().split())\n\n x = list(map(int, input().split()))\n y = x\n\n for i in range(0, n):\n y.append(-x[i])\n\n res = 0\n\n for i in range(0, n):\n if (abs(x[i]) == abs(z1) or abs(x[i]) == abs(z2)):\n res = 1\n break\n\n if res == 0:\n for i in range(0, 2*n):\n flag = 0\n for j in range(0, 2*n):\n if y[i] + y[j] == z1 or y[i] + y[j] == z2:\n flag = 1\n break\n\n if flag == 0:\n break\n if flag == 1:\n res = 2\n\n\n print(res)", "for i in range(int(input())):\n n,z1,z2 = map(int,input().split())\n arr = list(map(int,input().split()))\n m = dict()\n for item in arr:\n m[item]=1\n m[-item]=-1\n if z1 in m or z2 in m: \n print(\"1\")\n else:\n cnt = 0\n for item in arr:\n if z1-item in m or z2-item in m:\n cnt+=1\n if z1+item in m or z2+item in m:\n cnt+=1\n if cnt==2*n:\n print(\"2\")\n else: print(\"0\")", "from collections import defaultdict\nfor t in range(int(input())):\n n,z1,z2=list(map(int,input().split()))\n seq=list(map(int,input().split()))\n c=0\n dic=defaultdict(int)\n for i in seq :\n dic[i]=1\n dic[-i]=1\n if dic[z1] or dic[z2]:\n print(1)\n continue\n for i in seq :\n if dic[z1-i] or dic[z2-i]:\n c+=1\n if dic[z1+i] or dic[z2+i]:\n c+=1\n if c==2*len(seq):\n print(2)\n else :\n print(0)\n", "T = int(input())\n\nfor a in range(T):\n n, z1, z2 = map(int,input().split())\n num = [int(a) for a in input().split()][:n]\n num2 = [-1*i for i in num]\n nums = num+num2\n\n flag = 0\n for val in nums:\n if val == z1 or val == z2:\n flag = 1\n print(1)\n break\n cnt = 0\n for val1 in nums:\n if val1 - z1 in nums or val1 - z2 in nums:\n cnt += 1\n if cnt == len(nums) and not flag == 1:\n flag = 2\n print(2)\n if flag == 0:\n print(0)", "def check(arr, z) :\n for i in arr :\n if i in z : return 1\n for i in arr :\n flag = True\n for j in arr :\n if i+j in z or i-j in z :\n flag = False\n break\n if flag : return 0\n return 2\n\nfor test_case in range(int(input())) :\n n, z1, z2 = [int(i) for i in input().split()]\n arr = [int(i) for i in input().split()]\n arr += [-i for i in arr]\n print(check(arr, (z1, z2)))", "t = int(input())\nwhile t > 0:\n inp = input()\n arr = input()\n inp = inp.split() \n n = int(inp[0])\n z1 = int(inp[1])\n z2 = int(inp[2])\n arr = arr.split()\n arr = [int(value) for value in arr]\n for i in range(n):\n arr.append(-1 * arr[i])\n flag = 0\n for val in arr:\n if val == z1 or val == z2:\n flag = 1\n print(1)\n break\n cnt = 0\n for val1 in arr:\n if val1 - z1 in arr or val1 - z2 in arr:\n cnt += 1\n if cnt == len(arr) and not flag == 1:\n flag = 2\n print(2)\n if flag == 0:\n print(0)\n t -= 1", "from itertools import chain\n\nR = lambda: list(map(int, input().split()))\nt = int(input())\nfor _ in range(t):\n n, *z = R()\n u = set(chain.from_iterable((x, -x) for x in R()))\n v = set(x + y for x in z for y in u)\n if 0 in v:\n print(1)\n elif u <= v:\n print(2)\n else:\n print(0)\n", "for i in range(int(input())):\n n, a, b = [int(c) for c in input().split()]\n impossible = 0\n arr = [abs(int(x)) for x in input().split()]\n\n if a in arr or -a in arr or b in arr or -b in arr:\n print(1)\n continue\n\n if a == 0 or b == 0:\n print(2)\n continue\n if a == -b:\n for move1 in arr:\n a_left = abs(a - move1)\n b_left = abs(b - move1)\n if a_left in arr or b_left in arr:\n continue\n else:\n impossible = 1 \n break\n else:\n print(2)\n continue\n\n print(0)", "for i in range(int(input())):\n n, a, b = [int(c) for c in input().split()]\n impossible = 0\n arr = [abs(int(x)) for x in input().split()]\n\n if a in arr or -a in arr or b in arr or -b in arr:\n print(1)\n continue\n\n if a == 0 or b == 0:\n print(2)\n continue\n if a == -b:\n for move1 in arr:\n a_left = abs(a - move1)\n b_left = abs(b - move1)\n if a_left in arr or b_left in arr:\n continue\n else:\n impossible = 1 \n break\n else:\n print(2)\n continue\n\n print(0)\n", "from itertools import chain\n\nR = lambda: list(map(int, input().split()))\nt = int(input())\nfor _ in range(t):\n n, *z = R()\n a = list(R())\n u = set(chain.from_iterable((x, -x) for x in a))\n v = set(x + y for x in z for y in u)\n if 0 in v:\n print(1)\n elif u <= v:\n print(2)\n else:\n print(0)\n", "from itertools import chain\n\nR = lambda: list(map(int, input().split()))\nt = int(input())\nfor _ in range(t):\n n, *z = R()\n a = list(R())\n aa = lambda: chain.from_iterable((x, -x) for x in a)\n v = set(x + y for x in z for y in aa())\n if 0 in v:\n print(1)\n elif set(aa()) <= v:\n print(2)\n else:\n print(0)\n", "from itertools import chain\n\nR = lambda: list(map(int, input().split()))\nt = int(input())\nfor _ in range(t):\n n, *z = R()\n a = list(R())\n aa = lambda: chain.from_iterable((x, -x) for x in a)\n u = set(chain.from_iterable((x, -x) for x in a))\n v = set(x + y for x in z for y in aa())\n if 0 in v:\n print(1)\n elif set(aa()) <= v:\n print(2)\n else:\n print(0)\n", "from itertools import chain\n\nR = lambda: list(map(int, input().split()))\nt = int(input())\nfor _ in range(t):\n n, *z = R()\n a = list(R())\n u = set(chain.from_iterable((x, -x) for x in a))\n v = set(x + y for x in z for y in u)\n if 0 in v:\n print(1)\n elif u <= v:\n print(2)\n else:\n print(0)\n", "t=int(input())\nfor _ in range(t):\n n,z1,z2=map(int,input().split())\n l = list(map(int,input().split()))\n if z1 in l or z2 in l or -1*z1 in l or -1*z2 in l:\n print(1)\n continue\n if z1==0 and z2==0:\n print(2)\n continue\n l=list(map(abs,l))\n for i in l:\n if abs(z1-i) not in l and abs(z2-i) not in l:\n print(0)\n break\n if abs(z1+i) not in l and abs(z2+i) not in l:\n print(0)\n break\n else:\n print(2)", "from itertools import chain\nfrom functools import reduce\nfrom operator import and_\n\nR = lambda: list(map(int, input().split()))\nt = int(input())\nfor _ in range(t):\n n, *z = R()\n a = list(R())\n aa = lambda: chain.from_iterable((x, -x) for x in a)\n r = 0\n v = [x + y for x in z for y in aa()]\n if 0 in v:\n print(1)\n elif 0 in reduce(and_, (set(x + y for x in v) for y in aa())):\n print(2)\n else:\n print(0)\n"] | {"inputs": [["3", "2 6 4", "-4 10", "1 1 -1", "2", "2 0 7", "3 4"]], "outputs": [["1", "0", "2"]]} | INTERVIEW | PYTHON3 | CODECHEF | 9,360 | |
52c47012190da3f8d2a1bc262d358cec | UNKNOWN | Rachel has some candies and she decided to distribute them among $N$ kids. The ith kid receives $A_i$ candies. The kids are happy iff the difference between the highest and lowest number of candies received is less than $X$.
Find out if the children are happy or not.
-----Input:-----
- First line will contain $T$, number of testcases. Then the testcases follow.
- The first line contains $N$ and $X$.
- The second line contains $N$ integers $A_1,A_2,...,A_N$.
-----Output:-----
For each test case print either "YES"(without quotes) if the kids are happy else "NO"(without quotes)
-----Constraints-----
- $1 \leq T \leq 100$
- $1 \leq N, X \leq 10^5$
- $1 \leq A_i \leq 10^5$
-----Sample Input:-----
2
5 6
3 5 6 8 1
3 10
5 2 9
-----Sample Output:-----
NO
YES
-----EXPLANATION:-----
- Example 1: Difference between maximum and minimum candies received is 8-1=7. 7 is greater than 6, therefore, the kids are not happy. | ["t=int(input())\r\n\r\nfor t1 in range(t):\r\n\tn,x=map(int,input().split())\r\n\ta=list(map(int,input().split()))\r\n\t\r\n\tmx=max(a)\r\n\tmn=min(a)\r\n\t\r\n\tif (mx-mn<x):\r\n\t\tprint(\"YES\")\r\n\telse:\r\n\t\tprint(\"NO\")", "for i in range(int(input())):\r\n n, x = list(map(int, input().split()))\r\n a = list(map(int, input().split()))\r\n\r\n if max(a) - min(a) > x:\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")\r\n", "# cook your dish here\nt=int(input())\nfor _ in range(t):\n N, X = map(int,input().split())\n A = list(map(int,input().split()))\n x=max(A)\n y=min(A)\n #print(x)\n if (x-y)<X:\n print(\"YES\")\n else:\n print(\"NO\")", "# cook your dish here\nt=int(input())\nfor i in range(t):\n l=list(map(int,input().split()))\n n=l[0]\n x=l[1]\n p=list(map(int,input().split()))\n pmax=max(p)\n pmin=min(p)\n if (pmax-pmin)<x:\n print(\"YES\")\n else:\n print(\"NO\")\n", "t = int(input())\r\nwhile t > 0:\r\n\tt -= 1\r\n\tm, n = map(int, input().split())\r\n\ta = list(map(int,input().strip().split()))[:m]\r\n\tif (max(a) - min(a)) < n:\r\n\t\tprint(\"YES\")\r\n\telse:\r\n\t\tprint(\"NO\")", "for _ in range(int(input())):\r\n a,b=map(int,input().split())\r\n arr=list(map(int,input().split()))\r\n m=max(arr)-min(arr)\r\n if(m<b):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "# cook your dish here\nt=int(input())\nfor _ in range(t):\n n,k=list(map(int,input().split()))\n l1=list(map(int,(input().split())))\n l1.sort()\n diff=l1[-1]-l1[0]\n if k<diff:\n print('NO')\n else:\n print('YES')\n", "# cook your dish here\nfor i in range(int(input())):\n r,c = list(map(int,input().split()))\n lst = list(map(int,input().split()))\n maxx,minn = max(lst),min(lst)\n if (maxx-minn)<c:\n print(\"YES\")\n else:\n print(\"NO\")\n\n", "# cook your dish here\nfor t in range (int(input())):\n n, x = map(int, input().split())\n arr = list(map(int, input().split()))\n if max(arr) - min(arr) < x:\n print('YES')\n else:\n print('NO')", "# cook your dish here\ntry:\n n = int(input())\n for i in range(n):\n c , x = input().split()\n l = list(map(int,input().split()))\n l_min , l_max = min(l) , max(l)\n if l_max - l_min > int(x):\n print('NO')\n else:\n print('YES')\nexcept:\n pass", "for i in range(int(input())):\n n,x = map(int,input().split())\n l = list(map(int,input().split()))\n m = max(l)\n l = min(l)\n if m-l>x:\n print(\"NO\")\n else:\n print(\"YES\")", "# cook your dish here\nt = int(input())\nwhile t>0:\n n,x = map(int, input().split())\n candies = list(map(int, input().split()))\n max_candies = max(candies)\n min_candies = min(candies)\n if(max_candies-min_candies<x):\n print(\"YES\")\n else:\n print(\"NO\")\n t-=1", "t=int(input())\nfor i in range(t):\n n,x=list(map(int,input().split()))\n a=list(map(int,input().split()))\n if max(a)-min(a)<x:\n print(\"YES\")\n else:\n print(\"NO\")\n", "# cook your dish here\nfor _ in range(int(input())):\n n,k=map(int,input().split())\n l=list(map(int,input().split()))\n m=max(l)\n n=min(l)\n if(m-n<k):\n print(\"YES\")\n else:\n print(\"NO\")", "''' PROBLEM A '''\r\n\r\n\r\n \r\n\r\n''' PROBLEM B '''\r\n\r\n\r\n\r\n''' PROBLEM C '''\r\n\r\n\r\n\r\n\r\n''' PROBLEM D '''\r\n\r\n\r\nn=int(input())\r\nfor i in range(0,n):\r\n p=input().rstrip().split(' ')\r\n # print(int(p[0]) * int(p[1]))\r\n q=input().rstrip().split(' ')\r\n x=int(p[1])\r\n q.sort(key=int)\r\n A=int(q[0])\r\n B=int(q[len(q)-1])\r\n C=abs(A-B)\r\n if C < x:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "# cook your dish here\nt=int(input())\nfor i in range(0,t):\n n,k=list(map(int, input().split()))\n a=list(map(int, input().split()))\n if((max(a)-min(a))<k):\n print(\"YES\")\n else:\n print(\"NO\")\n \n", "# cook your dish here\\\nt=int(input())\nfor i in range(t):\n n,k=list(map(int, input().split()))\n a= list(map(int, input().split()))\n m=max(a)\n n=min(a)\n d=m-n\n if(d<k):\n print(\"YES\")\n else:\n print(\"NO\")\n", "n=int(input())\r\nwhile(n>0):\r\n n=n-1\r\n lst=[]\r\n P,X=map(int,input().split())\r\n lst=list(map(int,input().split()))\r\n d=max(lst)-min(lst)\r\n if(d<X):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "# cook your dish here\nt=int(input())\nwhile t>0:\n a,b=map(int,input().split())\n l=list(map(int,input().split()))\n if max(l)-min(l)<b:\n print(\"YES\")\n else:\n print(\"NO\")\n t-=1", "# cook your dish here\nt=int(input())\nwhile t>0:\n n,m=list(map(int,input().split()))\n arr=list(map(int,input().split()))\n arr.sort()\n if arr[n-1]-arr[0]<m:\n print('YES')\n else:\n print('NO')\n t-=1\n\n", "T = int(input())\nwhile(T):\n nx =[int(x) for x in input().split()]\n A=[int(x) for x in input().split()]\n if max(A)-min(A)<nx[1]:\n print(\"YES\")\n else:\n print(\"NO\")\n T =T-1", "# cook your dish here\nfor _ in range(int(input())):\n n, x = map(int, input().split())\n candies = list(map(int, input().split()))\n \n min_candy = min(candies)\n max_candy = max(candies)\n \n if (max_candy - min_candy) < x:\n print(\"YES\")\n else: \n print(\"NO\")", "# cook your dish here\n# cook your dish here\nfrom sys import stdout, stdin\n\n\ndef main():\n numOfKids, difference = list(map(str, input().split()))\n numbers = [int(x) for x in stdin.readline().split()]\n numOfKids = int(numOfKids)\n difference = int(difference)\n smallest = largest = numbers[0]\n for j in range(1, len(numbers)):\n if (smallest > numbers[j]):\n smallest = numbers[j]\n min_position = j\n if (largest < numbers[j]):\n largest = numbers[j]\n max_position = j\n listDiff = largest - smallest\n #print(largest)\n #print(smallest)\n #print(difference)\n if(listDiff > difference):\n print(\"NO\")\n elif(difference > listDiff):\n print(\"YES\")\n elif(difference == listDiff):\n print(\"NO\")\n\n\ndef __starting_point():\n testCases = int(stdin.readline())\n if 0 <= testCases <= 100:\n for _ in range(testCases):\n main()\n\n__starting_point()", "n=int(input())\nfor i in range(1,n+1):\n r=[int(r)for r in input().split()]\n y=[int(y)for y in input().split()]\n y.sort()\n j=0\n j=r[0]\n diff=int(y[j-1]-y[0])\n if(diff < r[1]):\n print(\"YES\")\n diff=0\n else:\n print(\"NO\")\n diff=0\n", "# cook your dish here\ntry:\n n=int(input())\n for _ in range(n):\n a,b=map(int,input().split())\n l=list(map(int,input().split()))\n x1=max(l)\n x2=min(l)\n \n if((x1-x2) < b):\n print(\"YES\")\n else:\n print(\"NO\")\n \nexcept:\n pass"] | {"inputs": [["2", "5 6", "3 5 6 8 1", "3 10", "5 2 9"]], "outputs": [["NO", "YES"]]} | INTERVIEW | PYTHON3 | CODECHEF | 7,260 | |
1a931c888de1da1088480396a270a3a5 | UNKNOWN | A policeman wants to catch a thief. Both the policeman and the thief can only move on a line on integer coordinates between $0$ and $N$ (inclusive).
Initially, the policeman is at a coordinate $x$ and the thief is at a coordinate $y$. During each second, each of them must move to the left or right (not necessarily both in the same direction) by distance $\textbf{exactly}$ equal to $K$. No one may go to the left of the coordinate $0$ or to the right of $N$. Both the policeman and the thief move simultaneously and they cannot meet while moving, only at the end of each second.
Will the policeman be able to catch the thief if they both move optimally? The thief is caught as soon as the policeman and thief meet at the same position at the same time.
-----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 $x$, $y$, $K$ and $N$.
-----Output-----
For each test case, print a single line containing the string "Yes" if the thief can be caught or "No" if the thief cannot be caught (without quotes).
-----Constraints-----
- $1 \le T \le 1,000$
- $1 \le N \le 10^9$
- $1 \le K \le N$
- $0 \le x, y \le N$
- $x \neq y$
-----Example Input-----
5
0 1 1 1
1 4 1 5
4 2 1 7
3 7 2 10
8 2 3 15
-----Example Output-----
No
No
Yes
Yes
Yes
-----Explanation-----
Example case 1: The policeman is at $0$ and the thief is at $1$. After the $1$-st second, the policeman is at $1$ and the thief is at $0$. After the next second, the policeman is again at $0$ and the thief at $1$. They cannot end up at the same coordinate. | ["t = int(input())\nfor _ in range(t):\n x, y, k, n = [int(x) for x in input().split()]\n k = k*2\n temp = abs(x-y)\n if(temp%k == 0):\n print(\"Yes\")\n else:\n print(\"No\")\n", "t = int(input())\n\nfor _ in range(t):\n x, y, k, n = [int(x) for x in input().split()]\n k = k*2\n temp = abs(x-y)\n if(temp%k == 0):\n print(\"Yes\")\n else:\n print(\"No\")", "# cook your dish here\nt = int(input())\nfor j in range(t):\n (x, y, K, N) = list(map(int, input().split(' ')))\n val = abs(x-y)\n if val%K==0:\n if (val/K)%2 == 0:\n print('Yes')\n else:\n print('No')\n else:\n print('No')\n \n \n", "try:\n t=int(input())\n while t>0:\n [x,y,K,N]=[int(x) for x in input().split()]\n if abs(x-y)%(2*K)==0:\n print('Yes')\n else:\n print('No')\n t-=1\nexcept:\n pass", "t=int(input())\nfor i in range(t):\n x,y,K,N=list(map(int,input().split()))\n \n if (abs(x-y) %(2*K)==0):\n print('Yes')\n else:\n print('No') ", "for _ in range(int(input())):\n x,y,k,n = map(int,input().split())\n if(abs(x-y)%k==0):\n if((abs(x-y)/k)%2==0):\n print(\"Yes\")\n else:\n print(\"No\")\n else:\n print(\"No\")", "# cook your dish here\nfor _ in range(int(input())):\n x,y,k,n=list(map(int,input().split()))\n diff=abs(x-y)\n if (diff%(2*k))==0:\n print(\"Yes\")\n else:\n print(\"No\")\n", "# cook your dish here\nfor _ in range(int(input())):\n x,y,k,n = map(int,input().split())\n dis = abs(x-y)\n k *= 2\n if dis % k:\n print(\"No\")\n else:\n print(\"Yes\")", "for _ in range(int(input())):\n x,y,k,n = map(int,input().split())\n a = abs(x-y)/2\n \n if a%k ==0:\n print(\"Yes\")\n else:\n print(\"No\")", "for _ in range(int(input())):\n x,y,k,n = list(map(int,input().split()))\n a = abs(x-y)/2\n \n if a%k ==0:\n print(\"Yes\")\n else:\n print(\"No\")\n\n # cook your dish here\n", "for _ in range(int(input())):\n x,y,k,n = list(map(int,input().split()))\n a = abs(x-y)/2\n if abs(x-y)%2 ==0:\n if a%k ==0:\n print(\"Yes\")\n else:\n print(\"No\")\n else:\n print(\"No\")\n\n # cook your dish here\n", "def solve(x,y,k,n):\n val=abs(x-y)\n if val%k==0:\n if (val/k)%2==0:\n print('Yes')\n else:\n print('No')\n else:\n print('No')\nt=int(input())\nfor i in range(t):\n x,y,k,n=map(int,input().split())\n solve(x,y,k,n)", "def solve(x,y,k,n):\n val=abs(x-y)\n if val%k==0:\n if (val/k)%2==0:\n print('Yes')\n else:\n print('No')\n else:\n print('No')\nt=int(input())\nfor i in range(t):\n x,y,k,n=map(int,input().split())\n solve(x,y,k,n)", "# cook your dish here\nt=int(input())\nfor _ in range(t):\n x,y,k,n=map(int,input().split())\n if(y > x):\n time=(n-y)//k\n yfinal=y+time*k\n xnet=x+time*k\n diff=yfinal-xnet\n if(diff % (2*k)==0):\n print(\"Yes\")\n else:\n print(\"No\")\n elif(x > y):\n time=(y-0)//k\n yfinal=y-time*k\n xnet=x-time*k\n diff=xnet-yfinal\n if(diff%(2*k)==0):\n print(\"Yes\")\n else:\n print(\"No\")", "for _ in range(int(input())):\n a, b, k, n = map(int, input().split())\n val = abs(a - b)\n if((val/k)%2 == 0):\n print(\"Yes\")\n else:\n print(\"No\")", "for _ in range(int(input())):\n a, b, k, n = map(int, input().split())\n val = abs(a - b)\n if(val%k == 0):\n if((val/k)%2 == 0):\n print(\"Yes\")\n else:\n print(\"No\")\n else:\n print(\"No\")", "for _ in range(int(input())):\n x,y,k,n = list(map(int,input().split()))\n if abs(x-y)%(2*k)!=0:\n print('No')\n else:\n print('Yes')\n", "# cook your dish here\n\nfor TC in range(int(input())):\n x,y,k,n = list(map(int,input().split()))\n \n if abs(x-y)%(2*k)!=0:\n print('No')\n else:\n print('Yes')\n", "for q in range(int(input())):\n x, y, k, n = [int(z) for z in input().split()]\n a=max(x,y)\n b=min(x,y)\n if(((a-b)/2)%k==0):\n print('Yes')\n else:\n print('No')\n", "# cook your dish here\nt=int(input())\nfor i in range(t):\n x,y,k,n=list(map(int,input().split()))\n val = abs(x-y)\n if(val%k==0):\n if((val/k)%2==0):\n print(\"Yes\")\n else:\n print(\"No\")\n else:\n print(\"No\")\n \n \n \n \n \n", "# cook your dish here\nt = int(input())\nfor _ in range(t):\n x,y,K,N = map(int,input().split())\n if abs(x-y) %2 != 0:\n print(\"No\")\n else:\n if abs(x-y) % K == 0 and (abs(x-y) // K) % 2 == 0 :\n print(\"Yes\")\n else:\n print(\"No\")", "# cook your dish here\nt = int(input())\nfor _ in range(t):\n x,y,K,N = map(int,input().split())\n if abs(x-y) %2 != 0:\n print(\"No\")\n else:\n if abs(x-y) % K == 0 and (abs(x-y) // K) % 2 == 0 :\n print(\"Yes\")\n else:\n print(\"No\")", "# cook your dish here\nt = int(input())\nfor _ in range(t):\n x,y,K,N = map(int,input().split())\n if abs(x-y) %2 != 0:\n print(\"No\")\n else:\n if abs(x-y) % K == 0 and (abs(x-y) // K) % 2 == 0:\n print(\"Yes\")\n else:\n print(\"No\")", "\ndef readintarray():\n return [int(s) for s in input().strip().split(\" \")]\n \ndef solve(x, y, k, n):\n if abs(y - x) % k != 0:\n return False\n z = abs(y - x) // k\n return z % 2 == 0\n \n\nfor _ in range(int(input())):\n x, y, k, n = readintarray()\n print(\"Yes\" if solve(x, y, k, n) else \"No\")", "try:\n t=int(input())\n while(t):\n x,y,k,n=input().split()\n n=int(n)\n k=int(k)\n x=int(x)\n y=int(y)\n if (x-y)%(2*k)==0:\n print(\"Yes\")\n else:\n print(\"No\")\n \n t-=1\nexcept:\n pass"] | {"inputs": [["5", "0 1 1 1", "1 4 1 5", "4 2 1 7", "3 7 2 10", "8 2 3 15"]], "outputs": [["No", "No", "Yes", "Yes", "Yes"]]} | INTERVIEW | PYTHON3 | CODECHEF | 5,249 | |
fe39fc583e47d11eeaebdc823465a443 | UNKNOWN | There is a big staircase with $N$ steps (numbered $1$ through $N$) in ChefLand. Let's denote the height of the top of step $i$ by $h_i$. Chef Ada is currently under the staircase at height $0$ and she wants to reach the top of the staircase (the top of the last step). However, she can only jump from height $h_i$ to the top of a step at height $h_f$ if $h_f-h_i \le K$. To help Ada, we are going to construct some intermediate steps; each of them may be constructed between any two steps, or before the first step, and have any height. What is the minimum number of steps that need to be added to the staircase so that Ada could reach the top?
-----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-seperated integers $h_1, h_2, \dots, h_N$.
-----Output-----
For each test case, print a single line containing one integer — the minimum required number of steps.
-----Constraints-----
- $1 \le T \le 64$
- $1 \le N \le 128$
- $1 \le K \le 1,024$
- $1 \le h_i \le 1,024$ for each valid $i$
- $h_i < h_{i+1}$ for each valid $i$
-----Example Input-----
1
4 3
2 4 8 16
-----Example Output-----
3 | ["# cook your dish here\n\nimport numpy as np\n \n\ndef minstairs(n,k):\n stairsHeight=[]\n stairs=0\n current = 0\n stairsHeight=list(map(int, input().split()))\n stairsHeight=np.array(stairsHeight)\n curr=0\n for i in range(n):\n if stairsHeight[i]-curr<=k:\n curr=stairsHeight[i]\n else:\n if (stairsHeight[i]-curr)%k==0:\n stairs+=((stairsHeight[i]-curr)//k)-1\n else:\n stairs+=(stairsHeight[i]-curr)//k\n curr=stairsHeight[i]\n return stairs\n \nT=int(input())\nfor i in range(T):\n n,k =list(map(int,input().split()))\n print(minstairs(n,k))\n", "# cook your dish here\nfrom numba import njit\nimport numpy as np\n \n\ndef minstairs(n,k):\n stairsHeight=[]\n stairs=0\n current = 0\n stairsHeight=list(map(int, input().split()))\n stairsHeight=np.array(stairsHeight)\n curr=0\n for i in range(n):\n if stairsHeight[i]-curr<=k:\n curr=stairsHeight[i]\n else:\n if (stairsHeight[i]-curr)%k==0:\n stairs+=((stairsHeight[i]-curr)//k)-1\n else:\n stairs+=(stairsHeight[i]-curr)//k\n curr=stairsHeight[i]\n return stairs\n \nT=int(input())\nfor i in range(T):\n n,k =list(map(int,input().split()))\n print(minstairs(n,k))\n", "# cook your dish here\nt=int(input())\nfor i in range(t):\n current=0\n count=0\n n,k=[int(x) for x in input().split()]\n h=[int(y) for y in input().split()]\n for j in range(100000000):\n # print(current)\n if current==h[-1]:\n break\n \n for aa in range(100000000):\n \n if abs(current-h[j])<=k:\n current=h[j]\n break\n else:\n # for \n current+=k\n # print(current)\n count+=1\n print(count)\n \n \n \n \n # for j in range(10000000):\n # print(current)\n # if current+abs(hi[j]-hi[j+1])<=k:\n # current=hi[j]\n # if current==hi[-1]:\n # break\n \n # else:\n # current+=k\n # count+=1\n # # print(count)\n", "# cook your dish herr\nfor i in range(int(input())):\n N,K=map(int,input().split())\n H=[]\n H=[int(x) for x in input().split()]\n highest=0\n count=0\n for k in H:\n if(k-highest>K):\n count=count+(k-highest-1)//K\n highest=k\n print(count)", "# cook your dish here\nfor _ in range(int(input())):\n n,k = list(map(int,input().split()))\n arr = list(map(int,input().split()))\n res = (arr[0]-1)//k\n for i in range(1,len(arr)):\n res+= (arr[i]-arr[i-1]-1)//k \n print(res)", "# cook your dish here\nfor _ in range(int(input())):\n N,K=(int(i) for i in input().strip().split())\n stair_arr=[0]\n stair_arr.extend([int(i) for i in input().strip().split()])\n add_cnt=0\n for i in range(1,N+1):\n height_diff=stair_arr[i]-stair_arr[i-1]\n if(height_diff>K):\n add_cnt+=(height_diff//K)\n if(height_diff%K==0):\n add_cnt-=1\n \n print(add_cnt)\n", "for i in range(int(input())):\n n,k=map(int,input().split())\n a=list(map(int,input().split()))\n c=0\n if((a[0]-1)>k):\n c+=((a[0]-1)//k)\n for i in range(n-1):\n if((a[i+1]-a[i])>k):\n c+=(a[i+1]-a[i]-1)//k\n print(c)", "# cook your dish here\nfor i in range(int(input())):\n n,k=map(int,input().split())\n a=list(map(int,input().split()))\n c=0\n if((a[0]-1)>k):\n c+=((a[0]-1)//k)\n for i in range(n-1):\n if((a[i+1]-a[i])>k):\n c+=(a[i+1]-a[i]-1)//k\n print(c)", "# cook your dish here\nfor _ in range(int(input())):\n M, L = map(int, input().split())\n g = list(map(int, input().split()))\n g.insert(0,0)\n b = 0\n for i in range(1, M+1):\n b += (g[i] - g[i-1] - 1) // L\n print(b)", "# cook your dish here\nfor _ in range(int(input())):\n N, K = map(int, input().split())\n h = list(map(int, input().split()))\n h.insert(0,0)\n c = 0\n for i in range(1, N+1):\n c += (h[i] - h[i-1] - 1) // K\n print(c)", "# cook your dish here\nfor _ in range(int(input())):\n N, K = list(map(int, input().split()))\n h = list(map(int, input().split()))\n h.insert(0,0)\n c = 0\n for i in range(1, N+1):\n c += (h[i] - h[i-1] - 1) // K\n print(c)\n", "# cook your dish here\nfor _ in range(int(input())):\n N, K = map(int, input().split())\n h = list(map(int, input().split()))\n h.insert(0,0)\n c = 0\n for i in range(1, N+1):\n c += (h[i] - h[i-1] - 1) // K\n print(c)", "for _ in range(int(input())):\n Ans=0\n N,K=map(int,input().split())\n H=list(map(int,input().split()))\n for i in range(N):\n if i==0 and K<H[i]:\n Ans=Ans+(H[i]-1)//K\n elif K<H[i]-H[i-1] and i>0:\n Ans=Ans+(H[i]-H[i-1]-1)//K\n print(Ans)", "# cook your dish here\nfor _ in range(int(input())):\n n,k=list(map(int,input().split()))\n a=list(map(int,input().split()))\n c=0\n s=0\n for i in range(n):\n s+=(a[i]-c-1)//k\n c=a[i]\n print(s)", "for i in range(int(input())):\n a,b=list(map(int,input().split()))\n y=list(map(int,input().split()))\n s=0\n if y[0]>b:\n s+=y[0]//b\n if y[0]%b==0:\n s-=1\n for j in range(1,a):\n diff=y[j]-y[j-1]\n s+=(diff//b)\n if diff%b==0:\n s-=1\n print(s)", "for _ in range(int(input())):\n N, K = map(int, input().split())\n h = list(map(int, input().split()))\n h.insert(0,0)\n c = 0\n for i in range(1, N+1):\n c += (h[i] - h[i-1] - 1) // K\n print(c)", "for _ in range(int(input())):\n n,k=list(map(int,input().split()))\n a=list(map(int,input().split()))\n c=0\n s=0\n for i in range(n):\n s+=(a[i]-c-1)//k\n c=a[i]\n print(s)", "for _ in range(int(input())) :\n n, k= map(int, input().split())\n a = list(map(int, input().split()))\n sum = 0\n c = 0\n for i in range(n) :\n sum += (a[i] - c - 1) // k\n c = a[i]\n print(sum)", "t = int(input())\nfor _ in range(t):\n n,k = map(int,input().split())\n a = list(map(int,input().split()))\n c =0\n s = 0\n for i in range(n):\n if s+k < a[i]:\n while s+k < a[i]:\n s += k\n c += 1\n s = a[i]\n print(c)", "for i in range(int(input())):\n n,k=list(map(int,input().split()))\n arr=list(map(int,input().split()))\n a=0\n c=[]\n b=[]\n for i in range(n):\n m=arr[i]-a\n if(k>=m):\n pass\n else:\n \n\n if m%k==0:\n c.append(int(m/k)-1)\n\n else:\n b.append(int(m/k))\n \n a=arr[i]\n print(sum(c)+sum(b))\n\n\n\n\n", "# cook your dish here\nt=int(input())\nfor i in range(t):\n n,k=map(int,input().split())\n s=list(map(int,input().split()))\n curr=0\n count=0\n for i in range(n):\n count += (s[i]-curr-1)//k\n curr=s[i]\n print(count)", "from sys import stdin, stdout\nans = []\nfor _ in range(int(stdin.readline())):\n n, k = map(int, stdin.readline().split())\n s_h = list(map(int, stdin.readline().split()))\n num = (s_h[0] - 1) // k\n for i in range(1, n):\n num += (s_h[i] - s_h[i-1] - 1) // k\n ans.append(str(num))\nstdout.write('\\n'.join(ans))", "# cook your dish here\nt=int(input())\nfor i in range(t):\n n,k=map(int,input().split())\n s=list(map(int,input().split()))\n curr=0\n count=0\n for i in range(n):\n count += (s[i]-curr-1)//k\n curr=s[i]\n print(count)", "t=int(input())\nfor i in range(t):\n n,k=list(map(int,input().split(\" \")))\n arr=list(map(int,input().split(\" \")))\n arr.insert(0,0)\n count=0\n p=0\n q=0\n for i in range(len(arr)-1):\n if arr[i+1]-arr[i]<=k:\n pass\n elif arr[i+1]-arr[i]>k:\n p=arr[i+1]\n q=arr[i]\n while p-q>k:\n q=q+k\n count+=1\n print(count)\n"] | {"inputs": [["1", "4 3", "2 4 8 16"]], "outputs": [["3"]]} | INTERVIEW | PYTHON3 | CODECHEF | 7,054 | |
3de34409c413b0379eb5c4b06480cb04 | UNKNOWN | There are $X$ people participating in a quiz competition and their IDs have been numbered from $1$ to $X$ (both inclusive). Beth needs to form a team among these $X$ participants. She has been given an integer $Y$. She can choose participants whose ID numbers are divisible by $Y$.
Now that the team is formed, Beth wants to know the strength of her team. The strength of a team is the sum of all the last digits of the team members’ ID numbers.
Can you help Beth in finding the strength of her team?
-----Input:-----
- The first line of the input contains a single integer $T$ denoting the number of test cases. $T$ lines follow
- The first line of each test case contains $X$ and $Y$.
-----Output:-----
- For each test case print the strength of Beth's team
-----Constraints-----
- $1 \leq T \leq 1000$
- $1 \leq X,Y \leq 10^{20}$
-----Sample Input:-----
2
10 3
15 5
-----Sample Output:-----
18
10
-----EXPLANATION:-----
- Example case 1: ID numbers divisible by 3 are 3,6,9 and the sum of the last digits are 3+6+9=18 | ["for _ in range(int(input())):\r\n x, y = map(int, input().split())\r\n ans = 0\r\n for i in range(y, x+1, y):\r\n if i%y == 0:\r\n ans += i%10\r\n print(ans)", "lt = [[0, 0, 0, 0, 0, 0, 0, 0, 0 ,0],\n [1, 2, 3, 4, 5, 6, 7, 8, 9, 0],\n [2, 4, 6, 8, 0, 2, 4, 6, 8, 0],\n [3, 6, 9, 2, 5, 8, 1, 4, 7, 0],\n [4, 8, 2, 6, 0, 4, 8, 2, 6, 0],\n [5, 0, 5, 0, 5, 0, 5, 0, 5, 0],\n [6, 2, 8, 4, 0, 6, 2, 8, 4, 0],\n [7, 4, 1, 8, 5, 2, 9, 6, 3, 0],\n [8, 6, 4, 2, 0, 8, 6, 4, 2, 0],\n [9, 8, 7, 6, 5, 4, 3, 2, 1, 0]]\nfor _ in range(int(input().strip())):\n #print(\"==>>\")\n l = input().strip().split(\" \")\n #print(l)\n lst = int(l[1][-1])\n f = int(l[0]) // int(l[1])\n fd = f // 10\n fm = int(f % 10)\n #print(f, fd, fm)\n #print(sum(lt[lst]), sum(lt[lst][:fm])))\n t = sum(lt[lst]) * fd + sum(lt[lst][:fm])\n print(t)\n", "for _ in range(int(input())):\n X,Y=list(map(int,input().split()))\n su=0\n for i in range(1,X+1):\n if (Y*i)>X:\n break\n su+=(Y*i)%10\n print(su)\n", "# cook your dish here\nt=int(input())\nfor _ in range(t):\n x,y=list(map(int,input().split()))\n sum=0\n y1=y\n while y1<=x:\n sum+=y1%10\n y1+=y\n print(sum)\n\n \n \n", "for _ in range(int(input())):\n x,y=[int(x) for x in input().split()]\n if x<y:\n print(0)\n else: \n s=0\n for _ in range(y,x,y):\n s+=(_%10)\n print(s) \n # team1,team2,res=[],[],0\n # for _ in range(1,x+1):\n # if _%y==0:\n # team1.append(_)\n # else:\n # team2.append(_)\n # for _ in range(len(team1)):\n # res+=(team1[_]%10)\n # print(res) \n", "t=int(input())\nfor i in range(t):\n x,y=list(map(int,input().split()))\n sum=0\n for j in range(int(x/y)+1):\n sum=sum+(j*y)%10\n print(sum) \n", "for _ in range(int(input())):\r\n a,b=map(int,input().split())\r\n ans=0\r\n y=a//b\r\n x=b\r\n for i in range(y):\r\n x=x%10\r\n ans+=x\r\n x+=b\r\n print(ans)", "# cook your dish here\nsumm=[0,45,40,45,40,25,40,45,40,45,0]\narr=[ ]\n\nfor i in range(0,10):\n curr=[]\n for j in range(1,11):\n mul = i*j\n rem = mul%10\n curr.append(rem)\n arr.append(curr)\n\n# print(arr)\n\n\n\n\n\n\n\nfor _ in range(int(input())):\n num,n =(int(x) for x in input().split())\n count = (num//(n*10))\n ans = count *(summ[n%10])\n rem= (num-count*(n*10))//(n)\n # print(\"rem\",rem)\n c=0\n for i in range(rem):\n # print(arr[n%10][i])\n s=n%10\n # print(\"s\",s)\n c += arr[s][i]\n # print(arr[s][i])\n # print(ans,c)\n print(ans+c)\n", "n=int(input())\nwhile(n>0):\n n=n-1\n p,k=list(map(int,input().split()))\n sum=0\n i=k\n while(i<=p):\n sum=sum+(i%10)\n i=i+k\n print(sum)\n\n", "# cook your dish here\nfor t in range (int(input())):\n x, y = map(int, input().split())\n ans = 0\n for i in range (y, x + 1, y):\n ans += int(str(i)[-1])\n print(ans)", "for _ in range(int(input())):\r\n x, y = map(int, input().split())\r\n \r\n strength = 0\r\n for i in range(y,x+1,y):\r\n strength += (i%10)\r\n \r\n print(strength)", "# cook your dish here\nt=int(input())\nfor i in range(0,t):\n x,y=map(int, input().split())\n s=0\n b=[]\n for j in range(1,10):\n b.append((y*j)%10)\n if(x//y)<10:\n for j in range(0,x//y):\n s+=b[j]\n else:\n s+=((x//y)//10)*sum(b)\n for j in range(0,(x//y)%10):\n s+=b[j]\n print(s)", "# cook your dish here\nt=int(input())\nwhile(t!=0):\n x,y=map(int,input().split())\n s=0\n i=1\n while(i!=-1):\n q=y*i\n if q<10:\n s+=q\n #print(s,q)\n else:\n s+=(q%10)\n i+=1\n if i*y>x:\n i=-1\n \n #for i in range(y,x+1):\n #if (i%y == 0):\n #if i>=10:\n #s+=(i%10)\n #if i<10:\n #s=s+i\n print(s)\n t-=1", "# cook your dish here\nt=int(input())\nwhile(t!=0):\n x,y=map(int,input().split())\n s=0\n i=1\n while(i!=-1):\n q=y*i\n if q<10:\n s+=q\n #print(s,q)\n else:\n s+=(q%10)\n i+=1\n if i*y>x:\n i=-1\n \n #for i in range(y,x+1):\n #if (i%y == 0):\n #if i>=10:\n #s+=(i%10)\n #if i<10:\n #s=s+i\n print(s)\n t-=1", "# cook your dish here\nt=int(input())\nwhile(t!=0):\n x,y=map(int,input().split())\n s=0\n i=1\n while(i!=-1):\n q=y*i\n if q<10:\n s+=q\n #print(s,q)\n else:\n s+=(q%10)\n i+=1\n if i*y>x:\n i=-1\n \n #for i in range(y,x+1):\n #if (i%y == 0):\n #if i>=10:\n #s+=(i%10)\n #if i<10:\n #s=s+i\n print(s)\n t-=1", "# cook your dish here\nt = int(input())\nwhile t>0:\n x,y = map(int, input().split())\n sum1 = 0\n for i in range(y, x+1, y):\n sum1+=int(str(i)[-1])\n print(sum1)\n t-=1", "# cook your dish here\nt = int(input())\nwhile(t>0):\n x,y = map(int,input().split())\n res=1\n i=1\n strength=0\n while((y*i)<=x):\n res = y*i\n strength += (res%10)\n \n i+=1\n print(strength)\n t-=1", "t=int(input())\nfor i in range(t):\n x,y= list(map(int, input().split()))\n m=x//y\n sum1=0\n l=[]\n for i in range(1,m+1):\n n=y*i\n l.append(n)\n for i in range(len(l)):\n q=l[i]%10\n sum1=sum1+q\n print(sum1) \n", "def sumOfLastDig(n, m) : \r\n sum = 0; \r\n k = n // m; \r\n arr = [0] * 10; \r\n for i in range(10) : \r\n arr[i] = m * (i + 1) % 10; \r\n sum += arr[i]; \r\n rem = k % 10; \r\n ans = (k // 10) * sum; \r\n for i in range(rem) : \r\n ans += arr[i]; \r\n return ans; \r\n\r\ndef __starting_point(): \r\n for i in range(int(input())):\r\n m,n = list(map(int,input().strip().split()))\r\n print((sumOfLastDig(m,n))); \r\n \r\n\n__starting_point()", "for _ in range(int(input())):\r\n x,y=map(int,input().split())\r\n l=[]\r\n s=0\r\n y1=y\r\n i=1\r\n while(y1*i<=x):\r\n l.append(str(y1*i))\r\n i+=1\r\n for i in l:\r\n s+=int(i[-1])\r\n print(s)", "def sumOfLastDig(n, m) : \r\n sum = 0; \r\n k = n // m; \r\n arr = [0] * 10; \r\n for i in range(10) : \r\n arr[i] = m * (i + 1) % 10; \r\n sum += arr[i]; \r\n rem = k % 10; \r\n ans = (k // 10) * sum; \r\n for i in range(rem) : \r\n ans += arr[i]; \r\n return ans; \r\n\r\ndef __starting_point(): \r\n for i in range(int(input())):\r\n m,n = list(map(int,input().strip().split()))\r\n print((sumOfLastDig(m,n))); \r\n \r\n\n__starting_point()", "def sumOfLastDig(n, m) : \r\n sum = 0; \r\n k = n // m; \r\n arr = [0] * 10; \r\n for i in range(10) : \r\n arr[i] = m * (i + 1) % 10; \r\n sum += arr[i]; \r\n rem = k % 10; \r\n ans = (k // 10) * sum; \r\n for i in range(rem) : \r\n ans += arr[i]; \r\n return ans; \r\n\r\ndef __starting_point(): \r\n for i in range(int(input())):\r\n m,n = list(map(int,input().strip().split()))\r\n print((sumOfLastDig(m,n))); \r\n \r\n\n__starting_point()", "''' PROBLEM A '''\r\n\r\n\r\n \r\n\r\n''' PROBLEM B '''\r\n\r\n\r\n\r\n''' PROBLEM C '''\r\n\r\n\r\n\r\n\r\n''' PROBLEM D '''\r\n\r\n\r\nn=int(input())\r\nfor i in range(0,n):\r\n p=input().rstrip().split(' ')\r\n # print(int(p[0]) * int(p[1]))\r\n A=int(p[0])\r\n B=int(p[1])\r\n C=A//B;\r\n L=[]\r\n if C<=10:\r\n M=1;\r\n ans = 0;\r\n while(C):\r\n W=list(str(B*M))\r\n M+=1;\r\n ans+=int(W[len(W)-1])\r\n C-=1;\r\n print(ans);\r\n else:\r\n M=1;\r\n L=[]\r\n ans = 0;\r\n for j in range(0,10):\r\n W=list(str(B*M));\r\n M+=1;\r\n L.append(int(W[len(W)-1]))\r\n ans+=int(W[len(W)-1])\r\n D=C//10;\r\n E=C%10;\r\n tot=ans*D;\r\n for j in range(0,E):\r\n tot+=L[j];\r\n print(tot)", "T = int(input())\nwhile(T):\n xy = [int(x) for x in input().split()]\n st = 0\n n = xy[0] //xy[1]\n for i in range(1,n+1):\n st+=int(str(i*xy[1])[-1])\n print(st)\n T =T-1", "# cook your dish here\nt=int(input())\nwhile t>0:\n n,m=list(map(int,input().split()))\n p=n//m\n m%=10\n q=(2*m)%10\n r=1\n sm=m\n while q!=m:\n sm+=q\n q+=m\n q%=10\n r+=1\n sm*=(p//r)\n p%=r\n q=m\n while p>0:\n sm+=q\n q+=m;\n q%=10\n p-=1\n print(sm)\n t-=1\n"] | {"inputs": [["2", "10 3", "15 5"]], "outputs": [["18", "10"]]} | INTERVIEW | PYTHON3 | CODECHEF | 9,207 | |
194cee621d87b2ef3c01cc8e81a290b6 | UNKNOWN | Tracy loves Donuts. She purchased a lots of Donuts for her birthday party. She learnt to calculate the area of the circle a few days back and she is fascinated to know the area of the donuts as well !! Help her finding the area of the Donuts…..
-----Input:-----
- First line will contain, number of testcases. Then the testcases follow.
- Each testcase contains of a single line of input, where in you have to provide the RADIUS of the Donuts.
-----Output:-----
For each testcase, output in a single line answer is the AREA of the Donut.
-----Constraints-----
1 <= Radius <= 20.
-----Sample Input:-----
2
5
12
-----Sample Output:-----
78.5
452.16 | ["oo = int(input())\r\nfor i in range(oo):\r\n\tval = int(input())\r\n\tprint((val**2)*3.14)", "for _ in range(int(input())):\n n=int(input())\n print((n*n)*3.14)", "# cook your dish here\nimport math\nfor _ in range(int(input())):\n r=int(input())\n if r>=1 and r<=20:\n print(3.14*(r**2))", "# cook your dish here\nimport math\nfor _ in range(int(input())):\n r=int(input())\n if r>=1 and r<=20:\n print(3.14*(r**2))", "# cook your dish here\nimport math\nfor _ in range(int(input())):\n r=int(input())\n if r>=1 and r<=20:\n print(3.14*(r**2))", "# cook your dish here\nimport math\nfor _ in range(int(input())):\n r=int(input())\n if r>=1 and r<=20:\n print(3.14*(r**2))", "number_of_test_cases = int(input())\n\nfor i in range(0,number_of_test_cases):\n radius = int(input())\n area = 3.14 * radius * radius\n print(round(area,2))", "# cook your dish here\ntest=int(input())\nwhile test:\n r=int(input())\n print(round(3.14*r*r,2))\n test-=1", "t=int(input())\r\nwhile(t>0):\r\n\tn=int(input())\r\n\tprint(n*n*3.14)\r\n\tt-=1", "# cook your dish here\nfor i in range(int(input())):\n print(pow(int(input()),2)*3.14)", "t=int(input())\nwhile(t):\n r=int(input())\n print(3.14*r*r)\n t-=1", "# cook your dish here\nPI = 3.14\nt = int(input())\nfor x in range(t):\n r = int(input())\n print(PI * r ** 2)", "# cook your dish here\nn = int(input())\nfor i in range(n):\n r = int(input())\n print(3.14*r*r)", "t=int(input())\nwhile(t):\n r=int(input())\n print(3.14*r*r)\n t-=1", "t= int(input())\nfor i in range(t): \n\tr= float(input())\n\tprint(3.14*(r**2))", "# cook your dish here\nn=int(input())\nfor i in range(n):\n r=int(input())\n print(3.14*(r**2))", "for _ in range(int(input())):\n\tprint(int(input())**2*3.14)", "N=int(input())\r\nwhile(N>0):\r\n N=N-1\r\n i=int(input())\r\n a=3.14*(i*i)\r\n print(a)\r\n", "# cook your dish here\nfor t in range(int(input())):\n r=int(input())\n area=3.14*(r**2)\n print(area)\n \n", "for _ in range(int(input())):\r\n x=int(input())\r\n print(3.14 * x ** 2)\r\n\r\n", "# cook your dish here\nt=int(input())\nfor _ in range(t):\n n=int(input())\n print(3.14*n*n)\n", "# cook your dish here\nfor _ in range(int(input())):\n n=int(input())\n print(n*n*3.14)", "try:\n t=int(input())\n while t!=0:\n r=int(input())\n area=3.14*r*r\n print(area)\n t=t-1\nexcept:\n pass"] | {"inputs": [["2", "5", "12"]], "outputs": [["78.5", "452.16"]]} | INTERVIEW | PYTHON3 | CODECHEF | 2,510 | |
6d625fc00525283e8ddb454963082a3e | UNKNOWN | Given an array $A_1, A_2, ..., A_N$, count the number of subarrays of array $A$ which are non-decreasing.
A subarray $A[i, j]$, where $1 ≤ i ≤ j ≤ N$ is a sequence of integers $A_i, A_i+1, ..., A_j$.
A subarray $A[i, j]$ is non-decreasing if $A_i ≤ A_i+1 ≤ A_i+2 ≤ ... ≤ A_j$. You have to count the total number of such subarrays.
-----Input-----
-
The first line of 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 size of array.
-
The second line contains $N$ space-separated integers $A_1$, $A_2$, …, $A_N$ denoting the elements of the array.
-----Output-----
For each test case, output in a single line the required answer.
-----Constraints-----
- $1 ≤ T ≤ 5$
- $1 ≤ N ≤ 10^5$
- $1 ≤ A_i ≤ 10^9$
-----Subtasks-----
- Subtask 1 (20 points) : $1 ≤ N ≤ 100$
- Subtask 2 (30 points) : $1 ≤ N ≤ 1000$
- Subtask 3 (50 points) : Original constraints
-----Sample Input:-----
2
4
1 4 2 3
1
5
-----Sample Output:-----
6
1
-----Explanation-----
Example case 1.
All valid subarrays are $A[1, 1], A[1, 2], A[2, 2], A[3, 3], A[3, 4], A[4, 4]$.
Note that singleton subarrays are identically non-decreasing.
Example case 2.
Only single subarray $A[1, 1]$ is non-decreasing. | ["# cook your dish here\nt=int(input())\nfor i in range(t):\n n=int(input())\n ar=list(map(int,input().split()))\n tot=0\n st=0\n for j in range(1,n):\n if(ar[j-1]>ar[j]):\n si=j-st\n c=(si*(si+1))//2\n tot+=c\n st=j\n si=n-st\n c=(si*(si+1))//2\n tot+=c\n print(tot)\n", "# cook your dish here\nfor _ in range (int(input())):\n a=int(input())\n lst=list(map(int,input().split()))\n dp=[1]*a\n count=1\n for i in range(a-2,-1,-1):\n if lst[i]<=lst[i+1]:\n dp[i]=dp[i+1]+1\n count+=dp[i]\n print(count)", "# cook your dish here\nt=int(input())\nfor _ in range (t):\n a=int(input())\n lst=list(map(int,input().split()))\n dp=[1]*a\n count=1\n for i in range(a-2,-1,-1):\n if lst[i]<=lst[i+1]:\n dp[i]=dp[i+1]+1\n count+=dp[i]\n print(count)", "t=int(input())\nfor _ in range (t):\n a=int(input())\n lst=list(map(int,input().split()))\n dp=[1]*a\n count=1\n for i in range(a-2,-1,-1):\n if lst[i]<=lst[i+1]:\n dp[i]=dp[i+1]+1\n count+=dp[i]\n print(count)# cook your dish here", "t = int(input())\nfor i in range(t):\n N = int(input())\n st = input().split()\n L = []\n for x in st:\n L.append(int(x))\n n = 1\n cnt = 1\n for p in range(1,N):\n if L[p] < L[p-1]:\n n += 1\n cnt = 1\n else:\n cnt += 1\n n += cnt\n p += 1\n print(n)\n\n", "t=int(input())\nfor _ in range (t):\n a=int(input())\n lst=list(map(int,input().split()))\n dp=[1]*a\n count=1\n for i in range(a-2,-1,-1):\n if lst[i]<=lst[i+1]:\n dp[i]=dp[i+1]+1\n count+=dp[i]\n print(count)\n", "for _ in range(int(input())):\n a=int(input())\n lst=list(map(int,input().split()))\n dp=[1]*a\n count=1\n for i in range(a-2,-1,-1):\n if lst[i]<=lst[i+1]:\n dp[i]=dp[i+1]+1\n count+=dp[i]\n print(count)", "for _ in range(int(input())):\n n=int(input())\n a=list(map(int,input().split()))\n c=1\n m=[]\n for i in range(n-1):\n if a[i]<=a[i+1]:\n c+=1\n else:\n m.append(c)\n c=1\n if c!=0:\n m.append(c)\n z=n \n for i in m:\n z+=i*(i-1)//2\n print(z) ", "import math\nfor _ in range(int(input())):\n n=int(input())\n a=list(map(int,input().split()))\n c=1\n m=[]\n for i in range(n-1):\n if a[i]<=a[i+1]:\n c+=1\n else:\n m.append(c)\n c=1\n if c!=0:\n m.append(c)\n z=n\n for i in m:\n z+=i*(i-1)//2\n print(z)\n", "# cook your dish here\nt=int(input())\nfor ts in range(t):\n n=int(input())\n l=list(map(int,input().split()))\n m=[1]*n\n for i in range(n-1):\n if l[i]<=l[i+1]:\n m[i+1]=m[i]+1\n print(sum(m))", "# cook your dish here\nt=int(input())\nfor ts in range(t):\n n=int(input())\n l=list(map(int,input().split()))\n m=[1]*n\n for i in range(n-1):\n if l[i]<=l[i+1]:\n m[i+1]=m[i]+1\n print(sum(m))", "t=int(input())\nfor _ in range(t):\n n=int(input())\n l=list(map(int,input().split()))\n c=[1]*n\n for i in range(n-1):\n if l[i]<=l[i+1]:\n c[i+1]=c[i]+1\n print(sum(c))\n\n", "# cook your dish here\nx=int(input())\nfor i in range(x):\n y=int(input())\n l=list(map(int,input().split()))\n c=[1]*y\n for j in range(y-1):\n if l[j]<=l[j+1]:\n c[j+1]=c[j]+1\n print(sum(c))", "# cook your dish here\nt=int(input())\nfor _ in range(t):\n n=int(input())\n l=list(map(int,input().split()))\n c=[1]*n\n for i in range(n-1):\n if l[i]<=l[i+1]:\n c[i+1]=c[i]+1\n print(sum(c))", "import sys\n\ndef iinput(): return int(sys.stdin.readline().strip())\n#def rinput(): return map(int, sys.stdin.readline().strip().split()) \ndef get_list(): return list(map(int, sys.stdin.readline().strip().split())) \n\n\nfor _ in range(iinput()):\n n=iinput()\n c=0\n t=get_list()\n l=[1]*n\n for i in range(1,n):\n if(t[i-1]<=t[i]):\n l[i]+=l[i-1]\n #print(l)\n print(sum(l))\n", "for _ in range(int(input())):\n n=int(input())\n num=list(map(int,input().split()))\n k=[1]*n\n for i in range(n-1):\n if num[i]<=num[i+1]:\n k[i+1]=k[i]+1\n print(sum(k))", "for _ in range(int(input())):\n n=int(input())\n num=list(map(int,input().split()))\n k=[1]*n\n for i in range(n-1):\n if num[i]<=num[i+1]:\n k[i+1]=k[i]+1\n print(sum(k))", "# cook your dish here\nfor _ in range(int(input())):\n n=int(input())\n x=list(map(int,input().split()))\n cnt=0\n for i in range(0,n):\n for j in range(i,n):\n s=x[i:j+1]\n t=x[i:j+1]\n s.sort()\n if(s==t):\n cnt=cnt+1\n print(cnt)", "# cook your dish here\nfor i in range(int(input())):\n a=int(input())\n l=list(map(int,input().split()))\n s,r=0,1\n for i in range(a-1):\n if l[i]<=l[i+1]:\n s+=r+1\n r+=1\n else:\n r=1\n s+=1\n print(s+1)\n", "# cook your dish here\nfor i in range(int(input())):\n n=int(input())\n l=[int(x) for x in input().split()]\n count=0\n sumv=0\n for i in range(n):\n count+=1\n if i!=n-1 and l[i]>l[i+1]:\n sumv+=int(((count+1)*count)/2)\n count=0\n sumv+=int(((count+1)*count)/2)\n print(sumv)", "# cook your dish here\nfor i in range(int(input())):\n a=int(input())\n l=list(map(int,input().split()))\n s,r=0,1\n for i in range(a-1):\n if l[i]<=l[i+1]:\n s+=r+1\n r+=1\n else:\n r=1\n s+=1\n print(s+1)"] | {"inputs": [["2", "4", "1 4 2 3", "1", "5"]], "outputs": [["6", "1"]]} | INTERVIEW | PYTHON3 | CODECHEF | 4,937 | |
1f6662d8b25e115d0d9bcad31c772276 | UNKNOWN | As we all know, Chef is cooking string for long days, his new discovery on string is the longest common pattern length. The longest common pattern length between two strings is the maximum number of characters that both strings have in common. Characters are case sensitive, that is, lower case and upper case characters are considered as different. Note that characters can repeat in a string and a character might have one or more occurrence in common between two strings. For example, if Chef has two strings A = "Codechef" and B = "elfedcc", then the longest common pattern length of A and B is 5 (common characters are c, d, e, e, f).
Chef wants to test you with the problem described above. He will give you two strings of Latin alphabets and digits, return him the longest common pattern length.
-----Input-----
The first line of the input contains an integer T, denoting the number of test cases. Then the description of T test cases follows.
The first line of each test case contains a string A. The next line contains another character string B.
-----Output-----
For each test case, output a single line containing a single integer, the longest common pattern length between A and B.
-----Constraints-----
- 1 ≤ T ≤ 100
- 1 ≤ |A|, |B| ≤ 10000 (104), where |S| denotes the length of the string S
- Both of A and B can contain only alphabet characters (both lower and upper case) and digits
-----Example-----
Input:
4
abcd
xyz
abcd
bcda
aabc
acaa
Codechef
elfedcc
Output:
0
4
3
5
-----Explanation-----
Example case 1. There is no common character.
Example case 2. All the characters are same.
Example case 3. Three characters (a, a and c) are same.
Example case 4. This sample is mentioned by the statement. | ["from collections import Counter\r\ndef solve(A,B):\r\n a = Counter(A)\r\n b = Counter(B)\r\n ans = 0\r\n for i in a:\r\n if i in b:\r\n ans += min(a[i],b[i])\r\n \r\n return ans\r\n \r\n \r\nt = int(input())\r\n\r\nfor _ in range(t):\r\n A = input()\r\n B = input()\r\n print(solve(A,B))", "# cook your dish here\n\nt = 0\ntry:\n t= int(input())\nexcept:\n pass\nfor _ in range(t):\n a = input()\n b = input()\n \n a = ''.join(sorted(a))\n b = ''.join(sorted(b))\n \n count = 0\n for b_character in b:\n if b_character in a:\n i = a.find(b_character)\n a = a[:i] + a[i+1:]\n count+=1\n \n print(count)\n ", "from sys import stdin as sin\ndef aint():return int(input())\ndef amap():return map(int,sin.readline().split())\ndef alist():return list(map(int,sin.readline().split()))\ndef astr():return input()\n\nfrom collections import Counter as cc\n\nfor _ in range(int(input())):\n a=input()\n b=input()\n d1=cc(a)\n d2=cc(b)\n m=0\n for i in d1:\n m+=min(d1[i],d2[i])\n print(m)", "T = int(input())\nans = []\n\nfor _ in range(T):\n A = input()\n B = input()\n\n acount = {}\n bcount = {}\n for i in A:\n acount[i] = acount.get(i,0)+1\n for i in B:\n bcount[i] = bcount.get(i,0)+1\n\n count = 0\n for i in acount.keys():\n if(i in bcount):\n count += min(acount[i],bcount[i])\n ans.append(count)\n\nfor i in ans:\n print(i)", "from collections import *\r\nfor _ in range(int(input())):\r\n str1 = input()\r\n str2 = input()\r\n x = Counter(str1)\r\n y = Counter(str2)\r\n count = 0\r\n for i in x:\r\n count+=min(x[i],y[i])\r\n print(count)\r\n", "from math import ceil\nfor _ in range(int(input())):\n\ta=list(input())\n\tb=list(input())\n\tn=len(a)\n\tm=len(b)\n\ta.sort()\n\tb.sort()\n\ti=j=c=0\n\twhile(True):\n\t\tif ord(a[i])<ord(b[j]):\n\t\t\ti+=1\n\t\telif ord(a[i])>ord(b[j]):\n\t\t\tj+=1\n\t\telse:\n\t\t\tc+=1\n\t\t\ti+=1\n\t\t\tj+=1\n\t\tif i==n or j==m:\n\t\t\tbreak\n\tprint(c)\n\t\t\n", "# cook your dish here\nt = int(input())\nwhile t>0:\n a = input()\n b = input()\n ans = 0\n for i in a:\n if i in b:\n ans+=1\n b = b.replace(i,'',1)\n print(ans)\n t-=1", "# cook your dish here\nfor _ in range(int(input())):\n a=input()\n b=input()\n d=dict()\n ct=0\n for i in a:\n if i in d.keys():\n d[i]+=1\n else:\n d[i]=1\n for j in b:\n if j in d.keys():\n if d[j]!=0:\n d[j]-=1\n ct+=1\n print(ct)", "from collections import Counter\nt=int(input())\nfor i in range(t):\n a=input()\n b=input()\n print(len(a) - sum((Counter(a) - Counter(b)).values()))", "from collections import Counter\r\nfor _ in range(int(input())):\r\n s1 = input();s2 = input()\r\n c1 = Counter(s1);c2 = Counter(s2)\r\n ans = 0\r\n se = set(s1).union(set(s2))\r\n for i in se:\r\n ans+= min(c1[i],c2[i])\r\n print(ans)\r\n\r\n", "from collections import Counter\nfor _ in range(int(input())):\n a=input()\n b=input()\n a1=Counter(a) \n b1=Counter(b) \n c=a1&b1 \n if len(c) == 0: \n print(0)\n else:\n d=list(c.elements()) \n print(len(d)) ", "# cook your dish here\nfor _ in range(int(input())):\n a,b=input(),input()\n l=0\n for x in set(a)&set(b):\n l+=min(a.count(x),b.count(x))\n print(l)", "n = int(input())\nb = 0\nli = []\nfor i in range(n):\n g = input()\n h = input()\n for z in g:\n if z in li:\n continue\n li.append(z)\n if h.count(z) == 0:\n continue\n elif h.count(z) == g.count(z):\n b += h.count(z)\n elif h.count(z) != g.count(z):\n b += min(h.count(z), g.count(z))\n print(b)\n b = 0\n li.clear()\n\n", "t = int(input())\nans = []\nwhile t > 0:\n dic_a = {}\n dic_b = {}\n a = input()\n b = input()\n common = 0\n for letter in a:\n if letter in dic_a:\n dic_a[letter]+=1\n else:\n dic_a[letter]=1\n for letter in b:\n if letter in dic_b:\n dic_b[letter]+=1\n else:\n dic_b[letter]=1\n if len(a) > len(b):\n for key in dic_a:\n if key in dic_b:\n common+=min(dic_a[key],dic_b[key])\n else:\n for key in dic_b:\n if key in dic_a:\n common+=min(dic_a[key],dic_b[key])\n ans.append(common)\n t-=1\nfor an in ans:\n print(an)\n", "t = int(input())\r\nans = []\r\nwhile t > 0:\r\n dic_a = {}\r\n dic_b = {}\r\n a = input()\r\n b = input()\r\n common = 0\r\n for letter in a:\r\n if letter in dic_a:\r\n dic_a[letter]+=1\r\n else:\r\n dic_a[letter]=1\r\n for letter in b:\r\n if letter in dic_b:\r\n dic_b[letter]+=1\r\n else:\r\n dic_b[letter]=1\r\n if len(a) > len(b):\r\n for key in dic_a:\r\n if key in dic_b:\r\n common+=min(dic_a[key],dic_b[key])\r\n else:\r\n for key in dic_b:\r\n if key in dic_a:\r\n common+=min(dic_a[key],dic_b[key])\r\n ans.append(common)\r\n t-=1\r\nfor an in ans:\r\n print(an)\r\n", "# cook your dish here\nfrom sys import stdin\nfrom collections import defaultdict\ninput=lambda:stdin.readline().strip()\nfor _ in range(int(input())):\n a=input()\n b=input()\n dict1=defaultdict(int)\n dict2=defaultdict(int)\n for i in a:\n dict1[i]+=1\n for i in b:\n dict2[i]+=1\n sum1=0\n for i in dict1:\n min1=min([dict1[i],dict2[i]])\n sum1=sum1+min1\n print(sum1)\n \n", "# cook your dish here\nt=int(input())\nfor h in range(t):\n a=input()\n b=input()\n aset=set(a)\n \n c=0\n for i in aset:\n if i in b:\n c=c+min(a.count(i),b.count(i))\n print(c)\n ", "# cook your dish here\nfrom sys import stdin, stdout\n\ntry:\n t = eval(stdin.readline())\n for _ in range(t):\n s1 = str(input())\n s2 = str(input())\n \n Dict1 = {'a': 0, 'b':0, 'c':0, 'd':0, 'e':0, 'f':0, 'g':0, 'h':0, 'i':0,\n 'j':0, 'k':0, 'l':0, 'm':0, 'n':0, 'o':0, 'p':0, 'q':0, 'r':0, 's':0, 't':0,\n 'u':0, 'v':0, 'w':0 , 'x':0, 'y':0, 'z':0, 'A': 0, 'B':0, 'C':0, 'D':0, 'E':0, 'F':0, 'G':0, 'H':0, 'I':0,\n 'J':0, 'K':0, 'L':0, 'M':0, 'N':0, 'O':0, 'P':0, 'Q':0, 'R':0, 'S':0, 'T':0,\n 'U':0, 'V':0, 'W':0 , 'X':0, 'Y':0, 'Z':0,'1':0, '2':0, '3':0, '4':0, '5':0, '6':0, '7':0, '8':0, '9':0, '0':0 }\n Dict2 = {'a': 0, 'b':0, 'c':0, 'd':0, 'e':0, 'f':0, 'g':0, 'h':0, 'i':0,\n 'j':0, 'k':0, 'l':0, 'm':0, 'n':0, 'o':0, 'p':0, 'q':0, 'r':0, 's':0, 't':0,\n 'u':0, 'v':0, 'w':0 , 'x':0, 'y':0, 'z':0, 'A': 0, 'B':0, 'C':0, 'D':0, 'E':0, 'F':0, 'G':0, 'H':0, 'I':0,\n 'J':0, 'K':0, 'L':0, 'M':0, 'N':0, 'O':0, 'P':0, 'Q':0, 'R':0, 'S':0, 'T':0,\n 'U':0, 'V':0, 'W':0 , 'X':0, 'Y':0, 'Z':0, '1':0, '2':0, '3':0, '4':0, '5':0, '6':0, '7':0, '8':0, '9':0, '0':0 }\n \n answer = 0\n \n for i in range(len(s1)):\n Dict1[s1[i]] += 1\n \n for i in range(len(s2)):\n Dict2[s2[i]] += 1\n \n freqA = list(Dict1.values())\n freqB = list(Dict2.values())\n\n for j in range(len(Dict1)):\n answer += min(freqA[j], freqB[j])\n \n stdout.write(str(answer) + '\\n') \n \n \nexcept: pass", "test = int(input())\nfor _ in range(test):\n string1=input().strip()\n string2=input().strip()\n hashMap1={}\n hashMap2={}\n for i in string1:\n if i in hashMap1:\n hashMap1[i]+=1\n else:\n hashMap1[i]=1\n \n for i in string2:\n if i in hashMap2:\n hashMap2[i]+=1\n else:\n hashMap2[i]=1\n \n total=0\n for i in hashMap2:\n if i in hashMap1:\n total = total + min(hashMap1[i], hashMap2[i])\n print(total)\n ", "a=int(input())\r\n# list(map(int,input().split()))\r\nfor _ in range(a):\r\n b=input()\r\n b1=set(b)\r\n c=input()\r\n s=0\r\n for i in b1:\r\n if i in c:\r\n s+=min(b.count(i),c.count(i))\r\n print(s)", "def soln():\n\ta=input()\n\tb=input()\n\ta1=set(a)\n\tc=0\n\tfor i in a1:\n\t\tif i in b:\n\t\t\tc+=min(a.count(i),b.count(i))\n\n\tprint(c)\n\n\n\ndef main():\n\tt=int(input())\n\twhile t>0:\n\t\tt=t-1\n\t\tsoln()\n\n\ndef __starting_point():\n\tmain()\n\n__starting_point()"] | {"inputs": [["4", "abcd", "xyz", "abcd", "bcda", "aabc", "acaa", "Codechef", "elfedcc", "", ""]], "outputs": [["0", "4", "3", "5"]]} | INTERVIEW | PYTHON3 | CODECHEF | 8,871 | |
4aaa23baed2907aba3b4cef8614b4f35 | UNKNOWN | It's year 2018 and it's Christmas time! Before going for vacations, students of Hogwarts School of Witchcraft and Wizardry had their end semester exams.
$N$ students attended the semester exam. Once the exam was over, their results were displayed as either "Pass" or "Fail" behind their magic jacket which they wore. A student cannot see his/her result but can see everyone else's results. Each of $N$ students count the number of passed students they can see.
Given the number of "Pass" verdicts that each of the $N$ students counted, we have to figure out conclusively, the number of students who failed, or report that there is some inconsistency or that we cannot be sure.
-----Input:-----
- First line will contain $T$, number of testcases. Then the testcases follow.
- The first line of each test case will contain $N$, representing the number of students who attended the exam.
- Next line contains $N$ spaced integers representing the number of "Pass" counted by each of the $N$ students.
-----Output:-----
- For each test case, output the answer in a single line.
- If the counts reported by the students are not consistent with each other or if it's not possible to predict the number of failed students from the given input, then print -1.
-----Constraints-----
- $1 \leq T \leq 50$
- $1 \leq N \leq 10^{5}$
- $0 \leq$ Count given by each Student $\leq 10^{5}$
-----Sample Input:-----
1
4
3 2 2 2
-----Sample Output:-----
1
-----EXPLANATION:-----
There are 4 students, and they counted the number of passed students as 3,2,2,2. The first student can see that all others have passed, and all other students can see only 2 students who have passed. Hence, the first student must have failed, and others have all passed. Hence, the answer is 1. | ["for _ in range(int(input())):\n n = int(input())\n a = list(map(int, input().split()))\n s = set(a)\n\n if n == 1 or len(s) > 2:\n print(-1)\n continue\n\n if len(s) == 1:\n x = s.pop()\n\n if x == 0:\n print(n)\n elif x == n-1:\n print(0)\n else:\n print(-1)\n\n continue\n\n x, y = sorted(s)\n xc, yc = a.count(x), a.count(y)\n\n if xc == y and xc == x + 1:\n print(yc)\n else:\n print(-1)\n", "for _ in range(int(input())):\n n = int(input())\n a = list(map(int, input().split()))\n s = set(a)\n\n if n == 1 or len(s) > 2:\n print(-1)\n continue\n\n if len(s) == 1:\n x = s.pop()\n\n if x == 0:\n print(n)\n elif x == n-1:\n print(0)\n else:\n print(-1)\n\n continue\n\n x, y = sorted(s)\n xc, yc = a.count(x), a.count(y)\n\n if xc == y:\n print(yc)\n else:\n print(-1)\n", "# cook your dish here\nfor _ in range(int(input())):\n n=int(input());l=[int(i) for i in input().split()]\n if n==1:print(-1);continue\n if len(set(l))==1:\n if l[0]==0:print(n)\n elif l[0]==n-1:print(0)\n else:print(-1)\n continue\n if len(set(l))>2 or max(l)-min(l)>1:print(-1);continue\n a,b = l.count(min(l)),l.count(max(l))\n print(b) if max(l)==a else print(-1)", "for _ in range(int(input())):\n n=int(input());l=[int(i) for i in input().split()]\n if n==1:print(-1);continue\n if len(set(l))==1:\n if l[0]==0:print(n)\n elif l[0]==n-1:print(0)\n else:print(-1)\n continue\n if len(set(l))>2 or max(l)-min(l)>1:print(-1);continue\n a,b = l.count(min(l)),l.count(max(l))\n print(b) if max(l)==a else print(-1) ", "for _ in range(int(input())):\n n=int(input())\n l=[int(i) for i in input().split()]\n if n==1:\n print(-1)\n continue\n if len(set(l))==1:\n if l[0]==0:\n print(n)\n elif l[0]==n-1:\n print(0)\n else:\n print(-1)\n continue\n if len(set(l))>2 or max(l)-min(l)>1:\n print(-1)\n continue\n # print(l.count(max(l)))\n a=l.count(min(l))\n b=l.count(max(l))\n if max(l)==a:\n print(b)\n else:\n print(-1)", "# cook your dish here\n\n\nfor _ in range(int(input())):\n n=int(input())\n l=[int(i) for i in input().split()]\n if n==1:\n print(-1)\n continue\n if len(set(l))==1:\n if l[0]==0:\n print(n)\n elif l[0]==n-1:\n print(0)\n else:\n print(-1)\n continue\n if len(set(l))>2 or max(l)-min(l)>1:\n print(-1)\n continue\n # print(l.count(max(l)))\n a=l.count(min(l))\n b=l.count(max(l))\n if max(l)==a:\n print(b)\n else:\n print(-1)\n", "for _ in range(int(input())):\n n=int(input())\n a=list(map(int,input().split()))\n d={}\n for i in a:\n d[i]=d.get(i,0)+1\n if len(d)>2:\n print(-1)\n elif len(d)==1:\n for i in d:\n if i==n-1and d[i]==n:\n print(0)\n elif i==0 and d[i]==n:\n print(n)\n else:\n print(-1)\n else:\n k=max(d.keys())\n if d.get(k-1,0)==k and d[k]==n-k:\n print(n-k)\n else:\n print(-1)", "for _ in range(int(input())):\n n=int(input())\n l=[int(i) for i in input().split()]\n if n==1:\n print(-1)\n continue \n if len(set(l))==1:\n if l[0]==0:\n print(n)\n elif l[0]==n-1:\n print(0)\n else:\n print(-1)\n continue \n if len(set(l))>2 or max(l)-min(l)>1:\n print(-1)\n continue \n # print(l.count(max(l)))\n a=l.count(min(l))\n b=l.count(max(l))\n if max(l)==a:\n print(b)\n else:\n print(-1)", "t=int(input())\nfor o in range(t):\n n=int(input())\n a=list(map(int,input().split()))\n b=list(set(a))\n b.sort()\n if(n==1):\n print(-1)\n continue\n if(len(b)>2):\n print(-1)\n continue\n if(len(b)==1):\n if(b[0]==(n-1)):\n print(0)\n elif(b[0]==0):\n print(n)\n else:\n print(-1)\n continue\n pa=a.count(b[0])\n fa=a.count(b[1])\n if(pa!=b[1] or b[1]-b[0] != 1):\n print(-1)\n continue\n print(n-pa)", "t=int(input())\nfor _ in range(t):\n n=int(input())\n it=list(map(int,input().split()))\n x=[i for i in it if i>=n]\n if n==1:\n print(-1)\n continue\n if len(x)>0:\n print(-1)\n continue\n if it.count(0)==n:\n print(n)\n continue\n if n-1 in it:\n if it==[n-1]*n:\n print(0)\n else:\n if it.count(n-2)==n-1:\n print(1)\n else:\n print(-1)\n else:\n aa=list(set(it))\n if len(aa)==2:\n aa.sort()\n if aa[1]-aa[0]==1:\n x=len([i for i in it if i==aa[0]])\n # y=len([i for i in it if i==aa[1]])\n if x==aa[1]:\n print(n-x)\n else:\n print(-1)\n else:\n print(-1)\n \n else:\n print(-1)\n \n", "# cook your dish here\nfor _ in range(int(input())):\n n = int(input()) \n a = list(map(int, input().split())) \n\n x = list(set(a))\n \n if n == 1:\n print(-1)\n\n elif len(x) > 2:\n print(-1)\n \n elif len(x) == 1:\n if x[0] == n-1:\n print(0)\n elif x[0] == 0:\n print(n)\n else:\n print(-1)\n \n else:\n p = max(x)\n f = a.count(p)\n \n if p == a.count(min(x)):\n print(f)\n else:\n print(-1)", "for _ in range(int(input())):\n n = int(input()) \n a = list(map(int, input().split())) \n\n x = list(set(a))\n \n if n == 1:\n print(-1)\n\n elif len(x) > 2:\n print(-1)\n \n elif len(x) == 1:\n if x[0] == n-1:\n print(0)\n elif x[0] == 0:\n print(n)\n else:\n print(-1)\n \n else:\n p = max(x)\n f = a.count(p)\n \n if p == a.count(min(x)):\n print(f)\n else:\n print(-1)\n", "t=int(input())\nfor _ in range(t):\n n=int(input()) \n a=list(map(int,input().split())) \n if n == 1:\n print(-1)\n continue\n s = list(set(a))\n if len(s)>2:\n print(-1)\n continue\n if len(s)==1:\n if s[0]==n-1:\n print(0)\n elif s[0]==0:\n print(n)\n else:\n print(-1)\n continue\n x = a.count(max(s))\n y=max(s)\n if(y==a.count(min(s))):\n print(x)\n else:\n print(-1)\n # ans = max(s)\n # print(n-ans)\n", "import sys\ninput = sys.stdin.readline\n\nt = int(input().strip())\nfor _ in range(t):\n n = int(input().strip())\n ls = list(map(int, input().strip().split()))\n ls.sort()\n if abs(ls[-1]-ls[0])>1: print(-1)\n else:\n if len(set(ls))==1:\n if ls[0]==0: print(len(ls))\n elif len(ls)==ls[0]+1: print(0)\n else: print(-1)\n else:\n i = n-1\n cnt = 0\n while ls[i]==ls[n-1]:\n i-=1\n cnt+=1\n passed = n-cnt\n if ls[0]!=passed-1: print(-1)\n else: print(cnt)", "for _ in range(int(input())):\n n = int(input())\n m = list(map(int,input().split()))\n d = {}\n for i in m:\n try:\n d[i]\n except:\n d[i] = 1\n else:\n d[i] += 1\n mam, mim = max(m), min(m)\n pc = list(d.items())\n if len(pc)==2 and mam==mim+1:\n if d[mam]+d[mim]==n and mim==d[mim]-1:\n ans = d[mam]\n else:\n ans = -1\n elif len(pc)==1:\n if mam==n-1:\n ans = 0\n elif mam==0:\n ans = n\n else:\n ans = -1\n else:\n ans = -1\n print(ans)", "import sys\ninput = sys.stdin.readline\n\nt = int(input().strip())\nfor _ in range(t):\n n = int(input().strip())\n ls = list(map(int, input().strip().split()))\n ls.sort()\n if abs(ls[-1]-ls[0])>1: print(-1)\n else:\n if len(set(ls))==1:\n if ls[0]==0: print(len(ls))\n elif len(ls)==ls[0]+1: print(0)\n else: print(-1)\n else:\n i = n-1\n cnt = 0\n while ls[i]==ls[n-1]:\n i-=1\n cnt+=1\n passed = n-cnt\n if ls[0]!=passed-1: print(-1)\n else: print(cnt)\n", "for _ in range(int(input())):\n a=int(input())\n b=list(map(int,input().split()))\n c=max(b)\n if a==1:\n print('-1')\n else:\n l=set(b)\n if b==[c]*a:\n if c==0:\n print(a)\n elif c==a-1:\n print('0')\n else:\n print('-1')\n elif len(l)==2:\n if b.count(c)==a-c and b.count(c-1)==c:\n print(a-c)\n else:\n print('-1')\n else:\n print('-1')\n", "# cook your dish here\nfor i in range(int(input())):\n n = int(input())\n a = list(map(int,input().split()))\n a.sort()\n s =[]\n s.append(a[0])\n for i in range(1,n):\n if(a[i] != a[i-1]):\n s.append(a[i])\n if(len(s)>2 ):\n print(-1)\n else :\n if(len(s)== 1):\n if(s[0]==0):\n print(n)\n else :\n if(s[0]==n-1):\n print(0)\n else :\n print(-1)\n else :\n p = a.count(s[0])\n if(s[1]-s[0] != 1 ):\n print(-1)\n else :\n if(p == s[0]+1):\n print(n - p )\n else :\n print(-1)\n \n \n \n \n \n \n", "t = int(input())\nfor i in range(t):\n number_of_students = int(input())\n list_of_numbers = list(map(int, input().split(\" \")))\n max_number = max(list_of_numbers)\n min_number = min(list_of_numbers)\n #max_number must smaller becuase if it is equal, it means one student\n #saw himself which can't happen\n #(max_number - min_number) is always 0 or 1\n if max_number < number_of_students and min_number > -1 and \\\n abs(max_number - min_number) <= 1:\n #can't see himself\n sum_of_values = sum(list_of_numbers)\n\n if number_of_students == 1:\n print(-1)\n elif (sum_of_values%(number_of_students-1)) != 0:\n print(-1)\n else:\n print(number_of_students-(sum_of_values//(number_of_students-1)))\n\n else:\n print(-1)\n", "t= int(input())\nfor _ in range(t):\n n=int(input())\n a=list(map(int,input().split()))\n jhol=0\n d={}\n for i in a:\n if( i in d):\n d[i]+=1\n else:\n d[i]=1\n if(len(d)>2):\n jhol=1\n print(-1)\n elif(len(d)==1):\n b=list(set(a))\n x=b[0]\n if(d[x]==n and x==(n-1)):\n print(0)\n elif(x==0):\n print(n)\n else:\n print(-1)\n else:\n b=set(a)\n x=d[max(b)]\n y=max(b)\n if(y==d[min(b)]):\n print(x)\n else:\n print(-1)", "for _ in range(int(input())):\n a=int(input())\n x=list(map(int,input().split()))\n y=set(x)\n z=list(k for k in y)\n #print(sorted(x),y,z)\n if len(z)==1:\n if z[0]==0:\n f=a\n elif z[0]==a-1:\n f=0\n else:\n f=-1\n elif len(y)==2:\n for r in range(0,a+1):\n t=[r]*(a-r)+[r-1]*r\n #print(sorted(t))\n if sorted(t)==sorted(x):\n f=a-max(z)\n break\n else:\n f=-1\n else:\n f=-1\n print(f)"] | {"inputs": [["1", "4", "3 2 2 2"]], "outputs": [["1"]]} | INTERVIEW | PYTHON3 | CODECHEF | 9,547 | |
c3870ea9d09ca6d8b313cc011376c888 | UNKNOWN | Write a program that reads two numbers $X$ and $K$. The program first finds the factors of $X$ and then gives the sum of $K$th power of every factor. The program also finds the factor of $k$ and outputs the sum of $X$ times of every factor.
-----Input:-----
- First line will contain $T$, number of testcases. Then the testcases follow.
- Each testcase contains of a single line of input, two integers $X, R$.
-----Output:-----
For each testcase, output in a single line the factors of $X$ and the $K$th power of every factor, seperated by a space.
-----Constraints-----
- $1 \leq T \leq 1000$
- $2 \leq X, K \leq 10^9$
-----Sample Input:-----
1
8 6
-----Sample Output:-----
266304 88
-----EXPLANATION:-----
Factors of x = 8 are 2, 4, and 8. Also, factors of k = 6 are 2, 3, and 6.
2^6 + 4^6 + 8^6 = 266304 and 2 × 8 + 3 × 8 + 6 × 8 = 88.
(Where a ^b denotes a raised to the power of b). | ["try:\r\n for _ in range(int(input())):\r\n s,s1=0,0\r\n x,k=[int(i) for i in input().split()]\r\n for i in range(2,x+1):\r\n if(x%i==0):\r\n s=s+i**k\r\n for i in range(2,k+1):\r\n if(k%i==0):\r\n s1+=i*x\r\n print(s,s1)\r\nexcept EOFError as e:\r\n pass", "for i in range(int(input())):\n n,k = map(int,input().split())\n arr = list()\n var1 = 0\n for j in range(2,n+1):\n if n%j==0:\n arr.append(j)\n var1 = var1 + j**k\n var2 = 0\n for j in range(2,k+1):\n if k%j==0:\n var2 = var2 + n*j\n print(var1,var2)", "from functools import reduce\ndef factors(n):\n return set(reduce(list.__add__, ([i, n//i] for i in range(1, int(n**0.5) + 1) if n % i == 0)))\nT = int(input())\nwhile T:\n X, K = input().split()\n X, K = int(X), int(K)\n factors_X = factors(X)\n factors_K = factors(K)\n factors_X.remove(1)\n factors_K.remove(1)\n sum_X = 0\n sum_K = 0\n for i in factors_X:\n sum_X += (i ** K)\n for i in factors_K:\n sum_K += (i * X)\n print(sum_X, sum_K)\n T -= 1", "T = int(input())\n\nfor testcase in range(T):\n X, K = list(map(int, input().split(\" \")))\n\n def get_factors(N):\n res = []\n for i in range(2, N+1):\n if N % i == 0:\n res.append(i)\n return res\n \n x_factors = get_factors(X)\n k_factors = get_factors(K)\n \n power_sum = sum([x ** K for x in x_factors])\n factor_sum = sum([k * X for k in k_factors])\n \n print(power_sum, factor_sum)\n", "T=int(input())\r\nres=[]\r\nfor i in range (T):\r\n lis=[]\r\n s=input()\r\n s=list(s.split())\r\n x=int(s[0])\r\n k=int(s[1])\r\n fac=[]\r\n po=[]\r\n \r\n n=0\r\n m=0\r\n for j in range (2,x+1):\r\n if (x%j==0):\r\n n+=(j**k)\r\n fac.append(n)\r\n for j in range (2,k+1):\r\n if (k%j==0):\r\n m+=(j*x)\r\n fac.append(m)\r\n res.append(fac)\r\nfor i in range (T):\r\n print(res[i][0], res[i][1])\r\n", "# cook your dish here\nT=int(input())\nfor a in range(T):\n X,K=input().split(\" \")\n X=int(X)\n K=int(K)\n s=0\n su=0\n for i in range(2,X+1):\n if(X%i==0):\n s+=i**K\n \n for i in range(2,K+1):\n if(K%i==0):\n su+=i*X\n \n print(s,\" \",su)", "import math\r\nt=int(input())\r\ni=1 \r\nwhile(i<=t):\r\n x,k=list(map(int,input().split()))\r\n lst1=[]\r\n lst2=[]\r\n for j in range(2,(x+1)):\r\n if(x%j==0):\r\n lst1+=[j]\r\n for l in range(2,(k+1)):\r\n if(k%l==0):\r\n lst2+=[l]\r\n a2=sum(lst2)*x \r\n a1=0\r\n for p in range(0,len(lst1)):\r\n a1=a1+math.pow(lst1[p],k)\r\n print(int(a1),a2)\r\n i+=1 ", "import math\r\nt=int(input())\r\ni=1 \r\nwhile(i<=t):\r\n x,k=list(map(int,input().split()))\r\n lst1=[]\r\n lst2=[]\r\n for j in range(2,(x+1)):\r\n if(x%j==0):\r\n lst1+=[j]\r\n for l in range(2,(k+1)):\r\n if(k%l==0):\r\n lst2+=[l]\r\n a2=sum(lst2)*x \r\n a1=0\r\n for p in range(0,len(lst1)):\r\n a1=a1+math.pow(lst1[p],k)\r\n print(int(a1),a2)\r\n i+=1 ", "# cook your dish here\nimport math\nfor _ in range(int(input())):\n x,k=map(int,input().split())\n a={x}\n b={k}\n for i in range(2,int(math.sqrt(max(x,k))+2)):\n if i<=x and x%i==0:\n a.add(i)\n a.add(int(x/i))\n if i<=k and k%i==0:\n b.add(i)\n b.add(int(k/i))\n ans1=0\n ans2=0\n for i in a:\n if i!=1:\n ans1+=pow(i,k)\n for i in b:\n if i!=1:\n ans2+=(i*x)\n print(ans1,end=\" \")\n print(ans2)", "import math\r\n\r\ndef factor_x(m,n):\r\n\tres = 0\r\n\tst = 0\r\n\tfor i in range(2,n+1):\r\n\t\tif n%i==0:\r\n\t\t\tst = 0\r\n\t\t\tst = math.pow(i,m)\r\n\t\t\tres = res + st\r\n\treturn res\r\n\r\ndef factor_k(m,n):\r\n\tres = 0\r\n\tst = 0\r\n\tfor i in range(2,n+1):\r\n\t\tif n%i==0:\r\n\t\t\tst = 0\r\n\t\t\tst = i*m\r\n\t\t\tres = res + st\r\n\treturn res\r\n\r\nx_fac = 0\r\nk_fac = 0\r\ncycle = int(input())\r\ncy = 0\r\nwhile cy<cycle:\r\n\tx,k = input().split()\r\n\tx,k = int(x),int(k)\r\n\tx_fac = factor_x(k,x)\r\n\tk_fac = factor_k(x,k)\r\n\tprint(int(x_fac), \" \",int(k_fac))\r\n\tx_fac=0\r\n\tk_fac=0\r\n\tcy = cy + 1\r\n", "for _ in range(int(input())):\r\n x,r= list(map(int, input().split(' ')))\r\n m=[]\r\n c=0\r\n d=0\r\n for i in range(2, x + 1):\r\n if x % i == 0:\r\n m.append(i)\r\n c=c+i**r\r\n \r\n l=[]\r\n for i in range(2, r + 1):\r\n if r % i == 0:\r\n l.append(i)\r\n d=d+i*x\r\n \r\n print(c,d)\r\n\r\n\r\n\r\n\r\n \r\n\r\n \r\n", "t=int(input())\n\nfor i in range(t):\n\ts=input().split()\n\tx=int(s[0])\n\tk=int(s[1])\n\tfactor_x=list()\n\tfactor_k=list()\n\tfor i in range(2,max(x,k)+1):\n\t\tif(x%i==0):\n\t\t\tfactor_x.append(i)\n\t\tif(k%i==0):\n\t\t\tfactor_k.append(i)\n\tres_a=0\n\tfor i in factor_x:\n\t\tres_a+=(i**k)\n\tres_b=0\n\tfor j in factor_k:\n\t\tres_b+=(j*x)\n\tprint(res_a,res_b)", "import math\nt=int(input())\nfor cases in range(t):\n x,k=map(int,input().split())\n fx=[]\n fk=[]\n for i in range(2,x+1):\n if(x%i==0):\n fx.append(i)\n for i in range(2,k+1):\n if(k%i==0):\n fk.append(i)\n o1=0\n for i in fx:\n o1+=pow(i,k)\n o2=0\n for i in fk:\n o2+=i*x\n print(o1,o2)", "for _ in range(int(input())):\n x,k=map(int,input().split(\" \"))\n s=0\n for i in range(2,x+1):\n if x%i==0:\n s+=(i**k)\n s1=0\n for i in range(2,k+1):\n if k%i==0:\n s1+=(i*x)\n print(s,s1)", "for _ in range(int(input())):\n x,k=map(int,input().split(\" \"))\n s=0\n for i in range(2,x+1):\n if x%i==0:\n s+=(i**k)\n s1=0\n for i in range(2,k+1):\n if k%i==0:\n s1+=(i*x)\n print(s,s1)", "from numpy import array\nt = int(input())\ndef factor(n):\n l=[]\n for i in range(2,n+1):\n if n%i==0:\n l.append(i)\n return l \n\n\nwhile t>0:\n x,k = list(map(int,input().split(\" \")))\n xF=factor(x)\n kF=factor(k)\n \n arr1=array(xF)\n arr2=array(kF)\n xS=arr1**array([k]*len(xF))\n kS=arr2*array([x]*len(kF))\n print(sum(xS),sum(kS))\n t-=1 \n", "# cook your dish here\nfor t in range(int(input())):\n X,K=input().split()\n X,K=int(X),int(K)\n l=[]\n l1=[]\n for i in range(2,X+1):\n if X%i==0:\n l.append(i**K)\n for j in range(2,K+1):\n if K%j==0:\n l1.append(j*X)\n print(sum(l),sum(l1))\n", "for _ in range(int(input())):\r\n\tX,R=map(int,input().split())\r\n\ta=[]\r\n\tb=[]\r\n\tfor i in range(2,X+1):\r\n\t\tif X%i==0:\r\n\t\t\ta.append(i**R)\r\n\tfor j in range(2,R+1):\r\n\t\tif R%j==0:\r\n\t\t\tb.append(j*X)\r\n\tprint(sum(a),sum(b))", "# cook your dish here\nt=int(input())\nwhile(t):\n t=t-1\n l=list(map(int,input().split()))\n X=l[0]\n K=l[1]\n sum1=0\n sum2=0\n for i in range(2,X+1):\n if(X%i==0):\n sum1=sum1+i**K\n for i in range(2,K+1):\n if(K%i==0):\n sum2=sum2+X*i\n print(str(sum1)+\" \"+str(sum2))", "# cook your dish here\nT=int(input())\nfor a in range(T):\n X,K=input().split(\" \")\n X=int(X)\n K=int(K)\n s=0\n su=0\n for i in range(2,X+1):\n if(X%i==0):\n s+=i**K\n \n for i in range(2,K+1):\n if(K%i==0):\n su+=i*X\n \n print(s,\" \",su)", "try:\n t=int(input())\n for _ in range(t):\n p=list(map(int,input().split()))\n x,k=p[0],p[1]\n c1,c2=0,0\n for i in range(2,x+1):\n if x%i==0:\n c1+=pow(i,k)\n for i in range(2,k+1):\n if k%i==0:\n c2+=x*i\n print(c1,c2)\nexcept:\n pass", "# cook your dish here\r\nt=int(input())\r\nfor _ in range(t):\r\n x,r=map(int,input().split())\r\n i = 2\r\n l=[]\r\n l1=[]\r\n while i <= x: \r\n if (x % i==0) : \r\n l.append(i)\r\n i = i + 1\r\n i=2\r\n while i <= r: \r\n if (r % i==0) : \r\n l1.append(i)\r\n i = i + 1\r\n su=0\r\n for i in range(len(l)):\r\n su+=pow(l[i],r)\r\n #print(su)\r\n \r\n su1=0\r\n for i in range(len(l1)):\r\n su1+=l1[i]*x\r\n print(su,su1,sep=' ')", "def divs(n):\r\n x = []\r\n i = 2\r\n while i <= n : \r\n if (n % i==0) : \r\n x.append(i)\r\n i += 1\r\n return x\r\n \r\nfor _ in range(int(input())):\r\n x,k = map(int,input().split())\r\n xd = divs(x)\r\n kd = divs(k)\r\n a,b = 0,0\r\n for i in xd:\r\n a += pow(i,k)\r\n for i in kd:\r\n b += i*x\r\n print(a,b)"] | {"inputs": [["1", "8 6"]], "outputs": [["266304 88"]]} | INTERVIEW | PYTHON3 | CODECHEF | 9,082 | |
55e7d0ce71236d0b756936db77f952d6 | UNKNOWN | Chef solved so many hard questions, now he wants to solve some easy problems for refreshment. Chef asks Cheffina for the new question. Cheffina challenges the chef to print the total number of 0's in the binary representation of N(natural number).
-----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, $N$.
-----Output:-----
For each test case, output in a single line answer.
-----Constraints-----
- $1 \leq T \leq 10^6$
- $1 \leq N \leq 10^6$
-----Sample Input:-----
2
2
4
-----Sample Output:-----
1
2
-----EXPLANATION:-----
For 1) Binary representation of 2 is 10. i.e. only one 0 present in it.
For 2) Binary representation of 4 is 100, i.e. two 0's present in it. | ["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 n=geta()\r\n n=bin(n).split('b')[1]\r\n print(n.count('0'))\r\n\r\n\r\ndef __starting_point():\r\n solve()\r\n\n__starting_point()", "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 n=geta()\r\n n=bin(n).split('b')[1]\r\n print(n.count('0'))\r\n\r\n\r\ndef __starting_point():\r\n solve()\r\n\n__starting_point()", "from sys import stdin\nn = int(stdin.readline())\nfor _ in range(n):\n n1 = int(stdin.readline())\n b = bin(n1)[2:]\n print(b.count('0'))"] | {"inputs": [["2", "2", "4"]], "outputs": [["1", "2"]]} | INTERVIEW | PYTHON3 | CODECHEF | 1,268 | |
85467ba9075152fb0d3ba3efc6b5dc57 | UNKNOWN | Chef is playing a game with his childhood friend. He gave his friend a list of N numbers named $a_1, a_2 .... a_N$ (Note: All numbers are unique). Adjust the numbers in the following order:
$(i)$ swap every alternate number with it's succeeding number (If N is odd, do not swap the last number i.e. $a_N$ ).
$(ii)$ add %3 of every number to itself.
$(iii)$ swap the ith number and the (N-i-1) th number.
After this, Chef will give a number to his friend and he has to give the nearest greater and smaller number to it.
If there is no greater or lesser number, put -1.
Help his friend to find the two numbers.
-----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, an integers $N$.
- Next line contains $N$ integers separated by a space.
- Next line contains a number to be found, $M$.
-----Output:-----
For each test case, output in a single line answer given the immediate smaller and greater number separated by a space.
-----Constraints-----
- $1 \leq T \leq 1000$
- $3 \leq N \leq 10^5$
- $1 \leq N_i \leq 10^9$
- $1 \leq M \leq 10^9$
-----Sample Input:-----
1
10
5 15 1 66 55 32 40 22 34 11
38
-----Sample Output:-----
35 41
-----Explaination:-----
Step 1: 15 5 66 1 32 55 22 40 11 34
Step 2: 15 7 66 2 34 56 23 41 13 35
Step 3: 35 13 41 23 56 34 2 66 7 15
35 is the number lesser than 38 and 41 is the number greater than 38 in the given set of numbers. | ["for _ in range(int(input())):\n n=int(input())\n a=list(map(int,input().split()))\n x=int(input())\n for _ in range(1,n,2):\n a[_],a[_-1]=a[_-1],a[_]\n for _ in range(n):\n a[_]+=(a[_]%3)\n # a=a[::-1]\n # a.sort()\n # if x>a[-1]:\n # print(-1)\n # continue\n l,h=-1,9999999999\n for _ in range(n):\n # if a[_]>=x:\n # if _==n-1:\n # print(-1)\n # break\n # elif _==0:\n # print(-1)\n # break\n # else:\n # print(a[_-1],a[_])\n # break\n if a[_]>l and a[_]<x :\n l=a[_]\n if a[_]<h and a[_]>x :\n h=a[_]\n print(l,end=\" \")\n if h==9999999999:\n print(-1)\n else: \n print(h) \n \n ", "for _ in range(int(input())):\r\n n=int(input())\r\n arr=list(map(int,input().split()))\r\n m=int(input())\r\n s=999999999;l=999999999;an=-1;pj=-1\r\n for i in range(n):\r\n arr[i]+=arr[i]%3\r\n if(arr[i] > m and arr[i]-m<l):\r\n an=arr[i]\r\n l=arr[i]-m\r\n if(arr[i]<m and m-arr[i]<s):\r\n pj=arr[i]\r\n s=m-arr[i]\r\n print(pj,an)", "for _ in range(int(input().strip())):\r\n n = int(input().strip())\r\n list1 = list(map(int, input().strip().split()))[:n]\r\n m = int(input().strip())\r\n for i in range(n):\r\n list1[i] = list1[i] + list1[i]%3\r\n #print(list1)\r\n l1 = []\r\n l2 = []\r\n list2 = sorted(list1)\r\n for i in range(n-1,0,-1):\r\n if list2[i]>m:\r\n l1.append(list2[i])\r\n for i in range(n):\r\n if list2[i]<m:\r\n l2.append(list2[i])\r\n if len(l1)>0 and len(l2)>0:\r\n print(max(l2),min(l1))\r\n elif len(l1)<=0 and len(l2)>0:\r\n print(max(l2),\"-1\")\r\n elif len(l1)>0 and len(l2)<=0:\r\n print(\"-1\",min(l1))\r\n else:\r\n print(\"-1\",\"-1\")", "for _ in range(int(input().strip())):\r\n n = int(input().strip())\r\n list1 = list(map(int, input().strip().split()))[:n]\r\n m = int(input().strip())\r\n for i in range(n):\r\n list1[i] = list1[i] + list1[i]%3\r\n #print(list1)\r\n l1 = []\r\n l2 = []\r\n list2 = sorted(list1)\r\n for i in range(n-1,0,-1):\r\n if list2[i]>m:\r\n l1.append(list2[i])\r\n for i in range(n):\r\n if list2[i]<m:\r\n l2.append(list2[i])\r\n if len(l1)>0 and len(l2)>0:\r\n print(max(l2),min(l1))\r\n elif len(l1)<=0 and len(l2)>0:\r\n print(max(l2),\"-1\")\r\n elif len(l1)>0 and len(l2)<=0:\r\n print(\"-1\",min(l1))\r\n else:\r\n print(\"-1\",\"-1\")", "'''\r\n\r\n\r\n1\r\n10\r\n5 15 1 66 55 32 40 22 34 11\r\n38\r\n\r\nStep 1: 15 5 66 1 32 55 22 40 11 34\r\n\r\nStep 2: 15 7 66 2 34 56 23 41 13 35\r\n\r\nStep 3: 35 13 41 23 56 34 2 66 7 15\r\n\r\n35 is the number lesser than 38 and 41 is the number greater than 38 in the given set of numbers.\r\n\r\n'''\r\n\r\n\r\nn=int(input())\r\nfor i in range(0,n):\r\n o=int(input())\r\n p=input().rstrip().split(' ')\r\n x=int(input())\r\n for j in range(0,len(p)-1,2):\r\n A=int(p[j])\r\n B=int(p[j+1])\r\n p[j]=B+(B%3);\r\n p[j+1]=A+(A%3);\r\n if len(p)%2==1:\r\n p[len(p)-1]=int(p[len(p)-1])+(int(p[len(p)-1]))%3;\r\n # print(p)\r\n p.sort(key=int)\r\n ans1=-1;\r\n ans2=-1;\r\n I=0;\r\n J=len(p)-1;\r\n while(I<=J):\r\n m=(I+J)//2;\r\n if int(p[m])>=x:\r\n J=m-1;\r\n else:\r\n ans1=int(p[m]);\r\n I=m+1;\r\n I=0;\r\n J=len(p)-1;\r\n while(I<=J):\r\n m=(I+J)//2;\r\n if int(p[m])<=x:\r\n I=m+1;\r\n else:\r\n ans2=int(p[m]);\r\n J=m-1; \r\n print(ans1,ans2)", "for _ in range(int(input().strip())):\r\n n = int(input().strip())\r\n arr = list(map(int, input().strip().split()))[:n]\r\n m = int(input().strip())\r\n list1=[]\r\n list2=[]\r\n for i in range(0,n):\r\n arr[i]= (arr[i]+arr[i]%3)\r\n if arr[i]>m:\r\n list1.append(arr[i])\r\n if arr[i]<m:\r\n list2.append(arr[i])\r\n if len(list1)>0 and len(list2)>0:\r\n print(max(list2),min(list1))\r\n elif len(list1)<=0 and len(list2)>0:\r\n print(max(list2),\"-1\")\r\n elif len(list1)>0 and len(list2)<=0:\r\n print(\"-1\",min(list1))\r\n else:\r\n print(\"-1\",\"-1\")", "# cook your dish here\nt=int(input())\nwhile t>0:\n n=int(input())\n arr=list(map(int,input().split()))\n m=int(input())\n p=-1\n q=-1\n for x in arr:\n x+=x%3\n if x<m:\n if p==-1 or x>p:\n p=x\n elif x>m:\n if q==-1 or x<q:\n q=x\n print(p,' ',q)\n t-=1\n\n", "t=int(input())\r\nfor i in range(t):\r\n n=int(input())\r\n A=list(map(int,input().split()))\r\n m=int(input())\r\n x=n//2\r\n u=0\r\n te=-1\r\n while(x):\r\n te=A[u]\r\n A[u]=A[u+1]\r\n A[u+1]=te\r\n u+=2\r\n x-=1\r\n for j in range(n):\r\n A[j]+=(A[j]%3)\r\n for j in range(n):\r\n u=j\r\n v=n-j-1\r\n te=A[u]\r\n A[u]=A[v]\r\n A[v]=te\r\n mi=-1\r\n ma=-1\r\n A.sort()\r\n for j in range(n):\r\n if(A[j]>m):\r\n ma=A[j]\r\n break\r\n A=A[: : -1]\r\n for j in range(n):\r\n if(A[j]<m):\r\n mi=A[j]\r\n break\r\n print(mi,ma)", "\nfor _ in range(int(input())):\n n=int(input())\n l=list(map(int,input().split()))\n x=int(input())\n mi=-1\n ma=float(\"inf\")\n for i in l:\n val=i+(i%3)\n if(val<x):\n mi=max(mi,val)\n elif val>x:\n ma=min(ma,val)\n if(ma==float(\"inf\")):\n ma=-1\n print(mi,ma)\n\n\n\n\n\n\n", "# cook your dish here\ntry:\n t=int(input())\n for _ in range(t):\n n=int(input())\n a=list(map(int,input().split()))\n x=int(input())\n b=list(map(lambda x: x+x%3,a))\n b.sort()\n c1=0\n for lar in b:\n if(lar>x): \n large=lar\n c1=1\n break\n if(c1==0): large=-1\n b.sort(reverse=True)\n c2=0\n for sma in b:\n if(sma<x): \n small=sma\n c2=1\n break\n if(c2==0): small=-1\n print(small,large)\n \nexcept:\n pass", "# cook your dish here\ntry:\n t=int(input())\n for _ in range(t):\n n=int(input())\n a=list(map(int,input().split()))\n x=int(input())\n b=list(map(lambda x: x+x%3,a))\n b.sort()\n c1=0\n for lar in b:\n if(lar>x): \n large=lar\n c1=1\n break\n if(c1==0): large=-1\n b.sort(reverse=True)\n c2=0\n for sma in b:\n if(sma<x): \n small=sma\n c2=1\n break\n if(c2==0): small=-1\n print(small,large)\n \nexcept:\n pass", "t = int(input())\nfor _ in range(t):\n n = int(input())\n l = list(map(int,input().split()))\n m = int(input())\n lmin = []\n lmax = []\n for i in range(n):\n num = l[i]\n l[i] += (num%3)\n if n%2==0:\n for i in range(n-1):\n l[i],l[i+1] = l[i+1],l[i]\n else:\n for i in range(n-2):\n l[i],l[i+1] = l[i+1],l[i]\n for i in range(int(n/2)):\n l[i],l[n-1-i] = l[n-1-i],l[i]\n for i in range(len(l)):\n if l[i] < m:\n lmin.append(l[i])\n elif l[i] > m:\n lmax.append(l[i])\n if len(lmin)==0:\n a = -1\n else:\n a = max(lmin)\n if len(lmax)==0:\n b = -1\n else:\n b = min(lmax)\n print(a,b)\n \n \n \n \n \n \n \n", "import bisect\r\nfor _ in range(int(input())):\r\n n = int(input())\r\n lst = list(map(int, input().split()))\r\n m = int(input())\r\n for i in range(n):\r\n mod = lst[i]%3\r\n lst[i] = lst[i]+mod\r\n lst = sorted(lst)\r\n id = bisect.bisect(lst,m)\r\n if id==0:\r\n if lst[0]>m:\r\n g = lst[0]\r\n else:\r\n g = lst[1]\r\n s = -1\r\n elif id==n:\r\n if lst[n-1]<m:\r\n s = lst[n-1]\r\n else:\r\n s = lst[n-2]\r\n g = -1\r\n else:\r\n s = lst[id-1]\r\n if s==m:\r\n if id-2<0:\r\n s = -1\r\n else:\r\n s = lst[id-2]\r\n g = lst[id]\r\n if g==m:\r\n if id+1>n-1:\r\n g = -1\r\n else:\r\n g = lst[id+1]\r\n print(s,g)", "t=int(input())\r\nfor _ in range(t):\r\n n=int(input())\r\n l=list(map(int,input().split()))\r\n for i in range(n):\r\n l[i]+=l[i]%3\r\n x=int(input())\r\n a=-1\r\n b=-1\r\n for i in l:\r\n if i>x:\r\n if b==-1:\r\n b=i\r\n else:\r\n b=min(b,i)\r\n if i<x:\r\n if a==-1:\r\n a=i\r\n else:\r\n a=max(a,i)\r\n print(a,b)\r\n \r\n \r\n \r\n \r\n \r\n \r\n", "# cook your dish here\nimport bisect\nt = int(input())\nfor _ in range(t):\n n = int(input())\n arr = list(map(int, input().split()))\n m = int(input())\n for i in range(n):\n mod = arr[i]%3\n arr[i] = arr[i]+mod\n arr = sorted(arr)\n idx = bisect.bisect(arr,m)\n if idx==0:\n if arr[0]>m:\n g = arr[0]\n else:\n g = arr[1]\n s = -1\n elif idx==n:\n if arr[n-1]<m:\n s = arr[n-1]\n else:\n s = arr[n-2]\n g = -1\n else:\n s = arr[idx-1]\n if s==m:\n if idx-2<0:\n s = -1\n else:\n s = arr[idx-2]\n g = arr[idx]\n if g==m:\n if idx+1>n-1:\n g = -1\n else:\n g = arr[idx+1]\n print(s,g)\n \n", "t=int(input())\nfor i in range(t):\n n=int(input())\n arr=[int(x) for x in input().split()]\n m=int(input())\n \n i=0\n j=1\n while j<n:\n arr[i],arr[j]=arr[j],arr[i]\n i=i+2\n j=j+2\n \n for i in range(n):\n arr[i]=arr[i]+arr[i]%3\n \n for i in range(n//2):\n arr[i],arr[n-i-1]=arr[n-i-1],arr[i]\n \n l=-1\n g=10**10\n \n for i in range(n):\n if arr[i]<m:\n l=max(l,arr[i])\n if arr[i]>m:\n g=min(g,arr[i])\n \n if g==10**10:\n g=-1\n \n print(l,g) \n \n \n \n", "for _ in range(int(input())):\r\n n = int(input())\r\n a = list(map(int, input().split()))\r\n x = int(input())\r\n\r\n for i in range(0, n - n%2, 2):\r\n a[i], a[i+1] = a[i+1], a[i]\r\n\r\n for i in range(n):\r\n a[i] += a[i] % 3\r\n\r\n a.reverse()\r\n\r\n c1 = float('-inf')\r\n for i in range(n):\r\n if x > a[i] > c1:\r\n c1 = a[i]\r\n\r\n c2 = float('inf')\r\n for i in range(n):\r\n if x < a[i] < c2:\r\n c2 = a[i]\r\n\r\n if c1 == float('-inf'): c1 = -1\r\n if c2 == float('inf'): c2 = -1\r\n\r\n print(c1, c2)\r\n"] | {"inputs": [["1", "10", "5 15 1 66 55 32 40 22 34 11", "38"]], "outputs": [["35 41"]]} | INTERVIEW | PYTHON3 | CODECHEF | 11,648 | |
84d8a4004c03c22bbd8f6789f5b23df3 | UNKNOWN | Arya and Aryan live in a country called Nadaca. Nadaca consists of $N$ cities numbered $1$ through $N$, which are connected by some bidirectional roads. Each road has a positive (not necessarily integer) length. Arya lives in city $1$ and Aryan lives in city $N$.
Arya claims that for each city $v$, the shortest path from city $1$ to city $v$ has length $a_v$. Aryan does not disagree, but claims that for each city $v$, the shortest path from city $N$ to city $v$ has length $b_v$. You are the wisest person they know, so they asked you to tell them if it is possible for their claims to be true, i.e. if a road network which fully satisfies their claims exists. Help them!
-----Input-----
- The first line of the input contains a single integer $T$ denoting the number of test cases. The description of $T$ test cases follows.
- 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$.
- The third line contains $N$ space-separated integers $b_1, b_2, \ldots, b_N$.
-----Output-----
For each test case, print a single line containing the string "Yes" if Arya's and Aryan's claims can be true or "No" otherwise.
-----Constraints-----
- $1 \le T \le 10^3$
- $2 \le N \le 10^6$
- $0 \le a_i, b_i \le 10^9$ for each valid $i$
- the sum of $N$ over all test cases does not exceed $10^6$
-----Subtasks-----
Subtask #1 (50 points): the sum of $N$ over all test cases does not exceed $10^3$
Subtask #2 (50 points): original constraints
-----Example Input-----
2
3
0 1 1
1 1 0
3
0 1 5
5 1 0
-----Example Output-----
Yes
No | ["# cook your dish here\n# cook your dish here\nfor _ in range(int(input())):\n n=int(input())\n a=list(map(int, input().split()))\n b=list(map(int, input().split()))\n\n if a[0]!=0 or b[-1]!=0 or a[-1]!=b[0]:\n print('No')\n \n else:\n ab=b[0]\n flag=0\n for i in range(1, n-1):\n if a[i]==0 or b[i]==0:\n print('No')\n flag=1 \n break\n \n elif a[i]+b[i]<ab:\n print('No')\n flag=1 \n break\n \n elif a[i]>ab+b[i] or b[i]>ab+a[i]:\n print('No')\n flag=1 \n break\n \n if flag==0:\n print('Yes')", "# cook your dish here\nfor _ in range(int(input())):\n n=int(input())\n a=list(map(int, input().split()))\n b=list(map(int, input().split()))\n\n if a[0]!=0 or b[-1]!=0 or a[-1]!=b[0]:\n print('No')\n \n else:\n ab=b[0]\n flag=0\n for i in range(1, n-1):\n if a[i]==0 or b[i]==0:\n print('No')\n flag=1 \n break\n \n elif a[i]+b[i]<ab:\n print('No')\n flag=1 \n break\n \n elif a[i]>ab+b[i] or b[i]>ab+a[i]:\n print('No')\n flag=1 \n break\n \n if flag==0:\n print('Yes')", "for _ in range(int(input())):\n n=int(input())\n A=list(map(int,input().split(\" \")))\n B=list(map(int,input().split(\" \")))\n ans=\"Yes\"\n\n a_1=A[0]\n a_n=A[n-1]\n b_1=B[0]\n b_n=B[n-1]\n\n if a_1!=0 or b_n!=0 or a_n!=b_1 :\n ans=\"No\"\n else:\n for i in range(1,n-1):\n if A[i]==0 or B[i]==0 :\n ans=\"No\"\n break\n elif b_1+A[i]<B[i]:\n ans=\"No\"\n break\n elif A[i]+B[i]<b_1:\n ans=\"No\"\n break\n elif B[i]+b_1<A[i]:\n ans=\"No\"\n break\n else:\n pass\n\n print(ans)", "# cook your dish here\nfor _ in range(int(input())):\n n=int(input())\n A=list(map(int,input().split(\" \")))\n B=list(map(int,input().split(\" \")))\n ans=\"Yes\"\n\n a_1=A[0]\n a_n=A[n-1]\n b_1=B[0]\n b_n=B[n-1]\n\n if a_1!=0 or b_n!=0 or a_n!=b_1 :\n ans=\"No\"\n else:\n for i in range(1,n-1):\n if A[i]==0 or B[i]==0 :\n ans=\"No\"\n break\n elif b_1+A[i]<B[i]:\n ans=\"No\"\n break\n elif A[i]+B[i]<b_1:\n ans=\"No\"\n break\n elif B[i]+b_1<A[i]:\n ans=\"No\"\n break\n else:\n pass\n\n print(ans)", "# cook your dish here\nfor _ in range(int(input())):\n n=int(input())\n A=list(map(int,input().split(\" \")))\n B=list(map(int,input().split(\" \")))\n ans=\"Yes\"\n\n a_1=A[0]\n a_n=A[n-1]\n b_1=B[0]\n b_n=B[n-1]\n\n if a_1!=0 or b_n!=0 or a_n!=b_1 :\n ans=\"No\"\n else:\n for i in range(1,n-1):\n if A[i]==0 or B[i]==0 :\n ans=\"No\"\n break\n elif b_1+A[i]<B[i]:\n ans=\"No\"\n break\n elif A[i]+B[i]<b_1:\n ans=\"No\"\n break\n elif B[i]+b_1<A[i]:\n ans=\"No\"\n break\n else:\n pass\n\n print(ans)", "# cook your dish here\nfor _ in range(int(input())):\n N=int(input())\n A=list(map(int, input().split()))\n B=list(map(int, input().split()))\n\n if A[0]!=0 or B[N-1]!=0 or A[N-1]!=B[0]:\n print('No')\n continue\n\n ans='Yes'\n for i in range(N):\n if i!= 0 and A[i]==0:\n ans='No'\n break\n if i!=N-1 and B[i]==0:\n ans='No'\n break\n if A[i]+B[i]<B[0] or A[i]+B[0]<B[i] or B[i]+B[0]<A[i]:\n ans='No'\n break\n print(ans)\n", "\ndef calculate_min_path(A,B):\n if A[0] != 0 or B[n-1] != 0:\n return False\n \n if A[n-1] != B[0]:\n return False\n \n for i in range(1,n-1):\n a, b, c = A[i], A[n-1], B[i]\n if a+b < c or a+c < b or b+c < a or a*b*c == 0:\n return False\n return True\n \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 \n if calculate_min_path(A,B):\n print(\"Yes\")\n else:\n print(\"No\")", "\ndef calculate_min_path(A,B):\n flag = 1\n if A[0] != 0 or B[n-1] != 0:\n print(\"No\")\n return\n \n if A[n-1] != B[0]:\n print(\"No\")\n return\n \n for i in range(1,n-1):\n a = A[i]\n b = A[n-1]\n c = B[i]\n \n if a > 0 and b > 0 and c > 0:\n if a+b < c or a+c < b or b+c < a:\n flag = 0\n break\n else:\n flag = 0\n break\n \n \n if flag == 1:\n print(\"Yes\")\n else:\n print(\"No\")\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 \n\n calculate_min_path(A,B)", "def check_claim(A, B, n):\n if A[0] or B[-1]:\n return False\n if A[-1] != B[0]:\n return False\n if n == 2:\n return True\n for i in range(1, n-1):\n l1, l2, l3 = B[0], A[i], B[i]\n if l1 > l2+l3 or l2 > l1+l3 or l3 > l1+l2 or l1*l2*l3 == 0:\n return False\n return True\n\nt = int(input())\nfor test in range(t):\n n = int(input())\n A = [int(x) for x in input().split()]\n B = [int(x) for x in input().split()]\n if check_claim(A, B, n):\n print(\"Yes\")\n else:\n print(\"No\")", "# cook your dish here\nfor i in range(int(input())):\n n=int(input())\n x=0\n l1=list(map(float,input().split()))\n l2=list(map(float,input().split()))\n if l1[0]==0 and l2[n-1]==0 and l1[n-1]==l2[0]:\n for j in range(1,n-1):\n if(l1[j]==0 or l2[j]==0):\n x=1\n break\n if l2[0]>(l1[j]+l2[j]):\n x=1 \n break\n if l1[j]>(l2[j]+l2[0]):\n x=1\n break\n if l2[j]>(l1[j]+l2[0]):\n x=1\n break\n else:\n x=1\n if x==0:\n print(\"Yes\")\n else:\n print(\"No\")", "for _ in range(int(input())):\n n = int(input())\n a= list(map(int,input().split()))\n b = list(map(int,input().split()))\n fl =1\n if(a[0]!=0 or b[n-1]!=0 or a[n-1]!=b[0]):\n fl=0\n s =b[0]\n if(fl):\n for i in range(n):\n if(i!=0 and i!= n-1):\n if(a[i]==0 or b[i]==0):\n fl=0\n break\n\n\n if(a[i]+b[i] < s):\n fl=0\n break\n if(s+b[i] < a[i]):\n fl =0\n break\n if(s+a[i] <b[i]):\n fl=0\n break\n if(fl):\n print(\"Yes\")\n else:\n print(\"No\")", "t=int(input())\nfor _ in range(t):\n n=int(input())\n aa=list(map(int,input().split()))\n bb=list(map(int,input().split()))\n if aa[0]!=0 or bb[-1]!=0:\n print(\"No\")\n continue\n if aa[-1]!=bb[0]:\n print(\"No\")\n continue\n if 0 in aa[1:] or 0 in bb[:n-1]:\n print(\"No\")\n continue\n \n ma=aa[-1]\n ans=\"Yes\"\n for i in range(1,n-1):\n if aa[i]+bb[i]<ma:\n ans=\"No\"\n if aa[-1]+bb[i]<aa[i]:\n ans=\"No\"\n if aa[i]+bb[0]<bb[i]:\n ans=\"No\"\n print(ans)\n", "t = int(input())\nfor _ in range(t):\n n = int(input())\n a1 = input()\n b1 = input()\n a = list(map(int, a1.split()))\n b = list(map(int, b1.split()))\n c1 = a.count(0)\n c2 = b.count(0)\n flag = False\n if c1 == 1 and c2 == 1 and a[n-1] == b[0]:\n k = a[n-1]\n for i in range(1, n-1):\n m = a[i]\n n = b[i]\n if k <= m + n and m<=k+n and n<=k+m:\n flag = False\n else:\n flag = True\n break\n if flag:\n print(\"No\")\n else:\n print(\"Yes\")\n else:\n print(\"No\")", "def istriangle(a, b, c):\n if a <= 0 or b <= 0 or c <= 0:\n return False\n if (a + b < c) or (a + c < b) or (b + c < a):\n return False\n else:\n return True\n\n\ndef valid(a, b, n):\n if a[0] != 0 or b[-1] != 0 or a[-1] != b[0]:\n return False\n for i in range(1, n - 1):\n if not istriangle(a[-1], a[i], b[i]):\n return False\n return True\n\n\nfor 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 valid(a, b, n):\n print('Yes')\n else:\n print('No')", "for _ in range(int(input())):\n n = int(input())\n a = [int(x) for x in input().split()]\n b = [int(x) for x in input().split()]\n flag = 1\n if a[0]!=0 or b[n-1]!=0:\n flag = 0\n if a[n-1]!=b[0]:\n flag = 0\n for i in range(1, n-1):\n if a[i]==0 or b[i]==0:\n flag = 0\n if a[i]+b[i]<b[0]:\n flag = 0\n if b[0]+a[i]<b[i]:\n flag = 0\n if b[i]+b[0]<a[i]:\n flag = 0\n if flag==1:\n print('Yes')\n else:\n print('No')\n", "t = 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 if a[0]!=0 or b[n-1]!=0 or a[n-1]!=b[0] or b[0]==0:\n print(\"No\")\n else:\n flag=0\n for i in range(n):\n if (a[i]+b[i]<b[0] or a[i]+b[0]<b[i] or b[i]+b[0]<a[i]):\n flag=1\n break\n if flag==1:\n print(\"No\")\n else:\n print(\"Yes\")\n \n", "# cook your dish here\ntry:\n t = int(input())\n for case in range(t):\n n = int(input())\n a = [int(i) for i in input().split()]\n b = [int(i) for i in input().split()]\n yes = True\n if a[0] != 0 or b[n - 1] != 0:\n print(\"No\")\n yes = False\n elif a[n - 1] != b[0]:\n print(\"No\")\n yes = False\n else:\n for edge in range(1, n - 1):\n if a[edge] == 0 or b[edge] == 0:\n print(\"No\")\n yes = False\n break\n elif a[edge] + b[edge] < b[0]:\n print(\"No\")\n yes = False\n break\n elif a[edge] + b[0] < b[edge]:\n print(\"No\")\n yes = False\n break\n elif a[n - 1] + b[edge] < a[edge]:\n print(\"No\")\n yes = False\n break\n if yes:\n print(\"Yes\")\nexcept EOFError:\n pass", "def check(n, a, b):\n for i in range(1, n): \n if a[i] == 0: return False\n for i in range(n-1): \n if b[i] == 0: return False\n if a[-1] != b[0] or a[0] != 0 or b[-1] != 0: return False\n else:\n d = b[0]\n for i in range(1, n-1):\n if d > a[i] + b[i]: return False\n for i in range(1, n-1):\n if a[i] > d + b[i]: return False\n if b[i] > d + a[i]: return False\n return True\n\nfor _ in range(int(input())):\n n = int(input())\n a = [int(i) for i in input().split()]\n b = [int(i) for i in input().split()]\n\n if check(n, a, b): print('Yes')\n else: print('No')", "\n\nt = int(input())\n\nfor m in range(t):\n\n n = int(input())\n l1 = list(map(int,input().split()))\n l2 = list(map(int,input().split()))\n flag = 0\n if l1[0]!=0 or l1[-1] == 0 or l2[0] == 0 or l2[-1]!=0 or l1[-1]!=l2[0]:\n flag = 1\n\n if flag!=1:\n for i in range(1,n-1):\n if l1[i]+l2[i]<l1[-1]:\n flag = 1\n break\n if l1[-1]+l2[i]<l1[i]:\n flag = 1\n break\n if l1[-1]+l1[i]<l2[i]:\n flag = 1\n break\n if flag == 0:\n print('Yes')\n else:\n print('No')"] | {"inputs": [["2", "3", "0 1 1", "1 1 0", "3", "0 1 5", "5 1 0"]], "outputs": [["Yes", "No"]]} | INTERVIEW | PYTHON3 | CODECHEF | 9,856 | |
7e9d1ebda2f4c8f47f40ccee0eb72aef | UNKNOWN | Cherry has a string S$S$ consisting of lowercase English letters. Using this string, he formed a pyramid of infinite length with certain rules:
- N$N$-th row of pyramid contains N$N$ characters.
- Each row of pyramid begins with the first character of the string.
- The subsequent characters of the row are appended to the string in cyclic fashion, until the size of string for that Row is reached (See example pyramid for better understanding).
He has another string T$T$ of smaller (or equal) size.
You are asked Q$Q$ queries. Each query is provided with a row number N$N$. The answer to the query is number of occurrences of string T$T$ in that particular row of pyramid. No of occurrences of String T$T$ in a string V$V$ would mean that you'd need to find number of substrings Vi,Vi+1...Vj$V_i, V_{i+1} ... V_j$ which are equal to String T$T$, where i≤j$i \leq j$.
For eg: If the string is code, then the pyramid will be of the form:
c
co
cod
code
codec
codeco
codecod
codecode
codecodec
codecodeco
...
-----Input:-----
- The first line contains string S$S$ — consisting of lowercase English letters.
- The second line contains string T$T$ — consisting of lowercase English letters.
- Next line contains an integer Q$Q$ — the number of queries.
- Then follow Q$Q$ lines with queries descriptions. Each of them contains a single integer N$N$ denoting the row number of pyramid.
-----Output:-----
- Print Q$Q$ lines. The i$i$-th of them should contain a integer denoting occurrences of string T$T$ in that particular row.
-----Constraints-----
- 1≤|S|≤105$1 \leq |S| \leq 10^5$
- 1≤|T|≤|S|$1 \leq |T| \leq |S|$
- 1≤Q≤105$1 \leq Q \leq 10^5$
- 1≤N≤109$1 \leq N \leq 10^9$
-----Sample Input:-----
codechef
chefcode
3
4
12
1455
-----Sample Output:-----
0
1
181
-----Explanation:-----
Pyramid will be formed as explained in the statement.
Query 1: Row number 4 of the pyramid is code. The number of occurrences of chefcode in code is 0.
Query 2: Row number 12 of the pyramid is codechefcode. The number of occurrences of chefcode in codechefcode is 1. | ["def search(arr, lenl, val):\r\n s = 0\r\n l = lenl - 1\r\n\r\n total = 0\r\n\r\n while (s <= l):\r\n m = int((s + l) / 2)\r\n\r\n if (arr[m] <= val):\r\n total = m + 1\r\n s = m + 1\r\n\r\n else:\r\n l = m - 1\r\n\r\n return total\r\n\r\n\r\ndef kmpsearch(string, lps):\r\n lis = []\r\n lens = len(string)\r\n lensh = lens // 2\r\n\r\n l = 0\r\n i = 0\r\n while i < lens:\r\n if string[i] == pat[l]:\r\n l += 1\r\n i += 1\r\n elif l > 0:\r\n l = lps[l - 1]\r\n else:\r\n i += 1\r\n\r\n if l == lenp:\r\n if i - l < lensh:\r\n lis.append(i - l)\r\n\r\n l = lps[l - 1]\r\n\r\n return lis\r\n\r\n\r\ndef kmp(pat, lenp):\r\n\r\n lps = [0]*(lenp)\r\n l = 0\r\n i = 1\r\n\r\n while i < lenp:\r\n if pat[i] == pat[l]:\r\n l += 1\r\n lps[i] = l\r\n i += 1\r\n elif l > 0:\r\n l = lps[l-1]\r\n else:\r\n lps[i] = 0\r\n i += 1\r\n\r\n return lps\r\n\r\n\r\n\r\nkeyword = input()\r\npat = input()\r\nq = int(input())\r\n\r\nlenk = len(keyword)\r\nlenp = len(pat)\r\n\r\nk = keyword * 2\r\nlis = kmpsearch(k, kmp(pat, lenp))\r\nlenl = len(lis)\r\n\r\nfor _ in range(q):\r\n n = int(input())\r\n count = 0\r\n\r\n q = n // lenk\r\n r = n % lenk\r\n\r\n count += search(lis, lenl, r - lenp)\r\n\r\n if q >= 1:\r\n count += search(lis, lenl, lenk + r - lenp)\r\n\r\n if q >= 2:\r\n count += (q - 1)*lenl\r\n\r\n print(count)\r\n \r\n", "def search(arr, lenl, val):\n s = 0\n l = lenl - 1\n\n total = 0\n\n while (s <= l):\n m = int((s + l) / 2)\n\n if (arr[m] <= val):\n total = m + 1\n s = m + 1\n\n else:\n l = m - 1\n\n return total\n\n\ndef kmpsearch(string, lps):\n lis = []\n lens = len(string)\n lensh = lens // 2\n\n l = 0\n i = 0\n while i < lens:\n if string[i] == pat[l]:\n l += 1\n i += 1\n elif l > 0:\n l = lps[l - 1]\n else:\n i += 1\n\n if l == lenp:\n if i - l < lensh:\n lis.append(i - l)\n\n l = lps[l - 1]\n\n return lis\n\n\ndef kmp(pat, lenp):\n\n lps = [0]*(lenp)\n l = 0\n i = 1\n\n while i < lenp:\n if pat[i] == pat[l]:\n l += 1\n lps[i] = l\n i += 1\n elif l > 0:\n l = lps[l-1]\n else:\n lps[i] = 0\n i += 1\n\n return lps\n\n\n\nkeyword = input()\npat = input()\nq = int(input())\n\nlenk = len(keyword)\nlenp = len(pat)\n\nk = keyword * 2\nlis = kmpsearch(k, kmp(pat, lenp))\nlenl = len(lis)\n\nfor _ in range(q):\n n = int(input())\n count = 0\n\n q = n // lenk\n r = n % lenk\n\n count += search(lis, lenl, r - lenp)\n\n if q >= 1:\n count += search(lis, lenl, lenk + r - lenp)\n\n if q >= 2:\n count += (q - 1)*lenl\n\n print(count)", "def kmp(s, t, lps):\r\n n = len(s)\r\n m = len(t)\r\n count = [0 for x in range(n)]\r\n i = 0\r\n j = 0\r\n while i < n:\r\n count[i] = count[i-1]\r\n if t[j] == s[i]:\r\n i += 1\r\n j += 1\r\n if j == m:\r\n count[i-1] += 1\r\n j = lps[j-1]\r\n elif i < n and t[j] != s[i]:\r\n if j != 0:\r\n j = lps[j-1]\r\n else:\r\n i += 1\r\n return count\r\n\r\n\r\ndef lpsa(t, m):\r\n l = 0\r\n lps = [0 for i in range(m)]\r\n i = 1\r\n while i < m:\r\n if t[i] == t[l]:\r\n l += 1\r\n lps[i] = l\r\n i += 1\r\n else:\r\n if l != 0:\r\n l = lps[l-1]\r\n else:\r\n lps[i] = 0\r\n i += 1\r\n return lps\r\n\r\n\r\ns = input()\r\nt = input()\r\nn = len(s)\r\nm = len(t)\r\nlps = lpsa(t, m)\r\none = kmp(s, t, lps)[-1]\r\ncount = kmp(s+s, t, lps)\r\ntwo = count[-1]\r\nthree = two-(2*one)\r\nfor _ in range(int(input())):\r\n q = int(input())\r\n v = q//n\r\n if v:\r\n ans = v*one + (v-1)*three\r\n e = q % n\r\n ans += count[n-1+e]-count[n-1]\r\n else:\r\n e = q % n\r\n ans = count[e-1]\r\n print(ans)\r\n", "def kmp(s,t,lps):\n \n n=len(s)\n m=len(t)\n count=[0 for x in range(n)]\n i=0\n j=0\n while i<n:\n count[i]=count[i-1]\n if t[j]==s[i]:\n i+=1\n j+=1\n if j==m:\n count[i-1]+=1\n j=lps[j-1]\n elif i<n and t[j]!=s[i]:\n if j!=0:\n j=lps[j-1]\n else:\n i+=1\n return count\n \n \n\n\ndef lpsa(t,m):\n l=0\n lps=[0 for i in range(m)]\n i=1\n while i<m:\n if t[i] ==t[l]:\n l+=1\n lps[i]=l\n i+=1\n else:\n if l!=0:\n l=lps[l-1]\n else:\n lps[i]=0\n i+=1\n return lps\n\n\ns=input()\nt=input()\nn=len(s)\nm=len(t)\nlps=lpsa(t,m)\none=kmp(s,t,lps)[-1]\ncount=kmp(s+s,t,lps)\ntwo=count[-1]\nthree=two-(2*one)\n\nfor _ in range(int(input())):\n q=int(input())\n v=q//n\n if v:\n ans=v*one +(v-1)*three\n e=q%n\n ans+=count[n-1+e]-count[n-1]\n else:\n e=q%n\n ans=count[e-1]\n print(ans)", "def kmp(s,t,lps):\n \n n=len(s)\n m=len(t)\n count=[0 for x in range(n)]\n i=0\n j=0\n while i<n:\n count[i]=count[i-1]\n if t[j]==s[i]:\n i+=1\n j+=1\n if j==m:\n count[i-1]+=1\n j=lps[j-1]\n elif i<n and t[j]!=s[i]:\n if j!=0:\n j=lps[j-1]\n else:\n i+=1\n return count\n \n \n\n\ndef lpsa(t,m):\n l=0\n lps= [0 for i in range(m)]\n i=1\n while i<m:\n if t[i] ==t[l]:\n l+=1\n lps[i]=l\n i+=1\n else:\n if l!=0:\n l=lps[l-1]\n else:\n lps[i]=0\n i+=1\n return lps\ns=input()\nt=input()\nn=len(s)\nm=len(t)\nlps=lpsa(t,m)\none=kmp(s,t,lps)[-1]\ncount=kmp(s+s,t,lps)\ntwo=count[-1]\nthree=two-(2*one)\nfor _ in range(int(input())):\n q=int(input())\n v=q//n\n if v:\n ans=v*one +(v-1)*three\n e=q%n\n ans+=count[n-1+e]-count[n-1]\n else:\n e=q%n\n ans=count[e-1]\n print(ans)\n # if one:\n # if q>n:\n # hh=q//n\n # i=0\n # for i in range(hh):\n # ans+=one\n # print(ans)\n # elif two:\n # hh=q//(n+n)\n # i=0\n # for i in range(hh):\n # ans+=two\n # print(ans)\n # elif three:\n # hh=q//(n+n+n)\n # i=0\n # for i in range(hh):\n # ans+=three\n # print(ans)\n # else:\n # print(0)\n # S=''\n # if q<n:\n # for i in range(q):\n # S+=s[i]\n # kmp(S,t,lps)\n \n # elif q==n:\n # kmp(s,t,lps)\n \n # elif q%n==0:\n # tt=q//n\n # for i in range(tt):\n # S+=s\n # kmp(S,t,lps)\n \n # elif q%n!=0:\n # temp=0\n # while temp<q:\n # temp+=n\n # temp=temp-n\n # tem=temp//n\n # for i in range(tem):\n # S+=s\n \n # h=q-temp\n # for i in range(h):\n # S+=s[i]\n # kmp(S,t,lps)\n \n\n\n \n\n\n"] | {"inputs": [["codechef", "chefcode", "3", "4", "12", "1455"]], "outputs": [["0", "1", "181"]]} | INTERVIEW | PYTHON3 | CODECHEF | 7,794 | |
c269466d62007cd058ab61d9651e76f5 | UNKNOWN | Chef is a brilliant university student that does not attend lectures because he believes that they are boring and coding is life! However, his university follows certain rules and regulations, and a student may only take an exam for a course if he has attended at least 75% of lectures for this course.
Since you are Chef's best friend, you want to help him reach the attendance he needs to take exams. Unfortunately, Chef is still focused on his code and refuses to attend more lectures, so the only option is to have some of his friends mark him as present by proxy. This trick is well-known in the university, but only few have the talent to pull it off.
In a certain course, there is exactly one lesson per day over the course of $D$ days (numbered $1$ through $D$). You are given a string $S$ with length $D$ describing the lessons Chef attended — for each valid $i$, the $i$-th character of this string is either 'A' if Chef was absent on day $i$ or 'P' if Chef was actually present on day $i$.
For each day $d$ when Chef is absent, one of Chef's friends can mark him as present by proxy on this day only if he was present (if he was really present, not just marked as present) on at least one of the previous two days, i.e. days $d-1$ and $d-2$, and on at least one of the following two days, i.e. days $d+1$ and $d+2$. However, it is impossible to mark him as present by proxy on the first two days and the last two days.
Find the minimum number of times Chef has to be marked as present by proxy so that his attendance becomes at least 75% ($0.75$). Chef's attendance is number of days when he was marked as present, either by proxy or by actually being present, divided by $D$.
-----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 $D$.
- The second line contains a single string $S$ with length $D$.
-----Output-----
For each test case, print a single line containing one integer — the minimum number of times Chef needs to be marked as present by proxy, or $-1$ if it is impossible to make Chef achieve 75% attendance.
-----Constraints-----
- $1 \le T \le 200$
- $1 \le D \le 1,000$
- $S$ contains only characters 'A' and 'P'
-----Subtasks-----
Subtask #1 (100 points): original constraints
-----Example Input-----
1
9
PAAPPAPPP
-----Example Output-----
1
-----Explanation-----
Example case 1: With a proxy on the third day, the attendance string is "PAPPPAPPP". Now, Chef's attendance is at least 75%, so the minimum number of times Chef needs to be marked as present by proxy is $1$. | ["# cook your dish here\ndef ceil(num):\n if num%1==0:\n return int(num//1)\n else:\n return int((num//1)+1)\n \nfor _ in range(int(input())):\n n=int(input())\n s=input()\n p=0\n a=[]\n for i in range(n):\n if s[i]==\"P\":\n p=p+1\n req=ceil(0.75*n)\n requirement=req-p\n for i in range(2,n-2):\n if s[i]==\"A\":\n if (s[i-1]==\"P\" or s[i-2]==\"P\") and (s[i+1]==\"P\" or s[i+2]==\"P\"):\n a.append(i)\n if requirement>len(a):\n print(-1)\n else:\n print(max(requirement,0))", "# cook your dish here\nimport math\nfor t in range(int(input())):\n d=int(input())\n s=input()\n k=math.ceil(75*d/100)\n p=s.count(\"P\")\n if k<=p:\n print(0)\n else:\n req=k-p\n c=0\n for i in range(2,d-2):\n if s[i]==\"A\":\n if \"P\" in s[i-2:i+1] and \"P\" in s[i+1:i+3]:\n c+=1\n if c==req:\n print(c)\n break\n else:\n print(-1)", "# cook your dish here\nfrom collections import Counter\nfrom math import ceil\nfor _ in range(int(input())):\n \n d=int(input())\n s=input()\n c=Counter(s)\n \n re=ceil(0.75*d)\n ans=0\n if c['P']>=re:\n print(ans)\n continue\n \n for i in range(2,d-2):\n \n if s[i]=='A':\n \n if (s[i-2]=='P' or s[i-1]=='P') and (s[i+2]=='P' or s[i+1]=='P'):\n c['P']+=1\n ans+=1\n \n if c['P']>=re:\n print(ans)\n break\n \n else:\n print(-1)\n \n \n \n \n"] | {"inputs": [["1", "9", "PAAPPAPPP"]], "outputs": [["1"]]} | INTERVIEW | PYTHON3 | CODECHEF | 1,329 | |
54a0a06ca2ad4efd52d534162bdf48ae | UNKNOWN | Snakeland is a well organised city. The houses of the city are organised in an orderly rectangular fashion with dimensions 2 * n, i.e. there are total two rows and n columns. The house in the i-th row and j-th column is also said to be the house at coordinates (i, j). Some of the houses are occupied by snakes, while the others are empty. You are given this information through an array s of dimension 2 * n, where, if s[i][j] = '*', it denotes that there is a snake in the house at coordinates (i, j), and if s[i][j] = '.', it denotes that the house is empty.
These snakes are planning a coup against a mongoose who controls their city from outside. So, they are trying their best to meet with other snakes and spread information about the date of the coup. For spreading this information, they can just hiss from their house and usually their hiss is so loud that it will be heard in all the cells except if there is a soundproof fence built that cuts the voice. Note that the external borders of Snakeland are already built of soundproof material. The mongoose got to know about the plan, and he wants to construct sound proof fences along the borders of the houses so that no two people should be able to communicate with each other. The fence can be either vertical or horizontal. Each fence can be of any length, but the mongoose wants to minimize the number of fences to be built. Find out the minimum number of fences that the mongoose should build.
-----Input-----
The first line of the input contains an integer T denoting number of test cases. The descriptions of the T test cases follow.
The first line of each test case contains a single integer, n.
Each of the next two lines contains n characters denoting the first and the second rows of Snakeland respectively.
-----Output-----
For each test case, output a single integer corresponding to the minimum number of fences that the mongoose needs to build.
-----Constraints-----
- 1 ≤ T ≤ 10
- 1 ≤ n ≤ 105
-----Example-----
Input
3
2
**
**
3
***
*..
3
*..
.*.
Output
2
3
1
-----Explanation-----
All the examples are shown in the pictures. The fences built are shown by red colored horizontal or vertical segments. You can see that after putting these borders no snake can talk with any another snake. | ["# cook your dish here\nt=int(input())\nwhile t:\n n=int(input())\n r1=input()\n r2=input()\n r1count=0\n r2count=0\n count=0\n for i in range(n):\n if(r1[i]==\"*\"):\n r1count+=1\n if(r2[i]==\"*\"):\n r2count+=1\n if(r1count>0) and (r2count>0):\n count=1\n r1count=0\n r2count=0\n i=0\n while(i<n):\n if(r1[i]==\"*\"):\n r1count+=1\n if(r2[i]==\"*\"):\n r2count+=1\n if(r1count>1) or (r2count>1):\n count+=1\n r1count=0\n r2count=0\n i-=1\n i+=1\n elif(r1count==0 and r2count>0) or (r2count==0 and r1count>0):\n count=max(r1count,r2count)-1\n else:\n count=0\n print(count)\n t-=1"] | {"inputs": [["3", "2", "**", "**", "3", "***", "*..", "3", "*..", ".*."]], "outputs": [["2", "3", "1"]]} | INTERVIEW | PYTHON3 | CODECHEF | 623 | |
20f5d3a8f884b5d0edfd998d246045c5 | UNKNOWN | Andrii is good in Math, but not in Programming. He is asking you to solve following problem: Given an integer number N and two sets of integer A and B. Let set A contain all numbers from 1 to N and set B contain all numbers from N + 1 to 2N. Multiset C contains all sums a + b such that a belongs to A and b belongs to B. Note that multiset may contain several elements with the same values. For example, if N equals to three, then A = {1, 2, 3}, B = {4, 5, 6} and C = {5, 6, 6, 7, 7, 7, 8, 8, 9}. Andrii has M queries about multiset C. Every query is defined by a single integer q. Andrii wants to know the number of times q is contained in C. For example, number 6 is contained two times, 1 is not contained in C at all.
Please, help Andrii to answer all the queries.
-----Input-----
The first line of the input contains two integers N and M. Each of the next M line contains one integer q, the query asked by Andrii.
-----Output-----
Output the answer for each query in separate lines as in example.
-----Constraints-----
- 1 ≤ N ≤ 109
- 1 ≤ M ≤ 105
- 1 ≤ q ≤ 3N
-----Example-----
Input:
3 5
6
2
9
7
5
Output:
2
0
1
3
1 | ["# cook your dish here\nimport math;\nfrom math import gcd,sqrt,floor,factorial,ceil\nfrom bisect import bisect_left,bisect_right\nimport bisect;\nimport sys;\nfrom sys import stdin,stdout\nimport os\nsys.setrecursionlimit(pow(10,7))\nimport collections\nfrom collections import defaultdict,Counter\nfrom statistics import median\n# input=stdin.readline\n# print=stdout.write\nfrom queue import Queue\ninf = float(\"inf\")\nfrom operator import neg;\nn,m=map(int,input().split())\nfor i in range(m):\n k=int(input())\n print(max(0,min(k-n-1,3*n+1-k)))\n", "# cook your dish here\nn,m = map(int,input().split())\n\nfor _ in range(m):\n q=int(input())\n \n if q-n-1 > n:\n print(3*n - q +1)\n \n elif q<n+2 or q>(3*n):\n print(0)\n \n else:\n print(q-n-1)", "n,m = map(int,input().split())\nfor i in range(m):\n x=int(input())\n if (n+2)>x or x>(3*n):\n print(0)\n elif (2*n)+1==x:\n print(n)\n elif (2*n)+1>x:\n print(n-(((2*n)+1)-x))\n else:\n print(n-(x-((2*n)+1)))", "# cook your dish here\nn,m=map(int,input().split())\nfor i in range(m):\n x=int(input())\n a=0\n if (n+2)>x or x>(3*n):\n a=0\n elif (2*n)+1==x:\n a=n\n elif (2*n)+1>x:\n \n a=n-(((2*n)+1)-x)\n else:\n a=n-(x-((2*n)+1))\n print(a)", "n,m=map(int,input().split())\na=[]\nfor i in range(m):\n\tx=int(input())\n\tif x<=n+1 or x>3*n:\n\t\tprint(0)\n\telif x<=(2*n)+1:\n\t\tprint(x-n-1)\n\telse:\n\t\tprint((3*n)+1-x)\n\t\t# cook your dish here\n", "from collections import defaultdict \ndef def_value(): \n return 0\nn,m=map(int,input().split())\nfor i in range(m):\n\tx=int(input())\n\tif x<=n+1 or x>3*n:\n\t\tprint(0)\n\telif x<=(2*n)+1:\n\t\tprint(x%(n+1))\n\telse:\n\t\tprint((3*n)+1-x)", "ans = []\n\nN,M = [int(i) for i in input().split()]\n\nfor i in range(M):\n q = int(input())\n if(q<=N):\n s = 0\n elif(q<=2*N):\n s = q-N-1\n else:\n s = N - (q-2*N-1)\n ans.append(s)\n\nfor i in ans:\n print(i)\n", "# cook your dish here\nn, m = map(int, input().split())\nfor i in range(m):\n q = int(input())\n if q < n + 2:\n print(0)\n else:\n s = 3 * n - q\n if s < n:\n print(s + 1)\n else:\n print(q - (2 + n) + 1)\n", "n,m=map(int,input().split())\na=[]\nfor i in range(m):\n\tx=int(input())\n\tif x<=n+1 or x>3*n:\n\t\tprint(0)\n\telif x<=(2*n)+1:\n\t\tprint(x%(n+1))\n\telse:\n\t\tprint((3*n)+1-x)\n\t\t\n", "n,m=map(int,input().split())\r\nma=n*2+1\r\nfor i in range(m):\r\n x=int(input())\r\n if(x>n+1):\r\n z=abs(ma-x)\r\n print(n-z)\r\n else:\r\n print(0)\r\n", "# cook your dish here\nn,m=map(int,input().split())\nfor i in range(m):\n \n q=int(input())\n if q<n+2 or q>3*n:\n print(0)\n else:\n print(n-(abs(q-((2*n)+1))))\n \n ", "from sys import stdin,stdout\r\ndef problem():\r\n n , m = [int(x) for x in stdin.readline().split()]\r\n for _ in range(m):\r\n q = int(stdin.readline());l = max(q-n,n+1);r = min(q -1 ,2*n)\r\n if r >= l:print(r- l + 1)\r\n else:print(0)\r\nproblem()", "# cook your dish here\nn,m=map(int,input().split())\nfor _ in range(m):\n q=int(input())\n if q<n+2 or q>2*n+n:\n print(0)\n continue\n else:\n low=n+2\n high=2*n+n\n count=1+min(abs(q-low),abs(q-high))\n print(count) \n\n", "# cook your dish here\nn,m=map(int,input().split())\nfor i in range(m):\n x=int(input())\n if x<=n or x>3*n:\n print(0)\n elif x>n and x<=2*n:\n print(x-n-1)\n else:\n print(n-(x%(2*n))+1)\n", "# cook your dish here\nn,m=map(int,input().split())\nfor i in range(m):\n x=int(input())\n if x<=n or x>3*n:\n print(0)\n elif x>n and x<=2*n:\n print(x-n-1)\n else:\n print(n-(x%(2*n))+1)", "# cook your dish here\n# cook your dish here\nn,m=map(int,input().split())\nfor i in range(m):\n x=int(input())\n if x<=n or x>3*n:\n print(0)\n elif x>n and x<=2*n:\n print(x-n-1)\n else:\n print(n-(x%(2*n))+1)\n \n \n ", "# cook your dish here\nn,m=map(int,input().split())\nfor i in range(m):\n x=int(input())\n if x<=n or x>3*n:\n print(0)\n elif x>n and x<=2*n:\n print(x-n-1)\n else:\n print(n-(x%(2*n))+1)\n \n \n ", "# cook your dish here\nn,m=map(int,input().split())\nfor i in range(m):\n x=int(input())\n if(x<=n or x>3*n):\n print(0)\n elif(x>n and x<=2*n):\n print(x-n-1)\n else:\n print(n-(x%(2*n))+1)", "# cook your dish here\nn,m=map(int,input().split())\nfor i in range(m):\n x=int(input())\n if(x<=n or x>3*n):\n print(0)\n elif(x>n and x<=2*n):\n print(x-n-1)\n else:\n print(n-(x%(2*n))+1)\n", "# cook your dish here\nn,m=map(int,input().split())\nfor i in range(m):\n q=int(input()) \n if q>=n+2:\n if q<=2*n+1:\n print(q-n-1)\n else:\n print(3*n-q+1) \n else:\n print(\"0\")", "# cook your dish here\nn,m = list(map(int,input().split(\" \")))\nfor i in range(m):\n q = int(input())\n if(q<n+2):\n print('0')\n continue\n else:\n print(n-abs(2*n +1 -q))", "# cook your dish here\nn,m=map(int,input().split())\nfor i in range(m):\n q=int(input()) \n if q>=n+2:\n if q<=2*n+1:\n print(q-n-1)\n else:\n print(3*n-q+1) \n else:\n print(\"0\")", "a,b=map(int,input().strip().split())\r\nfor j in range(b):\r\n\tn=int(input())\r\n\tif(n<=a+1 or n>3*a):print(0)\r\n\t\r\n\telse:\r\n\t\tmi=min(n-a-1,3*a-n+1)\r\n\t\tprint(mi)", "n,m = map(int,input().split())\r\nfor i in range(m):\r\n q = int(input())\r\n if q>n+1: print(q-n-1) if q<2*(n+1) else print(3*n-q+1)\r\n else: print('0')"] | {"inputs": [["3 5", "6", "2", "9", "7", "5", ""]], "outputs": [["2", "0", "1", "3", "1"]]} | INTERVIEW | PYTHON3 | CODECHEF | 5,896 | |
f1e0fd2219aa3432da1286f20defa005 | UNKNOWN | There are $N$ cells numbered 1,2,….., N, and every cell has some positive value. you will be given an array $A_1$,$A_2$,…,$A_N$ where $A_i$ is the value of $ith$ cell and an integer $K$.
There is a monkey who wants to reach the $right$ side of the last ($Nth$) cell, initially, the monkey was left side of the first ($1st$) cell.
In the first step, he can jump into any cell numbered 1,2,….., K.Once he jumped into any cell $i$ next he can only jump to the cell $j$ such that-
- j>i
- j-i <= K
- A[i]%2 == A[j]%2
You have to find out what is the minimum number of steps required to reach the right side of the cell or In case it's not possible to reach the right side of the cell your answer should be $-1$.NOTE: As soon as monkey reach any cell whose distance from the last cell is less than K, then in the last step, he will jump out to the right side of the ($Nth$) cell.
-----Input:-----
- First-line will contain $T$, the number of test cases. Then the test cases follow.
- 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$,…,$A_N$
-----Output:-----
For each test case, output in a single line minimum steps or $-1$.
-----Constraints-----
- $1 \leq T \leq 100$
- $1 \leq N \leq 2*10^5$
- $1 \leq K \leq N$
- $0 \leq A_i \leq 10^6$
- $\text{the sum of N over all test cases does not exceed $5*10^{5}$}$
-----Sample Input:-----
1
2 2
3 4
-----Sample Output:-----
2
-----EXPLANATION:-----
in the first step, you can jump into any cell 1 or 2 and then in the second step you will jump
out to the right side of 2nd cell
remember we don't want to reach $Nth$ cell we want to reach the right side of the nth cell. | ["from sys import setrecursionlimit\r\nsetrecursionlimit(10 * 9)\r\n\r\ndef solve(i):\r\n if i + k >= n:\r\n return 1\r\n\r\n if i in dp:\r\n return dp[i]\r\n\r\n mini = float('inf')\r\n for j in range(i+1, min(n, i+k+1)):\r\n if i == -1 or a[i] == a[j]:\r\n mini = min(mini, solve(j) + 1)\r\n\r\n dp[i] = mini\r\n return dp[i]\r\n\r\n\r\nfor _ in range(int(input())):\r\n n, k = map(int, input().split())\r\n a = list(map(lambda x: int(x) % 2, input().split()))\r\n\r\n le = lo = -1\r\n se = so = -1\r\n\r\n for i in range(n-k, n):\r\n if a[i] == 0:\r\n le = i\r\n break\r\n\r\n for i in range(n-k, n):\r\n if a[i] == 1:\r\n lo = i\r\n break\r\n\r\n m1 = float('inf')\r\n if le != -1:\r\n m1 = 0\r\n while True:\r\n lle = -1\r\n\r\n for i in range(se + 1, se + k + 1):\r\n if i == le:\r\n m1 += 2\r\n break\r\n\r\n if a[i] == 0:\r\n lle = i\r\n\r\n else:\r\n if lle == -1:\r\n m1 = float('inf')\r\n break\r\n\r\n se = lle\r\n m1 += 1\r\n continue\r\n\r\n break\r\n\r\n m2 = float('inf')\r\n if lo != -1:\r\n m2 = 0\r\n while True:\r\n llo = -1\r\n\r\n for i in range(so + 1, so + k + 1):\r\n if i == lo:\r\n m2 += 2\r\n break\r\n\r\n if a[i] == 1:\r\n llo = i\r\n\r\n else:\r\n if llo == -1:\r\n m2 = float('inf')\r\n break\r\n\r\n so = llo\r\n m2 += 1\r\n continue\r\n\r\n break\r\n\r\n if min(m1, m2) != float('inf'):\r\n print(min(m1, m2))\r\n else:\r\n print(-1)", "def f(c):\r\n t = s + c\r\n i = 0\r\n r = 1\r\n while i < len(t):\r\n j = t.rfind(c, i, i + k)\r\n if j < 0:\r\n return n \r\n r += 1\r\n i = j + 1\r\n return r\r\n\r\nR = lambda: list(map(int, input().split()))\r\nt, = R()\r\nfor _ in range(t):\r\n n, k = R()\r\n n += 3\r\n s = ''.join(f'{x%2}' for x in R())\r\n print(min(list(map(f, '01'))) % n - 1)\r\n", "def f(c):\r\n t = s + c\r\n i = 0\r\n r = 1\r\n while i < len(t):\r\n j = t.rfind(c, i, i + k)\r\n if j < 0:\r\n return n \r\n r += 1\r\n i = j + 1\r\n return r\r\n\r\nR = lambda: list(map(int, input().split()))\r\nt, = R()\r\nfor _ in range(t):\r\n n, k = R()\r\n n += 2\r\n s = ''.join(f'{x%2}' for x in R())\r\n print(min(list(map(f, '01'))) % n - 1)\r\n", "def f(c):\r\n t = s + c\r\n i = 0\r\n r = 1\r\n while i < len(t):\r\n j = t.rfind(c, i, i + k)\r\n if j < 0:\r\n return n \r\n r += 1\r\n i = j + 1\r\n return r\r\n\r\nR = lambda: list(map(int, input().split()))\r\nt, = R()\r\nfor _ in range(t):\r\n n, k = R()\r\n n += 3\r\n s = ''.join(f'{x%2}' for x in R())\r\n print(min(list(map(f, '01'))) % n - 1)\r\n", "def f(c):\r\n t = s + c\r\n i = 0\r\n r = 1\r\n while i < len(t):\r\n j = t.rfind(c, i, i + k)\r\n if j < 0:\r\n return n \r\n r += 1\r\n i = j + 1\r\n return r\r\n\r\nR = lambda: list(map(int, input().split()))\r\nt, = R()\r\nfor _ in range(t):\r\n n, k = R()\r\n n += 3\r\n s = ''.join(f'{x%2}' for x in R())\r\n print(min(f(c) for c in '01') % n - 1)\r\n", "def f(s):\r\n i = 0\r\n r = 1\r\n while i < len(s):\r\n j = s.rfind(s[-1], i, i + k)\r\n if j < 0:\r\n return n\r\n r += 1\r\n i = j + 1\r\n return r\r\n\r\nR = lambda: list(map(int, input().split()))\r\nt, = R()\r\nfor _ in range(t):\r\n n, k = R()\r\n n += 3\r\n s = ''.join(f'{x%2}' for x in R())\r\n print(min(f(s + c) for c in '01') % n - 1)\r\n", "# cook your dish here\n#2\n\nfor t in range(int(input())):\n n, k = list(map(int, input().split()))\n A = list(map(int, input().split()))\n\n if k > n:\n print(1)\n continue\n #even \n curr = -1\n i = 0\n temp_even_place = -1\n ans_of_even = 0\n while curr + k < n: #need to find a stop \n while i-curr <= k:\n if A[i]%2 == 0:\n temp_even_place = i\n i+=1\n if temp_even_place == curr: #no new stop found\n ans_of_even = -1\n break\n else:\n ans_of_even += 1\n curr = temp_even_place\n if ans_of_even != -1:\n ans_of_even += 1\n\n #odd \n curr = -1\n i = 0\n temp_odd_place = -1\n ans_of_odd = 0\n while curr + k < n: #need to find a stop \n while i-curr <= k:\n if A[i]%2 == 1:\n temp_odd_place = i\n i+=1\n if temp_odd_place == curr: #no new stop found\n ans_of_odd = -1\n break\n else:\n ans_of_odd += 1\n curr = temp_odd_place\n if ans_of_odd != -1:\n ans_of_odd += 1\n\n if ans_of_even == -1 and ans_of_odd == -1:\n print(-1)\n elif ans_of_odd == -1 and ans_of_even != -1:\n print(ans_of_even)\n elif ans_of_odd != -1 and ans_of_even == -1:\n print(ans_of_odd)\n elif ans_of_odd != -1 and ans_of_even != -1:\n print(min(ans_of_even,ans_of_odd) )\n \n \n", "import sys\r\n# sys.stdin = open('input.txt', 'r') \r\n# sys.stdout = open('output.txt', 'w')\r\n \r\nimport math\r\nimport collections\r\nfrom sys import stdin,stdout,setrecursionlimit\r\nimport bisect as bs\r\nsetrecursionlimit(2**20)\r\nM = 10**9+7\r\n \r\nT = int(stdin.readline())\r\n# T = 1\r\n\r\nfor _ in range(T):\r\n # n = int(stdin.readline())\r\n n,k = list(map(int,stdin.readline().split()))\r\n a = list(map(int,stdin.readline().split()))\r\n # w = list(map(int,stdin.readline().split()))\r\n # q = list(map(int,stdin.readline().split()))\r\n # b = list(map(int,stdin.readline().split()))\r\n # s = stdin.readline().strip('\\n')\r\n p = [[0]]; p.append([0])\r\n for i in range(n):\r\n p[a[i]%2].append(i+1)\r\n p[0].append(n+1); p[1].append(n+1)\r\n res = [True, True]\r\n for j in range(2):\r\n for i in range(len(p[j])-1):\r\n if(p[j][i+1] - p[j][i] > k):\r\n res[j] = False\r\n break\r\n mn = 500000\r\n for j in range(2):\r\n if(not res[j]):\r\n continue\r\n i = 1; s = 0; m=0\r\n while(i<len(p[j])):\r\n if(p[j][i]-s > k):\r\n s = p[j][i-1]\r\n m += 1\r\n else:\r\n i += 1\r\n m += 1\r\n mn = min(mn,m)\r\n if(mn == 500000):\r\n print(-1)\r\n else:\r\n print(mn)", "import sys\r\n# sys.stdin = open('input.txt', 'r') \r\n# sys.stdout = open('output.txt', 'w')\r\n \r\nimport math\r\nimport collections\r\nfrom sys import stdin,stdout,setrecursionlimit\r\nimport bisect as bs\r\nsetrecursionlimit(2**20)\r\nM = 10**9+7\r\n \r\nT = int(stdin.readline())\r\n# T = 1\r\n\r\nfor _ in range(T):\r\n # n = int(stdin.readline())\r\n n,k = list(map(int,stdin.readline().split()))\r\n a = list(map(int,stdin.readline().split()))\r\n # w = list(map(int,stdin.readline().split()))\r\n # q = list(map(int,stdin.readline().split()))\r\n # b = list(map(int,stdin.readline().split()))\r\n # s = stdin.readline().strip('\\n')\r\n p = [[0]]; p.append([0])\r\n for i in range(n):\r\n p[a[i]%2].append(i+1)\r\n p[0].append(n+1); p[1].append(n+1)\r\n res = [True, True]\r\n for j in range(2):\r\n for i in range(len(p[j])-1):\r\n if(p[j][i+1] - p[j][i] > k):\r\n res[j] = False\r\n break\r\n mn = 500000\r\n for j in range(2):\r\n if(not res[j]):\r\n continue\r\n i = 1; s = 0; m=0\r\n while(i<len(p[j])):\r\n if(p[j][i]-s > k):\r\n s = p[j][i-1]\r\n m += 1\r\n else:\r\n i += 1\r\n m += 1\r\n mn = min(mn,m)\r\n if(mn == 500000):\r\n print(-1)\r\n else:\r\n print(mn)"] | {"inputs": [["1", "2 2", "3 4"]], "outputs": [["2"]]} | INTERVIEW | PYTHON3 | CODECHEF | 8,267 | |
82ae0f03da3911df040390854bf7b06e | UNKNOWN | Given an array of size N$N$ and two integers K$K$ and S$S$, the special sum of a subarray is defined as follows:
(Sum of all elements of the subarray) * (K$K$ - p$p$ * S$S$)
Where p$p$ = number of distinct prime factors of “product of all elements of the subarray”.
Find the maximum special sum by considering all non-empty subarrays of the given array.
-----Input-----
- First line contains 3 integers N$N$, K$K$ and S$S$.
- Second line contains N$N$ integers, the elements of the array.
-----Output-----
Output a single integer. The maximum special sum considering all non-empty subarrays of the array.
-----Constraints:-----
- 1≤N,K,S≤105$ 1 \leq N, K, S \leq 10^5 $
- 0≤K/S≤20$ 0 \leq K / S \leq 20 $
- 1<$ 1 < $ Any element of array <105$ < 10^5 $
-----Sample Input-----
4 10 2
14 2 7 15
-----Sample Output-----
138
-----Sample Explanation-----
Consider the subarray {14, 2, 7}
Total number of distinct prime factors in it is 2 (2 and 7).
Therefore, value of special sum is (14 + 2 + 7) * (10 - 2 * 2) = 138.
This is the subarray with the maximum special sum. | ["# cook your dish here\nfrom math import floor, sqrt\ntry:long\nexcept NameError:long = int \ndef fac(n):\n step,maxq,d = lambda x: 1 + (x<<2) - ((x>>1)<<1),long(floor(sqrt(n))),1\n q = n % 2 == 0 and 2 or 3 \n while q <= maxq and n % q != 0:\n q = step(d)\n d += 1\n return q <= maxq and [q] + fac(n//q) or [n]\nn,k,s = map(int,input().split())\na,di,l,m,ans,su =list(map(int,input().split())),{},[],0,0,0\nfor i in a:\n bb,su = list(set(fac(i))),su+i\n for j in bb:\n try:di[j]+=1\n except KeyError:m,di[j] = m+1,1\n l.append(su*(k-m*s))\n if su*(k-m*s) <0:m,di,su = 0,{},0\nprint(max(l))", "from math import floor, sqrt\ntry:long\nexcept NameError:long = int \ndef fac(n):\n step,maxq,d = lambda x: 1 + (x<<2) - ((x>>1)<<1),long(floor(sqrt(n))),1\n q = n % 2 == 0 and 2 or 3 \n while q <= maxq and n % q != 0:\n q = step(d)\n d += 1\n return q <= maxq and [q] + fac(n//q) or [n]\nn,k,s = map(int,input().split())\na,di,l,m,ans,su =list(map(int,input().split())),{},[],0,0,0\nfor i in a:\n bb,su = list(set(fac(i))),su+i\n for j in bb:\n try:di[j]+=1\n except KeyError:m,di[j] = m+1,1\n l.append(su*(k-m*s))\n if su*(k-m*s) <0:m,di,su = 0,{},0\nprint(max(l))", "# cook your dish here\nfrom math import floor, sqrt\ntry:long\nexcept NameError:long = int \ndef fac(n):\n step,maxq,d = lambda x: 1 + (x<<2) - ((x>>1)<<1),long(floor(sqrt(n))),1\n q = n % 2 == 0 and 2 or 3 \n while q <= maxq and n % q != 0:\n q = step(d)\n d += 1\n return q <= maxq and [q] + fac(n//q) or [n]\nn,k,s = map(int,input().split())\na,di,l,m,ans,su =list(map(int,input().split())),{},[],0,0,0\nfor i in a:\n bb,su = list(set(fac(i))),su+i\n for j in bb:\n try:di[j]+=1\n except KeyError:m,di[j] = m+1,1\n l.append(su*(k-m*s))\n if su*(k-m*s) <0:m,di,su = 0,{},0\nprint(max(l))", "from math import floor, sqrt\ntry:int\nexcept NameError:long = int \ndef fac(n):\n step,maxq,d = lambda x: 1 + (x<<2) - ((x>>1)<<1),int(floor(sqrt(n))),1\n q = n % 2 == 0 and 2 or 3 \n while q <= maxq and n % q != 0:\n q = step(d)\n d += 1\n return q <= maxq and [q] + fac(n//q) or [n]\nn,k,s = list(map(int,input().split()))\na,di,l,m,ans,su =list(map(int,input().split())),{},[],0,0,0\nfor i in a:\n bb,su = list(set(fac(i))),su+i\n for j in bb:\n try:di[j]+=1\n except KeyError:m,di[j] = m+1,1\n l.append(su*(k-m*s))\n if su*(k-m*s) <0:m,di,su = 0,{},0\nprint(max(l))\n", "from math import floor, sqrt\ntry:long\nexcept NameError:long = int \ndef fac(n):\n step,maxq,d = lambda x: 1 + (x<<2) - ((x>>1)<<1),long(floor(sqrt(n))),1\n q = n % 2 == 0 and 2 or 3 \n while q <= maxq and n % q != 0:\n q = step(d)\n d += 1\n return q <= maxq and [q] + fac(n//q) or [n]\nn,k,s = map(int,input().split())\na,di,l,m,ans,su =list(map(int,input().split())),{},[],0,0,0\nfor i in a:\n bb,su = list(set(fac(i))),su+i\n for j in bb:\n try:di[j]+=1\n except KeyError:m,di[j] = m+1,1\n l.append(su*(k-m*s))\n if su*(k-m*s) <0:m,di,su = 0,{},0\nprint(max(l))", "from math import floor, sqrt\ntry:long\nexcept NameError:long = int \ndef fac(n):\n step,maxq,d = lambda x: 1 + (x<<2) - ((x>>1)<<1),long(floor(sqrt(n))),1\n q = n % 2 == 0 and 2 or 3 \n while q <= maxq and n % q != 0:\n q = step(d)\n d += 1\n return q <= maxq and [q] + fac(n//q) or [n]\nn,k,s = map(int,input().split())\na,di,l,m,ans,su =list(map(int,input().split())),{},[],0,0,0\nfor i in a:\n bb,su = list(set(fac(i))),su+i\n for j in bb:\n try:di[j]+=1\n except KeyError:m,di[j] = m+1,1\n l.append(su*(k-m*s))\n if su*(k-m*s) <0:m,di,su = 0,{},0\nprint(max(l))", "# cook your dish here\nfrom math import floor, sqrt\ntry:long\nexcept NameError:long = int \ndef fac(n):\n step,maxq,d = lambda x: 1 + (x<<2) - ((x>>1)<<1),long(floor(sqrt(n))),1\n q = n % 2 == 0 and 2 or 3 \n while q <= maxq and n % q != 0:\n q = step(d)\n d += 1\n return q <= maxq and [q] + fac(n//q) or [n]\nn,k,s = map(int,input().split())\na,di,l,m,ans,su =list(map(int,input().split())),{},[],0,0,0\nfor i in a:\n bb,su = list(set(fac(i))),su+i\n for j in bb:\n try:di[j]+=1\n except KeyError:m,di[j] = m+1,1\n l.append(su*(k-m*s))\n if su*(k-m*s) <0:m,di,su = 0,{},0\nprint(max(l))", "from math import floor, sqrt\ntry:long\nexcept NameError:long = int \ndef fac(n):\n step,maxq,d = lambda x: 1 + (x<<2) - ((x>>1)<<1),long(floor(sqrt(n))),1\n q = n % 2 == 0 and 2 or 3 \n while q <= maxq and n % q != 0:\n q = step(d)\n d += 1\n return q <= maxq and [q] + fac(n//q) or [n]\nn,k,s = map(int,input().split())\na,di,l,m,ans,su =list(map(int,input().split())),{},[],0,0,0\nfor i in a:\n bb,su = list(set(fac(i))),su+i\n for j in bb:\n try:di[j]+=1\n except KeyError:m,di[j] = m+1,1\n l.append(su*(k-m*s))\n if su*(k-m*s) <0:m,di,su = 0,{},0\nprint(max(l))"] | {"inputs": [["4 10 2", "14 2 7 15"]], "outputs": [["138", "Sample"]]} | INTERVIEW | PYTHON3 | CODECHEF | 4,955 | |
a57f5ff7127a978191f4e05ffa06bb1a | UNKNOWN | Chef recently developed an affinity for undirected graphs.
He likes pairs of graphs that are similar in structure.
However, Chef discovered that when the vertices of a graph are reorganized, it's often the case that the resulting graph,
although still structurally similar to the original, can look completely different.
Chef wants you to help him find similarities in pairs of graphs.
Chef only considers pairs of graphs where each graph has the same number of vertices (say N).
Chef then labels each vertex of each graph with an integer between 1 and N (inclusive),
using each integer exactly once per graph.
Chef then defines the similarity of the graphs as 2*COMMON/TOTAL, where COMMON is the number of
edges appearing in both graphs
(that is, the number of unordered pairs {A, B} such that in both graphs there exists an edge between the vertex labelled A
and the vertex labelled B), and TOTAL is the total number of edges in both graphs.
Chef's measure of similarity depends on how the vertices are labelled.
Chef wants you to help him find a labelling that maximizes the similarity.
Optimal solutions are not required, but better solutions will earn more points.
-----Input-----
Input will begin with an integer T, the number of test cases.
Each test case will begin with an integer N, the number of vertices in both graphs.
2*N lines follow. The first N lines describe the first graph, and the next N lines the second graph.
Each graph description consists of N lines of N integers each.
The i-th integer on the j-th line will be 1 if there is an edge between vertices i and j, and 0 otherwise.
The i-th integer on the j-th line will always be equal to the j-th integer on the i-th line,
and the i-th integer on the i-th line will always be 0.
-----Output-----
For each test case, output 2 lines with N integers each.
Each line must contain a permutation of the integers 1 through N, and indicates how Chef should label the corresponding graph.
-----Scoring-----
Your score for each test case is the similarity of the 2 graphs using the labelling you provide.
Your overall score is the average of your scores on the individual test cases.
-----Sample Input-----
2
3
0 1 0
1 0 0
0 0 0
0 0 1
0 0 1
1 1 0
4
0 0 1 0
0 0 0 0
1 0 0 1
0 0 1 0
0 0 1 1
0 0 0 0
1 0 0 0
1 0 0 0
-----Sample Output-----
1 2 3
1 2 3
1 4 2 3
2 4 1 3
This output would score 2*0/3 = 0.0 on the first test case, and 2*2/4 = 1.0 on the second test case, for an overall score of 0.5.
Note that better scores are possible.
-----Test case generation-----
For each official test file, T is 5.
For each test case, N is randomly chosen between 30 and 75.
A real number D is randomly chosen between 0.05 and 0.5.
For each pair of vertices, an edge is added with probability D.
This graph is output as the first graph.
An integer C is randomly chosen between 0 and N*(N-1)/2.
C distinct pairs of vertices are chosen.
For each pair, if an edge currently exists between them, the edge is removed with probability (1-D).
If no edge exists between them, one is added with probability D.
Then, a random permutation is applied to the vertices of the graph, and it is output as the second graph.
You may safely assume there will be no test cases where TOTAL is 0. | ["import random\nt=int(input())\nfor testCase in range(t):\n\tn=int(input())\n\tarray1=[]\n\tarray2=[]\n\tarray=[]\n\tfor i in range(n) :\n\t\tarray1.append(list(map(int,input().split())))\n\tfor i in range(n) :\n\t\tarray2.append(list(map(int,input().split())))\n\tfor i in range(n) :\n\t\tarray.append(i)\n#\tprint array2,\" \",array1\n\tfor i in range(n) :\n\t\tprint(array[i]+1, end=' ') \n\tprint() \n\tk=0\n\tmax=0\n\tanswer=[]\n\ttemp=[]\n\twhile k < (1<<5) :\n\t\tk+=1\t\n\t\tfor i in range(n) :\n\t\t\trand=random.randint(0,len(array)-1)\n\t\t\ttemp.append(array[rand])\n\t\t\tarray.pop(rand)\n\t\tarray = temp\n\t\tcount=0\n\t\tfor i in range(n) :\n\t\t\tfor j in range(n) :\n\t\t\t\tif(array1[i][j] and array2[array[i]][array[j]]) :\n\t\t\t\t\tcount+=1\n\t\tif(count > max):\n\t\t\tanswer=array\n\t\t\tmax=count\n\t\t\t#print max,count\n\tfor x in answer :\n\t\tprint(x+1, end=' ')\n\tprint()", "import random\nt=int(input())\nfor testCase in range(t):\n\tn=int(input())\n\tarray1=[]\n\tarray2=[]\n\tarray=[]\n\tfor i in range(n) :\n\t\tarray1.append(list(map(int,input().split())))\n\tfor i in range(n) :\n\t\tarray2.append(list(map(int,input().split())))\n\tfor i in range(n) :\n\t\tarray.append(i)\n#\tprint array2,\" \",array1\n\tfor i in range(n) :\n\t\tprint(array[i]+1, end=' ') \n\tprint() \n\tk=0\n\tmax=0\n\tanswer=[]\n\ttemp=[]\n\twhile k < (1<<5) :\n\t\tk+=1\t\n\t\tfor i in range(n) :\n\t\t\trand=random.randint(0,len(array)-1)\n\t\t\ttemp.append(array[rand])\n\t\t\tarray.pop(rand)\n\t\tarray = temp\n\t\tcount=0\n\t\tfor i in range(n) :\n\t\t\tfor j in range(n) :\n\t\t\t\tif(array1[i][j] and array2[array[i]][array[j]]) :\n\t\t\t\t\tcount+=1\n\t\tif(count > max):\n\t\t\tanswer=array\n\t\t\tmax=count\n\t\t\t#print max,count\n\tfor x in answer :\n\t\tprint(x+1, end=' ')\n\tprint()", "import random\nt=int(input())\nfor testCase in range(t):\n\tn=int(input())\n\tarray1=[]\n\tarray2=[]\n\tarray=[]\n\tfor i in range(n) :\n\t\tarray1.append(list(map(int,input().split())))\n\tfor i in range(n) :\n\t\tarray2.append(list(map(int,input().split())))\n\tfor i in range(n) :\n\t\tarray.append(i)\n#\tprint array2,\" \",array1\n\tfor i in range(n) :\n\t\tprint(array[i]+1, end=' ') \n\tprint() \n\tk=0\n\tmax=0\n\tanswer=[]\n\ttemp=[]\n\twhile k < (1<<5) :\n\t\tk+=1\t\n\t\tfor i in range(n) :\n\t\t\trand=random.randint(0,len(array)-1)\n\t\t\ttemp.append(array[rand])\n\t\t\tarray.pop(rand)\n\t\tarray = temp\n\t\tcount=0\n\t\tfor i in range(n) :\n\t\t\tfor j in range(n) :\n\t\t\t\tif(array1[i][j] and array2[array[i]][array[j]]) :\n\t\t\t\t\tcount+=1\n\t\tif(count > max):\n\t\t\tanswer=array\n\t\t\tmax=count\n\t\t\t#print max,count\n\tfor x in answer :\n\t\tprint(x+1, end=' ')\n\tprint()", "import random\nt=int(input())\nfor testCase in range(t):\n\tn=int(input())\n\tarray1=[]\n\tarray2=[]\n\tarray=[]\n\tfor i in range(n) :\n\t\tarray1.append(list(map(int,input().split())))\n\tfor i in range(n) :\n\t\tarray2.append(list(map(int,input().split())))\n\tfor i in range(n) :\n\t\tarray.append(i)\n#\tprint array2,\" \",array1\n\tfor i in range(n) :\n\t\tprint(array[i]+1, end=' ') \n\tprint() \n\tk=0\n\tmax=0\n\tanswer=[]\n\ttemp=[]\n\twhile k < (1<<5) :\n\t\tk+=1\t\n\t\tfor i in range(n) :\n\t\t\trand=random.randint(0,len(array)-1)\n\t\t\ttemp.append(array[rand])\n\t\t\tarray.pop(rand)\n\t\tarray = temp\n\t\tcount=0\n\t\tfor i in range(n) :\n\t\t\tfor j in range(n) :\n\t\t\t\tif(array1[i][j] and array2[array[i]][array[j]]) :\n\t\t\t\t\tcount+=1\n\t\tif(count > max):\n\t\t\tanswer=array\n\t\t\tmax=count\n\t\t\t#print max,count\n\tfor x in answer :\n\t\tprint(x+1, end=' ')\n\tprint()", "import random\nt=int(input())\nfor testCase in range(t):\n\tn=int(input())\n\tarray1=[]\n\tarray2=[]\n\tarray=[]\n\tfor i in range(n) :\n\t\tarray1.append(list(map(int,input().split())))\n\tfor i in range(n) :\n\t\tarray2.append(list(map(int,input().split())))\n\tfor i in range(n) :\n\t\tarray.append(i)\n#\tprint array2,\" \",array1\n\tfor i in range(n) :\n\t\tprint(array[i]+1, end=' ') \n\tprint() \n\tk=0\n\tmax=0\n\tanswer=[]\n\ttemp=[]\n\twhile k < (1<<5) :\n\t\tk+=1\t\n\t\tfor i in range(n) :\n\t\t\trand=random.randint(0,len(array)-1)\n\t\t\ttemp.append(array[rand])\n\t\t\tarray.pop(rand)\n\t\tarray = temp\n\t\tcount=0\n\t\tfor i in range(n) :\n\t\t\tfor j in range(n) :\n\t\t\t\tif(array1[i][j] and array2[array[i]][array[j]]) :\n\t\t\t\t\tcount+=1\n\t\tif(count > max):\n\t\t\tanswer=array\n\t\t\tmax=count\n\t\t\t#print max,count\n\tfor x in answer :\n\t\tprint(x+1, end=' ')\n\tprint()", "import random\nt=int(input())\nfor testCase in range(t):\n\tn=int(input())\n\tarray1=[]\n\tarray2=[]\n\tarray=[]\n\tfor i in range(n) :\n\t\tarray1.append(list(map(int,input().split())))\n\tfor i in range(n) :\n\t\tarray2.append(list(map(int,input().split())))\n\tfor i in range(n) :\n\t\tarray.append(i)\n#\tprint array2,\" \",array1\n\tfor i in range(n) :\n\t\tprint(array[i]+1, end=' ') \n\tprint() \n\tk=0\n\tmax=0\n\tanswer=[]\n\ttemp=[]\n\twhile k < (1<<5) :\n\t\tk+=1\t\n\t\tfor i in range(n) :\n\t\t\trand=random.randint(0,len(array)-1)\n\t\t\ttemp.append(array[rand])\n\t\t\tarray.pop(rand)\n\t\tarray = temp\n\t\tcount=0\n\t\tfor i in range(n) :\n\t\t\tfor j in range(n) :\n\t\t\t\tif(array1[i][j] and array2[array[i]][array[j]]) :\n\t\t\t\t\tcount+=1\n\t\tif(count > max):\n\t\t\tanswer=array\n\t\t\tmax=count\n\t\t\t#print max,count\n\tfor x in answer :\n\t\tprint(x+1, end=' ')\n\tprint()", "import random\n\ntc = int(input())\nwhile tc:\n\tgraph1 = []\n\tgraph2 = []\n\tn = int(input())\n\n\tfor i in range(n):\n\t\tgraph1.append([int(x) for x in input().split()])\n\tfor i in range(n):\n\t\tgraph2.append([int(x) for x in input().split()])\n\n\t# Begin LOL\n\tfor x in range(2):\n\t\ta = []\n\t\top = ''\n\t\tfor i in range(n):\n\t\t\ta.append(i+1)\n\n\t\tk = n-1\n\t\twhile k:\n\t\t\tindex = random.randint(0,k-1)\n\t\t\top += str(a[index]) + ' '\n\t\t\ta.pop(index)\n\t\t\tk -= 1\n\t\top += str(a[0])\n\t\tprint(op)\n\t# End LOL\n\t\n\ttc -= 1", "import random\n\ntc = int(input())\nwhile tc:\n\tgraph1 = []\n\tgraph2 = []\n\tn = int(input())\n\n\tfor i in range(n):\n\t\tgraph1.append([int(x) for x in input().split()])\n\tfor i in range(n):\n\t\tgraph2.append([int(x) for x in input().split()])\n\n\t# Begin LOL\n\tfor x in range(2):\n\t\ta = []\n\t\top = ''\n\t\tfor i in range(n):\n\t\t\ta.append(i+1)\n\n\t\tk = n-1\n\t\twhile k:\n\t\t\tindex = random.randint(0,k-1)\n\t\t\top += str(a[index]) + ' '\n\t\t\ta.pop(index)\n\t\t\tk -= 1\n\t\top += str(a[0])\n\t\tprint(op)\n\t# End LOL\n\t\n\ttc -= 1", "import random\nt=int(input())\nfor testCase in range(t):\n\tn=int(input())\n\tarray1=[]\n\tarray2=[]\n\tarray=[]\n\tfor i in range(n) :\n\t\tarray1.append(list(map(int,input().split())))\n\tfor i in range(n) :\n\t\tarray2.append(list(map(int,input().split())))\n\tfor i in range(n) :\n\t\tarray.append(i)\n#\tprint array2,\" \",array1\n\tfor i in range(n) :\n\t\tprint(array[i]+1, end=' ') \n\tprint() \n\tk=0\n\tmax=0\n\tanswer=[]\n\ttemp=[]\n\twhile k < (1<<5) :\n\t\tk+=1\t\n\t\tfor i in range(n) :\n\t\t\trand=random.randint(0,len(array)-1)\n\t\t\ttemp.append(array[rand])\n\t\t\tarray.pop(rand)\n\t\tarray = temp\n\t\tcount=0\n\t\tfor i in range(n) :\n\t\t\tfor j in range(n) :\n\t\t\t\tif(array1[i][j] and array2[array[i]][array[j]]) :\n\t\t\t\t\tcount+=1\n\t\tif(count > max):\n\t\t\tanswer=array\n\t\t\tmax=count\n\t\t\t#print max,count\n\tfor x in answer :\n\t\tprint(x+1, end=' ')\n\tprint()", "import random\nt=int(input())\nfor testCase in range(t):\n\tn=int(input())\n\tarray1=[]\n\tarray2=[]\n\tarray=[]\n\tfor i in range(n) :\n\t\tarray1.append(list(map(int,input().split())))\n\tfor i in range(n) :\n\t\tarray2.append(list(map(int,input().split())))\n\tfor i in range(n) :\n\t\tarray.append(i)\n#\tprint array2,\" \",array1\n\tfor i in range(n) :\n\t\tprint(array[i]+1, end=' ') \n\tprint() \n\tk=0\n\tmax=0\n\tanswer=[]\n\ttemp=[]\n\twhile k < (1<<5) :\n\t\tk+=1\t\n\t\tfor i in range(n) :\n\t\t\trand=random.randint(0,len(array)-1)\n\t\t\ttemp.append(array[rand])\n\t\t\tarray.pop(rand)\n\t\tarray = temp\n\t\tcount=0\n\t\tfor i in range(n) :\n\t\t\tfor j in range(n) :\n\t\t\t\tif(array1[i][j] and array2[array[i]][array[j]]) :\n\t\t\t\t\tcount+=1\n\t\tif(count > max):\n\t\t\tanswer=array\n\t\t\tmax=count\n\t\t\t#print max,count\n\tfor x in answer :\n\t\tprint(x+1, end=' ')\n\tprint()", "import random\nt=int(input())\nfor testCase in range(t):\n\tn=int(input())\n\tarray1=[]\n\tarray2=[]\n\tarray=[]\n\tfor i in range(n) :\n\t\tarray1.append(list(map(int,input().split())))\n\tfor i in range(n) :\n\t\tarray2.append(list(map(int,input().split())))\n\tfor i in range(n) :\n\t\tarray.append(i)\n#\tprint array2,\" \",array1\n\tfor i in range(n) :\n\t\tprint(array[i]+1, end=' ') \n\tprint() \n\tk=0\n\tmax=0\n\tanswer=[]\n\ttemp=[]\n\twhile k < (1<<5) :\n\t\tk+=1\t\n\t\tfor i in range(n) :\n\t\t\trand=random.randint(0,len(array)-1)\n\t\t\ttemp.append(array[rand])\n\t\t\tarray.pop(rand)\n\t\tarray = temp\n\t\tcount=0\n\t\tfor i in range(n) :\n\t\t\tfor j in range(n) :\n\t\t\t\tif(array1[i][j] and array2[array[i]][array[j]]) :\n\t\t\t\t\tcount+=1\n\t\tif(count > max):\n\t\t\tanswer=array\n\t\t\tmax=count\n\t\t\t#print max,count\n\tfor x in answer :\n\t\tprint(x+1, end=' ')\n\tprint()", "import random\nt=int(input())\nfor testCase in range(t):\n\tn=int(input())\n\tarray1=[]\n\tarray2=[]\n\tarray=[]\n\tfor i in range(n) :\n\t\tarray1.append(list(map(int,input().split())))\n\tfor i in range(n) :\n\t\tarray2.append(list(map(int,input().split())))\n\tfor i in range(n) :\n\t\tarray.append(i)\n#\tprint array2,\" \",array1\n\tfor i in range(n) :\n\t\tprint(array[i]+1, end=' ') \n\tprint() \n\tk=0\n\tmax=0\n\tanswer=[]\n\ttemp=[]\n\twhile k < (1<<5) :\n\t\tk+=1\t\n\t\tfor i in range(n) :\n\t\t\trand=random.randint(0,len(array)-1)\n\t\t\ttemp.append(array[rand])\n\t\t\tarray.pop(rand)\n\t\tarray = temp\n\t\tcount=0\n\t\tfor i in range(n) :\n\t\t\tfor j in range(n) :\n\t\t\t\tif(array1[i][j] and array2[array[i]][array[j]]) :\n\t\t\t\t\tcount+=1\n\t\tif(count > max):\n\t\t\tanswer=array\n\t\t\tmax=count\n\t\t\t#print max,count\n\tfor x in answer :\n\t\tprint(x+1, end=' ')\n\tprint()", "import random\nt=int(input())\nfor testCase in range(t):\n\tn=int(input())\n\tarray1=[]\n\tarray2=[]\n\tarray=[]\n\tfor i in range(n) :\n\t\tarray1.append(list(map(int,input().split())))\n\tfor i in range(n) :\n\t\tarray2.append(list(map(int,input().split())))\n\tfor i in range(n) :\n\t\tarray.append(i)\n#\tprint array2,\" \",array1\n\tfor i in range(n) :\n\t\tprint(array[i]+1, end=' ') \n\tprint() \n\tk=0\n\tmax=0\n\tanswer=[]\n\ttemp=[]\n\twhile k < (1<<5) :\n\t\tk+=1\t\n\t\tfor i in range(n) :\n\t\t\trand=random.randint(0,len(array)-1)\n\t\t\ttemp.append(array[rand])\n\t\t\tarray.pop(rand)\n\t\tarray = temp\n\t\tcount=0\n\t\tfor i in range(n) :\n\t\t\tfor j in range(n) :\n\t\t\t\tif(array1[i][j] and array2[array[i]][array[j]]) :\n\t\t\t\t\tcount+=1\n\t\tif(count > max):\n\t\t\tanswer=array\n\t\t\tmax=count\n\t\t\t#print max,count\n\tfor x in answer :\n\t\tprint(x+1, end=' ')\n\tprint()", "import random\nt=int(input())\nfor testCase in range(t):\n\tn=int(input())\n\tarray1=[]\n\tarray2=[]\n\tarray=[]\n\tfor i in range(n) :\n\t\tarray1.append(list(map(int,input().split())))\n\tfor i in range(n) :\n\t\tarray2.append(list(map(int,input().split())))\n\tfor i in range(n) :\n\t\tarray.append(i)\n#\tprint array2,\" \",array1\n\tfor i in range(n) :\n\t\tprint(array[i]+1, end=' ') \n\tprint() \n\tk=0\n\tmax=0\n\tanswer=[]\n\ttemp=[]\n\twhile k < (1<<5) :\n\t\tk+=1\t\n\t\tfor i in range(n) :\n\t\t\trand=random.randint(0,len(array)-1)\n\t\t\ttemp.append(array[rand])\n\t\t\tarray.pop(rand)\n\t\tarray = temp\n\t\tcount=0\n\t\tfor i in range(n) :\n\t\t\tfor j in range(n) :\n\t\t\t\tif(array1[i][j] and array2[array[i]][array[j]]) :\n\t\t\t\t\tcount+=1\n\t\tif(count > max):\n\t\t\tanswer=array\n\t\t\tmax=count\n\t\t\t#print max,count\n\tfor x in answer :\n\t\tprint(x+1, end=' ')\n\tprint()", "import random\nt=int(input())\nfor testCase in range(t):\n\tn=int(input())\n\tarray1=[]\n\tarray2=[]\n\tarray=[]\n\tfor i in range(n) :\n\t\tarray1.append(list(map(int,input().split())))\n\tfor i in range(n) :\n\t\tarray2.append(list(map(int,input().split())))\n\tfor i in range(n) :\n\t\tarray.append(i)\n#\tprint array2,\" \",array1\n\tfor i in range(n) :\n\t\tprint(array[i]+1, end=' ') \n\tprint() \n\tk=0\n\tmax=0\n\tanswer=[]\n\ttemp=[]\n\twhile k < (1<<5) :\n\t\tk+=1\t\n\t\tfor i in range(n) :\n\t\t\trand=random.randint(0,len(array)-1)\n\t\t\ttemp.append(array[rand])\n\t\t\tarray.pop(rand)\n\t\tarray = temp\n\t\tcount=0\n\t\tfor i in range(n) :\n\t\t\tfor j in range(n) :\n\t\t\t\tif(array1[i][j] and array2[array[i]][array[j]]) :\n\t\t\t\t\tcount+=1\n\t\tif(count > max):\n\t\t\tanswer=array\n\t\t\tmax=count\n\t\t\t#print max,count\n\tfor x in answer :\n\t\tprint(x+1, end=' ')\n\tprint()", "import random\nt=int(input())\nfor testCase in range(t):\n\tn=int(input())\n\tarray1=[]\n\tarray2=[]\n\tarray=[]\n\tfor i in range(n) :\n\t\tarray1.append(list(map(int,input().split())))\n\tfor i in range(n) :\n\t\tarray2.append(list(map(int,input().split())))\n\tfor i in range(n) :\n\t\tarray.append(i)\n#\tprint array2,\" \",array1\n\tfor i in range(n) :\n\t\tprint(array[i]+1, end=' ') \n\tprint() \n\tk=0\n\tmax=0\n\tanswer=[]\n\ttemp=[]\n\twhile k < (1<<6) :\n\t\tk+=1\t\n\t\tfor i in range(n) :\n\t\t\trand=random.randint(0,len(array)-1)\n\t\t\ttemp.append(array[rand])\n\t\t\tarray.pop(rand)\n\t\tarray = temp\n\t\tcount=0\n\t\tfor i in range(n) :\n\t\t\tfor j in range(n) :\n\t\t\t\tif(array1[i][j] and array2[array[i]][array[j]]) :\n\t\t\t\t\tcount+=1\n\t\tif(count > max):\n\t\t\tanswer=array\n\t\t\tmax=count\n\t\t\t#print max,count\n\tfor x in answer :\n\t\tprint(x+1, end=' ')\n\tprint()", "import random\nt=int(input())\nfor testCase in range(t):\n\tn=int(input())\n\tarray1=[]\n\tarray2=[]\n\tarray=[]\n\tfor i in range(n) :\n\t\tarray1.append(list(map(int,input().split())))\n\tfor i in range(n) :\n\t\tarray2.append(list(map(int,input().split())))\n\tfor i in range(n) :\n\t\tarray.append(i)\n#\tprint array2,\" \",array1\n\tfor i in range(n) :\n\t\tprint(array[i]+1, end=' ') \n\tprint() \n\tk=0\n\tmax=0\n\tanswer=[]\n\ttemp=[]\n\twhile k < (1<<5) :\n\t\tk+=1\t\n\t\tfor i in range(n) :\n\t\t\trand=random.randint(0,len(array)-1)\n\t\t\ttemp.append(array[rand])\n\t\t\tarray.pop(rand)\n\t\tarray = temp\n\t\tcount=0\n\t\tfor i in range(n) :\n\t\t\tfor j in range(n) :\n\t\t\t\tif(array1[i][j] and array2[array[i]][array[j]]) :\n\t\t\t\t\tcount+=1\n\t\tif(count > max):\n\t\t\tanswer=array\n\t\t\tmax=count\n\t\t\t#print max,count\n\tfor x in answer :\n\t\tprint(x+1, end=' ')\n\tprint()", "t = int(input())\na=[]\nwhile t>0:\n a=[]\n b=[]\n n= int(input())\n for i in range(n):\n k = list(map(int, input().split()))\n z=0\n for j in k:\n z=2*z+j\n a.append(z)\n for i in range(n):\n k = list(map(int, input().split()))\n z=0\n for j in k:\n z=2*z+j\n b.append(z)\n aindex=list(range(n))\n bindex=list(range(n))\n c=aindex\n for i in range(n):\n c[i]=0\n \n for i in range(n):\n for j in range(n-i-1):\n if a[j]>a[j+1]:\n tmp=a[j]\n a[j]=a[j+1]\n a[j+1]=tmp\n tmp=aindex[j]\n aindex[j]=aindex[j+1]\n aindex[j+1]=tmp\n if b[j]>b[j+1]:\n tmp=b[j]\n b[j]=b[j+1]\n b[j+1]=tmp\n tmp=bindex[j]\n bindex[j]=bindex[j+1]\n bindex[j+1]=tmp\n bfinal= list(range(n))\n afinal= list(range(n))\n for i in range(n):\n afinal[aindex[i]]=i+1\n bfinal[bindex[i]]=i+1\n \n \"\"\"\n for i in range(n):\n max=-1\n maxindex =0\n for j in range(n):\n temp=~(a[i]^b[j])\n if temp>max and c[j]==0:\n max = temp\n maxindex=j\n bindex[maxindex]=i+1 \n c[maxindex]=1\"\"\"\n for i in afinal:\n print(i, end=' ')\n print() \n for j in bfinal:\n print(j, end=' ')\n print() \n t = t-1", "t = int(input())\na=[]\nwhile t>0:\n a=[]\n b=[]\n n= int(input())\n for i in range(n):\n k = list(map(int, input().split()))\n z=0\n for j in k:\n z=2*z+j\n a.append(z)\n for i in range(n):\n k = list(map(int, input().split()))\n z=0\n for j in k:\n z=2*z+j\n b.append(z)\n aindex=list(range(n))\n bindex=list(range(n))\n c=aindex\n for i in range(n):\n c[i]=0\n \n for i in range(n):\n max=-1\n maxindex =0\n for j in range(n):\n temp=~(a[i]^b[j])\n if temp>max and c[j]==0:\n max = temp\n maxindex=j\n bindex[maxindex]=i+1 \n c[maxindex]=1\n for i in range(n):\n print(i+1, end=' ')\n print() \n for j in bindex:\n print(j, end=' ')\n print() \n t = t-1", "import random\nt=int(input())\nfor testCase in range(t):\n\tn=int(input())\n\tarray1=[0]*n\n\tarray2=[0]*n\n\tfor i in range(2*n) :\n\t\tarray=input()\n\tfor i in range(n) :\n\t\tarray1[i]=array2[i]=i+1\n#\tprint array2,\" \",array1\n\tfor i in range(n) :\n\t\trand=random.randint(0,len(array1)-1)\n\t\tprint(array1[rand], end=' ')\n\t\tarray1.pop(rand) \n\tprint() \n\tfor i in range(n) :\n\t\trand=random.randint(0,len(array2)-1)\n\t\tprint(array2[rand], end=' ')\n\t\tarray2.pop(rand)\n\tprint()", "import random\nt=int(input())\nfor testCase in range(t):\n\tn=int(input())\n\tarray1=[0]*n\n\tarray2=[0]*n\n\tfor i in range(2*n) :\n\t\tarray=input()\n\tfor i in range(n) :\n\t\tarray1[i]=array2[i]=i+1\n#\tprint array2,\" \",array1\n\tfor i in range(n) :\n\t\trand=random.randint(0,len(array1)-1)\n\t\tprint(array1[rand], end=' ')\n\t\tarray1.pop(rand) \n\tprint() \n\tfor i in range(n) :\n\t\trand=random.randint(0,len(array2)-1)\n\t\tprint(array2[rand], end=' ')\n\t\tarray2.pop(rand)\n\tprint()", "import random\nt=int(input())\nfor testCase in range(t):\n\tn=int(input())\n\tarray1=[0]*n\n\tarray2=[0]*n\n\tfor i in range(2*n) :\n\t\tarray=input()\n\tfor i in range(n) :\n\t\tarray1[i]=array2[i]=i+1\n#\tprint array2,\" \",array1\n\tfor i in range(n) :\n\t\trand=random.randint(0,len(array1)-1)\n\t\tprint(array1[rand], end=' ')\n\t\tarray1.pop(rand) \n\tprint() \n\tfor i in range(n) :\n\t\trand=random.randint(0,len(array2)-1)\n\t\tprint(array2[rand], end=' ')\n\t\tarray2.pop(rand)\n\tprint()", "import random\nt=int(input())\nfor testCase in range(t):\n\tn=int(input())\n\tarray1=[0]*n\n\tarray2=[0]*n\n\tfor i in range(2*n) :\n\t\tarray=input()\n\tfor i in range(n) :\n\t\tarray1[i]=array2[i]=i+1\n#\tprint array2,\" \",array1\n\tfor i in range(n) :\n\t\trand=random.randint(0,len(array1)-1)\n\t\tprint(array1[rand], end=' ')\n\t\tarray1.pop(rand) \n\tprint() \n\tfor i in range(n) :\n\t\trand=random.randint(0,len(array2)-1)\n\t\tprint(array2[rand], end=' ')\n\t\tarray2.pop(rand)\n\tprint()", "import random\nt=int(input())\nfor testCase in range(t):\n\tn=int(input())\n\tarray1=[0]*n\n\tarray2=[0]*n\n\tfor i in range(2*n) :\n\t\tarray=input()\n\tfor i in range(n) :\n\t\tarray1[i]=array2[i]=i+1\n#\tprint array2,\" \",array1\n\tfor i in range(n) :\n\t\trand=random.randint(0,len(array1)-1)\n\t\tprint(array1[rand], end=' ')\n\t\tarray1.pop(rand) \n\tprint() \n\tfor i in range(n) :\n\t\trand=random.randint(0,len(array2)-1)\n\t\tprint(array2[rand], end=' ')\n\t\tarray2.pop(rand)\n\tprint()"] | {"inputs": [["2", "3", "0 1 0", "1 0 0", "0 0 0", "0 0 1", "0 0 1", "1 1 0", "4", "0 0 1 0", "0 0 0 0", "1 0 0 1", "0 0 1 0", "0 0 1 1", "0 0 0 0", "1 0 0 0", "1 0 0 0", ""]], "outputs": [["1 2 3", "1 2 3", "1 4 2 3", "2 4 1 3"]]} | INTERVIEW | PYTHON3 | CODECHEF | 19,753 | |
ddb7b04be70c3150f08997240e3ea789 | UNKNOWN | Zonal Computing Olympiad 2012, 26 Nov 2011
It's dinner time in Castle Camelot, and the fearsome Knights of the Round Table are clamouring for dessert. You, the chef, are in a soup. There are N knights, including King Arthur, each with a different preference for dessert, but you cannot afford to make desserts for all of them.
You are given the cost of manufacturing each Knight's preferred dessert–since it is a round table, the list starts with the cost of King Arthur's dessert, and goes counter-clockwise.
You decide to pick the cheapest desserts to make, such that for every pair of adjacent Knights, at least one gets his dessert. This will ensure that the Knights do not protest.<p>A strange feature of the Knights is that they will not complain about not getting dessert unless they get support from both their neighbours. So, you decide to pick the cheapest desserts to make, such that for every pair of adjacent Knights, at least one gets his dessert.</p>
What is the minimum cost of tonight's dinner, given this condition?
For instance, suppose there are 5 Knights and their desserts cost 1, 2, 1, 2 and 2. In this case, the minimum cost is 4, which you can achieve by feeding the first, third and fourth (or fifth) Knights.
-----Input format-----
There are 2 lines of input. The first line contains a single integer N, the number of seats at the table. The next line contains N space separated integers, each being the cost of the dessert of a Knight, listed in counterclockwise order around the table, starting with King Arthur.
-----Output format-----
The output should be a single line containing a single integer, the minimum possible cost for you, the chef.
-----Testdata-----
Each Knight's dessert costs strictly more than 0 and strictly less than 1000. You may assume that 1 ≤ N ≤ 106. In 30% of the test cases, 1 ≤ N ≤ 103.
- Subtask 1 (30 marks)
- Subtask 2 (70 marks)
-----Sample Input-----
5
1 2 1 2 2
-----Sample Output-----
4 | ["n=int(input())\r\nar=list(map(int,input().split()))\r\ndp=[0]*n \r\ndp[0]=ar[0]\r\ndp[1]=ar[1]\r\nfor i in range(2,n):\r\n dp[i]=min(dp[i-2],dp[i-1])+ar[i]\r\n \r\nar.reverse()\r\n#print(ar)\r\ndp1=[0]*n \r\ndp1[0]=ar[0]\r\ndp1[1]=ar[1]\r\nfor i in range(2,n):\r\n dp1[i]=min(dp1[i-2],dp1[i-1])+ar[i]\r\nprint(min(dp[-1],dp1[-1]))", "n=int(input())\narr=list(map(int,input().split()))\n# if(n==1):\n# print(arr[-1])\n# elif(n==2):\n# print(min(arr))\n# else:\nif(n>0):\n dp=[0 for i in range(n)]\n dp[0]=arr[0]\n dp[1]=arr[1]\n for i in range(2,n):\n dp[i]=arr[i]+min(dp[i-1],dp[i-2])\n comp=(dp[-1])\n dp[1]+=dp[0]\n for i in range(2,n-1):\n dp[i]=arr[i]+min(dp[i-1],dp[i-2])\n print(min(comp,dp[n-2]))\n \n \n# [3,2,3,4,5,5]\n# [3,2,1,2,2,1]\n", "# cook your dish here\ndef fun(arr,n):\n cost = [0]*n \n cost[n-1] = arr[n-1]\n if(n>=2):\n cost[n-2] = arr[n-2]\n for i in range(n-3,-1,-1):\n cost[i] = min(cost[i+1],cost[i+2]) + arr[i]\n return cost[0]\n \nn = int(input())\na = list(map(int,input().split()))\nb = list(reversed(a))\n\nprint(min(fun(a,n),fun(b,n)))\n", "# cook your dish here\n\nimport math\n\nN = int(input().strip())\ncosts = [int(i) for i in input().strip().split(\" \")]\nstored_val_1 = [costs[0], costs[0] + costs[1]]\nstored_val_2 = [math.inf, costs[1]]\nfor idx, cost in enumerate(costs[2:]):\n stored_val_1.append(cost + min(stored_val_1[-1], stored_val_1[-2]))\n\nfor idx, cost in enumerate(costs[2:]):\n stored_val_2.append(cost + min(stored_val_2[-1], stored_val_2[-2]))\n\nprint(min(stored_val_1[-1], stored_val_1[-2], stored_val_2[-1]))\n\n", "#=''\nimport sys\ninput=sys.stdin.readline\nn=int(input())\nl=input().split()\nli=[int(i) for i in l]\nif(n==1):\n print(0)\n return\nif(n==2):\n print(min(li))\n return\nif(n==3):\n li.sort()\n print(li[0]+li[1])\n return\nz=list(li[1:])\nans=li[0]\nk=len(z)\ndp=[[0 for i in range(2)]for i in range(k)]\ndp[0][1]=z[0]\ndp[1][0]=z[0]\ndp[1][1]=z[1]\nfor i in range(2,k):\n dp[i][0]=z[i-1]+min(dp[i-2][0],dp[i-2][1])\n dp[i][1]=z[i]+min(dp[i-1][0],dp[i-1][1])\nans=ans+min(dp[-1][0],dp[-1][1])\nz=list(li[2:-1])\nok=li[1]+li[-1]\nk=len(z)\nif(k>=2):\n dp=[[0 for i in range(2)]for i in range(k)]\n dp[0][1]=z[0]\n dp[1][0]=z[0]\n dp[1][1]=z[1]\n for i in range(2,k):\n dp[i][0]=z[i-1]+min(dp[i-2][0],dp[i-2][1])\n dp[i][1]=z[i]+min(dp[i-1][0],dp[i-1][1])\n ok=ok+min(dp[-1][0],dp[-1][1])\nprint(min(ans,ok))\n", "# cook your dish here\nimport sys\ninput=sys.stdin.readline\nn=int(input())\nl=input().split()\nli=[int(i) for i in l]\nif(n==1):\n print(0)\n return\nif(n==2):\n print(min(li))\n return\nif(n==3):\n li.sort()\n print(li[0]+li[1])\n return\nz=list(li[1:])\nans=li[0]\nk=len(z)\ndp=[[0 for i in range(2)]for i in range(k)]\ndp[0][1]=z[0]\ndp[1][0]=z[0]\ndp[1][1]=z[1]\nfor i in range(2,k):\n dp[i][0]=z[i-1]+min(dp[i-2][0],dp[i-2][1])\n dp[i][1]=z[i]+min(dp[i-1][0],dp[i-1][1])\nans=ans+min(dp[-1][0],dp[-1][1])\nz=list(li[1:-1])\nok=li[1]+li[-1]\nk=len(z)\nif(k>=2):\n dp=[[0 for i in range(2)]for i in range(k)]\n dp[0][1]=z[0]\n dp[1][0]=z[0]\n dp[1][1]=z[1]\n for i in range(2,k):\n dp[i][0]=z[i-1]+min(dp[i-2][0],dp[i-2][1])\n dp[i][1]=z[i]+min(dp[i-1][0],dp[i-1][1])\n ok=ok+min(dp[-1][0],dp[-1][1])\nprint(min(ans,ok))\n", "# cook your dish here\nimport sys\ninput=sys.stdin.readline\nn=int(input())\nl=input().split()\nli=[int(i) for i in l]\nif(n==1):\n print(0)\n return\nif(n==2):\n print(min(li))\n return\nif(n==3):\n li.sort()\n print(li[0]+li[1])\n return\nz=list(li[1:])\nans=li[0]\nk=len(z)\ndp=[[0 for i in range(2)]for i in range(k)]\ndp[0][1]=z[0]\ndp[1][0]=z[0]\ndp[1][1]=z[1]\nfor i in range(2,k):\n dp[i][0]=z[i-1]+min(dp[i-2][0],dp[i-2][1])\n dp[i][1]=z[i]+min(dp[i-1][0],dp[i-1][1])\nans=ans+min(dp[-1][0],dp[-1][1])\nprint(ans)\n", "# cook your dish here\nn=int(input())\narray=list(map(int, input().split()))\narray2=array.copy()\nif n==1:\n print(array)\nelif n==2:\n print(min(array[0],array[1]))\nelse:\n array[1]+=array[0]\n for i in range(2,n):\n array[i]+=min(array[i-1],array[i-2])\n minimo=min(array[-1],array[-2])\n array2[2]+=array2[1]\n for i in range(3,n):\n array2[i]+=min(array2[i-1],array2[i-2])\n print(min(minimo, array2[-1]))", "# cook your dish here\nn=int(input())\nl=list(map(int,input().split()))\nd=l.copy()\nfor i in range(2,n):\n mini=min(d[i-1],d[i-2])\n d[i]+=mini\nf=l.copy()\nf=f[::-1]\nfor i in range(2,n):\n mini=min(f[i-1],f[i-2])\n f[i]+=mini\nprint(min(f[-1],d[-1]))", "# cook your dish here\n\nn=int(input())\nl=list(map(int,input().split()))\nd=l.copy()\nfor i in range(2,n):\n mini=min(d[i-1],d[i-2])\n d[i]+=mini\nf=l.copy()\nf=f[::-1]\nfor i in range(2,n):\n mini=min(f[i-1],f[i-2])\n f[i]+=mini\nprint(min(f[-1],d[-1]))", "n=int(input())\nl=list(map(int,input().split()))\nd=l.copy()\nfor i in range(2,n):\n mini=min(d[i-1],d[i-2])\n d[i]+=mini\nf=l.copy()\nf=f[::-1]\nfor i in range(2,n):\n mini=min(f[i-1],f[i-2])\n f[i]+=mini\nprint(min(f[-1],d[-1]))", "n=int(input())\nl=list(map(int,input().split()))\nd=l.copy()\nd.append(0)\nfor i in range(2,n+1):\n mini=min(d[i-1],d[i-2])\n d[i]+=mini\nif(d[-1]==d[-2]):\n print(d[-1])\nelse:\n f=l.copy()\n f.append(0)\n c=l[0] \n for i in range(3,n+1):\n mini=min(f[i-1],f[i-2])\n f[i]+=mini\n if(f[-1]==f[-3]):\n print(f[-1]+c)\n else:\n print(d[-1])", "n=int(input())\nl=list(map(int,input().split()))\nd=l.copy()\nd.append(0)\nfor i in range(2,n+1):\n mini=min(d[i-1],d[i-2])\n d[i]+=mini\nif(d[-1]==d[-2]):\n print(d[-1])\nelse:\n f=l.copy()\n f.append(0)\n c=l[0]\n for i in range(3,n+1):\n mini=min(f[i-1],f[i-2])\n f[i]+=mini\n if(f[-1]==f[-3]):\n print(f[-1]+c)\n else:\n print(f[-2])", "n=int(input())\nl=list(map(int,input().split()))\nd=l.copy()\nd.append(0)\nc=d[0]\nfor i in range(3,n+1):\n mini=min(d[i-1],d[i-2])\n d[i]+=mini\nprint(c+d[-1])", "n = int(input())\na = list(map(int, input().split()))\nif n==1:\n print(a[0])\nelif n==2:\n print(min(a[0],a[1]))\nelse :\n dp = [0]*n\n dp[0] = a[0]\n dp[1] = a[1]\n for i in range(2,n):\n dp[i] = a[i] + min(dp[i-2], dp[i-1])\n result1 = dp[n-1]\n dp = [0]*n\n dp[n-1] = a[n-1]\n dp[n-2] = a[n-2]\n for i in range(n-3,-1,-1):\n dp[i] = a[i] + min(dp[i+2], dp[i+1])\n result = min(dp[0], result1)\n print(result)\n", "n = int(input())\na = list(map(int, input().split()))\nif n==1:\n print('-1')\nelif n==2:\n print(min(a[0],a[1]))\nelse :\n dp = [0]*n\n dp[0] = a[0]\n dp[1] = a[1]\n for i in range(2,n):\n dp[i] = a[i] + min(dp[i-2], dp[i-1])\n result1 = dp[n-1]\n dp = [0]*n\n dp[n-1] = a[n-1]\n dp[n-2] = a[n-2]\n for i in range(n-3,-1,-1):\n dp[i] = a[i] + min(dp[i+2], dp[i+1])\n result = min(dp[0], result1)\n print(result)\n", "n = int(input())\na = list(map(int, input().split()))\nif n==1:\n print('0')\nelif n==2:\n print(min(a[0],a[1]))\nelse :\n dp = [0]*n\n dp[0] = a[0]\n dp[1] = a[1]\n for i in range(2,n):\n dp[i] = a[i] + min(dp[i-2], dp[i-1])\n result1 = dp[n-1]\n dp = [0]*n\n dp[n-1] = a[n-1]\n dp[n-2] = a[n-2]\n for i in range(n-3,-1,-1):\n dp[i] = a[i] + min(dp[i+2], dp[i+1])\n result = min(dp[0], result1)\n print(result)\n", "# cook your dish here\nimport sys\n\nN=int(sys.stdin.readline())\nA=[int(i) for i in sys.stdin.readline().split()]\n\ndp1=[]\ndp2=[]\n\nfor i in range(N+1):\n dp1.append([-1,-1])\n dp2.append([-1,-1])\n\n# dp1 initializations \ndp1[0][0]=0\ndp1[0][1]=0\ndp1[1][0]=0\ndp1[1][1]=2e9\n\n# dp2 initializations\ndp2[0][0]=0\ndp2[0][1]=0\ndp2[1][0]=2e9\ndp2[1][1]=A[0]\n\nfor x in range(2,N+1):\n dp1[x][0]=dp1[x-1][1]\n dp1[x][1]=min(dp1[x-1][0],dp1[x-1][1])+A[x-1]\n \n dp2[x][0]=dp2[x-1][1]\n dp2[x][1]=min(dp2[x-1][0],dp2[x-1][1])+A[x-1]\n\nans=min(min(dp1[N][1],dp2[N][0]),dp2[N][1])\nprint(ans)\n \n", "def solve(array):\r\n N = len(array)\r\n dp = [array[0], array[1]]\r\n for i in range(2, N):\r\n dp.append(array[i] + min(dp[i - 2], dp[i - 1]))\r\n return dp[N - 1]\r\n\r\nN = int(input())\r\ncosts = list(map(int, input().split()))\r\n\r\nif N == 1:\r\n print(0)\r\nelif N == 2:\r\n print(min(costs))\r\nelse:\r\n print(min(solve(costs), solve(costs[-1::-1])))\r\n", "import sys\nread = sys.stdin.readline\nn = int(read())\na = list(map(int , read().split()))\nb = [i for i in a]\nboola = [False for i in range(n)]\n#ans = 0\nfor i in range(2,n):\n a[i] += min(a[i-1],a[i-2])\n#print(*boola)\nb.reverse()\nfor i in range(2,n):\n b[i] += min(b[i-1],b[i-2])\n#x = min(a[-1],a[-2])\n#y = min(b[-1],b[-2])\nprint(min(a[-1],b[-1]))", "# cook your dish here\nimport copy\nN = int(input())\nlist1 = list(map(int,input().split()))\nlist2 = copy.deepcopy(list1)\nfor i in range(len(list1)-3,-1,-1):\n list1[i] += min(list1[i+1],list1[i+2])\nfor j in range(2,len(list2)):\n list2[j] += min(list2[j-1],list2[j-2])\nanswer = min(list1[0], list2[-1])\n#print(list1,list2)\nprint(answer)", "#this time it will work\ntry:\n n = int(input())\n l = list(map(int , input().split()))\nexcept:\n return\nans = [0] * n\nanss = [0] * n\nans[0] = l[0]\nans[1] = l[1]\nfor i in range(2,n):\n ans[i] = min(ans[i-1],ans[i-2]) + l[i]\nl.reverse()\nanss[0] = l[0]\nanss[1] = l[1]\nfor i in range(2,n):\n anss[i] = min(anss[i-1],anss[i-2]) + l[i]\nprint(min(ans[-1],anss[-1]))\n\n", "# cook your dish here\nn = int(input())\ncost = list(map(int, input().split()))\ndef func(arr,n):\n a = [0]*n \n a[0] = arr[0]\n a[1] = arr[1]\n for i in range(2,n):\n a[i] = arr[i] + min(a[i-1],a[i-2])\n return a[-1]\nans1 = func(cost,n)\ncost.reverse()\nans2 = func(cost,n)\nprint(min(ans1,ans2))", "n = int(input())\ncost = list(map(int, input().split()))\ndef func(arr,n):\n a = [0]*n \n a[0] = arr[0]\n a[1] = arr[1]\n for i in range(2,n):\n a[i] = arr[i] + min(a[i-1],a[i-2])\n return a[-1]\nans1 = func(cost,n)\ncost.reverse()\nans2 = func(cost,n)\nprint(min(ans1,ans2))"] | {"inputs": [["5", "1 2 1 2 2"]], "outputs": [["4"]]} | INTERVIEW | PYTHON3 | CODECHEF | 10,378 | |
488bb6845cc7a1b4669b8c072bab04f9 | UNKNOWN | -----Problem Statement-----
Chef has a sequence of N segments: [L1, R1], [L2, R2], ..., [LN, RN]. He wants to transform the first segment to the last one (with index N). His plan is to do this big deal with a number of transformations: firstly he will transform
the first segment to the second one, then to the third one, then to the fourth one, and so on till N-th one.
Chef can use operation of a single type: shift one segment border by one unit. So, if he has segment [L, R], he can transform it into one of the following segments: [L + 1, R] (we will denote such operation with string L+), [L, R + 1] (will be denoted as R+), [L - 1, R] (L-), [L, R - 1] (R-). Chef doesn't like empty segments, therefore he cannot use any operation that makes a segment empty (L = R).
Chef really wants to transform his segment as fast as possible. Please, help him. Find the sequence with minimal number of operations that transforms his segment. If there are multiple such sequences pick the lexicographically minimal one.
-----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 segments Chef has.
The following N lines contain pairs of integers. The i-th line contains integers Li, Ri, denoting i-th Chef's segment.
-----Output-----
For each test case print an answer - two lines. The first line should contain the minimal number of operations. The second line should contain the sequence of operations
without any whitespaces.
-----Constraints-----
- 1 ≤ T, N ≤ 1000.
- -1000 ≤ Li < Ri ≤ 1000.
The total sum of N values for all test cases doesn't exceed 1000.
-----Example-----
Input:
4
3
-1 0
0 1
3 5
1
0 1
3
-2 -1
-2 -1
-2 0
4
4 6
3 5
-1 1
1 2
Output:
9
R+L+R+L+R+L+R+L+R+
0
1
R+
13
L-R-L-L-L-L-R-R-R-R-L+R+L+ | ["for tc in range(int(input())):\n N = int(input())\n a, b = list(map(int, input().split()))\n pr = []\n\n # 'L' is lexicographically lower than 'R'.\n # so, we should first try to apply L+ or L-\n # if we can't then only we'll try to apply R+ or R-\n\n for i in range(N - 1):\n l, r = list(map(int, input().split()))\n\n #continue the following process until a == l and b == r\n while a != l or b != r:\n # trying to apply L-\n if a > l:\n a -= 1\n pr.append('L-')\n\n # now, trying to apply L+ (if a < b)\n elif a + 1 < b and a < l:\n a += 1\n pr.append('L+')\n\n # ok, so far, so good... now, let's try to apply R+\n elif b < r:\n b += 1\n pr.append('R+')\n\n # finally, lastly, trying to apply R- (if a < b)\n elif b - 1 > a and b > r:\n b -= 1\n pr.append('R-')\n\n print(len(pr))\n print(''.join(pr))"] | {"inputs": [["4", "3", "-1 0", "0 1", "3 5", "1", "0 1", "3", "-2 -1", "-2 -1", "-2 0", "4", "4 6", "3 5", "-1 1", "1 2"]], "outputs": [["9", "R+L+R+L+R+L+R+L+R+", "0", "1", "R+", "13", "L-R-L-L-L-L-R-R-R-R-L+R+L+"]]} | INTERVIEW | PYTHON3 | CODECHEF | 851 | |
6446fd0e490eca0ff3d037cf2aa2ed25 | UNKNOWN | Chef had an array A with length N, but some of its elements got lost. Now, each element of this array is either unknown (denoted by -1) or a positive integer not exceeding K.
Chef decided to restore the array A by replacing each unknown element by a positive integer not exceeding K.
However, Chef has M restrictions that must hold for the restored array. There are two types of restrictions:
- I L R, meaning that for each i such that L < i ≤ R, the condition Ai - Ai-1 = 1 should be satisfied.
- D L R, meaning that for each i such that L < i ≤ R, the condition Ai - Ai-1 = -1 should be satisfied.
Chef would like to know the number of ways to restore the array while satisfying all restrictions, modulo 109+7.
-----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 N, M and K.
- The second line contains N integers A1, A2, ..., AN.
- Each of the following M lines contains one restriction in the form I L R or D L R.
-----Output-----
For each test case, print a single line containing one integer - the number of ways to restore the array modulo 109+7.
-----Constraints-----
- 1 ≤ T ≤ 10
- 1 ≤ N, M ≤ 100,000
- 1 ≤ K ≤ 1,000,000,000
- 1 ≤ L < R ≤ N
- 1 ≤ Ai ≤ K or Ai = -1 for each valid i
- 1 ≤ sum of N over all test cases ≤ 500,000
- 1 ≤ sum of M over all test cases ≤ 500,000
-----Example-----
Input:
3
4 2 10
2 3 5 4
I 1 2
D 3 4
5 2 10
-1 -1 -1 -1 -1
I 1 3
D 3 5
6 2 2
-1 -1 -1 -1 -1 -1
I 1 4
D 4 6
Output:
1
8
0 | ["# cook your dish here\n# cook your dish here\nMOD = 10 ** 9 + 7\n \nfor t in range(int(input())):\n N, M, K = map(int, input().split())\n A = list(map(int, input().split()))\n I, D = [0] * (N + 2), [0] * (N + 2)\n for i in range(M):\n x, L, R = input().split()\n L, R = int(L), int(R)\n if x == 'I':\n I[L] += 1\n I[R] -= 1\n else:\n D[L] += 1\n D[R] -= 1\n \n impossibru = mx = mn = 0\n ans = 1\n for i in range(N):\n I[i] += I[i - 1]\n D[i] += D[i - 1]\n if I[i] and D[i]:\n impossibru = 1\n break\n if not I[i] and not D[i]:\n ans = ans * (mx - mn + 1) % MOD\n mn, mx = 1, K\n elif I[i]:\n mx = min(mx + 1, K)\n mn += 1\n elif D[i]:\n mn = max(1, mn - 1)\n mx -= 1\n if mn > mx:\n impossibru = 1\n break\n if A[i] != -1:\n if not mn <= A[i] <= mx:\n impossibru = 1\n break\n mn = mx = A[i]\n ans = ans * (mx - mn + 1) % MOD\n \n print(0 if impossibru else ans) ", "MOD = 10 ** 9 + 7\nfor t in range(int(input())):\n N, M, K = map(int, input().split()); A = list(map(int, input().split())); I, D = [0] * (N + 2), [0] * (N + 2)\n for i in range(M):\n x, L, R = input().split(); L, R = int(L), int(R)\n if x == 'I':I[L] += 1;I[R] -= 1\n else:D[L] += 1;D[R] -= 1 \n impossibru = mx = mn = 0;ans = 1\n for i in range(N):\n I[i] += I[i - 1];D[i] += D[i - 1]\n if I[i] and D[i]:impossibru = 1;break\n if not I[i] and not D[i]:ans = ans * (mx - mn + 1) % MOD;mn, mx = 1, K\n elif I[i]:mx = min(mx + 1, K);mn += 1\n elif D[i]:mn = max(1, mn - 1);mx -= 1\n if mn > mx:impossibru = 1;break\n if A[i] != -1:\n if not mn <= A[i] <= mx:impossibru = 1;break\n mn = mx = A[i]\n ans = ans * (mx - mn + 1) % MOD \n print(0 if impossibru else ans) ", "# cook your dish here\nMOD = 10 ** 9 + 7\n \nfor t in range(int(input())):\n N, M, K = map(int, input().split())\n A = list(map(int, input().split()))\n I, D = [0] * (N + 2), [0] * (N + 2)\n for i in range(M):\n x, L, R = input().split()\n L, R = int(L), int(R)\n if x == 'I':\n I[L] += 1\n I[R] -= 1\n else:\n D[L] += 1\n D[R] -= 1\n \n impossibru = mx = mn = 0\n ans = 1\n for i in range(N):\n I[i] += I[i - 1]\n D[i] += D[i - 1]\n if I[i] and D[i]:\n impossibru = 1\n break\n if not I[i] and not D[i]:\n ans = ans * (mx - mn + 1) % MOD\n mn, mx = 1, K\n elif I[i]:\n mx = min(mx + 1, K)\n mn += 1\n elif D[i]:\n mn = max(1, mn - 1)\n mx -= 1\n if mn > mx:\n impossibru = 1\n break\n if A[i] != -1:\n if not mn <= A[i] <= mx:\n impossibru = 1\n break\n mn = mx = A[i]\n ans = ans * (mx - mn + 1) % MOD\n \n print(0 if impossibru else ans) "] | {"inputs": [["3", "4 2 10", "2 3 5 4", "I 1 2", "D 3 4", "5 2 10", "-1 -1 -1 -1 -1", "I 1 3", "D 3 5", "6 2 2", "-1 -1 -1 -1 -1 -1", "I 1 4", "D 4 6"]], "outputs": [["1", "8", "0"]]} | INTERVIEW | PYTHON3 | CODECHEF | 3,256 | |
9c138bd7cdbea27578033c7a5229ac71 | UNKNOWN | Note : This question carries $150$ $points$
There is an outcry in Middle Earth, as the greatest war between Orgs of Dark Lord Sauron and Frodo Baggins is about to begin. To end the war, Frodo decides to destroy the ring in the volcano of Mordor. There are many ships that lead Frodo to Mordor, and he is confused about which one he should board. Given two-ship numbers $M$ and $N$, Frodo has to solve a problem to find the ship which he should board.
Find the number of pairs (x, y), such that $1<=x<=M$ and $1<=y<=N$, for which $x*y + x+ y = string(x)+string(y)$ is true.
Also, calculate the number of distinct x satisfying the given condition. The number of pairs and the number of distinct x will help select Frodo the boat he should board. Help Frodo defeat Sauron.
-----Input :-----
- First line contains $T$ as number of test cases
- Each test case contains two integers $M$ and $N$
-----Output :-----
- For each test case, print two integers - the number of such pairs (x,y) and the number of distinct x
-----Constraints :-----
- 1 ≤ T ≤ 5000
- 1 ≤ M, N ≤ 10^9
-----Sample Input :-----
1
1 9
-----Sample Output :-----
1 1
-----Explanation :-----
For test case two M=1 and N=9 Pair (1,9) satisfies the above condition 1*9+1+9= “19” and only x=1 satisfies the equation. | ["# cook your dish here\nfrom math import pow\nt = int(input())\nfor _ in range(t):\n m,n = map(int,input().rstrip().split())\n cnt = len(str(n))\n x = pow(10,cnt)\n if n == x-1:\n print(m*cnt,m)\n else:\n print(m*(cnt-1),m)", "# cook your dish here\r\ndef sol(z):\r\n r=len(str(z))\r\n if(z<int(str(9)*r)):\r\n r-=1\r\n return r\r\n\r\nt=int(input())\r\nfor _ in range(t):\r\n i,j=map(int,input().split())\r\n l=i\r\n print(l*sol(j),l)", "for u in range(int(input())):\n n,m=list(map(int,input().split()))\n c=0\n if(m<9):\n print(0,0)\n else:\n for i in str(m):\n if(i=='9'):\n c+=1\n if(c==len(str(m))):\n print(n*c,n)\n else:\n x=len(str(m))-1\n print(x*n,n)\n", "T = int(input())\r\nfor i in range(T):\r\n m,n = map(int,input().split())\r\n cnt = 0\r\n a = 10\r\n while n >= a-1:\r\n cnt += 1\r\n a = a*10\r\n ans = m*cnt\r\n if cnt == 0:\r\n m = 0\r\n print(ans,m)", "# cook your dish here\nfor _ in range(int(input())):\n M,N = input().split()\n m,n = int(M),int(N)\n x = 1 * 10**len(N)\n if n == x-1:\n print(m*len(N),m)\n else:\n print(m*(len(N)-1),m)", "# cook your dish here\ndef solve(y):\n res=len(str(y))\n if(y<int(str(9)*res)):\n res-=1\n return res\n\nt=int(input())\nfor _ in range(t):\n m,n=map(int,input().split())\n x=m\n print(x*solve(n),x)", "# Why do we fall ? So we can learn to pick ourselves up.\r\n\r\nt = int(input())\r\nfor _ in range(0,t):\r\n m,n = map(int,input().split())\r\n if n < 9:\r\n print(0,0)\r\n else:\r\n s = '9'\r\n while int(s+'9') < n:\r\n s += '9'\r\n print(m*len(s),m)\r\n\r\n\r\n\"\"\"\r\n1\r\n1 9\r\n\r\n\r\n\"\"\"", "for i in range(int(input())):\r\n m,n = list(map(int,input().split()))\r\n if n<9:\r\n print(0,0)\r\n continue\r\n k = len(str(n))\r\n if n==int(str(9)*k):\r\n ans = k\r\n else:\r\n ans = k-1\r\n print(m*ans,m)\r\n # res = min(m,n)\r\n # res1 = res\r\n # k+=1\r\n # else:\r\n # res1 = \r\n\r\n # n = n//10\r\n # j = 1\r\n # while n>0:\r\n # if ans==0:\r\n # ans = 9*(k-j)\r\n # else:\r\n # temp = (ans*10+9)*(k-j)\r\n # ans = ans+ min(temp,m)\r\n # j+=1\r\n # n = n//10\r\n # ans = ans+res\r\n # print(ans)\n", "t=int(input())\r\nfor i in range(t):\r\n m,n=input().split()\r\n if(int(n)<9):\r\n print(0,0)\r\n elif(int(n)>9):\r\n print(int(m)*(len(n)-1),int(m))\r\n else:\r\n print(int(m),int(m))", "for _ in range(int(input())):\r\n M,N=list(map(int,input().split()))\r\n length=len(str(N))\r\n initial=\"9\"\r\n initial=initial*(length)\r\n factor=0\r\n if int(initial)>N:\r\n factor=length-1\r\n else:\r\n factor=length\r\n if factor==0:\r\n M=0\r\n print(factor*M,M)\r\n\r\n", "# cook your dish here\nimport math\nfor ad in range(int(input())):\n m,n=list(map(int,input().split()))\n a=m\n c=len(str(n))\n if n!=int(c*\"9\"):\n c-=1\n b=c*a\n print(str(b)+\" \"+str(a))", "for _ in range(int(input())):\r\n m,n=map(int,input().split())\r\n val='9'\r\n c=0\r\n while int(val)<=n:\r\n c+=1\r\n val+='9'\r\n if m*c!=0:\r\n print(m*c,m)\r\n else:\r\n print(0,0)", "for _ in range(int(input())):\n m,n=map(int,input().split())\n x=[]\n s=str(n)\n a='9'\n for i in range(len(s)):\n if(int(a)<=n):\n x.append(a)\n a+='9'\n else:\n break\n p=m*len(x)\n if p==0:\n print(\"0 0\")\n else:\n print(p,m)", "# cook your dish here\nimport math as ma\nfor _ in range(int(input())):\n m,n=list(map(int,input().split()))\n count=0\n l=int(ma.floor(ma.log(n,10)))\n if n==pow(10,l+1)-1:\n l+=1\n print(m*l,m)\n \n", "# cook your dish here\n\nfor i in range(int(input())):\n m,n=map(int,input().split())\n \n if n<9:\n y=0\n elif n>=9 and n<99:\n y=1\n elif n>=99 and n<999:\n y=2\n elif n>=999 and n<9999:\n y=3\n elif n>=9999 and n<99999:\n y=4\n elif n>=99999 and n<999999:\n y=5\n elif n>=999999 and n<9999999:\n y=6\n elif n>=9999999 and n<99999999:\n y=7\n elif n>=99999999 and n<999999999:\n y=8\n elif n>=999999999:\n y=9\n print(m*y,m)", "# cook your dish here\nfor i in range(int(input())):\n MN=list(map(int,input().split()))\n M=MN[0]\n N=MN[1]\n count=0\n x=0\n if N<9:\n print(count,x)\n elif N<99:\n count=M\n x=M\n print(count,x)\n elif N<999:\n count=2*M\n x=M\n print(count,M)\n elif N<9999:\n count=3*M\n x=M\n print(count,x)\n elif N<99999:\n count=4*M\n x=M\n print(count,x)\n elif N<999999:\n count=5*M\n x=M\n print(count,x)\n elif N<9999999:\n count=6*M\n x=M\n print(count,x)\n elif N<99999999:\n count=7*M\n x=M\n print(count,x)\n elif N<999999999:\n count=8*M\n x=M\n print(count,x)\n else:\n count=9*M\n x=M\n print(count,x)\n", "# cook your dish here\nimport math\nfor i in range(int(input())):\n m,n=list(map(int,input().split()))\n val=math.floor(math.log10(n+1))\n print(m*val,end=\" \")\n if val!=0:\n print(m)\n else:\n print(0)", "for _ in range(int(input())):\r\n m,n=map(int,input().split())\r\n cn=0\r\n i=10\r\n while n>=i-1:\r\n cn+=1\r\n i=i*10 \r\n res=m*cn\r\n if cn==0:\r\n m=0\r\n print(res,m) ", "t = int(input())\r\nml = []\r\nnl = []\r\ntest = set(['9'])\r\n\r\nfor i in range(t):\r\n m,n = [int(x) for x in input().split(' ')]\r\n if set(list(str(n))) == test:\r\n nl.append(len(str(n)))\r\n else:\r\n nl.append(len(str(n))-1)\r\n ml.append(m)\r\n\r\nfor i in range(len(ml)):\r\n if nl[i]==0:\r\n print('0 0')\r\n else:\r\n print(ml[i]*nl[i],ml[i])\r\n\r\n", "for _ in range(int(input())):\r\n m,n=list(map(int,input().split()))\r\n l=len(str(n))\r\n last=m\r\n for i in range(1,12):\r\n if 10**i - 1>n:\r\n break\r\n if i==1:\r\n print(0,0)\r\n else:\r\n print(m*(i-1),m)\r\n", "for _ in range(0,int(input())):\r\n m,n=map(int,input().split())\r\n l=[9,99,999,9999,99999,999999,9999999,99999999]\r\n t=0\r\n if 9<=n<99:\r\n t=1\r\n elif 99<=n<999:\r\n t=2\r\n elif 999<=n<9999:\r\n t=3\r\n elif 9999<=n<99999:\r\n t=4\r\n elif 99999<=n<999999:\r\n t=5\r\n elif 999999<=n<9999999:\r\n t=6\r\n elif 9999999<=n<99999999:\r\n t=7\r\n elif 99999999<=n:\r\n t=8\r\n if t==0:\r\n print(0,0)\r\n else:\r\n print(m*t,m)", "\ndef lordoftherings(m, n):\n if n<9 :return 0, 0\n digits = len(str(n))\n mul = '9'*digits\n if int(mul) > n: mul = digits-1\n else: mul = digits\n return (m*mul)%1000000007, m\n\n\nfor _ in range(int(input())):\n m, n = map(int, input().split())\n x,y = lordoftherings(m, n)\n print(x, y)", "for _ in range(int(input())):\n n,m = list(map(int,input().split()))\n if m<9:\n print(0,0)\n else:\n m = str(m)\n if len(m)>1:\n no = len(m)-1\n else:\n no = 1\n res = n*no\n print(res,n)\n", "try:\n def find(x,y):\n p=x+y+(x*y)\n s1=str(x)\n s2=str(y)\n s3=str(p)\n return (s3==(s1+s2))\n for _ in range(int(input())):\n m,n=map(int,input().split())\n n+=1\n l=len(str(n))-1\n if(l==0):\n print(\"0 0\")\n else:\n print((l*m),m)\nexcept EOFError as e:\n pass"] | {"inputs": [["1", "1 9"]], "outputs": [["1 1"]]} | INTERVIEW | PYTHON3 | CODECHEF | 8,130 | |
cbadd373b4b3ededb179e1798135840d | UNKNOWN | Chef wants to teach a lesson of sharing to the students.
There are $N$ students (numbered from $1$ to $N$ from left to right) who are asked to stand in a row. Initially Chef gave $A$$i$ candies to the $i$$th$ child. In one operation any child can give any number of candies to the child standing to his immediate left (i.e. $i$$th$ child can give any amount of candies to the $(i-1)$$th$ child. In particular 1st child cannot give his candies to anyone).
He asked them to minimize the maximum value of candies a student can possess after performing any number of operations (possibly zero).
Help the students finding such maximum value.
-----Input:-----
- The first line of the input contains a single integer $T$ denoting the number of test cases. The description of $T$ test cases follows.
- First line of each test case contains a single integer $N$ denoting the number of students.
- Second line contains $N$ space-separated integers $A$$1$,$A$$2$,$.....$ $A$$N$ denoting the initial amount of candies chef gave to them.
-----Output:-----
- For each test case, print a single line containing one integer ― maximum value after sharing.
-----Constraints-----
- $1 \leq T \leq 100$
- $1 \leq N \leq 10^5$
- $0$ $\leq$ $A$$i$ $\leq$ $10^9$
- Sum of $N$ over all Test Cases does not exceed $10^5$
-----Sample Input-----
2
5
1 2 3 4 5
5
5 4 3 2 1
-----Sample Output-----
3
5
-----Explanation-----
-
For First Test Case:
The $5$$th$ student will give $2$ candies to $4$$th$ student and $4$$th$ will give $3$ candies to $3$$rd$ and $3$$rd$ will give $3$ candies to $2$$nd$ and $2$$nd$ will give $2$ candies to $1$$st$. So finally the number of candies that they will have are
$[3,3,3,3,3]$ and the value of maximum candies is $3$.
-
For Second Test Case:
Sharing to the left student will not change the maximum value as $1$$st$ cannot share to anyone. So the maximum value will remain $5$. | ["from math import ceil\n\nfor _ in range(int(input())):\n n = int(input())\n arr = [int(x) for x in input().split()]\n sarr = sum(arr)\n mavg = sarr/n\n while n>1:\n sarr -= arr.pop()\n n-=1\n mavg = max(mavg, sarr/n)\n print(int(ceil(mavg)))", "import math\nT=int(input())\n\nfor _ in range(T):\n N=int(input())\n A=list(map(int,input().split()))\n ans=0\n left=0\n for i in range(N):\n v=A[i]-ans-left\n if (v<0):\n left=-v\n else:\n ans=ans+math.ceil(v/(i+1))\n left=(math.ceil(v/(i+1))*(i+1))-v\n \n \n print(ans)\n", "import math\nt = int(input())\nfor _ in range(t):\n n = int(input())\n a = [int(x) for x in input().split()]\n ans = a[0]\n s = 0\n for i in range(n):\n s += a[i]\n if s%(i+1)==0:\n ans = max(ans,s//(i+1))\n else:\n ans = max(ans,(s//(i+1))+1)\n print(ans)\n #case 1\n\n\n", "import math\n\n\nt = int(input())\nfor i in range(t):\n n = int(input())\n avg = []\n arr = list(map(int, input().split()))\n z = max(arr)\n index = arr.index(z)\n s = 0\n j = 1\n for elem in arr:\n s += elem\n avg.append(math.ceil(s / j))\n j += 1\n print(max(avg))"] | {"inputs": [["2", "5", "1 2 3 4 5", "5", "5 4 3 2 1"]], "outputs": [["3", "5"]]} | INTERVIEW | PYTHON3 | CODECHEF | 1,092 | |
a52c56d9644f1553d35b696bb6e1d733 | UNKNOWN | On her way to ChefLand, Marichka noticed $10^K$ road signs (numbered $0$ through $10^K - 1$). For each valid $i$, the sign with number $i$ had the integer $i$ written on one side and $10^K-i-1$ written on the other side.
Now, Marichka is wondering — how many road signs have exactly two distinct decimal digits written on them (on both sides in total)? Since this number may be large, compute it modulo $10^9+7$.
For example, if $K = 3$, the two integers written on the road sign $363$ are $363$ and $636$, and they contain two distinct digits $3$ and $6$, but on the road sign $362$, there are integers $362$ and $637$, which contain four distinct digits — $2$, $3$, $6$ and $7$. On the road sign $11$, there are integers $11$ and $988$, which contain three distinct digits — $1$, $9$ and $8$.
-----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 $K$.
-----Output-----
For each test case, print a single line containing one integer — the number of road signs with exactly two digits, modulo $10^9+7$.
-----Constraints-----
- $1 \le T \le 10^5$
- $1 \le K \le 10^9$
-----Subtasks-----
Subtask #1 (20 points): $1 \le T, K \le 5$
Subtask #2 (80 points): original constraints
-----Example Input-----
1
1
-----Example Output-----
10 | ["import math\r\nt=int(input())\r\nfor i in range(t):\r\n k=int(input())\r\n res=((pow(2,k,1000000007))*5)%1000000007\r\n print(res)", "import math\r\nt=int(input())\r\nfor i in range(t):\r\n k=int(input())\r\n res=((pow(2,k,1000000007))*5)\r\n print(res)", "t=int(input())\r\nfor i in range(t):\r\n k=int(input())\r\n res=((pow(2,k))*5)%1000000007\r\n print(res)", "__author__ = 'Prateek'\r\n\r\n\r\ndef test():\r\n k = int(input())\r\n ans = (pow(2,k-1,int(10**9+7))*10)%(int(10**9+7))\r\n print(ans)\r\n\r\n\r\nif __author__ == 'Prateek':\r\n t = int(input())\r\n for _ in range(t):\r\n test()\r\n", "from sys import stdin,stdout\r\n\r\n\r\ndef power(x, y, p): \r\n\r\n res = 1; # Initialize result \r\n\r\n \r\n\r\n # Update x if it is \r\n\r\n # more than or equal to p \r\n\r\n x = x % p; \r\n\r\n \r\n\r\n while (y > 0): \r\n\r\n \r\n\r\n # If y is odd, multiply \r\n\r\n # x with the result \r\n\r\n if (y & 1): \r\n\r\n res = (res * x) % p; \r\n\r\n \r\n\r\n # y must be even now \r\n\r\n y = y >> 1; # y = y/2 \r\n\r\n x = (x * x) % p; \r\n\r\n \r\n\r\n return res; \r\n\r\n \r\ndef sin():\r\n return stdin.readline()\r\n\r\ndef out(s):\r\n stdout.write(str(s)+\"\\n\")\r\n \t\r\nm=1000000007\r\nfor i in range(int(input())):\r\n n=sin()[:-1]\r\n remainderB = 0; \r\n for i in range(len(n)):\r\n remainderB = ((remainderB * 10 + \r\n\r\n ord(n[i]) - 48) % \r\n\r\n (m - 1)); \r\n out((power(2, remainderB, m)*5)%m); ", "from sys import stdin,stdout\r\n\r\ndef sin():\r\n return stdin.readline()\r\n\r\ndef out(s):\r\n stdout.write(str(s)+\"\\n\")\r\n \t\r\nm=1000000007\r\nfor i in range(int(input())):\r\n n=int(sin())\r\n print(((2**n)*5)%m)", "from sys import stdin,stdout\ninn=stdin.readline\nout=stdout.write\nfor i in range(int(inn())):\n n=int(inn());m=10**9+7\n v=(10*pow(2,n-1,m))%m\n out(str(v)+'\\n')", "from sys import stdin,stdout\ninn=stdin.readline\nout=stdout.write\nfor i in range(int(inn())):\n n=int(inn());m=10**9+7\n for i in range(1,n+1):\n v=(10*pow(2,n-1,m))%m\n out(str(v)+'\\n')", "def power(val, p, mod):\r\n ans = 1\r\n while p:\r\n if p & 1:\r\n ans = ans * val % mod\r\n val = val * val % mod\r\n p >>= 1\r\n return ans;\r\nt = int(input())\r\nfor i in range(t):\r\n k = int(input())\r\n print(10 * power(2, k-1, 1000000007) % 1000000007)", "t = int(input())\r\ndef power(a, n):\r\n if n==0:\r\n return 1\r\n elif n==1:\r\n return a\r\n else:\r\n r = power(a, n//2)\r\n if n%2==0:\r\n return r*r\r\n else:\r\n return r*a*r\r\nfor i in range(t):\r\n k = int(input())\r\n print(10*(power(2,(k-1))))", "t = int(input())\r\ndef power(a, n):\r\n ans = 1\r\n for i in range(n):\r\n ans*=a\r\n return ans\r\nfor i in range(t):\r\n k = int(input())\r\n print(10*(power(2,(k-1))))", "t = int(input())\r\nfor i in range(t):\r\n k = int(input())\r\n print(10*(pow(2,(k-1))))", "t = int(input())\r\nfor i in range(t):\r\n k = int(input())\r\n print(10*(2**(k-1)))", "# cook your dish here\nt = int(input())\nfor _ in range (t):\n K = int(input())\n K -= 1\n A = 2\n B = 10\n M = 10**9 + 7\n while K > 0:\n if K % 2 != 0:\n B = (B*A) % M\n K -= 1\n else:\n A = (A**2) % M\n K //= 2\n print(B)\n", "# cook your dish here\nt = int(input())\nfor _ in range(t):\n K = int(input())\n K -= 1\n A = 2\n B = 10\n M = 10**9 + 7\n while K > 0:\n if K % 2 != 0:\n B = (B*A) % M\n K -= 1\n else:\n A = (A**2) % M\n K //= 2\n print(B)\n", "for i in range(int(input())):\n n=int(input())\n m=10**9+7\n for i in range(1,n+1):\n v=(10*(2**(n-1)))%m\n print(v)", "for i in range(int(input())):\n n=int(input())\n m=10**9+7\n print(10*(2**(n-1))%m)", "# cook your dish here\nimport math\n\ndef com():\n a=[]\n p=10\n m=1000000007\n a.append(10)\n for i in range(1,10):\n p=a[i-1]%m\n p=(p*2)%m\n p=p%m\n a.append(p)\n \n return a\n \n\nt=int(input())\nm=1000000007\nwhile(t>0):\n k=int(input())\n c=2**(k-1)\n c=c%m\n c=c*10 \n c=c%m\n print(c)\n t-=1\n\t \n", "# cook your dish here\nimport math\n\ndef com():\n a=[]\n a.append(1)\n m=1000000007\n for i in range(1,1000000):\n p=a[i-1]%m\n p=p*2\n p=p%m\n a.append(p)\n return a\n \n \nt=int(input())\na=com()\nw=10000000-1\nm=1000000007\nwhile(t>0):\n k=int(input())\n c=a[k-1]*10 \n c=c%m\n c=int(c)\n print(c)\n t-=1\n\t ", "# cook your dish here\nimport math\n\ndef com():\n a=[]\n p=10\n m=1000000007\n a.append(10)\n for i in range(1,10):\n p=a[i-1]%m\n p=(p*2)%m\n p=p%m\n a.append(p)\n \n return a\n \n\nt=int(input())\na=com()\nwhile(t>0):\n k=int(input())\n c=a[k-1]\n print(c)\n t-=1\n\t ", "# cook your dish here\nimport math\n\ndef com():\n a=[]\n p=10\n m=1000000007\n a.append(10)\n for i in range(1,100):\n p=a[i-1]%m\n p=(p*2)%m\n p=p%m\n a.append(p)\n \n return a\n \n\nt=int(input())\na=com()\nwhile(t>0):\n k=int(input())\n c=a[k-1]\n print(c)\n t-=1\n\t ", "# cook your dish here\nimport math\nt=int(input())\nwhile(t>0):\n k=int(input())\n j=0\n h=math.pow(10,k)-1\n h=int(h)\n c=0\n for i in range(h+1):\n ab=[]\n if(i==0):\n if(i not in ab):\n ab.append(i)\n p=h-i\n while(p>0):\n g=p%10\n if(g not in ab):\n ab.append(g)\n p=p//10\n elif(i==h):\n if(i not in ab):\n ab.append(h-i)\n p=i\n while(p>0):\n g=p%10\n if(g not in ab):\n ab.append(g)\n p=p//10\n \n else:\n p=i\n while(p>0):\n g=p%10\n if (g not in ab):\n ab.append(g)\n p=p//10\n p=h-i\n while(p>0):\n g=p%10\n if(g not in ab):\n ab.append(g)\n p=p//10\n if(len(ab)==2):\n c+=1\n print(c)\n t-=1\n\t ", "# author: riyan\n\ndef bigpow(n, p, m):\n if p == 0:\n return 1\n elif p == 1:\n return n\n elif p % 2 == 0:\n tmp = bigpow(n, p // 2, m)\n return ((tmp * tmp) % m)\n else:\n return ((n * (bigpow(n, p - 1, m) % m)) % m)\n \n\ndef __starting_point():\n tc = int(input().strip())\n\n for t in range(tc):\n k = int(input().strip())\n \n m = int(1e9 + 7)\n ans = (10 * bigpow(2, k - 1, m)) % m\n\n print(ans)\n \n\n__starting_point()", "# author: riyan\n\n\ndef __starting_point():\n tc = int(input().strip())\n\n for t in range(tc):\n k = int(input().strip())\n\n ans = 10\n mod = int(1e9 + 7)\n for i in range(1, k):\n ans = (2 * (ans % mod)) % mod\n\n print(ans)\n \n\n__starting_point()"] | {"inputs": [["1", "1", ""]], "outputs": [["10"]]} | INTERVIEW | PYTHON3 | CODECHEF | 7,563 | |
d589fd59a8c7f71b4f9f1776b3a9e625 | UNKNOWN | Sereja have array A' that contain N integers. Now Sereja want to permute elements of the array, he want to use some permutation p, such that A[i] = A'[p[i]], where A - new array.
Lets function f(A,i) = S - A[i] - A[i +1] - ... - A[j], where j is the maximum possible index, such that A[i] + A[i + 1] + ... + A[j] <= S, if A[i] > S, f(A, i) = S.
Help Sereja to find such permutation p, such that (f(A, 1) + f(A, 2) + ... f(A, k))/k will be as low as possible.
-----Input-----
First line of input contain integer T - number of testcases. Next lines contain T testcases. First line of each testcase contain three integers N, k, S. Next line contain N integers - array A'.
-----Output-----
For each testcase output N numbers in one line - permutation p.
-----Constraints-----
- 1 ≤ T ≤ 10
- 1 ≤ N ≤ 2000
- 1 ≤ k ≤ N
- 1 ≤ A'[i] ≤ 10^4
- 1 ≤ S ≤ 10^9
-----Example-----
Input:
2
3 2 4
3 4 1
4 4 1
1 1 1 1
Output:
2 1 3
4 3 2 1
-----Scoring-----
Suppose Sum will be sum of yours (f(A, 1) + f(A, 2) + ... f(A, k))/k per each testcase.
Lets B will be the smallest such sum. Your score will be equal to B/Sum. Lower scores will earn more points.
We have 20 official test files. You must correctly solve all test files to receive OK. During the contest, your overall score is the sum of the scores on the first 4 test files. After the contest, all solutions will be rescored by the sum of the scores on the rest 16 test files. Note, that public part of the tests may not contain some border cases. | ["# Md. Khairullah Gaurab\n# SUST, CSE, 20th Batch\n# [email protected]\n\n\ntest = int(input());\n\nfor i in range(test):\n N, S, K = list(map(int,input().split()));\n lis = list(map(int,input().split()));\n ans = [i+1 for i in range(N)] ;\n ans.sort(reverse=True);\n for j in range(N):\n print(ans[j],end=' ');\n print('')\n", "\ntest = int(input());\n\nfor i in range(test):\n N, S, K = list(map(int,input().split()));\n lis = list(map(int,input().split()));\n ans = [i+1 for i in range(N)] ;\n ans.sort(reverse=True);\n for j in range(N):\n print(ans[j],end=' ');\n print('')\n", "T = int(input())\nfor t in range(T):\n (n,k,s) = [int(x) for x in input().split()]\n input()\n\n ans = \"\"\n for i in range(1,n+1):\n ans += str(i) + \" \"\n print(ans)\n", "for i in range(int(input())):\n\tl=input().split()\n\tn=int(l[0])\n\tk=int(l[1])\n\ts=int(l[2])\n\tni=input().split()\n\tnum=[int(x.strip()) for x in ni]\n\tp=sorted(list(range(len(num))),key=num.__getitem__)\n\tfor j in p:\n\t\tprint(j+1, end=' ')\n\tprint()", "t = int(input())\nwhile t>0:\n t -= 1\n \n n, k, s = list(map(int, input().split()))\n arr = list(map(int, input().split()))\n temp = sorted(list(range(n)), key=lambda x:arr[x])\n arr.sort()\n ind = n-1\n while ind > 1 and n >= 3:\n if arr[ind] > s:\n ind -= 1\n elif arr[ind]+arr[ind-2] <= s:\n arr[ind-1], arr[ind] = arr[ind], arr[ind-1]\n temp[ind-1], temp[ind] = temp[ind], temp[ind-1] \n ind -= 2\n else:\n ind -= 1\n \"\"\"\n if n>=3:\n if arr[0]+arr[2]<=s and arr[1]+arr[2]>s:\n arr[0], arr[1] = arr[1], arr[0]\n temp[0], temp[1] = temp[1], temp[0] \n \"\"\" \n ans = [str(i+1) for i in temp]\n print(' '.join(ans))", "t = int(input())\nwhile t>0:\n t -= 1\n \n n, k, s = list(map(int, input().split()))\n arr = list(map(int, input().split()))\n temp = sorted(list(range(n)), key=lambda x:arr[x])\n arr.sort()\n ind = n-1\n while ind > 1 and n >= 3:\n if arr[ind] > s:\n ind -= 1\n elif arr[ind]+arr[ind-2] <= s:\n arr[ind-1], arr[ind] = arr[ind], arr[ind-1]\n temp[ind-1], temp[ind] = temp[ind], temp[ind-1] \n ind -= 2\n else:\n ind -= 1\n ans = [str(i+1) for i in temp]\n print(' '.join(ans))", "t = int(input())\nwhile t>0:\n t -= 1\n \n n, k, s = list(map(int, input().split()))\n arr = list(map(int, input().split()))\n temp = sorted(list(range(n)), key=lambda x:arr[x])\n arr.sort()\n ind = n-1\n while ind > 0:\n if arr[ind] > s:\n ind -= 1\n elif arr[ind]+arr[ind-1] > s and arr[ind]+arr[0] <= s:\n temp = temp[ind:ind+1] + temp[:ind] + temp[ind+1:] \n break\n else:\n break\n ans = [str(i+1) for i in temp]\n print(' '.join(ans))", "import random\nt = int(input())\nwhile t>0:\n t -= 1\n \n n, k, s = list(map(int, input().split()))\n arr = list(map(int, input().split()))\n temp = sorted(list(range(n)), key=lambda x:arr[x])\n arr.sort()\n for j in range(5):\n for i in range(n-1):\n if arr[i]+arr[i+1] > s:\n arr[i], arr[i+1] = arr[i+1], arr[i]\n temp[i], temp[i+1] = temp[i+1], temp[i]\n ans = [str(i+1) for i in temp]\n print(' '.join(ans))", "import random\nt = int(input())\nwhile t>0:\n t -= 1\n \n n, k, s = list(map(int, input().split()))\n arr = list(map(int, input().split()))\n temp = sorted(list(range(n)), key=lambda x:arr[x])\n arr.sort()\n for j in range(5):\n for i in range(n-1):\n if arr[i]+arr[i+1] <= s:\n arr[i], arr[i+1] = arr[i+1], arr[i]\n temp[i], temp[i+1] = temp[i+1], temp[i]\n ans = [str(i+1) for i in temp]\n print(' '.join(ans))", "import random\nt = int(input())\nwhile t>0:\n t -= 1\n \n n, k, s = list(map(int, input().split()))\n arr = list(map(int, input().split()))\n temp = sorted(list(range(n)), key=lambda x:arr[x])\n arr.sort()\n for i in range(n-1):\n if arr[i]+arr[i+1] <= s:\n arr[i], arr[i+1] = arr[i+1], arr[i]\n temp[i], temp[i+1] = temp[i+1], temp[i]\n ans = [str(i+1) for i in temp]\n print(' '.join(ans))", "import random\nt = int(input())\nwhile t>0:\n t -= 1\n \n n, k, s = list(map(int, input().split()))\n arr = list(map(int, input().split()))\n temp = sorted(list(range(n)), key=lambda x:arr[x], reverse=True)\n arr = sorted(arr, reverse=True)\n ind = 0\n while ind<n and arr[ind]>s:\n ind += 1\n \n temp = sorted(temp[ind:]) + temp[:ind]\n \n ans = [str(i+1) for i in temp]\n print(' '.join(ans))", "import random\nt = int(input())\nwhile t>0:\n t -= 1\n \n n, k, s = list(map(int, input().split()))\n arr = list(map(int, input().split()))\n temp = sorted(list(range(n)), key=lambda x:arr[x], reverse=True)\n arr = sorted(arr, reverse=True)\n ind = 0\n while ind<n and arr[ind]>s:\n ind += 1\n \n temp = temp[ind:] + temp[:ind]\n \n ans = [str(i+1) for i in temp]\n print(' '.join(ans))", "import random\nt = int(input())\nwhile t>0:\n t -= 1\n \n n, k, s = list(map(int, input().split()))\n arr = list(map(int, input().split()))\n temp = sorted(list(range(n)), key=lambda x:arr[x])\n \"\"\"\n arr = sorted(arr, reverse=True)\n ind = 0\n while arr[ind]>s:\n ind += 1\n temp = temp[ind:] + temp[:ind]\n \"\"\" \n ans = [str(i+1) for i in temp]\n print(' '.join(ans))", "import random\nt = int(input())\nwhile t>0:\n t -= 1\n \n n, k, s = list(map(int, input().split()))\n arr = list(map(int, input().split()))\n temp = sorted(list(range(n)), key=lambda x:arr[x], reverse=True)\n arr = sorted(arr, reverse=True)\n ind = 0\n while arr[ind]>s:\n ind += 1\n #temp = temp[ind:] + temp[:ind] \n ans = [str(i+1) for i in temp]\n print(' '.join(ans))", "import random\nt = int(input())\nwhile t>0:\n t -= 1\n \n n, k, s = list(map(int, input().split()))\n arr = list(map(int, input().split()))\n temp = sorted(list(range(n)), key=lambda x:arr[x], reverse=True)\n arr = sorted(arr, reverse=True)\n ind = 0\n while arr[ind]>s:\n ind += 1\n temp = temp[ind:] + temp[:ind] \n ans = [str(i+1) for i in temp]\n print(' '.join(ans))", "import random\nt = int(input())\nwhile t>0:\n t -= 1\n \n n, k, s = list(map(int, input().split()))\n arr = list(map(int, input().split()))\n #temp = range(n, 0, -1)\n #random.shuffle(temp)\n #random.shuffle(temp)\n temp = sorted(list(range(n)), key=lambda x:arr[x], reverse=True)\n arr = sorted(arr, reverse=True)\n ind = 0\n while arr[ind]>s:\n ind += 1\n temp = temp[ind:] + temp[:ind] \n ans = [str(i+1) for i in temp]\n print(' '.join(ans[::-1]))", "import random\nt = int(input())\nwhile t>0:\n t -= 1\n \n n, k, s = list(map(int, input().split()))\n arr = list(map(int, input().split()))\n #temp = range(n, 0, -1)\n #random.shuffle(temp)\n #random.shuffle(temp)\n temp = sorted(list(range(n)),key=lambda x:arr[x],reverse=True)\n ans = [str(i+1) for i in temp]\n print(' '.join(ans[::-1]))", "import random\nt = int(input())\nwhile t>0:\n t -= 1\n \n n, k, s = list(map(int, input().split()))\n arr = list(map(int, input().split()))\n temp = list(range(n, 0, -1))\n random.shuffle(temp)\n #random.shuffle(temp)\n ans = [str(i) for i in temp]\n print(' '.join(ans[::-1]))", "import random\nt = int(input())\nwhile t>0:\n t -= 1\n \n n, k, s = list(map(int, input().split()))\n arr = list(map(int, input().split()))\n temp = list(range(n, 0, -1))\n random.shuffle(temp)\n random.shuffle(temp)\n ans = [str(i) for i in temp]\n print(' '.join(ans[::-1]))", "import random\nt = int(input())\nwhile t>0:\n t -= 1\n \n n, k, s = list(map(int, input().split()))\n arr = list(map(int, input().split()))\n temp = list(range(1, n+1))\n random.shuffle(temp)\n random.shuffle(temp)\n ans = [str(i) for i in temp]\n print(' '.join(ans[::-1]))", "import random\nt = int(input())\nwhile t>0:\n t -= 1\n \n n, k, s = list(map(int, input().split()))\n arr = list(map(int, input().split()))\n temp = list(range(1, n+1))\n random.shuffle(temp)\n ans = [str(i) for i in temp]\n print(' '.join(ans[::-1]))"] | {"inputs": [["2", "3 2 4", "3 4 1", "4 4 1", "1 1 1 1", "", ""]], "outputs": [["2 1 3", "4 3 2 1"]]} | INTERVIEW | PYTHON3 | CODECHEF | 8,668 | |
67282879282ddbe5cc4610e2a8bb1431 | UNKNOWN | Tweedle-Dee and Tweedle-Dum are playing a fierce match of binary Nim. This novel game is played with $N$ stacks, each of them containing only $1$-s and $0$-s.
Just like in normal Nim, Tweedle-Dee and Tweedle-Dum alternate turns; in their turn, a player must choose one non-empty stack and remove a positive number of elements from the top of this stack. However, Tweedle-Dee may only choose a stack with $0$ at the top (and remove elements from it afterwards), and similarly, Tweedle-Dum may only choose a stack with $1$ at the top. the player that cannot make a move loses
Suzumo does not want to wait for the end of the game, so given the starting player he asks you to determine the winner. Remember that Tweedle-Dee and Tweedle-Dum are legendary grandmasters of combinatorial games, so both always play optimally.
-----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 an integer $N$, a string $S$ denoting the number of stacks, the player that starts the game, respectively.
- Each of the following $N$ lines contains a single binary string $B$ representing a stack; the first character of $B$ corresponds to the top element of the stack and the last character to the bottom element.
-----Output-----
For each test case, print a single line containing the string "Dee" if Tweedle-Dee wins the match or "Dum" if Tweedle-Dum wins.
-----Constraints-----
- $1 \le T \le 500$
- $1 \le N \le 50$
- $1 \le |B| \le 50$
- each character in $B$ is either '1' or '0'
- $S$ is either "Dee" or "Dum"
-----Example Input-----
2
2 Dee
101
010
2 Dum
101
010
-----Example Output-----
Dum
Dee | ["for u in range(int(input())):\n p=input().split()\n n=int(p[0])\n s=p[1]\n x,y=0,0\n for i in range(n):\n l=input()\n if(l[0]=='1'):\n y+=l.count('1')\n else:\n x+=l.count('0')\n if(x<y):\n print(\"Dum\")\n elif(y<x):\n print(\"Dee\")\n else:\n if(s=='Dee'):\n print(\"Dum\")\n else:\n print(\"Dee\")\n", "for _ in range(int(input())):\n temp = list(input().split())\n n = int(temp[0])\n s = temp[1]\n du,de = 0,0\n for _ in range(n):\n mc = input()\n if mc[0] == '1':\n du+=mc.count('1')\n else:\n de+=mc.count('0')\n if de>du:\n print(\"Dee\")\n elif de<du:\n print(\"Dum\")\n else:\n if s == \"Dee\":\n print(\"Dum\")\n else:\n print(\"Dee\")", "# cook your dish here\nt = int(input())\nfor _ in range(t):\n arr = input().split()\n i1,j1 = 0,0\n for _ in range(int(arr[0])):\n s = str(input())\n if(s[0] == '0'):\n i1+=s.count('0')\n else:\n j1+=s.count('1') \n if(i1 == j1):\n if(arr[1] == \"Dee\"):\n print(\"Dum\")\n else:\n print(\"Dee\")\n elif(i1>j1):\n print(\"Dee\")\n else:\n print(\"Dum\")\n \n \n", "t=int(input())\nfor _ in range(t):\n countDee=0\n countDum=0\n n,s=input().split(maxsplit=1)\n n=int(n)\n s=str(s)\n for i in range(n):\n b=str(input())\n if b[0]=='0':\n countDee+=b.count('0')\n else:\n countDum+=b.count('1')\n if countDee>countDum:\n print(\"Dee\")\n elif countDee==countDum:\n if 'Dee' in s:\n print(\"Dum\")\n else:\n print(\"Dee\")\n else:\n print(\"Dum\")\n \n \n", "for i in range(int(input())):\n a,string=input().split()\n # print(a,string)\n zero=0\n one=0 \n for j in range(0,int(a)):\n k=input()\n if(k[0]=='1'):\n one+=k.count(\"1\") \n else:\n zero+=k.count(\"0\")\n # print(one,zero)\n if(string=='Dum'):\n if(one>zero):\n print('Dum')\n else:\n print('Dee')\n else:\n if(zero>one):\n print('Dee')\n else:\n print('Dum')\n", "# cook your dish here\nt=int(input())\nfor i in range(t):\n a,b=list(input().split())\n l=[]\n for i in range(int(a)):\n l.append(input())\n #print(l)\n r=0\n r1=0\n for i in range(len(l)):\n if l[i][0]==\"0\":\n r+=l[i].count(\"0\")\n else:\n r1+=l[i].count(\"1\")\n if b==\"Dee\":\n if r>r1:\n print(\"Dee\")\n else:\n print(\"Dum\")\n else:\n if r1>r:\n print(\"Dum\")\n else:\n print(\"Dee\")\n", "# cook your dish here\nfor _ in range(int(input())):\n n,s = input().split()\n n = int(n)\n b = []\n for i in range(n):\n b.append(input())\n \n zero = 0\n one = 0\n for i in range(n):\n if b[i][0] =='0':\n zero += b[i].count('0')\n else:\n one += b[i].count('1')\n \n if s=='Dee':\n if zero > one:\n print(\"Dee\")\n else:\n print(\"Dum\")\n else:\n if one > zero:\n print(\"Dum\")\n else:\n print(\"Dee\")\n", "# cook your dish here\nt=int(input())\n\nwhile t:\n n, s=input().split()\n n=int(n)\n Deec=0\n Dumc=0\n b=[] #Dee starts with 0; Dum starts with 1\n for _ in range(n):\n x = input()\n if x[0]=='0':\n for i in x:\n if i=='0':\n Deec+=1\n if x[0]=='1':\n for i in x:\n if i=='1':\n Dumc+=1\n \n if s==\"Dee\": \n if Deec>Dumc:\n print(\"Dee\")\n else:\n print(\"Dum\")\n \n else:\n if Dumc>Deec:\n print(\"Dum\")\n else:\n print(\"Dee\")\n \n t-=1", "# cook your dish here\nfor _ in range(int(input())):\n n,t=input().split()\n n=int(n)\n one=0\n zero=0\n for i in range(n):\n s=input()\n if s[0]=='1':\n one+=s.count(\"1\")\n else:\n zero+=s.count(\"0\")\n \n if(one>zero):\n print(\"Dum\")\n elif(one<zero):\n print(\"Dee\")\n else:\n if(t==\"Dee\"):\n print(\"Dum\")\n else:\n print(\"Dee\")\n \n \n \n \n", "# cook your dish here\nfor _ in range(int(input())):\n s=input().split()\n n=int(s[0])\n s1=s[1]\n a,b=0,0\n for i in range(n):\n x=input()\n if(x[0]=='0'):\n k0=x.count('0')\n a+=k0\n else:\n k1=x.count('1')\n b+=k1\n if(a==b):\n if(s1==\"Dee\"):\n print(\"Dum\")\n else:\n print(\"Dee\")\n else:\n if(a>b):\n print(\"Dee\")\n else:\n print(\"Dum\")", "def main():\n t = int(input())\n for _ in range(t):\n [n, s] = list(input().split())\n n = int(n)\n one, zero = 0, 0\n for i in range(n):\n s1 = input()\n if s1[0] == '0':\n zero += s1.count('0')\n else:\n one += s1.count('1')\n if zero > one:\n print('Dee')\n elif zero < one:\n print('Dum')\n else:\n if s == 'Dee':\n print('Dum')\n else:\n print('Dee')\n\ndef __starting_point():\n main()\n\n\n__starting_point()", "# cook your dish here\n\nt = int(input())\n\nfor _ in range(t):\n n,s = list(map(str,input().split()))\n n = int(n)\n count1,count2 = 0,0\n for i in range(n):\n k = input()\n if k[0] == '0':\n count1+=k.count('0')\n elif k[0] == '1':\n count2+=k.count('1')\n \n if count1 == count2:\n if s == 'Dee':\n print('Dum')\n\n else:\n print('Dee')\n\n elif count1>count2:\n print('Dee')\n\n else:\n print('Dum')\n", "t = int(input())\nfor i in range(t):\n dee = 0\n dum = 0\n [n, start] = input().split(' ')\n n=int(n)\n #print(n,starter)\n for k in range(n):\n pile = input()\n if pile[0] == '0':\n dee += pile.count('0')\n else:\n dum += pile.count('1')\n if start == 'Dum':\n if dum>dee:\n print('Dum')\n else:\n print('Dee')\n else:\n if dum<dee:\n print('Dee')\n else:\n print('Dum')", "t = int(input())\n\nwhile t:\n t-=1\n deeCount = 0\n dooCount = 0\n [n, starter] = input().split(' ')\n n=int(n)\n #print(n,starter)\n while n:\n n-=1\n stack = input()\n if stack[0] == '0':\n deeCount += stack.count('0')\n else:\n dooCount += stack.count('1')\n #print(deeCount, dooCount)\n if starter == 'Dum':\n if dooCount>deeCount:\n print('Dum')\n else:\n print('Dee')\n else:\n if dooCount<deeCount:\n print('Dee')\n else:\n print('Dum')", "for _ in range(int(input())):\n a,b=input().split()\n a=int(a)\n onec=0\n zeroc=0\n for i in range(a):\n stk=input()\n if stk[0]=='0':\n zeroc+=stk.count('0')\n else:\n onec+=stk.count('1')\n if b=='Dee':\n if zeroc>onec:\n print('Dee')\n else:\n print('Dum')\n else:\n if onec>zeroc:\n print('Dum')\n else:\n print('Dee')", "t = int(input())\nfor _ in range(t):\n n, s = input().split()\n c = [0, s == 'Dee']\n for _ in range(int(n)):\n b = input()\n c[b[0] == '1'] += b.count(b[0])\n print(('Dee', 'Dum')[c[0] < c[1]])\n", "t = int(input())\nfor _ in range(t):\n n, s = input().split()\n n = int(n)\n c = [0, s == 'Dee']\n for _ in range(n):\n b = input()\n c[b[0] == '1'] += b.count(b[0])\n print(('Dee', 'Dum')[c[0] < c[1]])\n", "t = int(input())\nfor _ in range(t):\n n, s = input().split()\n n = int(n)\n c = [0, 0]\n for _ in range(n):\n b = input()\n c[b[0] == '1'] += b.count(b[0])\n print(('Dee', 'Dum')[c[0] == c[1] and s == 'Dee' or c[0] < c[1]])\n", "t = int(input())\nnames = 'Dee', 'Dum'\nfor _ in range(t):\n n, s = input().split()\n n = int(n)\n c = [0, 0]\n for _ in range(n):\n b = input()\n c[b[0] == '1'] += b.count(b[0])\n print(names[c[0] == c[1] and s == 'Dee' or c[0] < c[1]])\n", "t = int(input())\nnames = 'Dee', 'Dum'\nfor _ in range(t):\n n, s = input().split()\n n = int(n)\n c = [0, 0]\n for _ in range(n):\n b = list(map(int, input()))\n c[b[0]] += b.count(b[0])\n print(names[c[0] == c[1] and s == 'Dee' or c[0] < c[1]])\n", "t = int(input())\nnames = 'Dee', 'Dum'\nfor _ in range(t):\n n, s = input().split()\n n = int(n)\n s = names.index(s)\n c = [0, 0]\n for _ in range(n):\n b = list(map(int, input()))\n c[b[0]] += b.count(b[0])\n print(names[c[0] == c[1] and s == 0 or c[0] < c[1]])\n", "t = int(input())\nnames = 'Dee', 'Dum'\nfor _ in range(t):\n n, s = input().split()\n n = int(n)\n s = names.index(s)\n c = [0, 0]\n for _ in range(n):\n b = list(map(int, input()))\n c[b[0]] += b.count(b[0])\n print(names[c[0] == c[1] and s ^ 1 or c[0] < c[1]])\n", "#https://www.codechef.com/problems/BINIM\n\n#https://www.youtube.com/watch?v=w6l_tDniL34&feature=youtu.be\n\nt=int(input())\n\nwhile t!=0:\n t-=1\n temp=input().split()\n p1=\"Dee\" #0\n p2=\"Dum\" #1\n start=temp[1]\n if(start==p1):\n start=0\n else:\n start=1\n n=int(temp[0])\n\n l=[]\n for i in range(n):\n s=input()\n s=list(s)[::-1] #stack\n s=[int(x) for x in s]\n l.append(s)\n \n \n \n \n while True:\n finished=False\n for s in l:\n done=False\n if(s): \n if(s[-1]==start):\n s.pop() \n done=True\n finished=True\n else:\n continue\n \n while(s): #playing optimally and taking control of the stack by \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0removing other player's elements\n if(s[-1]!=start):\n s.pop() \n done=True\n finished=True\n else:\n break\n if(done):\n break\n\n if(not finished):\n break\n start=1-start\n\n if(start==0):\n print(\"Dum\") #whoever couldn't finish, loses in this problem\n else:\n print(\"Dee\")\n\n\n", "for t in range(int(input())):\n n,m=[x for x in input().split()]\n a=int(n)\n n0,n1=0,0\n for i in range (a):\n s=input()\n z=s[0]\n if(z=='0'):\n n0+=1\n else:\n n1+=1\n for i in range(1,len(s)):\n if (s[i]==s[0]):\n if (s[i]=='0'):\n n0 += 1\n if(s[i]=='1'):\n n1 += 1\n if(n0 == n1):\n if m==\"Dee\":print(\"Dum\")\n if m==\"Dum\":print(\"Dee\")\n if(n0>n1):print(\"Dee\")\n if(n1>n0):print(\"Dum\")\n"] | {"inputs": [["2", "2 Dee", "101", "010", "2 Dum", "101", "010"]], "outputs": [["Dum", "Dee"]]} | INTERVIEW | PYTHON3 | CODECHEF | 9,226 | |
7fb0a361ae071d38c927d13b04ab3e59 | UNKNOWN | Kabir likes Tara's smile and wants to look at her smile. They are sitting in the class and you are friends with Kabir. You have to place a mirror (point size) in the front wall of the class so that Kabir can have a glimpse of Tara's smile.
Consider the front wall as x-axis . You are given the coordinates of position of Kabir (x1,y1)$(x1,y1)$ and Tara (x2,y2)$(x2,y2)$. Find the position where the mirror should be placed.
-----Input:-----
- First line will contain T$T$, number of testcases. Then the testcases follow.
- First line of each testcase contains two integers x1,y1$x1, y1$.
- Second line of each testcase contains two integers x2,y2$x2, y2$.
-----Output:-----
For each testcase, print the x-coordinate of the mirror. Absolute error of 10−2$10^{−2}$ is allowed.
-----Constraints:-----
- 1≤T≤1000$1 \leq T \leq 1000$
- 1≤x1,y1,x2,y2≤105$1 \leq x1,y1,x2,y2 \leq 10^5 $
-----Sample Input:-----
1
1 1
4 4
-----Sample Output:-----
1.60 | ["# cook your dish here\ntry:\n t = int(input())\n for _ in range(t):\n p = [int(x) for x in input().split()]\n q = [int(x) for x in input().split()]\n \n q[1] *= -1\n m = (q[1]-p[1])/(q[0]-p[0])\n c = p[1] - m*p[0]\n \n print(\"{:.2f}\".format(-c/m))\nexcept:\n pass", "#cook you dish here\nt=int(input())\nl=[]\nfor i in range(t):\n x1,y1=list(map(int,input().split()))\n x2,y2=list(map(int,input().split()))\n x=(x1*y2+x2*y1)/(y1+y2)\n l.append(x)\nfor i in l:\n print(i)\n \n\n", "# cook your dish here\ntry:\n for _ in range(int(input())):\n x1,y1 = list(map(float,input().split()))\n x2,y2 = list(map(float,input().split()))\n \n result = (y1*x2 + y2*x1)/(y1+y2)\n print(result)\n \nexcept Exception:\n pass\n", "# cook your dish here\nt=int(input())\nwhile(t>0):\n x1,y1=input().split()\n x2,y2=input().split()\n x1=int(x1)\n x2=int(x2)\n y1=int(y1)\n y2=int(y2)\n x=min(x1,x2)\n if x==x1:\n ans=(y1*(x2-x1))/(y1+y2)\n ans=x1+ans\n else:\n ans=(y2*(x1-x2))/(y1+y2)\n ans=x2+ans\n print('%.2f'%ans)\n \n t=t-1", "# cook your dish here\nt=int(input())\nl=[]\nfor i in range(t):\n x1,y1=list(map(int,input().split()))\n x2,y2=list(map(int,input().split()))\n x=(x1*y2+x2*y1)/(y1+y2)\n l.append(x)\nfor i in l:\n print(i)\n", "for _ in range(int(input())):\r\n\tx1,y1=list(map(int,input().split()))\r\n\tx2,y2=list(map(int,input().split()))\t\r\n\tm=(y2-(-y1))/(x2-x1)\r\n\ty=y2\r\n\tx=x2\r\n\tc=y-(m*x)\r\n\r\n\ty=0\r\n\tx=(y-c)/m\r\n\tprint(\"{:.2f}\".format(x))\r\n\r\n\r\n", "n=int(input())\nfor i in range(n):\n x1,y1=map(int,input().split())\n x2,y2=map(int,input().split())\n if(x1>x2):\n t=x1\n x1=x2\n x2=t\n t1=y1\n y1=y2\n y2=t1\n r=y1*(x2-x1)\n r1=r/(y2+y1)\n print(x1+r1)", "# cook your dish here\nt=int(input())\nfor _ in range(t):\n x1,y1=map(int,input().split())\n x2,y2=map(int,input().split())\n ans=(y1*x2 + y2*x1)/(y1+y2)\n print(\"{0:.2f}\".format(ans))"] | {"inputs": [["1", "1 1", "4 4"]], "outputs": [["1.60"]]} | INTERVIEW | PYTHON3 | CODECHEF | 2,157 | |
77aa46f530dba877ab930ced30cbac11 | UNKNOWN | The most dangerous cyborg Jenish is finally entrapped on a narrow bridge over a valley. The bridge is $N$ meters long. For convenience, position $i$ represents a portion of bridge between whose left border is at distance $i-1$ meters from left end and right border is at distance $i$ meters from left end.
There are $N$ batteries placed at positions $1,2...N$. The $i^{th}$ one has energy $a[i]$.
There are two tanks of strength $X$ at positions $0$ and $N+1$. Initially Jenish has $0$ energy.
From now at any second $t$ starting from $1$,
first, Jenish can select any battery placed at position $i$ such that $(t \leq i \leq N-t+1)$ and add $a[i]$ to his energy (every battery can be used atmost once).
Then both the tanks move one meter towards each other. If there are still any batteries present at positions where the tanks are heading, the battery gets destroyed.
At any moment if Jenish's total energy is greater than or equal to $X$, he destroys both the tanks and he escapes the cops. If by the end of $\lfloor \frac {(n+1)}{2}\rfloor^{th}$ second, he can't destroy the tanks, he himself gets destroyed. Find out if he can escape.
-----Input:-----
- The first line consists of a single integer $T$, the number of test cases.
- The first line of each test case contains two space separated integers which represents $N$ and $X$ for that test case respectively.
- The second line of each test case contains $N$ space separated integers, $i^{th}$ of which represents $a[i]$.
-----Output:-----
For each test case, print in a single line, $YES$ if Jenish can escape or $NO$ if he gets destroyed.
-----Constraints:-----
- $1 \leq X \leq 10^9$
- $0 \leq a[i] \leq 10^6$
- $ 1 \leq N \leq 10^5$
- $\Sigma$ $N$ over all the test cases does not exceed $10^5$
-----Sample Input:-----
3
4 8
5 1 4 2
3 4
3 1 2
2 7
5 5
-----Sample Output:-----
YES
YES
NO
-----Explanation-----
For test $1$, in the 1st second, first Jenish will select battery at index $1$ and then the tanks from either side will move one meter closer, thus destroying the battery at index $4$.Then, in the next second, Jenish will select battery at index $3$.Then,tanks will move one meter closer again to destroy the remaining battery at index $2$.But now, Jenish has a total energy of $9$ units which is more than enough to destroy the tanks.
For test $2$, Jenish can use batteries at index $1$ and $2$ to get a total energy of $4$ units.
For test $3$, Jenish can use batteries at index $1$ or $2$ and get a maximum of $5$ units of energy which is less than required. | ["# cook your dish here\nimport bisect\nfor _ in range(int(input())):\n \n n,x=list(map(int,input().split()))\n \n l=list(map(int,input().split()))\n battery=[]\n \n power=0\n i=0\n t=(n+1)//2\n while power<x and i<t:\n \n if i==n-i-1:\n temp=[-1,l[i]]\n else:\n temp=sorted([ l[i], l[n-i-1] ])\n \n power+=temp[1]\n pos=bisect.bisect_right(battery, temp[1], lo=0, hi=len(battery))\n battery.insert(pos,temp[1])\n \n if temp[0]>battery[0]:\n \n power-=battery.pop(0)\n power+=temp[0]\n pos=bisect.bisect_right(battery, temp[0], lo=0, hi=len(battery))\n battery.insert(pos,temp[0])\n \n i+=1\n \n \n if power>=x:\n print('YES')\n else:\n print('NO')\n", "# cook your dish here\nimport bisect\nfor _ in range(int(input())):\n \n n,x=list(map(int,input().split()))\n \n l=list(map(int,input().split()))\n battery=[]\n \n power=0\n i=0\n t=(n+1)//2\n while power<x and i<t:\n \n if i==n-i-1:\n temp=[-1,l[i]]\n else:\n temp=sorted([ l[i], l[n-i-1] ])\n \n power+=temp[1]\n pos=bisect.bisect_right(battery, temp[1], lo=0, hi=len(battery))\n battery.insert(pos,temp[1])\n \n if temp[0]>battery[0]:\n \n power-=battery.pop(0)\n power+=temp[0]\n pos=bisect.bisect_right(battery, temp[0], lo=0, hi=len(battery))\n battery.insert(pos,temp[0])\n \n i+=1\n \n \n if power>=x:\n print('YES')\n else:\n print('NO')\n", "# cook your dish here\nimport heapq\nfor _ in range(int(input())):\n \n n,x=list(map(int,input().split()))\n \n l=list(map(int,input().split()))\n battery=[]\n \n heapq.heapify(battery)\n power=0\n i=0\n t=(n+1)//2\n while power<x and i<t:\n \n if i==n-i-1:\n temp=[-1,l[i]]\n else:\n temp=sorted([ l[i], l[n-i-1] ])\n \n power+=temp[1]\n heapq.heappush(battery,temp[1])\n \n y=heapq.heappop(battery)\n heapq.heappush(battery,y)\n if temp[0]>y:\n \n power-=heapq.heappop(battery)\n power+=temp[0]\n heapq.heappush(battery,temp[0])\n \n i+=1\n \n \n if power>=x:\n print('YES')\n else:\n print('NO')\n", "# cook your dish here\nimport heapq\nfor _ in range(int(input())):\n \n n,x=list(map(int,input().split()))\n \n l=list(map(int,input().split()))\n battery=[]\n \n heapq.heapify(battery)\n power=0\n i=0\n t=(n+1)//2\n while power<x and i<t:\n \n if i==n-i-1:\n temp=[-1,l[i]]\n else:\n temp=sorted([ l[i], l[n-i-1] ])\n \n power+=temp[1]\n heapq.heappush(battery,temp[1])\n \n y=heapq.heappop(battery)\n heapq.heappush(battery,y)\n if temp[0]>y:\n \n power-=heapq.heappop(battery)\n power+=temp[0]\n heapq.heappush(battery,temp[0])\n \n i+=1\n \n \n if power>=x:\n print('YES')\n else:\n print('NO')\n", "# cook your dish here\nimport heapq\nfor _ in range(int(input())):\n \n n,x=list(map(int,input().split()))\n \n l=list(map(int,input().split()))\n battery=[]\n \n heapq.heapify(battery)\n power=0\n i=0\n t=(n+1)//2\n while power<x and i<t:\n \n if i==n-i-1:\n temp=[-1,l[i]]\n else:\n temp=sorted([ l[i], l[n-i-1] ])\n \n power+=temp[1]\n heapq.heappush(battery,temp[1])\n \n y=heapq.heappop(battery)\n heapq.heappush(battery,y)\n if temp[0]>y:\n \n power-=heapq.heappop(battery)\n power+=temp[0]\n heapq.heappush(battery,temp[0])\n \n i+=1\n \n \n if power>=x:\n print('YES')\n else:\n print('NO')\n", "# cook your dish here\nimport heapq\nfor _ in range(int(input())):\n \n n,x=list(map(int,input().split()))\n \n l=list(map(int,input().split()))\n battery=[]\n \n heapq.heapify(battery)\n power=0\n i=0\n t=(n+1)//2\n while power<x and i<t:\n \n if i==n-i-1:\n temp=[-1,l[i]]\n else:\n temp=sorted([ l[i], l[n-i-1] ])\n \n power+=temp[1]\n heapq.heappush(battery,temp[1])\n \n y=heapq.heappop(battery)\n heapq.heappush(battery,y)\n if temp[0]>y:\n \n power-=heapq.heappop(battery)\n power+=temp[0]\n heapq.heappush(battery,temp[0])\n \n i+=1\n \n \n if power>=x:\n print('YES')\n else:\n print('NO')\n", "# cook your dish here\nimport heapq\nfor _ in range(int(input())):\n \n n,x=list(map(int,input().split()))\n \n l=list(map(int,input().split()))\n battery=[]\n \n heapq.heapify(battery)\n power=0\n i=0\n t=(n+1)//2\n while power<x and i<t:\n \n if i==n-i-1:\n temp=[-1,l[i]]\n else:\n temp=sorted([ l[i], l[n-i-1] ])\n \n power+=temp[1]\n heapq.heappush(battery,temp[1])\n \n y=heapq.heappop(battery)\n heapq.heappush(battery,y)\n if temp[0]>y:\n \n power-=heapq.heappop(battery)\n power+=temp[0]\n heapq.heappush(battery,temp[0])\n \n i+=1\n \n \n if power>=x:\n print('YES')\n else:\n print('NO')\n", "# cook your dish here\nimport heapq\nfor _ in range(int(input())):\n \n n,x=list(map(int,input().split()))\n \n l=list(map(int,input().split()))\n battery=[]\n \n heapq.heapify(battery)\n power=0\n i=0\n t=(n+1)//2\n while power<x and i<t:\n \n if i==n-i-1:\n temp=[-1,l[i]]\n else:\n temp=sorted([ l[i], l[n-i-1] ])\n \n power+=temp[1]\n heapq.heappush(battery,temp[1])\n \n y=heapq.heappop(battery)\n heapq.heappush(battery,y)\n if temp[0]>y:\n \n power-=heapq.heappop(battery)\n power+=temp[0]\n heapq.heappush(battery,temp[0])\n \n i+=1\n \n \n if power>=x:\n print('YES')\n else:\n print('NO')\n", "# cook your dish here\nimport heapq\nfor _ in range(int(input())):\n \n n,x=list(map(int,input().split()))\n \n l=list(map(int,input().split()))\n battery=[]\n \n heapq.heapify(battery)\n power=0\n i=0\n t=(n+1)//2\n while power<x and i<t:\n \n if i==n-i-1:\n temp=[-1,l[i]]\n else:\n temp=sorted([ l[i], l[n-i-1] ])\n \n power+=temp[1]\n heapq.heappush(battery,temp[1])\n \n y=heapq.heappop(battery)\n heapq.heappush(battery,y)\n if temp[0]>y:\n \n power-=heapq.heappop(battery)\n power+=temp[0]\n heapq.heappush(battery,temp[0])\n \n i+=1\n \n \n if power>=x:\n print('YES')\n else:\n print('NO')\n", "for _ in range(int(input())):\n n,x=map(int,input().split())\n a=list(map(int,input().split()))\n t=2\n f=[]\n flag=0\n if(x>=sum(a)):\n print(\"NO\")\n continue\n f.append(max(a[-1],a[0]))\n while(t<=(n+1)//2):\n b=a[t-1:n-t+1]\n d=max(b[0],b[-1])\n e=min(b[0],b[-1])\n ind=0\n flag1=0\n for i in range(len(f)):\n if(f[i]<d):\n continue\n else:\n flag1=1\n ind=i\n f.insert(ind,d)\n # a[b.index(d)+t-1]=0\n break\n if(flag1==0):\n f.append(d)\n # a[b.index(d) + t - 1] = 0\n ind=len(f)\n flag2=0\n for i in range(ind):\n if(f[i]<e):\n flag2=1\n f.remove(f[i])\n break\n if(flag2==1):\n flag3=0\n for i in range(len(f)):\n if(f[i]<e):\n continue\n else:\n flag3=1\n inde=i\n f.insert(inde,e)\n # a[len(b)-1 + t-1] = 0\n break\n if(flag3==0):\n f.append(e)\n # a[len(b)-1+t-1]=0\n inde=len(f)\n\n t+=1\n if(sum(f)>=x):\n flag=1\n print(\"YES\")\n break\n if(flag==0):\n if(sum(f)>=x):\n print(\"YES\")\n else:\n print(\"NO\")", "for _ in range(int(input())):\n n,x=map(int,input().split())\n a=list(map(int,input().split()))\n t=2\n f=[]\n flag=0\n if(x>=sum(a)):\n print(\"NO\")\n continue\n f.append(max(a[-1],a[0]))\n while(t<=(n+1)//2):\n b=a[t-1:n-t+1]\n d=max(b[0],b[-1])\n e=min(b[0],b[-1])\n ind=0\n flag1=0\n for i in range(len(f)):\n if(f[i]<d):\n continue\n else:\n flag1=1\n ind=i\n f.insert(ind,d)\n a[b.index(d)+t-1]=0\n break\n if(flag1==0):\n f.append(d)\n a[b.index(d) + t - 1] = 0\n ind=len(f)\n flag2=0\n for i in range(ind):\n if(f[i]<e):\n flag2=1\n f.remove(f[i])\n break\n if(flag2==1):\n flag3=0\n for i in range(len(f)):\n if(f[i]<e):\n continue\n else:\n flag3=1\n inde=i\n f.insert(inde,e)\n a[len(b)-1 + t-1] = 0\n break\n if(flag3==0):\n f.append(e)\n a[len(b)-1+t-1]=0\n inde=len(f)\n\n t+=1\n if(sum(f)>=x):\n flag=1\n print(\"YES\")\n break\n if(flag==0):\n if(sum(f)>=x):\n print(\"YES\")\n else:\n print(\"NO\")", "t = int(input())\n\nfor _ in range(t):\n n,x = map(int,input().split())\n \n l = list(map(int,input().split()))\n \n time = (n+1)//2\n energy,flag = 0,1\n temp = []\n \n for i in range(time):\n elem = max(l[0],l[-1])\n energy += elem\n if(len(l)>1):\n minn = min(l[0],l[-1])\n temp.append(elem)\n val = min(temp)\n if(val<minn):\n energy = energy - val + minn\n temp.remove(val)\n temp.append(minn)\n l.pop(0)\n if(l):\n l.pop()\n if (energy>=x):\n print(\"YES\")\n flag = 0\n break\n \n if(flag):\n print(\"NO\")", "from heapq import heapify, heappush, heappop\n\nt = int(input())\n\nfor _ in range(t):\n n,x = map(int,input().split())\n \n l = list(map(int,input().split()))\n time = (n+1)//2\n \n h = []\n \n heapify(h)\n \n energy = max(l[0],l[-1])\n heappush(h,energy)\n \n for i in range(1,time):\n left,right = i,n-1-i\n \n mx = max(l[left],l[right])\n mn = min(l[left],l[right])\n \n energy += mx\n heappush(h,mx)\n \n if(left!=right):\n if(h[0]<mn):\n energy -= h[0]\n heappop(h)\n energy += mn\n heappush(h,mn)\n \n if(energy>=x):\n print(\"YES\")\n else:\n print(\"NO\")", "import heapq\nfor i in range(int(input())):\n n,x=list(map(int,input().split()))\n list1=list(map(int,input().split()))\n if(n==2):\n if(max(list1)>=x):\n print(\"YES\")\n else:\n print(\"NO\")\n continue\n i=1\n j=n-2\n ans=0\n flg=0\n list2=[max(list1[0],list1[-1])]\n heapq.heapify(list2)\n while(j>=i):\n max1,min1=max(list1[i],list1[j]),min(list1[i],list1[j])\n if(i==j):\n heapq.heappush(list2,max1)\n break\n heapq.heappush(list2,max1)\n ele=heapq.heappop(list2)\n heapq.heappush(list2,max(min1,ele))\n i+=1\n j-=1\n if(sum(list(list2))>=x):\n print(\"YES\")\n else:\n print(\"NO\")# cook your dish here\n"] | {"inputs": [["3", "4 8", "5 1 4 2", "3 4", "3 1 2", "2 7", "5 5"]], "outputs": [["YES", "YES", "NO"]]} | INTERVIEW | PYTHON3 | CODECHEF | 9,632 | |
873f4d513741735d227571e2d6247f73 | UNKNOWN | Once upon a time, a king and a few of his soldiers were caught by an enemy king in a war.
He puts them in a circle. The first man in the circle has to kill the second man, the third man has to kill the fourth, fifth man to kill the sixth and so on. When the circle is completed, the remaining people have to form a circle and the process has to repeat. The last man standing will be set free.
If the king has to be set free, which position must he take? For any given N number of people, write a program to find the position that the king has to take.
-----Input-----
Any positive integer in the range 1 to 10000.
-----Output-----
A positive integer indicating safest position
-----Example-----
Input:
9
Output:
3 | ["n=int(input())\narr=[]\nfor i in range(1,n+1):\n arr.append(i)\nc=0\ni=0\nf=0;\nwhile(c<n-1):\n if(arr[i%n]!=-1 and f):\n arr[i%n]=-1\n c=c+1\n f=0\n if(arr[i%n]!=-1):\n f=1\n i=i+1\n\nfor i in range(0,n):\n if(arr[i]!=-1):\n ans=arr[i]\n break;\nprint(ans) \n", "import sys\nn = int(sys.stdin.readline())\nans=0\ni=-1\nn1=n\nwhile n1>0 :\n n1 = (int)(n1/2)\n #print n1\n i = i + 1\nans = (n - (1<<i))*2 + 1\nprint(ans)"] | {"inputs": [["9"]], "outputs": [["3"]]} | INTERVIEW | PYTHON3 | CODECHEF | 429 | |
4c99d889e2644a0544e50fc00eba07b8 | UNKNOWN | Chef has come to a 2 dimensional garden in which there are N points. Each point has coordinates (x, y), where x can either be 1 or 2 or 3. Chef will now choose every triplet of these N points and make a triangle from it. You need to tell the sum of areas of all the triangles the Chef makes.
Note that some of the triplets might not form proper triangles, and would end up as a line or a point (ie. degenerate), but that is fine because their area will be zero.
-----Input-----
- The first line contains a single integer T, the number of test cases. The description of each testcase follows.
- The first line of each test case contains an integer N denoting the number of points on the plane.
- The next N lines contain 2 space separated integers x and y denoting the coordinates of the points.
-----Output-----
For each test case, output a single line containing the answer. Your answer will be considered correct if the absolute error is less than or equal to 10-2.
-----Constraints-----
- 1 ≤ T ≤ 20
- 1 ≤ N ≤ 2000
- 1 ≤ x ≤ 3
- 1 ≤ y ≤106
- All (x, y) pairs are distinct
-----Example-----
Input:
2
3
1 1
2 1
3 3
4
1 1
2 2
2 1
3 3
Output:
1.0
2.0
-----Explanation:-----
Test Case 1: There is only one triangle which has non-zero area, and it's area is 1, hence the output.
Test Case 2: Let the points be A(1,1), B(2,2), C(2,1), D(3,3). There are 3 non degenerate triangles possible.
- area ABC = 0.5
- area BCD = 0.5
- area ACD = 1
Total area = 2 | ["# cook your dish here\n# Author: Dancing Monkey | Created: 09.DEC.2018\n\n\nimport bisect\nfor _ in range(int(input())):\n n = int(input())\n x1 , x2, x3 = [], [], []\n for i in range(n):\n x, y = list(map(int, input().split()))\n\n if x == 1: x1.append(y)\n if x == 2: x2.append(y)\n if x == 3: x3.append(y)\n\n x1.sort()\n x2.sort()\n x3.sort()\n\n y1, y2, y3 = len(x1), len(x2), len(x3)\n area = 0\n for i in range(y1):\n for j in range(i+1, y1):\n area += abs(x1[i] - x1[j])*(y2 + (2*y3))\n\n for i in range(y3):\n for j in range(i+1, y3):\n area += abs(x3[i] - x3[j])*(y2 + (2*y1))\n\n for i in range(y2):\n for j in range(i+1, y2):\n area += abs(x2[i] - x2[j])*(y1 + y3)\n\n area /= 2\n\n s1 = [0]\n for i in range(y2): s1.append(s1[-1] + x2[i])\n # print(s1)\n s2 = [0]\n for i in range(y2):s2.append(s2[-1] + x2[y2 - 1 - i])\n # print(s2)\n\n for i in x1:\n for j in x3:\n p1 = (i + j) / 2\n p = bisect.bisect_left(x2, p1)\n # print('p', p)\n l = p\n h = y2 - l\n # print(l, h)\n\n area += p1*(l) - s1[l]\n # print('dfg', area)\n area += s2[h] - p1*(h)\n\n print(format(area, 'f'))\n # print()\n", "# Author: Dancing Monkey | Created: 09.DEC.2018\n\n\nimport bisect\nfor _ in range(int(input())):\n n = int(input())\n x1 , x2, x3 = [], [], []\n for i in range(n):\n x, y = list(map(int, input().split()))\n\n if x == 1: x1.append(y)\n if x == 2: x2.append(y)\n if x == 3: x3.append(y)\n\n x1.sort()\n x2.sort()\n x3.sort()\n\n y1, y2, y3 = len(x1), len(x2), len(x3)\n area = 0\n for i in range(y1):\n for j in range(i+1, y1):\n area += abs(x1[i] - x1[j])*(y2 + (2*y3))\n\n for i in range(y3):\n for j in range(i+1, y3):\n area += abs(x3[i] - x3[j])*(y2 + (2*y1))\n\n for i in range(y2):\n for j in range(i+1, y2):\n area += abs(x2[i] - x2[j])*(y1 + y3)\n\n area /= 2\n\n s1 = [0]\n for i in range(y2): s1.append(s1[-1] + x2[i])\n # print(s1)\n s2 = [0]\n for i in range(y2):s2.append(s2[-1] + x2[y2 - 1 - i])\n # print(s2)\n\n for i in x1:\n for j in x3:\n p1 = (i + j) / 2\n p = bisect.bisect_left(x2, p1)\n # print('p', p)\n l = p\n h = y2 - l\n # print(l, h)\n\n area += p1*(l) - s1[l]\n # print('dfg', area)\n area += s2[h] - p1*(h)\n\n print(format(area, 'f'))\n # print()\n"] | {"inputs": [["2", "3", "1 1", "2 1", "3 3", "4", "1 1", "2 2", "2 1", "3 3"]], "outputs": [["1.0", "2.0"]]} | INTERVIEW | PYTHON3 | CODECHEF | 2,255 | |
abc7fdaacb5421aaf1cf86f5de687534 | UNKNOWN | The annual snake festival is upon us, and all the snakes of the kingdom have gathered to participate in the procession. Chef has been tasked with reporting on the procession, and for this he decides to first keep track of all the snakes. When he sees a snake first, it'll be its Head, and hence he will mark a 'H'. The snakes are long, and when he sees the snake finally slither away, he'll mark a 'T' to denote its tail. In the time in between, when the snake is moving past him, or the time between one snake and the next snake, he marks with '.'s.
Because the snakes come in a procession, and one by one, a valid report would be something like "..H..T...HTH....T.", or "...", or "HT", whereas "T...H..H.T", "H..T..H", "H..H..T..T" would be invalid reports (See explanations at the bottom).
Formally, a snake is represented by a 'H' followed by some (possibly zero) '.'s, and then a 'T'. A valid report is one such that it begins with a (possibly zero length) string of '.'s, and then some (possibly zero) snakes between which there can be some '.'s, and then finally ends with some (possibly zero) '.'s.
Chef had binged on the festival food and had been very drowsy. So his report might be invalid. You need to help him find out if his report is valid or not.
-----Input-----
- The first line contains a single integer, R, which denotes the number of reports to be checked. The description of each report follows after this.
- The first line of each report contains a single integer, L, the length of that report.
- The second line of each report contains a string of length L. The string contains only the characters '.', 'H', and 'T'.
-----Output-----
- For each report, output the string "Valid" or "Invalid" in a new line, depending on whether it was a valid report or not.
-----Constraints-----
- 1 ≤ R ≤ 500
- 1 ≤ length of each report ≤ 500
-----Example-----
Input:
6
18
..H..T...HTH....T.
3
...
10
H..H..T..T
2
HT
11
.T...H..H.T
7
H..T..H
Output:
Valid
Valid
Invalid
Valid
Invalid
Invalid
-----Explanation-----
"H..H..T..T" is invalid because the second snake starts before the first snake ends, which is not allowed.
".T...H..H.T" is invalid because it has a 'T' before a 'H'. A tail can come only after its head.
"H..T..H" is invalid because the last 'H' does not have a corresponding 'T'. | ["# cook your dish here\nt=int(input())\nfor i in range(t):\n n=int(input())\n s=input().strip()\n c=0\n for i in range(len(s)):\n if s[i]=='.':\n continue\n if s[i]=='H':\n c+=1\n if s[i]=='T':\n c-=1\n if c>1:\n break\n if c<0:\n break\n if c==0:\n print('Valid')\n else:\n print('Invalid')", "for i in range(int(input())):\n s = input()\n l = list(input())\n l = list([x for x in l if x != '.'])\n if 'T' in l[::2] or 'H' in l[1::2] or len(l)%2 != 0:\n print('Invalid')\n else:\n print('Valid')\n", "# cook your dish here\nfor _ in range(int(input())):\n l = input()\n s = list(input())\n s = list([x for x in s if x != '.'])\n if 'T' in s[::2] or 'H' in s[1::2] or len(s)%2 != 0:\n print('Invalid')\n else:\n print('Valid')\n", "t=int(input())\nfor i in range(t):\n n=int(input())\n s=input()\n c=0\n for i in s:\n if i=='H':\n c=c+1\n if i=='T':\n c=c-1\n if c>1:\n break\n if c<0:\n break\n if c==0:\n print('Valid')\n else:\n print('Invalid')", "t=int(input())\nfor i in range(t):\n n=int(input())\n s=input()\n c=0\n for i in s:\n if i=='H':\n c=c+1\n if i=='T':\n c=c-1\n if c>1:\n break\n if c<0:\n break\n if c==0:\n print('Valid')\n else:\n print('Invalid')# cook your dish here\n", "# cook your dish here\n# cook your dish here\nfor z in range(int(input())) :\n n = int(input())\n s = input()\n s = s.replace('.','')\n l = len(s)\n if l%2 != 0 :\n print(\"Invalid\")\n elif l==0 :\n print(\"Valid\")\n elif s[0]!= 'H' or s[-1]!= 'T' :\n print(\"Invalid\")\n else:\n for i in range(l-1):\n if s[i] == s[i+1] :\n print(\"Invalid\")\n break\n else:\n print(\"Valid\")", "# cook your dish here\nfor z in range(int(input())) :\n n = int(input())\n s = input()\n s = s.replace('.','')\n l = len(s)\n if l%2 != 0 :\n print(\"Invalid\")\n elif l==0 :\n print(\"Valid\")\n elif s[0]!= 'H' or s[-1]!= 'T' :\n print(\"Invalid\")\n else:\n for i in range(l-1):\n if s[i] == s[i+1] :\n print(\"Invalid\")\n break\n else:\n print(\"Valid\")", "for _ in range(int(input())):\n \n n = int(input())\n \n s = input()\n \n h,t,prev,flag = 0,0,'',0\n \n for i in s:\n \n if prev == '' and i == 'T':\n \n flag = 1\n \n if i == 'H':\n \n h += 1\n \n if prev == 'H':\n \n flag = 1\n \n elif i == 'T':\n \n t += 1\n \n if prev == 'T':\n \n flag = 1\n \n if i in ('H','T'):\n \n prev = i\n \n print(\"Invalid\" if flag == 1 else \"Invalid\" if h != t else \"Valid\")", "t = int(input())\nfor z in range(t) :\n n = int(input())\n s = input()\n s = s.replace('.','')\n l = len(s)\n if l%2 != 0 :\n print(\"Invalid\")\n elif l==0 :\n print(\"Valid\")\n elif s[0]!= 'H' or s[-1]!= 'T' :\n print(\"Invalid\")\n else:\n for i in range(l-1):\n if s[i] == s[i+1] :\n print(\"Invalid\")\n break\n else:\n print(\"Valid\")", "t = int(input())\nfor i in range(t):\n n = int(input())\n a = input()\n valid = True\n count = 0\n for j in a:\n if j == 'H':\n count+=1\n if count>1:\n valid= False\n if j == 'T':\n count-=1\n if count<0:\n valid= False\n if valid and count==0:\n print('Valid')\n else:\n print('Invalid')\n", "t = int(input())\nfor z in range(t) :\n n = int(input())\n s = input()\n s = s.replace('.','')\n l = len(s)\n if l%2 != 0 :\n print(\"Invalid\")\n elif l==0 :\n print(\"Valid\")\n elif s[0]!= 'H' or s[-1]!= 'T' :\n print(\"Invalid\")\n else:\n for i in range(l-1):\n if s[i] == s[i+1] :\n print(\"Invalid\")\n break\n else:\n print(\"Valid\")", "# cook your dish here\nfor _ in range(int(input())):\n n=int(input())\n l=input()\n k=\"T\"\n h=t=0\n f=0\n for i in range(n):\n if(l[i]==\"H\"):\n if(k==\"T\"):\n h+=1\n k=\"H\"\n else:\n print(\"Invalid\")\n f=1\n break\n elif(l[i]==\"T\"):\n if(k==\"H\"):\n t+=1\n k=\"T\"\n else:\n print(\"Invalid\")\n f=1\n break\n if(f==0):\n if(h!=t):\n print(\"Invalid\")\n else:\n print(\"Valid\")\n", "# cook your dish here\nt = int(input())\nfor z in range(t) :\n n = int(input())\n s = input()\n s = s.replace('.','')\n l = len(s)\n if l%2 != 0 :\n print(\"Invalid\")\n elif l==0 :\n print(\"Valid\")\n elif s[0]!= 'H' or s[-1]!= 'T' :\n print(\"Invalid\")\n else:\n for i in range(l-1):\n if s[i] == s[i+1] :\n print(\"Invalid\")\n break\n else:\n print(\"Valid\")", "t=int(input())\nfor i in range(t):\n s=[]\n b=[]\n c=0\n n=int(input())\n s=input()\n for j in s:\n if(j!=\".\"):\n b.append(j)\n if(len(b)==0):\n print(\"Valid\")\n elif(len(b)%2!=0):\n print(\"Invalid\")\n elif(b[0]!='H' or b[-1]!='T'):\n print(\"Invalid\")\n else:\n for j in range(len(b)-2):\n if(b[j]!=b[j+2]):\n c=1\n break\n if(c==0):\n print(\"Valid\")\n else:\n print(\"Invalid\")\n", "# cook your dish here\nfor _ in range(int(input())):\n n=int(input())\n s=input()\n flag=0\n m='0'\n l=list(s)\n for i in s:\n if(i=='.'):\n l.remove(i)\n k=len(l)\n if(k==0):\n print(\"Valid\")\n else:\n for i in range(0,k):\n if(l[0]=='T'):\n flag=1\n break\n if((l[i]=='H' and m=='H') or (l[i]=='T' and m=='T')):\n flag=1\n break\n if(l[i]=='H'):\n m='H'\n if(l[i]=='T'):\n m='T'\n if(flag==0 and l[k-1]=='T'):\n print('Valid')\n else:\n print('Invalid')\n", "# cook your dish here\nfor i in range(int(input())):\n x=int(input())\n y=input()\n z=y.replace('.','')\n z=z.replace('HT','')\n print(\"Invalid\" if len(z)>0 else \"Valid\")", "# cook your dish here\nfor _ in range(int(input())):\n n=int(input())\n a=input()\n b=[]\n c=0\n for i in a:\n if i==\"H\" or i==\"T\":\n b.append(i)\n while len(b)> 2*c:\n if len(b)%2!=0:\n print(\"Invalid\")\n break\n elif b[2*c]==\"H\" and b[2*c +1]==\"T\":\n c=c+1 \n else:\n print(\"Invalid\")\n break\n if 2*c==len(b):\n print(\"Valid\")\n \n", "R = int(input())\nfor i in range(R) :\n \n l = int(input())\n s = input()\n b = 0\n a = []\n for j in s :\n if j == \"H\" or j == \"T\" :\n a.append(j) \n #List gets completed.\n while len(a) > 2*b :\n if len(a) % 2 != 0 :\n print(\"Invalid\")\n break \n\n elif a[2*b] == \"H\" and a[2*b + 1] == \"T\" :\n b = b + 1\n\n else :\n print(\"Invalid\")\n break\n\n if 2*b == len(a) :\n print(\"Valid\")\n\n\n\n\n\n\n\n", "t=int(input())\nwhile t:\n t-=1\n l=int(input())\n s=list(input())\n l=[]\n a=0\n for i in range(len(s)):\n if s[i]!='.':\n l.append(s[i])\n \n for i in range(0,len(l)-1,2):\n if l[i]=='H' and l[i+1]=='T':\n a+=2\n \n if(a==len(l)):\n print(\"Valid\")\n else:\n print(\"Invalid\")", "for _ in range(int(input())):\n n=int(input())\n s=input()\n s=s.replace(\".\",\"\")\n if len(s)==0:\n print( \"Valid\")\n continue\n elif len(s)==1 or s[len(s)-1]=='H' :\n print( \"Invalid\")\n continue\n for i in range(len(s)):\n if s[i]==\"T\" and i==0:\n print( \"Invalid\")\n break\n elif s[i]=='H':\n if s[i-1]=='H':\n print( \"Invalid\")\n break\n elif s[i]=='T':\n if s[i-1]=='T':\n print( \"Invalid\")\n break\n else:\n print( \"Valid\")", "# cook your dish here\n\ndef answerFunction(s, n):\n prev = None\n new = \"\"\n for each in s:\n if each != '.':\n new += each\n if new == \"\":\n return \"Valid\"\n \n if len(new) == 1:\n return \"Invalid\"\n \n for i in range(len(new)): # HTHT\n if i == 0 and new[i] == 'T':\n return \"Invalid\"\n if new[i] == 'H':\n if prev == 'H':\n return \"Invalid\"\n else:\n prev = new[i]\n elif new[i] == 'T':\n if prev == 'T':\n return \"Invalid\"\n else:\n prev = new[i]\n if prev == 'H':\n return \"Invalid\"\n return \"Valid\";\n\nfor _ in range(int(input())):\n n = int(input())\n s = input()\n print(answerFunction(s, n))\n", "# cook your dish here\n\ndef answerFunction(s, n):\n prev = None\n new = \"\"\n for each in s:\n if each != '.':\n new += each\n if new == \"\":\n return \"Valid\"\n \n if len(new) == 1:\n return \"Invalid\"\n \n for i in range(len(new)): # HTHT\n if i == 0 and new[i] == 'T':\n return \"Invalid\"\n if new[i] == 'H':\n if prev == 'H':\n return \"Invalid\"\n else:\n prev = new[i]\n elif new[i] == 'T':\n if prev == 'T':\n return \"Invalid\"\n else:\n prev = new[i]\n if prev == 'H':\n return \"Invalid\"\n return \"Valid\";\n\nfor _ in range(int(input())):\n n = int(input())\n s = input()\n print(answerFunction(s, n))\n", "# cook your dish here\nfor _ in range(int(input())):\n n = int(input())\n s = input()\n l = []\n f = True\n for i in range(n):\n if s[i] == \"H\":\n l.append(s[i])\n elif s[i] == \"T\":\n if len(l)>=1:\n l = l[:-1]\n else:\n f = False\n if len(l)>1:\n f = False\n if len(l)>0:\n f = False\n if f == True:\n print(\"Valid\")\n else:\n print(\"Invalid\")", "for _ in range(int(input())):\n n=int(input())\n s=list(input())\n if s.count('H')==s.count('T'):\n l=[]\n i=0\n while i<n:\n if s[i]!='.':\n l.append(s[i])\n i=i+1\n c=0\n for i in range(len(l)//2):\n if l[2*i]==\"H\" and l[(2*i)+1]==\"T\":\n c+=2\n if c==len(l):\n print(\"Valid\")\n else:\n print(\"Invalid\")\n else:\n print(\"Invalid\")"] | {"inputs": [["6", "18", "..H..T...HTH....T.", "3", "...", "10", "H..H..T..T", "2", "HT", "11", ".T...H..H.T", "7", "H..T..H"]], "outputs": [["Valid", "Valid", "Invalid", "Valid", "Invalid", "Invalid"]]} | INTERVIEW | PYTHON3 | CODECHEF | 9,073 | |
f7843030194b449584d77a0f41fe2f52 | UNKNOWN | Chef belongs to a very rich family which owns many gold mines. Today, he brought N gold coins and decided to form a triangle using these coins. Isn't it strange?
Chef has a unusual way of forming a triangle using gold coins, which is described as follows:
- He puts 1 coin in the 1st row.
- then puts 2 coins in the 2nd row.
- then puts 3 coins in the 3rd row.
- and so on as shown in the given figure.
Chef is interested in forming a triangle with maximum possible height using at most N coins. Can you tell him the maximum possible height of the triangle?
-----Input-----
The first line of input contains a single integer T denoting the number of test cases.
The first and the only line of each test case contains an integer N denoting the number of gold coins Chef has.
-----Output-----
For each test case, output a single line containing an integer corresponding to the maximum possible height of the triangle that Chef can get.
-----Constraints-----
- 1 ≤ T ≤ 100
- 1 ≤ N ≤ 109
-----Subtasks-----
- Subtask 1 (48 points) : 1 ≤ N ≤ 105
- Subtask 2 (52 points) : 1 ≤ N ≤ 109
-----Example-----
Input3
3
5
7
Output2
2
3
-----Explanation-----
- Test 1: Chef can't form a triangle with height > 2 as it requires atleast 6 gold coins.
- Test 2: Chef can't form a triangle with height > 2 as it requires atleast 6 gold coins.
- Test 3: Chef can't form a triangle with height > 3 as it requires atleast 10 gold coins. | ["t = eval(input())\n\ndef moneda(m):\n h = 1\n triange = []\n while m >= h:\n triange.append(h)\n m -= h \n h += 1\n return len(triange)\n\ntriangulo = []\nfor i in range(t):\n n = eval(input())\n triangulo.append(n)\n\nfor i in triangulo:\n print(moneda(i))\n", "t = eval(input())\n\ndef moneda(m):\n h = 1\n triange = []\n while m >= h:\n triange.append(h)\n m -= h \n h += 1\n return len(triange)\n\ntriangulo = []\nfor i in range(t):\n n = eval(input())\n triangulo.append(n)\n\nfor i in triangulo:\n print(moneda(i))\n", "t = eval(input())\n\ndef moneda(m):\n h = 1\n triange = []\n while m >= h:\n triange.append(h)\n m -= h \n h += 1\n return len(triange)\n\ntriangulo = []\nfor i in range(t):\n n = eval(input())\n triangulo.append(n)\n\nfor i in triangulo:\n print(moneda(i))\n", "for tests in range(eval(input())):\n N = eval(input())\n print(int((-1 + (1+8*N)**0.5)/2))", "MAX=10**9+100\na=[]\ni=1\nx=1\nwhile x<=MAX:\n x=(i*(i+1))/2\n a.append(x)\n i+=1\nl=len(a)\nt=int(input())\nwhile t!=0:\n n=int(input())\n i=0\n while n>=a[i] and i<l:\n i+=1\n print(i)\n t-=1", "from math import sqrt \nfor __ in range(eval(input())): print(int((-1 + sqrt(1 + 8*eval(input())))/2))\n", "r=int(input())\nL=[]\nfor i in range(r):\n x=int(input())\n L.append(x)\nfor i in range(r):\n print(int((((8*L[i]+1)**0.5)-1)/2))\n", "t = int(input())\nfor x in range(t):\n n = int(input())\n n *= 2\n a = int(n ** 0.5)\n if a*(a+1) <= n:\n print(a)\n else:\n print(a-1)\n", "'''input\n3\n3\n5\n7\n'''\n\n#~~~~~~~~~~~~~~~~~~~~dwij28 == Abhinav Jha~~~~~~~~~~~~~~~~~~~~#\n\nfrom sys import stdin, stdout\nfrom math import sqrt, floor, ceil, log\nfrom collections import defaultdict, Counter\n\ndef read(): return stdin.readline().rstrip()\ndef write(x): stdout.write(str(x))\ndef endl(): write(\"\\n\")\n\ndata, x = [1], 1\nwhile data[-1] <= 10**9:\n x += 1\n data.append(x*(x+1)/2)\n\nfor T in range(int(read())):\n n, c = int(read()), 0\n for i in data:\n if i <= n: c += 1\n else: break\n write(c)\n endl()", "# cook your code here\ntest = int(input())\na=0\nwhile(a<test):\n a = a+1\n n = int(input())\n sum = 0\n if n==1:\n print(\"1\")\n else: \n for i in range(1,n):\n sum = sum +i\n \n \n if(sum ==n):\n print(i)\n break\n elif(sum > n):\n print(i-1)\n break\n else:\n pass", "from math import sqrt\nitr = int(input())\nfor i in range(itr):\n n = int(input())\n j = int(sqrt(n*2))\n while (j>0):\n if (j*(j+1)/2)<=n:\n print(j)\n break\n j-=1\n", "__author__ = 'Deepak'\nt=eval(input())\nwhile(t>0):\n t-=1\n a=eval(input())\n k=0\n while(a-k>=0):\n a-=k\n k+=1\n print(k-1)", "a= eval(input())\nfor i in range(a):\n n = eval(input())\n count = 1\n element = 0\n flag = 0\n while n>=count:\n flag += 1\n n -= count\n\n element += count\n count += 1\n\n\n print(flag)", "# your code goes here\nimport bisect\ncomb=[0]*100001\ncomb[1]=1\nfor i in range(1,100001):\n comb[i]=comb[i-1]+i\nfor _ in range(eval(input())):\n n=eval(input())\n index=bisect.bisect_left(comb,n)\n if(comb[index]==n):\n print(index)\n else:\n print(index-1)", "itr = int(input())\nfor i in range(itr):\n n = int(input())\n j = int(n/2)+1\n while (j>0):\n if (j*(j+1)/2)<=n:\n print(j)\n break\n j-=1\n", "# cook your code here\nt=int(input())\nfor i in range(t):\n n=int(input())\n h=0\n while n>h:\n h=h+1\n n=n-h\n print(h)\n", "def findHeight():\n tests = int(input())\n for t in range(tests):\n n = int(input())\n sumd = 0\n res = 0\n for i in range(1, n+1):\n sumd+=i\n if sumd == n:\n res = i\n break\n elif sumd > n:\n res = i-1\n break\n print(res)\n\nfindHeight()\n\n\n", "a=[1]\ndef lub(n):\n for i in range(len(a)-1,-1,-1):\n if a[i]<=n:\n return str(i+1)\nfor tc in range(int(input())):\n n=int(input())\n if n<a[len(a)-1]:\n print(lub(n))\n else:\n while(True):\n l=len(a) + 1\n a.append(l*(l+1)/2)\n if a[l-1]>n:\n break\n print(lub(n))\n", "import math\nt=int(input())\nfor i in range(t):\n n=int(input())\n ans= (math.sqrt(8*n+1)+1)\n print(int(ans/2-1))\n", "i = 0\nl = []\nwhile i < 10**3:\n l.append(i*(i+1)/2)\n i = i+1\n\nt = int(input())\nfor _ in range(t):\n x= int(input())\n for i in range(1,len(l)):\n if x == l[i]:\n print(i)\n elif x < l[i] and x > l[i-1]:\n print(i-1)\n else:\n pass\n"] | {"inputs": [["3", "3", "5", "7"]], "outputs": [["2", "2", "3"]]} | INTERVIEW | PYTHON3 | CODECHEF | 4,318 | |
45cfdb1ad95a91b65232d92d63447c9c | UNKNOWN | -----Problem Statement-----
A classroom has several students, half of whom are boys and half of whom are girls. You need to arrange all of them in a line for the morning assembly such that the following conditions are satisfied:
- The students must be in order of non-decreasing height.
- Two boys or two girls must not be adjacent to each other.
You have been given the heights of the boys in the array $b$ and the heights of the girls in the array $g$. Find out whether you can arrange them in an order which satisfies the given conditions. Print "YES" if it is possible, or "NO" if it is not.
For example, let's say there are $n = 3$ boys and $n = 3$ girls, where the boys' heights are $b = [5, 3, 8]$ and the girls' heights are $g = [2, 4, 6]$. These students can be arranged in the order $[g_0, b_1, g_1, b_0, g_2, b_2]$, which is $[2, 3, 4, 5, 6, 8]$. Because this is in order of non-decreasing height, and no two boys or two girls are adjacent to each other, this satisfies the conditions. Therefore, the answer is "YES".
-----Input-----
- The first line contains an integer, $t$, denoting the number of test cases.
- The first line of each test case contains an integer, $n$, denoting the number of boys and girls in the classroom.
- The second line of each test case contains $n$ space separated integers, $b_1,b_2, ... b_n$, denoting the heights of the boys.
- The second line of each test case contains $n$ space separated integers, $g_1,g_2,... g_n$, denoting the heights of the girls.
-----Output-----
Print exactly $t$ lines. In the $i^{th}$ of them, print a single line containing "$YES$" without quotes if it is possible to arrange the students in the $i^{th}$ test case, or "$NO$" without quotes if it is not.
-----Constraints-----
- $1 \leq t \leq 10$
- $1 \leq n \leq 100$
- $1 \leq b_i, g_i \leq 100$
-----Sample Input-----
1
2
1 3
2 4
-----Sample Output-----
YES
-----EXPLANATION-----
The following arrangement would satisfy the given conditions: $[b_1, g_1, b_2, g_2]$. This is because the boys and girls and separated, and the height is in non-decreasing order. | ["for u in range(int(input())):\n n=int(input())\n l=list(map(int,input().split()))\n d=list(map(int,input().split()))\n ka=[]\n k=[]\n l.sort()\n d.sort()\n for i in range(n):\n ka.append(d[i])\n ka.append(l[i])\n for i in range(n):\n k.append(l[i])\n k.append(d[i])\n if(ka==sorted(ka)):\n print(\"YES\")\n elif(k==sorted(k)):\n print(\"YES\")\n else:\n print(\"NO\")\n", "for _ in range(int(input())):\r\n n = int(input())\r\n b = list(map(int, input().split()))\r\n g = list(map(int, input().split()))\r\n b.sort()\r\n g.sort()\r\n ans = []\r\n flag = 0\r\n val = 0\r\n st = 0\r\n if (b[0] < g[0]):\r\n f = 'b'\r\n ans.append(min(b[0], g[0]))\r\n ans.append(max(b[0], g[0]))\r\n st = 1\r\n elif g[0] > b[0]:\r\n f = 'g'\r\n st = 1\r\n ans.append(min(b[0], g[0]))\r\n ans.append(max(b[0], g[0]))\r\n else:\r\n for i in range(n):\r\n if (b[i] < g[i]):\r\n f = 'b'\r\n st = i\r\n break\r\n elif g[i] < b[i]:\r\n st = i\r\n f = 'g'\r\n break\r\n ans.append(b[i])\r\n ans.append(g[i])\r\n if (len(ans) == (2 * n)):\r\n val = 1\r\n if (n >= 2 and val != 1):\r\n for i in range(st, n):\r\n if (f == 'b'):\r\n ans.append(b[i])\r\n ans.append(g[i])\r\n else:\r\n ans.append(g[i])\r\n ans.append(b[i])\r\n\r\n for i in range(1, len(ans)):\r\n if (ans[i] < ans[i - 1]):\r\n flag = 1\r\n break\r\n if (flag):\r\n print('NO')\r\n else:\r\n print(\"YES\")\r\n\r\n\r\n", "# cook your dish here\nfor i in range(int(input())):\n n = int(input())\n b = [int(x) for x in input().split()]\n g = [int(x) for x in input().split()]\n boy = sorted(b)\n girl = sorted(g)\n f = 0\n for k in range(n-1):\n \n if girl[k] < boy[k]:\n if girl[k+1] < boy[k]:\n f = 1\n break\n \n \n elif girl[k] > boy[k]:\n \n if girl[k] > boy[k+1]:\n f = 1\n break\n if girl[0] < boy[0]:\n if girl[n-1] > boy[n-1]:\n f = 1\n elif boy[0] < girl[0]:\n if boy[n-1] > girl[n-1]:\n f = 1\n \n \n if f == 1:\n print(\"NO\")\n else:\n print(\"YES\")\n", "# cook your dish here\nfor i in range(int(input())):\n n=int(input())\n lst1=list(map(int,input().split()))\n lst2=list(map(int,input().split()))\n lst1.sort()\n lst2.sort()\n lst12=[]\n lst21=[]\n for i in range(n):\n lst12.append(lst1[i])\n lst12.append(lst2[i])\n lst21.append(lst2[i])\n lst21.append(lst1[i])\n #print(lst12)\n #print(lst21)\n lst3=lst1+lst2\n lst3.sort()\n if(lst12==lst3 or lst21==lst3):\n print(\"YES\")\n else:\n print(\"NO\")", "# cook your dish here\ndef check(x,y,n):\n k = 0\n for i in range(0,n-1):\n if(x[i] >= y[i] and x[i] <= y[i+1]):\n k += 1\n else: \n break\n if(k == n-1):\n if(x[-1] >= y[-1]):\n print(\"YES\")\n else:\n print(\"NO\")\n else:\n print(\"NO\")\n\nt = int(input())\nfor _ in range(t):\n n = int(input())\n b = list(map(int, input().split()))\n g = list(map(int, input().split()))\n b.sort()\n g.sort()\n z = 0\n if(g[0] < b[0]):\n check(b,g,n)\n elif(g[0] > b[0]):\n check(g,b,n)\n else:\n for i in range(n):\n if(b[i] > g[i]):\n check(b[i:], g[i:], n-i)\n break\n elif(b[i] < g[i]):\n check(g[i:], b[i:], n-i)\n break\n z += 1\n if(z == n):\n print(\"YES\")", "for _ in range(int(input())):\r\n n = int(input())\r\n b = sorted(list(map(int, input().split())))\r\n g = sorted(list(map(int, input().split())))\r\n b1,g1 = [],[]\r\n B,G = 0,0\r\n count = 0\r\n for i in range(n):\r\n b1.append(b[i])\r\n b1.append(g[i])\r\n g1.append(g[i])\r\n g1.append(b[i])\r\n for i in range((n*2)-1):\r\n if b1[i] <= b1[i+1]:\r\n B += 1\r\n if g1[i] <= g1[i+1]:\r\n G += 1\r\n if B == (n*2)-1 or G == (n*2)-1:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "import re\n\nfor _ in range(int(input())):\n n = int(input())\n b = list(map(int,input().split()))\n g = list(map(int,input().split()))\n a = sorted(b)\n b = sorted(g)\n i,j = 0,0\n x = \"\"\n cutt = 2\n\n while i<n and j<n:\n if a[i]<b[j]:\n x+=\"b\"\n i+=1\n elif a[i]==b[j]:\n if len(x)==0:\n x+=\"b\"\n cutt=1\n i+=1\n elif x[-1]==\"b\":\n x+=\"g\"\n j+=1\n else:\n x+=\"b\"\n i+=1\n\n else:\n x+=\"g\"\n j+=1\n\n while i<n:\n x+=\"b\"\n i+=1\n while j<n:\n x+=\"g\"\n j+=1\n\n\n w = re.findall(r\"[b]{2}\",x)\n t = re.findall(r\"[g]{2}\",x)\n\n if (w or t) and cutt ==1:\n i=0\n\n n=len(a)\n j=0\n x=\"\"\n\n while i<n and j<n:\n\n if a[i]<b[j]:\n x+=\"b\"\n i+=1\n elif a[i]==b[j]:\n if len(x)==0:\n x+=\"g\"\n\n j+=1\n elif x[-1]==\"b\":\n x+=\"g\"\n j+=1\n else:\n x+=\"b\"\n i+=1\n\n else:\n x+=\"g\"\n j+=1\n\n while i<n:\n x+=\"b\"\n i+=1\n while j<n:\n x+=\"g\"\n j+=1\n\n\n w = re.findall(r\"[b]{2}\",x)\n t = re.findall(r\"[g]{2}\",x)\n if w or t:\n print(\"NO\")\n else:\n print('YES')\n \n elif w or t:\n print(\"NO\")\n else:\n print(\"YES\")", "import sys \r\nimport math as mt\r\nimport bisect\r\ninput=sys.stdin.readline\r\nt=int(input())\r\n#t=1 \r\n \r\ndef solve(l3,l4):\r\n cnt=0\r\n l5=[]\r\n for i in range(n):\r\n l5.append(l3[i])\r\n l5.append(l4[i])\r\n \r\n for i in range(1,len(l5)):\r\n if l5[i]<l5[i-1]:\r\n cnt=1\r\n if cnt==0:\r\n return True\r\n \r\n return False \r\n \r\n \r\nfor _ in range(t):\r\n n=int(input())\r\n #n,k=map(int,input().split())\r\n #x,y,k=map(int,input().split())\r\n #n,h=(map(int,input().split()))\r\n l1=list(map(int,input().split()))\r\n l2=list(map(int,input().split()))\r\n l1.sort()\r\n l2.sort()\r\n if (solve(l1,l2) or solve(l2,l1)):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n \r\n", "def checkAccending(li):\n\tfor i in range(len(li)-1):\n\t\tif li[i]>li[i+1]:\n\t\t\treturn False\n\treturn True\nfor _ in range(int(input())):\n\tn = int(input())\n\tb = sorted(int(i) for i in input().split())\n\tg = sorted(int(i) for i in input().split())\n\t\n\tsb=[]\n\tsg=[]\n\t\n\tfor i in range(n):\n\t\tsb.append(b[i])\n\t\tsb.append(g[i])\n\t\t\n\t\tsg.append(g[i])\n\t\tsg.append(b[i])\n\t\n\tif checkAccending(sb) or checkAccending(sg):\n\t\tprint('YES')\n\telse:\n\t\tprint('NO')", "# cook your dish here\nT=int(input())\nfor _ in range(T):\n n=int(input())\n b=list(map(int,input().split()))\n g=list(map(int,input().split()))\n my_list=b+g\n my_list.sort()\n b1=b.copy()\n g1=g.copy()\n lim=2*n\n k1,k2=1,1\n for i in range(lim):\n if my_list[i] in b and i%2==0:\n b.remove(my_list[i])\n elif my_list[i] in g and i%2:\n g.remove(my_list[i])\n else:\n k1=0\n break\n for i in range(lim):\n if my_list[i] in g1 and i%2==0:\n g1.remove(my_list[i])\n elif my_list[i] in b1 and i%2:\n b1.remove(my_list[i])\n else:\n k2=0\n break\n if k1 or k2:\n print('YES')\n else:\n print('NO')", "def fun(j,n):\n\tnonlocal b\n\tnonlocal g\n\tactive=True\n\tif b[j]>g[j]:\n\t\tfor i in range(j,n):\n\t\t\tif g[i]>b[i] or (i>0 and b[i-1]>g[i]):\n\t\t\t\tactive=False\n\t\t\t\treturn False\n\telse:\n\t\tfor i in range(j,n):\n\t\t\tif g[i]<b[i] or (i>0 and g[i-1]>b[i]):\n\t\t\t\tactive=False\n\t\t\t\treturn False\n\treturn True\nls=[]\nt=int(input())\nfor z in range(t):\n\tn=int(input())\n\tb=list(map(int,input().rstrip().split()))\n\tg=list(map(int,input().rstrip().split()))\n\tb.sort()\n\tg.sort()\n\ti=0\n\tactive=True\n\twhile i<n and b[i]==g[i]:\n\t\ti+=1\n\tif i<n:\n\t\tactive=fun(i,n)\n\tif active==True:\n\t\tls.append(\"YES\")\n\telse:\n\t\tls.append(\"NO\")\n\nfor i in ls:\n\tprint(i)\n", "import re\n\nfor _ in range(int(input())):\n n = int(input())\n b = list(map(int,input().split()))\n g = list(map(int,input().split()))\n a = sorted(b)\n b = sorted(g)\n i,j = 0,0\n x = \"\"\n cutt = 2\n\n while i<n and j<n:\n if a[i]<b[j]:\n x+=\"b\"\n i+=1\n elif a[i]==b[j]:\n if len(x)==0:\n x+=\"b\"\n cutt=1\n i+=1\n elif x[-1]==\"b\":\n x+=\"g\"\n j+=1\n else:\n x+=\"b\"\n i+=1\n\n else:\n x+=\"g\"\n j+=1\n\n while i<n:\n x+=\"b\"\n i+=1\n while j<n:\n x+=\"g\"\n j+=1\n\n\n w = re.findall(r\"[b]{2}\",x)\n t = re.findall(r\"[g]{2}\",x)\n\n if (w or t) and cutt ==1:\n i=0\n\n n=len(a)\n j=0\n x=\"\"\n\n while i<n and j<n:\n\n if a[i]<b[j]:\n x+=\"b\"\n i+=1\n elif a[i]==b[j]:\n if len(x)==0:\n x+=\"g\"\n\n j+=1\n elif x[-1]==\"b\":\n x+=\"g\"\n j+=1\n else:\n x+=\"b\"\n i+=1\n\n else:\n x+=\"g\"\n j+=1\n\n while i<n:\n x+=\"b\"\n i+=1\n while j<n:\n x+=\"g\"\n j+=1\n\n\n w = re.findall(r\"[b]{2}\",x)\n t = re.findall(r\"[g]{2}\",x)\n if w or t:\n print(\"NO\")\n else:\n print('YES')\n \n elif w or t:\n print(\"NO\")\n else:\n print(\"YES\")", "# cook your dish here\nfor i in range(int(input())):\n n=int(input())\n lst1=list(map(int,input().split()))\n lst2=list(map(int,input().split()))\n lst1.sort()\n lst2.sort()\n lst12=[]\n lst21=[]\n for i in range(n):\n lst12.append(lst1[i])\n lst12.append(lst2[i])\n lst21.append(lst2[i])\n lst21.append(lst1[i])\n #print(lst12)\n #print(lst21)\n lst3=lst1+lst2\n lst3.sort()\n if(lst12==lst3 or lst21==lst3):\n print(\"YES\")\n else:\n print(\"NO\")", "\ntry:\n for _ in range(int(input())):\n n=int(input())\n b=list(map(int,input().split()))\n g=list(map(int,input().split()))\n b.sort()\n g.sort()\n i=0\n flag1,flag2=1,1\n new1=[]\n new2=[]\n while i<n:\n new1.append(b[i])\n new1.append(g[i])\n i+=1\n for i in range(1,len(new1)):\n if new1[i]<new1[i-1]:\n flag1=0\n break\n i=0\n while i<n:\n new2.append(g[i])\n new2.append(b[i])\n i+=1\n for i in range(1,len(new2)):\n if new2[i]<new2[i-1]:\n flag2=0\n break\n if flag1 or flag2:\n print(\"YES\")\n else:\n print(\"NO\")\nexcept:\n pass\n", "# cook your dish here\na = int(input())\nfor i in range(a):\n n = int(input())\n b = list(map(int,input().split()))\n g = list(map(int,input().split()))\n b.sort()\n g.sort()\n h1 =[]\n h2= []\n for i in range(n):\n h1.append(b[i])\n h1.append(g[i])\n for i in range(n):\n h2.append(g[i])\n h2.append(b[i])\n if h1 == sorted(h1) or h2 == sorted(h2):\n print(\"YES\")\n else:\n print(\"NO\")\n", "for _ in range(int(input())):\n\tN = int(input());barr = sorted(list(map(int , input().split())));garr = sorted(list(map(int , input().split())));tarr = barr + garr;ans1 = [0]*(N*2);ans2 = [0]*(N*2);tarr.sort();j = 0\n\tfor i in range(N): ans1[j] += garr[i];ans1[j + 1] += barr[i];ans2[j] += barr[i];ans2[j + 1] += garr[i];j += 2\n\tprint(\"YES\") if(ans1 == tarr or ans2 == tarr) else print(\"NO\")", "\ntry:\n for _ in range(int(input())):\n n=int(input())\n b=list(map(int,input().split()))\n g=list(map(int,input().split()))\n b.sort()\n g.sort()\n i=0\n flag1,flag2=1,1\n new1=[]\n new2=[]\n while i<n:\n new1.append(b[i])\n new1.append(g[i])\n i+=1\n for i in range(1,len(new1)):\n if new1[i]<new1[i-1]:\n flag1=0\n break\n i=0\n while i<n:\n new2.append(g[i])\n new2.append(b[i])\n i+=1\n for i in range(1,len(new2)):\n if new2[i]<new2[i-1]:\n flag2=0\n break\n if flag1 or flag2:\n print(\"YES\")\n else:\n print(\"NO\")\nexcept:\n pass\n", "try:\n for _ in range(int(input())):\n n=int(input())\n b=list(map(int,input().split()))\n g=list(map(int,input().split()))\n b.sort()\n g.sort()\n i=0\n flag1,flag2=1,1\n new1=[]\n new2=[]\n while i<n:\n new1.append(b[i])\n new1.append(g[i])\n i+=1\n for i in range(1,len(new1)):\n if new1[i]<new1[i-1]:\n flag1=0\n break\n i=0\n while i<n:\n new2.append(g[i])\n new2.append(b[i])\n i+=1\n for i in range(1,len(new2)):\n if new2[i]<new2[i-1]:\n flag2=0\n break\n if flag1 or flag2:\n print(\"YES\")\n else:\n print(\"NO\")\nexcept:\n pass", "# cook your dish here\na = int(input())\nfor i in range(a):\n n = int(input())\n b = list(map(int,input().split()))\n g = list(map(int,input().split()))\n b.sort()\n g.sort()\n h1 =[]\n h2= []\n for i in range(n):\n h1.append(b[i])\n h1.append(g[i])\n for i in range(n):\n h2.append(g[i])\n h2.append(b[i])\n if h1 == sorted(h1) or h2 == sorted(h2):\n print(\"YES\")\n else:\n print(\"NO\")\n", "try:\n for _ in range(int(input())):\n n=int(input())\n b=list(map(int,input().split()))\n g=list(map(int,input().split()))\n b.sort()\n g.sort()\n i=0\n flag1,flag2=1,1\n new1=[]\n new2=[]\n while i<n:\n new1.append(b[i])\n new1.append(g[i])\n i+=1\n for i in range(1,len(new1)):\n if new1[i]<new1[i-1]:\n flag1=0\n break\n i=0\n while i<n:\n new2.append(g[i])\n new2.append(b[i])\n i+=1\n for i in range(1,len(new2)):\n if new2[i]<new2[i-1]:\n flag2=0\n break\n if flag1 or flag2:\n print(\"YES\")\n else:\n print(\"NO\")\nexcept:\n pass", "def check(x,y,n):\n k = 0\n for i in range(0,n-1):\n if(x[i] >= y[i] and x[i] <= y[i+1]):\n k += 1\n else: \n break\n if(k == n-1):\n if(x[-1] >= y[-1]):\n print(\"YES\")\n else:\n print(\"NO\")\n else:\n print(\"NO\")\n\nt = int(input())\nfor _ in range(t):\n n = int(input())\n b = list(map(int, input().split()))\n g = list(map(int, input().split()))\n b.sort()\n g.sort()\n z = 0\n if(g[0] < b[0]):\n check(b,g,n)\n elif(g[0] > b[0]):\n check(g,b,n)\n else:\n for i in range(n):\n if(b[i] > g[i]):\n check(b[i:], g[i:], n-i)\n break\n elif(b[i] < g[i]):\n check(g[i:], b[i:], n-i)\n break\n z += 1\n if(z == n):\n print(\"YES\")", "t=int(input())\nwhile t:\n t=t-1\n n=int(input())\n b=list(map(int,input().split()))\n g=list(map(int,input().split()))\n a=[]\n b.sort()\n g.sort()\n for i in range(n):\n a.append(b[i])\n a.append(g[i])\n c=[]\n for i in range(n):\n c.append(g[i])\n c.append(b[i])\n f,f1=0,0\n for i in range(2*n-1):\n if(a[i]>a[i+1]):\n f=1\n break\n for i in range(2*n-1):\n if(c[i]>c[i+1]):\n f1=1\n break\n if(f==0 or f1==0):\n print(\"YES\")\n else:\n print(\"NO\")", "for _ in range(int(input())):\n\tN = int(input());barr = sorted(list(map(int , input().split())));garr = sorted(list(map(int , input().split())));tarr = barr + garr;ans1 = [0]*(N*2);ans2 = [0]*(N*2)\n\ttarr.sort();j = 0\n\tfor i in range(N):\n\t\tans1[j] += garr[i] \n\t\tans1[j + 1] += barr[i]\n\t\tans2[j] += barr[i]\n\t\tans2[j + 1] += garr[i]\n\t\tj += 2\n\tif(ans1 == tarr or ans2 == tarr): print(\"YES\")\n\telse: print(\"NO\")", "for _ in range(int(input())):\n n=int(input())\n br=list(map(int,input().split()))\n gr=list(map(int,input().split()))\n\n br.sort()\n gr.sort()\n flag1=0\n flag2=0\n\n for i in range(n-1):\n if br[i]<=gr[i] and gr[i]<=br[i+1]:\n cool=1\n else:\n flag1=1\n\n if i==n-2:\n if gr[n-1]<br[n-1]:\n flag1=1\n\n for i in range(n-1):\n if gr[i]<=br[i] and br[i]<=gr[i+1]:\n cool=1\n else:\n flag2=1\n\n if i==n-2:\n if br[n-1]<gr[n-1]:\n flag2=1\n \n if flag1==flag2==1:\n print('NO')\n else:\n print('YES')\n\n\n", "def f(a,b):\n if(len(b)==0):\n return True\n if(a[0]>b[0]):\n return False\n return f(b,a[1:])\nfor _ in range(int(input())):\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 if(f(a,b)==True or f(b,a)==True):\n print(\"YES\")\n else:\n print(\"NO\")\n \n \n"] | {"inputs": [["1", "2", "1 3", "2 4"]], "outputs": [["YES"]]} | INTERVIEW | PYTHON3 | CODECHEF | 19,250 | |
d62ddbf9d95942a32edb32f26f1d35e4 | UNKNOWN | Recently, Chef got obsessed with piano. He is a just a rookie in this stuff and can not move his fingers from one key to other fast enough. He discovered that the best way to train finger speed is to play scales.
There are different kinds of scales which are divided on the basis of their interval patterns. For instance, major scale is defined by pattern T-T-S-T-T-T-S, where ‘T’ stands for a whole tone whereas ‘S’ stands for a semitone. Two semitones make one tone. To understand how they are being played, please refer to the below image of piano’s octave – two consecutive keys differ by one semitone.
If we start playing from first key (note C), then we’ll play all white keys in a row (notes C-D-E-F-G-A-B-C – as you can see C and D differ for a tone as in pattern, and E and F differ for a semitone).
This pattern could be played some number of times (in cycle).
Each time Chef takes some type of a scale and plays using some number of octaves. Sometimes Chef can make up some scales, so please don’t blame him if you find some scale that does not exist in real world.
Formally, you have a set of 12 keys (i.e. one octave) and you have N such sets in a row. So in total, you have 12*N keys. You also have a pattern that consists of letters 'T' and 'S', where 'T' means move forward for two keys (from key x to key x + 2, and 'S' means move forward for one key (from key x to key x + 1).
Now, you can start playing from any of the 12*N keys. In one play, you can repeat the pattern as many times as you want, but you cannot go outside the keyboard.
Repeating pattern means that if, for example, you have pattern STTST, you can play STTST as well as STTSTSTTST, as well as STTSTSTTSTSTTST, as well as any number of repeating. For this pattern, if you choose to repeat it once, if you start at some key x, you'll press keys: x (letter 'S')-> x + 1 (letter 'T')-> x + 3 (letter 'T')-> x + 5 (letter 'S') -> x + 6 (letter 'T')-> x + 8. Also 1 ≤ x, x + 8 ≤ 12*N so as to avoid going off the keyboard.
You are asked to calculate number of different plays that can be performed. Two plays differ if and only if they start at different keys or patterns are repeated different number of times.
-----Input-----
The first line of the input contains an integer T denoting the number of test cases. The description of T test cases follows.
First line of each test case contains scale’s pattern – string s consisting of letters ‘T’ and ‘S’ only.
Second line contains one integer N – number of octaves he’ll be using.
-----Output-----
For each test case output a single number in a line corresponding to number of different scales he’ll play.
-----Constraints-----
- 1 ≤ T ≤ 105
- 1 ≤ |S| ≤ 100
- 1 ≤ n ≤ 7
-----Subtasks-----
Subtask 1: T < 10 4, N = 1
Subtask 2: No additional constraints.
-----Example-----
Input:
2
TTTT
1
TTSTTTS
3
Output:
4
36
-----Explanation-----
Example case 1. In the first case there is only one octave and Chef can play scale (not in cycle each time) starting with notes C, C#, D, D# - four together. | ["t =int(input())\r\nfor i in range(t):\r\n C=[ord(x)-ord('R') for x in list(input())]\r\n N=int(input())\r\n L=sum(C)\r\n r=1\r\n c=0\r\n while(r*L<N*12):\r\n c+=N*12-r*L\r\n r+=1\r\n print(c)\r\n\r\n\r\n\r\n\r\n\r\n\r\n"] | {"inputs": [["2 ", "TTTT", "1", "TTSTTTS", "3", "", ""]], "outputs": [["4", "36"]]} | INTERVIEW | PYTHON3 | CODECHEF | 258 | |
98ee87ca6512f58c9f696891633a651b | UNKNOWN | The Golomb sequence $G_1, G_2, \ldots$ is a non-decreasing integer sequence such that for each positive integer $n$, $G_n$ is the number of occurrences of $n$ in this sequence. The first few elements of $G$ are $[1, 2, 2, 3, 3, 4, 4, 4, 5, \ldots]$. Do you know the recurrence relation for the Golomb sequence? It is $G_1 = 1$ and $G_{n+1} = 1+G_{n+1-G_{G_n}}$ for each $n \ge 1$. A self-describing sequence, isn't it?
Mr. Strange wants to learn CP, so he asked Chef, who is one of the best competitive programmers in the world, to teach him. Chef decided to test his ability by giving him the following task.
Find the sum of squares of the $L$-th through $R$-th term of the Golomb sequence, i.e. $S = \sum_{i=L}^R G_i^2$. Since the sum can be quite large, compute it modulo $10^9+7$.
Can you help Mr. Strange carry out this task given to him by his teacher?
-----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 two space-separated integers $L$ and $R$.
-----Output-----
For each test case, print a single line containing one integer $S$ modulo $10^9+7$.
-----Constraints-----
- $1 \le T \le 10^5$
- $1 \le L \le R \le 10^{10}$
-----Subtasks-----
Subtask #1 (50 points):
- $T \le 10^2$
- $R \le 10^9$
Subtask #2 (50 points): original constraints
-----Example Input-----
3
1 5
2 4
100 100
-----Example Output-----
27
17
441
-----Explanation-----
Example case 1: $1^2 + 2^2 + 2^2 + 3^2 + 3^2 = 27$
Example case 2: $2^2 + 2^2 + 3^2 = 17$
Example case 3: $21^2 = 441$ | ["def find_upper_bound(arr,key):\n low,high = 0,len(arr)-1\n while low<=high:\n mid = (low+high)//2 \n if arr[mid]==key:return mid\n elif arr[mid]>key and mid-1>=0 and arr[mid-1]<key:return mid \n elif arr[mid]>key:high = mid - 1 \n else:low = mid + 1 \n return mid \ndef get_query(l):\n nonlocal prefix_storer,bin_storer\n ind = find_upper_bound(bin_storer,l)\n surplus = (abs(bin_storer[ind]-l)*ind*ind)%limit \n return (prefix_storer[ind]-surplus+limit)%limit\ndef fire_query(l,r):\n return (get_query(r)-get_query(l-1)+limit)%limit\ngolomb,dp,prefix_storer,bin_storer = [],[0,1],[0,1],[0,1]\nlimit = 10**9+7\nfor i in range(2,10**6+100):\n dp.append(1 + dp[i-dp[dp[i-1]]])\n bin_storer.append(dp[-1]+bin_storer[-1])\n prefix_storer.append(((prefix_storer[-1] + (dp[-1]*i*i)%limit))%limit)\n# print(dp[1:20])\n# print(bin_storer[1:20])\n# print(prefix_storer[1:20])\n# print(get_query(2),get_query(4))\nfor _ in range(int(input())):\n l,r = map(int,input().split())\n print(fire_query(l,r))", "def find_upper_bound(arr,key):\n low,high = 0,len(arr)-1\n while low<=high:\n mid = (low+high)//2 \n if arr[mid]==key:return mid\n elif arr[mid]>key and mid-1>=0 and arr[mid-1]<key:return mid \n elif arr[mid]>key:high = mid - 1 \n else:low = mid + 1 \n return mid \ndef get_query(l):\n nonlocal prefix_storer,bin_storer\n ind = find_upper_bound(bin_storer,l)\n surplus = (abs(bin_storer[ind]-l)*ind*ind)%limit \n return (prefix_storer[ind]-surplus+limit)%limit\ndef fire_query(l,r):\n return (get_query(r)-get_query(l-1))%limit\ngolomb,dp,prefix_storer,bin_storer = [],[0,1],[0,1],[0,1]\nlimit = 10**9+7\nfor i in range(2,10**6+100):\n dp.append(1 + dp[i-dp[dp[i-1]]])\n bin_storer.append(dp[-1]+bin_storer[-1])\n prefix_storer.append(((prefix_storer[-1] + (dp[-1]*i*i)%limit))%limit)\n# print(dp[1:20])\n# print(bin_storer[1:20])\n# print(prefix_storer[1:20])\n# print(get_query(2),get_query(4))\nfor _ in range(int(input())):\n l,r = map(int,input().split())\n print(fire_query(l,r))", "# cook your dish here\nimport bisect\nMAXR = 100\nMAXN = 20000000\nT = int(input().strip())\nqueries = []\nfor t in range(T):\n L, R = map(int, input().strip().split())\n queries.append((L,R))\n MAXR = max(MAXR, R+1)\nMOD = 10**9+7\ng = [0,1,2]\np = [0,1,3]\ns = [0,1,9]\nfor n in range(3, MAXN):\n gg = 1 + g[n-g[g[n-1]]]\n pp = p[n-1] + gg\n ss = (s[n-1] + gg*n*n) % MOD\n g.append(gg)\n p.append(pp)\n s.append(ss)\n if pp > MAXR:\n break\ndef process(m):\n n = bisect.bisect_right(p, m)\n return (s[n-1] + (m-p[n-1])*n*n) % MOD\nfor L, R in queries:\n print((process(R) - process(L-1))%MOD)", "import bisect\nM=1000000007\nG=[0,1,2,2]\ncurrPos=4\nfor i in range(3,2000000):\n if(currPos>2000000):\n break\n j=0 \n while(j<G[i] and currPos<2000000):\n G.append(i) \n currPos+=1 \n j+=1 \nprefixSum1=[0]\nprefixSum2=[0]\nfor i in range(1,2000000):\n prefixSum1.append(prefixSum1[i-1]+G[i])\nfor i in range(1,2000000):\n prefixSum2.append((prefixSum2[i-1] + i*i%M*G[i]%M)%M)\n #print(prefixSum1)\n #print(prefixSum2)\n\ndef solve(n):\n nthterm=bisect.bisect_left(prefixSum1, n, lo=0, hi=len(prefixSum1))-0\n ans=0 \n if(nthterm>0):\n ans=prefixSum2[nthterm-1]\n ans = (ans + nthterm*nthterm%M * (n-prefixSum1[nthterm-1])%M)%M\n return ans\nfor tc in range(int(input())):\n l,r=map(int,input().split())\n print((solve(r)-solve(l-1)+M)%M)", "import sys\nimport bisect as b\ninput=sys.stdin.readline\nli=[]\nmod=10**9 + 7\nmxr=100\nmxn=20000000\n\nfor _ in range(int(input())):\n l,r=map(int,input().split())\n li.append([l,r])\n mxr=max(mxr,r+1)\n\ng=[0,1,2]\np=[0,1,3]\ns=[0,1,9]\n\nfor i in range(3,mxn):\n gg=1+g[i-g[g[i-1]]]\n pp=(p[i-1]+gg)%mod\n ss=(s[i-1]+gg*i*i)%mod\n g.append(gg)\n p.append(pp)\n s.append(ss)\n if pp>mxr:\n break\ndef solve(m):\n n=b.bisect_right(p,m)\n return (s[n-1] + ((m-p[n-1])*n*n))%mod\nfor l,r in li:\n ans=(solve(r)-solve(l-1))%mod\n print(ans)", "# cook your dish here\nimport bisect as bi\n\ntemp_g = [0, 1, 2]\ntemp_s = [0, 1, 9]\ntemp_p = [0, 1, 3]\nmax_mod = (10 ** 9 + 7)\n\ndef find_gn(n):\n return (1 + temp_g[n - temp_g[temp_g[n - 1]]])\n\ndef find_sn(n, gn):\n return (temp_s[n - 1] + gn * n**2) % max_mod\n\ndef find_pn(n, gn):\n return (temp_p[n - 1] + gn)\n \ndef bisection(x):\n n = bi.bisect_right(temp_p, x)\n return (temp_s[n - 1] + (x - temp_p[n - 1]) * n**2 ) % max_mod\n \nlr, max_ = [], 100\n\nfor _ in range(int(input())):\n l, r = list(map(int, input().split()))\n lr.append((l, r))\n max_ = max(max_, r + 1)\n \nfor n in range(3, 2 * (10 ** 8), 1):\n gn = find_gn(n)\n sn, pn = find_sn(n, gn), find_pn(n, gn)\n temp_g.append(gn)\n temp_p.append(pn)\n temp_s.append(sn)\n if (pn > max_):\n break\n \nfor pair in lr:\n print(bisection(pair[1]) - bisection(pair[0] - 1) % max_mod)\n\n\n", "# cook your dish here\nimport bisect as bi\n\ntemp_g = [0, 1, 2]\ntemp_s = [0, 1, 9]\ntemp_p = [0, 1, 3]\nmax_mod = (10 ** 9 + 7)\n\ndef find_gn(n):\n return (1 + temp_g[n - temp_g[temp_g[n - 1]]])\n\ndef find_sn(n, gn):\n return (temp_s[n - 1] + gn * n * n) % max_mod\n\ndef find_pn(n, gn):\n return (temp_p[n - 1] + gn)\n \ndef bisection(x):\n n = bi.bisect_right(temp_p, x)\n return (temp_s[n - 1] + (x - temp_p[n - 1]) * n * n ) % max_mod\n \nlr, max_ = [], 100\n\nfor _ in range(int(input())):\n l, r = list(map(int, input().split()))\n lr.append((l, r))\n max_ = max(max_, r + 1)\n \nfor n in range(3, 2 * (10 ** 8), 1):\n gn = find_gn(n)\n sn, pn = find_sn(n, gn), find_pn(n, gn)\n temp_g.append(gn)\n temp_p.append(pn)\n temp_s.append(sn)\n if (pn > max_):\n break\n \nfor pair in lr:\n print(bisection(pair[1]) - bisection(pair[0] - 1) % max_mod)\n\n\n", "# cook your dish here\nimport bisect as bi\n\ntemp_g = [0, 1, 2]\ntemp_s = [0, 1, 9]\ntemp_p = [0, 1, 3]\nmax_mod = (10 ** 9 + 7)\n\ndef find_gn(n):\n return (1 + temp_g[n - temp_g[temp_g[n - 1]]])\n\ndef find_sn(n, gn):\n return (temp_s[n - 1] + gn * n * n) % max_mod\n\ndef find_pn(n, gn):\n return (temp_p[n - 1] + gn)\n \ndef bisection(x):\n n = bi.bisect_right(temp_p, x)\n return (temp_s[n - 1] + (x - temp_p[n - 1]) * n * n ) % max_mod\n \nlr, max_ = [], 100\n\nfor _ in range(int(input())):\n l, r = list(map(int, input().split()))\n lr.append((l, r))\n max_ = max(max_, r + 1)\n \nfor n in range(3, 2 * (10 ** 8), 1):\n gn = find_gn(n)\n sn = find_sn(n, gn)\n pn = find_pn(n, gn)\n temp_g.append(gn)\n temp_p.append(pn)\n temp_s.append(sn)\n if (pn > max_):\n break\n \nfor pair in lr:\n print(bisection(pair[1]) - bisection(pair[0] - 1) % max_mod)\n\n\n", "# cook your dish here\nimport bisect\n\nMAXR = 100\nMAXN = 20000000\n\nT = int(input().strip())\nqueries = []\nfor t in range(T):\n L, R = list(map(int, input().strip().split()))\n queries.append((L,R))\n MAXR = max(MAXR, R+1)\n \n \nMOD = 10**9+7\ng = [0,1,2]\np = [0,1,3]\ns = [0,1,9]\n\nfor n in range(3, MAXN):\n gg = 1 + g[n-g[g[n-1]]]\n pp = p[n-1] + gg\n ss = (s[n-1] + gg*n*n) % MOD\n g.append(gg)\n p.append(pp)\n s.append(ss)\n if pp > MAXR:\n break\n \ndef process(m):\n n = bisect.bisect_right(p, m)\n return (s[n-1] + (m-p[n-1])*n*n) % MOD\n \n \nfor L, R in queries:\n print((process(R) - process(L-1))%MOD)\n", "'''\nName : Jaymeet Mehta\ncodechef id :mj_13\nProblem : \n'''\nfrom sys import stdin,stdout\nimport math\nfrom bisect import bisect_left\nmod=1000000007\ndef mul(a,b):\n nonlocal mod\n return ((a%mod)*(b%mod))%mod\ndef add(a,b):\n nonlocal mod\n return ((a%mod)+(b%mod))%mod\ng=[0,1]\npre=[0,1]\nans=[0,1]\ni=2\nwhile(True):\n g.append(1+g[i-g[g[i-1]]])\n pre.append(pre[i-1]+g[i])\n ans.append(add(ans[i-1],mul(mul(i,i),g[i])))\n if pre[i]>10000000000:\n break\n i+=1\ntest=int(stdin.readline())\nfor _ in range(test):\n l,r= list(map(int,stdin.readline().split()))\n sm1,sm2=0,0\n \n if l==1:\n sm1=0\n else:\n l-=1\n tl=bisect_left(pre,l)\n sm1=add(ans[tl-1],mul(l-pre[tl-1],mul(tl,tl)))\n tr=bisect_left(pre,r)\n sm2=add(ans[tr-1],mul(r-pre[tr-1],mul(tr,tr)))\n print((sm2-sm1)%mod)\n", "import bisect\nimport sys\ninput = sys.stdin.readline\n\nMAXR = 100\nMAXN = 20000000\n\nt = int(input().strip())\nqueries = []\nfor t in range(t):\n L, R = map(int, input().strip().split())\n queries.append((L,R))\n MAXR = max(MAXR, R + 1)\n \n \nMOD = 10 ** 9 + 7\ng = [0, 1, 2]\np = [0, 1, 3]\ns = [0, 1, 9]\n\nfor n in range(3, MAXN):\n gn = 1 + g[n - g[g[n - 1]]]\n pn = p[n - 1] + gn\n sn = (s[n - 1] + gn * n * n) % MOD\n g.append(gn)\n p.append(pn)\n s.append(sn)\n if pn > MAXR:\n break\n \ndef process(m):\n n = bisect.bisect_right(p, m)\n return (s[n - 1] + (m -p[n - 1]) * n * n) % MOD\n \n \nfor L, R in queries:\n print(process(R) - process(L - 1) % MOD)"] | {"inputs": [["3", "1 5", "2 4", "100 100"]], "outputs": [["27", "17", "441"]]} | INTERVIEW | PYTHON3 | CODECHEF | 8,581 | |
69bf4a364d98fc85371a76c2177cd12b | UNKNOWN | k kids seem to have visited your home for the festival. It seems like the kids
had all been fighting with each other, so you decided to keep them as far as
possible from each other. You had placed n chairs on the positive number line,
each at position x i , 1 ≤ i ≤ n. You can make the kids sit in any of the chairs.
Now you want to know the largest possible minimum distance between each kid.
-----Input:-----
- First line will contain $T$, number of testcases. Then the testcases follow.
- Each testcase contains two lines. First line contains two space separated integers n and k. Second line contains n space separated values, x1, x2, x3, … ,xn.
-----Output:-----
For each test case print the largest possible minimum distance.
-----Sample Input:-----
1
2 2
1 2
-----Sample Output:-----
1
-----Constraints-----
- $2 \leq n \leq 100000$
- $0 \leq xi \leq 10^9$
- $k \leq n $ | ["#dt = {} for i in x: dt[i] = dt.get(i,0)+1\r\nimport sys;input = sys.stdin.readline\r\ninp,ip = lambda :int(input()),lambda :[int(w) for w in input().split()]\r\n\r\ndef check(mid):\r\n pos = x[0]\r\n ct = 1\r\n for i in range(1,n):\r\n if x[i]-pos >= mid:\r\n pos = x[i]\r\n ct += 1\r\n if ct == k:\r\n return True\r\n return False\r\n\r\nfor _ in range(inp()):\r\n n,k = ip()\r\n x = ip()\r\n x.sort()\r\n ans = -1\r\n l,r = 1,x[-1]\r\n while l < r:\r\n mid = (l+r)//2\r\n if check(mid):\r\n ans = max(ans,mid)\r\n l = mid +1\r\n else:\r\n r = mid\r\n print(ans)\r\n \r\n \r\n \r\n \r\n"] | {"inputs": [["1", "2 2", "1 2"]], "outputs": [["1", "Constraints", "2 \u2264 n \u2264 100000", "0 \u2264 xi \u2264 10 9", "k \u2264 n"]]} | INTERVIEW | PYTHON3 | CODECHEF | 762 | |
3278178bc3d2b5ef4742a7f1626789ec | UNKNOWN | Salmon runs a fish delivery company in Fish City. Fish City has $N$ vertical roads numbered $1, 2, ..., N$ from left to right, each spaced 1 unit apart; similarly, there are $M$ horizontal roads numbered $1, 2, ..., M$ from bottom to top, each spaced 1 unit apart. We will denote the intersection between the $x$-th vertical road and the $y$-th horizontal road as $(x, y)$.
Salmon has to make $K$ deliveries, with the $i$-th delivery starting at $(x_i, y_i)$ and ending at $(x'_i, y'_i)$. He can also travel every road with speed $0.5$ (meaning it would take him $2$ units of time to travel $1$ unit of distance). However, Salmon can bribe the mayor of Fish City and make the mayor change exactly one horizontal road to a highway, meaning the speed on that road would increase to $1$.
He wants to choose a road to be a highway such that the sum of durations of all the deliveries is minimum possible. Help him find this minimum sum!
Note that each delivery starts exactly at $(x_i, y_i)$ and ends at $(x'_i, y'_i)$, i.e., we don't count the time taken to travel from $(x'_{i-1}, y'_{i-1})$ to $(x_i, y_i)$ in our answer.
-----Input:-----
The first line contains 3 integers, $N$, $M$ and $K$ ($1 \le N, M, K \le 10^5$).
The next $K$ lines describe deliveries. Each line contains 4 space-separated integers $x_i$, $y_i$, $x'_i$, $y'_i$ ($1 \le x_i, x'_i \le N$, $1 \le y_i, y'_i \le M$), describing the $i$-th delivery.
-----Output:-----
Print one integer -- the minimum sum of durations possible.
-----Subtasks-----
- Subtask 1 [17 points]: $y_i = y_{i-1}$ for all $i>0$.
- Subtask 2 [34 points]: $K \le 10$.
- Subtask 3 [49 points]: No additional constraints.
-----Sample Input 1:-----
5 4 3
2 3 4 1
1 4 5 2
3 3 5 3
-----Sample Output 1:-----
16
-----Explanation:-----
Salmon can turn the 3rd horizontal road into a highway.
- For the first delivery, we can go 2 units to the right taking 2 units of time, and 2 units down taking 4 units of time. The time taken is $2 + 4 = 6$.
- For the second delivery, we can go 1 unit down taking 2 units of time, 4 units right taking 4 units of time, and 1 unit down taking 2 units of time. The time taken is $2 + 4 + 2 = 8$.
- For the third delivery, we can go 2 units right taking 2 units of time.
Therefore, the total time taken is $6 + 8 + 2 = 16$.
-----Sample Input 2:-----
10 2 3
1 2 10 2
2 1 9 1
4 1 7 1
-----Sample Output 2:-----
23
-----Explanation:-----
Salmon can turn the 1st horizontal road into a highway.
- For the first delivery, we can go 1 unit down taking 2 units of time, 9 units right taking 9 units of time, and 1 unit up taking 2 units of time. The time taken is $2 + 9 + 2 = 13$.
- For the second delivery, we can go 7 units right taking 7 units of time.
- For the third delivery, we can go 3 units to the right taking 3 units of time.
Therefore, the total time taken is $13 + 7 + 3 = 23$. | ["n,m,k=map(int, input().split())\na = []\ncheck = [0]*m\nwhile k!= 0:\n x1,y1,x2,y2 =map(int,input().split())\n a.append([x1,y1,x2,y2])\n check[y1-1] += 1\n check[y2-1] += 1\n k-= 1\nmaxi = check.index(max(check))+1\nsum = 0\nk = 0\nfor i in range(len(a)):\n x1,y1,x2,y2 = a[i]\n if (y1 > maxi and y2 > maxi) or (y1<maxi and y2 < maxi):\n sum+= abs(y2-y1)*2\n sum += abs(x2-x1)*2\n else:\n if y1 != maxi:\n k = abs(y1-maxi)\n sum+= k*2\n if x1 != x2:\n k = abs(x2-x1)\n sum += k\n if y2 != maxi:\n k = abs(y2-maxi)\n sum+= k*2\nprint(sum)", "n,m,k=map(int, input().split())\na = []\ncheck = [0]*m\nwhile k!= 0:\n x1,y1,x2,y2 =map(int,input().split())\n a.append([x1,y1,x2,y2])\n check[y1-1] += 1\n #check[y2-1] += 1\n k-= 1\nmaxi = check.index(max(check))+1\nsum = 0\nk = 0\nfor i in range(len(a)):\n x1,y1,x2,y2 = a[i]\n if y1 != maxi:\n k = abs(y1-maxi)\n sum+= k*2\n if x1 != x2:\n k = abs(x2-x1)\n sum += k\n if y2 != maxi:\n k = abs(y2-maxi)\n sum+= k*2\nprint(sum)", "n,m,k=map(int, input().split())\na = []\ncheck = [0]*m\nwhile k!= 0:\n x1,y1,x2,y2 =map(int,input().split())\n a.append([x1,y1,x2,y2])\n check[y1-1] += 1\n check[y2-1] += 1\n k-= 1\nmaxi = check.index(max(check))+1\nsum = 0\nk = 0\nfor i in range(len(a)):\n x1,y1,x2,y2 = a[i]\n if y1 != maxi:\n k = abs(y1-maxi)\n sum+= k*2\n if x1 != x2:\n k = abs(x2-x1)\n sum += k\n if y2 != maxi:\n k = abs(y2-maxi)\n sum+= k*2\nprint(sum)", "n,m,k=map(int, input().split())\na = []\ncheck = [0]*m\nwhile k!= 0:\n x1,y1,x2,y2 =map(int,input().split())\n a.append([x1,y1,x2,y2])\n check[y1-1] += 1\n k-= 1\nmaxi = check.index(max(check))+1\nsum = 0\nk = 0\nfor i in range(len(a)):\n x1,y1,x2,y2 = a[i]\n if y1 != maxi:\n k = abs(y1-maxi)\n sum+= k*2\n if x1 != x2:\n k = abs(x2-x1)\n sum += k\n if y2 != maxi:\n k = abs(y2-maxi)\n sum+= k*2\nprint(sum)", "# cook your dish here\nN,M,K=list(map(int,input().split()))\nl1=[]\nd={}\nfor i in range(K):\n l=list(map(int,input().split()))\n l1.append(l)\n if l[1] in d:\n d[l[1]]=d[l[1]]+l.count(l[1])\n elif l[3] in d:\n d[l[3]]=d[l[3]]+l.count(l[1])\n else:\n d[l[1]]=l.count(l[1])\n d[l[3]]=l.count(l[3])\nk=max(d, key=d.get)\ns=0\nfor i in range(K):\n s=s+2*(abs(l1[i][1]-k))+2*(abs(l1[i][3]-k))+(abs(l1[i][0]-l1[i][2]))\nprint(s)\n \n", "# cook your dish here\nimport collections\nn,m,k=list(map(int,input().split()))\nl = [[int(j) for j in input().split()] for i in range(k)]\n\np=[]\nfor i in range(k):\n p.append(l[i][1])\n\nf={}\n\nfor i in range(len(p)):\n if p[i] in f:\n f[p[i]]+=1\n else:\n f[p[i]]=1\n\nkey=0\nmax=0\nfor i in list(f.keys()):\n if f[i]>max:\n max=f[i]\n key=i\n\nmin=0\nfor i in range(k):\n min=min+(abs(l[i][1]-key)*2)+(abs(l[i][0]-l[i][2]))+(abs(l[i][3]-key)*2)\n \nprint(min)\n \n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n \n \n \n \n \n", "# cook your dish here\nimport sys\nimport statistics \nfrom statistics import mode\nreadline = sys.stdin.readline\ntry:\n \n INF = 10**18+3\n N, M, K = map(int, readline().split())\n Points = [tuple(map(int, readline().split())) for _ in range(K)]\n ABC = [(p[1], p[3], abs(p[0] - p[2])) for p in Points]\n ans = INF\n l=[]\n if K <= 10:\n ans = INF\n for m in range(1, M+1):\n res = 0\n for a, b, c in ABC:\n res += min(2*abs(a-m) + 2*abs(b-m) + c, 2*abs(a-b) + 2*c)\n ans = min(ans, res)\n print(ans)\n else:\n def horiz():\n ans=0\n \n for a,c,x in ABC:\n max1=0\n lv=1\n dist=[0]*M\n yo=min(a,c)\n y1=max(a,c)\n if (yo-x//4)>1:\n lv=yo-x//4\n up=M\n if (x//4+y1)<up:\n up=x//4+y1\n for j in range(lv,up+1):\n if j < yo:\n dist[j]+=x-4*(yo-j)\n elif j>=yo and j<=y1:\n dist[j]+=x\n else:\n dist[j]+=x-4*(j-y1)\n if dist[j]>dist[max1]:\n max1=j\n return dist[max1]\n \n\n m = horiz()\n res = 0\n for a, b, c in ABC:\n res += (2*abs(a-b) +2*c)\n print(res-m)\nexcept:\n pass", "try:\n a,b,c=list(map(int,input().split()))\n r=0\n for _ in range(c):\n w,x,y,z=list(map(int,input().split()))\n r+=abs(w-y)\n r+=2*abs(x-z)\n print(r)\nexcept:\n pass\n", "import sys\nimport statistics \nfrom statistics import mode\nreadline = sys.stdin.readline\ntry:\n \n INF = 10**18+3\n N, M, K = map(int, readline().split())\n Points = [tuple(map(int, readline().split())) for _ in range(K)]\n ABC = [(p[1], p[3], abs(p[0] - p[2])) for p in Points]\n ans = INF\n l=[]\n ans = INF\n for m in range(1, M+1):\n res = 0\n for a, b, c in ABC:\n res += min(2*abs(a-m) + 2*abs(b-m) + c, 2*abs(a-b) + 2*c)\n ans = min(ans, res)\n print(ans)\n\nexcept:\n pass", "import sys\nimport statistics \nfrom statistics import mode\nreadline = sys.stdin.readline\ntry:\n \n INF = 10**18+3\n N, M, K = map(int, readline().split())\n Points = [tuple(map(int, readline().split())) for _ in range(K)]\n ABC = [(p[1], p[3], abs(p[0] - p[2])) for p in Points]\n ans = INF\n l=[]\n if K <= 10:\n ans = INF\n for m in range(1, M+1):\n res = 0\n for a, b, c in ABC:\n res += min(2*abs(a-m) + 2*abs(b-m) + c, 2*abs(a-b) + 2*c)\n ans = min(ans, res)\n print(ans)\n else:\n def horiz():\n ans=0\n \n for a,c,x in ABC:\n max1=0\n lv=1\n dist=[0]*M\n yo=min(a,c)\n y1=max(a,c)\n if (yo-x//4)>1:\n lv=yo-x//4\n up=M\n if (x//4+y1)<up:\n up=x//4+y1\n for j in range(lv,up+1):\n if j < yo:\n dist[j]+=x-4*(yo-j)\n elif j>=yo and j<=y1:\n dist[j]+=x\n else:\n dist[j]+=x-4*(j-y1)\n if dist[j]>dist[max1]:\n max1=j\n return dist[max1]\n \n\n m = horiz()\n res = 0\n for a, b, c in ABC:\n res += (2*abs(a-b) +2*c)\n print(res-m)\nexcept:\n pass", "import sys\nimport statistics \nfrom statistics import mode\nreadline = sys.stdin.readline\ntry:\n \n INF = 10**18+3\n N, M, K = map(int, readline().split())\n Points = [tuple(map(int, readline().split())) for _ in range(K)]\n ABC = [(p[1], p[3], abs(p[0] - p[2])) for p in Points]\n ans = INF\n l=[]\n if K <= 10:\n ans = INF\n for m in range(1, M+1):\n res = 0\n for a, b, c in ABC:\n res += min(2*abs(a-m) + 2*abs(b-m) + c, 2*abs(a-b) + 2*c)\n ans = min(ans, res)\n print(ans)\n else:\n def horiz():\n ans=0\n \n for yo,y1,x in ABC:\n max1=0\n lv=1\n dist=[0]*M\n if (yo-x//4)>1:\n lv=yo-x//4\n up=M\n if (x//4+y1)<up:\n up=x//4+y1\n for j in range(lv,up+1):\n if j < yo:\n dist[j]+=x-4*(yo-j)\n elif j>=yo and j<=y1:\n dist[j]+=x\n else:\n dist[j]+=x-4*(j-y1)\n if dist[j]>dist[max1]:\n max1=j\n return dist[max1]\n \n\n m = horiz()\n res = 0\n for a, b, c in ABC:\n res += (2*abs(a-b) +2*c)\n print(res-m)\nexcept:\n pass", "import sys\nimport statistics \nfrom statistics import mode\nreadline = sys.stdin.readline\ntry:\n \n INF = 10**18+3\n N, M, K = map(int, readline().split())\n Points = [tuple(map(int, readline().split())) for _ in range(K)]\n ABC = [(p[1], p[3], abs(p[0] - p[2])) for p in Points]\n ans = INF\n l=[]\n if K <= 10:\n ans = INF\n for m in range(1, M+1):\n res = 0\n for a, b, c in ABC:\n res += min(2*abs(a-m) + 2*abs(b-m) + c, 2*abs(a-b) + 2*c)\n ans = min(ans, res)\n print(ans)\n else:\n def horiz():\n ans=0\n \n for yo,y1,x in ABC:\n max1=0\n lv=1\n dist=[0]*M\n if (yo-x//4)>1:\n lv=yo-x//4\n up=M\n if (x//4+y1)<up:\n up=x//4+y1\n for j in range(lv,up+1):\n if j < yo:\n dist[j]+=x-4*(yo-j)\n elif j>=yo and j<=y1:\n dist[j]+=x\n else:\n dist[j]+=x-4*(j-y1)\n if dist[j]>dist[max1]:\n max1=j\n return dist[max1]\n \n\n m = horiz()\n res = 0\n for a, b, c in ABC:\n res += (2*abs(a-b) +2*c)\n print(res-m)\nexcept:\n pass", "import sys\nimport statistics \nfrom statistics import mode\nreadline = sys.stdin.readline\ntry:\n \n INF = 10**18+3\n N, M, K = map(int, readline().split())\n Points = [tuple(map(int, readline().split())) for _ in range(K)]\n ABC = [(p[1], p[3], abs(p[0] - p[2])) for p in Points]\n ans = INF\n l=[]\n if K <= 10:\n ans = INF\n for m in range(1, M+1):\n res = 0\n for a, b, c in ABC:\n res += min(2*abs(a-m) + 2*abs(b-m) + c, 2*abs(a-b) + 2*c)\n ans = min(ans, res)\n print(ans)\n else:\n def horiz():\n ans=0\n \n for yo,y1,x in ABC:\n max1=0\n lv=1\n dist=[0]*M\n if (yo-x//4)>1:\n lv=yo-x//4\n up=M\n if (x//4+y1)<up:\n up=x//4+y1\n for j in range(lv,up+1):\n if j < yo:\n dist[j]+=x-4*(yo-j)\n elif j>=yo and j<=y1:\n dist[j]+=x\n else:\n dist[j]+=x-4*(j-y1)\n if dist[j]>dist[max1]:\n max1=j\n return dist[max1]\n \n\n m = horiz()\n res = 0\n for a, b, c in ABC:\n res += (2*abs(a-b) +2*c)\n print(ans-m)\nexcept:\n pass", "import sys\nimport statistics \nfrom statistics import mode\nreadline = sys.stdin.readline\ntry:\n \n INF = 10**18+3\n N, M, K = map(int, readline().split())\n Points = [tuple(map(int, readline().split())) for _ in range(K)]\n ABC = [(p[1], p[3], abs(p[0] - p[2])) for p in Points]\n ans = INF\n l=[]\n if K <= 10:\n ans = INF\n for m in range(1, M+1):\n res = 0\n for a, b, c in ABC:\n res += min(2*abs(a-m) + 2*abs(b-m) + c, 2*abs(a-b) + 2*c)\n ans = min(ans, res)\n print(ans)\n else:\n def horiz():\n ans=0\n \n for yo,y1,x in ABC:\n max1=0\n lv=1\n dist=[0]*M\n if (yo-x//4)>1:\n lv=yo-x//4\n up=M\n if (x//4+y1)<up:\n up=x//4+y1\n for j in range(lv,up+1):\n if j < yo:\n dist[j]+=x-4*(yo-j)\n elif j>=yo and j<=y1:\n dist[j]+=x\n else:\n dist[j]+=x-4*(j-y1)\n if dist[j]>dist[max1]:\n max1=j\n return max1\n \n \n \n m = horiz()\n res = 0\n for a, b, c in ABC:\n res += min(2*abs(a-m) + 2*abs(b-m) + c, 2*abs(a-b) + 2*c)\n ans = min(ans, res)\n print(ans)\nexcept:\n pass", "import sys\nimport statistics \nfrom statistics import mode\nreadline = sys.stdin.readline\ntry:\n \n INF = 10**18+3\n N, M, K = map(int, readline().split())\n Points = [tuple(map(int, readline().split())) for _ in range(K)]\n ABC = [(p[1], p[3], abs(p[0] - p[2])) for p in Points]\n ans = INF\n l=[]\n if K <= 10:\n ans = INF\n for m in range(1, M+1):\n res = 0\n for a, b, c in ABC:\n res += min(2*abs(a-m) + 2*abs(b-m) + c, 2*abs(a-b) + 2*c)\n ans = min(ans, res)\n print(ans)\n else:\n def horiz():\n ans=0\n \n for yo,y1,x in ABC:\n max1=0\n lv=1\n dist=[0]*M\n if (yo-x//4)>1:\n lv=yo-x//4\n up=M\n if (x//4+y1)<up:\n up=x//4+y1\n for j in range(lv,up+1):\n if j < yo:\n dist[j]+=x-4*(yo-j)\n elif j>=yo and j<=y1:\n dist[j]+=x\n else:\n dist[j]+=x-4*(j-y1)\n if dist[j]>dist[max1]:\n max1=j\n return max1\n \n \n \n m = horiz()\n res = 0\n for a, b, c in ABC:\n res += min(2*abs(a-m) + 2*abs(b-m) + c, 2*abs(a-b) + 2*c)\n ans = min(ans, res)\n print(ans)\nexcept:\n pass", "import sys\nimport statistics \nfrom statistics import mode\nreadline = sys.stdin.readline\ntry:\n \n INF = 10**18+3\n N, M, K = map(int, readline().split())\n Points = [tuple(map(int, readline().split())) for _ in range(K)]\n ABC = [(p[1], p[3], abs(p[0] - p[2])) for p in Points]\n ans = INF\n l=[]\n if K <= 10:\n ans = INF\n for m in range(1, M+1):\n res = 0\n for a, b, c in ABC:\n res += min(2*abs(a-m) + 2*abs(b-m) + c, 2*abs(a-b) + 2*c)\n ans = min(ans, res)\n print(ans)\n else:\n def horiz():\n ans=0\n \n for yo,y1,x in ABC:\n lv=1\n dist=[0]*M\n if (yo-x//4)>1:\n lv=yo-x//4\n up=M\n if (x//4+y1)<up:\n up=x//4+y1\n for j in range(lv,up+1):\n if j < yo:\n dist[j]+=x-4*(yo-j)\n elif j>=yo and j<=y1:\n dist[j]+=x\n else:\n dist[j]+=x-4*(j-y1)\n if dist[j]>dist[max1]:\n max1=j\n return max1\n \n \n \n m = horiz()\n res = 0\n for a, b, c in ABC:\n res += min(2*abs(a-m) + 2*abs(b-m) + c, 2*abs(a-b) + 2*c)\n ans = min(ans, res)\n print(ans)\nexcept:\n pass", "import sys\nimport statistics \nfrom statistics import mode\nreadline = sys.stdin.readline\nINF = 10**18+3\nN, M, K = map(int, readline().split())\nPoints = [tuple(map(int, readline().split())) for _ in range(K)]\nABC = [(p[1], p[3], abs(p[0] - p[2])) for p in Points]\nans = INF\nl=[]\nif K <= 10:\n ans = INF\n for m in range(1, M+1):\n res = 0\n for a, b, c in ABC:\n res += min(2*abs(a-m) + 2*abs(b-m) + c, 2*abs(a-b) + 2*c)\n ans = min(ans, res)\n print(ans)\nelse:\n def horiz():\n ans=0\n\n for yo,y1,x in ABC:\n lv=1\n dist=[0]*M\n if (yo-x//4)>1:\n lv=yo-x//4\n up=M\n if (x//4+y1)<up:\n up=x//4+y1\n for j in range(lv,up+1):\n if j < yo:\n dist[j]+=x-4*(yo-j)\n elif j>=yo and j<=y1:\n dist[j]+=x\n else:\n dist[j]+=x-4*(j-y1)\n if dist[j]>dist[max1]:\n max1=j\n return max1\n\n\n \n m = horiz()\n res = 0\n for a, b, c in ABC:\n res += min(2*abs(a-m) + 2*abs(b-m) + c, 2*abs(a-b) + 2*c)\n ans = min(ans, res)\n print(ans)", "import sys\ntry:\n n,m,k=list(map(int,sys.stdin.readline().split()))\n xo,yo,x1,y1=[0]*k,[0]*k,[0]*k,[0]*k\n dist=[0]*(m+1)\n max1=0\n for i in range(0,k):\n h1,u1,h2,u2=list(map(int,sys.stdin.readline().split()))\n xo[i]=min(h1,h2)\n x1[i]=max(h1,h2)\n yo[i]=min(u1,u2)\n y1[i]=max(u1,u2)\n lv=1\n x=x1[i]-xo[i]\n if (yo[i]-x//4)>1:\n lv=yo[i]-x//4\n up=m\n if (x//4+y1[i])<up:\n up=x//4+y1[i]\n for j in range(lv,up+1):\n if j < yo[i]:\n dist[j]+=x-4*(yo[i]-j)\n elif j>=yo[i] and j<=y1[i]:\n dist[j]+=x\n else:\n dist[j]+=x-4*(j-y1[i])\n if dist[j]>dist[max1]:\n max1=j\n cost=0\n for i in range(k):\n cost+=2*((x1[i]-xo[i])+(y1[i]-yo[i]))\n print(cost-dist[max1])\n\nexcept:\n pass\n\n\n\n\n\n\n", "try:\n n,m,k=list(map(int,input().split()))\n xo,yo,x1,y1=[0]*k,[0]*k,[0]*k,[0]*k\n dist=[0]*(m+1)\n max1=0\n cost=0\n for i in range(0,k):\n h1,u1,h2,u2=list(map(int,input().split()))\n xo[i]=min(h1,h2)\n x1[i]=max(h1,h2)\n yo[i]=min(u1,u2)\n y1[i]=max(u1,u2)\n if (min(yo)==max(yo)) or (min(y1)==max(y1)):\n print(sum(x1)-sum(xo)+2*(sum(yo)-sum(y1)))\n else:\n cost=0\n for i in range(k):\n cost+=2*((x1[i]-xo[i])+(y1[i]-yo[i]))\n lv=1\n x=x1[i]-xo[i]\n if (yo[i]-x//4)>1:\n lv=yo[i]-x//4\n up=m\n if (x//4+y1[i])<up:\n up=x//4+y1[i]\n for j in range(lv,up+1):\n if j < yo[i]:\n dist[j]+=x-4*(yo[i]-j)\n elif j>=yo[i] and j<=y1[i]:\n dist[j]+=x\n else:\n dist[j]+=x-4*(j-y1[i])\n if dist[j]>dist[max1]:\n max1=j\n print(cost-dist[max1])\n\nexcept:\n pass\n\n\n\n\n\n\n", "try:\n n,m,k=list(map(int,input().split()))\n dist=[0]*(m+1)\n max1=0\n cost=0\n for i in range(0,k):\n h1,u1,h2,u2=list(map(int,input().split()))\n xo=min(h1,h2)\n x1=max(h1,h2)\n yo=min(u1,u2)\n y1=max(u1,u2)\n cost+=2*((x1-xo)+(y1-yo))\n lv=1\n x=x1-xo\n if (yo-x//4)>1:\n lv=yo-x//4\n up=m\n if (x//4+y1)<up:\n up=x//4+y1\n for j in range(lv,up+1):\n if j < yo:\n dist[j]+=x-4*(yo-j)\n elif j>=yo and j<=y1:\n dist[j]+=x\n else:\n dist[j]+=x-4*(j-y1)\n if dist[j]>dist[max1]:\n max1=j\n print(cost-dist[max1])\n\nexcept:\n pass\n\n\n\n\n\n\n", "try:\n n,m,k=list(map(int,input().split()))\n xo,yo,x1,y1=[0]*k,[0]*k,[0]*k,[0]*k\n dist=[0]*(m+1)\n max1=0\n for i in range(0,k):\n h1,u1,h2,u2=list(map(int,input().split()))\n xo[i]=min(h1,h2)\n x1[i]=max(h1,h2)\n yo[i]=min(u1,u2)\n y1[i]=max(u1,u2)\n lv=1\n x=x1[i]-xo[i]\n if (yo[i]-x//4)>1:\n lv=yo[i]-x//4\n up=m\n if (x//4+y1[i])<up:\n up=x//4+y1[i]\n for j in range(lv,up+1):\n if j < yo[i]:\n dist[j]+=x-4*(yo[i]-j)\n elif j>=yo[i] and j<=y1[i]:\n dist[j]+=x\n else:\n dist[j]+=x-4*(j-y1[i])\n if dist[j]>dist[max1]:\n max1=j\n cost=0\n for i in range(k):\n cost+=2*((x1[i]-xo[i])+(y1[i]-yo[i]))\n print(cost-dist[max1])\n\nexcept:\n pass\n\n\n\n\n\n\n", "import sys\nimport statistics \nfrom statistics import mode\nreadline = sys.stdin.readline\nINF = 10**18+3\nN, M, K = map(int, readline().split())\nPoints = [tuple(map(int, readline().split())) for _ in range(K)]\nABC = [(p[1], p[3], abs(p[0] - p[2])) for p in Points]\nans = INF\nl=[]\nif K <= 10:\n ans = INF\n for m in range(1, M+1):\n res = 0\n for a, b, c in ABC:\n res += min(2*abs(a-m) + 2*abs(b-m) + c, 2*abs(a-b) + 2*c)\n ans = min(ans, res)\n print(ans)\nelse:\n def horiz():\n for x,y,z in ABC:\n l.append(x)\n l.append(y)\n return mode(l)\n m = horiz()\n res = 0\n for a, b, c in ABC:\n res += min(2*abs(a-m) + 2*abs(b-m) + c, 2*abs(a-b) + 2*c)\n ans = min(ans, res)\n print(ans)", "import sys\nimport statistics \nfrom statistics import mode\nreadline = sys.stdin.readline\nINF = 10**18+3\nN, M, K = map(int, readline().split())\nPoints = [tuple(map(int, readline().split())) for _ in range(K)]\nABC = [(p[1], p[3], abs(p[0] - p[2])) for p in Points]\nans = INF\nl=[]\ndef horiz():\n for x,y,z in ABC:\n l.append(x)\n l.append(y)\n return mode(l)\nm = horiz()\nres = 0\nfor a, b, c in ABC:\n res += min(2*abs(a-m) + 2*abs(b-m) + c, 2*abs(a-b) + 2*c)\nans = min(ans, res)\nprint(ans)", "import sys\nreadline = sys.stdin.readline\nINF = 10**18+3\nN, M, K = map(int, readline().split())\nPoints = [tuple(map(int, readline().split())) for _ in range(K)]\nABC = [(p[1], p[3], abs(p[0] - p[2])) for p in Points]\nif K <= 10:\n ans = INF\n for m in range(1, M+1):\n res = 0\n for a, b, c in ABC:\n res += min(2*abs(a-m) + 2*abs(b-m) + c, 2*abs(a-b) + 2*c)\n ans = min(ans, res)\n print(ans)"] | {"inputs": [["5 4 3", "2 3 4 1", "1 4 5 2", "3 3 5 3"]], "outputs": [["16"]]} | INTERVIEW | PYTHON3 | CODECHEF | 17,525 | |
3a683ebbec8353139958e9f1a4a08b48 | UNKNOWN | There is a building with $N$ floors (numbered $1$ through $N$ from bottom to top); on each floor, there are $M$ windows (numbered $1$ through $M$ from left to right). Let's denote the $j$-th window on the $i$-th floor by $(i, j)$.
All windows in the building need to be cleaned one by one in a specific order. You are given this order as a matrix $A$ with $N$ rows and $M$ columns; for each valid $i$ and $j$, the window $(i, j)$ must be cleaned on the $A_{N-i+1,j}$-th turn.
Whenever we clean a window $(i, j)$, it becomes clean, but the dirty water used for cleaning it flows down to windows $(i-1, j-1)$, $(i-1, j)$ and $(i-1, j+1)$ (more precisely, to all of these windows which exist), so these windows become dirty again. Then, the water flows further down, so the same applies for other windows below: whenever a window $(i, j)$ becomes dirty, windows $(i-1, j-1)$, $(i-1, j)$ and $(i-1, j+1)$ become dirty as well. For example, cleaning a window $(5, 3)$ will make the window $(3, 2)$ dirty. The next window is cleaned only after water flows down completely. Note that each window is cleaned only once and there may be dirty windows at the end.
For each window, determine whether it will be clean after the cleaning process ends.
-----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$.
- $N$ lines follow. For each $i$ ($1 \le i \le N$), the $i$-th of these lines contains $M$ space-separated integers $A_{i, 1}, A_{i, 2}, \ldots, A_{i, M}$.
-----Output-----
For each test case, print $N$ lines; each of them should contain a string with length $M$. For each valid $i$ and $j$, the $j$-th character on the $i$-th line should be '1' if the window $(N-i+1, j)$ is clean or '0' if it is dirty.
-----Constraints-----
- $1 \le T \le 1,000$
- $1 \le N, M \le 10^3$
- $1 \le A_{i, j} \le N \cdot M$ for each valid $i, j$
- the elements of the matrix $A$ are pairwise distinct
- the sum of $N \cdot M$ over all test cases does not exceed $10^6$
-----Subtasks-----
Subtask #1 (50 points):
- $N, M \le 25$
- the sum of $N \cdot M$ over all test cases does not exceed $625$
Subtask #2 (50 points): original constraints
-----Example Input-----
1
3 4
1 3 7 10
9 2 4 11
8 12 5 6
-----Example Output-----
1111
1001
0100 | ["try:\r\n t = int(input())\r\n while(t > 0):\r\n t -= 1\r\n n,m = list(map(int,input().split()))\r\n a = [list(map(int,input().split())) for _ in range(n)]\r\n dp = [[0 for _ in range(m)] for _ in range(n)]\r\n ans = [['0' for _ in range(m)] for _ in range(n)]\r\n for i in range(n):\r\n for j in range(m):\r\n if i-1 < n:\r\n if 0 <= j-1 and j+1 < m:\r\n dp[i][j] = max(dp[i-1][j-1],dp[i-1][j],dp[i-1][j+1])\r\n elif j == 0:\r\n dp[i][j] = max(dp[i-1][j],dp[i-1][j+1])\r\n elif j == m-1:\r\n dp[i][j] = max(dp[i-1][j-1],dp[i-1][j])\r\n \r\n if dp[i][j] > a[i][j]:\r\n ans[i][j] = '0'\r\n else:\r\n ans[i][j] = '1'\r\n dp[i][j] = a[i][j]\r\n \r\n for i in ans:\r\n print(''.join(i))\r\nexcept:\r\n pass", "try:\r\n t = int(input())\r\n while(t > 0):\r\n t -= 1\r\n n,m = list(map(int,input().split()))\r\n a = [list(map(int,input().split())) for _ in range(n)]\r\n dp = [[0 for _ in range(m)] for _ in range(n)]\r\n ans = [['0' for _ in range(m)] for _ in range(n)]\r\n for i in range(n):\r\n for j in range(m):\r\n if i-1 < n:\r\n if 0 <= j-1 and j+1 < m:\r\n dp[i][j] = max(dp[i-1][j-1],dp[i-1][j],dp[i-1][j+1])\r\n elif j == 0:\r\n dp[i][j] = max(dp[i-1][j],dp[i-1][j+1])\r\n elif j == m-1:\r\n dp[i][j] = max(dp[i-1][j-1],dp[i-1][j])\r\n \r\n if dp[i][j] > a[i][j]:\r\n ans[i][j] = '0'\r\n else:\r\n ans[i][j] = '1'\r\n dp[i][j] = a[i][j]\r\n \r\n for i in ans:\r\n print(''.join(i))\r\nexcept:\r\n pass", "# cook your dish here\nfor _ in range(int(input())):\n N,M=list(map(int,input().split()))\n matrix=[]\n for i in range(N):\n l=list(map(int,input().split()))\n matrix.append(l)\n for i in range(1,N):\n for j in range(M):\n if(j==0):\n if(max(matrix[i-1][j],matrix[i-1][j+1])>matrix[i][j]):\n matrix[i][j]=max(matrix[i-1][j],matrix[i-1][j+1])\n elif(j==M-1):\n if(max(matrix[i-1][j],matrix[i-1][j-1])>matrix[i][j]):\n matrix[i][j]=max(matrix[i-1][j],matrix[i-1][j-1])\n else:\n if(max(matrix[i-1][j-1],matrix[i-1][j],matrix[i-1][j+1])>matrix[i][j]):\n matrix[i][j]=max(matrix[i-1][j-1],matrix[i-1][j],matrix[i-1][j+1])\n # print(matrix)\n ans=[[1]*M for i in range(N)]\n for i in range(1,N):\n for j in range(M):\n if(j==0):\n if(max(matrix[i-1][j],matrix[i-1][j+1])>=matrix[i][j]):\n ans[i][j]=0\n elif(j==M-1):\n if(max(matrix[i-1][j],matrix[i-1][j-1])>=matrix[i][j]):\n ans[i][j]=0\n else:\n if(max(matrix[i-1][j-1],matrix[i-1][j],matrix[i-1][j+1])>=matrix[i][j]):\n ans[i][j]=0\n for i in range(N):\n for j in range(M):\n print(ans[i][j],end=\"\")\n print()\n ", "# cook your dish here\nfrom sys import stdin,stdout\nimport sys\nfrom bisect import bisect_left,bisect_right\n\n# stdin = open(\"input.txt\", \"r\");\n# stdout = open(\"output.txt\", \"w\");\n\nt= int(stdin.readline().strip())\n\nfor _ in range(t):\n\tn,m=stdin.readline().strip().split(' ')\n\tn,m=int(n),int(m)\n\tarr=[]\n\tfor i in range(n):\n\t\tarr.append(list(map(int,stdin.readline().strip().split(' '))))\n\tctr=0\n\tvisited=[[False for i in range(m)] for j in range(n)]\n\tsol=[[1 for i in range(m)] for j in range(n)]\n\tpq=[]\n\tfor i in range(n):\n\t\tfor j in range(m):\n\t\t\tpq.append((arr[i][j],i,j))\n\tpq=sorted(pq,key=lambda e:(e[0]),reverse=True)\n\t# print(pq)\n\tfor i in pq:\n\t\tcv,yo,xo=i\n\t\tif visited[yo][xo]:\n\t\t\tcontinue\n\t\telse:\n\t\t\tstack=[xo,yo]\n\t\t\twhile len(stack):\n\t\t\t\ty=stack.pop(-1)\n\t\t\t\tx=stack.pop(-1)\n\t\t\t\tvisited[y][x]=True\n\t\t\t\tctr+=1\n\t\t\t\tsol[y][x]=0\n\t\t\t\tif x-1>=0 and x-1<m and y+1>=0 and y+1<n:\n\t\t\t\t\tif not visited[y+1][x-1]:\n\t\t\t\t\t\tstack.append(x-1)\n\t\t\t\t\t\tstack.append(y+1)\n\t\t\t\tif x>=0 and x<m and y+1>=0 and y+1<n:\n\t\t\t\t\tif not visited[y+1][x]:\n\t\t\t\t\t\tstack.append(x)\n\t\t\t\t\t\tstack.append(y+1)\n\t\t\t\tif x+1>=0 and x+1<m and y+1>=0 and y+1<n:\n\t\t\t\t\tif not visited[y+1][x+1]:\n\t\t\t\t\t\tstack.append(x+1)\n\t\t\t\t\t\tstack.append(y+1)\n\t\t\tsol[yo][xo]=1\n\n\tfor i in sol:\n\t\tfor j in i:\n\t\t\tstdout.write(str(j))\n\t\tstdout.write(\"\\n\")", "for _ in range(int(input())):\r\n\tn,m = map(int,input().split())\r\n\tprint('1'*m)\r\n\tprev = tuple(map(int,input().split()))\r\n\tfor i in range(1,n):\r\n\t\ts = ''\r\n\t\tnow = tuple(map(int,input().split()))\r\n\t\tprev_ = []\r\n\t\tfor j in range(m):\r\n\t\t\ttemp = prev[j]\r\n\t\t\tif j+1<m and prev[j+1]>temp:\r\n\t\t\t\ttemp = prev[j+1]\r\n\t\t\tif j>0 and prev[j-1]>temp:\r\n\t\t\t\ttemp = prev[j-1]\r\n\t\t\tif temp<now[j]:\r\n\t\t\t\ts += '1'\r\n\t\t\t\ttemp = now[j]\r\n\t\t\telse:\r\n\t\t\t\ts += '0'\r\n\t\t\tprev_.append(temp)\r\n\t\tprev = prev_\r\n\t\tprint(s)\r\n", "import numpy as np\r\nfor _ in range(int(input())):\r\n\tn,m = map(int,input().split())\r\n\torder = np.zeros((n*m,2),dtype=np.uint8)\r\n\tstate = np.ones((n,m),dtype=np.uint8)*2\r\n\tfor i in range(n):\r\n\t\tj = 0\r\n\t\tfor e in map(int,input().split()):\r\n\t\t\torder[e-1] = i,j\r\n\t\t\tj+=1\r\n\r\n\tfor i0 in range(n*m-1,-1,-1):\r\n\t\ti,j = order[i0]\r\n\t\t# print(i,j)\r\n\t\tif state[i,j]==2:#same as init or not changed till now\r\n\t\t\t# print(i,j)\r\n\t\t\tj_start = j_end = j\r\n\t\t\tstate[i,j]=1#clean at the end\r\n\t\t\twhile i<n-1:\r\n\t\t\t\ti+=1\r\n\t\t\t\tj_start = max(0,j_start-1)\r\n\t\t\t\tj_end = min(m,j_end+1)\r\n\t\t\t\tstate[i,j_start:j_end+1] &= 1# if will be cleaned later not affected\r\n\t\t\t\t#if init or dirty marked as dirty set to 0\r\n\t\t\t\t# print(i,j_start,j_end)\r\n\t# print(order)\r\n\tfor i in range(n):\r\n\t\tprint(''.join(map(str,state[i])))", "for _ in range(int(input())):\r\n N, M = list(map(int, input().split()))\r\n A = []\r\n B = [['1' for x in range(M)] for x in range(N)]\r\n C = [['1' for x in range(M)] for x in range(N)]\r\n\r\n for __ in range(N):\r\n A.append(list(map(int, input().split())))\r\n\r\n B[0] = A[0].copy()\r\n\r\n for i in range(1, N):\r\n p = i - 1\r\n for j in range(0, M):\r\n B[i][j] = A[p][j]\r\n B[i][j] = max(B[i][j], A[i][j])\r\n\r\n if j >= 1:\r\n B[i][j] = max(B[i][j], B[p][j - 1])\r\n\r\n if j <= M - 2:\r\n B[i][j] = max(B[i][j], B[p][j + 1])\r\n\r\n C[0] = [1] * M\r\n for i in range(1, N):\r\n for j in range(0, M):\r\n if B[i][j] > A[i][j]:\r\n C[i][j] = 0\r\n\r\n for i in range(0, N):\r\n for j in range(0, M):\r\n print(C[i][j], end='')\r\n print()\r\n", "for _ in range(int(input())):\r\n N, M = list(map(int, input().split()))\r\n A = []\r\n B = [['0' for x in range(M)] for x in range(N)]\r\n for __ in range(N):\r\n A.append(input().split())\r\n\r\n D = {}\r\n for i in range(N):\r\n for j in range(M):\r\n D[int(A[i][j])] = (i, j)\r\n\r\n for k in range(1, N * M + 1):\r\n i, j = D[k]\r\n B[i][j] = '1'\r\n for p in range(i + 1, N):\r\n diff = p - i\r\n for q in range(j - diff, j + diff + 1):\r\n if q >= 0 and q < M:\r\n B[p][q] = '0'\r\n\r\n for i in B:\r\n for j in i:\r\n print(j, end='')\r\n print()\r\n", "def arr_str(arr):\r\n\tstrr=\"\"\r\n\tfor i in arr:\r\n\t\tstrr+=str(i)\r\n\treturn(strr)\r\nfor _ in range(int(input())):\r\n\tn,m=map(int,input().split())\r\n\tA=[0]*n\r\n\tfor i in range(n):\r\n\t\ttemp=[0]\r\n\t\tB=[int(i) for i in input().split()]\r\n\t\ttemp.extend(B)\r\n\t\ttemp.append(0)\r\n\t\tA[i]=temp\r\n\r\n\t# print(A)\r\n\tans=[[0 for i in range(m)] for j in range(n)]\r\n\tdp=[[0 for i in range(m+2)] for j in range(n)]\r\n\tfor i in range(m):\r\n\t\tdp[0][i+1]=A[0][i+1]\r\n\tfor i in range(1,n):\r\n\t\tfor j in range(1,m+1):\r\n\t\t\ttemp=max(dp[i-1][j-1],dp[i-1][j],dp[i-1][j+1])\r\n\t\t\t# print(temp)\r\n\t\t\tif(temp>A[i][j]):\r\n\t\t\t\tans[i-1][j-1]=0\r\n\t\t\telse:\r\n\t\t\t\tans[i-1][j-1]=1\r\n\t\t\ttemp=max(temp,A[i][j])\r\n\t\t\tdp[i][j]=temp\r\n\ttem=[1]*m\r\n\t\r\n\tprint(arr_str(tem),end=\"\\n\")\r\n\tfor i in range(n-1):\r\n\t\tprint(arr_str(ans[i]),end=\"\\n\")\r\n\r\n\t", "t=int(input())\nfor i in range(0,t):\n n,m = map(int, input().split())\n arr = []\n ans = []\n for i in range (0,n):\n in_arr = list(map(int , input().split()))\n if i == 0:\n \n x= '1'*m\n else :\n x = \"\"\n for j in range ( 0, m):\n arr2 = [0]*m\n if j==0 :\n maxv = max(ans[i-1][0],ans[i-1][1])\n \n elif j== m-1 :\n maxv = max(ans[i-1][m-2],ans[i-1][m-1])\n \n else :\n maxv = max(ans[i-1][j-1] , ans[i-1][j] , ans[i-1][j+1])\n if (maxv > in_arr[j]):\n in_arr[j] = maxv \n x=x+'0'\n else:\n x=x+'1'\n ans.append(in_arr)\n arr.append(x)\n for i in range (0,n):\n print(arr[i])\n \n \n \n\n", "t=int(input())\nfor _ in range(t):\n n,m=map(int,input().split())\n l=[]\n for i in range(n):\n l.append(list(map(int,input().split())))\n k=[]\n for i in range(n):\n for j in range(m):\n k.append([l[i][j],i,j])\n k.sort()\n s=[]\n for i in range(n):\n s.append([0]*m)\n for i in k:\n x=i[1]\n y=i[2]\n s[x][y]=1\n c=1\n #print(x,y)\n for j in range(x+1,n):\n s[j][y]=0\n for b in range(y-1,max(y-c-1,-1),-1):\n s[j][b]=0\n for b in range(y+1,min(m,y+c+1)):\n s[j][b]=0\n c+=1\n \n for i in s:\n print(\"\".join(map(str,i)))\n \n \n", "T = int(input())\r\nwhile(T>0):\r\n N,M = [int(x) for x in input().split()]\r\n arr = [[int(x) for x in input().split()] for y in range(N)]\r\n ans = [['1' for x in range(M)] for y in range(N)]\r\n for i in range(1,N):\r\n for j in range(M):\r\n m = max(arr[i][j],arr[i-1][j])\r\n if(j-1>=0):\r\n m = max(m,arr[i-1][j-1])\r\n if(j+1<M):\r\n m = max(m,arr[i-1][j+1])\r\n if(arr[i][j]!=m):\r\n ans[i][j]='0'\r\n arr[i][j]=m\r\n for i in range(N):\r\n print(''.join(ans[i]))\r\n T-=1", "#code\r\n#code\r\nt=int(input())\r\nfor i in range(t):\r\n #n,k=list(map(int,input().split()))\r\n arr=[]\r\n n,m=map(int,input().split())\r\n z=['1' for i in range(m)]\r\n arr.append(list(map(int,input().split())))\r\n print(\"\".join(z))\r\n for i in range(1,n):\r\n x=''\r\n arr.append(list(map(int,input().split())))\r\n if arr[i][0]>arr[i-1][0] and arr[i][0]>arr[i-1][1]:\r\n x+='1'\r\n else:\r\n x+='0'\r\n arr[i][0]=max(arr[i-1][0],arr[i][0],arr[i-1][1])\r\n for j in range(1,m-1):\r\n if arr[i][j]>arr[i-1][j] and arr[i][j]>arr[i-1][j+1] and arr[i][j]>arr[i-1][j-1]:\r\n x+='1'\r\n else:\r\n x+='0'\r\n arr[i][j]=max(arr[i-1][j],arr[i][j],arr[i-1][j+1],arr[i-1][j-1])\r\n if arr[i][m-1]>arr[i-1][m-1] and arr[i][m-1]>arr[i-1][m-2]:\r\n x+='1'\r\n else:\r\n x+='0'\r\n arr[i][m-1]=max(arr[i-1][m-2],arr[i][m-1],arr[i-1][m-1])\r\n print(x)\r\n ", "from sys import stdin \nt=int(stdin.readline())\nwhile t:\n n,m=map(int,stdin.readline().split())\n a=[]\n k=[[1 for _ in range(m)]for __ in range(n)]\n for _ in range(n):\n a.append(list(map(int,stdin.readline().split())))\n dp=[[a[i][_] for _ in range(m)]for i in range(n)]\n for i in range(1,n):\n for j in range(m):\n if j==m-1:\n dp[i][j]=max(0,max(dp[i-1][j-1],dp[i-1][j]))\n elif j==0:\n dp[i][j]=max(0,max(dp[i-1][j],dp[i-1][j+1]))\n \n else:\n dp[i][j]=max(0,max(dp[i-1][j-1],dp[i-1][j],dp[i-1][j+1]))\n \n if dp[i][j]>a[i][j]:\n k[i][j]=0\n else:\n k[i][j]=1\n dp[i][j]=a[i][j]\n \n for i in range(n):\n for j in range(m):\n print(k[i][j],end='')\n print()\n \n \n t-=1\n\n \n \n", "R = lambda : map(int, input().split())\r\n\r\nt, = R()\r\nfor _ in range(t):\r\n n, m = R()\r\n b = [0] * m \r\n for _ in range(n):\r\n a = list(R())\r\n b = list(map(max, a, [0] + b, b, b[1:] + [0]))\r\n print(''.join('10'[x < y] for x, y in zip(a, b)))\r\n", "R = lambda : map(int, input().split())\r\n\r\nt, = R()\r\nfor _ in range(t):\r\n n, m = R()\r\n b = (0,) * m \r\n for _ in range(n):\r\n a = *R(),\r\n b = *map(max, a, (0,) + b, b, b[1:] + (0,)),\r\n print(''.join('10'[x < y] for x, y in zip(a, b)))\r\n", "R = lambda : map(int, input().split())\r\n\r\nt, = R()\r\nfor _ in range(t):\r\n n, m = R()\r\n b = (0,) * m \r\n for _ in range(n):\r\n a = tuple(R())\r\n b = *map(max, a, (0,) + b, b, b[1:] + (0,)),\r\n print(''.join('10'[x < y] for x, y in zip(a, b)))\r\n", "R = lambda : map(int, input().split())\r\n\r\nt, = R()\r\nfor _ in range(t):\r\n n, m = R()\r\n b = (0,) * m \r\n for _ in range(n):\r\n a = *R(),\r\n b = *map(max, a, (0,) + b, b, b[1:] + (0,)),\r\n print(''.join('10'[x < y] for x, y in zip(a, b)))\r\n", "R = lambda : map(int, input().split())\r\n\r\nt, = R()\r\nfor _ in range(t):\r\n n, m = R()\r\n b = [0] * m \r\n for _ in range(n):\r\n a = *R(),\r\n b = *map(max, a, (0, *b), b, (*b[1:], 0)),\r\n print(''.join('10'[x < y] for x, y in zip(a, b)))\r\n", "R = lambda : map(int, input().split())\r\n\r\nt, = R()\r\nfor _ in range(t):\r\n n, m = R()\r\n b = [0] * m \r\n for _ in range(n):\r\n a = list(R())\r\n b = list(map(max, a, [0] + b, b, b[1:] + [0]))\r\n print(''.join('10'[x < y] for x, y in zip(a, b)))\r\n", "t = int(input())\r\nfor i in range(t):\r\n\tn, m = map(int, input().split())\r\n\tarr = []\r\n\tfor j in range(n):\r\n\t\tarr += [[int(j) for j in input().split()]]\r\n\t# print(arr)\r\n\r\n\tdp = [[0 for i in range(m)] for j in range(n)]\r\n\tans = [[0 for i in range(m)] for j in range(n)]\r\n\r\n\tfor i in range(m):\r\n\t\tdp[0][i] = arr[0][i]\r\n\t\tans[0][i] = 1\r\n\r\n\tif m == 1:\r\n\t\tfor i in range(1, n):\r\n\t\t\tdp[i][0] = max(dp[i-1][0], arr[i][0])\r\n\t\t\tif dp[i][0] == arr[i][0]:\r\n\t\t\t\tans[i][0] = 1\r\n\t\t# print(dp)\r\n\t\tfor x in ans:\r\n\t\t\tprint(*x, sep='')\r\n\t\tcontinue\r\n\r\n\tfor i in range(1, n):\r\n\t\tdp[i][0] = max(dp[i-1][0], dp[i-1][1], arr[i][0])\r\n\t\tif dp[i][0] == arr[i][0]:\r\n\t\t\tans[i][0] = 1\r\n\r\n\t\tfor j in range(1, m-1):\r\n\t\t\tdp[i][j] = max(dp[i-1][j], dp[i-1][j-1], dp[i-1][j+1], arr[i][j])\r\n\t\t\tif dp[i][j] == arr[i][j]:\r\n\t\t\t\tans[i][j] = 1\r\n\r\n\t\tdp[i][m-1] = max(dp[i-1][m-1], dp[i-1][m-2], arr[i][m-1])\r\n\t\tif dp[i][m-1] == arr[i][m-1]:\r\n\t\t\tans[i][m-1] = 1\r\n\r\n\tfor x in ans:\r\n\t\tprint(*x, sep='')\r\n", "# cook your dish here\nt = int(input())\n\nfor _ in range(t):\n\tn, m = map(int, input().split())\n\n\tget_ups = lambda r, c: [(r-1, c + i) for i in [1, 0, -1] if 0 <= c+i < m]\n\tgrid = [list(map(int, input().split())) for _ in range(n)]\n\tres = [[0]*m for _ in range(n)]\n\tres[0] = ['1']*m \n\tfor i in range(1, n):\n\t\tfor j in range(m):\n\t\t\tt = 1\n\t\t\tfor r, c in get_ups(i, j):\n\t\t\t\tif grid[r][c] > grid[i][j]:\n\t\t\t\t\tgrid[i][j] = grid[r][c]\n\t\t\t\t\tt = 0\n\t\t\tres[i][j] = '1' if t else '0'\n\tfor r in res:\n\t\tprint(''.join(r))", "R = lambda : map(int, input().split())\r\nf = lambda x: ([0] + x, x, x[1:] + [0])\r\n\r\nt, = R()\r\nfor _ in range(t):\r\n n, m = R()\r\n a = b = [0] * m \r\n for _ in range(n):\r\n a = list(map(max, *f(a), *f(b)))\r\n b = list(R())\r\n print(''.join('01'[x < y] for x, y in zip(a, b)))\r\n"] | {"inputs": [["1", "3 4", "1 3 7 10", "9 2 4 11", "8 12 5 6 ", ""]], "outputs": [["1111", "1001", "0100"]]} | INTERVIEW | PYTHON3 | CODECHEF | 16,979 | |
3ed4f4c49726df1cdb497967a3db49c2 | UNKNOWN | Devu has n weird friends. Its his birthday today, so they thought that this is the best occasion for testing their friendship with him. They put up conditions before Devu that they will break the friendship unless he gives them a grand party on their chosen day. Formally, ith friend will break his friendship if he does not receive a grand party on dith day.
Devu despite being as rich as Gatsby, is quite frugal and can give at most one grand party daily. Also, he wants to invite only one person in a party. So he just wonders what is the maximum number of friendships he can save. Please help Devu in this tough task !!
-----Input-----
- The first line of the input contains an integer T denoting the number of test cases. The description of T test cases follows.
- First line will contain a single integer denoting n.
- Second line will contain n space separated integers where ith integer corresponds to the day dith as given in the problem.
-----Output-----
Print a single line corresponding to the answer of the problem.
-----Constraints-----
- 1 ≤ T ≤ 104
- 1 ≤ n ≤ 50
- 1 ≤ di ≤ 100
-----Example-----
Input:
2
2
3 2
2
1 1
Output:
2
1
-----Explanation-----
Example case 1. Devu can give party to second friend on day 2 and first friend on day 3, so he can save both his friendships.
Example case 2. Both the friends want a party on day 1, and as the Devu can not afford more than one party a day, so he can save only one of the friendships, so answer is 1. | ["# cook your dish here\ntest = int(input())\n\nfor _ in range(0,test):\n n = int(input())\n lister = set(map(int,input().split()))\n print(len(lister))", "# cook your dish here\nfor _ in range(int(input())):\n n=int(input())\n l=list(map(int,input().split()))\n s=set(l)\n l1=list(s)\n print(len(l1))", "# cook your dish here\nt= int(input())\nfor i in range(t):\n n= int(input())\n ls= list(map(int,input().split()))\n s = len(set(ls))\n print(s)", "# cook your dish here\nt= int(input())\nfor _ in range(t):\n n= int(input())\n ls= list(map(int,input().split()))\n s = len(set(ls))\n print(s)\n", "for _ in range(int(input())):\n input()\n print(len(set(input().split())))", "# cook your dish here\nt=int(input())\nfor _ in range(t):\n n= int(input())\n s=set(map(int,input().split()))\n if(n==len(s)):\n print(n)\n else:\n print(len(s))", "# cook your dish here\nfor _ in range(int(input())):\n n=int(input())\n d=list(map(int,input().split()))\n d_set=set(d)\n print(len(d_set))", "for _ in range(int(input())):\n n = int(input())\n arr = list(map(int, input().split()))\n hsh = [0] * 101\n ans = 0\n\n for i in arr:\n if hsh[i] == 0:\n ans += 1\n hsh[i] += 1\n\n print(ans)", "# cook your dish here\nt = int(input())\nl=[6,2,5,5,4,5,6,3,7,6]\nfor i in range(t):\n n=int(input())\n a=list(map(int,input().split()))\n a1=set(a)\n print(len(a1))\n \n", "for t in range(int(input())):\n n=int(input())\n l=list(set(list(map(int, input().split()))))\n print(len(l))", "# cook your dish here\nfor i in range(int(input())):\n n=int(input())\n s=set(map(int,input().split()))\n print(len(s))", "t=int(input())\nwhile t!=0:\n dict={}\n n=int(input())\n arr=list(map(int,input().split()))\n for i in range(n):\n if arr[i] in dict:\n dict[arr[i]]+=1\n else:\n dict[arr[i]]=1\n print(len(dict))\n t-=1", "# cook your dish here\nt=int(input())\n\nwhile(t):\n n=int(input())\n lt=input().split()\n for i in range(n):\n lt[i]=int(lt[i])\n new=set(lt)\n size=len(new)\n print(size)\n t=t-1", "# cook your dish here\nt=int(input())\ni=0\nwhile i<t:\n n=int(input())\n a=[]\n a=input().split()\n j=0\n b=[]\n fl=0\n while j<n:\n x=int(a[j])\n if x not in b:\n c=a.count(a[j])\n if c>1:\n fl=fl+c-1\n b.append(x)\n j+=1\n fs=n-fl\n print(fs)\n i+=1", "t =int(input())\nfor i in range(t):\n n = int(input())\n li = list(map(int, input().split()))[:n]\n a = []\n for i in li:\n if li.count(i) == 1:\n a.append(i)\n if i not in a:\n a.append(i)\n print(len(a))\n", "for t in range(int(input())):\n n = int(input())\n numberlist = list(map(int,input().split()))\n print(len(list(set(numberlist))))\n", "# cook your dish here\nt=int(input())\nfor i in range(t):\n n=int(input())\n li=list(map(int,input().split(\" \")))\n s=list(set(li))\n print(len(s)) \n \n", "a=int(input())\nwhile a:\n a=a-1\n b=int(input())\n x=list(map(int,input().split()))\n p=[]\n for i in x:\n if i not in p:\n p.append(i)\n print(len(p)) \n", "for i in range(int(input())):\n n=int(input())\n l=list(map(int,input().split()))\n s=set(l)\n print(len(s))", "t=int(input())\nwhile t>0:\n n=int(input())\n li=list(map(int,input().split(\" \")))\n se=list(set(li))\n print(len(se)) \n t-=1 ", "# cook your dish here\nfor i in range(int(input())):\n n=int(input())\n li=list(map(int,input().split()))\n a=set(li)\n l=list(a)\n print(len(l))\n", "T=int(input())\nfor i in range(0,T):\n N=int(input())\n a = list(map(int,input().strip().split()))[:N]\n lst=[]\n count=0\n for i in a :\n if i in lst:\n pass\n else :\n count=count+1\n lst.append(i)\n print(count)", "t=int(input())\nfor i in range(t):\n n=int(input())\n li=list(map(int,input().split()))\n a=set(li)\n l=list(a)\n print(len(l))", "t=int(input())\nfor i in range(t):\n n=int(input())\n li=list(map(int,input().split()))\n a=set(li)\n l=list(a)\n print(len(l))\n", "for _ in range(int(input())):\n n=int(input())\n s=input().split(' ')\n a=set() \n for i in range(n): a.add(eval(s[i])) \n print(len(a))\n"] | {"inputs": [["2", "2", "3 2", "2", "1 1"]], "outputs": [["2", "1"]]} | INTERVIEW | PYTHON3 | CODECHEF | 3,966 | |
66126f5911ae98a89f6f94f8ef06e9af | UNKNOWN | Chef was bored staying at home in the lockdown. He wanted to go out for a change. Chef and Chefu are fond of eating Cakes,so they decided to go the Cake shop where cakes of all possible price are available .
They decided to purchase cakes of equal price and each of them will pay for their cakes. Chef only has coins of denomination $N$ whereas Chefu has that of denomination $M$.
So they want your help to find out the minimum amount to be spent in order to purchase the cakes.
-----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, M$.
-----Output:-----
For each testcase, output in a single line answer the minimum amount to be spent in order to purchase the cake.
-----Constraints-----
- $1 \leq T \leq 1000$
- $2 \leq N,M \leq 10^7$
-----Sample Input:-----
1
2 3
-----Sample Output:-----
6 | ["# cook your dish here\nimport math\nT=int(input())\nfor i in range(T):\n a=list(map(int,input().split()))\n n=a[0]\n m=a[1]\n print(m*n//math.gcd(m,n))", "def compute_gcd(x, y):\r\n\r\n while(y):\r\n x, y = y, x % y\r\n return x\r\n\r\n# This function computes LCM\r\ndef compute_lcm(x, y):\r\n lcm = (x*y)//compute_gcd(x,y)\r\n return lcm\r\n \r\nfor _ in range(int(input())):\r\n a=[int(i) for i in input().split()]\r\n print(compute_lcm(a[0],a[1]))", "# cook your dish here\ndef gcd(a,b): \n if a == 0: \n return b \n return gcd(b % a, a) \n\ndef lcm(a,b): \n return (a*b) / gcd(a,b)\n \nfor _ in range(int(input())):\n n,m=list(map(int,input().split()))\n print(int(lcm(n,m)))\n", "from math import gcd\r\nt=int(input())\r\nfor _ in range (t):\r\n n,m=map(int,input().split())\r\n if (n%m==0 or m%n==0):\r\n print(max(m,n))\r\n else:\r\n g=max(n,m)\r\n great=g\r\n while (True):\r\n if (great%n==0 and great%m==0):\r\n break\r\n else:\r\n great+=g\r\n print(great)", "def gcd(a, b):\n if min(a, b) == 0:\n return max(a, b)\n a_1 = max(a, b) % min(a, b)\n return gcd(a_1, min(a, b))\n\ndef lcm(a, b):\n return (a * b) // gcd(a, b)\n \nfor test in range(int(input())):\n n, m = map(int, input().split())\n print(lcm(n, m))", "# cook your dish here\nt = int(input())\n\ndef gcd(a,b): \n if a == 0: \n return b \n return gcd(b % a, a) \n \n\ndef lcm(a,b): \n return (a*b) // gcd(a,b) \n\nfor i in range(t):\n n,m = map(int, input().split())\n print(lcm(n,m))", "def compute_gcd(x, y):\n while(y):\n x, y = y, x % y\n return x\ndef cm(x, y):\n lcm = (x*y)//compute_gcd(x,y)\n return lcm\nfor _ in range(int(input())):\n n,m=map(int,input().split())\n print(cm(n,m))", "def gcd(a,b): \n if a == 0: \n return b \n return gcd(b % a, a) \n \n# Function to return LCM of two numbers \ndef lcm(a,b): \n return (a*b) / gcd(a,b)\n\nt=int(input())\nfor _ in range(t):\n \n a,b=map(int,input().split())\n print(int(lcm(a,b)))", "from math import gcd\nfor i in range(int(input())):\n\ta,b=map(int,input().split())\n\tc=a*b\n\td=gcd(a,b)\n\tprint(c//d)", "# cook your dish here\ndef gcd(a,b): \n if a == 0: \n return b \n return gcd(b % a, a)\nT=int(input())\nwhile(T):\n l=[int(k) for k in input().split()]\n print(int((l[0]*l[1]) / gcd(l[0],l[1])))\n \n \n \n T-=1", "from fractions import gcd\r\ntry:\r\n def lcm(x, y):\r\n return x * y // gcd(x, y)\r\n tc=int(input())\r\n for _ in range(tc):\r\n x,y=map( int,input().split() )\r\n print(lcm(x,y))\r\nexcept:\r\n pass", "# cook your dish here\ndef gcd(a, b):\n if a ==0:\n return b\n return gcd(b%a, a)\n\n\nt = int(input())\nwhile t:\n n, m = input().split()\n n = int(n)\n m = int(m)\n lcm = (n*m)/gcd(n,m)\n print(int(lcm))\n t -= 1", "# cook your dish here\n\ndef hcf(x, y):\n if x > y:\n s = y\n else:\n s = x\n for i in range(1, s+1):\n if((x % i == 0) and (y % i == 0)):\n hcf = i \n return hcf\n\nT=int(input())\nfor i in range(T):\n n, m=list(map(int,input().split()))\n h=hcf(n, m)\n l=m*n\n print(l//h)\n", "from sys import stdin\r\nfrom math import ceil, gcd\r\n\r\n# Input data\r\n#stdin = open(\"input\", \"r\")\r\n\r\n\r\ndef func():\r\n\r\n return\r\n\r\nfor _ in range(int(stdin.readline())):\r\n n, m = list(map(int, stdin.readline().split()))\r\n print(n * m // gcd(n, m))\r\n", "from math import gcd\r\ndef lcm(a,b):\r\n return int((a*b/gcd(a,b)))\r\n\r\nt=int(input())\r\nwhile (t!=0):\r\n n,m=list(map(int,input().split()))\r\n ans=lcm(n,m)\r\n print(ans)\r\n t=t-1\r\n", "from math import gcd\r\ndef lcm(a,b):\r\n return int((a*b/gcd(a,b)))\r\n\r\nt=int(input())\r\nwhile (t!=0):\r\n n,m=list(map(int,input().split()))\r\n ans=lcm(n,m)\r\n print(ans)\r\n t=t-1\r\n", "# cook your dish here\nfrom math import gcd\ndef cakes(a,b):\n print(int(a*b/gcd(a,b)))\n \n \nfor _ in range(int(input())):\n cakes(*list(map(int,input().split())))", "def gcd(n,m):\r\n if n==0:\r\n return m\r\n return gcd(m%n,n)\r\n\r\ndef lcm(n,m):\r\n return int((n*m)/gcd(n,m))\r\n\r\nfor _ in range(int(input())):\r\n n,m=list(map(int,input().split()))\r\n print(lcm(n,m))\r\n", "import math\nfor _ in range(int(input())):\n n,m=list(map(int,input().split()))\n val1=n*m\n val2=math.gcd(n,m)\n print(val1//val2)\n", "# cook your dish here\nimport sys \ndef LCM(a, b):\n lar = max(a, b) \n small = min(a, b) \n i = lar \n while(1) : \n if (i % small == 0):\n return i \n i += lar \nfor _ in range (int(input())):\n\tM,N=map(int,input().split())\n\tprint(LCM(M,N))", "def compute_gcd(x, y):\n\n while(y):\n x, y = y, x % y\n return x\ndef cm(x, y):\n lcm = (x*y)//compute_gcd(x,y)\n return lcm\nfor _ in range(int(input())):\n n,m=list(map(int,input().split()))\n print(cm(n,m))\n", "#cook your dish here\ndef gcd(a,b): \n if a == 0: \n return b \n return gcd(b % a, a) \n \ndef lcm(a,b): \n return (a*b) // gcd(a,b) \n \nfor _ in range(int(input())):\n m, n = map(int,input().split())\n print(lcm(m,n))", "# cook your dish here\nimport sys \ndef findLCM(a, b):\n lar = max(a, b) \n small = min(a, b) \n i = lar \n while(1) : \n if (i % small == 0): \n return i \n i += lar \n \nfor _ in range (int(input())):\n\tM,N=map(int,input().split())\n\tprint(findLCM(M,N))", "#cook your dish here\ndef gcd(a,b): \n if a == 0: \n return b \n return gcd(b % a, a) \n \ndef lcm(a,b): \n return (a*b) // gcd(a,b) \n \nfor _ in range(int(input())):\n m, n = map(int,input().split())\n print(lcm(m,n))"] | {"inputs": [["1", "2 3"]], "outputs": [["6"]]} | INTERVIEW | PYTHON3 | CODECHEF | 5,951 |
Subsets and Splits