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
|
|---|---|---|---|---|---|---|---|---|---|
c3a8d683660d87f662a06c367ea6e1b7 | UNKNOWN | Chef has an array A = (A1, A2, ..., AN), which has N integers in it initially. Chef found that for i ≥ 1, if Ai > 0, Ai+1 > 0, and Ai+2 exists, then he can decrease both Ai, and Ai+1 by one and increase Ai+2 by one. If Ai+2 doesn't exist, but Ai > 0, and Ai+1 > 0, then he can decrease both Ai, and Ai+1 (which will be the currently last two elements of the array) by one and add a new element at the end, whose value is 1.
Now Chef wants to know the number of different arrays that he can make from A using this operation as many times as he wishes. Help him find this, and because the answer could be very large, he is fine with you reporting the answer modulo 109+7.
Two arrays are same if they have the same number of elements and if each corresponding element is the same. For example arrays (2,1,1) and (1,1,2) are different.
-----Input-----
- The first line of the input contains a single integer T denoting the number of test cases.
- The first line contains a single integer N denoting the initial number of elements in A.
- The second line contains N space-separated integers: A1, A2, ... , AN.
-----Output-----
For each test case, output answer modulo 109+7 in a single line.
-----Constraints-----
- 1 ≤ T ≤ 5
- 1 ≤ N ≤ 50
- 0 ≤ Ai ≤ 50
-----Subtasks-----
- Subtask 1 (20 points) : 1 ≤ N ≤ 8, 0 ≤ Ai ≤ 4
- Subtask 2 (80 points) : Original constraints
-----Example-----
Input:
3
3
2 3 1
2
2 2
3
1 2 3
Output:
9
4
9
-----Explanation-----
Example case 1.
We'll list the various single steps that you can take (ie. in one single usage of the operation):
- (2, 3, 1) → (2, 2, 0, 1)
- (2, 2, 0, 1) → (1, 1, 1, 1)
- (1, 1, 1, 1) → (1, 1, 0, 0, 1)
- (1, 1, 0, 0, 1) → (0, 0, 1, 0, 1)
- (1, 1, 1, 1) → (1, 0, 0, 2)
- (1, 1, 1, 1) → (0, 0, 2, 1)
- (2, 3, 1) → (1, 2, 2)
- (1, 2, 2) → (0, 1, 3)
So all the arrays you can possibly get are:
(2, 3, 1), (2, 2, 0, 1), (1, 1, 1, 1), (1, 1, 0, 0, 1), (0, 0, 1, 0, 1), (1, 0, 0, 2), (0, 0, 2, 1), (1, 2, 2), and (0, 1, 3)
Since there are 9 different arrays that you can reach, the answer is 9. | ["def fun(a,cur,n,cnt):\n if cur>=n-1:\n return\n for i in range(cur,n-1):\n if i<n-2:\n if a[i]>0 and a[i+1]>0:\n a[i]-=1\n a[i+1]-=1\n a[i+2]+=1\n cnt[0]=(cnt[0]+1)%1000000007\n fun(a,i,n,cnt)\n a[i]+=1\n a[i+1]+=1\n a[i+2]-=1\n else:\n if a[i]>0 and a[i+1]>0:\n a[i]-=1\n a[i+1]-=1\n a.append(1)\n cnt[0]=(cnt[0]+1)%1000000007\n fun(a,i,n+1,cnt)\n a[i]+=1\n a[i+1]+=1\n a.pop()\ntc=int(input())\nfor case in range(tc):\n n=int(input())\n a=list(map(int,input().split()))\n cnt=[1]\n fun(a,0,n,cnt)\n print(cnt[0]%1000000007)\n \n", "def fun(a,cur,n,cnt):\n if cur>=n-1:\n return\n for i in range(cur,n-1):\n if i<n-2:\n if a[i]>0 and a[i+1]>0:\n a[i]-=1\n a[i+1]-=1\n a[i+2]+=1\n cnt[0]+=1\n fun(a,i,n,cnt)\n a[i]+=1\n a[i+1]+=1\n a[i+2]-=1\n else:\n if a[i]>0 and a[i+1]>0:\n a[i]-=1\n a[i+1]-=1\n a.append(1)\n cnt[0]+=1\n fun(a,i,n+1,cnt)\n a[i]+=1\n a[i+1]+=1\n a.pop()\ntc=int(input())\nfor case in range(tc):\n n=int(input())\n a=list(map(int,input().split()))\n cnt=[1]\n fun(a,0,n,cnt)\n print(cnt[0])\n \n", "from sys import stdin\n \nmod = 10**9 + 7\nmax_val = 135\n\ncache2 = [[0]*max_val for _ in range(max_val)]\ndone = [[False]*max_val for _ in range(max_val)]\ndef f2(x, y):\n\tif done[x][y]:\n\t\tres = cache2[x][y]\n\telif x == 0 or y == 0:\n\t\tres = 1\n\t\tcache2[x][y] = res\n\t\tdone[x][y] = True\n\telif x > y:\n\t\tres = f2(y, y)\n\t\tcache2[x][y] = res\n\t\tdone[x][y] = True\n\telse:\n\t\tres = sum(f2(y-i, i) for i in range(x+1))\n\t\tcache2[x][y] = res\n\t\tdone[x][y] = True\n\treturn res % mod\n \ndef solve():\n\tn = int(stdin.readline().strip())\n\ta = list(map(int, stdin.readline().strip().split()))\n\t\n\tcache = [[[0]*max_val for _ in range(max_val)] for _ in range(51)]\n\tdone = [[[False]*max_val for _ in range(max_val)] for _ in range(51)]\n\tdef f(i, x, y):\n\t\tif done[i][x][y]:\n\t\t\tres = cache[i][x][y]\n\t\telif i == n-1:\n\t\t\tres = 1\n\t\t\tcache[i][x][y] = res\n\t\t\tdone[i][x][y] = True\n\t\telif i == n-2:\n\t\t\tres = f2(x, y)\n\t\t\tcache[i][x][y] = res\n\t\t\tdone[i][x][y] = True\n\t\telif x == 0:\n\t\t\tres = f(i+1, y, a[i+2])\n\t\t\tcache[i][x][y] = res\n\t\t\tdone[i][x][y] = True\n\t\telse:\n\t\t\tk = min(x, y)\n\t\t\tres = 0\n\t\t\tfor z in range(k+1):\n\t\t\t\tres += f(i+1, y-z, a[i+2]+z)\n\t\t\t\tres %= mod\n\t\t\tcache[i][x][y] = res\n\t\t\tdone[i][x][y] = True\t\n\t\treturn res % mod\n\t\n\tprint(f(0, a[0], a[1]) if n >= 2 else 1)\n \nt = int(stdin.readline().strip())\nfor _ in range(t):\n\tsolve()", "from sys import stdin\n \nmod = 10**9 + 7\n\t\ncache2 = [[0]*501 for _ in range(501)]\ndone = [[False]*501 for _ in range(501)]\ndef f2(x, y):\n\tif done[x][y]:\n\t\tres = cache2[x][y]\n\telif x == 0 or y == 0:\n\t\tres = 1\n\t\tcache2[x][y] = res\n\t\tdone[x][y] = True\n\telif x > y:\n\t\tres = f2(y, y)\n\t\tcache2[x][y] = res\n\t\tdone[x][y] = True\n\telse:\n\t\tres = sum(f2(y-i, i) for i in range(x+1))\n\t\tcache2[x][y] = res\n\t\tdone[x][y] = True\n\treturn res % mod\n \ndef solve():\n\tn = int(stdin.readline().strip())\n\ta = list(map(int, stdin.readline().strip().split()))\n\t\n\tcache = [[[0]*501 for _ in range(501)] for _ in range(51)]\n\tdone = [[[False]*501 for _ in range(501)] for _ in range(51)]\n\tdef f(i, x, y):\n\t\tif done[i][x][y]:\n\t\t\tres = cache[i][x][y]\n\t\telif i == n-1:\n\t\t\tres = 1\n\t\t\tcache[i][x][y] = res\n\t\t\tdone[i][x][y] = True\n\t\telif i == n-2:\n\t\t\tres = f2(x, y)\n\t\t\tcache[i][x][y] = res\n\t\t\tdone[i][x][y] = True\n\t\telif x == 0:\n\t\t\tres = f(i+1, y, a[i+2])\n\t\t\tcache[i][x][y] = res\n\t\t\tdone[i][x][y] = True\n\t\telse:\n\t\t\tk = min(x, y)\n\t\t\tres = 0\n\t\t\tfor z in range(k+1):\n\t\t\t\tres += f(i+1, y-z, a[i+2]+z)\n\t\t\t\tres %= mod\n\t\t\tcache[i][x][y] = res\n\t\t\tdone[i][x][y] = True\t\n\t\treturn res % mod\n\t\n\tprint(f(0, a[0], a[1]) if n >= 2 else 1)\n \nt = int(stdin.readline().strip())\nfor _ in range(t):\n\tsolve()", "import pdb\n\n \ndef gen_sig(arr):\n sig = ';'.join(map(str,arr))\n return sig\n\ndef solve(arr,cache):\n l = len(arr)\n cnt =0\n for i in range(l-1):\n if arr[i] >0 and arr[i+1]>0:\n if i == l-2:\n arr[i]-=1\n arr[i+1]-=1\n arr.append(1)\n sig = gen_sig(arr)\n if (sig in cache) == False:\n cache[sig]=1\n ret = solve(arr,cache)\n if ret >=0:\n cnt+=ret+1\n arr.pop(-1)\n arr[i+1]+=1\n arr[i]+=1\n else:\n arr[i]-=1\n arr[i+1]-=1\n arr[i+2]+=1\n sig = gen_sig(arr)\n if (sig in cache) == False:\n cache[sig]=1\n ret = solve(arr,cache)\n if ret >=0:\n cnt+=ret+1\n arr[i]+=1\n arr[i+1]+=1\n arr[i+2]-=1\n #cache[gen_sig(arr)] = cnt\n return cnt\n\ndef __starting_point():\n T = int(input())\n for t in range(T):\n n = int(input())\n arr = list(map(int, input().split()))\n cache = {}\n cache[gen_sig(arr)]=1\n solve(arr,cache)\n print(len(cache))\n\n__starting_point()"] | {"inputs": [["3", "3", "2 3 1", "2", "2 2", "3", "1 2 3", "", ""]], "outputs": [["9", "4", "9"]]} | INTERVIEW | PYTHON3 | CODECHEF | 5,887 | |
5074602fc583d164f453ba33d70e03e1 | UNKNOWN | Richik$Richik$ has just completed his engineering and has got a job in one of the firms at Sabrina$Sabrina$ which is ranked among the top seven islands in the world in terms of the pay scale.
Since Richik$Richik$ has to travel a lot to reach the firm, the owner assigns him a number X$X$, and asks him to come to work only on the day which is a multiple of X$X$. Richik joins the firm on 1-st day but starts working from X-th day. Richik$Richik$ is paid exactly the same amount in Dollars as the day number. For example, if Richik$Richik$ has been assigned X=3$X = 3$, then he will be paid 3$3$ dollars and 6$6$ dollars on the 3rd$3rd$ and 6th$6th$ day on which he comes for work.
On N−th$N-th$ day, the owner calls up Richik$Richik$ and asks him not to come to his firm anymore. Hence Richik$Richik$ demands his salary of all his working days together. Since it will take a lot of time to add, Richik$Richik$ asks help from people around him, let's see if you can help him out.
-----Input:-----
- First line will contain T$T$, number of testcases. Then the testcases follow.
- Each testcase contains of a single line of input, two integers X,N$X, N$.
-----Output:-----
For each testcase, output in a single line which is the salary which Richik$Richik$ demands.
-----Constraints-----
- 1≤T≤1000$1 \leq T \leq 1000$
- 1≤X<=N≤107$1 \leq X<=N \leq 10^7$
-----Sample Input:-----
1
3 10
-----Sample Output:-----
18 | ["t=int(input())\r\nfor i in range(t):\r\n x,n=[int(g) for g in input().split()]\r\n sal=0\r\n day=x\r\n while day<n:\r\n sal=sal+day\r\n day+=x\r\n print(sal)\r\n", "for _ in range(int(input())):\r\n\tl,r=map(int,input().split())\r\n\tr=r-1\r\n\tn=r//l\r\n\tsum_=n*(2*l+(n-1)*l)\r\n\tprint(sum_//2)", "T=int(input())\nfor i in range(T):\n X,N=list(map(int,input().split()))\n a=N//X\n if(N%X!=0):\n S=(2*X+(a-1)*X)*(a/2)\n else:\n S=(2*X+(a-2)*X)*((a-1)/2)\n print(int(S))\n", "for _ in range(int(input())):\r\n x, n = map(int, input().split())\r\n r = 0\r\n i = 1\r\n while x*i < n:\r\n r += x*i\r\n i += 1\r\n print(r)", "t = int(input())\r\nfor i in range(t):\r\n x, n = input().split()\r\n x = int(x)\r\n n = int(n)\r\n s = 0\r\n for j in range(x,n,x):\r\n s = s + j\r\n print(s)\r\n", "def inp():\r\n return int(input())\r\ndef linp():\r\n return list(map(int, input().split(' ')))\r\ndef minp():\r\n return map(int, input().split(' '))\r\ndef prn(xx):\r\n for yy in xx:\r\n print(yy,end=\" \")\r\n\r\nt = inp()\r\nfor _ in range(t):\r\n n,m = minp()\r\n m-=1\r\n kk = m//n\r\n sm = n+(n*kk)\r\n sm*=kk\r\n sm//=2\r\n print(sm)\r\n\r\n", "for _ in range(int(input())):\r\n\ta,b=list(map(int,input().split()))\r\n\ti=a\r\n\ttotal=0\r\n\tj=1\r\n\twhile b>i:\r\n\t\ttotal=total+a*j\r\n\t\tj+=1\r\n\t\ti+=a\r\n\r\n\tprint(total)\r\n", "t=int(input())\r\nwhile(t!=0):\r\n x,k=map(int,input().split())\r\n cnt=0\r\n if(k%x==0):\r\n a=k/x-1\r\n else:\r\n a=int(k/x)\r\n for i in range(1,int(a)+1):\r\n cnt+=x*i\r\n print(cnt)\r\n t-=1", "for i in range(int(input())):\r\n x,n=map(int,input().split())\r\n s=0\r\n if n==x:\r\n print('0')\r\n else:\r\n a=int((n-1)/x)\r\n s=(a*(2*x+(a-1)*x))/2\r\n print(int(s))", "tc=int(input())\r\nfor i in range(0,tc):\r\n x,n=map(int,input().split())\r\n i=1\r\n asum=0\r\n while(x*i<n):\r\n asum=asum+x*i\r\n i+=1\r\n print(asum)", "t=int(input())\r\nfor _ in range(t):\r\n x,n=map(int,input().strip().split())\r\n n-=1\r\n k=n//x\r\n ans=(k/2)*(2*x+(k-1)*x)\r\n print(int(ans))", "for T in range(int(input())):\r\n n, m = map(int, input().split())\r\n m -= 1\r\n x = int(m/n)\r\n ans = n*int(x*(x+1)/2)\r\n print(ans)", "t = int(input())\r\nfor i in range(t):\r\n a = input().split()\r\n k = int(a[0])\r\n n = int(a[1])\r\n maxlim = n-(n%k)\r\n no = maxlim/k\r\n ans = ((k+maxlim)*no)/2\r\n if n%k != 0:\r\n print(int(ans))\r\n else:\r\n print(int(ans-n))\r\n \r\n", "for _ in range(int(input())):\r\n x,n=list(map(int,input().split()))\r\n nn=n//x\r\n ss=(nn*(x+x*nn))//2\r\n if n%x==0:\r\n print(ss-n)\r\n else:\r\n print(ss)\r\n", "n=int(input())\r\nfor j in range(n):\r\n x=[int(y) for y in input().split(' ')]\r\n if(x[1]%x[0]==0):\r\n x[1]=x[1]-1\r\n p=x[1]//x[0]\r\n p=p*x[0]\r\n print(p*(x[0]+p)//(x[0]*2))", "# cook your dish here\nt=int(input())\nfor _ in range(t):\n x,n=map(int,input().split())\n a=[]\n for i in range(1,n):\n if i%x==0:\n a.append(i)\n print(sum(a))", "\r\nT = int(input())\r\n\r\nfor q in range(T):\r\n x,y = list(map(int,input().strip().split()))\r\n\r\n y = (y-1)//x\r\n\r\n print(x*(y)*(y+1)//2)\r\n", "t=int(input())\r\nfor _ in range(t):\r\n ans=0\r\n x,n=map(int,input().split())\r\n for i in range(x,n,x):\r\n ans=ans+i\r\n print(ans)", "for _ in range(int(input())):\r\n\ta,b=[int(j) for j in input().split()]\r\n\tk=b//a\r\n\tif b%a!=0:\r\n\t\tprint(a*((k*(k+1))//2))\r\n\telse:\r\n\t\tprint(a*((k*(k-1))//2))", "n=int(input())\r\nfor i in range(n):\r\n sum1=0\r\n a,b=map(int,input().split())\r\n for x in range(a,b,a):\r\n sum1+=x\r\n print(sum1)", "T = int(input())\r\n\r\nwhile T>0:\r\n X,N = input().split()\r\n X = int(X)\r\n N = int(N)\r\n sum = 0\r\n for i in range(X,N,1):\r\n if i % X == 0:\r\n sum = sum + i\r\n T = T - 1\r\n print(sum)", "from math import floor as f\r\nfor _ in range(int(input())):\r\n x,N=list(map(int,input().split()))\r\n xx=x\r\n su=0\r\n t=1\r\n c=1\r\n while x<N:\r\n su+=x\r\n c+=1\r\n x=xx*c\r\n print(su)\r\n \r\n"] | {"inputs": [["1", "3 10"]], "outputs": [["18"]]} | INTERVIEW | PYTHON3 | CODECHEF | 4,489 | |
d8aa9f828b8a3aea5535fa6d3c92a3ac | UNKNOWN | You have found $M$ different types of jewels in a mine and each type of jewel is present in an infinite number.
There are $N$ different boxes located at position $(1 ,2 ,3 ,...N)$.
Each box can collect jewels up to a certain number ( box at position $i$ have $i$ different partitions and each partition can collect at most one jewel of any type).
Boxes at odd positions are already fully filled with jewels while boxes at even positions are completely empty.
Print the total number of different arrangements possible so that all boxes can be fully filled.
As the answer can be very large you can print it by doing modulo with 1000000007(10^9+7).
-----Input:-----
- First line will contain $T$, number of testcases.
- Each testcase contains of a single line of input, two integers $N , M$.
-----Output:-----
For each testcase, Print the total number of different arrangement.
-----Constraints-----
- $1 \leq T \leq 20000$
- $1 \leq N \leq 1e9$
- $1 \leq M \leq 1e14$
-----Sample Input:-----
2
1 10
5 2
-----Sample Output:-----
1
64 | ["t = int(input())\nwhile t != 0:\n M = 1000000007\n n, m = list(map(int, input().split())) \n ans = 1\n tt = n//2\n tt = tt * (tt + 1)\n \n ans = pow(m, tt, M)\n \n print(ans)\n t -= 1\n \n \n", "# cook your dish here\nt = int(input())\nfor _ in range(t):\n nm = list(map(int,input().split()))\n if nm[0]==1 or nm[1]==1:\n print(1)\n else:\n k = nm[0]//2\n print(pow(nm[1],k*(k+1),10**9 + 7))", "for _ in range(int(input())):\r\n n,m=list(map(int,input().split()))\r\n n=n//2\r\n n=n*(n+1)\r\n n=int(n)\r\n print(pow(m,n,1000000007))\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 list(map(int, inp().split()))\ndef smp(): return list(map(str, inp().split()))\ndef l1d(n, val=0): return [val for i in range(n)]\ndef l2d(n, m, val=0): return [l1d(n, val) for j in range(m)]\ndef remadd(x, y): return 1 if x%y else 0\ndef ceil(a,b): return (a+b-1)//b\n\ndef isprime(x):\n if x<=1: return False\n if x in (2, 3): return True\n if x%2 == 0: return False\n for i in range(3, int(sqrt(x))+1, 2):\n if x%i == 0: return False\n return True\n \nfor _ in range(int(inp())):\n n, m = mp()\n x = n//2\n print(pow(m, x*(x+1), mod))\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\u2591\u2591\u2588\u2588\u2584\u2591\u2591\u2591\u2591\u2591\u2591\u2591\u2591\u2591\u2591\u2591\u2584\u2588\u2588\r\n\u2591\u2584\u2580\u2591\u2588\u2584\u2591\u2591\u2591\u2591\u2591\u2591\u2591\u2591\u2584\u2588\u2591\u2591\u2588\u2591\r\n\u2591\u2588\u2591\u2584\u2591\u2588\u2584\u2591\u2591\u2591\u2591\u2591\u2591\u2584\u2588\u2591\u2584\u2591\u2588\u2591\r\n\u2591\u2588\u2591\u2588\u2588\u2588\u2588\u2588\u2588\u2588\u2588\u2588\u2588\u2588\u2588\u2588\u2588\u2584\u2588\u2591\r\n\u2591\u2588\u2588\u2588\u2588\u2588\u2580\u2580\u2588\u2588\u2588\u2588\u2580\u2580\u2588\u2588\u2588\u2588\u2588\u2591\r\n\u2584\u2588\u2580\u2588\u2580\u2591\u2591\u2591\u2588\u2588\u2588\u2588\u2591\u2591\u2591\u2580\u2580\u2588\u2588\u2588\r\n\u2588\u2588\u2591\u2591\u2580\u2588\u2588\u2588\u2588\u2580\u2580\u2588\u2588\u2588\u2588\u2580\u2591\u2591\u2588\u2588\r\n\u2588\u2588\u2591\u2591\u2591\u2591\u2588\u2580\u2591\u2591\u2591\u2591\u2580\u2588\u2591\u2591\u2591\u2591\u2588\u2588\r\n\u2588\u2588\u2588\u2584\u2591\u2591\u2591\u2591\u2591\u2591\u2591\u2591\u2591\u2591\u2591\u2591\u2584\u2588\u2588\u2588\r\n\u2591\u2580\u2588\u2588\u2588\u2584\u2591\u2591\u2588\u2588\u2588\u2588\u2591\u2591\u2584\u2588\u2588\u2588\u2580\u2591\r\n\u2591\u2591\u2591\u2580\u2588\u2588\u2584\u2591\u2580\u2588\u2588\u2580\u2591\u2584\u2588\u2588\u2580\u2591\u2591\u2591\r\n\u2591\u2591\u2591\u2591\u2591\u2591\u2580\u2588\u2588\u2588\u2588\u2588\u2588\u2580\u2591\u2591\u2591\u2591\u2591\u2591\r\n\u2591\u2591\u2591\u2591\u2591\u2591\u2591\u2591\u2591\u2591\u2591\u2591\u2591\u2591\u2591\u2591\u2591\u2591\u2591\u2591\r\n\"\"\"\r\nimport sys\r\nimport math\r\nimport collections\r\nimport operator as op\r\nfrom collections import deque\r\nfrom math import gcd, inf, sqrt, pi, cos, sin, ceil, log2, floor, log\r\nfrom bisect import bisect_right, bisect_left, bisect\r\n\r\n# sys.stdin = open('input.txt', 'r')\r\n# sys.stdout = open('output.txt', 'w')\r\n\r\nfrom functools import reduce\r\nfrom sys import stdin, stdout, setrecursionlimit\r\nsetrecursionlimit(2**20)\r\n\r\n\r\ndef ncr(n, r):\r\n r = min(r, n - r)\r\n numer = reduce(op.mul, list(range(n, n - r, -1)), 1)\r\n denom = reduce(op.mul, list(range(1, r + 1)), 1)\r\n return numer // denom # or / in Python 2\r\n\r\n\r\ndef prime_factors(n):\r\n i = 2\r\n factors = []\r\n while i * i <= n:\r\n if n % i:\r\n i += 1\r\n else:\r\n n //= i\r\n factors.append(i)\r\n if n > 1:\r\n factors.append(n)\r\n return (list(factors))\r\n\r\n\r\ndef isPowerOfTwo(x):\r\n return (x and (not(x & (x - 1))))\r\n\r\nMOD = 1000000007 # 10^9 + 7\r\nPMOD = 998244353\r\nN = 10**18 + 1\r\nLOGN = 30\r\nalp = 'abcdefghijklmnopqrstuvwxyz'\r\nT = 1\r\nT = int(stdin.readline())\r\nfor _ in range(T):\r\n n, m = list(map(int, stdin.readline().rstrip().split()))\r\n # n = int(stdin.readline())\r\n # a = list(map(int, stdin.readline().rstrip().split()))\r\n # b = list(map(int, stdin.readline().rstrip().split()))\r\n # s = str(stdin.readline().strip('\\n'))\r\n # s = list(stdin.readline().strip('\\n'))\r\n # m = int(stdin.readline())\r\n # c = list(map(int, stdin.readline().rstrip().split()))\r\n p = (n * (n + 1)) // 2 - (ceil(n / 2))**2\r\n print(pow(m, p, MOD))\r\n", "# cook your dish here\np = (int)(1e9+7) \nfor _ in range(int(input())):\n n,m =map(int,input().split())\n if n%2!=0:\n n=(n-1)//2\n else:\n n=n//2\n b=n*(n+1)\n ans=pow(m,b,p)\n print(ans)", "for _ in range(int(input())):\r\n mod=(10**9)+7\r\n n,m=map(int,input().split())\r\n n=n-(n%2)\r\n num=n//2\r\n ##print(num)\r\n tot=(num*((2*num)+2))//2\r\n\r\n print(pow(m,tot,mod))", "# cook your dish here\nmod=10**9+7\nfor _ in range (int(input())):\n n,m=map(int,input().split())\n num=n//2\n tot=(num*(2+2*num))//2\n print(pow(m,tot,mod))", "# cook your dish here\ndef pw(x,n):\n if x==0:\n return 1\n r=1\n while n>0:\n if n%2:\n r=(r*x)%1000000007\n x=(x*x)%1000000007\n n//=2\n return r%1000000007\nt=int(input())\nwhile t>0:\n n,m=list(map(int,input().split()))\n n//=2\n n*=n+1\n print(pw(m,n))\n t-=1\n\n", "MOD = 10 ** 9 + 7\r\nfor _ in range(int(input())):\r\n n, m = list(map(int, input().split()))\r\n x = n // 2\r\n\r\n print(pow(m, (x * (x + 1)), MOD))\r\n", "t=int(input())\r\nmod=10**9+7\r\nfor _ in range(t):\r\n a,b=list(map(int,input().split()))\r\n x=a//2\r\n d = (x*(x+1))\r\n ans =pow(b,d,mod)\r\n print(ans)\r\n"] | {"inputs": [["2", "1 10", "5 2"]], "outputs": [["1", "64"]]} | INTERVIEW | PYTHON3 | CODECHEF | 7,925 | |
b3f85acc90dcb99bd69e65707481f0ff | UNKNOWN | Lets wish Horsbug98 on his birthday and jump right into the question.
In Chefland, $6$ new mobile brands have appeared each providing a range of smartphones. For simplicity let the brands be represented by numbers $1$ to $6$. All phones are sold at the superstore.
There are total $N$ smartphones. Let $P_i$ & $B_i$ be the price and the brand of the $i^{th}$ smartphone. The superstore knows all the price and brand details beforehand.
Each customer has a preference for brands. The preference is a subset of the brands available (i.e $1$ to $6$). Also, the customer will buy the $K^{th}$ costliest phone among all the phones of his preference.
You will be asked $Q$ queries. Each query consists of the preference of the customer and $K$.
Find the price the customer has to pay for his preference. If no such phone is available, print $-1$
Note that for each query the total number of smartphones is always $N$ since, after each purchase, the phones are replaced instantly.
-----Input:-----
- First Line contains $N$ and $Q$
- Second-line contains $N$ integers $P_1,P_2,...,P_N$ (Price)
- Third line contains $N$ integers $B_1,B_2,...,B_N$ (Brand)
- Each of the next Q lines contains a query, the query is describes below
- First line of each quey contains $b$ and $K$ where $b$ is the size of the preference subset.
- Second line of each query contains $b$ integers, describing the preference subset.
-----Output:-----
For each query, print the price to be paid.
-----Constraints-----
- $1 \leq N, Q, P_i \leq 10^5$
- $1 \leq B_i, b \leq 6$
- $1 \leq K \leq N$
-----Sample Input:-----
4 2
4 5 6 7
1 2 3 4
3 3
1 2 3
3 4
4 5 6
-----Sample Output:-----
4
-1
-----Explaination-----
Query 1: The preference subset is {1, 2, 3}, The prices of phones available of these brands are {4, 5, 6}. The third costliest phone is 4.
Query 2: The preference subset is {4, 5, 6}, The prices of phones available of these brands are {7}.
Fouth costliest phone is required, which is not available. Hence, answer is $-1$. | ["import sys\r\nfrom collections import defaultdict\r\nfrom copy import copy\r\n\r\nR = lambda t = int: t(eval(input()))\r\nRL = lambda t = int: [t(x) for x in input().split()]\r\nRLL = lambda n, t = int: [RL(t) for _ in range(n)]\r\n\r\ndef solve():\r\n N, Q = RL()\r\n P = RL()\r\n B = RL()\r\n phones = sorted(zip(P, B))\r\n S = defaultdict(lambda : [])\r\n \r\n for p, b in phones:\r\n for i in range(2**7):\r\n if (i>>b) & 1:\r\n S[i] += [p]\r\n B = set(B)\r\n I = [0] * len(B)\r\n\r\n for _ in range(Q):\r\n b, K = RL()\r\n s = RL()\r\n x = 0\r\n for b in s:\r\n x += 1<<b\r\n if len(S[x]) < K:\r\n print(-1)\r\n else:\r\n print(S[x][-K])\r\n \r\n\r\nT = 1#R()\r\nfor t in range(1, T + 1):\r\n solve()\r\n", "from itertools import combinations\r\n\r\nps = []\r\nfor i in range(1, 6+1):\r\n ps.extend(combinations(list(range(6)), i))\r\n\r\nn, q = list(map(int, input().split()))\r\np = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\n\r\nx = [[] for _ in range(6)]\r\n\r\nfor i, j in zip(p, b):\r\n x[j-1].append(i)\r\n\r\nts = {i: sorted(sum((x[j] for j in i), []), reverse=True) for i in ps}\r\n\r\nfor _ in range(q):\r\n t, k = list(map(int, input().split()))\r\n f = tuple([int(x) - 1 for x in input().split()])\r\n\r\n try:\r\n print(ts[f][k-1])\r\n except:\r\n print(-1)\r\n"] | {"inputs": [["4 2", "4 5 6 7", "1 2 3 4", "3 3", "1 2 3", "3 4", "4 5 6"]], "outputs": [["4", "-1"]]} | INTERVIEW | PYTHON3 | CODECHEF | 1,506 | |
25adc821fb367e5e0a63a5753adec539 | UNKNOWN | Chef played an interesting game yesterday. This game is played with two variables $X$ and $Y$; initially, $X = Y = 0$. Chef may make an arbitrary number of moves (including zero). In each move, he must perform the following process:
- Choose any positive integer $P$ such that $P \cdot P > Y$.
- Change $X$ to $P$.
- Add $P \cdot P$ to $Y$.
Unfortunately, Chef has a bad memory and he has forgotten the moves he made. He only remembers the value of $X$ after the game finished; let's denote it by $X_f$. Can you tell him the maximum possible number of moves he could have made in the game?
-----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 $X_f$.
-----Output-----
For each test case, print a single line containing one integer — the maximum number of moves Chef could have made.
-----Constraints-----
- $1 \le T \le 10^5$
- $1 \le X_f \le 10^9$
-----Example Input-----
3
3
8
9
-----Example Output-----
3
5
6
-----Explanation-----
Example case 2: One possible sequence of values of $X$ is $0 \rightarrow 1 \rightarrow 2 \rightarrow 3 \rightarrow 5 \rightarrow 8$. | ["from math import sqrt\n\nT = int(input())\nans = []\n\nfor _ in range(T):\n X = int(input())\n\n count = 0\n x = 0\n y = 0\n while(x<=X):\n p = int(sqrt(y))\n count += 1\n if(p*p>y):\n x = p\n y += p**2\n else:\n x = p+1\n y += (p+1)**2\n if(x<=X):\n ans.append(count)\n else:\n ans.append(count-1)\n\nfor i in ans:\n print(i)", "# cook your dish here\nimport math\nt = int(input())\nfor _ in range(t):\n xf = int(input())\n ans = 0\n x,y = 0,0\n while x<=xf:\n p = int(math.sqrt(y))\n if p*p>y:\n x = p\n y = y + p*p\n ans = ans + 1\n else:\n x = p+1\n y = y + (p+1)*(p+1)\n ans = ans + 1\n if x<=xf:\n print(ans)\n else:\n print(ans-1)", "# cook your dish here\nimport math\nT=int(input())\nfor i in range(T):\n x=int(input())\n temp,count,y=0,0,0\n p=0\n while(temp<=x):\n p=int(math.sqrt(y))\n if(p*p>y):\n temp=p\n y+=p*p\n count+=1\n else:\n p+=1\n temp=p\n y+=p*p\n count+=1\n if(temp>x):\n print(count-1)\n elif(temp<=x):\n print(count)", "# cook your dish here\nimport math\nT=int(input())\nfor i in range(T):\n x=int(input())\n temp,count,y=0,0,0\n p=0\n while(temp<=x):\n p=int(math.sqrt(y))\n if(p*p>y):\n temp=p\n y+=p*p\n count+=1\n else:\n p+=1\n temp=p\n y+=p*p\n count+=1\n if(temp>x):\n print(count-1)\n elif(temp<=x):\n print(count)", "# cook your dish here\nimport math\ntest=int(input())\nfor _ in range(test):\n last=int(input())\n x=0\n y=0\n c=0\n while True:\n if y>=last*last:\n print(c)\n break\n c+=1\n x=int(math.sqrt(y))+1\n y=y+x*x\n\n\n\n", "# cook your dish here\nimport math\ntest=int(input())\nfor _ in range(test):\n last=int(input())\n x=0\n y=0\n c=0\n while True:\n if y>=last*last:\n print(c)\n break\n c+=1\n x=int(math.sqrt(y))+1\n y=y+x*x\n\n\n\n", "# cook your dish here\nimport math\nfor _ in range(int(input())):\n last=int(input())\n x=0\n y=0\n c=0\n while True:\n if y>=last*last:\n print(c)\n break\n c+=1\n x=int(math.sqrt(y))+1\n y=y+x*x\n\n\n\n", "# cook your dish here\nfrom math import ceil\n\nfor i in range(int(input())):\n xf=int(input())\n x=0\n y=0\n p=1\n step=0\n while(x<=xf):\n x=p\n y+=(p*p)\n p=ceil(y**0.5)\n step+=1\n print(step-2) ", "# cook your dish here\nfrom math import ceil\n\nfor i in range(int(input())):\n xf=int(input())\n x=0\n y=0\n p=1\n step=0\n while(x<=xf):\n x=p\n y+=(p*p)\n p=ceil(y**0.5)\n step+=1\n print(step-2) ", "from math import sqrt, ceil\nimport time\nfrom bisect import bisect_right\nstart_time = time.time()\n\na = []\nx = 0\ny = 0\nwhile x <= 10 ** 9:\n x = int(sqrt(y))+1\n a.append(x)\n y += x * x\n\nend_time = time.time()\n# print(end_time - start_time)\n\n# print(len(a))\n# print(a)\n# print(b)\nfor _ in range(int(input())):\n n = int(input())\n print(bisect_right(a,n))\n \n \n \n", "from math import ceil\n\nfor i in range(int(input())):\n xf=int(input())\n x=0\n y=0\n p=1\n step=0\n while(x<=xf):\n x=p\n y+=(p*p)\n p=ceil(y**0.5)\n step+=1\n print(step-2) ", "# cook your dish here\nimport math\nt = int(input())\nfor i in range(t):\n n = int(input())\n num,x,y,count = 1,0,0,0\n while(num * num > y and num <= n):\n y = y + num*num\n x = num\n count += 1\n num = math.floor(math.sqrt(y))+1\n \n print(count)", "import sys\nimport math\ninput=sys.stdin.readline\nfor _ in range(int(input())):\n n=int(input())\n x=0\n y=0\n ans=0\n while x<=n:\n z=int(math.sqrt(y))\n z+=1\n y+=(z*z)\n x=z\n ans+=1\n print(ans-1)", "import math\nt = int(input())\nfor T in range(t):\n xf = int(input())\n x, y = 0, 0\n p = 1\n val = 0\n while(x <= xf):\n x = p\n y += (p * p)\n p = math.ceil(math.sqrt(y))\n val += 1\n print(val - 2)", "\nimport math\nt = int(input())\nfor T in range(t):\n xf = int(input())\n x, y = 0, 0\n p = 1\n val = 0\n while(x <= xf):\n x = p\n y += (p * p)\n p = math.ceil(math.sqrt(y))\n val += 1\n print(val - 2)", "import sys\nfrom math import sqrt\ntry: \n sys.stdin=open('inp.txt','r')\nexcept: pass\ndef helper():\n pass\nt=int(input())\nfor _ in range(t):\n n=int(input())\n x=0\n y=0\n k=0\n while x<=n:\n a=int(sqrt(y))\n a+=1\n x=a\n y+=(a*a)\n k+=1\n print(k-1)", "# cook your dish here\nimport math\nt = int(input())\nwhile(t):\n n = int(input())\n res = 0\n x = 0\n y = 0\n while(x <= n):\n tmp = int(math.sqrt(y))\n tmp += 1\n y += tmp * tmp\n x = tmp\n res += 1\n \n print(res - 1)\n \n t -= 1", "# cook your dish here\nimport math\nl=[0,1,2,3,4,6,9,13]\ns=316\nwhile l[-1]<10**9:\n l.append(math.floor(math.sqrt(s))+1)\n s+=l[-1]**2\n#print(l)\nn=int(input())\nwhile n>0:\n n-=1\n a=int(input())\n c=0\n for i in l:\n if i<=a:\n c+=1\n else:\n break\n print(c-1)\n \n \n", "for _ in range(int(input())):\n num = int(input())\n \n moves = 0\n x,y = 0,0\n \n while x<=num:\n x = int(y**0.5)+1\n y += x*x\n moves += 1\n\n print(moves-1)\n", "import math\nfor _ in range(int(input())):\n tt=int(input())\n x=y=moves=0\n while x<tt and y<(tt**2):\n x=math.floor(math.sqrt(y))+1\n y=y+x**2\n moves+=1 \n print(moves)", "import math\ndef binarySearch (arr, l, r, x):\n mid = (l+r)//2\n if arr[mid] == x: \n return mid\n elif arr[mid] > x: \n return binarySearch(arr, l, mid-1, x) \n elif (arr[mid]<x and arr[mid+1]>x):\n return mid\n else: \n return binarySearch(arr, mid + 1, r, x)\n\ndef vceil(k):\n if(math.ceil(k)==k):\n return int(k+1)\n else:\n return math.ceil(k)\ndp=[1]\ni=1\nsum=0\nwhile(i<=10**9):\n sum+=i**2\n i=math.sqrt(sum)\n i=vceil(i)\n dp.append(i)\n\nt=int(input())\nfor _ in range(t):\n n=int(input())\n ans=binarySearch(dp, 0, len(dp), n)\n ans=ans+1\n print(ans)\n", "from math import sqrt\nfor _ in range(int(input())):\n n=int(input())\n j=0\n x,y=0,0\n k=0\n while(x!=n):\n j+=1\n if(j<=n):\n x=j\n if(y>=j*j):\n j=int(sqrt(y))\n continue\n if(y+j*j<n*n and x!=n):\n y+=j*j\n else:\n x=n\n k+=1\n print(k)\n"] | {"inputs": [["3", "3", "8", "9"]], "outputs": [["3", "5", "6"]]} | INTERVIEW | PYTHON3 | CODECHEF | 5,837 | |
1e46ea42bb815d2decbcb2ffd0d7c6cc | UNKNOWN | The EEE classes are so boring that the students play games rather than paying attention during the lectures. Harsha and Dubey are playing one such game.
The game involves counting the number of anagramic pairs of a given string (you can read about anagrams from here). Right now Harsha is winning. Write a program to help Dubey count this number quickly and win the game!
-----Input-----
The first line has an integer T which is the number of strings. Next T lines each contain a strings. Each string consists of lowercase english alphabets only.
-----Output-----
For each string, print the answer in a newline.
-----Constraints-----
- 1 ≤ T ≤ 1000
- 1 ≤ length of each string ≤ 100
-----Example-----
Input:
3
rama
abba
abcd
Output:
2
4
0
-----Explanation-----
rama has the following substrings:
- r
- ra
- ram
- rama
- a
- am
- ama
- m
- ma
- a
Out of these, {5,10} and {6,9} are anagramic pairs.
Hence the answer is 2.
Similarly for other strings as well. | ["def sort_str(s):\n o = []\n for c in s:\n o.append(c)\n o.sort()\n return \"\".join(o)\ndef find_ana(s):\n if len(s) <= 1:\n return 0\n h = {}\n c = 0\n for i in range(len(s)):\n for j in range(i+1, len(s)+1):\n t = sort_str(s[i:j])\n if t in h:\n c += h[t]\n h[t] += 1\n else:\n h[t] = 1\n return c\nt = int(input())\nfor _ in range(t):\n print(find_ana(input()))"] | {"inputs": [["3", "rama", "abba", "abcd"]], "outputs": [["2", "4", "0"]]} | INTERVIEW | PYTHON3 | CODECHEF | 478 | |
a880f26667dee2eac7d8aae10b859fe6 | UNKNOWN | It's the annual military parade, and all the soldier snakes have arrived at the parade arena, But they aren't standing properly. The entire parade must be visible from the main podium, and all the snakes must be in a line. But the soldiers are lazy, and hence you must tell the soldiers to move to their new positions in such a manner that the total movement is minimized.
Formally, the entire parade strip can be thought of as the integer line. There are N snakes, where each snake is a line segment of length L. The i-th snake is initially at the segment [Si, Si + L]. The initial positions of the snakes can overlap. The only segment of the strip visible from the podium is [A, B], and hence all the snakes should be moved so that all of them are visible from the podium. They should also all be in a line without gaps and every consecutive pair touching each other. In other words, they should occupy the segments [X, X + L], [X + L, X + 2*L], ... , [X + (N-1)*L, X + N*L], for some X, such that A ≤ X ≤ X + N*L ≤ B. You are guaranteed that the visible strip is long enough to fit all the snakes.
If a snake was initially at the position [X1, X1 + L] and finally is at the position [X2, X2 + L], then the snake is said to have moved a distance of |X2 - X1|. The total distance moved by the snakes is just the summation of this value over all the snakes. You need to move the snakes in such a manner that it satisfies all the conditions mentioned above, as well as minimize the total distance. You should output the minimum total distance achievable.
-----Input-----
- The first line contains a single integer, T, the number of testcases. The description of each testcase follows.
- The first line of each testcase contains four integers, N, L, A and B, where N denotes the number of snakes, L denotes the length of each snake, and [A, B] is the segment visible from the podium.
- The next line contains N integers, the i-th of which is Si. This denotes that the i-th snake is initially in the segment [Si, Si + L].
-----Output-----
- For each testcase, output a single integer in a new line: the minimum total distance achievable.
-----Constraints-----
- 1 ≤ T ≤ 10
- 1 ≤ N ≤ 105
- 1 ≤ Si ≤ 109
- 1 ≤ L ≤ 109
- 1 ≤ A ≤ B ≤ 109
- N * L ≤ B - A
-----Example-----
Input:
2
3 4 11 23
10 11 30
3 4 11 40
10 11 30
Output:
16
16
-----Explanation-----
In the first testcase, the three snakes are initially at segments [10, 14], [11, 15], and [30, 34]. One optimal solution is to move the first snake which was at [10, 14] to [15, 19] and the third snake which was at [30, 34] to [19, 23]. After this, the snakes would form a valid parade because they will be from [11, 15], [15, 19] and [19, 23]. Hence they are all in a line without any gaps in between them, and they are all visible, because they all lie in the visible segment, which is [11, 23].
The distance traveled by the first snake is |15 - 10| = 5, by the second snake is |11 - 11| = 0 and by the third snake is |19 - 30| = 11. Hence the total distance traveled is 5 + 0 + 11 = 16. This is the best that you can do, and hence the answer is 16.
In the second testcase, only the visible segment has increased. But you can check that the same final configuration as in the first subtask is still optimal here. Hence the answer is 16. | ["t=int(input())\n \ndef vsense(val,a,l):\n sense=0\n ctr=a\n for c in range(n):\n if val[c]<=ctr:\n sense+=-1\n else:\n sense+=1\n ctr+=l\n return sense\n \nwhile t:\n n,l,a,b=list(map(int,input().split()))\n val=list(map(int,input().split()))\n val.sort()\n sense=0\n if b==a+n*l or vsense(val,a,l)<=0:\n loc=a\n else:\n st=a\n end=b-n*l\n while st<=end:\n m=(st+end)/2\n chk=vsense(val,m,l)\n if chk==0:\n loc=m\n break\n elif chk<0:\n end=m-1\n else:\n loc=m\n st=m+1\n ans=0\n st=loc\n for c in range(n):\n ans+=abs(st-val[c])\n st+=l\n print(ans)\n \n t-=1\n", "T = eval(input())\ndef diff(seqA, seqB):\n d = 0\n for i in range(len(seqA)):\n d += abs(seqA[i]- seqB[i])\n return d\ndef gen_seq(start, L, N):\n return [start + i*L for i in range(N)]\n\n\ndef binSearch(s,e,ll,L,N):\n # find the middle item\n if s==e:\n return diff(ll,gen_seq(s,L,N))\n\n mid = int((s+e)/2)\n if diff(ll,gen_seq(mid,L,N)) > diff(ll,gen_seq(mid+1,L,N)):\n # we go left \n return binSearch(mid+1,e,ll,L,N)\n else:\n return binSearch(s,mid,ll,L,N)\n #we go right\n\n\n\n\nwhile T>0:\n T-=1\n\n N,L,A,B = list(map(int,input().split()))\n ll = list(map(int,input().split()))\n ll = sorted(ll)\n\n lastpossible = B - L\n startA = A\n\n # the one for which the last one remains there in range \n lastA = int((B-L) - (N-1)*L)\n # print \"N %d L %d A %d B %d\" % (N,L,A,B)\n # print \"startA %d, lastA %d\" %(startA,lastA)\n # print(lastA - startA)/(1.0*L)\n\n seq_cost_beg = diff(ll,gen_seq(startA,L,N)) \n seq_cost_end = diff(ll,gen_seq(lastA,L,N)) \n\n\n # print min(seq_cost_beg, seq_cost_end)\n\n print(binSearch(startA,lastA,ll,L,N))\n\n\n\n\n # for j in range(startA,lastA+1):\n # leg_seq = gen_seq(j,L,N)\n # print ll,leg_seq,diff(ll,leg_seq) \n # print \"-------------\"\n"] | {"inputs": [["2", "3 4 11 23", "10 11 30", "3 4 11 40", "10 11 30"]], "outputs": [["16", "16"]]} | INTERVIEW | PYTHON3 | CODECHEF | 1,815 | |
5160d01afeb8f8565d50dc8c3f0c9eb4 | UNKNOWN | Eugene loves sequences, especially arithmetic progressions. One day he was asked to solve a difficult problem.
If a sequence of numbers A1, A2, ... , AN form an arithmetic progression A, he was asked to calculate sum of F(Ai), for L ≤ i ≤ R.
F(X) is defined as:
If X < 10 then F(X) = X.
Else F(X) = F(sum_of_digits(X)).
Example:
F(1378) =
F(1+3+7+8) =
F(19) =
F(1 + 9) =
F(10) =
F(1+0) =
F(1) = 1
-----Input-----
- The first line of the input contains an integer T denoting the number of test cases.
- Each test case is described in one line containing four integers: A1 denoting the first element of the arithmetic progression A, D denoting the common difference between successive members of A, and L and R as described in the problem statement.
-----Output-----
- For each test case, output a single line containing one integer denoting sum of F(Ai).
-----Constraints-----
- 1 ≤ T ≤ 105
- 1 ≤ A1 ≤ 109
- 0 ≤ D ≤ 109
- 1 ≤ R ≤ 1018
- 1 ≤ L ≤ R
-----Subtasks-----
- Subtask 1: 0 ≤ D ≤ 100, 1 ≤ A1 ≤ 109, 1 ≤ R ≤ 100 - 15 points
- Subtask 2: 0 ≤ D ≤ 109, 1 ≤ A1 ≤ 109, 1 ≤ R ≤ 106 - 25 points
- Subtask 3: Original constraints - 60 points
-----Example-----
Input:
2
1 1 1 3
14 7 2 4
Output:
6
12
-----Explanation-----
Example case 1.
A = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10, ...}
A1 = 1
A2 = 2
A3 = 3
F(A1) = 1
F(A2) = 2
F(A3) = 3
1+2+3=6
Example case 2.
A = {14, 21, 28, 35, 42, 49, 56, 63, 70, 77, ...}
A2 = 21
A3 = 28
A4 = 35
F(A2) = 3
F(A3) = 1
F(A4) = 8
3+1+8=12 | ["\n\nimport fractions\nimport sys\n\nf = sys.stdin\n\nif len(sys.argv) > 1:\n f = open(sys.argv[1], \"rt\")\n\n\nsum_cache = {}\n\ndef sum_func(x):\n if x < 10:\n return x\n\n r = sum_cache.get(x)\n if r is not None:\n return r\n\n xx = 0\n while x > 0:\n xx += x % 10\n x /= 10\n\n r = sum_func(xx)\n sum_cache[x] = r\n\n return r\n\ndef test():\n for n in range(1):\n print(n, sum_func(n))\n\n print(sum_func(int(10**18 - 1)))\n\n#~ test()\n#~ sys.exit(1)\n\ncycle_table = [\n # Cycle len, markers # D_kfunc\n [9, [1, 1, 1, 1, 1, 1, 1, 1, 1]], # 1\n [9, [1, 1, 1, 1, 1, 1, 1, 1, 1]], # 2\n [3, [1, 0, 0, 1, 0, 0, 1, 0, 0]], # 3\n [9, [1, 1, 1, 1, 1, 1, 1, 1, 1]], # 4\n [9, [1, 1, 1, 1, 1, 1, 1, 1, 1]], # 5\n [3, [1, 0, 0, 1, 0, 0, 1, 0, 0]], # 6\n [9, [1, 1, 1, 1, 1, 1, 1, 1, 1]], # 7\n [9, [1, 1, 1, 1, 1, 1, 1, 1, 1]], # 8\n [1, [1, 0, 0, 0, 0, 0, 0, 0, 0]], # 9\n]\n\nNUMBER = 9\n\ndef calc(A_1, D, L, R):\n #~ print('calc ===', A_1, D, L, R)\n A_L = A_1 + D * (L - 1)\n A_L_kfunc = sum_func(A_L)\n D_kfunc = sum_func(D)\n\n #~ print(A_L, A_L_kfunc, D_kfunc)\n\n n = R - L + 1\n\n if D == 0:\n return n * A_L_kfunc\n\n cycle_len = cycle_table[D_kfunc - 1][0]\n cycle_markers = list(cycle_table[D_kfunc - 1][1]) # copy\n #~ print('cycle_len', cycle_len)\n\n whole_part = n // cycle_len\n remainder = n % cycle_len\n #~ print('whole_part, remainder = ', whole_part, remainder)\n\n counts = [whole_part * x for x in cycle_markers]\n #~ print(counts)\n\n pos = 0\n for i in range(remainder):\n counts[pos] += 1\n pos = (pos + D_kfunc) % NUMBER\n\n #~ print(counts)\n\n r = 0\n for i, x in enumerate(counts):\n value = (A_L_kfunc - 1 + i) % NUMBER + 1\n r += value * x\n\n return r\n\ndef calc_dumb(A_1, D, L, R):\n #~ print('dumb ===', A_1, D, L, R)\n a = A_1 + D * (L - 1)\n\n n = R - L + 1\n\n r = 0\n\n for i in range(n):\n value = sum_func(a)\n #~ print(a, value)\n r += value\n a += D\n\n return r\n\ndef test1():\n a1 = 1\n L = 1\n R = 1000\n for d in range(100):\n r1 = calc_dumb(a1, d, L, R)\n r2 = calc(a1, d, L, R)\n if r1 != r2:\n print(a1, d, L, R, \":\", r1, r2)\n\n\ndef test2():\n a1 = 1\n d = 9\n L = 1\n R = 9\n r1 = calc_dumb(a1, d, L, R)\n r2 = calc(a1, d, L, R)\n print(r1, r2)\n\n#~ test1()\n#~ sys.exit(1)\n\nT = int(f.readline().strip())\n\nfor case_id in range(1, T+1):\n A_1, D, L, R = list(map(int, f.readline().strip().split()))\n\n r = calc(A_1, D, L, R)\n\n print(r)\n", "import math\ndef check(n):\n\tif n<9:\n\t\treturn n\n\telse:\n\t\tans = n%9\n\t\tif ans==0:\n\t\t\treturn 9\n\t\treturn ans\t\t\n\nt = int(input())\nwhile t>0:\n\tt -= 1\n\tsum = 0\n\ta,d,l,r = input().split()\n\ta,d,l,r = int(a),int(d),int(l),int(r)\n\tdig = r-l+1\n\tmod = dig%9\n\tdiv = int(dig/9)\n\tnth = a+(l-1)*d \n\tnth = check(nth)\n\ttemp = 0\n\tfor i in range(l,min(l+8,r)+1):\n\t\ttemp += 1\n\t\tmul = 0 if temp>mod else 1\n\t\tsum += nth*(div+mul)\n\t\tnth = check(nth+d)\n\tprint(int(sum))", "t=int(input())\nwhile t>0:\n\tt=t-1\n\ta,d,l,r = list(map(int,input().split()))\n\ts=0\n\tp=a+(l-1)*d\n\tfor i in range (0,r-l+1):\n\t\tif 1<=l<=r:\n\t\t\tif p<9:\n\t\t\t\tq=p\n\t\t\telse:\n\t\t\t\tq=((p-1)%9)+1\n\t\t\ts=s+q\n\t\t\tp=p+d\n\tprint(s)\t", "\ncases = int(input())\n\nfor i in range(cases):\n a1, d, uG, oG = list(map(int, input().split()))\n a1 = a1 %9 if a1 %9 != 0 else 9\n d = d %9 if d %9 != 0 else 9\n sum_of = 0\n rest_of = 0\n q = (a1 +d *(uG -1)) %9 if (a1 +d *(uG -1)) %9 !=0 else 9\n q1 = q\n k = (oG - uG) %9\n f = int((oG - uG) /9)\n \n for j in range(uG, uG +9):\n sum_of += q\n q += d\n q = q %9 if q %9 != 0 else 9\n \n for k in range(uG, uG +k +1):\n rest_of += q1\n q1 += d\n q1 = q1 %9 if q1 %9 != 0 else 9\n\n print(sum_of *f +rest_of)\n", "def findRemainigSum(start,digitSum,upTo):\n sum=0\n currSum=findSumOfDigits(start)\n for i in range(0,upTo):\n sum+=findSumOfDigits(currSum)\n currSum=findSumOfDigits(currSum+digitSum)\n return sum\ndef findSumOfDigits(num):\n if(num%9 == 0)and(num != 0):\n return 9\n else:\n return num%9\nt=int(input())\nwhile(t):\n inputString=input()\n inputList=inputString.split()\n a=int(inputList[0])\n d=int(inputList[1])\n l=int(inputList[2])\n r=int(inputList[3])\n sum=0\n diff=r-l+1\n lDigitSum=findSumOfDigits(a+(l-1)*d)\n dDigitSum=findSumOfDigits(d)\n if(dDigitSum==9 or dDigitSum==0):\n sum=lDigitSum*diff\n \n else:\n if(dDigitSum==3 or dDigitSum==6):\n n1=lDigitSum\n n2=findSumOfDigits(lDigitSum+dDigitSum)\n n3=findSumOfDigits(n2+dDigitSum)\n sum=(int(diff/3))*(n1+n2+n3)+findRemainigSum(lDigitSum,dDigitSum,diff%3)\n else:\n sum=(int(diff/9))*45+findRemainigSum(lDigitSum,dDigitSum,diff%9)\n print(sum)\n t-=1 ", "t=int(input())\nwhile t:\n par=[int(i) for i in input().split(' ')]\n a,d,l,r=par[0],par[1],par[2],par[3]\n elem_array=[]\n cycle_sum=0\n for i in range(0,9):\n elem_array.append(1+(a+i*d-1)%9)\n cycle_sum=cycle_sum+elem_array[i]\n ans=0\n if r-l>8:\n total_cycle=(r-l+1)/9\n ans=ans+cycle_sum*total_cycle\n l=l+(total_cycle)*9\n while l<=r:\n ans=ans+elem_array[(l-1)%9]\n l=l+1\n elif r-l==8:\n ans=cycle_sum\n else:\n while l<=r:\n ans=ans+elem_array[(l-1)%9]\n l=l+1\n print(ans)\n t-=1\n\n \n \n \n ", "def f(x):\n if(x%9==0):\n return 9\n else:\n return x%9\nt=int(input())\nfor i in range(t):\n ran=input().split()\n ran=list(map(int,ran))\n a=ran[0]\n d=ran[1]\n l=ran[2]\n r=ran[3]\n s=0\n a=a+(l-1)*d\n for j in range(l,r+1):\n s+=f(a)\n a+=d\n print(s)\n\n \n ", "def turn(n):\n if n%9==0:\n return 9\n else:\n return (n%9)\n\nt=eval(input())\nwhile t>0:\n a,d,l,r=list(map(int,input().split()))\n diff=turn(d)\n s=0\n box=[]\n box.append(0)\n for i in range(1,10):\n box.insert(i,turn(a))\n a=a+diff\n\n for i in range(l,r+1):\n index=turn(i)\n s+=box[index]\n\n print(s)\n t=t-1\n \n", "def turn(n):\n if n%9==0:\n return 9\n else:\n return (n%9)\n\nt=eval(input())\nwhile t>0:\n a,d,l,r=list(map(int,input().split()))\n diff=turn(d)\n s=0\n box=[]\n box.append(0)\n for i in range(1,10):\n box.insert(i,turn(a))\n a=a+diff\n\n for i in range(l,r+1):\n index=turn(i)\n s+=box[index]\n\n print(s)\n t=t-1\n \n", "def findRemainigSum(start,digitSum,upTo):\n sum=0\n currSum=findSumOfDigits(start)\n for i in range(0,upTo):\n sum+=findSumOfDigits(currSum)\n currSum=findSumOfDigits(currSum+digitSum)\n return sum\ndef findSumOfDigits(num):\n if(num%9 == 0)and(num != 0):\n return 9\n else:\n return num%9\nt=int(input())\nwhile(t):\n inputString=input()\n inputList=inputString.split()\n a=int(inputList[0])\n d=int(inputList[1])\n l=int(inputList[2])\n r=int(inputList[3])\n sum=0\n diff=r-l+1\n lDigitSum=findSumOfDigits(a+(l-1)*d)\n dDigitSum=findSumOfDigits(d)\n if(dDigitSum==9):\n sum=lDigitSum*diff\n else:\n if(dDigitSum==3 or dDigitSum==6):\n n1=lDigitSum\n n2=findSumOfDigits(lDigitSum+dDigitSum)\n n3=findSumOfDigits(n2+dDigitSum)\n sum=(int(diff/3))*(n1+n2+n3)+findRemainigSum(lDigitSum,dDigitSum,diff%3)\n else:\n sum=(int(diff/9))*45+findRemainigSum(lDigitSum,dDigitSum,diff%9)\n print(sum)\n t-=1 ", "for _ in range(eval(input())):\n\ta, d, l, r=list(map(int, input().split()))\n\tal=a+(l-2)*d\n\ts = 0\n\tfor i in range(l,r+1):\n\t\tal+=d\n\t\ts+=al%9*1 or 9\n\tprint(s)\n\t\t\t", "def f(n):\n\tif n<10:\n\t\treturn n\n\telse:\n\t\tsum=0\n\t\ttemp =n\n\t\twhile(temp):\n\t\t\tsum+=temp%10\n\t\t\ttemp/=10\n\t\tif(sum<10):\n\t\t\treturn sum\n\t\telse:\n\t\t\treturn f(sum)\nt = int(input())\nwhile(t):\n a,d,l,r =list(map(int, input().split()))\n ap =[]\n ap.append(f(a+(l-1)*d))\n for i in range(1,9):\n ap.append(f(ap[i-1]+d))\n temp = int((r-l+1)/9)\n ans=0\n for i in range(0,9):\n ans+=(ap[i]*temp)\n temp =(r-l+1)%9\n for i in range(0,temp):\n ans+=ap[i]\n print(ans)\n t-=1", "import math\n \ndef f(x):\n if x<10:\n return x\n n = 0\n while x>0:\n n+=x%10\n x/=10\n return f(n)\n \ndef ans(a,d,n):\n s = 0\n if d==0:\n print(a*n)\n elif d==1 or d==2 or d==4 or d==5 or d==7 or d==8:\n if n<9:\n while n>0:\n s = s+a\n a = f(a+d)\n n = n-1\n print(s)\n else:\n x = 9\n while x>0:\n s = s+a\n a = f(a+d)\n x = x-1\n s = s*int(n/9)\n n = n%9\n while n>0:\n s = s+a\n a = f(a+d)\n n = n-1\n print(s)\n elif d==3 or d==6:\n if n<3:\n while n>0:\n s = s+a\n a = f(a+d)\n n = n-1\n print(s)\n else:\n x = 3\n while x>0:\n s = s+a\n a = f(a+d)\n x = x-1\n s = s*int(n/3)\n n = n%3\n while n>0:\n s = s+a\n a = f(a+d)\n n = n-1\n print(s)\n else:\n if a==0:\n print(9*(n-1))\n else:\n print(a*n)\n\nt = int(input())\nwhile t>0:\n a,d,l,r = list(map(int,input().split(' ')))\n n = r-l+1\n a = a+(l-1)*d\n a = f(a)\n d = f(d)\n ans(a,d,n)\n t-=1 "] | {"inputs": [["2", "1 1 1 3", "14 7 2 4", "", ""]], "outputs": [["6", "12"]]} | INTERVIEW | PYTHON3 | CODECHEF | 10,277 | |
3b6f9bc47edbe6a10b0f48f92c1fb697 | UNKNOWN | Tomya is a girl. She loves Chef Ciel very much.
Today, too, Tomya is going to Ciel's restaurant.
Of course, Tomya would like to go to Ciel's restaurant as soon as possible.
Therefore Tomya uses one of the shortest paths from Tomya's house to Ciel's restaurant.
On the other hand, Tomya is boring now to use the same path many times.
So Tomya wants to know the number of shortest paths from Tomya's house to Ciel's restaurant.
Your task is to calculate the number under the following assumptions.
This town has N intersections and M two way roads.
The i-th road connects from the Ai-th intersection to the Bi-th intersection, and its length is
Ci.
Tomya's house is in the 1st intersection, and Ciel's restaurant is in the N-th intersection.
-----Input-----
The first line contains an integer T, the number of test cases.
Then T test cases follow.
The first line of each test case contains 2 integers N, M.
Then next M lines contains 3 integers denoting Ai, Bi and Ci.
-----Output-----
For each test case, print the number of shortest paths from Tomya's house to Ciel's restaurant.
-----Constraints-----
1 ≤ T ≤ 10
2 ≤ N ≤ 10
1 ≤ M ≤ N ∙ (N – 1) / 2
1 ≤ Ai, Bi ≤ N
1 ≤ Ci ≤ 10
Ai ≠ Bi
If i ≠ j and Ai = Aj, then Bi ≠ Bj
There is at least one path from Tomya's house to Ciel's restaurant.
-----Sample Input-----
2
3 3
1 2 3
2 3 6
1 3 7
3 3
1 2 3
2 3 6
1 3 9
-----Sample Output-----
1
2
-----Explanations-----
In the first sample, only one shortest path exists, which is 1-3.
In the second sample, both paths 1-2-3 and 1-3 are the shortest paths. | ["t=eval(input())\ndef func(k,n,x,dist,graph):\n if k==n:\n x+=[dist[n]]\n return\n for i in range(1,n+1):\n if graph[k][i]!=0 and dist[i]==-1:\n dist[i]=dist[k]+graph[k][i]\n func(i,n,x,dist,graph)\n dist[i]=-1\n \nwhile t:\n graph=[[0 for i in range(11)]for j in range(11)]\n v,e=list(map(int,input().split()))\n for i in range(e):\n x,y,w=list(map(int,input().split()))\n graph[x][y]=w\n graph[y][x]=w\n x=[]\n dist=[-1]*(v+1)\n dist[1]=0\n func(1,v,x,dist,graph)\n x.sort()\n val=x[0]\n ans=0\n for i in range(len(x)):\n if val==x[i]:\n ans+=1\n print(ans)\n t-=1\n", "import heapq\n\n\nGraph = []\nN = 0\ndef dijkstras():\n Q = []\n visitedCount = [0]*N\n dist = [float(\"inf\")]*N\n heapq.heappush(Q, tuple([0, 0]) )\n dist[0] = 0\n visitedCount[0] = 1\n while len(Q) > 0:\n curDist, curNode = heapq.heappop(Q)\n for (nextNode, weight) in Graph[curNode]:\n nextDist = curDist + weight\n if nextDist == dist[nextNode]:\n visitedCount[nextNode] += visitedCount[curNode]\n elif nextDist < dist[nextNode]:\n visitedCount[nextNode] = visitedCount[curNode]\n dist[nextNode] = nextDist\n heapq.heappush(Q, (nextDist, nextNode))\n\n return visitedCount[N-1]\n\ndef main():\n nonlocal N\n nonlocal Graph\n T = int(input())\n for test in range(T):\n N, M = tuple( map(int, input().split()) )\n Graph = []\n for x in range(N): Graph.append([])\n for edge in range(M):\n Ai, Bi, Ci = tuple( map(int, input().split()) )\n Graph[Ai-1].append((Bi-1, Ci))\n Graph[Bi-1].append((Ai-1, Ci))\n\n print(dijkstras())\n\ndef __starting_point():\n main()\n\n__starting_point()"] | {"inputs": [["2", "3 3", "1 2 3", "2 3 6", "1 3 7", "3 3", "1 2 3", "2 3 6", "1 3 9"]], "outputs": [["1", "2"]]} | INTERVIEW | PYTHON3 | CODECHEF | 1,609 | |
90e452788cc8d1cf70b50bb1d383186b | UNKNOWN | It is well-known that the elephants are afraid of mouses. The Little Elephant from the Zoo of Lviv is not an exception.
The Little Elephant is on a board A of n rows and m columns (0-based numeration). At the beginning he is in cell with coordinates (0; 0) and he wants to go to cell with coordinates (n-1; m-1). From cell (x; y) Little Elephant can go either to (x+1; y) or (x; y+1).
Each cell of the board contains either 1 or 0. If A[i][j] = 1, then there is a single mouse in cell (i; j). Mouse at cell (i; j) scared Little Elephants if and only if during the path there was at least one such cell (x; y) (which belongs to that path) and |i-x| + |j-y| <= 1.
Little Elephant wants to find some correct path from (0; 0) to (n-1; m-1) such that the number of mouses that have scared the Little Elephant is minimal possible. Print that number.
-----Input-----
First line contains single integer T - the number of test cases. Then T test cases follow. First line of each test case contain pair of integers n and m - the size of the board. Next n lines contain n strings, each of size m and consisted of digits 0 and 1.
-----Output-----
In T lines print T integer - the answers for the corresponding test.
-----Constraints-----
1 <= T <= 50
2 <= n, m <= 100
-----Example-----
Input:
2
3 9
001000001
111111010
100100100
7 9
010101110
110110111
010011111
100100000
000010100
011011000
000100101
Output:
9
10
-----Explanation-----
Example case 1:
The optimized path is: (0, 0) -> (0, 1) -> (0, 2) -> (0, 3) -> (0, 4) -> (0, 5) -> (0, 6) -> (0, 7) -> (0, 8) -> (1, 8) -> (2, 8). The mouses that scared the Little Elephant are at the following cells: (1, 0), (1, 1), (1, 2), (1, 3), (1, 4), (1, 5), (1, 7), (0, 2), (0, 8).
Example case 2:
The optimized path is: (0, 0) -> (1, 0) -> (1, 1) -> (2, 1) -> (2, 2) -> (3, 2) -> (3, 3) -> (4, 3) -> (4, 4) -> (5, 4) -> (5, 5) -> (6, 5) -> (6, 6) -> (6, 7) -> (6, 8). The 10 mouses that scared the Little Elephant are at the following cells: (0, 1), (1, 0), (1, 1), (2, 1), (3, 3), (4, 4), (5, 4), (5, 5), (6, 6), (6, 8). | ["from collections import defaultdict\nfrom itertools import product\n\ndef solve(mouse,n,m):\n \n # shadow matrix will contains the count of mice which affect (i,j) position\n # if there is a mice at position (i,j) then in shadow matrix it will affect \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0all four adjacent blocks \n shadow=[[0 for i in range(m)]for j in range(n)]\n for i,j in product(list(range(n)),list(range(m))):\n if mouse[i][j]==1:\n if i>0:\n shadow[i-1][j]+=1\n if j>0:\n shadow[i][j-1]+=1\n if i<n-1:\n shadow[i+1][j]+=1\n if j<m-1:\n shadow[i][j+1]+=1\n \n # dp is a dictionary which contains a tuple of 3 values (i,j,0)=>we are \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0coming at destination (i,j) from left side\n # (i,j,1)=> we are coming at destination (i,j) from top \n dp=defaultdict(int)\n \n # \n dp[(0,0,0)]=dp[(0,0,1)]=shadow[0][0]-mouse[0][0]\n \n # fill only first row\n # in first row we can only reach at (0,j) from (0,j-1,0) as we can't come \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0from top.\n \n # so here we will assign count of mices which will affect current cell\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0(shadow[0][i]) + previous result i.e,(0,j-1,0) and \n # if mouse is in the current cell than we have to subtract it bcoz we have \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0add it twice i.e, when we enter at this block \n # and when we leave this block \n for i in range(1,m):\n dp[(0,i,0)]=dp[(0,i,1)]=shadow[0][i]-mouse[0][i]+dp[(0,i-1,0)]\n \n # same goes for first column\n # we can only come at (i,0) from (i-1,0) i.e top\n for i in range(1,n):\n dp[(i,0,0)]=dp[(i,0,1)]=shadow[i][0]-mouse[i][0]+dp[(i-1,0,1)]\n \n \n # for rest of the blocks \n # for a block (i,j) we have to add shadow[i][j] and subtract mouse[i][j] \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0from it for double counting\n # now for each block we have two choices, either take its previous block \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0with same direction or take previous block with different \n # direction and subtract corner double counted mouse. We have to take min of \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0both to find optimal answer\n for i,j in product(list(range(1,n)),list(range(1,m))):\n a=shadow[i][j]-mouse[i][j]\n b=a\n a+=min(dp[(i,j-1,0)],dp[(i,j-1,1)]-mouse[i-1][j])\n b+=min(dp[(i-1,j,1)],dp[(i-1,j,0)]-mouse[i][j-1])\n dp[(i,j,0)]=a\n dp[(i,j,1)]=b\n \n # what if [0][0] and [n-1][m-1] have mice, so we have to add them as we \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0haven't counted them yet.\n \n return min(dp[(n-1,m-1,0)],dp[(n-1,m-1,1)])+mouse[0][0]+mouse[n-1][m-1]\n \nfor _ in range(int(input())):\n n,m=list(map(int,input().split( )))\n mouse=[]\n for i in range(n):\n x=input()\n mouse.append(list(map(int,x)))\n print(solve(mouse,n,m))\n \n \n \n \n \n \n \n \n \n \n", "from collections import defaultdict\nfrom itertools import product\ndef solve(mouse,n,m):\n shadow=[[0 for i in range(m)]for j in range(n)]\n for i,j in product(list(range(n)),list(range(m))):\n if mouse[i][j]==1:\n if i>0:\n shadow[i-1][j]+=1\n if j>0:\n shadow[i][j-1]+=1\n if i<n-1:\n shadow[i+1][j]+=1\n if j<m-1:\n shadow[i][j+1]+=1\n \n dp=defaultdict(int)\n dp[(0,0,0)]=dp[(0,0,1)]=shadow[0][0]-mouse[0][0]\n \n for i in range(1,m):\n dp[(0,i,0)]=dp[(0,i,1)]=shadow[0][i]-mouse[0][i]+dp[(0,i-1,0)]\n \n for i in range(1,n):\n dp[(i,0,0)]=dp[(i,0,1)]=shadow[i][0]-mouse[i][0]+dp[(i-1,0,1)]\n \n for i,j in product(list(range(1,n)),list(range(1,m))):\n a=shadow[i][j]-mouse[i][j]\n b=a\n a+=min(dp[(i,j-1,0)],dp[(i,j-1,1)]-mouse[i-1][j])\n b+=min(dp[(i-1,j,1)],dp[(i-1,j,0)]-mouse[i][j-1])\n dp[(i,j,0)]=a\n dp[(i,j,1)]=b\n \n \n return min(dp[(n-1,m-1,0)],dp[(n-1,m-1,1)])+mouse[0][0]+mouse[n-1][m-1]\n \nfor _ in range(int(input())):\n n,m=list(map(int,input().split( )))\n mouse=[]\n for i in range(n):\n x=input()\n mouse.append(list(map(int,x)))\n print(solve(mouse,n,m))\n \n \n \n \n \n \n \n \n \n \n"] | {"inputs": [["2", "3 9", "001000001", "111111010", "100100100", "7 9", "010101110", "110110111", "010011111", "100100000", "000010100", "011011000", "000100101"]], "outputs": [["9", "10"]]} | INTERVIEW | PYTHON3 | CODECHEF | 4,113 | |
65c1d158e22563fe9ad76c99f3e15844 | UNKNOWN | One day, Chef found a cube which has each of its sides painted in some color out of black, blue, red, green, yellow and orange.
Now he asks you to check if he can choose three sides such that they are pairwise adjacent and painted in the same color.
-----Input-----
- The first line of the input contains an integer T denoting the number of test cases.
- A single line of each test case contains six words denoting the colors of painted sides in the order: front, back, left, right, top and bottom, respectively.
-----Output-----
For each test case, output a single line containing the word "YES" or "NO" (without quotes) corresponding to the answer of the problem.
-----Constraints-----
- 1 ≤ T ≤ 50000
- Each color will be from the list {"black", "blue", "red", "green", "yellow", "orange"}
-----Subtasks-----
Subtask 1: (25 points)
- 1 ≤ T ≤ 12000
- For each test case there will be at most three different colors
Subtask 2: (75 points)
- Original constraints
-----Example-----
Input:
2
blue yellow green orange black green
green yellow green orange black green
Output:
NO
YES
-----Explanation-----
Example case 1.
There are no three sides with the same color.
Example case 2.
In this test case, the front, bottom and left sides are green (see picture). | ["for _ in range(int(input())):\n l=list(map(str,input().split()))\n a=[(1,3,5),(1,3,6),(1,4,5),(1,4,6),(2,3,5),(2,3,6),(2,4,5),(2,4,6)]\n c=0\n for i in a:\n if len(set([l[i[0]-1],l[i[1]-1],l[i[2]-1]]))==1:\n c=1\n break\n if c==1:\n print(\"YES\")\n else:\n print(\"NO\")\n", "# cook your dish here\nfor _ in range(int(input())):\n f, b, l, r, t, d = input().split()\n ans = False\n #front\n if (f == l or f == r) and (f == t or f == d): ans = True\n #back\n if (b == l or b == r) and (b == t or b == d): ans = True\n #top\n if (t == l or t == r) and (t == f or t == b): ans = True\n #down\n if (d == l or d == r) and (d == f or d == b): ans = True\n #left\n if (l == f or l == b) and (l == t or l == d): ans = True\n #right\n if (r == f or r == b) and (r == t or r == d): ans = True\n print(\"YES\" if ans else \"NO\")\n \n", "t=int(input())\nfor j in range(t):\n f,ba,l,r,t,bo=str(input()).split(\" \")\n if(l==f and f==bo):\n print(\"YES\")\n elif(l==f and l==t):\n print(\"YES\")\n elif(l==t and t==ba):\n print(\"YES\")\n elif(l==ba and ba==bo):\n print(\"YES\")\n elif(f==t and t==r):\n print(\"YES\")\n elif(t==ba and ba==r):\n print(\"YES\")\n elif(bo==r and r==f):\n print(\"YES\")\n elif(r==ba and ba==bo):\n print(\"YES\")\n else:\n print(\"NO\")", "indices = [[0,2,4],[0,3,4],[0,2,5],[0,3,5],[1,2,4],[1,3,4],[1,2,5],[1,3,5]]\nfor _ in range(int(input())):\n color = list(map(str,input().split()))\n ans = \"NO\"\n for i in range(8):\n if color[indices[i][0]] == color[indices[i][1]] == color[indices[i][2]]:\n ans =\"YES\"\n break\n print(ans)\n", "# cook your dish here\nt=int(input())\nfor z in range(t):\n d=list(input().split())\n front, back, left, right, top, bottom=d[0],d[1],d[2],d[3],d[4],d[5] \n if (front==left or front==right) and (front==top or front==bottom):\n print('YES')\n elif (back==left or back==right) and (back==top or back==bottom):\n print('YES')\n else:\n print('NO')", "t=int(input())\nfor _ in range(t):\n s=input().split()\n d={}\n for i in range(6):\n try:\n d[s[i]].append(i)\n except:\n d[s[i]]=[i]\n flag=False\n for i in list(d.keys()):\n if len(d[i])>=3:\n if 0 in d[i] or 1 in d[i]:\n if (3 in d[i] or 2 in d[i]) and (4 in d[i] or 5 in d[i]):\n flag=True\n break\n \n\n if flag:\n print('YES')\n else:\n print('NO')\n \n \n", "# cook your dish here\nt = int(input())\nfor _ in range(t):\n s = input().split(' ')\n flag = 0\n if(s[0]==s[2]):\n if(s[0]==s[4] or s[0]==s[5]):\n flag = 1\n if(s[0]==s[3]):\n if(s[0]==s[4] or s[0]==s[5]):\n flag = 1\n if(s[1]==s[2]):\n if(s[1]==s[4] or s[1]==s[5]):\n flag = 1\n if(s[1]==s[3]):\n if(s[1]==s[4] or s[1]==s[5]):\n flag = 1\n if(flag==0):\n print('NO')\n else:\n print('YES')", "for _ in range(int(input())):\n a = input().split()\n y = 0\n if(a[4]==a[0]==a[3]):\n y=1\n elif(a[4]==a[0]==a[2]):\n y=1\n elif(a[4]==a[1]==a[3]):\n y=1\n elif(a[4]==a[1]==a[2]):\n y=1\n elif(a[5]==a[0]==a[3]):\n y=1\n elif(a[5]==a[0]==a[2]):\n y=1\n elif(a[5]==a[1]==a[3]):\n y=1\n elif(a[5]==a[1]==a[2]):\n y=1\n if(y==1):\n print(\"YES\") \n else:\n print(\"NO\") \n \n", "for t in range(int(input())):\n s = input().split()\n d, loc, p = {}, [], 0\n for x in range(6):\n if s[x] in d: d[s[x]].append(x)\n else: d[s[x]] = [x]\n for i in d:\n if len(d[i]) >= 3:\n loc = d[i]\n break\n for l in range(0, 5, 2):\n if l in loc or (l + 1) in loc: p += 1\n if p == 3: print('YES')\n else: print('NO')", "pairwise=[[0,2,4],[0,3,4],[1,3,4],[1,2,4],\n [0,2,5],[0,3,5],[1,3,5],[1,2,5]]\nfor _ in range(int(input())):\n c=input().split()\n ans=\"NO\"\n for i in pairwise:\n x,y,z=i\n if c[x]==c[y]==c[z]:\n ans=\"YES\"\n break\n print(ans)", "import math\nimport sys\n\ndef _int():\n return int(sys.stdin.readline())\n\ndef _ints():\n return list(map(int, sys.stdin.readline().split()))\n\ndef _intarr():\n return list(map(int, sys.stdin.readline().split()))\n\ndef _str():\n return sys.stdin.readline()\n\ndef _strarr():\n return sys.stdin.readline().split()\n\ndef adj(a, b, c):\n if b != opp[a] and b != opp[c] and a != opp[c]:\n return True\n return False\n\nt = _int()\n\nopp = [1, 0, 3, 2, 5, 4]\n\nfor _ in range(t):\n c = _strarr()\n cd = dict()\n for i in range(len(opp)):\n ind = cd.get(c[i], [])\n ind.append(i)\n cd[c[i]] = ind\n \n #print(cd)\n\n found = False\n for k in list(cd.keys()):\n ind = cd.get(k, [])\n if len(ind) == 3:\n if adj(ind[0], ind[1], ind[2]):\n found = True\n elif len(ind) == 4:\n if adj(ind[0], ind[1], ind[2]):\n found = True\n elif adj(ind[0], ind[1], ind[3]):\n found = True\n elif adj(ind[0], ind[2], ind[3]):\n found = True\n elif adj(ind[1], ind[2], ind[3]):\n found = True\n elif len(ind) >= 5:\n found = True\n if found:\n break\n print(\"YES\" if found else \"NO\")\n"] | {"inputs": [["2", "blue yellow green orange black green", "green yellow green orange black green"]], "outputs": [["NO", "YES"]]} | INTERVIEW | PYTHON3 | CODECHEF | 4,807 | |
83c52927eb805c56f16cc06cee2b93c5 | UNKNOWN | Chef has $N$ axis-parallel rectangles in a 2D Cartesian coordinate system. These rectangles may intersect, but it is guaranteed that all their $4N$ vertices are pairwise distinct.
Unfortunately, Chef lost one vertex, and up until now, none of his fixes have worked (although putting an image of a point on a milk carton might not have been the greatest idea after all…). Therefore, he gave you the task of finding it! You are given the remaining $4N-1$ points and you should find the missing 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$.
- Then, $4N-1$ lines follow. Each of these lines contains two space-separated integers $x$ and $y$ denoting a vertex $(x, y)$ of some rectangle.
-----Output-----
For each test case, print a single line containing two space-separated integers $X$ and $Y$ ― the coordinates of the missing point. It can be proved that the missing point can be determined uniquely.
-----Constraints-----
- $T \le 100$
- $1 \le N \le 2 \cdot 10^5$
- $|x|, |y| \le 10^9$
- the sum of $N$ over all test cases does not exceed $2 \cdot 10^5$
-----Subtasks-----
Subtask #1 (20 points):
- $T = 5$
- $N \le 20$
Subtask #2 (30 points): $|x|, |y| \le 10^5$
Subtask #3 (50 points): original constraints
-----Example Input-----
1
2
1 1
1 2
4 6
2 1
9 6
9 3
4 3
-----Example Output-----
2 2
-----Explanation-----
The original set of points are:
Upon adding the missing point $(2, 2)$, $N = 2$ rectangles can be formed: | ["for _ in range(int(input())):\n n=int(input())\n a=[]\n b=[]\n for i in range(4*n-1):\n c,d=list(map(int,input().split()))\n a.append(c)\n b.append(d)\n c1=0\n c2=0\n for i in a:\n c1^=i\n for i in b:\n c2^=i\n print(c1,c2)", "for _ in range(int(input())):\n n=int(input())\n n=n*4-1\n x=0\n y=0\n for z in range(n):\n a,b=list(map(int,input().split()))\n x^=a\n y^=b\n print(x,y)\n", "for _ in range(int(input())):\n n=int(input())\n n=n*4-1\n xm=0\n y=0\n for z in range(n):\n a,b=list(map(int,input().split()))\n xm^=a\n y^=b\n print(xm,y)\n", "# cook your dish here\nfor _ in range(int(input())):\n n=int(input())\n n=n*4-1\n x=0\n y=0\n for z in range(n):\n a,b=list(map(int,input().split()))\n x^=a\n y^=b\n print(x,y)\n", "# cook your dish here\nfor _ in range(int(input())):\n n=int(input())\n n=n*4-1\n x=0\n y=0\n for z in range(n):\n a,b=list(map(int,input().split()))\n x^=a\n y^=b\n print(x,y)\n", "# cook your dish here\nfor _ in range(int(input())):\n n=int(input())\n n=n*4-1\n x=0\n y=0\n for z in range(n):\n a,b=list(map(int,input().split()))\n x^=a\n y^=b\n print(x,y)\n", "test_case = int(input())\nwhile test_case :\n n = int(input())\n xdict = {}\n ydict = {}\n total_points = 4*n-1\n for _ in range(total_points) :\n x,y = map(int, input().split())\n if x not in xdict :\n xdict[x] = 1 \n else:\n xdict[x] += 1 \n \n if y not in ydict :\n ydict[y] = 1 \n else:\n ydict[y] += 1 \n \n for key in xdict.keys() :\n if xdict[key] % 2 != 0 :\n print(key, end = ' ')\n break\n for key in ydict.keys():\n if ydict[key] % 2 != 0 :\n print(key)\n break\n \n test_case -= 1\n \n \n \n \n \n \n \n \n \n \n ", "test_case = int(input())\nwhile test_case :\n n = int(input())\n xdict = {}\n ydict = {}\n total_points = 4*n-1\n for _ in range(total_points) :\n x,y = map(int, input().split())\n if x not in xdict :\n xdict[x] = 1 \n else:\n xdict[x] += 1 \n \n if y not in ydict :\n ydict[y] = 1 \n else:\n ydict[y] += 1 \n \n for key in xdict.keys() :\n if xdict[key] == 1 :\n print(key, end = ' ')\n break\n for key in ydict.keys():\n if ydict[key] == 1 :\n print(key)\n break\n \n test_case -= 1\n \n \n \n \n \n \n \n \n \n \n ", "test_case = int(input())\nwhile test_case :\n n = int(input())\n points = []\n total_points = 4*n-1\n for _ in range(total_points) :\n points.append(list(map(int, input().strip().split())))\n \n xor_x = 0\n xor_y = 0\n \n for p in points :\n xor_x ^= p[0]\n xor_y ^= p[1]\n \n print(xor_x,xor_y)\n \n test_case -= 1\n \n \n \n \n \n \n \n \n \n \n", "# cook your dish here\nfor _ in range(int(input())):\n n=int(input())\n x=[]\n y=[]\n k=4*n-1\n for i in range(k):\n a,b=input().split()\n x.append(a) \n y.append(b)\n x.sort()\n y.sort()\n l=y[k-1]\n j=x[k-1]\n for i in range(0,k-1,2):\n if x[i]!=x[i+1]:\n j=x[i]\n break\n for i in range(0,k-1,2):\n if y[i]!=y[i+1]:\n l=y[i]\n break\n print(j,l)", "# cook your dish here\nfor _ in range(int(input())):\n n=int(input())\n x=[]\n y=[]\n k=4*n-1\n for i in range(k):\n a,b=input().split()\n if a in x:\n x.remove(a)\n else:\n x.append(a) \n \n if b in y:\n y.remove(b)\n else:\n y.append(b)\n print(x[0],y[0])", "# cook your dish here\nfor _ in range(int(input())):\n n=int(input())\n x=[]\n y=[]\n for i in range(4*n-1):\n a,b=input().split()\n if a in x:\n x.remove(a)\n else:\n x.append(a) \n \n if b in y:\n y.remove(b)\n else:\n y.append(b)\n print(x[0],y[0])", "T=int(input())\nfor i in range(T):\n N=int(input())\n xcord={}\n ycord={}\n for i in range(4*N-1):\n x,y=list(map(int,input().split()))\n xcord[x]=xcord.get(x,0)+1\n ycord[y]=ycord.get(y,0)+1\n x=None\n y=None\n \n for i in xcord:\n if xcord[i]%2!=0:\n x=i\n break\n for i in ycord:\n if ycord[i]%2!=0:\n y=i\n break\n print(x,y) ", "t=int(input())\nfor _ in range(t):\n N=int(input())\n m=[]\n n=[]\n for _ in range(4*N-1):\n x,y=map(int,input().split())\n m.append(x)\n n.append(y)\n for i in m:\n if m.count(i)!=2:\n a=i\n for i in n:\n if n.count(i)!=2:\n b=i\n print(a ,b)", "# cook your dish here\n\nt = int(input())\nfor i in range(t):\n n = int(input())\n coordinates_x = {}\n coordinates_y = {}\n for j in range((4*n)-1):\n coord = input().split()\n x_axis = coordinates_x.get(int(coord[0]), [])\n x_axis.append(int(coord[1]))\n coordinates_x[int(coord[0])] = x_axis\n y_axis = coordinates_y.get(int(coord[1]), [])\n y_axis.append(int(coord[0]))\n coordinates_y[int(coord[1])] = y_axis\n \n for k,v in coordinates_x.items():\n if len(v)%2 != 0:\n x_coord = k\n \n for k,v in coordinates_y.items():\n if len(v)%2 != 0:\n y_coord = k\n \n print(x_coord, y_coord)", "try:\n testcases = int(input())\n for i in range(testcases):\n rects = int(input())\n xCords = {}\n yCords = {}\n \n for i in range((rects*4)-1):\n x,y = list(map(int,input().split()))\n xCords[x] = xCords.get(x,0)+1\n yCords[y] = yCords.get(y,0)+1\n \n x = None\n y = None\n for i in xCords:\n if xCords[i]%2!=0:\n x = i\n break\n for i in yCords:\n if yCords[i]%2!=0:\n y = i\n break\n print(x,y)\nexcept:\n pass", "try:\n testcases = int(input())\n for i in range(testcases):\n rects = int(input())\n xCords = {}\n yCords = {}\n check = lambda x,hashMap: True if x in hashMap else False\n for i in range((rects*4)-1):\n x,y = list(map(int,input().split()))\n xCords[x] = xCords.get(x,0)+1\n yCords[y] = yCords.get(y,0)+1\n \n x = None\n y = None\n for (i,j), (i1,j1) in zip(xCords.items(),yCords.items()):\n if j%2!=0 and not x:\n x = i\n if j1%2!=0 and not y: \n y = i1\n if x and y:\n break\n print(x,y)\nexcept:\n pass", "try:\n testcases = int(input())\n for i in range(testcases):\n rects = int(input())\n xCords = {}\n yCords = {}\n check = lambda x,hashMap: True if x in hashMap else False\n for i in range((rects*4)-1):\n x,y = list(map(int,input().split()))\n xCords[x] = xCords.get(x,0)+1\n yCords[y] = yCords.get(y,0)+1\n \n for (i,j), (i1,j1) in zip(xCords.items(),yCords.items()):\n if j%2!=0:\n x = i\n if j1%2!=0:\n y = i1\n print(x,y)\nexcept:\n pass", "# cook your dish here\nfrom collections import Counter\nt = int(input())\nfor _ in range(t):\n n = int(input())\n x = Counter()\n y = Counter()\n for i in range(4*n-1):\n a,b = map(int, input().split())\n x.update([a])\n y.update([b])\n for i in x.keys():\n if x[i]%2!=0:\n p = i\n break\n for j in y.keys():\n if y[j]%2!=0:\n q = j\n break\n print(p,q)", "# cook your dish here\nt = int(input())\nfor _ in range(t):\n n = int(input())\n x = []\n y = []\n for i in range(4*n-1):\n a,b = list(map(int, input().split()))\n x.append(a)\n y.append(b)\n xs = set(x)\n ys = set(y)\n for i in xs:\n if x.count(i)%2!=0:\n p = i\n break\n for j in ys:\n if y.count(j)%2!=0:\n q = j\n break\n print(p,q)\n", "# cook your dish here\nt = int(input())\nfor _ in range(t):\n n = int(input())\n x = []\n y = []\n for i in range(4*n-1):\n a,b = list(map(int, input().split()))\n x.append(a)\n y.append(b)\n xs = set(x)\n ys = set(y)\n for i in xs:\n if x.count(i)%2!=0:\n p = i\n for j in ys:\n if y.count(j)%2!=0:\n q = j\n print(p,q)\n", "from collections import defaultdict as dd\nt = int(input())\nfor T in range(t):\n n = int(input())\n x = dd(int)\n y = dd(int)\n\n for i in range(4 * n - 1):\n v1, v2 = [int(_) for _ in input().split()]\n x[v1] += 1\n y[v2] += 1\n ansx, ansy = 0, 0\n for i in x:\n if x[i] % 2:\n ansx = i\n break\n\n for i in y:\n if y[i] % 2:\n ansy = i\n break\n\n print(ansx, ansy)\n", "# cook your dish here\nfor tc in range(int(input())):\n N1=int(input())\n P1=set()\n Q1=set()\n for i in range(4 * N1 - 1):\n firt, sec1=map(int, input().split())\n if firt in P1:\n P1.remove(firt)\n else:\n P1.add(firt)\n if sec1 in Q1:\n Q1.remove(sec1)\n else:\n Q1.add(sec1)\n print(*P1, *Q1)", "# cook your dish here\nfor tc in range(int(input())):\n N1=int(input())\n P1=set()\n Q1=set()\n for i in range(4 * N1 - 1):\n firt, sec1=map(int, input().split())\n if firt in P1:\n P1.remove(firt)\n else:\n P1.add(firt)\n if sec1 in Q1:\n Q1.remove(sec1)\n else:\n Q1.add(sec1)\n print(*P1, *Q1)", "t = int(input())\nfor _ in range(t):\n n = int(input())\n x_points = {}\n y_points = {}\n for i in range(4 * n - 1):\n x, y = map(int, input().split())\n x_points[x] = x_points.setdefault(x, 0) + 1\n y_points[y] = y_points.setdefault(y, 0) + 1\n\n for x in x_points:\n if x_points[x] % 2 == 1:\n print(x, end=\" \")\n\n for y in y_points:\n if y_points[y] % 2 == 1:\n print(y, end=\" \")\n"] | {"inputs": [["1", "2", "1 1", "1 2", "4 6", "2 1", "9 6", "9 3", "4 3"]], "outputs": [["2 2"]]} | INTERVIEW | PYTHON3 | CODECHEF | 8,652 | |
28386b6b26a41a83e23101e6aaadd266 | UNKNOWN | Motu and Tomu are very good friends who are always looking for new games to play against each other and ways to win these games. One day, they decided to play a new type of game with the following rules:
- The game is played on a sequence $A_0, A_1, \dots, A_{N-1}$.
- The players alternate turns; Motu plays first, since he's earlier in lexicographical order.
- Each player has a score. The initial scores of both players are $0$.
- On his turn, the current player has to pick the element of $A$ with the lowest index, add its value to his score and delete that element from the sequence $A$.
- At the end of the game (when $A$ is empty), Tomu wins if he has strictly greater score than Motu. Otherwise, Motu wins the game.
In other words, Motu starts by selecting $A_0$, adding it to his score and then deleting it; then, Tomu selects $A_1$, adds its value to his score and deletes it, and so on.
Motu and Tomu already chose a sequence $A$ for this game. However, since Tomu plays second, he is given a different advantage: before the game, he is allowed to perform at most $K$ swaps in $A$; afterwards, the two friends are going to play the game on this modified sequence.
Now, Tomu wants you to determine if it is possible to perform up to $K$ swaps in such a way that he can win this game.
-----Input-----
- The first line of the input contains a single integer $T$ denoting the number of test cases. The description of $T$ test cases follows.
- The first line of each test case contains two space-separated integers $N$ and $K$ denoting the number of elements in the sequence and the maximum number of swaps Tomu can perform.
- The second line contains $N$ space-separated integers $A_0, A_1, \dots, A_{N-1}$.
-----Output-----
For each test case, print a single line containing the string "YES" if Tomu can win the game or "NO" otherwise (without quotes).
-----Constraints-----
- $1 \le T \le 100$
- $1 \le N \le 10,000$
- $0 \le K \le 10,000$
- $1 \le A_i \le 10,000$ for each valid $i$
-----Subtasks-----
Subtask #1 (20 points): $1 \le N \le 100$
Subtask #2 (80 points): original constraints
-----Example Input-----
2
6 0
1 1 1 1 1 1
5 1
2 4 6 3 4
-----Example Output-----
NO
YES
-----Explanation-----
Example case 1: At the end of the game, both Motu and Tomu will have scores $1+1+1 = 3$. Tomu is unable to win that game, so the output is "NO".
Example case 2: If no swaps were performed, Motu's score would be $2+6+4 = 12$ and Tomu's score would be $4+3 = 7$. However, Tomu can swap the elements $A_2 = 6$ and $A_3 = 3$, which makes Motu's score at the end of the game equal to $2+3+4 = 9$ and Tomu's score equal to $4+6 = 10$. Tomu managed to score higher than Motu, so the output is "YES". | ["for _ in range(int(input())):\n n, k = map(int, input().split())\n arr= list(map(int, input().split()))\n motu, tomu = [], []\n for i in range(n):\n if i%2 == 0:\n motu.append(arr[i])\n else:\n tomu.append((arr[i]))\n motu.sort(reverse=True)\n tomu.sort()\n for i in range(len(motu)):\n if len(tomu)-1<i:\n break\n if k==0:\n break\n if tomu[i]<motu[i]:\n tomu[i], motu[i] = motu[i], tomu[i]\n k-=1\n if sum(tomu) > sum(motu):\n print(\"YES\")\n else:\n print(\"NO\")", "T = int(input())\nfor _ in range(T):\n n, k = list(map(int, input().split()))\n seq = list(map(int, input().split()))\n motu, tomu = [], []\n for i in range(n):\n if i%2 == 0:\n motu.append(seq[i])\n else:\n tomu.append((seq[i]))\n motu.sort(reverse=True)\n tomu.sort()\n for i in range(len(motu)):\n if len(tomu)-1<i:\n break\n if k==0:\n break\n if tomu[i]<motu[i]:\n tomu[i], motu[i] = motu[i], tomu[i]\n k-=1\n # for i in range(k):\n # if motu[i] > tomu[i]:\n # motu[i], tomu[i] = tomu[i], motu[i]\n if sum(tomu) > sum(motu):\n print(\"YES\")\n else:\n print(\"NO\")\n", "for _ in range(int(input())):\n n,k=list(map(int,input().split()))\n arr=[int(k) for k in input().split()]\n motu=[]\n tomu=[]\n for i in range(n):\n if i%2==0:\n motu.append(arr[i])\n else:\n tomu.append(arr[i])\n motu.sort(reverse=True)\n tomu.sort()\n for i in range(len(motu)):\n if len(tomu)-1<i:\n break\n if k==0:\n break\n if tomu[i]<motu[i]:\n temp=tomu[i]\n tomu[i]=motu[i]\n motu[i]=temp\n k-=1\n sumtomu=0\n summotu=0\n for i in range(len(tomu)):\n sumtomu+=tomu[i]\n for i in range(len(motu)):\n summotu+=motu[i]\n if sumtomu>summotu:\n print(\"YES\")\n else:\n print(\"NO\")\n \n \n \n \n", "t=int(input())\nfor _ in range(t):\n n,k=list(map(int,input().split()))\n l=list(map(int,input().split()))\n a=l[0::2]\n b=l[1::2]\n al=len(a)\n bl=len(b)\n if(al>bl):\n ll=bl\n else:\n ll=al\n b.sort()\n a.sort(reverse=True)\n i=0\n while(sum(a)>sum(b) and k>0 and i<ll):\n t=a[i]\n a[i]=b[i]\n b[i]=t\n i=i+1\n k=k-1\n if(sum(b)>sum(a)):\n print('YES')\n else:\n print('NO')\n", "# cook your dish here\nimport math\nt=int(input())\nfor i in range (t):\n n,k=map(int,input().strip().split(\" \"))\n a=[int(x) for x in input().split()]\n od_a=[]\n ev_a=[]\n for j in range(n):\n if(j%2==0):\n ev_a.append(a[j])\n else:\n od_a.append(a[j])\n ev_a.sort()\n od_a.sort()\n n1=len(ev_a)\n n2=len(od_a)\n s1=sum(ev_a)\n s2=sum(od_a)\n if(s2>s1):\n print(\"YES\")\n continue\n elif(k==0):\n print(\"NO\")\n continue\n for j in range(k):\n if(j==n2):\n break\n if(ev_a[n1-1-j]>od_a[j]):\n temp=ev_a[n1-1-j]\n ev_a[n1-1-j]=od_a[j]\n od_a[j]=temp\n s1-=(od_a[j]-ev_a[n1-1-j])\n s2+=(od_a[j]-ev_a[n1-1-j]) \n if(s2>s1):\n print(\"YES\")\n break\n if(s1>=s2):\n print(\"NO\")", "# cook your dish here\nimport math\nt=int(input())\nfor i in range (t):\n n,k=map(int,input().strip().split(\" \"))\n a=[int(x) for x in input().split()]\n od_a=[]\n ev_a=[]\n for j in range(n):\n if(j%2==0):\n ev_a.append(a[j])\n else:\n od_a.append(a[j])\n ev_a.sort()\n od_a.sort()\n n1=len(ev_a)\n s1=sum(ev_a)\n s2=sum(od_a)\n if(s2>s1):\n print(\"YES\")\n continue\n elif(k==0):\n print(\"NO\")\n continue\n for j in range(k):\n if(j==int(n/2)):\n break\n if(ev_a[n1-1-j]>od_a[j]):\n temp=ev_a[n1-1-j]\n ev_a[n1-1-j]=od_a[j]\n od_a[j]=temp\n s1-=(od_a[j]-ev_a[n1-1-j])\n s2+=(od_a[j]-ev_a[n1-1-j]) \n if(s2>s1):\n print(\"YES\")\n break\n if(s1>=s2):\n print(\"NO\")", "t=int(input())\nfor _ in range(t):\n n,k=list(map(int,input().split()))\n l=list(map(int,input().split()))\n a=l[0::2]\n b=l[1::2]\n al=len(a)\n bl=len(b)\n if(al>bl):\n ll=bl\n else:\n ll=al\n b.sort()\n a.sort(reverse=True)\n i=0\n while(sum(a)>sum(b) and k>0 and i<ll):\n t=a[i]\n a[i]=b[i]\n b[i]=t\n i=i+1\n k=k-1\n if(sum(b)>sum(a)):\n print('YES')\n else:\n print('NO')\n \n \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=[]\n t=[]\n ms=ts=0\n for i in range(n):\n if (i%2)==0:\n m.append(l[i])\n else:\n t.append(l[i])\n ms=sum(m)\n ts=sum(t)\n if ts>ms:\n print('YES')\n else:\n flag=1\n while k>0:\n mm=max(m)\n mn=min(t)\n ts=ts+mm-mn\n ms=ms-mm+mn\n if ts>ms:\n flag=0\n print('YES')\n break\n k-=1\n if flag==1:\n print('NO')", "import math\ntest=int(input())\nfor j in range(test):\n a=[int(x) for x in input().split()]\n inputdata=[int(x) for x in input().split()]\n new1=[]\n new2=[]\n count=0\n count1=0\n for i in range(a[0]):\n if i%2==0:\n new1.append(inputdata[i]) \n else: \n new2.append(inputdata[i])\n count=sum(new1)\n count1=sum(new2)\n new1.sort(reverse=True)\n new2.sort()\n if count<count1:\n print(\"YES\")\n else:\n for i in range(len(new2)):\n if new1[i]>new2[i] and a[1]:\n temp=new1[i]\n new1[i]=new2[i]\n new2[i]=temp \n a[1]=a[1]-1\n if a[1] is 0:\n break; \n count=sum(new1)\n count1=sum(new2)\n if count<count1:\n print(\"YES\")\n else: print(\"NO\")", "import math\ntest=int(input())\nfor j in range(test):\n a=[int(x) for x in input().split()]\n inputdata=[int(x) for x in input().split()]\n new1=[]\n new2=[]\n count=0\n count1=0\n for i in range(a[0]):\n if i%2==0:\n new1.append(inputdata[i]) \n else: \n new2.append(inputdata[i])\n count=sum(new1)\n count1=sum(new2)\n new1.sort(reverse=True)\n new2.sort()\n if count<count1:\n print(\"YES\")\n else:\n for i in range(len(new2)):\n if new1[i]>new2[i] and a[1]:\n temp=new1[i]\n new1[i]=new2[i]\n new2[i]=temp \n a[1]=a[1]-1\n if a[1] is 0:\n break; \n count=sum(new1)\n count1=sum(new2)\n if count<count1:\n print(\"YES\")\n else: print(\"NO\")", "import math\ntest=int(input())\nfor j in range(test):\n a=[int(x) for x in input().split()]\n inputdata=[int(x) for x in input().split()]\n new1=[]\n new2=[]\n count=0\n count1=0\n for i in range(a[0]):\n if i%2==0:\n new1.append(inputdata[i]) \n else: \n new2.append(inputdata[i])\n count=sum(new1)\n count1=sum(new2)\n new1.sort(reverse=True)\n new2.sort()\n if count<count1:\n print(\"YES\")\n else:\n for i in range(len(new2)):\n if new1[i]>new2[i] and a[1]:\n temp=new1[i]\n new1[i]=new2[i]\n new2[i]=temp \n a[1]=a[1]-1\n if a[1] is 0:\n break; \n count=sum(new1)\n count1=sum(new2)\n if count<count1:\n print(\"YES\")\n else: print(\"NO\")", "test=int(input())\nfor x in range(test):\n n,k = list(map(int, input().split()))\n a=list(map(int, input().split()))\n \n tonu=[]\n monu=[]\n \n for i in range(n):\n if ((i+1)%2==0):\n tonu.append(a[i])\n else:\n monu.append(a[i])\n \n tonu.sort()\n monu.sort(reverse= True)\n \n for i in range(k):\n if (sum(tonu)>sum(monu) or (i==len(tonu) or i==len(monu))):\n break\n tonu[i],monu[i]=monu[i],tonu[i]\n \n if sum(tonu)>sum(monu):\n print(\"YES\")\n else:\n print(\"NO\")\n", "t = int(input())\n\nfor x in range(t):\n\n n, k = list(map(int, input().split()))\n a = list(map(int, input().split()))\n\n tarr = []\n marr = []\n for i in range(n):\n if((i + 1)%2 == 0):\n tarr.append(a[i])\n else:\n marr.append(a[i])\n\n tarr.sort()\n marr.sort(reverse = True)\n\n for i in range(k):\n if(sum(tarr) > sum(marr) or (i == len(tarr) or i == len(marr))):\n break\n tarr[i], marr[i] = marr[i], tarr[i]\n\n #print(tarr, marr)\n\n t = sum(tarr)\n m = sum(marr)\n\n if(t > m):\n print('YES')\n else:\n print('NO')", "t=int(input())\nfor i in range(t):\n nk=list(map(int,input().split()))\n n=nk[0]\n k=nk[1]\n arr=list(map(int,input().split()))\n a1=[]\n a2=[]\n for i in range(0,len(arr)):\n if i%2==0:\n a1.append(arr[i])\n else:\n a2.append(arr[i])\n if( sum(a1)>=sum(a2)):\n a1.sort()\n a2.sort()\n for j in range(k):\n if j<len(a1) and j<len(a2):\n temp=a1[len(a1)-j-1]\n a1[len(a1)-j-1]=a2[j]\n a2[j]=temp\n if( sum(a1)>=sum(a2)):\n print(\"NO\")\n else:\n print(\"YES\")", "from math import *\nT=int(input())\nfor i in range(T):\n N,K=[int(j) for j in input().split(\" \")]\n A=list(map(int,input().split(\" \")))\n Ao=[]\n Ae=[]\n for k in range(len(A)):\n if k%2==0:\n Ae.append(A[k])\n else:\n Ao.append(A[k]) \n\n count1=0\n count2=0 \n if K==0:\n for r in range(len(A)):\n if r%2==0: \n count1+=A[r]\n else:\n count2+=A[r] \n else:\n for o in range(K):\n e=max(Ae)\n f=min(Ao)\n g=Ae.index(e)\n h=Ao.index(f)\n Ae[g]=f\n Ao[h]=e\n for p in range(len(Ae)):\n count1+=Ae[p]\n for w in range(len(Ao)):\n count2+=Ao[w] \n if count2>count1:\n print(\"YES\")\n else:\n print(\"NO\")\n", "for _ in range(int(input())):\n n,k = list(map(int,input().split()))\n a = list(map(int,input().split()))\n m = []\n t = []\n for i in range(n):\n if(i%2 == 0):\n m.append(a[i])\n else:\n t.append(a[i])\n m.sort(reverse=True)\n t.sort()\n mi=min(len(m),len(t))\n x1=0\n x2=0\n while(k!=0 and x1<len(m) and x2<len(m)):\n if(m[x1]>t[x2]):\n m[x1],t[x2] = t[x2],m[x1]\n x1+=1\n x2+=1\n else:\n break\n k-=1\n if(sum(t) > sum(m)):\n print(\"YES\")\n else:\n print(\"NO\")\n"] | {"inputs": [["2", "6 0", "1 1 1 1 1 1", "5 1", "2 4 6 3 4"]], "outputs": [["NO", "YES"]]} | INTERVIEW | PYTHON3 | CODECHEF | 9,155 | |
a02bc961ea557d2694348004a42d7fef | UNKNOWN | The Gray code (see wikipedia for more details) is a well-known concept.
One of its important properties is that every two adjacent numbers have exactly one different digit in their binary representation.
In this problem, we will give you n non-negative integers in a sequence A[1..n] (0<=A[i]<2^64), such that every two adjacent integers have exactly one different digit in their binary representation, similar to the Gray code.
Your task is to check whether there exist 4 numbers A[i1], A[i2], A[i3], A[i4] (1 <= i1 < i2 < i3 < i4 <= n) out of the given n numbers such that A[i1] xor A[i2] xor A[i3] xor A[i4] = 0. Here xor is a bitwise operation which is same as ^ in C, C++, Java and xor in Pascal.
-----Input-----
First line contains one integer n (4<=n<=100000).
Second line contains n space seperated non-negative integers denoting the sequence A.
-----Output-----
Output “Yes” (quotes exclusive) if there exist four distinct indices i1, i2, i3, i4 such that A[i1] xor A[i2] xor A[i3] xor A[i4] = 0. Otherwise, output "No" (quotes exclusive) please.
-----Example-----
Input:
5
1 0 2 3 7
Output:
Yes | ["dic = {}\n#num = \"1\"\n#def tonum(num):\n# res=0\n# for i in range(len(num)):\n# res = 2*res + int(num[i])\n# return res\n\n#for i in range(64):\n# number = tonum(num)\n# dic[num] = []\n# num = num+\"0\"\n\nn = int(input())\nflag=0\nif n >= 68:\n inp = input()\n print(\"Yes\")\nelse:\n inp = [int(x) for x in input().split()]\n for i in range(len(inp)-1):\n for j in range(i+1,len(inp)):\n xor = inp[i]^inp[j]\n if xor in list(dic.keys()):\n for pair in dic[xor]:\n (x,y) = pair\n if x != i and y!=j and x!=j and y!=i:\n flag = 1\n break\n\n dic[xor].append((i,j))\n else:\n dic[xor] = []\n dic[xor].append((i,j))\n if flag is 1:\n break\n if flag is 1:\n break\n\n if flag is 1:\n print(\"Yes\")\n else:\n print(\"No\")\n \n \n", "n=int(input())\nhit=list(map(int,input().split()))\n\nd={}\nfor i in range(1,n):\n x1,x2=hit[i],hit[i-1]\n try: d[x1^x2]+=[i]\n except: d[x1^x2]=[i]\n\ndone=False\nfor i in d:\n x=d[i]\n if len(x)>2: done=True; break\n elif len(x)==2:\n x=sorted(x)\n if x[0]!=x[1]-1: done=True; break\n\nif done: print('Yes')\nelse:\n v={}\n for i in hit:\n try: v[i]+=1\n except: v[i]=1\n x={}\n h=list(v.values())\n for i in h:\n try: x[i]+=1\n except: x[i]=1\n if ( 2 in x and x[2]==2 ) or ( 4 in x and x[4]==1 ): print('Yes')\n else: print('No')\n", "#!/usr/bin/python\nfrom math import log\nflips = {}\n\ndef get_flip(a,b):\n temp = a^b\n ans = log(temp)/log(2)\n return int(ans)\n\ndef main():\n n = input()\n nums = input()\n nums = [int(i) for i in nums.split()]\n l = len(nums)\n for i in range(1,l):\n f = get_flip(nums[i-1], nums[i])\n if f in flips:\n if flips[f] != i-1:\n print('Yes')\n return\n else:\n flips[f] = i\n\n # now check in case of same elements\n rec = {}\n for i in nums:\n if i in rec:\n rec[i] += 1\n else:\n rec[i] = 1\n \n\n r = 0\n for i in rec:\n if rec[i] > 1:\n r += int(rec[i]/2)\n if r >= 2:\n print('Yes')\n return\n print('No')\n return\n\n\ndef __starting_point():\n main()\n\n\n__starting_point()", "#!/usr/bin/python\nfrom math import log\nflips = {}\n\ndef get_flip(a,b):\n temp = a^b\n ans = log(temp)/log(2)\n return int(ans)\n\ndef main():\n n = input()\n nums = input()\n nums = [int(i) for i in nums.split()]\n l = len(nums)\n for i in range(1,l):\n f = get_flip(nums[i-1], nums[i])\n if f in flips:\n if flips[f] != i-1:\n print('Yes')\n return\n else:\n flips[f] = i\n\n # now check in case of same elements\n rec = {}\n for i in nums:\n if i in rec:\n rec[i] += 1\n else:\n rec[i] = 1\n \n\n r = 0\n for i in rec:\n if rec[i] > 1:\n r += int(rec[i]/2)\n if r == 2:\n print('Yes')\n return\n print('No')\n return\n\n\ndef __starting_point():\n main()\n\n\n__starting_point()", "n = int(input())\ns = input()\ns = s.split()\nd = {}\nflag = \"No\"\n\ntwo,four = 0,0\nfor i in s:\n if i in d:\n d[i] += 1;\n if d[i] == 2:\n two += 1\n elif d[i] == 4:\n four += 1\n else:\n d[i] = 1;\nd = {}\nif two>1 or four>0:\n flag = \"Yes\"\nelse:\n \n for i in range(n-1):\n ex = int(s[i]) ^ int(s[i+1])\n if ex in d:\n d[ex].append(i)\n if d[ex][-1] - d[ex][0] > 1:\n flag = \"Yes\"\n break; \n else:\n d[ex] = [i]\nprint(flag)\n", "n = int(input())\ns = input()\ns = s.split()\nd = {}\nflag = \"No\"\n\ntwo,four = 0,0\nfor i in s:\n if i in d:\n d[i] += 1;\n if d[i] == 2:\n two += 1\n elif d[i] == 4:\n four += 1\n else:\n d[i] = 1;\n\nif two>1 or four>0:\n flag = \"Yes\"\nelse:\n for i in range(n-1):\n ex = int(s[i]) ^ int(s[i+1])\n if ex in d:\n d[ex].append(i)\n if d[ex][-1] - d[ex][0] > 1:\n flag = \"Yes\"\n break; \n else:\n d[ex] = [i]\nprint(flag)\n", "n=int(input())\nhit=list(map(int,input().split()))\n\nd={}\nfor i in range(1,n):\n x1,x2=hit[i],hit[i-1]\n try: d[x1^x2]+=[i]\n except: d[x1^x2]=[i]\n\ndone=False\nfor i in d:\n x=d[i]\n if len(x)>2: done=True; break\n elif len(x)==2:\n x=sorted(x)\n if x[0]!=x[1]-1: done=True; break\n\nif done: print('Yes')\nelse:\n v={}\n for i in hit:\n try: v[i]+=1\n except: v[i]=1\n x={}\n h=list(v.values())\n for i in h:\n try: x[i]+=1\n except: x[i]=1\n if ( 2 in x and x[2]==2 ) or ( 4 in x and x[4]==1 ): print('Yes')\n else: print('No')\n", "def digit(x):\n ans = None\n for i in range(64):\n if x&(1<<i): \n return i\n \n#data = open(\"P7.txt\")\nn = int(input())\n#n = int(data.readline())\nif n<4:\n print(\"No\")\n \nelse:\n count = [0]*65\n nums = {}\n vals = list(map(int,input().split()))\n #vals = map(long,data.readline().split())\n nums[vals[0]] = 1\n prebit = 999999999\n \n for i in range(1,n):\n bit = digit(vals[i]^vals[i-1])\n if bit!=prebit:\n count[bit] += 1\n prebit = bit\n try:\n nums[vals[i]] += 1\n except:\n nums[vals[i]] = 1\n \n m1 = max(count)\n m2 = max(nums.values())\n if m1>=2 or m2>=4: print(\"Yes\")\n else: \n num_doubles = 0\n for val in list(nums.values()):\n if val >= 2:\n num_doubles += 1\n if num_doubles >= 2:\n print(\"Yes\")\n else:\n print(\"No\")", "import sys\n\nn = int(input())\na = [0]*n\nif (n > 300):\n print('Yes')\n return\ns = input().split()\nfor i in range(n):\n a[i] = int(s[i]) \na.sort()\nfor i in range(n-3):\n for j in range(i+1, n-2):\n for k in range(j+1, n-1):\n x = (a[i]^a[j])^a[k]\n l = k + 1\n r = n - 1\n while r - l > 1:\n c = ( r + l ) / 2\n if a[c] > x:\n r=c\n else:\n l=c\n if ((l > k and a[l] == x) or (a[r]==x)):\n print('Yes')\n return\nprint('No')"] | {"inputs": [["5", "1 0 2 3 7"]], "outputs": [["Yes"]]} | INTERVIEW | PYTHON3 | CODECHEF | 5,490 | |
04c55fa57197aa1e9ef0d70479fe0f02 | UNKNOWN | The chef won a duet singing award at Techsurge & Mridang 2012. From that time he is obsessed with the number 2.
He just started calculating the powers of two. And adding the digits of the results.
But he got puzzled after a few calculations. So gave you the job to generate the solutions to 2^n and find their sum of digits.
-----Input-----
N : number of inputs N<=100
then N lines with input T<=2000
-----Output-----
The output for the corresponding input T
-----Example-----
Input:
3
5
10
4
Output:
5
7
7
Explanation:
2^5=32
3+2=5
2^10=1024
1+0+2+4=7
2^4=16
1+6=7 | ["from operator import add\nfrom functools import reduce\n\nchoices=[]\n\nfor x in range(1800):\n num_str = list(map (int, str (2**x)))\n suma = reduce (add, num_str)\n choices.append(suma)\nN=int(input())\n\nfor x in range(N):\n t=int(input())\n print(choices[t])\n", "for _ in range(int(input())):\n i=int(input())\n a=str(2**i)\n sums=0\n for d in a:\n d=int(d)\n sums+=d\n \n print(sums)", "import sys\nfor i in range(int(input())):\n n=input()\n try:\n n=int(n)\n t=2**n\n s=0\n while t>0:\n s+=t%10\n t//=10\n print(s)\n except:\n break\n \n", "n = int(input().rstrip())\n\nwhile(n > 0):\n t = int(input().rstrip())\n r = 2 ** t\n r = list(str(r))\n s = 0\n for i in r:\n s = s + int(i)\n print(s)\n n = n-1", "from sys import stdin\nlines = stdin.readlines()[1:]\n\nfor line in lines:\n str_2n = str(2 ** int(line))\n sum = 0\n for i in str_2n:\n sum += int(i)\n print(sum)\n", "import sys\n \ndef main():\n s = sys.stdin.readline\n t = int(s())\n for t in range(t):\n n = int(s())\n comp = str(2**n)\n #print comp\n sum = 0\n for i in comp:\n sum+=int(i)\n print(sum)\n \ndef __starting_point():\n main()\n__starting_point()", "import sys\nline = sys.stdin.readline()\nn=int(line)\nwhile n:\n try:\n line = sys.stdin.readline()\n t=int(line)\n except:\n break\n x=2**t\n sum=0\n while x:\n sum+=x%10\n x/=10\n print(\"\\n%d\"%sum)\n n-=1", "testcases = int(input())\nwhile testcases:\n n = int(input())\n print(sum([int(digit) for digit in str(2**n)]))\n testcases -= 1", "#!/usr/bin/env python\n\nT = int(input())\nfor t in range(T):\n N = int(input())\n print(sum(map(int, str(2**N))))\n '''\n X = 2**N\n print '2^%d=%d' % (N, X)\n X = map(int, str(X))\n print '%s=%d' % ('+'.join(map(str, X)), sum(X))\n '''\n\n", "N = int(input())\nfor i in range(N):\n res = str(2 ** int(input()))\n ans = 0\n for i in res: ans += ord(i) - ord('0')\n print(ans)\n"] | {"inputs": [["3", "5", "10", "4"]], "outputs": [["5", "7", "7"]]} | INTERVIEW | PYTHON3 | CODECHEF | 1,904 | |
6fda0027b77435c609442dd40be5ab1c | UNKNOWN | AND gates and OR gates are basic components used in building digital circuits. Both gates have two input lines and one output line. The output of an AND gate is 1 if both inputs are 1, otherwise the output is 0. The output of an OR gate is 1 if at least one input is 1, otherwise the output is 0.
You are given a digital circuit composed of only AND and OR gates where one node (gate or input) is specially designated as the output. Furthermore, for any gate G and any input node I, at most one of the inputs to G depends on the value of node I.
Now consider the following random experiment. Fix some probability p in [0,1] and set each input bit to 1 independently at random with probability p (and to 0 with probability 1-p). The output is then 1 with some probability that depends on p. You wonder what value of p causes the circuit to output a 1 with probability 1/2.
-----Input-----
The first line indicates the number of test cases to follow (about 100).
Each test case begins with a single line containing a single integer n with 1 ≤ n ≤ 100 indicating the number of nodes (inputs and gates) in the circuit. Following this, n lines follow where the i'th line describes the i'th node. If the node is an input, the line simply consists of the integer 0. Otherwise, if the node is an OR gate then the line begins with a 1 and if the node is an AND gate then the line begins with a 2. In either case, two more integers a,b follow, both less than i, which indicate that the outputs from both a and b are used as the two input to gate i.
As stated before, the circuit will be such that no gate has both of its inputs depending on the value of a common input node.
Test cases are separated by a blank line including a blank line preceding the first test case.
-----Output-----
For each test case you are to output a single line containing the value p for which the output of node n is 1 with probability exactly 1/2 if the inputs are independently and randomly set to value 1 with probability p. The value p should be printed with exactly 5 digits after the decimal.
-----Example-----
Input:
4
1
0
3
0
0
1 1 2
3
0
0
2 1 2
5
0
0
0
2 1 2
1 3 4
Output:
0.50000
0.29289
0.70711
0.40303
-----Temporary Stuff-----
A horizontal rule follows.
***
Here's a definition list (with `definitionLists` option):
apples
: Good for making applesauce.
oranges
: Citrus!
tomatoes
: There's no "e" in tomatoe.
#PRACTICE
- This must be done
[http:codechef.com/users/dpraveen](http:codechef.com/users/dpraveen)
(0.8944272−0.44721360.4472136−0.8944272)(10005)(0.89442720.4472136−0.4472136−0.8944272)(10005)
\left(\begin{array}{cc}
0.8944272 & 0.4472136\\
-0.4472136 & -0.8944272
\end{array}\right)
\left(\begin{array}{cc}
10 & 0\\
0 & 5
\end{array}\right) | ["# cook your dish here\nclass node:\n\tdef __init__(self,a,b=0,c=0):\n\t\tself.val=a\n\t\tself.a=b\n\t\tself.b=c\n\narr=[]\n\ndef finder(node,val):\n\tif(arr[node].val==0):\n\t\treturn val\n\telse:\n\t\ta=finder(arr[node].a,val)\n\t\tb=finder(arr[node].b,val)\n\t\tif(arr[node].val==1):\n\t\t\treturn a+b-a*b\n\t\telse:\n\t\t\treturn a*b\n\nt=int(input())\nwhile(t>0):\n\tx=input()\n\tn=int(input())\n\tarr.append(node(0))\n\tfor i in range(0,n):\n\t\tvals=input().split()\n\t\tsz=len(vals)\n\t\tfor i in range(0,sz):\n\t\t\tvals[i]=int(vals[i])\n\t\tif(vals[0]==0):\n\t\t\tnext=node(0)\n\t\t\tarr.append(next)\n\t\telse:\n\t\t\tnext=node(vals[0],vals[1],vals[2])\n\t\t\tarr.append(next)\n\tlower=0.0\n\thigher=1.0\n\teps=1e-9\n\twhile((higher-lower)>eps):\n\t\tmid=(higher+lower)/2.0 \n\t\tif(finder(n,mid)>0.5):\n\t\t\thigher=mid\n\t\telse:\n\t\t\tlower=mid\n\tprint(\"%.5f\" %(higher))\n\tarr=[]\n\t# print(higher)\n\tt-=1", "class node:\r\n\tdef __init__(self,a,b=0,c=0):\r\n\t\tself.val=a\r\n\t\tself.a=b\r\n\t\tself.b=c\r\n\r\narr=[]\r\n\r\ndef finder(node,val):\r\n\tif(arr[node].val==0):\r\n\t\treturn val\r\n\telse:\r\n\t\ta=finder(arr[node].a,val)\r\n\t\tb=finder(arr[node].b,val)\r\n\t\tif(arr[node].val==1):\r\n\t\t\treturn a+b-a*b\r\n\t\telse:\r\n\t\t\treturn a*b\r\n\r\nt=int(input())\r\nwhile(t>0):\r\n\tx=input()\r\n\tn=int(input())\r\n\tarr.append(node(0))\r\n\tfor i in range(0,n):\r\n\t\tvals=input().split()\r\n\t\tsz=len(vals)\r\n\t\tfor i in range(0,sz):\r\n\t\t\tvals[i]=int(vals[i])\r\n\t\tif(vals[0]==0):\r\n\t\t\tnext=node(0)\r\n\t\t\tarr.append(next)\r\n\t\telse:\r\n\t\t\tnext=node(vals[0],vals[1],vals[2])\r\n\t\t\tarr.append(next)\r\n\tlower=0.0\r\n\thigher=1.0\r\n\teps=1e-9\r\n\twhile((higher-lower)>eps):\r\n\t\tmid=(higher+lower)/2.0 \r\n\t\tif(finder(n,mid)>0.5):\r\n\t\t\thigher=mid\r\n\t\telse:\r\n\t\t\tlower=mid\r\n\tprint(\"%.5f\" %(higher))\r\n\tarr=[]\r\n\t# print(higher)\r\n\tt-=1"] | {"inputs": [["4", "", "1", "0", "", "3", "0", "0", "1 1 2", "", "3", "0", "0", "2 1 2", "", "5", "0", "0", "0", "2 1 2", "1 3 4", "", ""]], "outputs": [["0.50000", "0.29289", "0.70711", "0.40303"]]} | INTERVIEW | PYTHON3 | CODECHEF | 1,927 | |
9e037680569c88dcbf8f0e99576a71d3 | UNKNOWN | There are players standing in a row each player has a digit written on their T-Shirt (multiple players can have the same number written on their T-Shirt).
You have to select a group of players, note that players in this group should be standing in $\textbf{consecutive fashion}$. For example second player of chosen group next to first player of chosen group, third player next to second and similarly last player next to second last player of chosen group. Basically You've to choose a contiguous group of players.
After choosing a group, players can be paired if they have the same T-Shirt number (one player can be present in at most one pair), finally the chosen group is called “good” if at most one player is left unmatched. Your task is to find the size of the maximum “good” group.
Formally, you are given a string $S=s_{1}s_{2}s_{3}...s_{i}...s_{n}$ where $s_{i}$ can be any digit character between $'0'$ and $'9'$ and $s_{i}$ denotes the number written on the T-Shirt of $i^{th}$ player. Find a value $length$ such that there exist pair of indices $(i,j)$ which denotes $S[i...j]$ is a “good” group where $i\geq1$ and $j\leq S.length$ and $i\leq j$ and $(j-i+1)=length$ and there exist no other pair $(i’,j’)$ such that $(j’-i’+1)>length$ and $S[i'...j']$ is a "good" group.
-----Input:-----
- First line will contain $T$, number of testcases. Then the testcases follow.
- $i^{th}$ testcase consist of a single line of input, a string $S$.
-----Output:-----
For each testcase, output in a single line maximum possible size of a "good" group.
-----Constraints-----
$\textbf{Subtask 1} (20 points)$
- $1 \leq T \leq 10$
- $S.length \leq 10^{3}$
$\textbf{Subtask 2} (80 points)$
- $1 \leq T \leq 10$
- $S.length \leq 10^{5}$
-----Sample Input:-----
1
123343
-----Sample Output:-----
3
-----EXPLANATION:-----
1$\textbf{$\underline{2 3 3}$}$43
Underlined group is a “good” group because the second player(number 2 on T-Shirt) is the only player who is left unmatched and third and fourth player can form a pair, no other group has length greater than 3 that are “good”. However note that we have other “good” group also 12$\textbf{$\underline{334}$}$3 but length is 3 which is same as our answer.
-----Sample Input:-----
1
95665
-----Sample Output:-----
5
-----EXPLANATION:-----
$\textbf{$\underline{95665}$}$ is “good” group because first player is the only player who is left unmatched second and fifth player can form pair and third and fourth player also form pair.
-----Sample Input:-----
2
2323
1234567
-----Sample Output:-----
4
1
-----EXPLANATION:-----
For first test case
$\textbf{$\underline{2323}$}$ is a “good” group because there are no players who are left unmatched first and third player form pair and second and fourth player form pair.
For second test
Only length one "good" group is possible. | ["import sys\n\ndef GRIG(L):\n\n LENT = len(L)\n MINT = 1\n GOT = 0\n\n DY = [ [{x: 0 for x in range(0, 10)}, 0, 0] ]\n\n for i in L:\n\n DY.append([{x: 0 for x in range(0, 10)}, 0, 0])\n GOT += 1\n\n for j in range(0, GOT):\n\n if DY[j][0][i] == 1:\n DY[j][0][i] = 0\n DY[j][1] -= 1\n else:\n DY[j][0][i] = 1\n DY[j][1] += 1\n\n DY[j][2] += 1\n\n if DY[j][1] <= 1 and DY[j][2] > MINT:\n MINT = DY[j][2]\n\n return MINT\n\nTESTCASES = int(input().strip())\n\nfor i in range(0, TESTCASES):\n \n L = [int(x) for x in list(input().strip())]\n \n print(GRIG(L))\n", "import sys\r\nimport math\r\nfrom collections import defaultdict,Counter\r\n\r\n# input=sys.stdin.readline\r\n# def print(x):\r\n# sys.stdout.write(str(x)+\"\\n\")\r\n\r\n# sys.stdout=open(\"CP1/output.txt\",'w')\r\n# sys.stdin=open(\"CP1/input.txt\",'r')\r\n\r\ndef possible(n1,n):\r\n\t# d=defaultdict(int)\r\n\todd=set()\r\n\t# even=set()\r\n\tfor j in range(n):\r\n\t\t# print(odd)\r\n\t\tif s[j] in odd:\r\n\t\t\todd.remove(s[j])\r\n\t\t\t# even.add(s[j])\r\n\t\telse:\r\n\t\t\todd.add(s[j])\r\n\t\t# d[s[j]]+=1\r\n\t\t# print(odd)\r\n\t\tif j<n1-1:\r\n\t\t\tcontinue\r\n\t\t# print(j)\r\n\t\tif len(odd)<=1:\r\n\t\t\treturn True\r\n\r\n\t\tif s[j-n1+1] in odd:\r\n\t\t\todd.remove(s[j-n1+1])\r\n\t\t\t# even.add(s[j])\r\n\t\telse:\r\n\t\t\todd.add(s[j-n1+1])\r\n\treturn False\r\n# m=pow(10,9)+7\r\nt=int(input())\r\nfor i in range(t):\r\n\ts=input().strip()\r\n\tn=len(s)\r\n\tans=0\r\n\tfor j in range(n,0,-1):\r\n\t\tif possible(j,n):\r\n\t\t\tans=j\r\n\t\t\tbreak\r\n\tprint(ans)\r\n\t# low=1\r\n\t# high=n\r\n\t# while low<=high:\r\n\t# \tmid=(low+high)//2\r\n\t# \tif mid%2==0:\r\n\t# \t\tif low%2==0:\r\n\t# \t\t\tlow+=1\r\n\t# \t\t\tmid+=1\r\n\t# \t\telif high%2==0:\r\n\t# \t\t\thigh-=1\r\n\t# \t\t\tmid-=1\r\n\t# \t# if low>high:\r\n\t# \t# \tbreak\r\n\t# \tif possible(mid,n):\r\n\t# \t\tlow=mid+1\r\n\t# \telse:\r\n\t# \t\thigh=mid-1\r\n\t# \tprint(mid,low,high)\r\n\t# print(mid)\r\n", "import sys\r\nimport math\r\nfrom collections import defaultdict,Counter\r\n\r\n# input=sys.stdin.readline\r\n# def print(x):\r\n# sys.stdout.write(str(x)+\"\\n\")\r\n\r\n# sys.stdout=open(\"CP1/output.txt\",'w')\r\n# sys.stdin=open(\"CP1/input.txt\",'r')\r\n\r\ndef possible(n1,n):\r\n\t# d=defaultdict(int)\r\n\todd=set()\r\n\t# even=set()\r\n\tfor j in range(n):\r\n\t\t# print(odd)\r\n\t\tif s[j] in odd:\r\n\t\t\todd.remove(s[j])\r\n\t\t\t# even.add(s[j])\r\n\t\telse:\r\n\t\t\todd.add(s[j])\r\n\t\t# d[s[j]]+=1\r\n\t\t# print(odd)\r\n\t\tif j<n1-1:\r\n\t\t\tcontinue\r\n\t\t# print(j)\r\n\t\tif len(odd)<=1:\r\n\t\t\treturn True\r\n\r\n\t\tif s[j-n1+1] in odd:\r\n\t\t\todd.remove(s[j-n1+1])\r\n\t\t\t# even.add(s[j])\r\n\t\telse:\r\n\t\t\todd.add(s[j-n1+1])\r\n\treturn False\r\n# m=pow(10,9)+7\r\nt=int(input())\r\nfor i in range(t):\r\n\ts=list(input())\r\n\tn=len(s)\r\n\tans=1\r\n\tfor j in range(n,1,-1):\r\n\t\tif possible(j,n):\r\n\t\t\tans=j\r\n\t\t\tbreak\r\n\tprint(ans)\r\n\t# low=1\r\n\t# high=n\r\n\t# while low<=high:\r\n\t# \tmid=(low+high)//2\r\n\t# \tif mid%2==0:\r\n\t# \t\tif low%2==0:\r\n\t# \t\t\tlow+=1\r\n\t# \t\t\tmid+=1\r\n\t# \t\telif high%2==0:\r\n\t# \t\t\thigh-=1\r\n\t# \t\t\tmid-=1\r\n\t# \t# if low>high:\r\n\t# \t# \tbreak\r\n\t# \tif possible(mid,n):\r\n\t# \t\tlow=mid+1\r\n\t# \telse:\r\n\t# \t\thigh=mid-1\r\n\t# \tprint(mid,low,high)\r\n\t# print(mid)\r\n", "from collections import defaultdict\r\nt = int(input())\r\nfor _ in range(t):\r\n s = input()\r\n s = list(s)\r\n l = s[:]\r\n n = len(s)\r\n ans = 0\r\n if n<=1000:\r\n if n<=100:\r\n l = []\r\n for i in range(n):\r\n for j in range(i+1,n):\r\n l.append(s[i:j])\r\n ans = 0\r\n for i in l:\r\n dic = defaultdict(lambda:0)\r\n for j in i:\r\n dic[j]+=1\r\n cnt = 0\r\n for k in dic.keys():\r\n if dic[k]%2==1:\r\n cnt+=1\r\n if cnt<=1:\r\n ans = max(ans,len(i))\r\n print(ans)\r\n continue\r\n for i in range(n):\r\n dic = defaultdict(lambda:0)\r\n unmatched = 0\r\n for j in range(i,n):\r\n dic[l[j]]+=1 \r\n if dic[l[j]]%2==1:\r\n unmatched+=1\r\n else:\r\n unmatched-=1 \r\n if unmatched<=1:\r\n ans = max(ans,j-i+1) \r\n \r\n print(ans)\r\n else:\r\n for i in range(n):\r\n dic = defaultdict(lambda:0)\r\n unmatched = 0\r\n for j in range(i+1,n):\r\n dic[l[j]]+=1 \r\n if dic[l[j]]%2==1:\r\n unmatched+=1\r\n else:\r\n unmatched-=1 \r\n if unmatched<=1:\r\n ans = max(ans,j-i+1) \r\n \r\n print(ans)", "import sys\r\nimport math\r\nfrom collections import defaultdict,Counter\r\n\r\n# input=sys.stdin.readline\r\n# def print(x):\r\n# sys.stdout.write(str(x)+\"\\n\")\r\n\r\n# sys.stdout=open(\"CP1/output.txt\",'w')\r\n# sys.stdin=open(\"CP1/input.txt\",'r')\r\n\r\ndef possible(n1,n):\r\n\t# d=defaultdict(int)\r\n\todd=set()\r\n\t# even=set()\r\n\tfor j in range(n):\r\n\t\t# print(odd)\r\n\t\tif s[j] in odd:\r\n\t\t\todd.remove(s[j])\r\n\t\t\t# even.add(s[j])\r\n\t\telse:\r\n\t\t\todd.add(s[j])\r\n\t\t# d[s[j]]+=1\r\n\t\t# print(odd)\r\n\t\tif j<n1-1:\r\n\t\t\tcontinue\r\n\t\t# print(j)\r\n\t\tif len(odd)==1:\r\n\t\t\treturn True\r\n\r\n\t\tif s[j-n1+1] in odd:\r\n\t\t\todd.remove(s[j-n1+1])\r\n\t\t\t# even.add(s[j])\r\n\t\telse:\r\n\t\t\todd.add(s[j-n1+1])\r\n\treturn False\r\n# m=pow(10,9)+7\r\nt=int(input())\r\nfor i in range(t):\r\n\ts=list(input())\r\n\tn=len(s)\r\n\tans=1\r\n\tfor j in range(n,1,-1):\r\n\t\tif possible(j,n):\r\n\t\t\tans=j\r\n\t\t\tbreak\r\n\tprint(ans)\r\n\t# low=1\r\n\t# high=n\r\n\t# while low<=high:\r\n\t# \tmid=(low+high)//2\r\n\t# \tif mid%2==0:\r\n\t# \t\tif low%2==0:\r\n\t# \t\t\tlow+=1\r\n\t# \t\t\tmid+=1\r\n\t# \t\telif high%2==0:\r\n\t# \t\t\thigh-=1\r\n\t# \t\t\tmid-=1\r\n\t# \t# if low>high:\r\n\t# \t# \tbreak\r\n\t# \tif possible(mid,n):\r\n\t# \t\tlow=mid+1\r\n\t# \telse:\r\n\t# \t\thigh=mid-1\r\n\t# \tprint(mid,low,high)\r\n\t# print(mid)\r\n", "import sys\n\ndef GRIG(L):\n\n MINT = 1\n GOT = 0\n\n DY = [[set(), 0, 0]]\n L_DY = 0\n\n for i in L:\n\n L_DY += 1\n DY.append([set(), 0, 0])\n\n for j in range(L_DY - 1, -1, -1):\n if i in DY[j][0]:\n DY[j][0].remove(i)\n DY[j][1] -= 1\n else:\n DY[j][0].add(i)\n DY[j][1] += 1\n\n DY[j][2] += 1\n if (DY[j][2] > MINT and DY[j][1] <= 1):\n MINT = DY[j][2]\n\n return MINT\n\nTESTCASES = int(input().strip())\n\nfor i in range(0, TESTCASES):\n \n L = [int(x) for x in list(input().strip())]\n \n print(GRIG(L))\n", "from collections import defaultdict\nt = int(input())\nfor _ in range(t):\n s = input()\n s = list(s)\n l = s[:]\n n = len(s)\n ans = 0\n \n if n<=100:\n l = []\n for i in range(n):\n for j in range(i+1,n):\n l.append(s[i:j])\n ans = 0\n for i in l:\n dic = defaultdict(lambda:0)\n for j in i:\n dic[j]+=1\n cnt = 0\n for k in dic.keys():\n if dic[k]%2==1:\n cnt+=1\n if cnt<=1:\n ans = max(ans,len(i))\n print(ans)\n continue\n for i in range(n):\n dic = defaultdict(lambda:0)\n unmatched = 0\n for j in range(i,n):\n dic[l[j]]+=1 \n if dic[l[j]]%2==1:\n unmatched+=1\n else:\n unmatched-=1 \n if unmatched<=1:\n ans = max(ans,j-i+1) \n \n \n print(ans)", "from sys import stdin\r\n\r\n#stdin = open(\"input\", \"r\")\r\n\r\nfor _ in range(int(stdin.readline())):\r\n s = stdin.readline().strip()\r\n m = 1\r\n for i in range(len(s)):\r\n k = set()\r\n k.add(s[i])\r\n for j in range(i + 1, len(s)):\r\n if s[j] in k:\r\n k.remove(s[j])\r\n else:\r\n k.add(s[j])\r\n if len(k) < 2:\r\n m = max(m, j - i + 1)\r\n print(m)\r\n", "# cook your dish here\ndef isgood(s):\n c=0\n for i in set(s):\n k=s.count(i)\n if k%2 and c:\n return 0\n elif k%2:\n c=1\n #print(s)\n return 1\ntc=int(input())\nfor i in range(tc):\n flag=0\n s=input()\n n=len(s)\n g=n\n while g:\n for i in range(n-g+1):\n if isgood(s[i:i+g]):\n print(g)\n flag=1\n break\n g-=1\n if flag:\n break\n", "# cook your dish here\ndef isgood(s):\n c=0\n for i in set(s):\n k=s.count(i)\n if k%2:\n c+=1 \n if c==2:\n return 0\n #print(s)\n return 1\ntc=int(input())\nfor i in range(tc):\n flag=0\n s=input()\n n=len(s)\n g=n\n while g:\n for i in range(n-g+1):\n if isgood(s[i:i+g]):\n print(g)\n flag=1\n break\n g-=1\n if flag:\n break\n", "# cook your dish here\ndef isgood(s):\n c=0\n for i in set(s):\n k=s.count(i)\n if k%2:\n c+=1 \n if c==2:\n return 0\n #print(s)\n return 1\ntc=int(input())\nfor i in range(tc):\n flag=0\n s=input()\n n=len(s)\n g=n\n while g:\n for i in range(n-g+1):\n if isgood(s[i:i+g]):\n print(g)\n flag=1\n break\n g-=1\n if flag:\n break\n"] | {"inputs": [["1", "123343"]], "outputs": [["3"]]} | INTERVIEW | PYTHON3 | CODECHEF | 10,242 | |
a8cc545f3a2452be990ba727156d20bd | UNKNOWN | There is a new prodigy in town and he has challenged people to a game. They have to give him an integer N and he will immediately respond with a number which has more than N factors.
What the prodigy really does is to do some complex calculations in his head to find out the smallest integer with more than N factors. However, he has a weakness - he knows to do those calculation only on numbers up to 1019, so if the answer to be reported is more than 1019, he will not be able to come up with his solution and will lose the game.
Given the integer the people give to the prodigy, you need to report whether he wins the game or not. If he wins, also output his answer.
-----Input-----
The first line of input contains T (T ≤ 25), the number of test cases. Following this are T lines, each containing an integer N (1 ≤ N ≤ 109) - the number which is given to the prodigy.
-----Output-----
Output one line per test case. If the smallest integer X with more than N factors is bigger than 1019 so that the prodigy does not win, print "lose". Otherwise print "win X" (quotes for clarity).
-----Example-----
Input:
3
3
5
12345678
Output:
win 6
win 12
lose | ["divisors = [1 , 2 , 3 , 4 , 6 , 8 , 9 , 10 , 12 , 16 , 18 , 20 , 24 , 30 , 32 , 36 , 40 , 48 , 60 , 64 , 72 , 80 , 84 , 90 , 96 , 100 , 108 , 120 , 128 , 144 , 160 , 168 , 180 , 192 , 200 , 216 , 224 , 240 , 256 , 288 , 320 , 336 , 360 , 384 , 400 , 432 , 448 , 480 , 504 , 512 , 576 , 600 , 640 , 672 , 720 , 768 , 800 , 864 , 896 , 960 , 1008 , 1024 , 1152 , 1200 , 1280 , 1344 , 1440 , 1536 , 1600 , 1680 , 1728 , 1792 , 1920 , 2016 , 2048 , 2304 , 2400 , 2688 , 2880 , 3072 , 3360 , 3456 , 3584 , 3600 , 3840 , 4032 , 4096 , 4320 , 4608 , 4800 , 5040 , 5376 , 5760 , 6144 , 6720 , 6912 , 7168 , 7200 , 7680 , 8064 , 8192 , 8640 , 9216 , 10080 , 10368 , 10752 , 11520 , 12288 , 12960 , 13440 , 13824 , 14336 , 14400 , 15360 , 16128 , 16384 , 17280 , 18432 , 20160 , 20736 , 21504 , 23040 , 24576 , 25920 , 26880 , 27648 , 28672 , 28800 , 30720 , 32256 , 32768 , 34560 , 36864 , 40320 , 41472 , 43008 , 46080 , 48384 , 49152 , 51840 , 53760 , 55296 , 57600 , 61440 , 62208 , 64512 , 65536 , 69120 , 73728 , 80640 , 82944 , 86016 , 92160 , 96768 , 98304 , 103680 , 107520 , 110592 , 115200 , 122880 , 124416 , 129024 , 131072 , 138240 , 147456 , 153600 , 161280 , 165888 , 172032 , 184320 , 193536 , 196608 , 207360 , 215040 , 221184 , 230400 , 245760]\nnumbers = [1 , 2 , 4 , 6 , 12 , 24 , 36 , 48 , 60 , 120 , 180 , 240 , 360 , 720 , 840 , 1260 , 1680 , 2520 , 5040 , 7560 , 10080 , 15120 , 20160 , 25200 , 27720 , 45360 , 50400 , 55440 , 83160 , 110880 , 166320 , 221760 , 277200 , 332640 , 498960 , 554400 , 665280 , 720720 , 1081080 , 1441440 , 2162160 , 2882880 , 3603600 , 4324320 , 6486480 , 7207200 , 8648640 , 10810800 , 14414400 , 17297280 , 21621600 , 32432400 , 36756720 , 43243200 , 61261200 , 73513440 , 110270160 , 122522400 , 147026880 , 183783600 , 245044800 , 294053760 , 367567200 , 551350800 , 698377680 , 735134400 , 1102701600 , 1396755360 , 2095133040 , 2205403200 , 2327925600 , 2793510720 , 3491888400 , 4655851200 , 5587021440 , 6983776800 , 10475665200 , 13967553600 , 20951330400 , 27935107200 , 41902660800 , 48886437600 , 64250746560 , 73329656400 , 80313433200 , 97772875200 , 128501493120 , 146659312800 , 160626866400 , 240940299600 , 293318625600 , 321253732800 , 481880599200 , 642507465600 , 963761198400 , 1124388064800 , 1606268664000 , 1686582097200 , 1927522396800 , 2248776129600 , 3212537328000 , 3373164194400 , 4497552259200 , 6746328388800 , 8995104518400 , 9316358251200 , 13492656777600 , 18632716502400 , 26985313555200 , 27949074753600 , 32607253879200 , 46581791256000 , 48910880818800 , 55898149507200 , 65214507758400 , 93163582512000 , 97821761637600 , 130429015516800 , 195643523275200 , 260858031033600 , 288807105787200 , 391287046550400 , 577614211574400 , 782574093100800 , 866421317361600 , 1010824870255200 , 1444035528936000 , 1516237305382800 , 1732842634723200 , 2021649740510400 , 2888071057872000 , 3032474610765600 , 4043299481020800 , 6064949221531200 , 8086598962041600 , 10108248702552000 , 12129898443062400 , 18194847664593600 , 20216497405104000 , 24259796886124800 , 30324746107656000 , 36389695329187200 , 48519593772249600 , 60649492215312000 , 72779390658374400 , 74801040398884800 , 106858629141264000 , 112201560598327200 , 149602080797769600 , 224403121196654400 , 299204161595539200 , 374005201994424000 , 448806242393308800 , 673209363589963200 , 748010403988848000 , 897612484786617600 , 1122015605983272000 , 1346418727179926400 , 1795224969573235200 , 2244031211966544000 , 2692837454359852800 , 3066842656354276800 , 4381203794791824000 , 4488062423933088000 , 6133685312708553600 , 8976124847866176000 , 9200527969062830400]\nt = int(input())\nfor x in range(0, t):\n a = int(input())\n i = 0\n for y in divisors:\n if y > a:\n print(\"win\", numbers[i])\n break\n i = i+1\n else:\n print(\"lose\")\n", "arr=((1,1),(2,2),(4,3),(6,4),(12,6),(24,8),(36,9),(48,10),(60,12),(120,16),(180,18),(240,20),(360,24),(720,30),(840,32),(1260,36),(1680,40),(2520,48),(5040,60),(7560,64),(10080,72),(15120,80),(20160,84),(25200,90),(27720,96),(45360,100),(50400,108),(55440,120),(83160,128),(110880,144),(166320,160),(221760,168),(277200,180),(332640,192),(498960,200),(554400,216),(665280,224),(720720,240),(1081080,256),(1441440,288),(2162160,320),(2882880,336),(3603600,360),(4324320,384),(6486480,400),(7207200,432),(8648640,448),(10810800,480),(14414400,504),(17297280,512),(21621600,576),(32432400,600),(36756720,640),(43243200,672),(61261200,720),(73513440,768),(110270160,800),(122522400,864),(147026880,896),(183783600,960),(245044800,1008),(294053760,1024),(367567200,1152),(551350800,1200),(698377680,1280),(735134400,1344),(1102701600,1440),(1396755360,1536),(2095133040,1600),(2205403200,1680),(2327925600,1728),(2793510720,1792),(3491888400,1920),(4655851200,2016),(5587021440,2048),(6983776800,2304),(10475665200,2400),(13967553600,2688),(20951330400,2880),(27935107200,3072),(41902660800,3360),(48886437600,3456),(64250746560,3584),(73329656400,3600),(80313433200,3840),(97772875200,4032),(128501493120,4096),(146659312800,4320),(160626866400,4608),(240940299600,4800),(293318625600,5040),(321253732800,5376),(481880599200,5760),(642507465600,6144),(963761198400,6720),(1124388064800,6912),(1606268664000,7168),(1686582097200,7200),(1927522396800,7680),(2248776129600,8064),(3212537328000,8192),(3373164194400,8640),(4497552259200,9216),(6746328388800,10080),(8995104518400,10368),(9316358251200,10752),(13492656777600,11520),(18632716502400,12288),(26985313555200,12960),(27949074753600,13440),(32607253879200,13824),(46581791256000,14336),(48910880818800,14400),(55898149507200,15360),(65214507758400,16128),(93163582512000,16384),(97821761637600,17280),(130429015516800,18432),(195643523275200,20160),(260858031033600,20736),(288807105787200,21504),(391287046550400,23040),(577614211574400,24576),(782574093100800,25920),(866421317361600,26880),(1010824870255200,27648),(1444035528936000,28672),(1516237305382800,28800),(1732842634723200,30720),(2021649740510400,32256),(2888071057872000,32768),(3032474610765600,34560),(4043299481020800,36864),(6064949221531200,40320),(8086598962041600,41472),(10108248702552000,43008),(12129898443062400,46080),(18194847664593600,48384),(20216497405104000,49152),(24259796886124800,51840),(30324746107656000,53760),(36389695329187200,55296),(48519593772249600,57600),(60649492215312000,61440),(72779390658374400,62208),(74801040398884800,64512),(106858629141264000,65536),(112201560598327200,69120),(149602080797769600,73728),(224403121196654400,80640),(299204161595539200,82944),(374005201994424000,86016),(448806242393308800,92160),(673209363589963200,96768),(748010403988848000,98304),(897612484786617600,103680),(1122015605983272000,107520),(1346418727179926400,110592),(1795224969573235200,115200),(2244031211966544000,122880),\n(2692837454359852800,124416),(3066842656354276800,129024),(4381203794791824000,131072),(4488062423933088000,138240),(6133685312708553600,147456),(8976124847866176000,153600),(9200527969062830400,161280));\nt=int(input())\nwhile(t!=0):\n\tt-=1\n\tnum=int(input())\n\tif( num>=161280):\n\t\tprint(\"lose\\n\", end=' ')\n\telse :\n\t\tfor i in range(168):\n\t\t\tif(arr[i][1]>num):\n\t\t\t\tprint(\"win\",arr[i][0])\n\t\t\t\tbreak\n\n", "arr=((1,1),(2,2),(4,3),(6,4),(12,6),(24,8),(36,9),(48,10),(60,12),(120,16),(180,18),(240,20),\n (360,24),(720,30),(840,32),(1260,36),(1680,40),(2520,48),(5040,60),(7560,64),(10080,72),(15120,80),(20160,84),(25200,90),(27720,96),\n (45360,100),(50400,108),(55440,120),(83160,128),(110880,144),(166320,160),(221760,168),(277200,180),(332640,192),(498960,200),\n (554400,216),(665280,224),(720720,240),(1081080,256),(1441440,288),(2162160,320),(2882880,336),\n (3603600,360),(4324320,384),(6486480,400),(7207200,432),(8648640,448),(10810800,480),(14414400,504),(17297280,512),\n (21621600,576),(32432400,600),(36756720,640),(43243200,672),(61261200,720),(73513440,768),(110270160,800),\n (122522400,864),(147026880,896),(183783600,960),(245044800,1008),(294053760,1024),(367567200,1152),(551350800,1200),\n (698377680,1280),(735134400,1344),(1102701600,1440),(1396755360,1536),(2095133040,1600),(2205403200,1680),\n (2327925600,1728),(2793510720,1792),(3491888400,1920),(4655851200,2016),(5587021440,2048),(6983776800,2304),\n (10475665200,2400),(13967553600,2688),(20951330400,2880),(27935107200,3072),(41902660800,3360),(48886437600,3456),\n (64250746560,3584),(73329656400,3600),(80313433200,3840),(97772875200,4032),(128501493120,4096),(146659312800,4320),\n (160626866400,4608),(240940299600,4800),(293318625600,5040),(321253732800,5376),(481880599200,5760),(642507465600,6144),\n (963761198400,6720),(1124388064800,6912),(1606268664000,7168),(1686582097200,7200),(1927522396800,7680),(2248776129600,8064),\n (3212537328000,8192),(3373164194400,8640),(4497552259200,9216),(6746328388800,10080),(8995104518400,10368),(9316358251200,10752),\n (13492656777600,11520),(18632716502400,12288),(26985313555200,12960),(27949074753600,13440),(32607253879200,13824),\n (46581791256000,14336),(48910880818800,14400),(55898149507200,15360),(65214507758400,16128),(93163582512000,16384),\n (97821761637600,17280),(130429015516800,18432),(195643523275200,20160),(260858031033600,20736),(288807105787200,21504),\n (391287046550400,23040),(577614211574400,24576),(782574093100800,25920),(866421317361600,26880),(1010824870255200,27648),\n (1444035528936000,28672),(1516237305382800,28800),(1732842634723200,30720),(2021649740510400,32256),(2888071057872000,32768),\n (3032474610765600,34560),(4043299481020800,36864),(6064949221531200,40320),(8086598962041600,41472),(10108248702552000,43008),\n (12129898443062400,46080),(18194847664593600,48384),(20216497405104000,49152),(24259796886124800,51840),(30324746107656000,53760),\n (36389695329187200,55296),(48519593772249600,57600),(60649492215312000,61440),(72779390658374400,62208),(74801040398884800,64512),\n (106858629141264000,65536),(112201560598327200,69120),(149602080797769600,73728),(224403121196654400,80640),\n (299204161595539200,82944),(374005201994424000,86016),(448806242393308800,92160),(673209363589963200,96768),\n (748010403988848000,98304),(897612484786617600,103680),(1122015605983272000,107520),(1346418727179926400,110592),\n (1795224969573235200,115200),(2244031211966544000,122880),(2692837454359852800,124416),\n (3066842656354276800,129024),(4381203794791824000,131072),(4488062423933088000,138240),(6133685312708553600,147456),\n (8976124847866176000,153600),\n (9200527969062830400,161280)) ;\ntcase=int(eval(input()))\nwhile(tcase):\n\ttcase=tcase-1\n\tinp=int(eval(input()))\n\tif(inp>=161280):\n\t\tprint(\"lose\")\n\telse:\n\t\tfor i in range(0,168):\n\t\t\tif(arr[i][1]>inp):\n\t\t\t\tprint(\"win\",arr[i][0])\n\t\t\t\tbreak\n\t\n"] | {"inputs": [["3", "3", "5", "12345678"]], "outputs": [["win 6", "win 12", "lose"]]} | INTERVIEW | PYTHON3 | CODECHEF | 11,402 | |
4f798093bc395339474f3f28dac4ae19 | UNKNOWN | Given a number n. Find the last two digits of 5 ^ n ( 5 to the power of n ).
Remember that overflow can occur.
-----Input:-----
- N — the power in which you need to raise number 5.
-----Output:-----
Last two digits of 5^n.
-----Constraints-----
- $2 \leq N \leq 2.1018$
-----Sample Input:-----
2
-----Sample Output:-----
25 | ["print(25)", "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\nn=ii()\r\nprint(25)\r\n\r\n", "# cook your dish here\nx = int(input())\n\nif(x==0):\n print(0)\nelif(x==1):\n print(5)\nelse:\n print(25)", "_ = input()\nprint(25)", "N=float(eval(input()))\nprint(25)\n", "# cook your dish here\nn=float(input())\nprint(25)", "# cook your dish here\ndef power(x, y, p):\n res = 1\n x = x % p\n while (y > 0):\n if (y & 1):\n res = (res * x) % p \n y = y >> 1 \n x = (x * x) % p \n \n return res \n\ndef numberOfDigits(x): \n \n i = 0\n while (x): \n x //= 10\n i += 1\n \n return i \n\ndef LastTwoDigit(n): \n \n temp = 1\n for i in range(1, 3): \n temp *= 10\n \n temp = power(5, n, temp) \n\n for i in range(2 - numberOfDigits(temp)): \n print(0, end = \"\") \n \n if temp: \n print(temp) \n \ndef __starting_point(): \n n = int(input())\n LastTwoDigit(n)\n \n__starting_point()", "print(25)", "print(25)", "def p(x,y,p):\n res=1\n x=x%p\n while(y>0):\n if(y&1):\n res=(res*x)%p\n y=y>>1\n x=(x*x)%p\n return res\ndef nod(x):\n i=0\n while(x):\n x//=10\n i+=1\n return i\ndef ltd(n):\n temp=1\n for i in range(1,3):\n temp*=10\n temp=p(5,n,temp)\n for i in range(2-nod(temp)):\n print(0,end=\"\")\n if temp:\n print(temp)\ndef __starting_point():\n n=int(input())\n ltd(n)\n__starting_point()", "def p(x,y,p):\n res=1\n x=x%p\n while(y>0):\n if(y&1):\n res=(res*x)%p\n y=y>>1\n x=(x*x)%p\n return res\ndef nod(x):\n i=0\n while(x):\n x//=10\n i+=1\n return i\ndef ltd(n):\n temp=1\n for i in range(1,3):\n temp*=10\n temp=p(5,n,temp)\n for i in range(2-nod(temp)):\n print(0,end=\"\")\n if temp:\n print(temp)\ndef __starting_point():\n n=int(input())\n ltd(n)\n__starting_point()", "# cook your dish here\nn=int(input())\nprint(25)", "b = int(input())\r\nprint(int(25))", "print(25)\r\n", "# cook your dish here\nn=int(input())\nprint(25)\n", "n=int(input())\r\nprint(25)", "# cook your dish here\nprint('25')", "# cook your dish here\nn=eval(input())\nprint(25)\n", "# cook your dish here\nnum=int(input())\nprint(25)\n", "# cook your dish here\ndef power(x, y, p): \n \n res = 1 # Initialize result \n \n x = x % p # Update x if it is more \n # than or equal to p \n \n while (y > 0): \n \n # If y is odd, multiply \n # x with result \n if (y & 1): \n res = (res * x) % p \n \n # y must be even now \n y = y >> 1 # y = y/2 \n x = (x * x) % p \n \n return res \n \n# function to calculate \n# number of digits in x \ndef numberOfDigits(x): \n \n i = 0\n while (x): \n x //= 10\n i += 1\n \n return i \n \n# function to print \n# last 2 digits of 2^n \ndef LastTwoDigit(n): \n \n \"\"\"print(\"Last \" + str(2) + \n \" digits of \" + str(2), end = \"\") \n print(\"^\" + str(n) + \" = \", end = \"\")\"\"\"\n \n # Generating 10^2 \n temp = 1\n for i in range(1, 3): \n temp *= 10\n \n # Calling modular exponentiation \n temp = power(5, n, temp) \n \n # Printing leftmost zeros. \n # Since (2^n)%2 can have digits \n # less then 2. In that case we \n # need to print zeros \n for i in range(2 - numberOfDigits(temp)): \n print(0, end = \"\") \n \n # If temp is not zero then print temp \n # If temp is zero then already printed \n if temp: \n print(temp) \n \n# Driver Code \ndef __starting_point(): \n n = int(input())\n LastTwoDigit(n)\n \n__starting_point()", "a=int(input())\nprint(\"25\")\n", "n=int(input())\n\nprint(\"25\")", "n=int(input())\n\nprint(\"25\")", "# cook your dish here\nn=int(input())\n\nprint(25)", "# cook your dish here\nn = int(input())\n\nprint(25)"] | {"inputs": [["2"]], "outputs": [["25"]]} | INTERVIEW | PYTHON3 | CODECHEF | 4,892 | |
e5e7f95d5477e127c6e5fd23f2790b72 | UNKNOWN | You are given a set of n pens, each of them can be red, blue, green, orange, and violet in color. Count a minimum number of pens that should be taken out from the set so that any two neighboring pens have different colors. Pens are considered to be neighboring if there are no other pens between them.
-----Input:-----
-
The first line contains t denoting the number of test cases.
-
The first line of each test case will contain a single integer n.
-
The second line of each test case will contain a string s.
(s contains only 'R', 'B', 'G', 'O', and 'V' characters denoting red, blue, green, orange, and violet respectively)
-----Output:-----
For each test case, print single line containing one integer - The minimum number of pens that need to be taken out.
-----Constraints-----
- $1 \leq T \leq 100$
- $1 \leq n \leq 1000$
-----Sample Input:-----
2
5
RBBRG
5
RBGOV
-----Sample Output:-----
1
0
-----EXPLANATION:-----
In first test case, two blue pens are neighboring each other, if we take out any one of them then the string will be RBRG in which each pen has different neighbors.
In second test case, no pen needs to be taken out as each pen has different neighbors. | ["t = int(input())\n\nfor _ in range(t):\n n = int(input())\n a = input().strip()\n prev = a[0]\n ans = -1\n for i in a:\n if prev == i:\n ans += 1\n prev = i\n print(ans)\n", "try:\r\n t=int(input())\r\n for _ in range(t):\r\n n=int(input())\r\n s=list(str(input()))[:n]\r\n i,c=0,0\r\n while(True):\r\n if(i>=len(s)-1):\r\n break\r\n if(s[i]==s[i+1]):\r\n c+=1\r\n i+=1\r\n print(c) \r\nexcept:\r\n pass", "t = int(input())\r\nfor tc in range(t):\r\n n = int(input())\r\n s = input()\r\n l = 0\r\n for j in range(1, n):\r\n if s[j] == s[j - 1]:\r\n l = l + 1\r\n print(l)", "from sys import*\r\ninput=stdin.readline\r\nt=int(input())\r\nfor _ in range(t):\r\n c=0\r\n n=int(input())\r\n s=input()\r\n for i in range(1,n):\r\n if s[i-1]==s[i]:\r\n c+=1\r\n print(c)", "# cook your dish here\nn=int(input())\nfor i in range(n):\n k=int(input())\n s=input();c=0\n for i in range(0,k-1):\n if (s[i]==s[i+1]):\n c=c+1\n print(c) ", "t = int(input())\nfor _ in range(t):\n n = int(input())\n s = input()\n count = 0\n for i in range(len(s)-1):\n if s[i] == s[i+1]:\n count += 1\n print(count)", "# cook your dish here\nfor i in range(int(input())):\n n = int(input())\n count = 0\n colours = input()\n for j in range(1,n):\n if colours[j]==colours[j-1]:\n count += 1\n \n print(count)\n", "# cook your dish here\nfor _ in range(int(input())):\n n=int(input())\n s=input()\n c=0\n if n==1:\n print(\"0\")\n else:\n p=s[0]\n for i in range(1,n):\n if p==s[i]:\n c+=1\n p=s[i]\n print(c)", "# cook your dish here\n\nfor _ in range(int(input())):\n \n n=int(input())\n s=input()\n c=0\n for i in range(1,n):\n if s[i]==s[i-1]:\n c+=1\n print(c)", "# cook your dish here\nt=int(input())\nfor i in range(t):\n n=int(input())\n s=input()\n s=list(s)\n c=0\n for j in range(len(s)-1):\n if(s[j]==s[j+1]):\n c=c+1\n print(c)", "# cook your dish here\ndef colour(s):\n c=0\n for i in range(len(s)-1):\n if(i==len(s)-1):\n break\n if (s[i]==s[i+1]):\n \n c+=1\n print(c)\nt=int(input())\nfor _ in range(t):\n n=int(input())\n s=list(input())\n colour(s)", "t=int(input())\r\nfor i in range(t):\r\n\tn=int(input())\r\n\ts=input() #qwert 01234\r\n\tc=0\r\n\tfor j in range(n):\r\n\t \tif(j+1<n):\r\n\t \t\tif(s[j]==s[j+1]):\r\n\t \t\t\tc=c+1\r\n\tprint(c)\t\t", "for i in range(int(input())):\r\n n = int(input())\r\n s = [x for x in input().strip()]\r\n cnt= 0\r\n for i in range(0,len(s)-1):\r\n if s[i] == s[i+1]:\r\n cnt+=1\r\n print(cnt)", "testcase=int(input())\r\nwhile testcase:\r\n\tl=int(input())\r\n\tdata=input()\r\n\tcount=0\r\n\tfor i in range(l-1):\r\n\t\tif data[i]==data[i+1]:count+=1\r\n\tprint(count)\r\n\ttestcase-=1", "t=int(input())\r\nfor _ in range(t):\r\n n=int(input())\r\n a=input()\r\n count=0\r\n i=0\r\n j=1\r\n while(i<n and j<n):\r\n if(a[i]==a[j]):\r\n count=count+1\r\n i=i+1\r\n j=j+1\r\n print(count)", "# cook your dish here\nfor _ in range(int(input())):\n n = int(input())\n s = str(input())\n lst = []\n c = 0\n for i in range(n-1):\n if s[i] != s[i+1]:\n pass\n else:\n c += 1\n print(c)", "t=int(input())\r\nfor _ in range(t):\r\n n=int(input())\r\n a=input()\r\n count=0\r\n i=0\r\n j=1\r\n while(i<n and j<n):\r\n if(a[i]==a[j]):\r\n count=count+1\r\n i=i+1\r\n j=j+1\r\n print(count)", "t=int(input())\r\nfor _ in range(t):\r\n n=int(input())\r\n s=input()\r\n i=1\r\n c=0\r\n while i<n:\r\n if s[i]==s[i-1]:\r\n c+=1\r\n i+=1\r\n print(c)\r\n \r\n \r\n", "try:\r\n t=int(input())\r\n for _ in range(t):\r\n n=int(input())\r\n l=input()\r\n i,res=0,0\r\n while(i<n):\r\n count=0\r\n while(i<n-1 and l[i]==l[i+1]):\r\n i+=1\r\n count+=1\r\n res+=count\r\n i+=1\r\n print(res)\r\nexcept EOFError:\r\n pass", "# cook your dish here\nfor t in range(int(input())):\n n=int(input())\n a=list(input())\n count=0\n j=1\n for i in range(0,n-1):\n if a[i]==a[j]:\n j+=1 \n count+=1\n pass\n else:\n j+=1\n print(count)", "# cook your dish here\n\nfor _ in range(int(input())):\n n = int(input())\n arr = list(i for i in input())\n # print(arr)\n \n count=0\n char=arr[0]\n for j in range(1,n):\n if(char==arr[j]):\n # del arr[i]\n count+=1\n char = arr[j]\n \n \n \n # print(arr)\n print(count)\n", "for _ in range(int(input())):\r\n lens = int(input())\r\n inps = input()\r\n stck = [inps[0]]\r\n need = 0\r\n for i in range(1, lens):\r\n if inps[i] == stck[-1]:\r\n need += 1\r\n else:\r\n stck.append(inps[i])\r\n print(need)\r\n", "# cook your dish here\nt = int(input())\n\nfor _ in range(t):\n n = int(input())\n s = str(input())\n prev = ''\n count = 0\n for i in s:\n if i == prev:\n count += 1\n else:\n prev = i\n \n print(count)", "# cook your dish here\nfrom collections import deque\nfor i in range(int(input())):\n n=int(input())\n a=input()\n c=0\n for i in range(len(a)-1):\n if a[i]==a[i+1]:\n c+=1\n print(c)\n \n \n", "# cook your dish here\ntc=int(input())\nfor t in range(tc):\n n=int(input())\n st=input()\n c=0\n for i in range(1,n):\n if st[i]==st[i-1]:\n i+=1\n c+=1\n print(c)"] | {"inputs": [["2", "5", "RBBRG", "5", "RBGOV"]], "outputs": [["1", "0"]]} | INTERVIEW | PYTHON3 | CODECHEF | 6,214 | |
0c4254d08835724547a13d9e72fc39e8 | UNKNOWN | You are standing near a very strange machine. If you put C cents in the machine, the remaining money in your purse will transform in an unusual way. If you have A dollars and B cents remaining in your purse after depositing the C cents, then after the transformation you will have B dollars and A cents. You can repeat this procedure as many times as you want unless you don't have enough money for the machine. If at any point C > B and A > 0, then the machine will allow you to break one of the A dollars into 100 cents so you can place C cents in the machine. The machine will not allow you to exchange a dollar for 100 cents if B >= C.
Of course, you want to do this to maximize your profit. For example if C=69 and you have 9 dollars and 77 cents then after you put 69 cents in the machine you will have 8 dollars and 9 cents (9.77 --> 9.08 --> 8.09). But I should warn you that you can't cheat. If you try to throw away 9 cents before the transformation (in order to obtain 99 dollars and 8 cents after), the machine will sense you are cheating and take away all of your money. You need to know how many times you should do this transformation in order to make a maximum profit. Since you are very busy man, you want to obtain the maximum possible profit in the minimum amount of time.
-----Input-----
The first line contains a single integer T <= 40, the number of test cases. T test cases follow. The only line of each test case contains three nonnegative integers A, B and C where A, B, C < 100. It means that you have A dollars and B cents in your purse and you need to put C cents in the machine to make the transformation.
-----Output-----
For each test case, output a single line containing the minimal number of times you should do this transformation in order to make a maximal profit. It is guaranteed that the answer is less than 10000.
-----Example-----
Input:
2
9 77 69
98 99 69
Output:
4
0
-----Explanation-----
In the first test we have the following sequence: 9.77, 8.09, 40.07, 38.39, 70.37, 68.69, 0.68. After last step we have not enough money for further transformations. The maximal profit will be after 4 transformations. | ["# cook your dish here\r\nfor _ in range(int(input())):\r\n a,b,c=list(map(int, input().split()))\r\n p=a*100+b\r\n mx=p \r\n ans, cnt = 0, 0\r\n while True:\r\n cnt+=1 \r\n if p<c or cnt==10000:\r\n break\r\n \r\n else:\r\n p-=c \r\n a=p//100\r\n b=p%100\r\n p=b*100+a\r\n if p>mx:\r\n mx=p\r\n ans=cnt\r\n \r\n print(ans) ", "# cook your dish here\ntest=int(input())\nfor _ in range(test):\n a,b,c=[int(x) for x in input().split()]\n t=s=0\n m=100*a+b\n while a*100+b>c and t<=10000:\n if b<c:\n a-=1\n b+=100\n b-=c\n temp=b\n b=a\n a=temp\n t+=1\n if a*100+b>m:\n m=a*100+b\n s=t\n print(s)", "T = int(input())\r\nfor i in range(T):\r\n a, b, c = [int(x) for x in input().split()]\r\n t = s = 0\r\n m = 100 * a + b\r\n while (a * 100 + b > c and t <= 10000):\r\n if b < c:\r\n a -= 1\r\n b += 100\r\n b -= c\r\n temp = b\r\n b = a\r\n a = temp\r\n t += 1\r\n if (a * 100) + b > m:\r\n m = a * 100 + b\r\n s = t\r\n print(s)", "t=int(input())\nwhile(t>0):\n a,b,c=[int(x) for x in input().split()]\n _count=pos_max=0\n _max=100*a+b\n while (a*100+b>c and _count<=10000):\n if b<c:\n a-=1\n b+=100\n b-=c\n temp=b\n b=a\n a=temp\n _count+=1\n if a*100+b>_max:\n _max=a*100+b\n pos_max=_count\n\n print(pos_max)\n t-=1\n", "for _ in range(int(input())):\r\n dollar, cents, C = map(int, input().split())\r\n mx = 100*dollar + cents\r\n mx_i = 0\r\n for i in range(1,10001):\r\n if cents >= C:\r\n dollar, cents = cents - C, dollar\r\n if 100 * dollar + cents > mx:\r\n mx = 100 * dollar + cents\r\n mx_i = i\r\n else:\r\n dollar -= 1\r\n cents += 100\r\n dollar, cents = cents - C, dollar\r\n if 100 * dollar + cents > mx:\r\n mx = 100 * dollar + cents\r\n mx_i = i\r\n if 100 * dollar + cents < C:\r\n break\r\n print(mx_i)", "for _ in range(int(input())):\r\n a, b, c = map(int, input().split())\r\n ans, cur_max, cur, count = 0, [a, b], 0, 10000\r\n while count > 0 and (b >= c or a > 0):\r\n cur += 1\r\n count -= 1\r\n if b < c:\r\n b += 100\r\n a -= 1\r\n \r\n b -= c\r\n if cur_max < [b, a]:\r\n ans = cur\r\n cur_max = [b, a]\r\n a, b = b, a\r\n print(ans)", "def convert(dollars, cents, required):\r\n a = dollars\r\n b = cents\r\n if b >= required:\r\n return ((b-required, a))\r\n else:\r\n a = a-1\r\n b = b+100\r\n return ((b-required, a))\r\n\r\n# print(convert(2, 55, 30))\r\n\r\nfor _ in range(int(input())):\r\n thearr = []\r\n a, b, c = map(int,input().split())\r\n thearr.append((a,b))\r\n max_so_far = thearr[0][0] + thearr[0][1]/100\r\n transform = 0\r\n index = 1\r\n count = 0\r\n while a+b/100 > c/100 and count < 10000:\r\n z = convert(a, b, c)\r\n sum = z[0] + z[1]/100\r\n if sum > max_so_far:\r\n max_so_far = sum\r\n transform = index\r\n thearr.append(z)\r\n a, b = z\r\n index += 1\r\n count += 1\r\n # print(thearr, a, b)\r\n\r\n print(transform)\r\n # print(thearr[:10])"] | {"inputs": [["2", "9 77 69", "98 99 69", "", ""]], "outputs": [["4", "0"]]} | INTERVIEW | PYTHON3 | CODECHEF | 3,586 | |
ef840a93b67d299b769c86cc9c586731 | UNKNOWN | Chef likes to play with big numbers. Today, he has a big positive integer N. He can select any two digits from this number (the digits can be same but their positions should be different) and orders them in any one of the two possible ways. For each of these ways, he creates a two digit number from it (might contain leading zeros). Then, he will pick a character corresponding to the ASCII value equal to this number, i.e. the number 65 corresponds to 'A', 66 to 'B' and so on till 90 for 'Z'. Chef is only interested in finding which of the characters in the range 'A' to 'Z' can possibly be picked this way.
-----Input-----
The first line of the input contains an integer T denoting the number of test cases.
The first line of the input contains an integer N.
-----Output-----
For each test case, output a string containing characters Chef can pick in sorted order If the resulting size of string is zero, you should output a new line.
-----Constraints-----
- 1 ≤ T ≤ 10
- 1 ≤ N ≤ 10100000
-----Subtasks-----
- Subtask #1 (40 points) N ≤ 1010
- Subtask #2 (60 points) Original Constraints
-----Example-----
Input:
4
65
566
11
1623455078
Output:
A
AB
ACDFGHIJKLNPQRSTUVW
-----Explanation-----
Example case 1. Chef can pick digits 6 and 5 and create integers 56 and 65. The integer 65 corresponds to 'A'.
Example case 2. Chef can pick digits 6 and 5 and create 'A' as it equals 65. He can pick 6 and 6 (they are picked from position 2 and position 3, respectively) to create 'B' too. Hence answer is "AB".
Example case 3. It's not possible to create any character from 'A' to 'Z'. Hence, we just print a new line. | ["test=int(input())\nfor i in range(test):\n N=input()\n X=[]\n list2=[]\n for x in N:\n X.append(x)\n list1=[]\n list1=list(set(X))\n output=''\n for x in list1:\n for y in X:\n if int(x)>=6:\n n=int(x)*10+int(y)\n list2.append(n)\n for j in list1:\n if int(j)>=6:\n m=int(j)*10+int(j)\n list2.remove(m)\n list2.sort()\n if len(list2)==0:\n print(\" \")\n else:\n list2.sort()\n for k in list2:\n if chr(k) not in output and 64<k<91:\n output+=chr(k)\n print(output)\n \n", "test=int(input())\nfor i in range(test):\n N=input()\n X=[]\n for x in N:\n X.append(x)\n Y=[]\n list1=[]\n output=''\n for y in X:\n if int(y)>=6 and int(y) not in Y:\n Y.append(y)\n for x in Y:\n for y in X:\n if int(x)==6:\n if int(y)>=5:\n n=int(x)*10+int(y)\n list1.append(n)\n elif int(x)==9:\n if int(y)==0:\n n=int(x)*10+int(y)\n list1.append(n) \n else:\n n=int(x)*10+int(y)\n list1.append(n)\n for j in Y:\n if int(j)!=9:\n m=int(j)*10+int(j)\n list1.remove(m)\n \n list1.sort()\n if len(list1)==0:\n print(\" \")\n else:\n list1.sort()\n for k in list1:\n if chr(k) not in output:\n output+=chr(k)\n print(output)", "test=int(input())\nfor i in range(test):\n N=input()\n X=[]\n for x in N:\n X.append(x)\n Y=[]\n list1=[]\n output=''\n for y in X:\n if int(y)>=6 and int(y) not in Y:\n Y.append(y)\n for x in Y:\n for y in X:\n if int(x)==6:\n if int(y)>=5:\n n=int(x)*10+int(y)\n list1.append(n) \n else:\n n=int(x)*10+int(y)\n list1.append(n)\n for j in Y:\n m=int(j)*10+int(j)\n list1.remove(m)\n list1.sort()\n if len(list1)==0:\n print(\" \")\n else:\n list1.sort()\n for k in list1:\n if chr(k) not in output and k<91:\n output+=chr(k)\n print(output)", "test=int(input())\nfor i in range(test):\n N=input()\n X=[]\n for x in N:\n X.append(x)\n Y=[]\n list1=[]\n output=''\n for y in X:\n if int(y)>=6 and int(y) not in Y:\n Y.append(y)\n for x in Y:\n for y in X:\n if int(x)==6:\n if int(y)>=5:\n n=int(x)*10+int(y)\n list1.append(n) \n else:\n n=int(x)*10+int(y)\n list1.append(n)\n for j in Y:\n m=int(j)*10+int(j)\n list1.remove(m)\n list1.sort()\n if len(list1)==0:\n print(\" \")\n else:\n list1.sort()\n for k in list1:\n if chr(k) not in output and k<91:\n output+=chr(k)\n print(output)\n \n \n \n", "for t in range(int(input())):\n word=input()\n lis=list(word)\n d={}\n for l in range(10):\n d[l]=None\n s=''\n for w in lis:\n if d[int(w)]!=None:\n d[int(w)]+=1\n else:\n d[int(w)]=1\n \n for i in range(5,10):\n if d[i]!=None and i!=6 and d[6]!=None:\n s=s+chr(60+i)\n if d[i]!=None and d[i]>=2 and i==6:\n s=s+chr(60+i)\n for i in range(10):\n if d[i]!=None and i!=7 and d[7]!=None:\n s=s+chr(70+i)\n if d[i]!=None and d[i]>=2 and i==7:\n s=s+chr(70+i)\n for i in range(10):\n if d[i]!=None and i!=8 and d[8]!=None:\n s=s+chr(80+i)\n if d[i]!=None and d[i]>=2 and i==8:\n s=s+chr(80+i)\n if d[9]!=None and d[0]!=None:\n s=s+chr(90)\n if len(s)==0:\n print()\n else:\n print(s)\n \n \n", "import numpy as np\nfor t in range(int(input())):\n n = list(input())\n arr = [int(x) for x in n]\n num = []\n if 6 in arr:\n for i in arr:\n if i>=5:\n num.append(6*10 + i)\n if 66 in num:\n num.remove(66)\n if 7 in arr:\n for i in arr:\n num.append(7*10 + i)\n if 77 in num:\n num.remove(77)\n if 8 in arr:\n for i in arr:\n num.append(8*10 + i)\n if 88 in num:\n num.remove(88)\n if 9 in arr:\n if 0 in arr:\n num.append(90)\n num = np.array(num)\n np.sort(num)\n ch = ''\n for i in np.unique(num):\n ch += chr(i)\n \n print(ch)\n", "t = int(input())\nfor p in range(t):\n n = str(input())\n l = len(n)\n cnt = [0] * 10\n for i in range(l):\n if (cnt[int(n[i])] < 2):\n cnt[int(n[i])] += 1\n output = []\n if (cnt[6] > 0):\n for j in range(5, 10):\n if (cnt[j] > 0 and j != 6):\n output.append(chr(6 * 10 + j))\n elif (j == 6 and cnt[j] > 1):\n output.append(chr(66))\n if (cnt[7] > 0):\n for j in range(0, 10):\n if (cnt[j] > 0 and j != 7):\n output.append(chr(7 * 10 + j))\n elif (j == 7 and cnt[j] > 1):\n output.append(chr(77))\n if (cnt[8] > 0):\n for j in range(0, 10):\n if (cnt[j] > 0 and j != 8):\n output.append(chr(8 * 10 + j))\n elif (j == 8 and cnt[j] > 1):\n output.append(chr(88))\n\n if (cnt[9] > 0):\n if (cnt[0] > 0):\n output.append(chr(90))\n ops = ''.join(output)\n if (len(ops) != 0):\n print(ops)\n else:\n print()", "from itertools import permutations\nfor j in range(int(input())):\n n=input()\n c=\"\"\n x=list(permutations(n,2))\n a=set(x)\n for i in a:\n z=i[0]+i[1]\n if(int(z)>=65 and int(z)<=90):\n c+=chr(int(z))\n if(c==\"\"):\n print(\"\")\n else:\n am=list(c)\n am.sort()\n bm=\"\".join(am)\n print(bm)\n", "from itertools import permutations\nfrom collections import Counter\nfor _ in range(int(input())):\n a=list(input())\n a=map(int,a)\n z=dict(Counter(a))\n l=list(z.keys())\n for i in sorted(z.keys()):\n j=z[i]\n if i>5:\n if j >1:\n for k in sorted(l):\n if i*10+k<91 and i*10+k>64:\n print(chr(i*10+k),end=\"\")\n else:\n l.remove(i)\n for k in sorted(l):\n if i*10+k<91 and i*10+k>64 :\n print(chr(i*10+k),end=\"\")\n l.append(i)\n print()", "# cook your dish here\nfrom itertools import permutations\nfor _ in range(int(input())):\n a=list(input())\n for i in sorted(set(permutations(a,2))):\n c=int(i[0])*10+int(i[1])\n if c>=65 and c<91:\n print(chr(c),end=\"\")\n print(\"\")", "from collections import Counter \nfor i in range(int(input())):\n a = [int(i) for i in str(input())];a1 = [];asdf = Counter(a)\n for n in range(65, 91):\n nn = n%10;nn1 = n//10\n if nn == nn1:\n if asdf[nn] >= 2:a1.append(chr(n))\n else:\n if asdf[nn]>0 and asdf[nn1]> 0:a1.append(chr(n))\n print() if len(a1) == 0 else print(''.join(a1)) ", "from collections import Counter \n\nfor i in range(int(input())):\n a = [int(i) for i in str(input())]\n a1 = []\n # print(a, Counter(a), Counter(a)[6])\n asdf = Counter(a)\n for n in range(65, 91):\n nn = n%10\n nn1 = n//10\n # print(nn, nn1, asdf[nn], asdf[nn1])\n if nn == nn1:\n if asdf[nn] >= 2:\n a1.append(chr(n))\n else:\n if asdf[nn]>0 and asdf[nn1]> 0:\n a1.append(chr(n))\n if len(a1) == 0:\n print()\n else:\n \n print(''.join(a1))", "t=int(input())\nfrom itertools import permutations\nfor i in range(t):\n n=int(input())\n s=list(str(n))\n l=[]\n perm=permutations(s,2)\n perm=set(list(perm))\n #print(list(perm))\n for i in list(perm):\n #print(i)\n s=\"\"\n s+=str(i[0])\n s+=str(i[1])\n s=int(s)\n if(s>=65 and s<=90):\n l.append(chr(s))\n l.sort()\n for i in l:\n print(i,end=\"\")\n \n print()\n \n ", "# cook your dish here\nfor _ in range(int(input())):\n s = input()\n a = [0 for x in range(10)]\n for i in s:\n a[ord(i)-ord('0')] += 1\n ans =\"\"\n \n if a[6]!=0:\n i = 6\n a[i] -=1\n for j in range(5,10):\n if a[j]!=0:\n ans += chr(60 + j)\n a[i] +=1\n \n for i in range(7,9):\n if a[i]!=0:\n a[i]-=1\n for j in range(10):\n if a[j]!=0:\n ans += chr(i*10 + j)\n a[i] += 1\n \n if a[9]!=0 and a[0]!=0:\n ans+='Z'\n print(ans)\n \n", "# cook your dish here\nfrom collections import Counter\nt=int(input())\nfor i in range(t):\n s=input()\n c=Counter(s)\n l=[]\n for item in list(c.keys()):\n if(c[item]>=2):\n l.append(item)\n l.append(item)\n else:\n l.append(item)\n l=[int(k) for k in l]\n ans=\"\"\n \n for j in range(len(l)):\n for k in range(j+1,len(l)):\n a=10*l[j]+l[k]\n b=10*l[k]+l[j]\n if(a>=65 and a<=90):\n ans+=str(chr(a))\n if(b>=65 and b<=90):\n ans+=str(chr(b))\n c=Counter(ans)\n l=list(c.keys())\n l.sort()\n ans=''\n for item in l:\n ans+=item\n print(ans)", "# cook your dish here\nfor i in range(int(input())):\n \n s=input()\n z=s\n h=\"\"\n l=[]\n k=0\n while(len(z)!=0):\n if(k>=len(z)):\n break\n if(int(z[k])<6):\n f=z[k]\n z=z.replace(f, '')\n h=h+f\n else:\n \n f=z[k]\n h=h+f\n k+=1\n \n \n \n for i in range(len(h)):\n \n a=int(h[i])\n \n if(a>=6):\n \n for j in range(len(h)):\n b=int(h[j])\n if(a==6) and (b<5):\n continue\n if(j!=i):\n \n \n \n n=(a*10)+b\n \n if(n>=65) and (n<=90):\n \n l.append(chr(n))\n \n \n l=set(l)\n l=list(l)\n l.sort()\n print(\"\".join(l))\n", "# cook your dish here\nfor i in range(int(input())):\n \n s=input()\n l=[]\n for i in range(len(s)):\n \n a=int(s[i])\n \n if(a>=6):\n \n for j in range(len(s)):\n b=int(s[j])\n if(a==6) and (b<5):\n continue\n if(j!=i):\n \n \n \n n=(a*10)+b\n \n if(n>=65) and (n<=90):\n \n l.append(chr(n))\n \n \n l=set(l)\n l=list(l)\n l.sort()\n print(\"\".join(l))\n"] | {"inputs": [["4", "65", "566", "11", "1623455078"]], "outputs": [["A", "AB", "ACDFGHIJKLNPQRSTUVW"]]} | INTERVIEW | PYTHON3 | CODECHEF | 8,798 | |
b3e93ec0d5b89ea6dcb56253c5c59d4c | 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:-----
2
2
4
-----Sample Output:-----
2
21
210
21
2
4
43
432
4321
43210
4321
432
43
4
-----EXPLANATION:-----
No need, else pattern can be decode easily. | ["# cook your dish here\nt=int(input())\nfor _ in range(t):\n n = int(input())\n for i in range(n+1):\n b = n\n for space in range(n-i):\n print(\" \",end=\"\")\n for j in range(i+1):\n print(b,end=\"\")\n b-=1\n print()\n for l in range(n):\n a = n\n for j1 in range(0,l+1):\n print(\" \",end=\"\")\n for k in range(n-l):\n print(a,end=\"\")\n a-=1\n\n print()", "try:\n for test in range(int(input())):\n k = int(input())\n for i in range(k, 0, -1):\n for j in range(i):\n print(' ', end='')\n for j in range(k, i-1, -1):\n print(j, end='')\n print()\n for i in range(k+1):\n for j in range(i):\n print(' ', end='')\n for j in range(k, i-1, -1):\n print(j, end='')\n print()\nexcept:\n pass", "for _ in range(int(input())):\n n=int(input())\n for i in range(n+1):\n k=n\n for j in range(1,n-i+1):\n print(' ',end='')\n for j in range(i+1):\n print(k,end='')\n k-=1\n print()\n for i in range(n-1,-1,-1):\n k=n\n for j in range(1,n-i+1):\n print(' ',end='')\n for j in range(i+1):\n print(k,end='')\n k-=1\n print()", "t=int(input())\r\nfor _ in range(t):\r\n l=[]\r\n n=int(input())\r\n for i in range(n+1):\r\n x=\"\"\r\n for k in range(n-i):\r\n x+=\" \"\r\n for k in range(n,n-i-1,-1):\r\n x+=str(k)\r\n l.append(x)\r\n for i in range(len(l)-2,-1,-1):\r\n l.append(l[i])\r\n for ele in l:\r\n print(ele)\r\n", "# cook your dish here\n\nt = int(input())\n\nwhile t:\n rows = int(input())\n \n for i in range(0, rows):\n for j in range(rows - i):\n print(end=\" \")\n \n for j in range(0, i + 1):\n print(rows - j, end=\"\")\n print(\"\")\n \n k = 0\n for i in range(rows + 1):\n for j in range(i):\n print(end=\" \")\n for j in range(0, rows + 1 - k):\n print(rows - j, end=\"\")\n\n print(\"\")\n k += 1\n \n t -= 1", "# cook your dish here\nt = int(input())\ninputarr = []\nfor _ in range(t):\n a = int(input())\n inputarr.append(a)\nfinal = []\nfor i in inputarr:\n for j in range(i+1):\n n = list(range(i,i-j-1,-1))\n s = \" \" * (i-j) + ''.join(str(elem) for elem in n)\n final.append(s)\n for j1 in range(i):\n n1 = list(range(i,j1,-1))\n s1 = \" \" * (j1+1) + ''.join(map(str,n1))\n final.append(s1)\nfor i in final:\n print(i)", "# cook your dish here\nn=int(input())\na=[]\nfor i in range(n):\n a.append(int(input()))\nfor k in range(len(a)):\n for w in range(a[k]+1):\n nct=a[k]-w\n nqt=w+1\n for i in range(nct):\n print(\" \", end =\"\")\n for j in range(nqt):\n print(a[k]-j,end =\"\")\n print()\n \n for w in range(a[k]+1):\n nqt=a[k]-w\n nct=w+1\n for i in range(nct):\n print(\" \", end =\"\")\n for j in range(nqt):\n print(a[k]-j,end =\"\")\n print()\n \n ", "# cook your dish here\nfor i in range(int(input())):\n n = int(input())\n for j in range(n,-1,-1):\n temp = j\n for k in range(temp,0,-1):\n print(\" \",end=\"\")\n temp-=1\n temp2 = j\n for l in range(n,temp2-1,-1):\n print(l,end=\"\")\n print()\n for m in range(1,n+1):\n for i in range(m):\n print(\" \",end=\"\")\n for o in range(n,m-1,-1):\n print(o,end=\"\")\n print(\"\")", "# cook your dish here\nfor _ in range(int(input())):\n n=int(input())\n for i in range((n*2)+1):\n if(i<n):\n s=\"\"\n s=s+((n-i)*\" \")\n k=n\n for j in range(n-i,n+1):\n s=s+str(k)\n k=k-1\n elif(i==n):\n s=\"\"\n for x in range(n,-1,-1):\n s=s+str(x)\n else:\n s=\"\"\n s=s+((i-n)*\" \")\n k=n\n for j in range(i-n,n+1):\n s=s+str(k)\n k=k-1\n print(s)\n", "# cook your dish here\nt=int(input())\nfor i in range(0,t):\n k=int(input())\n b=[]\n for j in range(k,-1,-1):\n a=[]\n s=' '\n a.append(str(s*j))\n for m in range(k,j-1,-1):\n a.append(str(m))\n x=''.join(a)\n b.append(x)\n print(*a,sep='')\n b.reverse()\n b.pop(0)\n print(*b, sep='\\n')\n \n \n \n \n \n \n ", "t=int(input())\r\nfor _ in range(t):\r\n n = int(input())\r\n for i in range(n+1):\r\n b = n\r\n for space in range(n-i):\r\n print(\" \",end=\"\")\r\n for j in range(i+1):\r\n print(b,end=\"\")\r\n b-=1\r\n print()\r\n for l in range(n):\r\n a = n\r\n for space1 in range(0,l+1):\r\n print(\" \",end=\"\")\r\n for k in range(n-l):\r\n print(a,end=\"\")\r\n a-=1\r\n \r\n print()", "# cook your dish here\nfor _ in range(int(input())):\n n=int(input())\n k=(2*n+1)-1\n for i in range(n+1):\n a=n\n for j in range(n,i,-1):\n print(end=\" \")\n for k in range(i+1):\n print(a,end=\"\")\n a-=1\n print()\n \n for i in range(n):\n b=n\n for j in range(n+1):\n if j>i:\n print(b,end=\"\")\n b-=1\n else:\n print(end=\" \")\n print() \n \n \n \n", "# cook your dish here\nt=int(input())\nwhile(t):\n n=int(input())\n for i in range(n,-1,-1):\n for j in range(n,i-1,-1):\n print(j,end=\"\")\n print()\n for i in range(1,n+1):\n for j in range(n,i-1,-1):\n print(j,end=\"\")\n print()\n t-=1", "# cook your dish here\nfor _ in range(int(input())):\n k=int(input())\n \n ans=[str(k)]\n s=str(k)\n n=k\n while n>0:\n n-=1\n s=s+str(n)\n ans.append(s)\n \n #print(ans)\n \n ans=ans+(ans[:-1])[::-1]\n \n #print(ans) \n for x in ans:\n z= \" \"*((k+1)-len(x))\n print( z + x)\n \n \n", "# cook your dish here\ntestcases=int(input())\nfor i in range(testcases):\n n=int(input())\n for i in range(n+1):\n k=n\n print(\" \"*(n-i), end=\"\")\n for j in range(i+1):\n print(k, end=\"\")\n k-=1\n print()\n for i in range(n):\n k=n\n print(\" \"*(i+1), end=\"\")\n for j in range(n-i):\n print(k, end=\"\")\n k-=1\n print()", "# cook your dish here\nfor _ in range(int(input())):\n k=int(input())\n whole=2*k+1\n half=int(whole/2)\n l=[]\n for i in range(k,-1,-1):\n l.append(i)\n print(k)\n for i in range(1,half):\n for j in range(0,i+1):\n print(l[j],end=\"\")\n print()\n print(*l,sep=\"\")\n for i in range(half,-1,-1):\n for j in range(0,i):\n print(l[j],end=\"\")\n print()\n \n \n \n \n \n \n \n \n \n \n", "T = int(input())\r\n\r\nfor t in range(T):\r\n N = int(input())\r\n \r\n for i in range(N, 0, -1):\r\n for j in range(i):\r\n print(' ', end='')\r\n for j in range(N, i-1, -1):\r\n print(j, end='')\r\n print()\r\n for i in range(N+1):\r\n for j in range(i):\r\n print(' ', end='')\r\n for j in range(N, i-1, -1):\r\n print(j, end='')\r\n print()", "import math\r\nfor z in range(int(input())):\r\n n=int(input())\r\n for i in range(n+1):\r\n print((n-i)*\" \",end='')\r\n init=n\r\n for k in range(i+1):\r\n print(init,end='')\r\n init-=1\r\n print()\r\n for i in range(1,n+1):\r\n print(i*\" \",end='')\r\n init=n\r\n for k in range(n-i+1):\r\n print(init,end='')\r\n init-=1\r\n print() ", "# cook your dish here\nfor _ in range(int(input())):\n n = int(input())\n a=[]\n for i in range(n,0,-1):\n a.append(i)\n for i in range(1,n+1):\n print(\" \"*(n+1-i),end=\"\")\n for j in a[0:i]:\n print(j, end=\"\")\n print(\"\")\n a.append(0)\n for i in a:\n print(i,end=\"\")\n\n a.pop()\n print(\"\")\n for i in range(1,n+1):\n print(\" \" * (i), end=\"\")\n for j in a[0:n-i+1]:\n print(j, end=\"\")\n print(\"\")", "t=int(input())\r\nfor i in range(t):\r\n K=int(input())\r\n l=list(range(K+1))\r\n for x in range(2*K+1):\r\n print(\" \"*abs(K-x),end=\"\")\r\n for y in range(K+1-abs(K-x)):\r\n print(l[-y-1],end=\"\")\r\n print()", "for i in range(int(input())):\r\n n=int(input())\r\n a=[]\r\n for i in range(n+1):\r\n s=\"\"\r\n for j in range(i+1):\r\n s+=str(n-j)\r\n s=\" \"*(n-i)+s\r\n a.append(s)\r\n print(*a,sep='\\n')\r\n a.reverse()\r\n print(*a[1:],sep='\\n')\r\n", "try:\n for test in range(int(input())):\n k = int(input())\n for i in range(k, 0, -1):\n for j in range(i):\n print(' ', end='')\n for j in range(k, i-1, -1):\n print(j, end='')\n print()\n for i in range(k+1):\n for j in range(i):\n print(' ', end='')\n for j in range(k, i-1, -1):\n print(j, end='')\n print()\nexcept:\n pass", "t=int(input())\r\nfrom itertools import permutations as p\r\nfor _ in range(t):\r\n n=int(input())\r\n for i in range(2*n+1):\r\n if i<=n:\r\n for j in range(n-i):\r\n print(\" \",end=\"\")\r\n for j in range(n,n-i-1,-1):\r\n print(j,end=\"\")\r\n print()\r\n else:\r\n for j in range(i-n):\r\n print(\" \",end=\"\")\r\n for j in range(n,i-n-1,-1):\r\n print(j,end=\"\")\r\n print()\r\n \r\n \r\n \r\n", "t=int(input())\r\nfor i in range(t):\r\n n=int(input())\r\n ans=[]\r\n meow=''\r\n tot = n+1\r\n for i in range(n,-1,-1):\r\n meow+=str(i)\r\n an=\" \"*(tot-len(str(meow)))+str(meow)\r\n ans.append(an)\r\n for j in ans:\r\n print(j)\r\n ans=list(reversed(ans))\r\n ans.pop(0)\r\n for j in ans:\r\n print(j)"] | {"inputs": [["2", "2", "4"]], "outputs": [["2", "21", "210", "21", "2", "4", "43", "432", "4321", "43210", "4321", "432", "43", "4"]]} | INTERVIEW | PYTHON3 | CODECHEF | 11,065 | |
d94d511ffad30bb66fbf2a7e6a9f7b18 | UNKNOWN | The chef is having one array of natural numbers. Cheffina challenges chef that find the sum of weights all the natural numbers present in the array, but the main problem is that all numbers have not original weights. After every 6 natural numbers weight is set to 1 as weight increases by 1 after that. (i.e. weight of 1 is 1, weight of 2 is 2 but the weight of 7 is 1 and weight of 8 is 2 and so on…). Help the chef to find the sum.
-----Input:-----
- First line will contain $T$, number of testcases. Then the testcases follow.
- Each testcase contains two lines of input, one integer $N$.
- Next line has N space separate natural numbers.
-----Output:-----
For each testcase, output in a single line answer.
-----Constraints-----
- $1 \leq T \leq 10$
- $1 \leq N \leq 10^5$
- $1 \leq arr[i] \leq 10^6$
-----Sample Input:-----
1
6
6 7 9 11 4 16
-----Sample Output:-----
23
-----EXPLANATION:-----
Array after conversion = [6, 1, 3, 5, 4, 4] | ["# cook your dish here\nt = int(input())\nwhile t:\n x = int(input())\n arr = [int(i) for i in input().split()]\n total = 0\n for i in arr:\n if i % 6 == 0:\n total += 6\n else:\n total += (i % 6)\n print(total)\n t -= 1", "import sys\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\nfor _ in range(int(input())):\n k = int(input())\n a = list(map(int,input().split()))\n #print(a)\n for i in range(len(a)):\n if a[i]%6 != 0:\n a[i] = a[i]%6\n elif a[i]%6 == 0:\n a[i] = 6\n #print(a)\n print(sum(a))", "# cook your dish here\nn=int(input())\nfor _ in range(n):\n m=int(input())\n lis=list(map(int,input().strip().split()))\n res=[]\n for ele in lis:\n if ele%6==0:\n res.append(6)\n res.append(ele%6)\n print(sum(res))\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 if i%6==0:\n s+=6\n else:\n s+=(i%6)\n print(s)", "for _ in range(int(input())):\n n=int(input())\n a=list(map(int,input().split()))\n res=0\n for _ in range(n):\n if a[_]%6==0:\n res+=6\n else:\n res+=(a[_]%6)\n print(res) ", "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 if i%6==0:\n s+=6\n else:\n s+=(i%6)\n print(s)", "# cook your dish here\nt = int(input())\nfor i in range(0, t):\n n = int(input())\n s = 0\n l = list(map(int, input().split()))\n for j in l:\n if(j % 6 == 0):\n s+=6\n else:\n r = j%6\n s+=r \n print(s)", "for _ in range(int(input())):\r\n n=input()\r\n ar=list(map(int,input().split()))\r\n ans=0\r\n for i in ar:\r\n if(i%6==0):\r\n ans+=6\r\n else:\r\n ans+=i%6\r\n print(ans)", "def six(n):\r\n\treturn(1+(n-1)%6)\r\n\r\ndef f(numbers):\r\n return sum(list(map(six, numbers)))\r\n\r\nt = int(input())\r\nanswers = list()\r\nfor _ in range(t):\r\n throw = int(input())\r\n array = list(map(int, input().split()))\r\n answers.append(f(array))\r\n\r\nfor answer in answers:\r\n print(answer)", "# cook your dish here\nt= int(input())\nfor _ in range(t):\n a=int(input())\n b=list(map(int,input().split()))\n s=0\n for i in b:\n if i%6!=0:\n s+=(i%6)\n else:\n s+=6\n \n print(s)\n \n", "import sys \r\nfrom math import log2\r\nfrom itertools import combinations \r\n\r\n#input = sys.stdin.readline\r\n#sys.stdin.readline()\r\n#sys.stdout.write(\"\\n\")\r\n\r\n# #For getting input from input.txt file\r\n# sys.stdin = open('Python_input1.txt', 'r')\r\n\r\n# # Printing the Output to output.txt file\r\n# sys.stdout = open('Python_output1.txt', 'w')\r\n\r\n\r\n\r\nfor _ in range(int(sys.stdin.readline())):\r\n\tn = int(sys.stdin.readline())\r\n\tlis =list(map(int,sys.stdin.readline().split()))\r\n\tfor i in range(len(lis)):\r\n\t\tif lis[i]%6 == 0:\r\n\t\t\tlis[i] = 6\r\n\t\telse:\r\n\t\t\tlis[i] = lis[i]%6\r\n\t#print(lis)\r\n\tprint(sum(lis))\r\n\t\r\n", "t = int(input())\nfor _ in range(t):\n n = int(input())\n ll = list(map(int, input().split()))\n ss = 0\n for ele in ll:\n if ele <= 6:\n ss += ele\n else:\n zz = ele % 6\n if zz == 0:\n ss += 6\n else:\n ss += zz\n print(ss)", "# cook your dish here\ntestcases = int(input())\nfor x in range(testcases):\n size = int(input())\n li = list(map(int,input().split()))\n li2 = [n-(6*(n//6)) if n%6!=0 else 6 for n in li ]\n print(sum(li2))", "t = int(input())\nfor _ in range(t):\n n = int(input())\n l = list(map(int,input().split()))\n for i in range(n):\n l[i] = l[i]%6\n if l[i]==0:\n l[i]=6\n ans = sum(l)\n print(ans)\n", "# cook your dish here\n# 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 if i%6==0:\n ans+=6\n else:\n ans+=i-int(i/6)*6\n print(ans) \n", "t = int(input())\n\nfor _ in range(t):\n n = int(input())\n l = list(map(int,input().split()))\n \n s = 0\n \n for i in l:\n if(i%6==0):\n s += 6\n else:\n s += i%6\n \n print(s)", "# cook your dish here\nn=int(input())\nfor _ in range(n):\n k=int(input())\n a=[int(i) for i in input().split()]\n sum=0\n for i in range(k):\n if(a[i]%6==0):\n sum+=6\n continue\n a[i]=a[i]%6\n sum+=a[i]\n #print(a)\n print(sum)\n", "n=int(input())\nfor _ in range(n):\n n1=int(input())\n ans=0\n l=input().split()\n for i in l:\n if int(i)%6==0:\n ans+=6\n else:\n ans+=int(i)%6\n print(ans)\n", "t=int(input())\nfor i in range(t):\n n=int(input())\n arr=[int(x) for x in input().split()]\n for i in range(n):\n if arr[i]%6==0:\n arr[i]=6\n else:\n arr[i]=arr[i]%6\n print(sum(arr)) \n", "# cook your dish here\nfor t in range(int(input())):\n\n N = int(input())\n arr = list(map(int,input().split()))\n\n ans = 0\n\n for i in range(len(arr)):\n\n if arr[i] % 6 == 0:\n ans += 6\n\n else:\n ans += arr[i] % 6\n\n\n print(ans)", "t=int(input())\nfor _ in range(t):\n n=int(input())\n a=list(map(int,input().split()))\n s=0\n for x in a:\n s+= x%6\n if x%6==0:\n s+=6\n print(s)", "for _ in range(int(input())):\r\n n=int(input())\r\n arr1=list(set(map(int,input().split())))\r\n sum=0\r\n for i in arr1:\r\n if i%6==0:\r\n sum+=6\r\n else:\r\n sum+=(i%6)\r\n print(sum)\r\n \r\n", "for _ in range(int(input())):\r\n n=int(input())\r\n arr=list(map(lambda x:int(x)%6, input().split()))\r\n ans=sum(arr)\r\n ans+=6*arr.count(0)\r\n print(ans)"] | {"inputs": [["1", "6", "6 7 9 11 4 16"]], "outputs": [["23"]]} | INTERVIEW | PYTHON3 | CODECHEF | 6,262 | |
92bfb930312617f548a98fea279fd20a | UNKNOWN | "Don't Drink and Drive, but when you do, Better Call Saul."
Once Jesse and Walter were fighting over extra cash, and Saul decided to settle it with a game of stone piles whose winner gets the extra money. The game is described as follows :
There are N$N$ piles of stones with A$A$1$1$,$,$ A$A$2$2$,$,$ ...$...$ A$A$N$N$ stones in each pile.
Jesse and Walter move alternately, and in one move, they remove one pile entirely.
After a total of X$X$ moves, if the Sum of all the remaining piles is odd, Walter wins the game and gets the extra cash, else Jesse is the winner.
Walter moves first.
Determine the winner of the game if both of them play optimally.
-----Input:-----
- The first line will contain T$T$, number of testcases. T$T$ testcases follow :
- The first line of each testcase contains two space-separated integers N,X$N, X$.
- The second line of each testcase contains N$N$ space-separated integers A$A$1$1$,$,$ A$A$2$2$,$,$ ...,$...,$A$A$N$N$.
-----Output:-----
For each test case, print a single line containing the string "Jesse" (without quotes), if Jesse wins the game or "Walter" (without quotes) if Walter wins.
-----Constraints-----
- 1≤T≤104$1 \leq T \leq 10^4$
- 2≤N≤105$2 \leq N \leq 10^5$
- 1≤X≤N−1$1 \leq X \leq N-1$
- 1≤A$1 \leq A$i$i$ ≤100$ \leq 100$
- The sum of N$N$ over all test cases does not exceed 106$10^6$
-----Sample Input:-----
2
5 3
4 4 4 3 4
7 4
3 3 1 1 1 2 4
-----Sample Output:-----
Jesse
Walter
-----EXPLANATION:-----
-
For Test Case 1 : Playing optimally, Walter removes 4. Jesse removes 3 and then Walter removes 4. Jesse wins as 4+4=8$4 + 4 = 8$ is even.
-
For Test Case 2 : Playing optimally, Walter removes 4, Jesse removes 3, Walter removes 2 and Jesse removes 1. Walter wins as 3+3+1=7$3 + 3 + 1 = 7$ is odd. | ["n=int(input())\nfor i in range(n):\n k,x=map(int,input().split())\n l=list(map(int,input().split()))\n f,e,o=0,0,0\n for i in l:\n if(i%2==0):\n e+=1\n else:\n o+=1\n if(o<=x//2):\n f=1\n elif(e<=x//2):\n if((k-x)%2!=0):\n f=0\n else:\n f=1\n else:\n if(x%2==0):\n f=1\n else:\n f=0\n if(f==1):\n print('Jesse')\n else:\n print('Walter')", "# cook your dish here\ndef winner_is(x: int, n: int, stones: [int]) -> str:\n odd_piles = sum([j%2 for j in stones])\n if x % 2 == 1:\n if x // 2 >= odd_piles or (n % 2 == 1 and x // 2 >= n - odd_piles):\n return \"Jesse\"\n return \"Walter\"\n elif x // 2 >= n - odd_piles and n % 2 == 1:\n return \"Walter\"\n return \"Jesse\"\n\ndef driver():\n pile = []\n for i in range(int(input())):\n n, x = map(int,input().split())\n stones = list(map(int,input().split()))\n pile.append(winner_is(x, n, stones))\n print(*pile, sep=\"\\n\")\n\ndriver()\n", "t=int(input())\nfor _ in range(t):\n n, x = map(int, input().split())\n a = list(map(int, input().split()))\n e = 0\n o = 0\n for i in a:\n if(i%2==0):\n e=e+1\n else:\n o=o+1\n if (e <= x // 2):\n flag = (n - x + 1) % 2\n\n elif (o <= x // 2):\n flag = 1\n\n else:\n flag = (x + 1) % 2\n\n if (flag == 1):\n print(\"Jesse\")\n else:\n print(\"Walter\")", "# 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 e = 0\n o = 0\n for i in a:\n if(i%2==0):\n e=e+1\n else:\n o=o+1\n if (e <= x // 2):\n flag = (n - x + 1) % 2\n\n elif (o <= x // 2):\n flag = 1\n\n else:\n flag = (x + 1) % 2\n\n if (flag == 1):\n print(\"Jesse\")\n else:\n print(\"Walter\")", "for _ in range(int(input())):\n n,x = map(int,input().split())\n a = list(map(int,input().split()))\n ne = 0\n no = 0\n for i in a:\n if i%2 == 0:\n ne += 1\n else:\n no += 1\n if no <= x//2:\n v = 1\n elif ne <= x//2:\n v = (n-x+1)%2\n else:\n v = (x+1)%2\n if v==0:\n print('Walter')\n else:\n print('Jesse')"] | {"inputs": [["2", "5 3", "4 4 4 3 4", "7 4", "3 3 1 1 1 2 4"]], "outputs": [["Jesse", "Walter"]]} | INTERVIEW | PYTHON3 | CODECHEF | 2,289 | |
9bcee55fa68f3222331c9c0b954556ad | UNKNOWN | Chef loves to play with arrays by himself. Today, he has an array A consisting of N distinct integers. He wants to perform the following operation on his array A.
- Select a pair of adjacent integers and remove the larger one of these two. This decreases the array size by 1. Cost of this operation will be equal to the smaller of them.
Find out minimum sum of costs of operations needed to convert the array into a single element.
-----Input-----
First line of input contains a single integer T denoting the number of test cases. First line of each test case starts with an integer N denoting the size of the array A. Next line of input contains N space separated integers, where the ith integer denotes the value Ai.
-----Output-----
For each test case, print the minimum cost required for the transformation.
-----Constraints-----
- 1 ≤ T ≤ 10
- 2 ≤ N ≤ 50000
- 1 ≤ Ai ≤ 105
-----Subtasks-----
- Subtask 1 : 2 ≤ N ≤ 15 : 35 pts
- Subtask 2 : 2 ≤ N ≤ 100 : 25 pts
- Subtask 3 : 2 ≤ N ≤ 50000 : 40 pts
-----Example-----
Input
2
2
3 4
3
4 2 5
Output
3
4
-----Explanation-----Test 1 : Chef will make only 1 move: pick up both the elements (that is, 3 and 4), remove the larger one (4), incurring a cost equal to the smaller one (3). | ["from math import *\nfor t in range(int(input())):\n n = int(input())\n numberlist = list(map(int,input().split()))\n numberlist.sort()\n print(numberlist[0]* ( len(numberlist) -1))", "t=int(input())\nfor i in range(t):\n n=int(input())\n a=list(map(int,input().split()))\n a.sort()\n m=a[0]\n ans=(len(a)-1)*m\n print(ans)\n", "# cook your dish here\ntry:\n test_case = int(input())\n for i in range(test_case):\n user = int(input())\n \n array = sorted(list(map(int,input().split())) , reverse=True)[:user]\n c = array[len(array)-1]\n array.remove(array[0])\n b = len(array)*c\n print(b)\nexcept:\n pass", "T = int(input())\nfor i in range(T):\n N = int(input()) \n a = sorted(list(map(int,input().split())) , reverse=True)\n c = a[len(a)-1]\n a.remove(a[0])\n b = len(a)*c\n print(b) ", "# cook your dish here\ntry:\n T = int(input())\n for i in range(T):\n N = int(input())\n \n a = sorted(list(map(int,input().split())) , reverse=True)[:N]\n c = a[len(a)-1]\n a.remove(a[0])\n b = len(a)*c\n print(b)\n # ans=(len(a)-1)*m\nexcept:\n pass", "t=int(input())\nfor i in range(t):\n n=int(input())\n a=list(map(int,input().split()))\n a.sort()\n m=a[0]\n ans=(len(a)-1)*m\n print(ans)\n", "t=int(input())\nfor i in range(t):\n n=int(input())\n a=list(map(int,input().split()))\n a.sort()\n s=0\n while(len(a)>1):\n a.remove(a[1])\n s=s+a[0]\n print(s)\n \n", "t=int(input())\nfor i in range(t):\n n=int(input())\n a=list(map(int,input().split()))\n a.sort()\n s=0\n while(len(a)!=1):\n a.remove(a[1])\n s=s+a[0]\n print(s)\n \n", "t=int(input())\nfor i in range(t):\n n=int(input())\n a=list(map(int,input().split()))\n a.sort()\n s=0\n while(True):\n if(len(a)==1):\n break\n else:\n a.remove(a[1])\n s=s+a[0]\n print(s)\n \n", "N = int(input())\nfor i in range(N):\n a=int(input())\n li=[int(x) for x in input().split()]\n a=min(li)\n print(a*(len(li)-1))", "t=int(input())\nfor w in range(t):\n n=int(input())\n l=list(map(int,input().split()))\n cost=min(l)\n length=len(l)\n print(cost*(length-1))", "# cook your dish here\nt=int(input())\nfor w in range(t):\n n=int(input())\n l=list(map(int,input().split()))\n cost=min(l)\n length=len(l)\n print(cost*(length-1))", "for i in range(int(input())):\n n1=int(input())\n a=list(map(int,input().split()))\n m=min(a)\n print(m*(n1-1))\n", "# cook your dish here\nfor i in range(int(input())):\n n=int(input())\n lis=list(map(int,input().split()))\n print(min(lis)*(n-1))", "# cook your dish here\nfor i in range(int(input())):\n n=int(input())\n lis=list(map(int,input().split()))\n print(min(lis)*(n-1))", "for _ in range(int(input())):\n n=int(input())\n a=list(map(int,input().split()))\n m=min(a)\n print(m*(n-1))\n", "# cook your dish here\n\nT=int(input())\n\nfor _ in range(T):\n \n n=int(input())\n x=list(map(int,input().split()))\n \n print(min(x)*(n-1))\n \n", "import re\n\nclass arrSol():\n def __init__(self):\n self.N = 0\n self.arr = 0\n \n def updateN(self, N):\n self.N = N\n\n def populateArr(self):\n self.arr = input()\n self.arr = re.split(\" \", self.arr)\n \n def findCost(self):\n min = 100001\n for i in range(self.N):\n if int(self.arr[i]) < min:\n min = int(self.arr[i])\n return min * (self.N - 1) \n \n \n \n\n\nT = int(input())\n\nfor i in range(T):\n \n myObj = arrSol()\n myObj.updateN(int(input()))\n myObj.populateArr()\n print(int(myObj.findCost()))\n del myObj\n \n", "# cook your dish here\na = int(input())\nfor i in range(0,a):\n n = int(input())\n x = list(map(int, input().split()))\n print(min(x) * (n-1))", "# cook your dish here\nfor _ in range(int(input())):\n n=int(input())\n a=[int(x) for x in input().split()]\n m=min(a)\n print(m*(n-1))", "t=int(input())\nfor i in range(t):\n n=int(input())\n lst=list(map(int,input().split()))\n print(min(lst)* (n-1))\n", "# cook your dish here\nt = int(input())\nfor i in range(0,t):\n n = int(input())\n a = list(map(int, input().split()))\n print(min(a) * (n-1))", "# cook your dish here\nt = int(input())\n\nfor i in range(t):\n n = int(input())\n\n array = list(map(int, input().split()))\n\n minEle = min(array)\n print(minEle * (n - 1))\n", "# cook your dish here\nt=int(input())\nfor m in range(t):\n n=int(input())\n lst=list(map(int,input().split()))\n print(min(lst)*(n-1))\n\n", "# cook your dish here\nt = int(input())\n\nfor i in range(t):\n n = int(input())\n\n array = list(map(int, input().split()))\n\n minEle = min(array)\n print(minEle * (n - 1))"] | {"inputs": [["2", "2", "3 4", "3", "4 2 5"]], "outputs": [["3", "4"]]} | INTERVIEW | PYTHON3 | CODECHEF | 4,459 | |
b59c3628ee3fab97df6c5f2a9a07be33 | UNKNOWN | Chef has a number N, Cheffina challenges the chef to check the divisibility of all the permutation of N by 5. If any of the permutations is divisible by 5 then print 1 else print 0.
-----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 1 or 0.
-----Constraints-----
- $1 \leq T \leq 10^6$
- $1 \leq N \leq 10^6$
-----Sample Input:-----
2
19
385
-----Sample Output:-----
0
1 | ["a = int(input())\r\nfor i in range(a):\r\n\tb = input()\r\n\tif '5' in b or '0' in b:\r\n\t\tprint(1)\r\n\t\tcontinue\r\n\tprint(0)", "t=int(input())\r\nwhile(t):\r\n n=input()\r\n if('0' in n or '5' in n):\r\n print('1')\r\n else:\r\n print('0')\r\n t=t-1", "t=int(input())\r\nfor t1 in range(t):\r\n\tn=input()\r\n\ta=0\r\n\tfor i in n:\r\n\t\tif i=='0' or i=='5':\r\n\t\t\ta=1\r\n\t\t\tbreak\r\n\t\t\t\r\n\tprint(a)", "from sys import *\ninput=stdin.readline\nfor i in range(int(input())):\n n = int(input())\n while n > 0:\n r = n%10\n if r%5 == 0:\n print(1)\n break\n n = n // 10\n else:\n print(0)\n", "T=int(input())\r\n\r\nfor _ in range(T):\r\n \r\n N=input()\r\n if '0' in N or'5' in N:\r\n print(1)\r\n else:\r\n print(0)", "from sys import*\r\ninput=stdin.readline\r\nt=int(input())\r\nfor _ in range(t):\r\n s=list(input())\r\n n=s.count('0')+s.count('5')\r\n if n>0:\r\n print('1')\r\n else:\r\n print('0')\r\n", "t=int(input())\nfor i in range(t):\n a=input()\n if '0' in a: \n print('1')\n elif '5' in a:\n print('1')\n else:\n print('0')\n", "t=int(input())\r\nfor i in range(t):\r\n a=input()\r\n if '0' in a: \r\n print('1')\r\n elif '5' in a:\r\n print('1')\r\n else:\r\n print('0')", "t=int(input())\r\nfor i in range(t):\r\n a=input()\r\n if '0' in a: \r\n print('1')\r\n elif '5' in a:\r\n print('1')\r\n else:\r\n print('0')", "# cook your dish here\nfor i in range(int(input())):\n n=int(input())\n n=str(n)\n z=n.find('5')\n z1=n.find('0')\n if(z==-1 and z1==-1):\n print('0')\n else:\n print('1')\n", "# cook your dish here\nfor _ in range(int(input())):\n n = input()\n if \"5\" in n or \"0\" in n:\n print(1)\n else:\n print(0)", "# cook your dish here\nn=int(input())\nls=[]\nfor _ in range(n):\n ls.append(int(input()))\nfor ele in ls:\n ele=str(ele)\n ele=list(ele)\n flag=0\n for i in ele:\n if(int(i)%5==0):\n print(\"1\")\n flag=1\n break\n if flag==0:\n print(\"0\")\n \n", "def f(n):\r\n string = str(n)\r\n for char in string:\r\n if char in '05':\r\n return 1\r\n return 0\r\n\r\nt = int(input())\r\nanswers = list()\r\nfor _ in range(t):\r\n n = int(input())\r\n answers.append(f(n))\r\n\r\nfor answer in answers:\r\n print(answer)", "for _ in range(int(input())):\n n=int(input())\n a=str(n)\n if(a.count('0') or a.count('5')):\n print('1')\n else:\n print('0')\n", "# cook your dish here\n\n\nfor _ in range(int(input())):\n n=input()\n flag=0\n for i in n:\n if i==\"0\" or i=='5':\n flag=1\n break\n if flag==0:\n print('0')\n else:\n print(\"1\")", "import sys\r\ninput = sys.stdin.readline\r\nfor _ in range(int(input())):\r\n n=input()\r\n for i in range(len(n)):\r\n if(n[i]=='0' or n[i]=='5'):\r\n print(\"1\")\r\n break\r\n else:\r\n print(\"0\")", "for _ in range(int(input())):\r\n l = list(input())\r\n if \"0\" in l or \"5\" in l:\r\n print(1)\r\n else:\r\n print(0)", "for _ in range(int(input())):\n N = input()\n if '5' in N or '0' in N:\n print(1)\n else:\n print(0)", "t=int(input())\nwhile(t>0):\n n=input()\n if(('5' in n) or ('0' in n)):\n print(1)\n else:\n print(0)\n t-=1\n# cook your dish here\n", "# cook your dish here\nfor i in range(int(input())):\n num=input()\n if '5' in num or '0' in num:\n print(1)\n else:\n print(0)\n", "def func(num):\r\n for x in num:\r\n if x == '0' or x == '5':\r\n print(1)\r\n return\r\n print(0)\r\n\r\n\r\nfor _ in range(int(input())):\r\n num = input()\r\n func(num)\r\n", "t=int(input())\r\nfor i in range(t):\r\n n=input()\r\n if(\"0\" in n or \"5\"in n):\r\n print(1)\r\n else:\r\n print(0)", "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\n# a = [0,1]\r\n# for i in range(100000):\r\n# a.append(a[-1]+a[-2])\r\nfor _ in range(tc):\r\n n, = inp()\r\n print(1 if any([int(i)%5==0 for i in str(n)]) else 0)"] | {"inputs": [["2", "19", "385"]], "outputs": [["0", "1"]]} | INTERVIEW | PYTHON3 | CODECHEF | 7,138 | |
e079259ab17935badb60e8199f0e96b0 | UNKNOWN | A Train started its journey at x=-infinity is travelling on the x-Coordinate Axis. Given n passengers and the coordinates $b_i$ and $d_i$ for each of the $ith$ passenger at which they board and leave from the train respectively. Due to current COVID-19 crisis, the train is monitored at each mile/coordinate. The infection degree of the train at each mile is equal to the total passengers present in the train at that mile/coordinate. The train stops its journey if no more passengers are there to board the train. The term infection severity of the journey is defined as the sum of infection degrees noted at each mile. Find the Infection severity of the journey. Note: A passenger is considered for calculation of infection degree at both boarding and leaving stations.
Since the answer can be very large, print it modulo $(10^9)+7$.
-----Input:-----
- First line will contain $N$, number of passengers. Then the $N$ lines follow.
- $i$th line contains two integers $b_i, d_i$ , the boarding and departure mile of $i$th passenger.
-----Output:-----
Print a single value, the Infection Severity of the journey modulo $(10^9)+7$.
-----Constraints-----
- $0 \leq N \leq 100000$
- $-500000 \leq b_i \leq 500000$
- $-500000 \leq d_i \leq 500000$
-----Sample Input:-----
3
0 2
1 3
-1 4
-----Sample Output:-----
12
-----EXPLANATION:-----
Infection degree at :
-1 is 1
0 is 2
1 is 3
2 is 3
3 is 2
4 is 1
Calculation started at mile -1 and ended at mile 4. Infection Severity = 1+2+3+3+2+1 =12 | ["c=0\nfor i in range (int(input ())):\n\ta, b=map(int, input().split())\n\tc+=abs(a-b)+1\nprint(c%((10**9) +7)) ", "try:\r\n n=int(input())\r\n sm=0\r\n for i in range(n):\r\n a,b=map( int,input().split() )\r\n sm+=(abs(a-b)+1)\r\n print(sm%1000000007) \r\nexcept:\r\n pass", "def add(arr, N, lo, hi, val): \r\n arr[lo] += val \r\n if (hi != N - 1): \r\n arr[hi + 1] -= val \r\ndef updateArray(arr, N):\r\n for i in range(1, N): \r\n arr[i] += arr[i - 1]\r\nn=1000000\r\nl=[0]*n\r\nfor _ in range(int(input())):\r\n b,d=map(int,input().split())\r\n add(l,n,b+50000,d+50000,1)\r\nupdateArray(l,n)\r\nprint(sum(l)%1000000007)", "n=int(input())\r\nlist1=[]\r\nfor i in range(n):\r\n b,d=list(map(int,input().strip().split()))\r\n if((b>=0and d<=0 )or (b<=0 and d>=0)):\r\n s=abs(b)+abs(d)+1\r\n list1.append(s)\r\n else:\r\n s=abs(abs(b)-abs(d))+1\r\n list1.append(s)\r\ns=sum(list1)\r\nprint(s%1000000007)\r\n", "t=int(input())\r\nc=dict()\r\nk=dict()\r\nfor _ in range(t):\r\n b,d=list(map(int,input().split()))\r\n if(b not in c):\r\n c[b]=1\r\n else:\r\n c[b]+=1\r\n if(d not in k):\r\n k[d]=1\r\n else:\r\n k[d]+=1\r\nans=0\r\ncount=0\r\np=(10**9)+7\r\n\r\nfor i in range(-5*100000,5*100000+1):\r\n if(i in c):\r\n ans=(ans+c[i])%p\r\n if(i-1 in k):\r\n ans=(ans-k[i-1])%p\r\n count=(count+ans)%p\r\n \r\nprint(count%(10**9+7))\r\n", "n=int(input())\r\nlist1=[]\r\nfor i in range(n):\r\n b,d=list(map(int,input().strip().split()))\r\n if((b>=0and d<=0 )or (b<=0 and d>=0)):\r\n s=abs(b)+abs(d)+1\r\n list1.append(s)\r\n else:\r\n s=abs(abs(b)-abs(d))+1\r\n list1.append(s)\r\ns=sum(list1)\r\nprint(s%1000000007)\r\n", "def add(arr, N, lo, hi, val): \n arr[lo] += val \n if (hi != N - 1): \n arr[hi + 1] -= val \ndef updateArray(arr, N):\n for i in range(1, N): \n arr[i] += arr[i - 1]\nn=1000000\nl=[0]*n\nfor _ in range(int(input())):\n b,d=map(int,input().split())\n add(l,n,b+50000,d+50000,1)\nupdateArray(l,n)\nprint(sum(l)%1000000007)", "n=int(input())\r\ns=0\r\nfor z in range(n):\r\n b,d=list(map(int,input().split()))\r\n if b>=0 and d>=0:\r\n s=s+(d-b+1)\r\n s%=10**9+7\r\n elif b<0 and d>=0:\r\n s+=(d+abs(b)+1)\r\n s%=10**9+7\r\n else:\r\n s+=(abs(b)-abs(d)+1)\r\n s%=10**9+7\r\nprint(s%(1000000000+7))\r\n\r\n\r\n", "from collections import *\r\nt=1\r\nwhile(t):\r\n t-=1\r\n n=int(input())\r\n dis=[0 for i in range(1000001)]\r\n for i in range(n):\r\n x,y=list(map(int,input().split()))\r\n x+=500000\r\n y+=500000\r\n dis[x]+=1\r\n if(y==1000000):\r\n continue\r\n else:\r\n dis[y+1]-=1\r\n for i in range(1,len(dis)):\r\n dis[i]+=dis[i-1]\r\n print(sum(dis)%(1000000007))\r\n", "# cook your dish here\nM=int(1e9+7)\nI=lambda:list(map(int,input().split()))\nn=I()[0]\nd,e={},{}\nfor i in range(-500000,500001):\n d[i],e[i]=0,0\nfor i in range(n):\n a,b=I()\n d[a]+=1\n e[b]+=1\n \nans,cnt=0,0\n\nfor i in range(-500000,500001):\n if(d[i]):\n cnt+=d[i]\n ans+=cnt\n if(ans>=M):\n ans-=M\n if(ans<0):\n ans+=M\n if(e[i]):\n cnt-=e[i]\nprint(ans)\n\n \n \n \n", "from sys import stdin,stdout\r\ndef main():\r\n mod=10**9+7\r\n n=int(stdin.readline())\r\n neg=[0]*(500002)\r\n pos=[0]*(500002)\r\n counter=0\r\n mn=1000000\r\n mx=-1000000\r\n larr=[]\r\n rarr=[]\r\n for i in range(n):\r\n l,r=map(int,stdin.readline().split())\r\n if l<0:\r\n counter=1\r\n neg[abs(l)]+=1\r\n else:\r\n pos[l]+=1\r\n if r<0:\r\n neg[abs(r)-1]-=1\r\n else:\r\n pos[abs(r)+1]-=1\r\n ans=0\r\n for i in range(10**5,0,-1):\r\n neg[i]+=neg[i+1]\r\n ans=(ans+neg[i])%mod\r\n neg[0]=neg[0]+neg[1]\r\n pos[0]=neg[0]+pos[0]\r\n ans=(ans+pos[0])%mod\r\n for i in range(1,10**5+2):\r\n pos[i]=pos[i]+pos[i-1]\r\n ans=(ans+pos[i])%mod\r\n #print(neg[0:5])\r\n #print(pos[0:5])\r\n print(ans)\r\n \r\nmain()", "N = int(input())\nL, L1, L2 = [], {}, {}\nfor i in range(0,N):\n x, y = map(int, input().split())\n L.append(x)\n L.append(y)\n if x in L1:\n L1[x] += 1\n elif x not in L1:\n L1[x] = 1\n if y in L2:\n L2[y] += 1\n elif y not in L2:\n L2[y] = 1\n\nL.sort()\npersons = 0\ns = 0\nM = 1000000007\nfor elem in range(L[0], L[-1]+1):\n if elem in L1:\n persons += L1[elem]\n deboard = False\n if elem in L2:\n deboard = True\n \n s += persons\n if deboard:\n persons -= L2[elem]\n deboard = False\n\nprint(s%M)", "# cook your dish here\n# -*- coding: utf-8 -*-\n\"\"\"\nCreated on Tue Apr 28 22:53:59 2020\n\n@author: srira\n\"\"\"\ncount = 0\nfor N in range(int(input())):\n b, d = map(int, input().split())\n if b >= 0:\n count += d - b + 1\n else:\n count += d + abs(b) + 1\nprint(count % (10**9 + 7))", "# cook your dish here\n# -*- coding: utf-8 -*-\n\"\"\"\nCreated on Tue Apr 28 22:53:59 2020\n\n@author: srira\n\"\"\"\ncount = 0\nfor N in range(int(input())):\n b, d = map(int, input().split())\n if b >= 0:\n count += d - b + 1\n else:\n count += d + abs(b) + 1\nprint(count % (10**9 + 7))", "MOD = (10**9) + 7\nN = int(input())\nmapsb = {}\nmapsd = {}\nstart = float(\"inf\")\nend = -float(\"inf\")\nfor i in range(N):\n b,d = list(map(int,input().split()))\n mapsb[b] = mapsb.get(b,0)+1\n mapsd[d] = mapsd.get(d,0)+1\n start = min(b,d,start)\n end = max(b,d,end)\nseverity = 0\ninfectionDegree = 0\nfor i in range(start,end+1):\n if i in mapsb:\n infectionDegree += mapsb[i]\n severity += infectionDegree\n if i in mapsd:\n infectionDegree -= mapsd[i]\nprint(severity%MOD)\n\n", "'''\r\n Auther: ghoshashis545 Ashis Ghosh\r\n College: jalpaiguri Govt Enggineerin College\r\n Date:28/04/2020\r\n\r\n'''\r\nfrom bisect import bisect,bisect_left,bisect_right,insort,insort_left,insort_right\r\nfrom itertools import permutations\r\nfrom datetime import datetime\r\nfrom math import ceil,sqrt,log,gcd\r\ndef ii():return int(input())\r\ndef si():return input()\r\ndef mi():return map(int,input().split())\r\ndef li():return list(mi())\r\n\r\n\r\nabc='abcdefghijklmnopqrstuvwxyz'\r\nabd={'a': 0, 'b': 1, 'c': 2, 'd': 3, 'e': 4, 'f': 5, 'g': 6, 'h': 7, 'i': 8, 'j': 9, 'k': 10, 'l': 11, 'm': 12, 'n': 13, 'o': 14, 'p': 15, 'q': 16, 'r': 17, 's': 18, 't': 19, 'u': 20, 'v': 21, 'w': 22, 'x': 23, 'y': 24, 'z': 25}\r\nmod=1000000007\r\n#mod=998244353\r\ninf = float(\"inf\")\r\nvow=['a','e','i','o','u']\r\ndx,dy=[-1,1,0,0],[0,0,1,-1]\r\n\r\ndef powmod(a,b):\r\n a%=mod\r\n if(a==0):\r\n return 0\r\n res=1\r\n while(b>0):\r\n if(b&1):\r\n res=(res*a)%mod\r\n a=(a*a)%mod\r\n b>>=1\r\n return res\r\n \r\ndef main():\r\n \r\n\r\n x=[0]*(1000005)\r\n n=ii()\r\n c=0\r\n for i in range(n):\r\n x1,y1=mi()\r\n x[x1+500001]+=1\r\n x[y1+500002]-=1\r\n c=max(c,y1+500002)\r\n x[c]=0\r\n s=0\r\n for i in range(c):\r\n x[i]=(x[i]+x[i-1])%mod\r\n s=(s+x[i])%mod\r\n print(s%mod)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\ndef __starting_point():\r\n main()\n__starting_point()", "ss=0\nfor _ in range(int(input())):\n s=list(map(int,input().split()))\n ss+=len(list(range(s[0],s[1]+1)))\nprint(ss%((10**9)+7))\n \n", "count=0\nn=int(input())\nfor __ in range(n):\n a,b=map(int,input().split())\n count+=b-a\nprint((count+n)%1000000007)", "M=1000000007\r\nn = int(input())\r\n\r\nL=[]\r\nR=[]\r\nfor i in range(n):\r\n l,r = list(map(int,input().split()))\r\n \r\n L.append(l)\r\n R.append(r)\r\n\r\nLS=set(L)\r\nRS=set(R)\r\n\r\n\r\n\r\nLD=dict(list(zip(LS,[0]*len(LS))))\r\n\r\nfor e in L:\r\n LD[e]+=1\r\n\r\nRD=dict(list(zip(RS,[0]*len(RS))))\r\n\r\nfor e in R:\r\n RD[e]+=1\r\n\r\nL=dict(list(zip(L,[0]*n)))\r\nR=dict(list(zip(R,[0]*n)))\r\n\r\n\r\ninf=0\r\ntotal=0\r\nfor i in range( min(LS), max(RS)+1 ):\r\n \r\n if i in L:\r\n inf+=LD[i]\r\n total+=inf\r\n if i in R:\r\n inf-=RD[i]\r\n\r\n\r\n\r\nprint(total%M)\r\n \r\n \r\n \r\n", "s= 0\r\nn = int(input())\r\nwhile(n):\r\n \r\n \r\n mod = int(1e9+7)\r\n a,b = [int(x) for x in input().split()]\r\n s+= abs(b-a) + 1\r\n s%=mod\r\n n-=1\r\nprint(s)", "# cook your dish here\nn=int(input())\nmodulus=10**9+7\ns=0\nfor i in range(n):\n l=list(map(int,input().split()))\n k=l[1]+1-l[0]\n if(l[0]<0 and l[1]<0):\n k=l[0]-l[1]-1\n s+=abs(k)\nprint(s%modulus)", "# cook your dish here\nn=int(input())\ns=0\nfor i in range(n):\n l=list(map(int,input().split()))\n k=l[1]+1-l[0]\n if(l[0]<0 and l[1]<0):\n k=l[0]-l[1]-1\n s+=abs(k)\nm=10**9\nm+=7\nprint(s%m)\n", "mod = 10**9+7\nsumm = 0\nN = int(input())\nfor _ in range(N):\n a,b = map(int,input().split())\n summ+= (b-a)+1\nprint(summ%mod)"] | {"inputs": [["3", "0 2", "1 3", "-1 4"]], "outputs": [["12"]]} | INTERVIEW | PYTHON3 | CODECHEF | 9,330 | |
d08bd6d03dfc55835d039e020604e4f2 | UNKNOWN | The chef is trying to solve some pattern problems, Chef wants your help to code it. Chef has one number K to form a new pattern. Help the chef to code this pattern problem.
-----Input:-----
- First-line will contain $T$, the number of test cases. Then the test cases follow.
- Each test case contains a single line of input, one integer $K$.
-----Output:-----
For each test case, output as the pattern.
-----Constraints-----
- $1 \leq T \leq 100$
- $1 \leq K \leq 100$
-----Sample Input:-----
4
1
2
3
4
-----Sample Output:-----
1
13
57
135
7911
131517
1357
9111315
17192123
25272931
-----EXPLANATION:-----
No need, else pattern can be decode easily. | ["n = int(input())\r\nl = [0] * n\r\nfor x in range(n):\r\n l[x] = int(input())\r\nfor i in range(n):\r\n z = 1\r\n for j in range(1,l[i]+1):\r\n for k in range(1,l[i]+1):\r\n print(z,end='')\r\n z += 2\r\n print()", "t = int(input())\r\n\r\nfor _ in range(t):\r\n k = int(input())\r\n count = 1\r\n for _ in range(k):\r\n output = ''\r\n for index in range(1,k+1):\r\n output += str(count)\r\n count += 2\r\n print(output)\r\n", "# cook your dish here\ntry:\n for _ in range(int(input())):\n k = int(input())\n num = 1\n for i in range(1,k+1,1):\n for j in range(1,k+1,1):\n print((num*2)-1,end=\"\")\n num = num +1\n print(\"\")\nexcept:\n pass", "for _ in range(0,int(input())):\r\n a=int(input())\r\n for i in range(1,a**2*2,a*2):\r\n for j in range(i,a*2+i,2):\r\n print(j,end=\"\")\r\n print()", "for _ in range(int(input())):\n\tn = int(input())\n\tcount = 1\n\tfor i in range(n):\n\t\tfor j in range(n):\n\t\t\tprint(count, end=\"\")\n\t\t\tcount += 2\n\t\tprint()\n\t", "t=int(input())\nfor t in range(t):\n n=int(input())\n s=1\n for i in range(1,n+1):\n for j in range(1,n+1):\n print(s,end=\"\")\n s+=2\n print()", "t=int(input())\nfor t in range(t):\n n=int(input())\n s=1\n for i in range(1,n+1):\n for j in range(1,n+1):\n print(s,end=\"\")\n s+=2\n print()\n \n", "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 p=n*j+k\n s+=str(2*p-1)\n print(s)", "from sys import*\r\ninput=stdin.readline\r\nt=int(input())\r\nfor _ in range(t):\r\n k=int(input())\r\n x=1\r\n for i in range(k):\r\n for j in range(k):\r\n print(x,end=\"\")\r\n x+=2\r\n print()\r\n", "try:\n for i in range(int(input())):\n n=int(input())\n s=1\n for j in range(1,n+1):\n for k in range(1,n+1):\n \n print(s,end=\"\")\n s+=2\n print(\"\\r\")\nexcept Exception:\n pass\n\n", "# cook your dish here\nfor _ in range(int(input())):\n k = int(input())\n x = 1\n for i in range(k):\n for j in range(k):\n print(x,end = '')\n x = x + 2\n print()", "def solve(n):\r\n j=1\r\n for i in range(1,n+1):\r\n for k in range(n):\r\n print(j,end='')\r\n j+=2\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())\r\n\r\nfor i in range(t):\r\n k = int(input()) \r\n for j in range(0, k):\r\n print(\"\".join([str(2*(x+1)-1) for x in range(j*k, j*k + k)]))", "t = int(input())\r\n\r\nfor i in range(t):\r\n k = int(input()) \r\n for j in range(0, k):\r\n print(\"\".join([str(2*(x+1)-1) for x in range(j*k, j*k + k)]))", "t=int(input())\nfor i in range(0,t):\n n=int(input())\n p=1\n for j in range(0,n):\n for k in range(0,n):\n print(p,end=\"\")\n p=p+2\n print(\" \")", "try:\n tc=int(input())\n for _ in range(tc):\n n=int(input())\n a=1\n for i in range(n):\n for j in range(n):\n print(a,end='')\n a+=2\n print()\nexcept:\n pass# cook your dish here\n", "# cook your dish here\n# cook your dish here\nfor case in range(int(input())):\n n=int(input())\n \n k=1\n for i in range(0,n):\n for j in range(0,n):\n print(k,end=\"\")\n k+=2\n print(\"\")\n \n\n", "# 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 s += str(count)\n count += 2\n print(s)\n s = \"\"", "try:\r\n t=int(input())\r\n for _ in range(t):\r\n n = int(input())\r\n c=1\r\n for i in range(n):\r\n for j in range(n):\r\n print(c,end=\"\")\r\n c+=2\r\n print()\r\nexcept EOFError:\r\n pass", "# cook your dish here\nfor i in range(int(input())):\n k=int(input())\n count=1\n for j in range(1,k+1):\n for l in range(1,k+1):\n print(count,end=\"\")\n count+=2\n print()", "# cook your dish here\n\nfor _ in range(int(input())):\n n=int(input())\n c=1\n for i in range(1,n+1):\n for j in range(n):\n print(c,end=\"\")\n c+=2\n print()", "# cook your dish here\nfor _ in range(int(input())):\n n=int(input())\n if n==1:\n print(\"1\")\n else:\n p=1\n for i in range(n):\n for j in range(n):\n print(p,end='')\n p+=2\n print()\n ", "# cook your dish here\nt = int(input())\n\nwhile t:\n n = int(input())\n k = 1\n \n for i in range(1, n + 1):\n for j in range(1, n + 1):\n print(k, end='')\n k += 2\n print()\n \n t -= 1"] | {"inputs": [["4", "1", "2", "3", "4"]], "outputs": [["1", "13", "57", "135", "7911", "131517", "1357", "9111315", "17192123", "25272931"]]} | INTERVIEW | PYTHON3 | CODECHEF | 5,428 | |
c2c4cf46bfee01e995bd862dcba71613 | UNKNOWN | Walter White and Jesse Pinkman (a drug addict) both love to play with chemicals. One day they were playing with some chemicals to make an energy drink. Unknowingly they made a highly powerful drink. To test the drink on others also they called some of their friends and gave a drop of it to everyone. Now they all were feeling highly energetic and thought of an unique game to play with each other.
After pondering for a while, Jesse came up with an extraordinary idea of competing in a race around a circular globe with N checkpoints each of one unit. Walter and all their other friends agreed with it.They divided themselves in $2$ teams with $N$ teammates in each team.This race has two commencing points $A$ and $B$ strictly facing each other. Walter and his team commences from $A$ point and other team starts from $B$. Both the teams start running at the same time clockwise around the globe. Speed of every player is constant throughout the race. If a player has a speed $X$ then it means that he covers a distance of $X$ units in one second.The race ends when some member of one team overtakes all members of opposite team at any point of time. Now you have to tell if any team will win the race or not.They all are stubborn and can run forever just to win the race. Help them to know if it is possible in anyway that the race will come to an end.
For Clarity, you can visualize the path as a circular paths where $A$ and $B$ are opposite ends of diameter. It can be proven that the actual circumference of circle do not affect the answer.
It is also possible that someone don't run at all.Keep in mind that the fastest one wins the race so does the code.
-----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$ number of teammates in both team.
- The second line contains $N$ space-separated integers $A_1, A_2 \ldots A_N$ denoting speed of A's Team
- The third line contains $N$ space-separated integers $B_1, B_2 \ldots B_N$ denoting speed of B's Team
-----Output:------
For each test case, print a single line denoting YES if the race ends at any point of time else NO
-----Constraints-----
- $1 \leq T \leq 10$
- $1 \leq N \leq 10^5$
- $0 \leq A_i \leq 2^{15}$
- $0 \leq B_i \leq 2^{15}$
-----Subtasks-----
Subtask #1 (30 points):
- $1 \le N \le 20$
- $0 \le A_i \le 11$
- $0 \le B_i \le 11$
Subtask #2 (70 points):
- Original constraints
-----Sample input:-----
1
5
1 2 3 4 5
2 7 8 9 9
-----Sample output-----
YES
-----Sample Explanation:------
Team B can overtake all members of Team A. | ["# cook your dish here\nl1=int(input())\nfor i in range(l1):\n x=int(input())\n y=list(map(int,input().split()))\n z=list(map(int,input().split()))\n if max(z)!=max(y):\n print('YES')\n else:\n print('NO')", "# cook your dish here\ntry:\n for _ in range(int(input())):\n n = int(input())\n a = list(map(int, input().split()))\n b= list(map(int, input().split()))\n ma, mb = max(a), max(b)\n if abs(ma-mb):\n print('YES')\n else:\n print('NO')\nexcept:\n pass", "l1=int(input())\nfor i in range(l1):\n x=int(input())\n y=list(map(int,input().split()))\n z=list(map(int,input().split()))\n if max(z)!=max(y):\n print('YES')\n else:\n print('NO')\n ", "# cook your dish here\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 max(a)!=max(b):\n print(\"YES\")\n else:\n print(\"NO\")", "for i in range(int(input())):\r\n n=int(input())\r\n a=list(map(int, input().split()))\r\n b=list(map(int, input().split()))\r\n if max(a)!=max(b):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "t=int(input())\nwhile(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(max(a)==max(b)):\n print(\"NO\")\n else:\n print(\"YES\")\n t-=1", "# cook your dish here\\\ntry:\n \n for _ in range (int(input())):\n n=int(input())\n l=list(map(int,input().split()))\n ln=list(map(int,input().split()))\n a=max(l)\n b=max(ln)\n if a==b:\n print(\"NO\")\n else: print(\"YES\")\nexcept:\n pass", "for _ in range (int(input())):\n n=int(input())\n l=list(map(int,input().split()))\n l1=list(map(int,input().split()))\n a=max(l)\n b=max(l1)\n if a==b:\n print(\"NO\")\n else: print(\"YES\")", "# cook your dish here\nT = int(input())\n\nfor i in range(T):\n N,dataA,dataB = int(input()),list(map(int,input().split())),list(map(int,input().split()))\n if(max(dataA)!=max(dataB)):\n print(\"YES\")\n else:\n print(\"NO\")", "for _ in range(int(input())):\r\n n=int(input())\r\n l1=list(map(int,input().split()))\r\n l1.sort()\r\n l2=list(map(int,input().split()))\r\n l2.sort()\r\n if(l1[n-1]!=l2[n-1]):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n", "# cook your dish here\n\nT = int(input())\n\nwhile T >0:\n T-=1 \n n =int(input())\n listA = list(map(int,input().split()))\n listB = list(map(int,input().split()))\n maxA =max(listA)\n maxB = max(listB)\n \n if maxB>maxA or maxA>maxB:\n print('YES')\n else:\n print('NO')\n", "# cook your dish here\n\nfor _ in range(int(input())):\n n = int(input())\n x = list(map(int, input().split()))\n y = list(map(int, input().split()))\n if max(x) == max(y):\n print(\"NO\")\n else:\n print(\"YES\")\n", "try:\r\n t1=int(input())\r\n for _ in range(t1):\r\n n=int(input())\r\n l1=list(map(int,input().split()))\r\n l2=list(map(int,input().split()))\r\n if(max(l1)!=max(l2)):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n \r\nexcept:\r\n pass", "J = int(input())\n\nfor i in range(J):\n x=int(input())\n A=[int(x) for x in input().split()]\n B=[int(x) for x in input().split()]\n if(max(A)>max(B) or max(B)>max(A)):\n print(\"YES\")\n else:\n print(\"NO\")\n", "t = int(input())\nwhile(t>0):\n n = int(input())\n a =[int(i) for i in input().split()]\n b = [int(i) for i in input().split()]\n if max(a)!=max(b):\n print('YES')\n else:\n print('NO')\n t-=1\n \n \n \n ", "for i in range(int(input())):\r\n n=int(input())\r\n a=list(map(int, input().split()))\r\n b=list(map(int, input().split()))\r\n if max(a)!=max(b):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "t = int(input())\r\nfor _ in range(t):\r\n n = int(input())\r\n a = [int(x) for x in input().split(' ')]\r\n b = [int(x) for x in input().split(' ')]\r\n if max(a) != max(b):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "for i in range(int(input())):\r\n n=int(input())\r\n a=list(map(int, input().split()))\r\n b=list(map(int, input().split()))\r\n if max(a)!=max(b):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "for i in range(int(input())):\r\n n=int(input())\r\n a=list(map(int, input().split()))\r\n b=list(map(int, input().split()))\r\n if max(a)!=max(b):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "for _ in range(int(input())):\r\n n = int(input())\r\n a = list(map(int,input().split()))\r\n b = list(map(int,input().split()))\r\n if max(a)-max(b) == 0:\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")", "for __ in range(int(input())):\r\n n=int(input())\r\n w=[int(x) for x in input().split()]\r\n j=[int(x) for x in input().split()]\r\n if (max(w) == max(j)):\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")\r\n\r\n", "for _ in range (int(input())):\r\n n=int(input())\r\n l=list(map(int,input().split()))\r\n l1=list(map(int,input().split()))\r\n a=max(l)\r\n b=max(l1)\r\n if a==b:\r\n print(\"NO\")\r\n else: print(\"YES\")", "\r\nimport heapq as hp\r\nfrom sys import stdin\r\ntestCases = int(input())\r\nresult=[]\r\nwhile testCases:\r\n try:\r\n number= int(input())\r\n team_A = [int(x) for x in input().split()]\r\n team_B = [int(x) for x in input().split()]\r\n if max(team_A)!=max(team_B):\r\n result.append(\"YES\")\r\n else:\r\n result.append(\"NO\")\r\n \r\n testCases=-1\r\n except:\r\n break\r\nfor i in result:\r\n print(i)", "\r\nimport heapq as hp\r\nfrom sys import stdin\r\ntestCases = int(input())\r\nresult=[]\r\nwhile testCases:\r\n try:\r\n number= int(input())\r\n team_A = [int(x) for x in input().split()]\r\n team_B = [int(x) for x in input().split()]\r\n if max(team_A)!=max(team_B):\r\n result.append(\"YES\")\r\n else:\r\n result.append(\"NO\")\r\n \r\n testCases=-1\r\n except:\r\n break\r\nfor i in result:\r\n print(i)", "try:\n t=int(input())\n for _ 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 if(max(a)!=max(b)):\n print(\"YES\")\n else:\n print(\"NO\")\nexcept EOFError as e:\n pass\n"] | {"inputs": [["1", "5", "1 2 3 4 5", "2 7 8 9 9", ""]], "outputs": [["YES"]]} | INTERVIEW | PYTHON3 | CODECHEF | 6,833 | |
ab385edb360d3f8668e0ca416e7c8c09 | UNKNOWN | Chef received a permutation $P_1, P_2, \ldots, P_N$ and also an integer $D$ from his good friend Grux, because Grux was afraid he would forget them somewhere. However, since Grux was just playing with the permutation, it was all shuffled, and Chef only likes sorted permutations, so he decided to sort it by performing some swaps.
Chef wants to use the integer $D$ he just received, so he is only willing to swap two elements of the permutation whenever their absolute difference is exactly $D$. He has limited time, so you should determine the minimum number of swaps he needs to perform to sort the permutation, or tell him that it is impossible to sort it his way.
-----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 $D$.
- The second line contains $N$ space-separated integers $P_1, P_2, \ldots, P_N$.
-----Output-----
For each test case, print a single line containing one integer ― the minimum number of swaps, or $-1$ if it is impossible to sort the permutation.
-----Constraints-----
- $1 \le T \le 20$
- $1 \le N \le 200,000$
- $1 \le D \le N$
- $1 \le P_i \le N$ for each valid $i$
- $P_1, P_2, \ldots, P_N$ are pairwise distinct
- the sum of $N$ over all test cases does not exceed $10^6$
-----Subtasks-----
Subtask #1 (20 points): $D = 1$
Subtask #2 (30 points):
- $N \le 1,000$
- the sum of $N$ over all test cases does not exceed $10,000$
Subtask #3 (50 points): original constraints
-----Example Input-----
2
5 2
3 4 5 2 1
5 2
4 3 2 1 5
-----Example Output-----
3
-1
-----Explanation-----
Example case 1: Chef can perform the following swaps in this order:
- swap the first and fifth element
- swap the third and fifth element
- swap the second and fourth element | ["import sys\nsys.setrecursionlimit(10000000)\ndef mergeSortInversions(arr):\n if len(arr) == 1:\n return arr, 0\n larr=len(arr)\n a = arr[:larr//2]\n b = arr[larr//2:]\n a, ai = mergeSortInversions(a)\n b, bi = mergeSortInversions(b)\n c = []\n i = 0\n j = 0\n inversions = 0 + ai + bi\n la=len(a)\n while i < la and j < len(b):\n if a[i] <= b[j]:\n c.append(a[i])\n i += 1\n else:\n c.append(b[j])\n j += 1\n inversions += (la-i)\n c += a[i:]\n c += b[j:]\n return c, inversions \nfor _ in range(int(input())):\n n,d=list(map(int,input().split()))\n p=[int(o) for o in input().split()]\n array=[[] for i in range(d)]\n flag=0\n for i in range(n):\n array[i%d].append(p[i])\n if p[i]%((i%d)+1)!=0:\n flag=1\n \n \n ans=0\n dumarr=[0]*n\n for i in range(d):\n array[i],v=mergeSortInversions(array[i])\n for j in range(len(array[i])):\n dumarr[i+j*d]=array[i][j]\n ans+=v\n p=sorted(p)\n # print(dumarr)\n if dumarr==p:\n print(ans)\n else:\n print(-1)\n", "import sys\nsys.setrecursionlimit(10000000)\ndef mergeSortInversions(arr):\n if len(arr) == 1:\n return arr, 0\n larr=len(arr)\n a = arr[:larr//2]\n b = arr[larr//2:]\n a, ai = mergeSortInversions(a)\n b, bi = mergeSortInversions(b)\n c = []\n i = 0\n j = 0\n inversions = 0 + ai + bi\n la=len(a)\n while i < la and j < len(b):\n if a[i] <= b[j]:\n c.append(a[i])\n i += 1\n else:\n c.append(b[j])\n j += 1\n inversions += (la-i)\n c += a[i:]\n c += b[j:]\n return c, inversions \nfor _ in range(int(input())):\n n,d=list(map(int,input().split()))\n p=[int(o) for o in input().split()]\n array=[[] for i in range(d)]\n flag=0\n for i in range(n):\n array[i%d].append(p[i])\n if p[i]%((i%d)+1)!=0:\n flag=1\n \n \n ans=0\n dumarr=[0]*n\n for i in range(d):\n array[i],v=mergeSortInversions(array[i])\n for j in range(len(array[i])):\n dumarr[i+j*d]=array[i][j]\n ans+=v\n p=sorted(p)\n # print(dumarr)\n if dumarr==p:\n print(ans)\n else:\n print(-1)\n", "# cook your dish here\ndef mergeSort(arr, n):\n temp_arr = [0] * n\n return _mergeSort(arr, temp_arr, 0, n - 1)\n\n\ndef _mergeSort(arr, temp_arr, left, right):\n inv_count = 0\n\n if left < right:\n mid = (left + right) // 2\n\n inv_count += _mergeSort(arr, temp_arr, left, mid)\n\n inv_count += _mergeSort(arr, temp_arr, mid + 1, right)\n\n inv_count += merge(arr, temp_arr, left, mid, right)\n return inv_count\n\n\ndef merge(arr, temp_arr, left, mid, right):\n i = left\n j = mid + 1\n k = left\n inv_count = 0\n\n while i <= mid and j <= right:\n\n if arr[i] <= arr[j]:\n temp_arr[k] = arr[i]\n k += 1\n i += 1\n else:\n\n temp_arr[k] = arr[j]\n inv_count += (mid - i + 1)\n k += 1\n j += 1\n\n while i <= mid:\n temp_arr[k] = arr[i]\n k += 1\n i += 1\n\n while j <= right:\n temp_arr[k] = arr[j]\n k += 1\n j += 1\n\n for loop_var in range(left, right + 1):\n arr[loop_var] = temp_arr[loop_var]\n\n return inv_count\n\n\nt=int(input())\nfor _ in range(0,t):\n n,D=list([int(x) for x in input().split()])\n p=list([int(x) for x in input().split()])\n q=[0]*len(p)\n for i in range(n):\n q[p[i]-1]=i\n sublists=[]\n \n for i in range(0,D):\n sublist=[]\n for j in range(i,len(p),D):\n sublist.append(q[j])\n sublists.append(sublist)\n \n \n flag=0\n \n for i in range(0,D):\n temp_sublist=sorted(sublists[i])\n for j in range(0,len(sublists[i])):\n if i+j*D!=temp_sublist[j]:\n print(-1)\n flag=1\n break\n if flag==1:\n break\n if flag==0:\n total=sum([mergeSort(sublist,len(sublist)) for sublist in sublists ])\n print(total)\n", "import sys\nsys.setrecursionlimit(10000000)\ndef mergeSortInversions(arr):\n if len(arr) == 1:\n return arr, 0\n larr=len(arr)\n a = arr[:larr//2]\n b = arr[larr//2:]\n a, ai = mergeSortInversions(a)\n b, bi = mergeSortInversions(b)\n c = []\n i = 0\n j = 0\n inversions = 0 + ai + bi\n la=len(a)\n while i < la and j < len(b):\n if a[i] <= b[j]:\n c.append(a[i])\n i += 1\n else:\n c.append(b[j])\n j += 1\n inversions += (la-i)\n c += a[i:]\n c += b[j:]\n return c, inversions \nfor _ in range(int(input())):\n n,d=list(map(int,input().split()))\n p=[int(o) for o in input().split()]\n array=[[] for i in range(d)]\n flag=0\n for i in range(n):\n array[i%d].append(p[i])\n if p[i]%((i%d)+1)!=0:\n flag=1\n ans=0\n dumarr=[0]*n\n for i in range(d):\n array[i],v=mergeSortInversions(array[i])\n for j in range(len(array[i])):\n dumarr[i+j*d]=array[i][j]\n ans+=v\n p=sorted(p)\n if dumarr==p:\n print(ans)\n else:\n print(-1)\n", "import sys\nsys.setrecursionlimit(10000000)\ndef mergeSortInversions(arr):\n if len(arr) == 1:return arr, 0\n larr=len(arr)\n a,b = arr[:larr//2],arr[larr//2:] \n a, ai = mergeSortInversions(a)\n b, bi = mergeSortInversions(b)\n c,i,j = [],0,0\n inversions = 0 + ai + bi\n la=len(a)\n while i < la and j < len(b):\n if a[i] <= b[j]:\n c.append(a[i])\n i += 1\n else:\n c.append(b[j])\n j ,inversions = j+1,inversions + (la-i)\n c += (a[i:]+b[j:])\n return c, inversions \nfor _ in range(int(input())):\n n,d=map(int,input().split())\n p=[int(o) for o in input().split()]\n array,flag,ans,dumarr = [[] for i in range(d)],0,0,[0]*n\n for i in range(n):\n array[i%d].append(p[i])\n if p[i]%((i%d)+1)!=0:flag=1\n for i in range(d):\n array[i],v=mergeSortInversions(array[i])\n for j in range(len(array[i])):dumarr[i+j*d]=array[i][j]\n ans+=v\n print(ans) if dumarr==sorted(p) else print(-1)", "\ndef getSum( BITree, index): \n sum = 0 \n while (index > 0): \n sum += BITree[index] \n index -= index & (-index) \n return sum\ndef updateBIT(BITree, n, index, val): \n while (index <= n): \n BITree[index] += val \n index += index & (-index) \ndef getInvCount(arr, n): \n invcount = 0 \n maxElement = max(arr) \n BIT = [0] * (maxElement + 1) \n for i in range(1, maxElement + 1): \n BIT[i] = 0\n for i in range(n - 1, -1, -1): \n invcount += getSum(BIT, arr[i] - 1) \n updateBIT(BIT, maxElement, arr[i], 1) \n return invcount \nimport sys\ninput=sys.stdin.readline \nfor _ in range(int(input())):\n n,k=map(int,input().split())\n l=[int(i) for i in input().split()]\n f=1 \n sm=0\n for x in range(k):\n mat=[]\n li=[]\n le=0 \n c={}\n for y in range(x,n,k):\n mat.append(l[y])\n li.append(y+1)\n le+=1 \n c[l[y]]=1 \n for y in range(x,n,k):\n if c.get(y+1,-1)==-1:\n f=0 \n break \n else:\n sm+=getInvCount(mat,le)\n if f==0:\n print(-1)\n else: \n print(sm)", "# Python3 program to count inversions using \n# Binary Indexed Tree \n\n# Returns sum of arr[0..index]. This function \n# assumes that the array is preprocessed and \n# partial sums of array elements are stored \n# in BITree[]. \ndef getSum( BITree, index): \n sum = 0 # Initialize result \n \n # Traverse ancestors of BITree[index] \n while (index > 0): \n\n # Add current element of BITree to sum \n sum += BITree[index] \n\n # Move index to parent node in getSum View \n index -= index & (-index) \n\n return sum\n\n# Updates a node in Binary Index Tree (BITree) \n# at given index in BITree. The given value \n# 'val' is added to BITree[i] and all of its \n# ancestors in tree. \ndef updateBIT(BITree, n, index, val): \n\n # Traverse all ancestors and add 'val' \n while (index <= n): \n\n # Add 'val' to current node of BI Tree \n BITree[index] += val \n\n # Update index to that of parent \n # in update View \n index += index & (-index) \n\n# Returns count of inversions of size three \ndef getInvCount(arr, n): \n\n invcount = 0 # Initialize result \n\n # Find maximum element in arrays \n maxElement = max(arr) \n\n # Create a BIT with size equal to \n # maxElement+1 (Extra one is used \n # so that elements can be directly \n # be used as index) \n BIT = [0] * (maxElement + 1) \n for i in range(1, maxElement + 1): \n BIT[i] = 0\n for i in range(n - 1, -1, -1): \n\n invcount += getSum(BIT, arr[i] - 1) \n updateBIT(BIT, maxElement, arr[i], 1) \n return invcount \n \n\n \n# This code is contributed by \n# Shubham Singh(SHUBHAMSINGH10) \n\nfor _ in range(int(input())):\n n,k=map(int,input().split())\n l=[int(i) for i in input().split()]\n if k==1:\n print(getInvCount(l,n))\n continue \n mat=l[:]\n f=1 \n sm=0\n from collections import Counter\n for x in range(k):\n mat=[]\n li=[]\n le=0 \n for y in range(x,n,k):\n mat.append(l[y])\n li.append(y+1)\n le+=1 \n # print(mat,li)\n if Counter(mat)!=Counter(li):\n f=0\n break \n else:\n sm+=getInvCount(mat,len(mat))\n \n if f==0:\n print(-1)\n else: \n print(sm)", "# Python3 program to count inversions using \n# Binary Indexed Tree \n\n# Returns sum of arr[0..index]. This function \n# assumes that the array is preprocessed and \n# partial sums of array elements are stored \n# in BITree[]. \ndef getSum( BITree, index): \n sum = 0 # Initialize result \n \n # Traverse ancestors of BITree[index] \n while (index > 0): \n\n # Add current element of BITree to sum \n sum += BITree[index] \n\n # Move index to parent node in getSum View \n index -= index & (-index) \n\n return sum\n\n# Updates a node in Binary Index Tree (BITree) \n# at given index in BITree. The given value \n# 'val' is added to BITree[i] and all of its \n# ancestors in tree. \ndef updateBIT(BITree, n, index, val): \n\n # Traverse all ancestors and add 'val' \n while (index <= n): \n\n # Add 'val' to current node of BI Tree \n BITree[index] += val \n\n # Update index to that of parent \n # in update View \n index += index & (-index) \n\n# Returns count of inversions of size three \ndef getInvCount(arr, n): \n\n invcount = 0 # Initialize result \n\n # Find maximum element in arrays \n maxElement = max(arr) \n\n # Create a BIT with size equal to \n # maxElement+1 (Extra one is used \n # so that elements can be directly \n # be used as index) \n BIT = [0] * (maxElement + 1) \n for i in range(1, maxElement + 1): \n BIT[i] = 0\n for i in range(n - 1, -1, -1): \n\n invcount += getSum(BIT, arr[i] - 1) \n updateBIT(BIT, maxElement, arr[i], 1) \n return invcount \n \n\n \n# This code is contributed by \n# Shubham Singh(SHUBHAMSINGH10) \n\nfor _ in range(int(input())):\n n,k=map(int,input().split())\n l=[int(i) for i in input().split()]\n if k==1:\n print(getInvCount(l,n))\n continue \n mat=l[:]\n f=1 \n sm=0\n from collections import Counter\n for x in range(k):\n mat=[]\n li=[]\n le=0 \n for y in range(x,n,k):\n mat.append(l[y])\n li.append(y+1)\n le+=1 \n # print(mat,li)\n if Counter(mat)!=Counter(li):\n f=0\n break \n else:\n li=[]\n le=len(mat)\n for i in range(le):\n curr=[mat[i],i]\n li.append(curr)\n li.sort() \n vis=[0]*le \n for i in range(le):\n if vis[i] or li[i][1]==i:\n continue \n c=0 \n j=i \n while not vis[j]:\n vis[j]=1 \n j=li[j][1]\n c+=1 \n if c:\n sm+=(c-1)\n \n if f==0:\n print(-1)\n else: \n print(sm)", "import sys\nsys.setrecursionlimit(10000000)\ndef mergeSortInversions(arr):\n if len(arr) == 1:\n return arr, 0\n larr=len(arr)\n a = arr[:larr//2]\n b = arr[larr//2:]\n a, ai = mergeSortInversions(a)\n b, bi = mergeSortInversions(b)\n c = []\n i = 0\n j = 0\n inversions = 0 + ai + bi\n la=len(a)\n while i < la and j < len(b):\n if a[i] <= b[j]:\n c.append(a[i])\n i += 1\n else:\n c.append(b[j])\n j += 1\n inversions += (la-i)\n c += a[i:]\n c += b[j:]\n return c, inversions \nfor _ in range(int(input())):\n n,d=list(map(int,input().split()))\n p=[int(o) for o in input().split()]\n array=[[] for i in range(d)]\n flag=0\n for i in range(n):\n array[i%d].append(p[i])\n if p[i]%((i%d)+1)!=0:\n flag=1\n \n \n ans=0\n dumarr=[0]*n\n for i in range(d):\n array[i],v=mergeSortInversions(array[i])\n for j in range(len(array[i])):\n dumarr[i+j*d]=array[i][j]\n ans+=v\n p=sorted(p)\n # print(dumarr)\n if dumarr==p:\n print(ans)\n else:\n print(-1)\n", "import sys\nsys.setrecursionlimit(10000000)\ndef mergeSortInversions(arr):\n if len(arr) == 1:\n return arr, 0\n larr=len(arr)\n a = arr[:larr//2]\n b = arr[larr//2:]\n a, ai = mergeSortInversions(a)\n b, bi = mergeSortInversions(b)\n c = []\n i = 0\n j = 0\n inversions = 0 + ai + bi\n la=len(a)\n while i < la and j < len(b):\n if a[i] <= b[j]:\n c.append(a[i])\n i += 1\n else:\n c.append(b[j])\n j += 1\n inversions += (la-i)\n c += a[i:]\n c += b[j:]\n return c, inversions \nfor _ in range(int(input())):\n n,d=list(map(int,input().split()))\n p=[int(o) for o in input().split()]\n array=[[] for i in range(d)]\n flag=0\n for i in range(n):\n array[i%d].append(p[i])\n if p[i]%((i%d)+1)!=0:\n flag=1\n # print(array)\n if flag==1:\n print(\"-1\")\n else:\n ans=0\n for i in range(d):\n # print(array[i])\n g,v=mergeSortInversions(array[i])\n # print(array[i],v)\n ans+=v\n print(ans)\n", "def merge(arr,start,mid,end):\n p=start\n q=mid+1\n k=0\n inv = 0\n temp=[0]*len(arr)\n for i in range(start,end+1):\n if p>mid :\n temp[k]=arr[q]\n k+=1\n q+=1\n elif q>end:\n temp[k]=arr[p]\n k+=1\n p+=1\n elif arr[p]<=arr[q]:\n temp[k]=arr[p]\n p+=1\n k+=1\n else:\n temp[k]=arr[q]\n q+=1\n k+=1\n inv += (mid-p+1)\n for i in range(k):\n arr[start]=temp[i]\n start+=1\n \n return inv\n\ndef mergesort(arr,start,end):\n inv_count=0 \n if start<end:\n mid=(start+end)//2\n inv_count += mergesort(arr,start,mid)\n inv_count += mergesort(arr,mid+1,end)\n inv_count += merge(arr,start,mid,end)\n return inv_count\n\n\ndef solve():\n n,d = map(int, input().split())\n p = list(map(int, input().split()))\n \n inv_count = 0\n m=[0]*n\n sb = True #sortable\n for i in range(d):\n k=0\n for j in range(i,n,d):\n m[k]=p[j]\n k+=1\n inv_count += mergesort(m,0,k-1)\n \n k=0\n for j in range(i,n,d):\n if not(m[k] == (j+1)):\n sb=False\n break\n k+=1\n \n if sb:\n print(inv_count)\n else:\n print(-1)\n\ndef main():\n for _ in range(int(input())):\n solve()\n\nmain()", "# cook your dish here\n# Python 3 program to count inversions in an array \n# Function to Use Inversion Count \ndef mergeSort(arr, n): \n # A temp_arr is created to store \n # sorted array in merge function \n temp_arr = [0]*n \n return _mergeSort(arr, temp_arr, 0, n-1) \n\n# This Function will use MergeSort to count inversions \n\ndef _mergeSort(arr, temp_arr, left, right): \n\n # A variable inv_count is used to store \n # inversion counts in each recursive call \n\n inv_count = 0\n\n # We will make a recursive call if and only if \n # we have more than one elements \n\n if left < right: \n\n # mid is calculated to divide the array into two subarrays \n # Floor division is must in case of python \n\n mid = (left + right)//2\n\n # It will calculate inversion counts in the left subarray \n\n inv_count = _mergeSort(arr, temp_arr, left, mid) \n\n # It will calculate inversion counts in right subarray \n\n inv_count += _mergeSort(arr, temp_arr, mid + 1, right) \n\n # It will merge two subarrays in a sorted subarray \n\n inv_count += merge(arr, temp_arr, left, mid, right) \n return inv_count \n\n# This function will merge two subarrays in a single sorted subarray \ndef merge(arr, temp_arr, left, mid, right): \n i = left # Starting index of left subarray \n j = mid + 1 # Starting index of right subarray \n k = left # Starting index of to be sorted subarray \n inv_count = 0\n\n # Conditions are checked to make sure that i and j don't exceed their \n # subarray limits. \n\n while i <= mid and j <= right: \n\n # There will be no inversion if arr[i] <= arr[j] \n\n if arr[i] <= arr[j]: \n temp_arr[k] = arr[i] \n k += 1\n i += 1\n else: \n # Inversion will occur. \n temp_arr[k] = arr[j] \n inv_count += (mid-i + 1) \n k += 1\n j += 1\n\n # Copy the remaining elements of left subarray into temporary array \n while i <= mid: \n temp_arr[k] = arr[i] \n k += 1\n i += 1\n\n # Copy the remaining elements of right subarray into temporary array \n while j <= right: \n temp_arr[k] = arr[j] \n k += 1\n j += 1\n\n # Copy the sorted subarray into Original array \n for loop_var in range(left, right + 1): \n arr[loop_var] = temp_arr[loop_var] \n \n return inv_count \n\n'''\ndef merge(arr,start,mid,end):\n p=start\n q=mid+1\n k=0\n inv = 0\n temp=[0]*len(arr)\n for i in range(start,end+1):\n if p>mid :\n temp[k]=arr[q]\n k+=1\n q+=1\n elif q>end:\n temp[k]=arr[p]\n k+=1\n p+=1\n elif arr[p]<=arr[q]:\n temp[k]=arr[p]\n p+=1\n k+=1\n else:\n temp[k]=arr[q]\n q+=1\n k+=1\n inv += (mid-p+1)\n for i in range(k):\n arr[start]=temp[i]\n start+=1\n \n return inv\n\ndef mergesort(arr,start,end):\n inv_count=0 \n if start<end:\n mid=(start+end)//2\n inv_count += mergesort(arr,start,mid)\n inv_count += mergesort(arr,mid+1,end)\n inv_count += merge(arr,start,mid,end)\n return inv_count\n\n'''\ndef solve():\n n,d = map(int, input().split())\n p = list(map(int, input().split()))\n \n inv_count = 0\n m={}\n sb = True #sortable\n for i in range(d):\n k=0\n for j in range(i,n,d):\n m[k]=p[j]\n k+=1\n inv_count += mergeSort(m,k)\n \n k=0\n for j in range(i,n,d):\n if not(m[k] == (j+1)):\n sb=False\n break\n k+=1\n \n if sb:\n print(inv_count)\n else:\n print(-1)\n\ndef main():\n for _ in range(int(input())):\n solve()\n\nmain()", "# cook your dish here\n# Python 3 program to count inversions in an array \n# Function to Use Inversion Count \ndef mergeSort(arr, n): \n # A temp_arr is created to store \n # sorted array in merge function \n temp_arr = [0]*n \n return _mergeSort(arr, temp_arr, 0, n-1) \n\n# This Function will use MergeSort to count inversions \n\ndef _mergeSort(arr, temp_arr, left, right): \n\n # A variable inv_count is used to store \n # inversion counts in each recursive call \n\n inv_count = 0\n\n # We will make a recursive call if and only if \n # we have more than one elements \n\n if left < right: \n\n # mid is calculated to divide the array into two subarrays \n # Floor division is must in case of python \n\n mid = (left + right)//2\n\n # It will calculate inversion counts in the left subarray \n\n inv_count = _mergeSort(arr, temp_arr, left, mid) \n\n # It will calculate inversion counts in right subarray \n\n inv_count += _mergeSort(arr, temp_arr, mid + 1, right) \n\n # It will merge two subarrays in a sorted subarray \n\n inv_count += merge(arr, temp_arr, left, mid, right) \n return inv_count \n\n# This function will merge two subarrays in a single sorted subarray \ndef merge(arr, temp_arr, left, mid, right): \n i = left # Starting index of left subarray \n j = mid + 1 # Starting index of right subarray \n k = left # Starting index of to be sorted subarray \n inv_count = 0\n\n # Conditions are checked to make sure that i and j don't exceed their \n # subarray limits. \n\n while i <= mid and j <= right: \n\n # There will be no inversion if arr[i] <= arr[j] \n\n if arr[i] <= arr[j]: \n temp_arr[k] = arr[i] \n k += 1\n i += 1\n else: \n # Inversion will occur. \n temp_arr[k] = arr[j] \n inv_count += (mid-i + 1) \n k += 1\n j += 1\n\n # Copy the remaining elements of left subarray into temporary array \n while i <= mid: \n temp_arr[k] = arr[i] \n k += 1\n i += 1\n\n # Copy the remaining elements of right subarray into temporary array \n while j <= right: \n temp_arr[k] = arr[j] \n k += 1\n j += 1\n\n # Copy the sorted subarray into Original array \n for loop_var in range(left, right + 1): \n arr[loop_var] = temp_arr[loop_var] \n \n return inv_count \n\n'''\ndef merge(arr,start,mid,end):\n p=start\n q=mid+1\n k=0\n inv = 0\n temp=[0]*len(arr)\n for i in range(start,end+1):\n if p>mid :\n temp[k]=arr[q]\n k+=1\n q+=1\n elif q>end:\n temp[k]=arr[p]\n k+=1\n p+=1\n elif arr[p]<=arr[q]:\n temp[k]=arr[p]\n p+=1\n k+=1\n else:\n temp[k]=arr[q]\n q+=1\n k+=1\n inv += (mid-p+1)\n for i in range(k):\n arr[start]=temp[i]\n start+=1\n \n return inv\n\ndef mergesort(arr,start,end):\n inv_count=0 \n if start<end:\n mid=(start+end)//2\n inv_count += mergesort(arr,start,mid)\n inv_count += mergesort(arr,mid+1,end)\n inv_count += merge(arr,start,mid,end)\n return inv_count\n\n'''\nfor _ in range(int(input())):\n n,d = list(map(int, input().split()))\n p = list(map(int, input().split()))\n \n inv_count = 0\n m={}\n sb = True #sortable\n for i in range(d):\n k=0\n for j in range(i,n,d):\n m[k]=p[j]\n k+=1\n inv_count += mergeSort(m,k)\n \n k=0\n for j in range(i,n,d):\n if not(m[k] == (j+1)):\n sb=False\n break\n k+=1\n \n if sb:\n print(inv_count)\n else:\n print(-1)\n", "def merge(arr,start,mid,end):\n p=start\n q=mid+1\n k=0\n inv = 0\n temp=[0]*len(arr)\n for i in range(start,end+1):\n if p>mid :\n temp[k]=arr[q]\n k+=1\n q+=1\n elif q>end:\n temp[k]=arr[p]\n k+=1\n p+=1\n elif arr[p]<=arr[q]:\n temp[k]=arr[p]\n p+=1\n k+=1\n else:\n temp[k]=arr[q]\n q+=1\n k+=1\n inv += (mid-p+1)\n for i in range(k):\n arr[start]=temp[i]\n start+=1\n \n return inv\n\ndef mergesort(arr,start,end):\n inv_count=0 \n if start<end:\n mid=(start+end)//2\n inv_count += mergesort(arr,start,mid)\n inv_count += mergesort(arr,mid+1,end)\n inv_count += merge(arr,start,mid,end)\n return inv_count\n\n\nfor _ in range(int(input())):\n n,d = list(map(int, input().split()))\n p = list(map(int, input().split()))\n \n inv_count = 0\n m={}\n sb = True #sortable\n for i in range(d):\n k=0\n for j in range(i,n,d):\n m[k]=p[j]\n k+=1\n inv_count += mergesort(m,0,k-1)\n \n k=0\n for j in range(i,n,d):\n if not(m[k] == (j+1)):\n sb=False\n break\n k+=1\n \n if sb:\n print(inv_count)\n else:\n print(-1)\n", "def merge(arr,start,mid,end):\n p=start\n q=mid+1\n k=0\n inv = 0\n temp=[0]*len(arr)\n for i in range(start,end+1):\n if p>mid :\n temp[k]=arr[q]\n k+=1\n q+=1\n elif q>end:\n temp[k]=arr[p]\n k+=1\n p+=1\n elif arr[p]<=arr[q]:\n temp[k]=arr[p]\n p+=1\n k+=1\n else:\n temp[k]=arr[q]\n q+=1\n k+=1\n inv += (mid-p+1)\n for i in range(k):\n arr[start]=temp[i]\n start+=1\n \n return inv\n\ndef mergesort(arr,start,end):\n inv_count=0 \n if start<end:\n mid=(start+end)//2\n inv_count += mergesort(arr,start,mid)\n inv_count += mergesort(arr,mid+1,end)\n inv_count += merge(arr,start,mid,end)\n return inv_count\n\n\nfor _ in range(int(input())):\n n,d = list(map(int, input().split()))\n p = list(map(int, input().split()))\n \n inv_count = 0\n m=[0]*n\n sb = True #sortable\n for i in range(d):\n k=0\n for j in range(i,n,d):\n m[k]=p[j]\n k+=1\n inv_count += mergesort(m,0,k-1)\n \n k=0\n for j in range(i,n,d):\n if not(m[k] == (j+1)):\n sb=False\n break\n k+=1\n \n if sb:\n print(inv_count)\n else:\n print(-1)\n", "def merge(arr,start,mid,end):\n p=start\n q=mid+1\n k=0\n inv = 0\n temp=[0]*len(arr)\n for i in range(start,end+1):\n if p>mid :\n temp[k]=arr[q]\n k+=1\n q+=1\n elif q>end:\n temp[k]=arr[p]\n k+=1\n p+=1\n elif arr[p]<=arr[q]:\n temp[k]=arr[p]\n p+=1\n k+=1\n else:\n temp[k]=arr[q]\n q+=1\n k+=1\n inv += (mid-p+1)\n for i in range(k):\n arr[start]=temp[i]\n start+=1\n \n return inv\n\ndef mergesort(arr,start,end):\n inv_count=0 \n if start<end:\n mid=(start+end)//2\n inv_count += mergesort(arr,start,mid)\n inv_count += mergesort(arr,mid+1,end)\n inv_count += merge(arr,start,mid,end)\n return inv_count\n\n\nfor _ in range(int(input())):\n n,d = list(map(int, input().split()))\n p = list(map(int, input().split()))\n \n inv_count = 0\n m=[0]*n\n sb = True #sortable\n for i in range(d):\n k=0\n for j in range(i,n,d):\n m[k]=p[j]\n k+=1\n b = m[0:k]\n inv_count += mergesort(b,0,k-1)\n \n k=0\n for j in range(i,n,d):\n if not(b[k] == (j+1)):\n sb=False\n break\n k+=1\n \n if sb:\n print(inv_count)\n else:\n print(-1)\n", "def merge(arr,start,mid,end):\n p=start\n q=mid+1\n k=0\n inv = 0\n temp=[0]*len(arr)\n for i in range(start,end+1):\n if p>mid :\n temp[k]=arr[q]\n k+=1\n q+=1\n elif q>end:\n temp[k]=arr[p]\n k+=1\n p+=1\n elif arr[p]<=arr[q]:\n temp[k]=arr[p]\n p+=1\n k+=1\n else:\n temp[k]=arr[q]\n q+=1\n k+=1\n inv += (mid-p+1)\n for i in range(k):\n arr[start]=temp[i]\n start+=1\n \n return inv\n\ndef mergesort(arr,start,end):\n inv_count=0 \n if start<end:\n mid=(start+end)//2\n inv_count += mergesort(arr,start,mid)\n inv_count += mergesort(arr,mid+1,end)\n inv_count += merge(arr,start,mid,end)\n return inv_count\n\n\nfor _ in range(int(input())):\n n,d = list(map(int, input().split()))\n p = list(map(int, input().split()))\n a = [0]*n\n \n #transformation\n for i in range(n):\n a[p[i]-1] = i\n \n m=[0]*d\n inv_count=0\n for i in range(d):\n t = (n-1-i)//d+1\n h=[0]*t\n for j in range(t):\n h[j]=a[i+j*(d)]\n #print(h)\n inv_count += mergesort(h,0,len(h)-1)\n m[i]=h\n #print(m)\n s=[0]*n\n for i in range(d):\n t = (n-1-i)//d+1\n for j in range(t):\n s[i+j*(d)]=m[i][j]\n mb=True\n #print('s',s)\n for i in range(n):\n if(s[i] == i):\n continue\n else:\n mb=False\n break\n if mb:\n print(inv_count)\n else:\n print(-1)\n", "def merge(arr,start,mid,end):\n p=start\n q=mid+1\n k=0\n inv = 0\n temp=[0]*len(arr)\n for i in range(start,end+1):\n if p>mid :\n temp[k]=arr[q]\n k+=1\n q+=1\n elif q>end:\n temp[k]=arr[p]\n k+=1\n p+=1\n elif arr[p]<=arr[q]:\n temp[k]=arr[p]\n p+=1\n k+=1\n else:\n temp[k]=arr[q]\n q+=1\n k+=1\n inv += (mid-p+1)\n for i in range(k):\n arr[start]=temp[i]\n start+=1\n \n return inv\n\ndef mergesort(arr,start,end):\n inv_count=0 \n if start<end:\n mid=(start+end)//2\n inv_count += mergesort(arr,start,mid)\n inv_count += mergesort(arr,mid+1,end)\n inv_count += merge(arr,start,mid,end)\n return inv_count\n\n\nfor _ in range(int(input())):\n n,d = list(map(int, input().split()))\n p = list(map(int, input().split()))\n a = [0]*len(p)\n \n #transformation\n for i in range(len(p)):\n a[p[i]-1] = i\n \n m=[]\n k=[i for i in range(n)]\n inv_count=0\n for i in range(d):\n h=[]\n for j in range(n):\n if (i+j*(d))>=n:\n break\n h.append(a[i+j*(d)])\n #print(h)\n m.append(h)\n inv_count += mergesort(m[-1],0,len(m[-1])-1)\n #print(m)\n s=[0]*n\n for i in range(d):\n for j in range(n):\n if (i+j*(d))>=n:\n break\n s[i+j*(d)]=m[i][j]\n mb=True\n #print('s',s)\n for i in range(n):\n if(s[i] == k[i]):\n continue\n else:\n mb=False\n break\n if mb:\n print(inv_count)\n else:\n print(-1)\n", "t=int(input())\ndef solve(arr):\n if len(arr)==1:\n return [0,arr]\n ans=0\n left=arr[:len(arr)//2]\n right=arr[len(arr)//2:]\n val1,lis1=solve(left)\n val2,lis2=solve(right)\n val,lis=merge(lis1,lis2)\n return [val+val1+val2,lis]\n\ndef merge(left,right):\n ans=[]\n final=0\n i,j=0,0\n n=len(left)\n while i<len(left) and j<len(right):\n if left[i]<right[j]:\n ans+=[left[i]]\n i+=1\n else:\n ans+=[right[j]]\n final+=n-i\n j+=1\n ans+=left[i:]+right[j:]\n return [final,ans]\n \n \nfor _ in range(t):\n n,d=list(map(int,input().split()))\n arr=list(map(int,input().split()))\n ans=0\n dic={i:[] for i in range(d)}\n found=False\n for i in range(n):\n if (arr[i]-i-1)%d!=0:\n found=True\n break\n else:\n if arr[i]%d==0:\n dic[0]+=[arr[i]//d-1]\n else:\n dic[arr[i]%d]+=[(arr[i]-(arr[i]%d))//d]\n if found:\n print(-1)\n else:\n ans=0\n for perm in list(dic.values()):\n ans+=solve(perm)[0]\n print(ans)\n", "t=int(input())\ndef solve(arr):\n if len(arr)==1:\n return [0,arr]\n ans=0\n left=arr[:len(arr)//2]\n right=arr[len(arr)//2:]\n val1,lis1=solve(left)\n val2,lis2=solve(right)\n val,lis=merge(lis1,lis2)\n return [val+val1+val2,lis]\n\ndef merge(left,right):\n ans=[]\n final=0\n i,j=0,0\n n=len(left)\n while i<len(left) and j<len(right):\n if left[i]<right[j]:\n ans+=[left[i]]\n i+=1\n else:\n ans+=[right[j]]\n final+=n-i\n j+=1\n ans+=left[i:]+right[j:]\n return [final,ans]\n \n \nfor _ in range(t):\n n,d=list(map(int,input().split()))\n arr=list(map(int,input().split()))\n ans=0\n dic={i:[] for i in range(d)}\n found=False\n for i in range(n):\n if (arr[i]-i-1)%d!=0:\n found=True\n break\n else:\n if arr[i]%d==0:\n dic[0]+=[arr[i]//d-1]\n else:\n dic[arr[i]%d]+=[(arr[i]-(arr[i]%d))//d]\n if found:\n print(-1)\n else:\n ans=0\n for perm in list(dic.values()):\n ans+=solve(perm)[0]\n print(ans)\n \n \n \n", "def valid(hash_t,n,d):\n flag = 0\n for i in range(d):\n for j in range(i+1,n,d):\n if (hash_t[j] - hash_t[i+1]) % d != 0:\n flag = 1\n return False\n\n return True\n\n\ndef num_inversion(hash_t,n,d):\n count = 0\n for i in range(d):\n for j in range(i+1,n,d):\n for k in range(j,n,d):\n if hash_t[j] > hash_t[k]:\n count += 1\n return count\n\n\ntc = int(input())\nwhile tc:\n n, d = input().split()\n n = int(n)\n d = int(d)\n a = [int(x) for x in input().split(\" \")]\n if d == 1:\n count = 0\n for i in range(n):\n for j in range(i+1,n):\n if a[i] > a[j]:\n count += 1\n print(count)\n else :\n hash_t = [0]*(n+1)\n for i in range(n):\n hash_t[a[i]] = i+1\n\n if not valid(hash_t,n+1,d):\n print(-1)\n else :\n #print(\"Valid\")\n count = num_inversion(hash_t,n+1,d)\n print(count)\n tc -= 1"] | {"inputs": [["2", "5 2", "3 4 5 2 1", "5 2", "4 3 2 1 5"]], "outputs": [["3", "-1"]]} | INTERVIEW | PYTHON3 | CODECHEF | 29,737 | |
6ca38be9754f58d3b65240fe5bb3f944 | UNKNOWN | Chef has recently learned about number bases and is becoming fascinated.
Chef learned that for bases greater than ten, new digit symbols need to be introduced, and that the convention is to use the first few letters of the English alphabet. For example, in base 16, the digits are 0123456789ABCDEF. Chef thought that this is unsustainable; the English alphabet only has 26 letters, so this scheme can only work up to base 36. But this is no problem for Chef, because Chef is very creative and can just invent new digit symbols when she needs them. (Chef is very creative.)
Chef also noticed that in base two, all positive integers start with the digit 1! However, this is the only base where this is true. So naturally, Chef wonders: Given some integer N, how many bases b are there such that the base-b representation of N starts with a 1?
-----Input-----
The first line of the input contains an integer T denoting the number of test cases. The description of T test cases follows.
Each test case consists of one line containing a single integer N (in base ten).
-----Output-----
For each test case, output a single line containing the number of bases b, or INFINITY if there are an infinite number of them.
-----Constraints-----
-----Subtasks-----Subtask #1 (16 points):
- 1 ≤ T ≤ 103
- 0 ≤ N < 103
Subtask #2 (24 points):
- 1 ≤ T ≤ 103
- 0 ≤ N < 106
Subtask #3 (28 points):
- 1 ≤ T ≤ 103
- 0 ≤ N < 1012
Subtask #4 (32 points):
- 1 ≤ T ≤ 105
- 0 ≤ N < 1012
-----Example-----
Input:4
6
9
11
24
Output:4
7
8
14
-----Explanation-----
In the first test case, 6 has a leading digit 1 in bases 2, 4, 5 and 6: 610 = 1102 = 124 = 115 = 106. | ["# cook your dish here\ndef finder(n):\n cnt=0\n for i in range(2,n+1):\n a=n\n while a!=0:\n r=a%i\n a=a//i\n if r==1:\n cnt+=1\n return cnt\n\nt=int(input())\nfor _ in range(t):\n n=int(input())\n if n==0:\n print(0)\n elif n==1:\n print('INFINITY')\n else:\n print(finder(n))\n ", "import math\r\n\r\n\r\ndef bases(n):\r\n n = int(n)\r\n if n == 0:\r\n return('0')\r\n elif n == 1:\r\n return('INFINITY')\r\n else:\r\n sumas = 1\r\n i = 2\r\n while i < n:\r\n arreglo = primer_digito(n, i)\r\n potencia = arreglo[1]\r\n primer = arreglo[0]\r\n resto = n - (i ** potencia)\r\n if primer == 1 and potencia == 1:\r\n sumas += resto\r\n i += resto\r\n elif primer == 1:\r\n sumas += 1\r\n i += 1\r\n else:\r\n i += 1\r\n return sumas\r\n\r\n\r\ndef primer_digito(numero, base):\r\n potencia = int(math.log(numero, base))\r\n primer = numero // (base ** potencia)\r\n if primer >= base:\r\n primer = primer / base\r\n potencia += 1\r\n arreglo = [primer, potencia]\r\n return arreglo\r\n\r\n\r\ncasos = input()\r\nfor i in range(int(casos)):\r\n numero = input()\r\n print(bases(numero))\r\n", "#sabemos que no existe una base B>N donde el n\u00famero empieze con 1 analizamos los casos 0,1 y los dem\u00e1s enteros\r\nT=input() #casos a analizar\r\nT=int(T)\r\nfor a in range(0,T):\r\n N=input() #n\u00famero de base\r\n N=int(N)\r\n unos = 1\r\n if N==1:\r\n print('INFINITY')\r\n elif N==0:\r\n print(0)\r\n else:\r\n for b in range(3,N+1):\r\n a=N\r\n while a>=b:\r\n a = int(a/b)\r\n if a==1:\r\n unos+=1\r\n print(unos)", "# cook your dish here\nn=int(input())\ndef dig(num,b):\n c=0\n mul=b\n while(True):\n if(num//mul!=0):\n mul=mul*b\n c+=1 \n else:\n break\n return c \nfor q in range(n):\n num=int(input())\n res=0\n for i in range(3,num):\n po=dig(num,i)\n if((2*(i**po)-1)>=num):\n res+=1 \n if(num==2):\n res=res+1 \n if(num>2):\n res=res+2\n if(num==1):\n print(\"INFINITY\")\n else:\n print(res)\n ", "t = int(input())\r\nfor i in range(0, t):\r\n n = int(input())\r\n c = 1\r\n if n == 0:\r\n print(0)\r\n elif n == 1:\r\n print(\"INFINITY\")\r\n else:\r\n for j in range(3, n+1):\r\n a = n\r\n while a >= j:\r\n a = int(a/j)\r\n if a == 1:\r\n c = c+1\r\n print(c)\r\n ", "t=eval(input())\r\nfor g in range(t):\r\n n=int(input())\r\n if n==0:\r\n print(0)\r\n elif n==1:\r\n print('INFINITY')\r\n else:\r\n a=0\r\n for x in range(2,n):\r\n k=1\r\n while n>=x**k:\r\n k+=1\r\n k-=1\r\n if 2*(x**k)>n:\r\n a+=1\r\n\r\n\r\n\r\n print(a+1)\r\n", "from math import sqrt as S \r\nfor _ in range(int(input())):\r\n n=int(input())\r\n if n==1:\r\n print('INFINITY')\r\n continue \r\n else:\r\n ans=0 \r\n z=int(S(n))\r\n for i in range(2,z+1):\r\n temp=n \r\n while temp:\r\n r=temp%i \r\n temp=temp//i \r\n if r==1: ans+=1\r\n k=n//2 \r\n if n>k:\r\n ans+=n-k \r\n print(ans)", "for _ in range(int(input())):\r\n n=int(input())\r\n cnt=0\r\n for i in range(2,n+1):\r\n temp=n \r\n while temp:\r\n r=temp%i \r\n temp=temp//i \r\n if r==1:\r\n cnt+=1\r\n if n==1:\r\n print('INFINITY')\r\n else:\r\n print(cnt)"] | {"inputs": [["4", "6", "9", "11", "24"]], "outputs": [["4", "7", "8", "14"]]} | INTERVIEW | PYTHON3 | CODECHEF | 4,070 | |
8a86669623f418c9d026e343ced7e8e9 | UNKNOWN | For a permutation P = (p1, p2, ..., pN) of numbers [1, 2, ..., N], we define the function f(P) = max(p1, p2) + max(p2, p3) + ... + max(pN-1, pN).
You are given N and an integer K. Find and report a permutation P of [1, 2, ..., N] such that f(P) = K, if such a permutation exists.
Note f([1]) = 0.
-----Input-----
- The first line of the input contains an integer T denoting the number of test cases. The description of T test cases follows.
- The only line of each test case consists of two space-separated integers N, K respectively.
-----Output-----
For each test case, if a permutation satisfying the condition exists, output a single line containing N space-separated integers which denotes any such permutation. If no such permutation exists, output a single integer -1 instead.
Use fast I/O methods since the size of the output is large.
-----Constraints-----
- 1 ≤ T ≤ 40
- 1 ≤ N ≤ 105
- Sum of N over all test cases in each file ≤ 106
- 0 ≤ K ≤ 2 * 1010
-----Example-----
Input:
3
4 12
2 2
5 14
Output:
-1
1 2
5 4 3 2 1
-----Explanation-----
Example 1. There doesn't exist any permutation of numbers [1, 2, 3, 4] that can have its f value equal to 4. Hence answer is -1.
Example 2. The permutations [1, 2] and [2, 1] both have their f values equal to 2. You can print any of these two permutations.
Example 3. The permutation [5, 4, 3, 2, 1]
has f value = max(5, 4) + max(4, 3) + max(3, 2) + max(2, 1) = 5 + 4 + 3 + 2 = 14. | ["# cook your dish here\nfor i in range(int(input())):\n n,k=[int(i) for i in input().split()]\n if(n%2==0):\n if(k<(n*(n+1))//2 - 1 or k>3*((n//2)**2) - 1):print(-1)\n elif(k==(n*(n+1))//2 - 1):\n for i in range(1,n+1):print(i,'',end='')\n print()\n else:\n k,count,p,l,x = k-(n*(n+1))//2 + 1,0,0,[0 for i in range(n)],1\n while(k>0):p+=2 ;k,count = k-n+p ,count+1\n for i in range(n,n-count+1,-1):l[x]=i ;x+=2\n k=-k ;l[2*count - 1 +k],p = n-count+1 ,1\n for i in range(n):\n if(l[i]==0):l[i]=p ; p+=1 \n for i in l:print(i,'',end='')\n print()\n else:\n if(n==1):print(1) if(k==0) else print(-1) \n elif(k<(n*(n+1))//2 - 1 or k>3*(n//2)*(n//2 + 1)):print(-1)\n elif(k==(n*(n+1))//2 - 1):\n for i in range(1,n+1):print(i,'',end='')\n print()\n else:\n k,count,p,l,x = k-(n*(n+1))//2 + 1,0,0,[0 for i in range(n)],1\n while(k>0): p+=2 ; k,count = k-n+p ,count+1", "for i in range(int(input())):\n n,k=[int(i) for i in input().split()]\n if(n%2==0):\n if(k<(n*(n+1))//2 - 1 or k>3*((n//2)**2) - 1):print(-1)\n elif(k==(n*(n+1))//2 - 1):\n for i in range(1,n+1):print(i,'',end='')\n print()\n else:\n k,count,p,l,x = k-(n*(n+1))//2 + 1,0,0,[0 for i in range(n)],1\n while(k>0):p+=2 ;k,count = k-n+p ,count+1\n for i in range(n,n-count+1,-1):l[x]=i ;x+=2\n k=-k ;l[2*count - 1 +k],p = n-count+1 ,1\n for i in range(n):\n if(l[i]==0):l[i]=p ; p+=1 \n for i in l:print(i,'',end='')\n print()\n else:\n if(n==1):print(1) if(k==0) else print(-1) \n elif(k<(n*(n+1))//2 - 1 or k>3*(n//2)*(n//2 + 1)):print(-1)\n elif(k==(n*(n+1))//2 - 1):\n for i in range(1,n+1):print(i,'',end='')\n print()\n else:\n k,count,p,l,x = k-(n*(n+1))//2 + 1,0,0,[0 for i in range(n)],1\n while(k>0): p+=2 ; k,count = k-n+p ,count+1\n for i in range(n,n-count+1,-1): l[x]=i; x+=2 "] | {"inputs": [["3", "4 12", "2 2", "5 14"]], "outputs": [["-1", "1 2", "5 4 3 2 1"]]} | INTERVIEW | PYTHON3 | CODECHEF | 2,018 | |
eb1553dc07e02fb53b40ca07933ce37b | UNKNOWN | Our chef has been assigned a task to make a necklace of length N, from gold, diamond and platinum.There is single kind of gold, two types of diamond and three types of platinum available.
A necklace can be represented as strings of the form (G)∗(D1|D2)∗(P1|P2|P3)∗$ (G)*(D1|D2)*(P1|P2|P3)* $ where (x|y) means we can use x or y and ∗$ * $ means we can repeat the previous parenthesized expression 0 or more times.
Instead of making necklace he choose to count all such distinct necklaces possible for a given length N.
-----Input:-----
-The first line of the input contains a single integer T$T$ denoting the number of test cases. The description of T$T$ test cases follows.
-Only line of every test case contains an integer N$N$ denoting the length of the necklace required.
-----Output:-----
For each test case, print the number of all such distinct necklaces, with given length. As the number can be really large, print it modulo 109+7$10^{9}+7$.
-----Constraints-----
- 1≤T≤10000$1 \leq T \leq 10000$
- 2≤N≤1000000000$2 \leq N \leq 1000000000$
- String S$S$ consists of only upper case english alphabets.
-----Subtasks-----
- 20 points : 1≤N≤5$1 \leq N \leq 5$
- 70 points : Original$Original$ Constraints$Constraints$
-----Sample Input:-----
2
1
2
-----Sample Output:-----
6
25 | ["t=int(input())\r\nfor _ in range(t):\r\n n=int(input())\r\n p=10**9+7\r\n a=(pow(3,n+1,p)-1)\r\n \r\n b=(pow(2,n+1,p)-1)\r\n \r\n print((((3*a)//2)%p-(2*(b))%p+p)%p)", "t=int(input())\r\nfor _ in range(t):\r\n n=int(input())\r\n p=10**9+7\r\n a=(pow(3,n+1,p)-1)\r\n b=(pow(2,n+1,p)-1)\r\n print(((3*a)//2)%p-(2*(b))%p)", "t=int(input())\r\nfor _ in range(t):\r\n n=int(input())\r\n p=10**9+7\r\n a=(pow(3,n+1,p)-1)\r\n b=(pow(2,n+1,p)-1)\r\n print(((3*a)//2)%p-(2*(b))%p)", "tc=int(input())\r\nwhile tc>0:\r\n tc-=1\r\n mod_inv=500000004\r\n mod=1000000007\r\n n=int(input())\r\n res=((4500000036*(pow(3,n,mod)-1))%mod)-(4*(pow(2,n,mod)-1))\r\n print((res+1)%mod)\r\n", "import math\r\nimport bisect\r\nimport itertools\r\nimport sys\r\nmod=10**9 +7\r\n'''fact=[1]*1001\r\nifact=[1]*1001\r\nfor i in range(1,1001):\r\n fact[i]=((fact[i-1])*i)%mod\r\n ifact[i]=((ifact[i-1])*pow(i,mod-2,mod))%mod\r\ndef ncr(n,r):\r\n return (((fact[n]*ifact[n-r])%mod)*ifact[r])%mod\r\ndef npr(n,r):\r\n return (((fact[n]*ifact[n-r])%mod))\r\n '''\r\n'''def mindiff(a):\r\n b=a[:]\r\n b.sort()\r\n m=10000000000\r\n for i in range(len(b)-1):\r\n if b[i+1]-b[i]<m:\r\n m=b[i+1]-b[i]\r\n return m\r\n '''\r\n'''def lcm(a,b):\r\n return a*b//math.gcd(a,b)\r\n\r\n '''\r\n \r\n'''def merge(a,b):\r\n i=0;j=0\r\n c=0\r\n ans=[]\r\n while i<len(a) and j<len(b):\r\n if a[i]<b[j]:\r\n ans.append(a[i])\r\n i+=1\r\n else:\r\n ans.append(b[j])\r\n c+=len(a)-i\r\n j+=1\r\n ans+=a[i:]\r\n ans+=b[j:]\r\n return ans,c\r\ndef mergesort(a):\r\n if len(a)==1:\r\n return a,0\r\n mid=len(a)//2 \r\n left,left_inversion=mergesort(a[:mid])\r\n right,right_inversion=mergesort(a[mid:])\r\n m,c=merge(left,right)\r\n c+=(left_inversion+right_inversion)\r\n return m,c\r\n \r\n'''\r\n'''\r\ndef is_prime(num):\r\n if num == 2: return True\r\n if num == 3: return True\r\n if num%2 == 0: return False\r\n if num%3 == 0: return False\r\n t = 5\r\n a = 2\r\n while t <= int(math.sqrt(num)):\r\n if num%t == 0: return False\r\n t += a\r\n a = 6 - a\r\n return True\r\n '''\r\na1=[2,6]\r\na2=[3,18]\r\na=[]\r\nfor i in range(100000):\r\n a2.append(((a2[-1]+a1[-1]+1)*3)%mod)\r\n a1.append(((a1[-1]+1)*2)%mod)\r\nfor i in range(100000):\r\n a.append((a1[i]+a2[i]+1)%mod)\r\nt=int(input())\r\n#print(a)\r\nfor i in range(t):\r\n n=int(input())\r\n print(a[n- 1])", "t=int(input())\r\nfor _ in range(t):\r\n n=int(input())\r\n p=10**9+7\r\n a=(pow(3,n+1,p)-1)\r\n b=(pow(2,n+1,p)-1)\r\n print((((3*a)//2)%p-(2*(b))%p)%p)", "T=int(input())\r\nwhile T>0:\r\n T-=1\r\n mod_inv=500000004\r\n mod=1000000007\r\n n=int(input())\r\n ans=((4500000036*(pow(3,n,mod)-1))%mod)-(4*(pow(2,n,mod)-1))\r\n print((ans+1)%mod)\r\n", "import math\r\nimport bisect\r\nimport itertools\r\nimport sys\r\nmod=10**9 +7\r\n'''fact=[1]*1001\r\nifact=[1]*1001\r\nfor i in range(1,1001):\r\n fact[i]=((fact[i-1])*i)%mod\r\n ifact[i]=((ifact[i-1])*pow(i,mod-2,mod))%mod\r\ndef ncr(n,r):\r\n return (((fact[n]*ifact[n-r])%mod)*ifact[r])%mod\r\ndef npr(n,r):\r\n return (((fact[n]*ifact[n-r])%mod))\r\n '''\r\n'''def mindiff(a):\r\n b=a[:]\r\n b.sort()\r\n m=10000000000\r\n for i in range(len(b)-1):\r\n if b[i+1]-b[i]<m:\r\n m=b[i+1]-b[i]\r\n return m\r\n '''\r\n'''def lcm(a,b):\r\n return a*b//math.gcd(a,b)\r\n\r\n '''\r\n \r\n'''def merge(a,b):\r\n i=0;j=0\r\n c=0\r\n ans=[]\r\n while i<len(a) and j<len(b):\r\n if a[i]<b[j]:\r\n ans.append(a[i])\r\n i+=1\r\n else:\r\n ans.append(b[j])\r\n c+=len(a)-i\r\n j+=1\r\n ans+=a[i:]\r\n ans+=b[j:]\r\n return ans,c\r\ndef mergesort(a):\r\n if len(a)==1:\r\n return a,0\r\n mid=len(a)//2 \r\n left,left_inversion=mergesort(a[:mid])\r\n right,right_inversion=mergesort(a[mid:])\r\n m,c=merge(left,right)\r\n c+=(left_inversion+right_inversion)\r\n return m,c\r\n \r\n'''\r\n'''\r\ndef is_prime(num):\r\n if num == 2: return True\r\n if num == 3: return True\r\n if num%2 == 0: return False\r\n if num%3 == 0: return False\r\n t = 5\r\n a = 2\r\n while t <= int(math.sqrt(num)):\r\n if num%t == 0: return False\r\n t += a\r\n a = 6 - a\r\n return True\r\n '''\r\na1=[2,6]\r\na2=[3,18]\r\na=[]\r\nfor i in range(100000):\r\n a2.append(((a2[-1]+a1[-1]+1)*3)%mod)\r\n a1.append(((a1[-1]+1)*2)%mod)\r\nfor i in range(100000):\r\n a.append(a1[i]+a2[i]+1)\r\nt=int(input())\r\nfor i in range(t):\r\n n=int(input())\r\n print(a[n- 1])", "t=int(input())\r\nfor _ in range(t):\r\n n=int(input())\r\n p=10**9+7\r\n a=(pow(3,n+1,p)-1)%p\r\n b=(pow(2,n+1,p)-1)%p\r\n print((((3*a)//2)%p-(2*(b))%p)%p)", "\r\nt=int(input())\r\nmod=10**9+7\r\ninverse=5*(10**8)+4\r\n\r\nfor i in range(t):\r\n\tn=int(input())\r\n\ttemp1=pow(3,n+2,mod)\r\n\ttemp2=pow(2,n+3,mod)\r\n\ta=(temp1-temp2+1)%mod\r\n\ta=(a*inverse)%mod\r\n\t\r\n\tprint(a)\t", "t=int(input())\r\nans=[]\r\nfor i in range(t):\r\n\tn=int(input())\r\n\tc=0\r\n\tfor j in range(n+1):\r\n\t\tfor k in range(0,n-j+1):\r\n\t\t\tc+=(2**k)*(3**j)\r\n\tans.append(c)\r\nfor i in ans:\r\n\tprint(i)\r\n", "\r\nt=int(input())\r\nmod=10**9+7\r\nfor i in range(t):\r\n\tn=int(input())\r\n\tans=0\r\n\tfor j in range(n+1):\r\n\t\ttemp1=pow(3,j,mod)\r\n\t\ttemp2=(pow(2,n+1-j,mod)+(mod-1))%mod\r\n\t\ttemp3=(temp1*temp2)%mod\r\n\t\tans=(ans+temp3)%mod\r\n\tprint(ans)\t", "\r\nt=int(input())\r\nmod=1000000007\r\nwhile t:\r\n t-=1\r\n n=int(input())\r\n ans=(2*pow(3,n+1,mod))%mod-pow(2,n+2,mod)-((pow(3,n+1,mod)-1)*(500000004))%mod\r\n ans%=mod\r\n print(ans)\r\n", "MOD = int(1e9 + 7)\r\nfor _ in range(int(input())):\r\n n = int(input()) + 1\r\n res = (((3*pow(3, n, MOD) - 3) % MOD) * 500000004)% MOD\r\n res = (res - (2*(pow(2, n, MOD) - 1)) % MOD) % MOD\r\n print(res)", "T=int(input())\r\nwhile T>0:\r\n T-=1\r\n n=int(input())\r\n ans=0;\r\n for i in range(n+1):\r\n for j in range(n-i+1):\r\n k=(n-i-j)\r\n # print(i,j,k)\r\n ans+=((pow(2,j,1000000007)*pow(3,k,1000000007))%1000000007)\r\n print(ans)\r\n"] | {"inputs": [["2", "1", "2"]], "outputs": [["6", "25"]]} | INTERVIEW | PYTHON3 | CODECHEF | 6,501 | |
4109aeb9bc16212f3957ce44e8499c30 | UNKNOWN | Chef likes to travel very much. He plans some travel routes and wants to know their lengths. He hired you to make these calculations. But be careful, some of the routes are incorrect. There may be some misspelling in city names or there will be no road between some two consecutive cities in the route. Also note that Chef hates to visit the same city twice during his travel. Even the last city should differ from the first. Two consecutive cities in the route should also be different. So you need to check these conditions for the given routes too.
You will be given the list of all cities and all roads between them with their lengths. All roads are one-way. Also you will be given the list of all travel routes that Chef plans. For each route you should check whether it is correct and find its length in this case.
-----Input-----
The first line contains positive integer N, the number of cities. The second line contains space separated list of N strings, city names. All city names are distinct.
The third line contains non-negative integer M, the number of available roads. Each of the next M lines describes one road and contains names C1 and C2 of two cities followed by the positive integer D, the length of the one-way road that connects C1 with C2. It is guaranteed that C1 and C2 will be correct names of two different cities from the list of N cities given in the second line of the input file. For each pair of different cities there is at most one road in each direction and each road will be described exactly once in the input file.
Next line contains positive integer T, the number of travel routes planned by the Chef. Each of the next T lines contains positive integer K followed by K strings, names of cities of the current route. Cities are given in order in which Chef will visit them during his travel.
All strings in the input file composed only of lowercase, uppercase letters of the English alphabet and hyphens. Each string is non-empty and has length at most 20. If some line of the input file contains more then one element than consecutive elements of this line are separated by exactly one space. Each line of the input file has no leading or trailing spaces.
-----Output-----
For each travel route from the input file output a single line containing word ERROR if the route is incorrect and its length otherwise.
-----Constraints-----
1 <= N <= 50
0 <= M <= N * (N - 1)
1 <= D <= 20000
1 <= T <= 50
1 <= K <= 50
1 <= length of each string <= 20
-----Example-----
Input:
5
Donetsk Kiev New-York Miami Hollywood
9
Donetsk Kiev 560
Kiev New-York 7507
New-York Miami 1764
Miami Hollywood 28
Hollywood Miami 30
Miami New-York 1764
Kiev Donetsk 550
Hollywood New-York 1736
New-York Hollywood 1738
13
5 Donetsk Kiev New-York Miami Hollywood
5 Hollywood Miami New-York Kiev Donetsk
3 Donetsk Kiev Donetsk
2 Kyiv New-York
3 New-York Hollywood Miami
2 New-York Miami
3 Hollywood New-York Miami
4 Donetsk Kiev Miami Hollywood
2 Donetsk Hollywood
1 Donetsk
2 Mumbai Deli
6 Donetsk Kiev New-York Miami Hollywood New-York
2 Miami Miami
Output:
9859
ERROR
ERROR
ERROR
1768
1764
3500
ERROR
ERROR
0
ERROR
ERROR
ERROR
-----Explanation-----
The 2nd route is incorrect since there is no road from New-York to Kiev. Note however that inverse road from Kiev to New-York exists.
The 3rd route is incorrect since the first city coincides with the last one.
The 4th route is incorrect since there is no city with name Kyiv (Probably Chef means Kiev but he misspells this word).
The 8th route is incorrect since there is no road from Miami to Kiev.
The 9th route is incorrect since there is no road from Donetsk to Hollywood.
The 10th route is correct. Note that a route composed of exactly one city is always correct provided that city name is written correctly.
The 11th route is incorrect since there is no cities with names Mumbai and Deli. (Probably Chef is not so good in geography :))
The 12th route is incorrect since city New-York is visited twice.
Finally the 13th route is incorrect since we have equal consecutive cities. | ["import sys\n\ndef _r(*conv) :\n r = [conv[i](x) for i, x in enumerate(input().strip().split(' '))]\n return r[0] if len(r) == 1 else r\n\ndef _ra(conv) :\n return list(map(conv, input().strip().split(' ')))\n\ndef _rl() :\n return list(input().strip())\n\ndef _rs() :\n return input().strip()\n\ndef _a(k, *v) :\n return all(x == k for x in v)\n\ndef _i(conv) :\n for line in sys.stdin :\n yield conv(line)\n##################################################################\n\nn = _r(int)\nlookup = dict([(x, i) for i, x in enumerate(_ra(str))])\ng = [(set(), dict()) for _ in range(n)]\n\nm = _r(int)\nfor _ in range(m) :\n c1, c2, d = _r(str, str, int)\n i1 = lookup[c1]\n\n g[i1][0].add(c2)\n g[i1][1][c2] = d\n\n\nt = _r(int)\nfor _ in range(t) :\n k = _ra(str)[1:]\n \n failed = False\n if len(set(k)) != len(k) :\n failed = True\n\n if not failed :\n if k[0] not in lookup : \n failed = True\n else : \n r = 0\n v = g[lookup[k[0]]]\n\n for i in range(1, len(k)) : \n if k[i] not in v[0] : \n failed = True\n break\n\n r += v[1][k[i]]\n v = g[lookup[k[i]]]\n \n if not failed : \n print(r)\n \n if failed : \n print('ERROR')\n", "def main():\n n = eval(input())\n city = input().split()\n m = eval(input())\n mapp = {}\n for c in city:\n mapp[c] = [0]*n\n while m:\n m-=1\n road = input().split()\n temp = mapp[road[0]]\n temp[city.index(road[1])] = int(road[-1])\n mapp[road[0]] = temp\n t=eval(input())\n while t:\n t-=1\n dist = 0\n v = [0]*n #visited\n route = input().split()\n if route[0] == '1':\n if route[-1] in city:\n print(dist)\n else:\n print('ERROR')\n else:\n for r in range(1,int(route[0])+1):\n if (route[r] not in city) or v[city.index(route[r])]:\n dist = 'ERROR'\n break\n elif r>1:\n if mapp[route[r-1]][city.index(route[r])]:\n dist+= mapp[route[r-1]][city.index(route[r])]\n else:\n dist = 'ERROR'\n break\n v[city.index(route[r])] = 1\n print(dist)\nmain() ", "n=int(input())\ns=list(map(str,input().split()))\nm=int(input())\ndic={}\nfor i in range(m):\n a,b,c=list(map(str,input().split()))\n c=int(c)\n dic[(a,b)]=c\n \nt=int(input())\nfor i in range(t):\n x=list(map(str,input().split()))\n y=len(x)\n if int(x[0])==1 and x[1] in s:\n print(\"0\")\n elif int(x[0])==1:\n print(\"ERROR\")\n elif x[1]==x[y-1]:\n print(\"ERROR\")\n else:\n if int(x[0])>n:\n print(\"ERROR\")\n else:\n flag=1\n ans=0\n dic2={}\n for j in range(1,len(x)):\n if x[j] in dic2:\n dic2[x[j]]+=1\n else:\n dic2[x[j]]=1\n for j in dic2:\n if dic2[j]>1:\n flag=0\n break\n if flag==1:\n for j in range(1,len(x)-1):\n if (x[j],x[j+1]) in dic:\n ans+=dic[(x[j],x[j+1])]\n else:\n flag=0\n break\n if flag==0:\n print(\"ERROR\")\n else:\n print(ans)", "def main():\n #read no of cities\n n = eval(input())\n #read cities\n city = input().split()\n #read no of routes\n m = eval(input())\n mapp = {}\n #zero out map of routes\n for c in city:\n mapp[c] = [0]*n\n #populate map with available routes by index\n while m:\n m -= 1\n road = input().split()\n elem = mapp[road[0]]\n elem[city.index(road[1])] = int(road[2])\n mapp[road[0]] = elem\n #read no of itineraries\n itins = eval(input())\n #process each itinerary\n while itins:\n itins -= 1\n #read a route\n route = input().split()\n total = 0\n #zero out visited cities\n v = [0]*n\n #if only 1 city in route, print 0\n if route[0] == '1':\n if route[-1] in city:\n print(total)\n #if city not available, print error\n else:\n print(\"ERROR\")\n else:\n #for each city in itinerary\n for r in range(1, len(route)):\n #if city not available or has been visited, print error\n if (route[r] not in city) or v[city.index(route[r])]:\n total = \"ERROR\"\n break\n #if first city in line, visit and move on, otherwise\n elif r > 1:\n #check if there is a route from the previous city to the \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0current city in the map\n if mapp[route[r-1]][city.index(route[r])]:\n #add to totall\n total += mapp[route[r-1]][city.index(route[r])]\n #if no route available, print error\n else:\n total = \"ERROR\"\n break\n #mark as visited\n v[city.index(route[r])] = 1\n print(total)\nmain()", "def main():\n n = eval(input())\n city = input().split()\n m = eval(input())\n mapp = {}\n for c in city:\n mapp[c] = [0]*n\n while m:\n m -= 1\n road = input().split()\n temp = mapp[road[0]]\n temp[city.index(road[1])] = int(road[-1])\n mapp[road[0]] = temp\n t = eval(input())\n while t:\n t -= 1\n dist = 0\n v = [0]*n #visited\n route = input().split()\n if route[0] == '1':\n if route[-1] in city:\n print(dist)\n else:\n print('ERROR')\n else:\n for r in range(1, int(route[0])+1):\n if (route[r] not in city) or v[city.index(route[r])]:\n dist = 'ERROR'\n break\n elif r>1:\n if mapp[route[r-1]][city.index(route[r])]:\n dist += mapp[route[r-1]][city.index(route[r])]\n else:\n dist = 'ERROR'\n break\n v[city.index(route[r])] = 1\n print(dist)\nmain() ", "def main():\n n = eval(input())\n city = input().split()\n m = eval(input())\n mapp = {}\n for c in city:\n mapp[c] = [0]*n\n while m:\n m-=1\n road = input().split()\n temp = mapp[road[0]]\n temp[city.index(road[1])] = int(road[-1])\n mapp[road[0]] = temp\n t=eval(input())\n while t:\n t-=1\n dist = 0\n v = [0]*n #visited\n route = input().split()\n if route[0] == '1':\n if route[-1] in city:\n print(dist)\n else:\n print('ERROR')\n else:\n for r in range(1,int(route[0])+1):\n if (route[r] not in city) or v[city.index(route[r])]:\n dist = 'ERROR'\n break\n elif r>1:\n if mapp[route[r-1]][city.index(route[r])]:\n dist+= mapp[route[r-1]][city.index(route[r])]\n else:\n dist = 'ERROR'\n break\n v[city.index(route[r])] = 1\n print(dist)\nmain()"] | {"inputs": [["5", "Donetsk Kiev New-York Miami Hollywood", "9", "Donetsk Kiev 560", "Kiev New-York 7507", "New-York Miami 1764", "Miami Hollywood 28", "Hollywood Miami 30", "Miami New-York 1764", "Kiev Donetsk 550", "Hollywood New-York 1736", "New-York Hollywood 1738", "13", "5 Donetsk Kiev New-York Miami Hollywood", "5 Hollywood Miami New-York Kiev Donetsk", "3 Donetsk Kiev Donetsk", "2 Kyiv New-York", "3 New-York Hollywood Miami", "2 New-York Miami", "3 Hollywood New-York Miami", "4 Donetsk Kiev Miami Hollywood", "2 Donetsk Hollywood", "1 Donetsk", "2 Mumbai Deli", "6 Donetsk Kiev New-York Miami Hollywood New-York", "2 Miami Miami"]], "outputs": [["9859", "ERROR", "ERROR", "ERROR", "1768", "1764", "3500", "ERROR", "ERROR", "0", "ERROR", "ERROR", "ERROR"]]} | INTERVIEW | PYTHON3 | CODECHEF | 6,106 | |
2d0fac041858814f3d5f5debe10b29b7 | UNKNOWN | Given a number $n$, give the last digit of sum of all the prime numbers from 1 to $n$ inclusive.
-----Input:-----
- First line contains number of testcase $t$.
- Each testcase contains of a single line of input, number $n$.
-----Output:-----
Last digit of sum of every prime number till n.
-----Constraints-----
- $1 \leq T \leq 10$
- $2 \leq N \leq 10^6$
-----Sample Input:-----
1
10
-----Sample Output:-----
7 | ["# cook your dish here\nimport math\nN = 10**6\nsum_arr = [0] * (N + 1) \ndef lprime():\n arr = [0] * (N + 1) \n arr[0] = 1\n arr[1] = 1\n for i in range(2, math.ceil(math.sqrt(N) + 1)): \n if arr[i] == 0: \n for j in range(i * i, N + 1, i): \n arr[j] = 1\n \n curr_prime_sum = 0\n\n for i in range(1, N + 1): \n if arr[i] == 0: \n curr_prime_sum += i \n sum_arr[i] = curr_prime_sum \n \nn=int(input())\nlprime()\nfor _ in range(n):\n x=int(input())\n print(sum_arr[x]%10)", "# cook your dish here\n# https://www.codechef.com/CSEP2020/problems/IRVS\nfor _ in range(int(input())):\n n = int(input())\n prime = [True for __ in range(n+1)]\n prime[:2] = [False, False]\n total = 0\n for i in range(2, n+1):\n if prime[i] is True:\n temp = i*2\n total += i\n while temp <= n:\n prime[temp] = False\n temp += i\n print(str(total)[-1])\n", "def primalsum(n): \r\n\tprime = [True] * (n + 1);p = 2;sum_ = 0\r\n\twhile(p**2 <= n):\r\n\t\tif(prime[p] == True):\r\n\t\t\ti = p*2\r\n\t\t\twhile(i <= n): prime[i] = False;i += p\r\n\t\tp += 1\r\n\tfor i in range (2,n + 1): \r\n\t\tif(prime[i]): sum_ += i \r\n\treturn sum_\r\nfor _ in range(int(input())):N = int(input());print(str(primalsum(N))[-1]) ", "# cook your dish here\nt=int(input())\nfor i in range(t):\n sum1=0\n n=int(input())\n prime = [True for i in range(n + 1)] \n p = 2\n while (p * p <= n):\n if (prime[p] == True):\n for i in range(p * 2, n + 1, p):\n prime[i] = False\n p += 1\n prime[0]= False\n prime[1]= False\n for p in range(n+1):\n if prime[p]:\n sum1+=p\n print(sum1%10)\n \n \n", "def SieveOfEratosthenes(n): \n\tprime = [True for i in range(n+1)] ; ans = [];p = 2\n\twhile (p * p <= n): \n\t\tif (prime[p] == True): \n\t\t\tfor i in range(p * p, n+1, p):prime[i] = False\n\t\tp += 1\n\tfor p in range(2, n+1): \n\t\tif prime[p]:ans.append(p) \n\treturn ans\np = SieveOfEratosthenes(10**6+10)\nfor _ in range(int(input())):\n\tn = int(input());s = 0\n\tfor i in range(len(p)):\n\t\tif p[i] > n:break\n\t\telse:s += p[i]\n\tprint(s%10)", "# irrelevant sum\ndef SieveOfEratosthenes(n): \n\tprime = [True for i in range(n+1)] ; ans = []\n\tp = 2\n\twhile (p * p <= n): \n\t\tif (prime[p] == True): \n\t\t\tfor i in range(p * p, n+1, p): \n\t\t\t\tprime[i] = False\n\t\tp += 1\n \n # Print all prime numbers \n\tfor p in range(2, n+1): \n\t\tif prime[p]:ans.append(p) \n #print p, \n\treturn ans\np = SieveOfEratosthenes(10**6+10)\nfor _ in range(int(input())):\n\tn = int(input())\n\ts = 0\n\tfor i in range(len(p)):\n\t\tif p[i] > n:\n\t\t\tbreak\n\t\telse:\n\t\t\ts += p[i]\n\tprint(s%10)", "# cook your dish here\ndef sieve(n):\n prime = [True for i in range(n+1)]\n p = 2\n while (p * p <= n):\n if (prime[p] == True):\n for i in range(p * p, n+1, p):\n prime[i] = False\n p += 1\n return prime\nfor u in range(int(input())):\n n=int(input())\n p=sieve(n)\n s=0\n for i in range(2,n+1):\n if(p[i]==True):\n s+=i\n r=str(s)\n print(r[-1])\n", "# cook your dish here\n'''z=int(input())\nfor i in range(z):\n\tn=int(input())\n\tcounta=[]\n\tfor i in range(1,n+1):\n\t\tcount=0\n\t\tfor j in range(1,i+1):\n\t\t\tif i%j==0:\n\t\t\t\tcount+=1\n\t\tif count==2:\n\t\t\tcounta.append(i)\n\tprint(sum(counta)%10)\nimport math\nn=int(input())\nfor i in range(n):\n\tm=int(input())\n\tsumm=0\n\tfor num in range(2,m+1):\n\t \tif all(num%i!=0 for i in range(2,int(math.sqrt(num))+1)):\n\t \t\tsumm+=num\n\tprint(summ%10)\nimport math\n\ndef is_prime(n):\n for i in range(2, int(math.sqrt(n)) + 1):\n if n % i == 0:\n return False\n return True\n\nn=int(input()) \nfor i in range(n):\n\tm=int(input())\n\tsumm=0\n\tfor num in range(2,m+1):\n\t \tif is_prime(num):\n\t \t\tsumm+=num \n\tprint(summ%10)''' \ndef sumOfPrimes(n): \n\n\n prime = [True] * (n + 1) \n\n\n p = 2\n\n while p * p <= n: \n\n \n\n if prime[p] == True: \n\n \n\n i = p * 2\n\n while i <= n: \n\n prime[i] = False\n\n i += p \n\n p += 1 \n\n \n\n\n\n sum = 0\n\n for i in range (2, n + 1): \n\n if(prime[i]): \n\n sum += i \n\n return sum\n\nt=int(input())\nfor i in range(t):\n\tn=int(input())\n\tprint(sumOfPrimes(n)%10)\n", "# cook your dish here\ndef main(): \n \n # Create a boolean array \"prime[0..n]\" and initialize \n # all entries it as true. A value in prime[i] will \n # finally be false if i is Not a prime, else true. \n n=1000000\n prime = [True for i in range(n + 1)] \n p = 2\n while (p * p <= n): \n \n # If prime[p] is not changed, then it is a prime \n if (prime[p] == True): \n \n # Update all multiples of p \n for i in range(p * 2, n + 1, p): \n prime[i] = False\n p += 1\n prime[0]= False\n prime[1]= False\n # Print all prime numbers \n s=[]\n s.append(0)\n for p in range(1,n + 1): \n if prime[p]: \n s.append(s[p-1]+(p))\n else:\n s.append(s[p-1])\n # print(s)\n t=int(input())\n for _ in range(t):\n num=int(input())\n print(s[num]%10)\nmain()", "# cook your dish here\ndef sumOfPrimes(n): \n # list to store prime numbers \n prime = [True] * (n + 1) \n \n # Create a boolean array \"prime[0..n]\" \n # and initialize all entries it as true. \n # A value in prime[i] will finally be \n # false if i is Not a prime, else true. \n \n p = 2\n while p * p <= n: \n # If prime[p] is not changed, then \n # it is a prime \n if prime[p] == True: \n # Update all multiples of p \n i = p * 2\n while i <= n: \n prime[i] = False\n i += p \n p += 1 \n \n # Return sum of primes generated through \n # Sieve. \n sum = 0\n for i in range (2, n + 1): \n if(prime[i]): \n sum += i \n return sum\nfor _ in range(int(input())):\n n=int(input())\n ans=sumOfPrimes(n)%10\n print(ans)", "# cook your dish here\nimport math\nN = 1000003\ndp = [0] * (N + 1)\ndef seive():\n array = [0] * (N + 1)\n array[0] = 1\n array[1] = 1\n for i in range(2, math.ceil(math.sqrt(N) + 1)):\n if array[i] == 0:\n for j in range(i * i, N + 1, i):\n array[j] = 1\n runningPrimeSum = 0\n for i in range(1, N + 1):\n if array[i] == 0:\n runningPrimeSum += i\n dp[i] = runningPrimeSum\nseive()\nt=int(input())\nfor _ in range(t):\n n=int(input())\n print(dp[n]%10)", "def SieveOfEratosthenes(n):\n\tprime = [True for i in range(n+1)] \n\tp = 2\n\twhile(p * p <= n): \n\t\tif (prime[p] == True): \n\t\t\tfor i in range(p * p, n + 1, p): \n\t\t\t\tprime[i] = False\n\t\tp += 1\n\tc = 0\n\tfor p in range(2, n+1): \n\t\tif prime[p]: \n\t\t\tc += p\n\treturn c%10\nfor i in range(int(input())):\n c = SieveOfEratosthenes(int(input())) \n print(c) \n \n\n\n\n", "import math\n\ndef sieve(x):\n l=[0]*x\n h=int(math.sqrt(x))\n for i in range(2,h+1):\n if(l[i-1]==0):\n for j in range(i*i,x+1,i):\n l[j-1]=1\n\n\n l1=[]\n for k in range(2,x+1):\n if l[k-1]==0:\n l1.append(k)\n print(sum(l1)%10)\n\n\ndef __starting_point():\n t=int(input())\n for i in range(t):\n n=int(input())\n sieve(n)\n\n__starting_point()", "# cook your dish here\ndef sumOfPrimes(n): \n prime = [True] * (n + 1) \n p = 2\n while p * p <= n:\n if prime[p] == True: \n i = p * 2\n while i <= n: \n prime[i] = False\n i += p \n p += 1 \n sum = 0\n for i in range (2, n + 1): \n if(prime[i]): \n sum += i \n return sum \nfor _ in range(int(input())): \n n=int(input()) \n c=sumOfPrimes(n) \n print(c%10)", "def prime(n): \n l1 =[True]*(n + 1) \n i=2\n while i*i<=n:\n if l1[i]==True: \n a=i*2\n while a<=n: \n l1[a]=False\n a=a+i \n i=i+1 \n s1=0\n for i in range (2, n + 1): \n if(l1[i]): \n s1=s1+i \n return s1\nfor _ in range(int(input())):\n n=int(input())\n s1=prime(n)\n ##print(s1)\n print(s1%10)\n", "\ndef sumOfPrimes(n): \n\n\tprime = [True] * (n + 1) \n\n\t\n\tp = 2\n\twhile p * p <= n: \n\n\t\tif prime[p] == True: \n\n\t\t\ti = p * 2\n\t\t\twhile i <= n: \n\t\t\t\tprime[i] = False\n\t\t\t\ti += p \n\t\tp += 1\t\n\n\tsum = 0\n\tfor i in range (2, n + 1): \n\t\tif(prime[i]): \n\t\t\tsum += i \n\treturn sum\n\nfor _ in range(int(input())):\n n = int(input())\n zzz = str(sumOfPrimes(n))\n print(zzz[-1])", "def sumofprimes(n):\n prime=[True]*(n+1)\n p=2\n while(p*p<=n):\n if prime[p]==True:\n i=p*2\n while i<=n:\n prime[i]=False\n i+=p\n p+=1\n sum=0\n for i in range(2,n+1):\n if prime[i]:\n sum+=i\n return sum\ndef __starting_point():\n for _ in range(int(input())):\n n=int(input())\n print(sumofprimes(n)%10)\n__starting_point()", "def sumofprimes(n):\n prime=[True]*(n+1)\n p=2\n while(p*p<=n):\n if prime[p]==True:\n i=p*2\n while i<=n:\n prime[i]=False\n i+=p\n p+=1\n sum=0\n for i in range(2,n+1):\n if prime[i]:\n sum+=i\n return sum\ndef __starting_point():\n for _ in range(int(input())):\n n=int(input())\n print(sumofprimes(n)%10)\n__starting_point()", "# cook your dish here\nn=1000001\nsieve=[0]*(n+1)\nsieve[0]=1\nsieve[1]=1\nfor x in range(2,n+1):\n if(sieve[x]):\n continue\n for u in range(2*x,n+1,x):\n sieve[u]=1\nfor i in range(int(input())):\n n=int(input())\n count=0\n sum1=0\n #a1=[]\n for i in range(n+1):\n #if(count==n):\n #break\n if(sieve[i]==0):\n sum1+=i\n #a1.append(i)\n #count+=1\n print(sum1%10) \n #print(a1)\n", "\ndef SieveOfEratosthenes(n): \n \n prime = [True for i in range(n+1)] \n \n p = 2\n while(p * p <= n): \n \n if (prime[p] == True): \n \n for i in range(p * p, n + 1, p): \n prime[i] = False\n p += 1\n sum = 0\n \n for p in range(2, n+1): \n if prime[p]: \n sum += p\n return sum \n \n\n\n\nx = int(input())\nfor i in range(0,x):\n uptil = int(input())\n sum = SieveOfEratosthenes(uptil)\n print(sum%10)\n", "\n\n# Python program to find sum of primes\n# in range from 1 to n.\n#code on gfg\n# Returns sum of primes in range from\n# 1 to n\n\ndef sumOfPrimes(n):\n # list to store prime numbers\n prime = [True] * (n + 1)\n\n # Create a boolean array \"prime[0..n]\"\n # and initialize all entries it as true.\n # A value in prime[i] will finally be\n # false if i is Not a prime, else true.\n\n p = 2\n while p * p <= n:\n # If prime[p] is not changed, then\n # it is a prime\n if prime[p] == True:\n # Update all multiples of p\n i = p * 2\n while i <= n:\n prime[i] = False\n i += p\n p += 1\n\n # Return sum of primes generated through\n # Sieve.\n sum = 0\n for i in range(2, n + 1):\n if (prime[i]):\n sum += i\n return sum\n\n\n# Driver code\nfor _ in range(int(input())):\n n=int(input())\n ans=sumOfPrimes(n)\n ans=str(ans)\n print(ans[-1])\n\n", "try:\n def findprimes(n,l):\n prime=[True for i in range(n+1)]\n p=2\n while p*p<=n:\n if prime[p]==True:\n for i in range(p*p,n+1,p):\n prime[i]=False\n p+=1\n for i in range(2,n+1):\n if prime[i]==True:\n l.append(i)\n return l\n for _ in range(int(input())):\n n=int(input())\n l=[]\n findprimes(n,l)\n s=sum(l)\n print(s%10)\nexcept:\n pass", "for t in range(int(input())):\n n = int(input())\n A = [True for i in range(n+1)]\n A[0],A[1] = False,False\n i = 2\n while i**2 <= n:\n if A[i] == True:\n for j in range(i**2,n+1,i):\n A[j] = False\n i += 1\n sum = 0\n for i in range(2,n+1):\n if A[i] == True:\n sum += i\n if sum >= 10:\n sum %= 10\n print(sum)", "for t in range(int(input())):\n n = int(input())\n A = [True for i in range(n+1)]\n A[0],A[1] = False,False\n i = 2\n while i**2 <= n:\n if A[i] == True:\n for j in range(i**2,n+1,i):\n A[j] = False\n i += 1\n sum = 0\n for i in range(2,n+1):\n if A[i] == True:\n sum += i\n print(sum%10)"] | {"inputs": [["1", "10"]], "outputs": [["7"]]} | INTERVIEW | PYTHON3 | CODECHEF | 13,246 | |
f31b8180819c85caa6fe6dc72782608f | UNKNOWN | People in Karunanagar are infected with Coronavirus. To understand the spread of disease and help contain it as early as possible, Chef wants to analyze the situation in the town. Therefore, he does the following:
- Chef represents the population of Karunanagar as a binary string of length $N$ standing in a line numbered from $1$ to $N$ from left to right, where an infected person is represented as $1$ and an uninfected person as $0$.
- Every day, an infected person in this binary string can infect an adjacent (the immediate left and right) uninfected person.
- Therefore, if before Day 1, the population is $00100$, then at the end of Day 1, it becomes $01110$ and at the end of Day 2, it becomes $11111$.
But people of Karunanagar are smart and they know that if they 'socially isolate' themselves as early as possible, they reduce the chances of the virus spreading. Therefore on $i$-th day, person numbered $P_i$ isolates himself from person numbered $P_i - 1$, thus cannot affect each other. This continues in the town for $D$ days.
Given the population binary string before Day 1, Chef wants to calculate the total number of infected people in Karunanagar at the end of the day $D$. Since Chef has gone to wash his hands now, can you help do the calculation for him?
-----Input:-----
- First line will contain $T$, number of testcases. Then the test cases follow.
- The first line of each test case contains a single integer $N$ denoting the length of the binary string.
- The next line contains a binary string of length $N$ denoting the population before the first day, with $1$ for an infected person and $0$ for uninfected.
- The next line contains a single integer $D$ - the number of days people isolate themselves.
- The next line contains $P$ - a list of $D$ distinct space-separated integers where each $P_{i}$ denotes that at the start of $i^{th}$ day, person $P_{i}$ isolated him/herself from the person numbered $P_i-1$.
-----Output:-----
For each test case, print a single integer denoting the total number of people who are infected after the end of $D^{th}$ day.
-----Constraints-----
- $1 \leq T \leq 200$
- $2 \leq N \leq 10^{4}$
- $1 \leq D < N$
- $2 \leq P_{i} \leq N$ for $1 \le i \le D$
-----Subtasks-----
Subtask #1(30 points): $1 \leq T \leq 100$, $2 \leq N \leq 2000$
Subtask #2(70 points): Original Constraints
-----Sample Input:-----
2
9
000010000
3
2 5 8
5
00001
1
5
-----Sample Output:-----
6
1
-----EXPLANATION:-----
For the purpose of this explanation, a social distance can be denoted with a '$|$'.
For the first testcase:
-
Before Day $1$, the population is: $0|00010000$
-
Before Day $2$, the population is: $0|001|11000$
-
Before Day $3$, the population is: $0|011|111|00$
-
Therefore, after Day $3$, the population will be: $0|111|111|00$
So, there are $6$ infected persons.
For the second testcase:
Before Day $1$, the population is: $0000|1$
Therefore, there is one infected person. | ["# cook your dish here\nT = int(input())\n\nfor i in range(T):\n N,data,D,People = int(input()),list(map(int,list(input()))),int(input()),list(map(int,input().split()))\n \n data.insert(0,\"|\"),data.append(\"|\")\n infected = []\n for i in range(1,N+1):\n if(data[i]==1):\n infected.append(i)\n \n i = 0\n while(i<D):\n boundary = People[i] + i\n data.insert(boundary,\"|\")\n times = len(infected)\n for p in range(times):\n index = infected[p]\n if(index>=boundary):\n index+=1\n infected[p]+=1\n if(data[index]==1):\n if(data[index+1]==0):\n data[index+1] = 1\n infected.append(index+1)\n if(data[index-1]==0):\n data[index-1] = 1\n infected.append(index-1)\n else:\n infected.remove(index)\n times-=1\n i+=1\n infected.sort()\n \n print(data.count(1))", "try:\r\n for _ in range(int(input())):\r\n n=int(input())\r\n st=list(input())\r\n d=int(input())\r\n p=list(map(int,input().split()))\r\n\r\n# a=[]\r\n# a.append(st)\r\n s11=[]\r\n for i in range(n):\r\n if(st[i]==\"1\"):\r\n s11.append(i)\r\n# print(s11)\r\n for i in range(d):\r\n# print(s11,\"fi\")\r\n st.insert(p[i]-1+i,\"|\")\r\n for j in range(len(s11)):\r\n if(s11[j]>=p[i]-1+i):\r\n s11[j]+=1\r\n# print(s11,\"mi\")\r\n for j in range(len(s11)):\r\n if(s11[j]==0):\r\n if(st[1]==\"0\"):\r\n st[1]=\"1\"\r\n s11.append(1)\r\n elif(s11[j]==len(st)-1):\r\n if(st[-2]==\"0\"):\r\n st[-2]=\"1\"\r\n s11.append(len(st)-2)\r\n else:\r\n if(st[s11[j]-1]==\"0\"):\r\n st[s11[j]-1]=\"1\"\r\n s11.append(s11[j]-1)\r\n if(st[s11[j]+1]==\"0\"):\r\n st[s11[j]+1]=\"1\"\r\n s11.append(s11[j]+1)\r\n \r\n \r\n\r\n print(len(set(s11)))\r\n \r\n \r\n \r\n \r\nexcept:\r\n pass", "# cook your dish here\ntry:\n for _ in range(int(input())):\n n=int(input())\n st=list(input())\n d=int(input())\n p=list(map(int,input().split()))\n\n# a=[]\n# a.append(st)\n s11=[]\n for i in range(n):\n if(st[i]==\"1\"):\n s11.append(i)\n# print(s11)\n for i in range(d):\n# print(s11,\"fi\")\n st.insert(p[i]-1+i,\"|\")\n for j in range(len(s11)):\n if(s11[j]>=p[i]-1+i):\n s11[j]+=1\n# print(s11,\"mi\")\n for j in range(len(s11)):\n if(s11[j]==0):\n if(st[1]==\"0\"):\n st[1]=\"1\"\n s11.append(1)\n elif(s11[j]==len(st)-1):\n if(st[-2]==\"0\"):\n st[-2]=\"1\"\n s11.append(len(st)-2)\n else:\n if(st[s11[j]-1]==\"0\"):\n st[s11[j]-1]=\"1\"\n s11.append(s11[j]-1)\n if(st[s11[j]+1]==\"0\"):\n st[s11[j]+1]=\"1\"\n s11.append(s11[j]+1)\n \n \n\n print(len(set(s11)))\n \n \n \n \nexcept:\n pass", "# cook your dish here\ntry:\n for _ in range(int(input())):\n n=int(input())\n st=list(input())\n d=int(input())\n p=list(map(int,input().split()))\n\n# a=[]\n# a.append(st)\n s11=[]\n for i in range(n):\n if(st[i]==\"1\"):\n s11.append(i)\n# print(s11)\n for i in range(d):\n# print(s11,\"fi\")\n st.insert(p[i]-1+i,\"|\")\n for j in range(len(s11)):\n if(s11[j]>=p[i]-1+i):\n s11[j]+=1\n# print(s11,\"mi\")\n for j in range(len(s11)):\n if(s11[j]==0):\n if(st[1]==\"0\"):\n st[1]=\"1\"\n s11.append(1)\n elif(s11[j]==len(st)-1):\n if(st[-2]==\"0\"):\n st[-2]=\"1\"\n s11.append(len(st)-2)\n else:\n if(st[s11[j]-1]==\"0\"):\n st[s11[j]-1]=\"1\"\n s11.append(s11[j]-1)\n if(st[s11[j]+1]==\"0\"):\n st[s11[j]+1]=\"1\"\n s11.append(s11[j]+1)\n \n \n\n print(len(set(s11)))\n \n \n \n \nexcept:\n pass", "t=int(input())\r\nfor i in range(t):\r\n n=int(input())\r\n s=list(input())\r\n d=int(input())\r\n p=list(map(int,input().split()))\r\n if s.count('1')==0:\r\n print(0)\r\n continue\r\n c=0\r\n e=0\r\n flag=0\r\n f=0\r\n g=0\r\n for j in range(d):\r\n if s[p[j]-1]=='0':\r\n s[p[j]-1]='3'\r\n elif s[p[j]-1]=='1':\r\n s[p[j]-1]='2'\r\n s1=s[:]\r\n #print(s)\r\n #q1=''.join(s).lstrip('0')\r\n q=s[f:g+1]\r\n #q=q1.rstrip('0')\r\n if len(q)-(c+e)==0 and q[0]=='2' and k==g+1:\r\n if c+e==0:\r\n c=len(q)\r\n break\r\n c=0\r\n e=0\r\n for k in range(n):\r\n if s[k]=='1':\r\n if flag==0:\r\n flag=1\r\n f=k\r\n g=k\r\n c+=1\r\n if k==0:\r\n if s[1]=='0':\r\n s1[1]='1'\r\n c+=1\r\n elif k==n-1:\r\n if s[k-1]=='0':\r\n s1[k-1]='1'\r\n c+=1\r\n elif s[k-1]=='3':\r\n s1[k-1]='2'\r\n e+=1\r\n else:\r\n if s[k+1]=='0':\r\n s1[k+1]='1'\r\n c+=1\r\n if s[k-1]=='0':\r\n s1[k-1]='1'\r\n c+=1\r\n elif s[k-1]=='3':\r\n s1[k-1]='2'\r\n e+=1\r\n elif s[k]=='2':\r\n if flag==0:\r\n flag=1\r\n f=k\r\n g=k\r\n e+=1\r\n if k!=n-1:\r\n if s[k+1]=='0':\r\n s1[k+1]='1'\r\n c+=1\r\n \r\n s=s1[:]\r\n #print(s)\r\n #print(c,e)\r\n print(c+e)\r\n \r\n \r\n", "try:\n for i in range(int(input())):\n n=int(input())\n s=input()\n l=list(map(int, s))\n d=int(input())\n p=list(map(int, input().split()))\n for j in range(d):\n l.insert(p[j]-1+l.count('|'),'|')\n a=0\n n=len(l)\n while a<n:\n if l[a]==1:\n if a>0:\n if l[a-1]==0:\n l[a-1]=1\n if a<n-1:\n if l[a+1]==0:\n l[a+1]=1\n a+=1\n a+=1\n print(l.count(1))\nexcept:\n pass\n", "try:\r\n for _ in range(int(input())):\r\n n=int(input())\r\n st=list(input())\r\n d=int(input())\r\n p=list(map(int,input().split()))\r\n\r\n# a=[]\r\n# a.append(st)\r\n s11=[]\r\n for i in range(n):\r\n if(st[i]==\"1\"):\r\n s11.append(i)\r\n# print(s11)\r\n for i in range(d):\r\n# print(s11,\"fi\")\r\n st.insert(p[i]-1+i,\"|\")\r\n for j in range(len(s11)):\r\n if(s11[j]>=p[i]-1+i):\r\n s11[j]+=1\r\n# print(s11,\"mi\")\r\n for j in range(len(s11)):\r\n if(s11[j]==0):\r\n if(st[1]==\"0\"):\r\n st[1]=\"1\"\r\n s11.append(1)\r\n elif(s11[j]==len(st)-1):\r\n if(st[-2]==\"0\"):\r\n st[-2]=\"1\"\r\n s11.append(len(st)-2)\r\n else:\r\n if(st[s11[j]-1]==\"0\"):\r\n st[s11[j]-1]=\"1\"\r\n s11.append(s11[j]-1)\r\n if(st[s11[j]+1]==\"0\"):\r\n st[s11[j]+1]=\"1\"\r\n s11.append(s11[j]+1)\r\n \r\n \r\n\r\n print(len(set(s11)))\r\n \r\n \r\n \r\n \r\nexcept:\r\n pass", "# cook your dish here\nsam = int(input())\n\nfor i in range(sam):\n csk,mi,dam,man = int(input()),list(map(int,list(input()))),int(input()),list(map(int,input().split()))\n \n mi.insert(0,\"|\"),mi.append(\"|\")\n pj = []\n for i in range(1,csk+1):\n if(mi[i]==1):\n pj.append(i)\n \n i = 0\n while(i<dam):\n boundary = man[i] + i\n mi.insert(boundary,\"|\")\n times = len(pj)\n for p in range(times):\n index = pj[p]\n if(index>=boundary):\n index+=1\n pj[p]+=1\n if(mi[index]==1):\n if(mi[index+1]==0):\n mi[index+1] = 1\n pj.append(index+1)\n if(mi[index-1]==0):\n mi[index-1] = 1\n pj.append(index-1)\n else:\n pj.remove(index)\n times=times-1\n i=i+1\n pj.sort()\n \n print(mi.count(1))\n", "# cook your dish here\nT = int(input())\n\nfor _ in range(T):\n\n N = int(input())\n s = list(input())\n n = int(input())\n days = list(map(int,input().split()))\n total_infected = sum(1 for x in s if x == '1')\n\n\n def seperate(s,d):\n s.insert(d-1,'#')\n return s\n\n def infect(s,k,total_infected):\n\n if s[0] == '1' and s[1] == '0':\n s[1] = '1'\n total_infected += 1\n\n i = 1 \n while i < (N+k):\n if s[i] == '1':\n if s[i-1] == '0':\n s[i-1] = '1'\n total_infected += 1\n if s[i+1] == '0':\n s[i+1] = '1'\n total_infected += 1\n i += 1\n i += 1\n\n return (s, total_infected)\n \n for i in range(n):\n s = seperate(s,i+days[i])\n s,total_infected = infect(s,i,total_infected)\n \n print(total_infected)\n", "# cook your dish here\nT = int(input())\n\nfor _ in range(T):\n\n N = int(input())\n s = list(input())\n n = int(input())\n days = list(map(int,input().split()))\n total_infected = sum(1 for x in s if x == '1')\n\n\n def seperate(s,d):\n s.insert(d-1,'#')\n return s\n\n def infect(s,k,total_infected):\n index_list = set()\n\n if s[0] == '1' and s[1] == '0':\n s[1] = '1'\n total_infected += 1\n \n for i in range(1,(N+k)):\n present = s[i]\n prev = s[i-1]\n next = s[i+1]\n\n if present == '1':\n if prev == '0':\n index_list.add(i-1)\n if next == '0':\n index_list.add(i+1)\n \n for i in index_list:\n s[i] = '1'\n total_infected += 1\n return (s, total_infected)\n \n for i in range(n):\n s = seperate(s,i+days[i])\n s,total_infected = infect(s,i,total_infected)\n \n print(total_infected)", "try:\r\n for _ in range(int(input())):\r\n n=int(input())\r\n st=list(input())\r\n d=int(input())\r\n p=list(map(int,input().split()))\r\n\r\n# a=[]\r\n# a.append(st)\r\n s11=[]\r\n for i in range(n):\r\n if(st[i]==\"1\"):\r\n s11.append(i)\r\n# print(s11)\r\n for i in range(d):\r\n# print(s11,\"fi\")\r\n st.insert(p[i]-1+i,\"|\")\r\n for j in range(len(s11)):\r\n if(s11[j]>=p[i]-1+i):\r\n s11[j]+=1\r\n# print(s11,\"mi\")\r\n for j in range(len(s11)):\r\n if(s11[j]==0):\r\n if(st[1]==\"0\"):\r\n st[1]=\"1\"\r\n s11.append(1)\r\n elif(s11[j]==len(st)-1):\r\n if(st[-2]==\"0\"):\r\n st[-2]=\"1\"\r\n s11.append(len(st)-2)\r\n else:\r\n if(st[s11[j]-1]==\"0\"):\r\n st[s11[j]-1]=\"1\"\r\n s11.append(s11[j]-1)\r\n if(st[s11[j]+1]==\"0\"):\r\n st[s11[j]+1]=\"1\"\r\n s11.append(s11[j]+1)\r\n \r\n \r\n\r\n print(len(set(s11)))\r\n \r\n \r\n \r\n \r\nexcept:\r\n pass", "# cook your dish here\nT = int(input())\n\nfor _ in range(T):\n\n N = int(input())\n s = list(input())\n n = int(input())\n days = list(map(int,input().split()))\n total_infected = sum(1 for x in s if x == '1')\n\n\n def seperate(s,d):\n s.insert(d-1,'#')\n return s\n\n def infect(s,k,total_infected):\n index_list = set()\n\n if s[0] == '1' and s[1] == '0':\n s[1] = '1'\n total_infected += 1\n if s[-1] == '1' and s[-2] == '0':\n s[-2] = '1'\n total_infected += 1\n \n for i in range(1,(N+k)):\n present = s[i]\n prev = s[i-1]\n next = s[i+1]\n\n if present == '1':\n if prev == '0':\n index_list.add(i-1)\n if next == '0':\n index_list.add(i+1)\n \n for i in index_list:\n s[i] = '1'\n total_infected += 1\n return (s, total_infected)\n \n for i in range(n):\n s = seperate(s,i+days[i])\n s,total_infected = infect(s,i,total_infected)\n \n print(total_infected)", "# cook your dish here\n\ndef spread(arr):\n for i in range(len(arr)):\n a=list()\n for j in range(len(arr[i])):\n if arr[i][j][0]==1:\n a.append(j)\n for j in range(len(a)):\n if j==0 and a[j]==0 and len(arr[i])>1:\n arr[i][1][0]=1 \n elif j==len(a)-1 and a[j]==len(arr[i])-1 and len(arr[i])>1:\n arr[i][a[j]-1][0]=1 \n elif a[j]!=0 and a[j]!=len(arr[i])-1:\n arr[i][a[j]-1][0]=arr[i][a[j]+1][0]=1\n\nt=int(input())\nfor z in range(t):\n n=int(input())\n inp=input()\n a=[0]*n\n for i in range(n):\n a[i]=[0]*2\n a[i][0]=int(inp[i])\n a[i][1]=i\n d=int(input())\n arr=[a]\n fr=input().split()\n for i in range(d):\n fr[i]=int(fr[i])\n fr[i]-=1\n for j in range(len(arr)):\n if arr[j][len(arr[j])-1][1]>=fr[i]:\n start=j \n break\n l=list()\n j=0\n while fr[i]>arr[start][j][1]:\n l.append(arr[start][j])\n j+=1\n arr.insert(start,l)\n for j in range(len(l)):\n arr[start+1].remove(l[j])\n spread(arr)\n count=0\n for i in range(len(arr)):\n for j in range(len(arr[i])):\n if arr[i][j][0]==1:\n count+=1\n print(count)\n", "# cook your dish here\nT = int(input())\n\nfor _ in range(T):\n\n _dummy = int(input())\n s = list(input())\n n = int(input())\n days = list(map(int,input().split()))\n\n\n def seperate(s,d):\n s.insert(d-1,'#')\n return s\n\n def infect(s):\n index_list = set()\n\n if s[0] == '1' and s[1] == '0':\n s[1] = '1'\n if s[-1] == '1' and s[-2] == '0':\n s[-2] = '1'\n \n for i in range(1,len(s)-1):\n present = s[i]\n prev = s[i-1]\n next = s[i+1]\n\n if present == '1':\n if prev == '0':\n index_list.add(i-1)\n if next == '0':\n index_list.add(i+1)\n \n for i in index_list:\n s[i] = '1'\n return s\n \n for i in range(n):\n s = seperate(s,i+days[i])\n s = infect(s)\n total_infected = sum(1 for x in s if x == '1')\n print(total_infected)", "# cook your dish here\nT = int(input())\n\nfor _ in range(T):\n\n _dummy = int(input())\n s = list(input())\n n = int(input())\n days = list(map(int,input().split()))\n\n\n def seperate(s,d):\n s.insert(d-1,'#')\n return s\n\n def infect(s):\n index_list = set()\n\n if s[0] == '1' and s[1] != '#':\n s[1] = '1'\n if s[-1] == '1' and s[-2] != '#':\n s[-2] = '1'\n \n for i in range(1,len(s)-1):\n present = s[i]\n prev = s[i-1]\n next = s[i+1]\n\n if present == '1':\n if prev != '#':\n index_list.add(i-1)\n if next != '#':\n index_list.add(i+1)\n \n for i in index_list:\n s[i] = '1'\n return s\n \n for i in range(n):\n s = seperate(s,i+days[i])\n s = infect(s)\n total_infected = sum(1 for x in s if x == '1')\n print(total_infected)", "T = int(input())\n\nfor i in range(T):\n N,data,D,People = int(input()),list(map(int,list(input()))),int(input()),list(map(int,input().split()))\n \n data.insert(0,\"|\"),data.append(\"|\")\n infected = []\n for i in range(1,N+1):\n if(data[i]==1):\n infected.append(i)\n \n i = 0\n while(i<D):\n boundary = People[i] + i\n data.insert(boundary,\"|\")\n times = len(infected)\n for p in range(times):\n index = infected[p]\n if(index>=boundary):\n index+=1\n infected[p]+=1\n if(data[index]==1):\n if(data[index+1]==0):\n data[index+1] = 1\n infected.append(index+1)\n if(data[index-1]==0):\n data[index-1] = 1\n infected.append(index-1)\n else:\n infected.remove(index)\n times-=1\n i+=1\n infected.sort()\n \n print(data.count(1))", "# cook your dish here\nfor _ in range(int(input())):\n n=int(input())\n l=[int(x) for x in input()]\n d=int(input())\n p=list(map(int,input().split()))\n narr=[l[0:(p[0]-1)],l[p[0]-1:]]\n for i in range(1,d+1):\n for j in narr:\n t=0\n while(t<len(j)):\n if(j[t]==1):\n inner=0\n if(t==0 and len(j)>1):\n if(j[t+1]==1):\n inner=1\n j[t+1]=1\n elif(t==(len(j)-1)):\n j[t-1]=1\n else:\n if(j[t+1]==1):\n inner=1\n j[t+1]=1\n j[t-1]=1\n if((t+1)<len(j) and inner==0):\n t=t+1\n t=t+1\n if(i==d):\n break\n now=p[i]\n no=0\n tnarr=[]\n flag=0\n for j in narr:\n no+=len(j)\n if(no>=now and flag==0):\n ind=no-len(j)\n ind=now-ind\n flag=1\n tnarr.append(j[0:(ind-1)])\n tnarr.append(j[(ind-1):])\n else:\n tnarr.append(j)\n narr=tnarr\n ctr=0\n for i in narr:\n for j in i:\n if(j==1):\n ctr+=1\n print(ctr)", "t = int(input())\r\n\r\nfor _ in range(t):\r\n n = int(input())\r\n ppl = list(input())\r\n d = int(input())\r\n toiso = list(map(int, input().split()))\r\n \r\n iso = []\r\n iso.append(toiso[0])\r\n l = []\r\n r = []\r\n c = 0\r\n tl = []\r\n tr = []\r\n\r\n for i in range(n):\r\n if (ppl[i]=='1'):\r\n l.append(i)\r\n r.append(i)\r\n c+=1\r\n \r\n for i in range(d):\r\n ll = len(l)\r\n for j in range(ll):\r\n if ((l[j]-1)>=0):\r\n if ((ppl[l[j]-1]=='0') and ((l[j]+1) not in iso)):\r\n ppl[l[j]-1]='1'\r\n l.append(l[j]-1)\r\n c+=1\r\n l = l[ll:]\r\n # print(\"l\", l)\r\n\r\n rr = len(r)\r\n for j in range(rr):\r\n if ((r[j]+1)<n):\r\n if ((ppl[r[j]+1]=='0') and ((r[j]+2) not in iso)):\r\n ppl[r[j]+1]='1'\r\n r.append(r[j]+1)\r\n c+=1\r\n r = r[rr:]\r\n # print(\"r\", r)\r\n \r\n if (i!=(d-1)):\r\n iso.append(toiso[i+1])\r\n \r\n print(c)", "for _ in range(int(input())):\n \n n=int(input())\n \n string=list(map(int,input()))\n \n ds=int(input())\n \n days=list(map(int,input().split()))\n \n for d in days:\n \n index=0\n \n itr=0\n \n while(itr<d):\n if(string[itr]=='|'):\n index+=1\n index+=1\n itr+=1\n \n string.insert(index-1,'|')\n \n flag=0\n \n if(string[0]==1 and string[1]==0):\n string[1]=1\n flag=1\n \n for i in range(1,len(string)-1):\n \n if(flag==1):\n flag=0\n continue\n \n if(string[i]==1):\n \n if(string[i-1]==0):\n string[i-1]=1\n if(string[i+1]==0):\n string[i+1]=1\n flag=1\n \n if(string[len(string)-1]==1 and string[len(string)-2]==0):\n string[len(string)-2]=1\n \n #print(string)\n \n print(string.count(1))", "from collections import deque\r\nfor _ in range(int(input())):\r\n n=int(input())\r\n s=list(input())\r\n dist=[float('inf') for i in range(n)]\r\n adj=[[] for i in range(n)]\r\n q=deque()\r\n vis=[False]*n\r\n for i in range(n):\r\n if i!=0:\r\n adj[i].append(i-1)\r\n if i!=n-1:\r\n adj[i].append(i+1)\r\n if s[i]==\"1\":\r\n dist[i]=0\r\n q.append(i)\r\n # vis[i]=True\r\n d=int(input())\r\n p=[int(o) for o in input().split()]\r\n while q:\r\n s=q.popleft()\r\n vis[s]=True\r\n if dist[s]<d:\r\n kk=p[dist[s]]\r\n if kk-2 in adj[kk-1]:\r\n adj[kk-1].remove(kk-2)\r\n if kk-2 >0:\r\n if kk-1 in adj[kk-2]:\r\n adj[kk-2].remove(kk-1)\r\n for i in adj[s]:\r\n if not vis[i]:\r\n q.append(i)\r\n dist[i]=min(dist[s]+1,dist[i])\r\n ans=0\r\n for i in dist:\r\n if i<=d:\r\n ans+=1\r\n print(ans)\r\n\r\n\r\n\r\n \r\n\r\n", "from collections import deque\r\nfor _ in range(int(input())):\r\n n=int(input())\r\n s=list(input())\r\n dist=[float('inf') for i in range(n)]\r\n adj=[[] for i in range(n)]\r\n q=deque()\r\n vis=[False]*n\r\n for i in range(n):\r\n if i!=0:\r\n adj[i].append(i-1)\r\n if i!=n-1:\r\n adj[i].append(i+1)\r\n if s[i]==\"1\":\r\n dist[i]=0\r\n q.append(i)\r\n vis[i]=True\r\n d=int(input())\r\n p=[int(o) for o in input().split()]\r\n while q:\r\n s=q.popleft()\r\n if dist[s]<d:\r\n kk=p[dist[s]]\r\n if kk-2 in adj[kk-1]:\r\n adj[kk-1].remove(kk-2)\r\n if kk-2 >0:\r\n if kk-1 in adj[kk-2]:\r\n adj[kk-2].remove(kk-1)\r\n for i in adj[s]:\r\n if not vis[i]:\r\n q.append(i)\r\n vis[i]=True\r\n dist[i]=dist[s]+1\r\n \r\n\r\n # print(dist)\r\n ans=0\r\n for i in dist:\r\n if i<=d:\r\n ans+=1\r\n print(ans)\r\n\r\n\r\n\r\n \r\n\r\n", "t = int(input())\r\nfor _ in range(t):\r\n n = int(input())\r\n l = list(input())\r\n d = int(input())\r\n wall = list(map(str, input().split()))\r\n lst = l.copy()\r\n # 3 == 0 & 2 == 1\r\n god = []\r\n for i in range(n):\r\n if(l[i]=='1' or l[i] == '2'):\r\n god.append(i)\r\n \r\n \r\n for i in range(d):\r\n \r\n if(l[int(wall[i]) - 2] =='0'):\r\n l[int(wall[i]) - 2] = '3'\r\n else:\r\n l[int(wall[i]) - 2] = '2'\r\n lst = l.copy() \r\n # print(l)\r\n god = list(set(god))\r\n bap = god.copy()\r\n god = []\r\n # print(\"bap\", bap)\r\n for j in bap:\r\n if(j==0 or j==n-1):\r\n continue\r\n # print(j, end = \" \")\r\n if(lst[j]=='1'):\r\n if(l[j-1] == '0'):\r\n l[j-1] = '1'\r\n god.append(j-1)\r\n if(l[j+1] == \"0\"):\r\n l[j+1] = '1'\r\n god.append(j+1)\r\n if(l[j+1] == \"3\"):\r\n l[j+1] = '2'\r\n god.append(j+1)\r\n elif(lst[j]=='2'):\r\n if(l[j-1] == '0'):\r\n god.append(j-1)\r\n l[j-1] = '1'\r\n # print(\"in loop\", l) \r\n if(lst[0]=='1'):\r\n if(l[1]=='0'):\r\n l[1] = '1'\r\n god.append(1)\r\n elif(l[1]=='3'):\r\n l[1] = '2'\r\n if(lst[n-1]=='1'):\r\n if(l[n-2]=='0'):\r\n l[n-2] = '1'\r\n god.append(n-2)\r\n # print(\"god\", god)\r\n # print(\"check 0 and n-1\", l) \r\n # print(l) \r\n print(l.count('1') + l.count('2')) \r\n \r\n \r\n", "t = int(input())\r\nfor _ in range(t):\r\n n = int(input())\r\n l = list(input())\r\n d = int(input())\r\n wall = list(map(str, input().split()))\r\n lst = l.copy()\r\n # 3 == 0 & 2 == 1\r\n god = []\r\n for i in range(n):\r\n if(l[i]=='1' or l[i] == '2'):\r\n god.append(i)\r\n \r\n \r\n for i in range(d):\r\n \r\n if(l[int(wall[i]) - 2] =='0'):\r\n l[int(wall[i]) - 2] = '3'\r\n else:\r\n l[int(wall[i]) - 2] = '2'\r\n lst = l.copy() \r\n # print(l)\r\n god = list(set(god))\r\n bap = god.copy()\r\n god = []\r\n # print(\"bap\", bap)\r\n for j in bap:\r\n if(j==0 or j==n-1):\r\n continue\r\n # print(j, end = \" \")\r\n if(lst[j]=='1'):\r\n if(l[j-1] == '0'):\r\n l[j-1] = '1'\r\n god.append(j-1)\r\n if(l[j+1] == \"0\"):\r\n l[j+1] = '1'\r\n god.append(j+1)\r\n if(l[j+1] == \"3\"):\r\n l[j+1] = '2'\r\n god.append(j+1)\r\n elif(lst[j]=='2'):\r\n if(l[j-1] == '0'):\r\n god.append(j-1)\r\n l[j-1] = '1'\r\n # print(\"in loop\", l) \r\n if(lst[0]=='1'):\r\n if(l[1]=='0'):\r\n l[1] = '1'\r\n god.append(1)\r\n elif(l[1]=='3'):\r\n l[1] = '2'\r\n if(lst[n-1]=='1'):\r\n if(l[n-2]=='0'):\r\n l[n-2] = '1'\r\n god.append(n-2)\r\n # print(\"god\", god)\r\n # print(\"check 0 and n-1\", l) \r\n # print(l) \r\n print(l.count('1') + l.count('2')) \r\n \r\n \r\n", "t = int(input())\r\nfor _ in range(t):\r\n n = int(input())\r\n l = list(input())\r\n d = int(input())\r\n wall = list(map(str, input().split()))\r\n lst = l.copy()\r\n # 3 == 0 & 2 == 1\r\n god = []\r\n for i in range(n):\r\n if(l[i]=='1' or l[i] == '2'):\r\n god.append(i)\r\n \r\n \r\n for i in range(d):\r\n \r\n if(l[int(wall[i]) - 2] =='0'):\r\n l[int(wall[i]) - 2] = '3'\r\n else:\r\n l[int(wall[i]) - 2] = '2'\r\n lst = l.copy() \r\n # print(l)\r\n god = list(set(god))\r\n bap = god.copy()\r\n \r\n # print(\"bap\", bap)\r\n for j in bap:\r\n if(j==0 or j==n-1):\r\n continue\r\n # print(j, end = \" \")\r\n if(lst[j]=='1'):\r\n if(l[j-1] == '0'):\r\n l[j-1] = '1'\r\n god.append(j-1)\r\n if(l[j+1] == \"0\"):\r\n l[j+1] = '1'\r\n god.append(j+1)\r\n if(l[j+1] == \"3\"):\r\n l[j+1] = '2'\r\n god.append(j+1)\r\n elif(lst[j]=='2'):\r\n if(l[j-1] == '0'):\r\n god.append(j-1)\r\n l[j-1] = '1'\r\n # print(\"in loop\", l) \r\n if(lst[0]=='1'):\r\n if(l[1]=='0'):\r\n l[1] = '1'\r\n god.append(1)\r\n elif(l[1]=='3'):\r\n l[1] = '2'\r\n if(lst[n-1]=='1'):\r\n if(l[n-2]=='0'):\r\n l[n-2] = '1'\r\n god.append(n-2)\r\n # print(\"god\", god)\r\n # print(\"check 0 and n-1\", l) \r\n # print(l) \r\n print(l.count('1') + l.count('2')) \r\n \r\n \r\n", "# cook your dish here\nt=int(input())\nL=[]\nfor i in range(t):\n length=int(input())\n s=input()\n x=list(s)\n list_length=int(input())\n l=list(map(int,input().split()))\n for i in range(list_length):\n index=(l[i]-1)+i\n element=\"|\"\n x.insert(index,element)\n l1=[]\n for i in range(len(x)):\n if(x[i]=='1'):\n l1.append(i)\n for j in range(len(l1)):\n if(l1[j]==0 or l1[j]==(len(x)-1)):\n if(l1[j]==0 and x[l1[j]+1]!=\"|\"):\n x[l1[j]+1]=\"1\"\n elif(l1[j]==(len(x)-1) and x[l1[j]-1]!=\"|\"):\n x[l1[j]-1]=\"1\"\n else:\n if(x[l1[j]-1]!=\"|\" and x[l1[j]+1]!=\"|\"):\n x[l1[j]-1]=\"1\"\n x[l1[j]+1]=\"1\"\n elif(x[l1[j]-1]!=\"|\" and x[l1[j]+1]==\"|\"):\n x[l1[j]-1]=\"1\"\n elif(x[l1[j]-1]==\"|\" and x[l1[j]+1]!=\"|\"):\n x[l1[j]+1]=\"1\"\n num=0\n for k in range(len(x)):\n if(x[k]=='1'):\n num+=1\n L.append(num)\nfor m in range(len(L)):\n print(L[m])"] | {"inputs": [["2", "9", "000010000", "3", "2 5 8", "5", "00001", "1", "5"]], "outputs": [["6", "1"]]} | INTERVIEW | PYTHON3 | CODECHEF | 31,762 | |
c46d66cad349d17f67f190ca46f94b31 | UNKNOWN | Chef wants to organize a contest. Predicting difficulty levels of the problems can be a daunting task. Chef wants his contests to be balanced in terms of difficulty levels of the problems.
Assume a contest had total P participants. A problem that was solved by at least half of the participants (i.e. P / 2 (integer division)) is said to be cakewalk difficulty. A problem solved by at max P / 10 (integer division) participants is categorized to be a hard difficulty.
Chef wants the contest to be balanced. According to him, a balanced contest must have exactly 1 cakewalk and exactly 2 hard problems. You are given the description of N problems and the number of participants solving those problems. Can you tell whether the contest was balanced or not?
-----Input-----
The first line of the input contains an integer T denoting the number of test cases.
The first line of each test case contains two space separated integers, N, P denoting the number of problems, number of participants respectively.
The second line contains N space separated integers, i-th of which denotes number of participants solving the i-th problem.
-----Output-----
For each test case, output "yes" or "no" (without quotes) denoting whether the contest is balanced or not.
-----Constraints-----
- 1 ≤ T, N ≤ 500
- 1 ≤ P ≤ 108
- 1 ≤ Number of participants solving a problem ≤ P
-----Subtasks-----
- Subtask #1 (40 points): P is a multiple of 10
- Subtask #2 (60 points): Original constraints
-----Example-----
Input
6
3 100
10 1 100
3 100
11 1 100
3 100
10 1 10
3 100
10 1 50
4 100
50 50 50 50
4 100
1 1 1 1
Output
yes
no
no
yes
no
no
-----Explanation-----
Example case 1.: The problems are of hard, hard and cakewalk difficulty. There is 1 cakewalk and 2 hard problems, so the contest is balanced.
Example case 2.: The second problem is hard and the third is cakewalk. There is 1 cakewalk and 1 hard problem, so the contest is not balanced.
Example case 3.: All the three problems are hard. So the contest is not balanced.
Example case 4.: The problems are of hard, hard, cakewalk difficulty. The contest is balanced.
Example case 5.: All the problems are cakewalk. The contest is not balanced.
Example case 6.: All the problems are hard. The contest is not balanced. | ["t = int(input())\nfor z in range(t) :\n n,p = [int(x) for x in input().split()]\n a = [int(x) for x in input().split()] \n c = [x for x in a if x >= p//2]\n h = [x for x in a if x <= p//10]\n if len(c)==1 and len(h)==2 :\n print(\"yes\")\n else:\n print(\"no\")", "t = int(input())\nfor z in range(t) :\n n,p = [int(x) for x in input().split()]\n a = [int(x) for x in input().split()] \n c = [x for x in a if x >= p//2]\n h = [x for x in a if x <= p//10]\n if len(c)==1 and len(h)==2 :\n print(\"yes\")\n else:\n print(\"no\")", "# cook your dish here\nt = int(input())\nfor z in range(t) :\n n,p = [int(x) for x in input().split()]\n a = [int(x) for x in input().split()] \n c = [x for x in a if x >= p//2]\n h = [x for x in a if x <= p//10]\n if len(c)==1 and len(h)==2 :\n print(\"yes\")\n else:\n print(\"no\")", "def ishard(participants , studentswhosolved):\n if studentswhosolved <= int(participants/10):\n return True\n else :\n return False\n\ndef iscakewalk(participants , studentswhosolved):\n if studentswhosolved >= int(participants/2):\n return True\n else :\n return False\n\nfor t in range(int(input())):\n n, p = list(map(int, input().split()))\n cakwalkproblems = 0\n hardproblems = 0\n numberlist = list(map(int,input().split()))\n for _ in range(n):\n if ishard(p , numberlist[_]):\n hardproblems+=1\n elif iscakewalk(p , numberlist[_]) :\n cakwalkproblems+=1\n if cakwalkproblems == 1 and hardproblems == 2 :\n print(\"yes\")\n else :\n print(\"no\")\n", "for t in range(int(input())):\n N,P = map(int,input().split())\n l=list(map(int,input().strip().split()))\n \n \n a=b=0\n for j in l:\n if j >= int(P/2):\n a +=1 \n elif j <= int(P/10):\n b += 1\n \n if(a==1 and b==2):\n print(\"yes\")\n else:\n print(\"no\")", "# cook your dish here\nfor t in range(int(input())):\n n,p=[int(x)for x in input().rstrip().split()]\n a=[int(x)for x in input().rstrip().split()]\n cakewalk=0\n hard=0 \n for i in range(0,n):\n if a[i]>=p//2 and a[i]<=p:\n cakewalk+=1\n elif a[i]>=0 and a[i]<=p//10:\n hard+=1 \n if (cakewalk==1 and hard==2):\n print(\"yes\")\n else:\n print(\"no\")\n \n \n", "# cook your dish here\nfor _ in range(int(input())):\n n,p = map(int,input().split())\n l=list(map(int,input().split()))\n a=c=0\n for i in l:\n if i >= int(p/2):\n a +=1 \n elif i <= int(p/10):\n c+= 1\n print('yes' if(a==1 and c==2) else 'no') ", "# cook your dish here\nfor i in range(int(input())):\n x,p = map(int,input().split())\n l=list(map(int,input().split()))\n a=b=0\n for j in l:\n if j >= int(p/2):\n a +=1 \n elif j <= int(p/10):\n b += 1\n print('yes' if(a==1 and b==2) else 'no') ", "t=int(input())\nfor i in range(t):\n n,p=list(map(int,input().split()))\n a=list(map(int,input().split()))\n cakewalk=0\n difficulty=0\n for i in range(len(a)):\n if(a[i]>=p//2 and a[i]<=p):\n cakewalk=cakewalk+1\n elif(a[i]>=0 and a[i]<=p//10):\n difficulty=difficulty+1\n if(cakewalk==1 and difficulty==2):\n print(\"yes\")\n else:\n print(\"no\")\n \n \n", "# cook your dish here\nt=int(input())\nfor i in range(0,t):\n s=input().split(\" \")\n k=int(s[1])\n a=input().split(\" \")\n l=list(map(int,a))\n m=k//10\n n=k//2\n c=0\n p=0\n for i in range(0,len(l)):\n if(int(l[i])>=n):\n c=c+1\n if(int(l[i]<=m)):\n p=p+1\n if(p==2 and c==1):\n print(\"yes\")\n else:\n print(\"no\")\n", "T=int(input())\nfor i in range(T):\n N,P=list(map(int,input().split()))\n S=list(map(int,input().split()))[:N]\n c=0\n d=0\n for j in range(len(S)):\n if S[j]>=P//2:\n c+=1\n elif S[j]<=P//10:\n d+=1\n if c==1 and d==2:\n print(\"yes\")\n else:\n print(\"no\")\n", "T=int(input())\nfor i in range(T):\n N,P=list(map(int,input().split()))\n S=list(map(int,input().split()))[:N]\n c=0\n d=0\n for j in range(len(S)):\n if S[j]>=P//2:\n c+=1\n elif S[j]<=P//10:\n d+=1\n if c==1 and d==2:\n print(\"yes\")\n else:\n print(\"no\")\n \n", "def balancedContest(n,p,arr):\n cakewalk = 0\n hard = 0\n for i in range(len(arr)):\n if arr[i] >= int(p/2):\n cakewalk += 1\n if arr[i] <= int(p/10):\n hard += 1\n if cakewalk == 1 and hard == 2:\n print('yes')\n else:\n print('no')\n return\n\n#Driver code starts here\nt = int(input())\nfor _ in range(t):\n n,p = map(int,input().split())\n arr = list(map(int,input().split()))\n balancedContest(n,p,arr)", "# cook your dish here\ntry:\n \n for t in range(int(input())):\n N,P = map(int,input().split())\n l=list(map(int,input().strip().split()))\n \n \n a=b=0\n for j in l:\n if j >= int(P/2):\n a +=1 \n elif j <= int(P/10):\n b += 1\n \n if(a==1 and b==2):\n print(\"yes\")\n else:\n print(\"no\")\nexcept:\n pass", "t = int(input())\nfor i in range(t):\n lst1=[]\n lst1 = [int(item) for item in input().split()] \n N=lst1[0]\n P=lst1[1]\n a = list(map(int,input().strip().split()))[:N] \n e = 0\n d = 0\n for j in a: \n if j >= int(P/2):\n e = e+1 \n elif j <= int(P/10):\n d = d+1\n if e == 1 and d == 2:\n print('yes')\n else:\n print('no')\n", "try:\n \n for i in range(int(input())):\n N,P = map(int,input().split())\n l=list(map(int,input().strip().split()))\n \n \n a=b=0\n for j in l:\n if j >= int(P/2):\n a +=1 \n elif j <= int(P/10):\n b += 1\n \n if(a==1 and b==2):\n print(\"yes\")\n else:\n print(\"no\")\nexcept:\n pass", "# cook your dish here\nval=int(input())\nfor i in range(val):\n n,p=input().split()\n n=int(n)\n p=int(p)\n di=int(0)\n ca=int(0)\n q=list(map(int,input().split()))\n for j in range(len(q)):\n d=p/10\n c=p/2\n if(q[j]<=d):\n di=di+1\n elif(c<=q[j]):\n ca=ca+1\n if(ca==1 and di==2):\n print(\"yes\")\n else:\n print(\"no\")\n \n", "t = int(input())\nfor i in range(t):\n n,p = list(map(int, input().split(' ')))\n \n z= list(map(int, input().split()))\n e = 0\n d = 0\n for j in z:\n if j >= int(p/2):\n e = e+1 \n elif j <= int(p/10):\n d = d+1\n if e == 1 and d == 2:\n print('yes')\n else:\n print('no')\n", "try:\n t = int(input())\n \n for i in range(t):\n n,p = list(map(int, input().split(' ')))\n \n z= list(map(int, input().split()))\n e = 0\n d = 0\n for j in z:\n if j >= int(p/2):\n e = e+1 \n elif j <= int(p/10):\n d = d+1\n if e == 1 and d == 2:\n print('yes')\n else:\n print('no')\n \n \n \n \n \nexcept:\n pass\n \n \n \n \n \n \n\n \n\n \n", "# cook your dish here\nfor _ in range(int(input())):\n n,p = list(map(int,input().split()))\n l = list(map(int,input().split()))\n e,h = 0,0 \n for i in l:\n if i<=p//10:\n h+=1 \n elif i>=p//2:\n e+=1 \n if e==1 and h==2:\n print(\"yes\")\n else:\n print(\"no\")\n", "for _ in range(int(input())):\n n,p = list(map(int,input().split()))\n l = list(map(int,input().split()))\n e,h = 0,0 \n for i in l:\n if i<=p//10:\n h+=1 \n elif i>=p//2:\n e+=1 \n if e==1 and h==2:\n print(\"yes\")\n else:\n print(\"no\")\n # cook your dish here\n", "for _ in range(int(input())):\n n,p = list(map(int,input().split()))\n l = list(map(int,input().split()))\n e,h = 0,0 \n for i in l:\n if i<=p//10:\n h+=1 \n elif i>=p//2:\n e+=1 \n if e==1 and h==2:\n print(\"yes\")\n else:\n print(\"no\")\n", "# cook your dish here\nfor t in range(int(input())):\n n,p = list(map(int, input().split()))\n ls = list(map(int, input().split()))\n count = 0 \n cout = 0\n for j in ls:\n if j<=(p//10):\n count += 1 \n if j>=(p//2):\n cout += 1 \n if (count==2 and cout==1):\n print(\"yes\")\n else:\n print(\"no\")\n", "T = int(input())\nfor _ in range(T):\n n,p = tuple(map(int,input().split(' ')))\n solved_by = list(map(int,input().split(' ')))\n cakewalk,hard = (0,0)\n for x in solved_by:\n if x >= p//2:\n cakewalk = cakewalk + 1\n elif x <= p//10:\n hard = hard + 1\n if cakewalk == 1 and hard == 2:\n print('yes')\n else:\n print('no')\n", "T = int(input())\nfor _ in range(T):\n n,p = tuple(map(int,input().split(' ')))\n solved_by = list(map(int,input().split(' ')))\n cakewalk,hard = (0,0)\n for x in solved_by:\n if x >= p//2:\n cakewalk = cakewalk + 1\n elif x <= p//10:\n hard = hard + 1\n if cakewalk == 1 and hard == 2:\n print('yes')\n else:\n print('no')"] | {"inputs": [["6", "3 100", "10 1 100", "3 100", "11 1 100", "3 100", "10 1 10", "3 100", "10 1 50", "4 100", "50 50 50 50", "4 100", "1 1 1 1"]], "outputs": [["yes", "no", "no", "yes", "no", "no"]]} | INTERVIEW | PYTHON3 | CODECHEF | 8,182 | |
4e21c25680604638761a00cbb10cb62e | UNKNOWN | You are teaching students to generate strings consisting of unique lowercase latin characters (a-z). You give an example reference string $s$ to the students.
You notice that your students just copy paste the reference string instead of creating their own string. So, you tweak the requirements for strings submitted by the students.
Let us define a function F(s, t) where s and t are strings as the number of characters that are same in both the strings. Note that the position doesn't matter. Here are a few examples of F(s, t):
F("abc", "def") = 0
F("abc", "acb") = 3
F("back", "abcd") = 3
Now you ask your students to output a string t with lowercase unique characters of the same length as $s$, such that F(s, t) $\leq k$ where you are also given the value of $k$. If there are multiple such strings, you ask them to output the lexicographically smallest possible string. If no such string is possible, output the string "NOPE" without quotes.
-----Input:-----
- The first line will contain $T$, the number of testcases. Then the testcases follow.
- Each testcase contains of a single line of input, which contains a string $s$ and an integer $k$.
-----Output:-----
For each testcase, output in a single line the lexicographically smallest string t such that F(s, t) <= k or "NOPE" without quotes if no such string exists.
-----Constraints-----
- $1 \leq T \leq 10000$
- $1 \leq $length of string s $(|s|) \leq 26$
- $s$ only consists of characters $a$ to $z$
- There are no repeating characters in s
- $0 \leq k \leq |s|$
-----Sample Input:-----
4
helowrd 0
background 0
abcdefghijklmnopqrstuvwxyz 0
b 1
-----Sample Output:-----
abcfgij
efhijlmpqs
NOPE
a | ["for _ in range(int(input())):\n s,k=map(str,input().split())\n k=int(k)\n n=\"NOPE\"\n al=[0]*26\n for ele in s:\n al[ord(ele)-ord('a')]=1\n l=len(s)\n ans=[]\n # print(al)\n for i in range(26):\n if len(ans)==l:\n break\n elif al[i]==1 and k>0:\n k-=1\n ans.append(chr(i+ord('a')))\n elif al[i]==0:\n ans.append(chr(i+ord('a')))\n \n if len(ans)!=l:\n print(n)\n else:\n print(\"\".join(ans))", "# cook your dish here\nt = int(input())\ntt = 0\nwhile tt < t :\n tt = tt + 1\n str = input()\n s, k = str.split()\n k = int(k)\n l = len(s)\n if l >= 14 and (2*l - k) > 26:\n print(\"NOPE\")\n else :\n thisList = []\n j = 0\n while j < 26 :\n thisList.append(0)\n j = j + 1\n j = 0\n while j < l :\n a = str[j]\n b = ord(a)\n b = b - 97\n thisList[b] = 1\n j = j + 1\n str = \"\"\n j = 0\n i = 0\n while j < l:\n c = chr(i + 97)\n if thisList[i] == 0 :\n str = str + c\n j = j + 1\n elif k > 0:\n str = str + c\n j = j + 1 \n k = k - 1\n else :\n pass\n i = i + 1\n print(str) \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n", "letters = ['a']\nfor i in range(0, 25): letters.append(chr(ord(letters[i]) + 1))\nfor tests in range(int(input())):\n word = input().split();integer = int(word[1]);ret = ''\n for i in letters:\n if integer > 0: \n ret += i\n if i in word[0]: integer -= 1\n else:\n if i not in word[0]: ret += i\n if len(ret) == len(word[0]): break\n print('NOPE') if len(ret) != len(word[0]) else print(ret)", "# cook your dish here\nletters = ['a']\nfor i in range(0, 25): letters.append(chr(ord(letters[i]) + 1))\n\nfor tests in range(int(input())):\n word = input().split()\n integer = int(word[1])\n ret = ''\n for i in letters:\n if integer > 0: \n ret += i\n if i in word[0]: integer -= 1\n else:\n if i not in word[0]: ret += i\n if len(ret) == len(word[0]): break\n if len(ret) != len(word[0]): print('NOPE')\n else: print(ret)", "# cook your dish here\nalpha = \"abcdefghijklmnopqrstuvwxyz\"\nfor _ in range(int(input())):\n s, k = input().split()\n k = int(k)\n l = len(s)\n res = ''.join(sorted(s))\n if (26-l)+k < l:\n print(\"NOPE\")\n else:\n for i in alpha:\n if l == 0:\n break\n else:\n if i not in res:\n print(i, end = \"\")\n l -= 1\n else:\n if k!= 0:\n print(i, end = \"\")\n k -= 1 \n l -= 1\n print() ", "import math,sys\nfrom collections import Counter, defaultdict, deque\nfrom sys import stdin, stdout\ninput = stdin.readline\nlili=lambda:list(map(int,sys.stdin.readlines()))\nli = lambda:list(map(int,input().split()))\n#for deque append(),pop(),appendleft(),popleft(),count()\nI=lambda:int(input())\nS=lambda:input().strip()\nmod = 1000000007\n\nfor i in range(I()):\n s,n=list(map(str,input().split()))\n n=int(n)\n p=\"abcdefghijklmnopqrstuvwxyz\"\n d=Counter(s)\n ans=\"\"\n for i in p:\n if(len(ans)==len(s)):\n break\n if(i not in d):\n ans+=i\n else:\n if(n):\n ans+=i\n n-=1\n if(len(ans)==len(s)):\n print(ans)\n else:\n print(\"NOPE\")", "# cook your dish here\nt=int(input())\nwhile(t>0):\n fs,k=map(str,input().split())\n k=int(k)\n fs=list(set(fs))\n arr=\"\"\n for a in range(97,123):\n if(chr(a) in fs):\n if(k>0):\n arr+=chr(a)\n k-=1\n else:\n continue\n else:\n arr+=chr(a)\n if(len(fs)<=len(arr)):\n print(arr[:len(fs)])\n else:\n print('NOPE')\n t-=1", "t=int(input())\nwhile(t>0):\n fs,k=list(map(str,input().split()))\n k=int(k)\n fs=list(set(fs))\n arr=\"\"\n for a in range(97,123):\n if(chr(a) in fs):\n if(k>0):\n arr+=chr(a)\n k-=1\n else:\n continue\n else:\n arr+=chr(a)\n if(len(fs)<=len(arr)):\n print(arr[:len(fs)])\n else:\n print('NOPE')\n t-=1\n \n", "n = int(input())\nwhile(n>0):\n s1,c1=input().split(\" \")\n c1=int(c1)\n s1=list(set(s1))\n answer=\"\"\n for c in range(97,123):\n if chr(c) in s1:\n if(c1>0):\n answer+=chr(c)\n c1=c1-1;\n else:\n continue \n else:\n answer+=chr(c)\n if(len(s1)<=len(answer)):\n print(answer[:len(s1)])\n else:\n print(\"NOPE\");\n n=n-1;", "for _ in range(int(input())):\n s = input().split()\n k = int(s[1])\n s = s[0]\n ll = len(s)\n if (26-ll+k)>=ll:\n l = [0]\n for i in range(26):\n l.append(0)\n for i in s:\n l[ord(i)-96]=1\n a = 0\n b = 1\n for i in range(ll):\n if a<k:\n if l[b]==1:\n print(chr(96+b),end=\"\")\n a+=1\n else:\n print(chr(96+b),end=\"\")\n else:\n while b<=26 and l[b]==1:\n b+=1\n print(chr(96+b),end=\"\")\n b+=1\n else:\n print('NOPE',end=\"\")\n print()", "from math import sqrt\ndef ii():return int(input())\ndef si():return input()\ndef mi():return list(map(int,input().split()))\ndef li():return list(mi())\nabc=\"abcdefghijklmnopqrstuvwxyz\"\nt=ii()\nwhile(t):\n t-=1\n m=[0]*26\n s=input().split()\n s1=s[0]\n k=int(s[1])\n n=len(s1)\n for i in range(len(s1)):\n m[ord(s1[i])-ord('a')]+=1\n s=\"\"\n for i in range(26):\n if(m[i]!=0):\n if(k>0):\n s+=abc[i]\n k-=1\n else:\n s+=abc[i]\n if(n!=len(s[:n])):\n print(\"NOPE\")\n else:\n print(s[:n])\n \n \n \n \n \n \n \n", "# cook your dish here\nfor _ in range(int(input())):\n s,k = map(str,input().split())\n k = int(k)\n if (26-len(s))+k<len(s):print(\"NOPE\")\n else:\n k1,ans = k,\"\"\n for i in range(97,123):\n a = chr(i)\n if s.count(a)>0:\n if k1>0:\n k1 -= 1\n ans += a\n else:ans += a\n if len(ans)==len(s):break\n print(ans)", "for t in range(int(input())):\n flag=False\n a=[0]*26\n s,k=(input().split())\n k=int(k)\n s=list(s)\n n=len(s)\n nn=n\n ans=[]\n for i in range(n):\n a[ord(s[i])-ord('a')]=1\n for i in range(26):\n if(a[i]==0 and n>0):\n flag=True\n \n ans.append(chr(ord('a')+i))\n n-=1\n elif (a[i]==1 and n>0 and k>0):\n ans.append(chr(ord('a')+i))\n n-=1\n k-=1\n flag=True\n # print(ans)\n if(flag and len(ans)==nn):\n for i in ans:\n print(i,end='')\n print()\n else:\n print(\"NOPE\")\n ", "# cook your dish here\nfor _ in range(int(input())):\n t,k=input().split()\n k=int(k)\n str=''\n for c in range(97,123):\n if chr(c) in t:\n if k>0:\n str+=chr(c)\n k=k-1\n else:\n continue\n else:\n str+=chr(c)\n if len(str)>=len(t):\n print(str[:len(t)])\n else:\n print('NOPE')", "t = int(input())\nwhile t>0:\n t -= 1\n s,k= input().split()\n k = int(k)\n n = len(s)\n d = []\n for i in range(97,97+26):\n d.append(chr(i))\n st = \"\"\n for i in d:\n if i not in s:\n st+=i\n else:\n if k>0:\n st+=i\n k -=1\n if len(st) == n:\n print(st)\n break\n if len(st) < n:\n print(\"NOPE\")", "# cook your dish here\nt=int(input())\nwhile t>0:\n l=list(input().split())\n a=int(l[1])\n s=list(l[0])\n o=\"\"\n for i in range(97,123):\n if(chr(i) in s):\n if(a>0):\n o+=chr(i)\n a-=1\n else:\n o+=chr(i)\n if(len(s)<=len(o)):\n print(\"\".join(o[0:len(s)]))\n else:\n print(\"NOPE\")\n t-=1", "for _ in range(int(input())):\n s,k=input().split()\n k=int(k)\n # arr = list(n)\n t=\"\"\n for i in range(97,123):\n if chr(i) not in s:\n t+=chr(i)\n if len(t)==len(s):\n break\n elif chr(i) in s and k>0:\n t+=chr(i)\n k-=1\n if len(t)==len(s):\n break\n if len(t)==len(s):\n print(t)\n else:\n print(\"NOPE\")\n", "for _ in range(int(input())):\n s,k=map(str,input().split())\n s1=list(set(s))\n k=int(k)\n ans=\"\"\n for i in range(97,123):\n if chr(i) in s1:\n if(k>0):\n ans+=chr(i)\n k-=1\n else:\n continue \n else:\n ans+=chr(i)\n if(len(s1)<=len(ans)):\n print(ans[:len(s1)])\n else:\n print(\"NOPE\");", "T=int(input())\nfor i in range(0,T):\n a,b=input().split()\n b=int(b)\n n=len(a)\n a=list(set(a))\n r=[]\n for c in range(97,123):\n if(len(r)==n):\n break\n else:\n if chr(c) not in a:\n r.append(chr(c))\n else:\n if(b>0):\n r.append(chr(c))\n b=b-1\n if(len(r)!=n):\n print(\"NOPE\")\n else:\n print(''.join(r))\n", "t=int(input())\nwhile (t>0):\n s,k=input().split()\n s=list(s)\n k=int(k)\n anstr=\"\"\n for i in range(97,123):\n if (chr(i) in s):\n if (k>0):\n anstr=anstr+chr(i)\n k=k-1\n else:\n anstr=anstr+chr(i)\n if (len(anstr)>=len(s)):\n print(anstr[:len(s)])\n else:\n print(\"NOPE\")\n t=t-1", "# cook your dish here\nfor _ in range(int(input())):\n s,k = input().split()\n k = int(k)\n ref = \"abcdefghijklmnopqrstuvwxyz\"\n l = len(s)\n r = \"\"\n i=0\n while len(r)!=l and i<26:\n if ref[i] in s and k>0:\n r+=ref[i]\n i+=1\n k-=1\n elif ref[i] in s:\n i+=1\n continue\n else:\n r+=ref[i]\n i+=1\n if len(r) == len(s):\n print(r)\n else:\n print(\"NOPE\")\n \n", "t=int(input())\nfor _ in range(t):\n #lol={'a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q'\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0,'r','s','t','u','v','w','x','y','z'}\n s,k=input().split()\n k=int(k)\n n=len(s)\n x=list(set(s))\n final=''\n for i in range(97,123):\n if(chr(i) in x):\n if(k>0):\n final+=chr(i)\n k-=1\n else:\n continue\n else:\n final+=chr(i)\n if(len(s)<=len(final)):\n print(final[:n])\n else:\n print('NOPE')\n \n", "t = int(input())\ng = 'abcdefghijklmnopqrstuvwxyz'\nwhile t:\n t-=1\n s,k = input().split()\n h = len(s)\n k = int(k)\n ans = []\n count = 0\n d = {}\n for i in s:\n d[i] = True\n s = list(s)\n s = sorted(s)\n for i in range(k):\n ans.append(s[i])\n currentIndex=0\n ans = ans[::-1]\n for i in range(26):\n if g[i] not in d:\n if count+k<h:\n count+=1\n ans.append(g[i])\n ans = sorted(ans)[::-1]\n else:\n for j in range(h):\n if ans[j]>g[i]:\n ans[j] = g[i]\n ans = sorted(ans)[::-1]\n break\n ans = sorted(ans)\n if count+k == h:\n \n print(''.join(ans))\n else:\n print(\"NOPE\")\n", "import string\n\nfor a in range(int(input())):\n s, k = input().split()\n k = int(k)\n if 26 - len(s) + k < len(s):\n print(\"NOPE\")\n else:\n t = \"\"\n f = 0\n for c in string.ascii_lowercase:\n if c in s and f < k:\n t += c\n f += 1\n elif c not in s:\n t += c\n if len(t) == len(s):\n break\n print(t)\n"] | {"inputs": [["4", "helowrd 0", "background 0", "abcdefghijklmnopqrstuvwxyz 0", "b 1"]], "outputs": [["abcfgij", "efhijlmpqs", "NOPE", "a"]]} | INTERVIEW | PYTHON3 | CODECHEF | 10,047 | |
7a9f4d1d6caf95ef5cb8a9f703371cd6 | UNKNOWN | Little chef has just been introduced to the world of numbers! While experimenting with addition and multiplication operations, the little chef came up with the following problem:
Given an array A of non-negative integers, how many pairs of indices i and j exist such that A[i]*A[j] > A[i]+A[j] where i < j .
Now being a learner, little chef isn't able to solve this problem efficiently and hence turns to you for help.
-----Input-----
First line of input contains an integer T denoting the number of test cases. For each test case, the first line contains an integer N denoting the number of integers in the array. The next line contains N space separated integers where the ith integer represents A[i].
Note : There may be trailing spaces on each line of input.
-----Output-----
For each test, print the required number of pairs in a single line.
-----Constraints-----
- 1 ≤ T ≤ 10
- 2 ≤ N ≤ 100000 (105)
- 0 ≤ A[i] ≤ 1000000 (106)
-----Example-----
Input:
2
3
3 4 5
4
1 1 1 1
Output:
3
0
-----Explanation-----
Example case 1.
All pairs of numbers satisfy the criteria. Total number of pairs equals 3.
Example case 2.
No pair of numbers satisfy the criteria. | ["# cook your dish here\nt = int(input())\n\nres = []\nfor i in range(t):\n n = int(input())\n arr = [int(i) for i in input().split()]\n \n num_2 = 0\n num = 0\n \n for j in range(len(arr)):\n if arr[j] == 2:\n num_2 += 1\n \n if arr[j] > 2:\n num += 1\n \n res.append(num_2 * num + (num * (num - 1)) // 2)\n \nfor z in res:\n print(z)", "T = int(input())\nans = []\n\nfor _ in range(T):\n N = int(input())\n A = [int(i) for i in input().split()]\n\n C2 = 0\n C = 0\n for i in range(N):\n if(A[i]==2):\n C2 += 1\n if(A[i]>2):\n C += 1\n ans.append(C2*C + (C*(C - 1))//2)\nfor i in ans:\n print(i)\n", "try:\n for i in range(int(input())):\n n=int(input())\n l=list(map(int,input().split()))\n k=[]\n for i in l:\n if i >1:\n k.append(i)\n two=k.count(2) \n c2=len(k)-two\n print((two*c2) + c2*(c2-1)//2)\nexcept:\n pass", "for _ in range(int(input())):\n n = int(input())\n a = list(map(int,input().split()))\n c = t = 0\n for i in range(n):\n if a[i]==2:\n t+=1\n c+=1\n elif a[i]>1:\n c+=1\n print(int((c*(c-1)/2)-(t*(t-1)/2)))", "from collections import defaultdict\nfor _ in range(int(input())):\n n = int(input())\n ls = [int(x) for x in input().split()]\n n-=ls.count(1)\n n-=ls.count(0)\n twos = ls.count(2)\n ans = n*(n-1)//2\n if twos>1:\n ans-=(twos-1)*twos//2\n print(ans)", "from collections import defaultdict\nfor _ in range(int(input())):\n n = int(input())\n ls = [int(x) for x in input().split()]\n n-=(ls.count(1)+ls.count(0))\n twos = ls.count(2)\n rest = twos*(n-twos) + ((n-twos)*(n-twos-1) )// 2\n print(rest)", "from collections import defaultdict\nfor _ in range(int(input())):\n n = int(input())\n ls = [int(x) for x in input().split()]\n twos = 0;rest = 0\n for i in range(n):\n if ls[i]==0 or ls[i]==1:\n continue\n elif ls[i]==2:\n twos+=1\n else:rest+=1\n ans = (twos*rest) + (rest*(rest-1))//2\n print(ans)", "for _ in range(int(input())):\n n = int(input())\n A = list(map(int, input().split()))\n ans = ones = twos = 0\n for i in range(n):\n if A[i] == 1 or A[i] == 0:\n ones += 1\n elif A[i] == 2:\n twos += 1\n n = n - ones\n ct2 = 0\n if twos > 1:\n ct2 = twos\n ans = (n * (n-1) // 2) - (ct2 * (ct2-1) // 2)\n print(ans)", "for _ in range(int(input())):\n n = int(input())\n A = list(map(int, input().split()))\n ans = ones = twos = 0\n for i in range(n):\n if A[i] == 1 or A[i] == 0:\n ones += 1\n elif A[i] == 2:\n twos += 1\n n = n - ones\n ct2 = 0\n if twos > 1:\n ct2 = twos\n ans = (n * (n-1) // 2) - (ct2 * (ct2-1) // 2)\n print(ans)", "for _ in range(int(input())):\n n=int(input())\n l=list(map(int,input().split()))\n n-=l.count(0)\n p=l.count(2)\n k=l.count(1)\n n-=k\n ans=n*(n-1)//2\n if p>1:\n ans-=(p-1)*p//2\n print(ans)", "for _ in range(int(input())):\n n=int(input())\n a=list(map(int,input().split()))\n t=0\n m=0\n for i in range(n):\n if a[i]==2:t+=1\n if a[i]>2:m+=1\n print( t*m + (m*(m-1))//2 )", "# cook your dish here\nfor _ in range(int(input())):\n N=int(input())\n arr=list(map(int,input().split()))\n x=0\n y=0\n for i in arr:\n if(i==2):\n x+=1\n if(i>2):\n y+=1\n print(x*y + (y*(y-1))//2)", "# cook your dish here\nfor _ in range(int(input())):\n \n n = int(input())\n l = list(map(int,input().split()))\n \n c2=0\n c=0\n for i in l:\n \n if i==2:\n c2+=1\n if i>2:\n c+=1\n \n \n print(c2*c + (c*(c-1))//2)\n\n", "# cook your dish here\nfor _ in range(int(input())):\n \n n = int(input())\n l = list(map(int,input().split()))\n \n c2=0\n c=0\n for i in l:\n \n if i==2:\n c2+=1\n if i>2:\n c+=1\n \n \n print(c2*c + (c*(c-1))//2)\n", "import math\ntest = int(input())\nfor _ in range(test):\n n=int(input())\n array =list(map(int, input().split()))\n count = n- array.count(1) - array.count(0) - array.count(2)\n print(count*(count-1)//2 + array.count(2)*count)", "for _ in range(int(input())):\n n=int(input())\n a=[int(i) for i in input().split()]\n n-=a.count(0)\n n-=a.count(1)\n p=a.count(2)\n n-=p\n print(((n*(n-1))//2)+p*n)", "from bisect import *\nfrom collections import *\nfrom sys import stdin,stdout\nfrom queue import *\nfrom itertools import *\nfrom heapq import *\nfrom random import *\nfrom statistics import *\nfrom math import *\nimport operator\ninn=stdin.readline\nout=stdout.write\nfor i in range(int(inn())):\n n=int(inn())\n a=list(map(int,inn().split()))\n d=defaultdict(list)\n s=0\n for i in range(n):\n if a[i]==1 or a[i]==0 or a[i]==2:\n d[a[i]].append(i)\n for i in range(n):\n if a[i]==0 or a[i]==1:\n continue\n if a[i]==2:\n k=len(d[0])-bisect(d[0],i)\n k1=len(d[1])-bisect(d[1],i)\n k2=len(d[2])-bisect(d[2],i)\n s+=(n-i-1)-(k+k1+k2)\n continue\n k=len(d[0])-bisect(d[0],i)\n k1=len(d[1])-bisect(d[1],i)\n s+=(n-i-1)-(k+k1)\n print(s)\n \n", "t=int(input())\nfor _ in range(t):\n n=int(input())\n list1=list(map(int,input().strip().split()))\n \n count1=0\n count2=0\n for val in list1:\n if val==0 or val==1:\n count1+=1\n elif val==2:\n count2+=1\n \n temp1=n-count1\n temp2=0\n if count2>=2:\n temp2=count2\n \n print((temp1*(temp1-1))//2-(temp2*(temp2-1))//2)\n \n \n", "# cook your dish here\nfor _ in range(int(input())):\n n=int(input())\n l=list(map(int,input().split()))\n s=sum(1 for el in l if el>2)\n c=l.count(2)\n print(c*s+s*(s-1)//2)", "# cook your dish here\nfor t in range(int(input())):\n n=int(input())\n l=list(map(int,input().split()))\n a,b=0,0\n for i in range(n):\n if l[i]>2:\n a+=1\n elif l[i]==2:\n b+=1\n print(int(((a*(a-1)/2)+a*b)))", "# cook your dish here\ndef solve():\n n = int(input())\n l = list(map(int, input().split()))\n t_2 = 0\n tn_2 = 0\n for i in range(len(l)):\n if l[i] > 2:\n tn_2 += 1\n elif l[i] == 2:\n t_2 += 1\n ans = (tn_2 * (tn_2 - 1)) / 2\n ans += t_2 * tn_2\n print(int(ans))\n\n\ndef __starting_point():\n t = int(input())\n while t != 0:\n solve()\n t -= 1\n__starting_point()", "for _ in range(int(input())):\n n=int(input())\n l=list(map(int,input().split()))\n t_2=0\n tn_2=0\n for i in range(len(l)):\n if l[i]>2:\n tn_2+=1\n elif(l[i]==2):\n t_2+=1\n ans=(tn_2*(tn_2-1))/2\n ans+=t_2*tn_2\n print(int(ans)) ", "for _ in range(int(input())):\n n=int(input())\n l=list(map(int,input().split()))\n t_2=0\n tn_2=0\n for i in range(len(l)):\n if l[i]>2:\n tn_2+=1\n elif(l[i]==2):\n t_2+=1\n ans=(tn_2*(tn_2-1))/2\n ans+=t_2*tn_2\n print(int(ans))\n"] | {"inputs": [["2", "3", "3 4 5", "4", "1 1 1 1"]], "outputs": [["3", "0"]]} | INTERVIEW | PYTHON3 | CODECHEF | 6,360 | |
a74f625eff8285706c45933f17498f7d | UNKNOWN | The chef was chatting with his friend who was a mathematician.
Chef said "Hi !".
His friend replied that '!' is the symbol of factorial.
Chef had never heard about it and he asked more about it. Then his friend taught him how to calculate the factorial of a number.
Chef loved that But as always he got tired after calculating a few values and asked you to do it for him.
-----Input-----
N : Number of inputs
then N lines with input T
N<10
T<=200
-----Output-----
The result for the corresponding value of T
-----Example-----
Input:
3
5
4
6
Output:
120
24
720 | ["factorials=[1]\n\nfor x in range(1,201):\n factorials.append(factorials[x-1]*x)\n \nx=int(input())\n\nfor x in range(x):\n n=int(input())\n print(factorials[n])", "for _ in range(int(input())):\n t=int(input())\n x=1\n for i in range(2,t+1):\n x*=i\n \n print(x)", "T=eval(input())\nT=int(T)\nwhile T:\n n=eval(input()) \n total=1\n n=int(n)\n for i in range(1,n+1):\n total=total*i\n print(total)\n T=T-1\n", "import sys\n\nN=201\nans=[1]\ni=1\nwhile i < N:\n ans.append(ans[i-1] * i)\n i = i+1\n\nT=int(sys.stdin.readline().strip())\nwhile T > 0:\n n=int(sys.stdin.readline().strip())\n print(ans[n])\n T=T-1;\n", "t = int(input())\n\ndef fact(n):\n if n==1:\n return 1\n else:\n return n*fact(n-1)\n \nfor i in range(0,t):\n n = int(input())\n print(fact(n))\n", "import sys\n\ndef Fact(n):\n s = 1\n for i in range(2, n + 1):\n s *= i\n return s\n\nN = int(sys.stdin.readline())\n\nfor i in range(N):\n T = int(sys.stdin.readline())\n print(Fact(T))\n", "x = int(input());\nfor i in range(x):\n p=1;\n m=int(input());\n for j in range(1,m+1):\n p=p*j;\n print(p)\n\n", "t=eval(input())\nt=int(t)\nfor i in range(0,t):\n n=eval(input())\n n=int(n)\n if n==0:\n n=1\n for j in range(2,n):\n n*=j\n print(n) \n", "#!/usr/bin/env python\n\ndef fact(N):\n P = 1\n for n in range(2, N + 1):\n P *= n\n return P\n\nT = int(input())\nfor t in range(T):\n N = int(input())\n print(fact(N))\n\n", "N = int(input())\nfor i in range(N):\n T = int(input())\n res = 1\n for i in range(T): res *= i+1\n print(res)\n", "def factorial(n):\n fact=1;\n for i in range(1, n+1):\n fact*=i\n return fact\n\n\nt=int(input())\nfor c in range(t):\n n=int(input())\n print(factorial(n))"] | {"inputs": [["3", "5", "4", "6"]], "outputs": [["120", "24", "720"]]} | INTERVIEW | PYTHON3 | CODECHEF | 1,679 | |
d10f66c3ad212e78334d6c17d3866c65 | UNKNOWN | Chef Zidane likes the number 9. He has a number N, and he wants to turn it into a multiple of 9. He cannot add or remove digits, and he can only change one digit at a time. The only allowed operation is to increment or decrement a digit by one, and doing this takes exactly one second. Note that he cannot increase a digit 9 or decrease a digit 0, and the resulting number must not contain any leading zeroes unless N has a single digit.
Chef Zidane wants to know the minimum amount of time (in seconds) needed to accomplish this. Please help him, before his kitchen gets overwhelmed with mist!
-----Input-----
The first line of the input contains an integer T denoting the number of test cases. The description of T test cases follows.
Each test case consists of one line containing a single positive integer N.
-----Output-----
For each test case, output a single line containing the answer.
-----Constraints-----
- 1 ≤ T ≤ 105
- 1 ≤ N ≤ 10105
- N will not contain leading zeroes.
- Each test file is at most 3Mb in size.
-----Example-----
Input:4
1989
86236
90210
99999999999999999999999999999999999999988
Output:0
2
3
2
-----Explanation-----
Example case 1. 1989 is already divisible by 9, so no operations are needed to be performed.
Example case 2. 86236 can be turned into a multiple of 9 by incrementing the first and third digit (from the left), to get 96336. This takes 2 seconds.
Example case 3. 90210 can be turned into a multiple of 9 by decrementing the third digit twice and the fourth digit once, to get 90000. This takes 3 seconds. | ["s=int(input())\nwhile(s>0):\n s-=1\n a=input()\n c=0\n for x in a:\n c+=int(x)\n if(c<9 and len(a)!=1):\n print(9-c%9)\n else:\n print(min(9-c%9,c%9))\n", "s=int(input())\nwhile(s>0):\n s-=1\n a=input()\n c=0\n for x in a:\n c+=int(x)\n if(c<9 and len(a)!=1):\n print(9-c%9)\n else:\n print(min(9-c%9,c%9))\n", "# cook your dish here\ntest=int(input())\nfor _ in range(test):\n n=input()\n s=0\n for i in n:\n s+=int(i)\n if len(n)>1 and s<9:\n print(9-(s%9))\n else:\n print(min(s%9,9-s%9))\n", "# cook your dish here\n\n# def getSum(n): \n# sum = 0\n# while (n != 0): \n# sum = sum + int(n % 10) \n# n = int(n/10) \n# return sum\n \n\nfor _ in range(int(input())):\n n = input()\n s=0\n for i in n:\n s+=int(i)\n if s<9 and len(n)!=1:\n print(9-s%9)\n else:\n print(min(9-s%9,s%9))", "# cook your dish here\nt=int(input())\nwhile t:\n t-=1\n n=input()\n s=0\n for i in n:\n s+=int(i)\n if len(n)>1 and s<9:\n print(9-(s%9))\n else:\n print(min(s%9,9-s%9))\n", "'''\nauthor:\"Pradhyumna Singh Rathore\"\n'''\nfor _ in range(int(input())):\n n=input()\n ans=sum(list(map(int,n)))\n if(len(n)>1 and ans<9):\n print(9-ans)\n else:\n print(min(ans%9,9-ans%9))\n", "# cook your dish here\ntry:\n for _ in range(int(input())):\n n=input()\n ans=sum(list(map(int,n)))\n if(len(n)>1 and ans<9):\n print(9-ans)\n else:\n print(min(ans%9,9-ans%9))\nexcept:\n pass\n", "for _ in range(int(input())):\n n=input()\n ans=sum(list(map(int,n)))\n if(len(n)>1 and ans<9):\n print(9-ans)\n else:\n print(min(ans%9,9-ans%9))", "for i in range(int(input())):\n n=input()\n total=sum(list(map(int,n)))\n if len(n)>1 and total<9:\n print(9-total)\n else:\n print(min(total%9,9-total%9))", "for _ in range(int(input())):\n a=input()\n res=sum(map(int,a))\n if len(a)>1 and res<9:\n print(9-res)\n else:\n print(min(9-res%9,res%9))\n", "# cook your dish here\nfor j in range(int(input())):\n n=input()\n c=sum(map(int,n))\n if(len(n)>1 and c<9):\n print(9-c)\n else:\n print(min(c%9,9-c%9))", "# cook your dish here\nfor j in range(int(input())):\n n=input()\n c=sum(map(int,n))\n if(len(n)>1 and c<9):\n print(9-c)\n else:\n print(min(c%9,9-c%9))", "for j in range(int(input())):\n n=input()\n c=sum(map(int,n))\n if(len(n)>1 and c<9):\n print(9-c)\n else:\n print(min(c%9,9-c%9))", "for j in range(int(input())):\n n=input()\n c=sum(map(int,n))\n if(len(n)>1 and c<5):\n print(9-c)\n else:\n print(min(c%9,9-c%9))", "t=int(input())\nfor _ in range(t):\n n=input()\n y=[int(x) for x in n]\n z=sum(y)\n if z<5 and len(y)>1:\n print(9-z)\n else:\n print(min(z%9, 9-z%9))", "for i in range(int(input())):\n s=input()\n rem=int(s)%9\n n=sum(map(int,s))\n #print(rem,n)\n if n<5 and len(s)>1:\n print(9-n)\n else:\n if rem >= 5:\n rem=9-rem\n print(rem)", "for _ in range(int(input())):\n s=input()\n rem=int(s)%9\n n=sum(map(int,s))\n if n<5 and len(s)>1:\n print(9-n)\n else:\n if rem >= 5:\n rem=9-rem\n print(rem)", "for _ in range(int(input())):\n s=input()\n rem=int(s)%9\n n=sum(map(int,s))\n if n<5 and len(s)>1:\n print(9-n)\n else:\n if rem >= 5:\n rem=9-rem\n print(rem)", "# cook your dish here\nfor u in range(int(input())):\n n=input()\n s=sum(map(int,n))\n if(len(n)>1 and s<5):\n print(9-s)\n else:\n print(min(s%9,9-s%9))", "'''\n\nThis File is created by Saurabh Sisodia\nemail address... \"[email protected]\"\n\n................................................................................\u00a0\u00a0\u00a0\u00a0............\n\n'''\nfor _ in range(int(input())):\n n=input()\n sum=0\n len=0\n for v in n:\n len+=1\n sum+=int(v)\n rem=sum%9\n if len>1 and sum<9:\n ans=9-rem\n else:\n ans=min(rem,9-rem)\n print(ans)", "# cook your dish here\nt=int(input())\nfor loop in range(t):\n n=input()\n sum=0\n addable=0\n for i in n:\n sum+=ord(i)-ord('0')\n addable+=ord('9')-ord(i)\n rem=sum%9\n if(int(n)>9):\n \n if(rem>9-rem):\n if(9-rem<=addable):\n print(9-rem)\n else:\n print(rem)\n else:\n if(sum>rem):\n print(rem)\n else:\n print(9-rem)\n else:\n print(min(rem,9-rem))", "t=int(input())\nfor _ in range(t):\n s=input()\n l=[int(x) for x in s]\n ss=sum(l)\n if ss<5 and len(l)>1:\n print(9-ss)\n else:\n print(min(ss%9, 9-ss%9))\n\n", "for _ in range(int(input())):\n li=[int(i) for i in list(input())]\n if len(li)!=1 and sum(li)<9:print(9-(sum(li)%9))\n else:print(min(sum(li)%9,9-(sum(li)%9)))"] | {"inputs": [["4", "1989", "86236", "90210", "99999999999999999999999999999999999999988"]], "outputs": [["0", "2", "3", "2"]]} | INTERVIEW | PYTHON3 | CODECHEF | 4,439 | |
3fb798182fede481e13f7d3e54aa06e5 | UNKNOWN | Vasya likes the number $239$. Therefore, he considers a number pretty if its last digit is $2$, $3$ or $9$.
Vasya wants to watch the numbers between $L$ and $R$ (both inclusive), so he asked you to determine how many pretty numbers are in this range. Can you help him?
-----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 — the number of pretty numbers between $L$ and $R$.
-----Constraints-----
- $1 \le T \le 100$
- $1 \le L \le R \le 10^5$
-----Subtasks-----
Subtask #1 (100 points): original constraints
-----Example Input-----
2
1 10
11 33
-----Example Output-----
3
8
-----Explanation-----
Example case 1: The pretty numbers between $1$ and $10$ are $2$, $3$ and $9$.
Example case 2: The pretty numbers between $11$ and $33$ are $12$, $13$, $19$, $22$, $23$, $29$, $32$ and $33$. | ["# cook your dish here\nt=int(input())\nfor _ in range(t):\n n,m = map(int,input().split())\n count=0\n for i in range(n,m+1):\n p=str(i)\n if p[-1]=='2' or p[-1]=='3' or p[-1]=='9':\n count+=1\n print(count)", "# cook your dish here\nt=int(input())\nfor i in range(t):\n l,r=list(map(int,input().split()))\n ans=0\n\n for i in range(l,r+1):\n ck=i%10\n if(ck==2 or ck==3 or ck==9):\n ans+=1\n\n print(ans)\n", "# cook your dish here\nt=int(input())\nfor i in range(t):\n l,r=list(map(int,input().split()))\n ans=0\n\n for i in range(l,r+1):\n ck=str(i)[-1]\n if(ck=='2' or ck=='3' or ck=='9'):\n ans+=1\n\n print(ans)\n", "# cook your dish here\nz=int(input())\n\nfor i in range(z):\n l,r = map(int, input().split())\n count=0\n for i in range(l,r+1):\n \n if i%10 in [2,3,9]:\n count+=1\n \n print(count)", "# cook your dish here\nfor i in range(int(input())):\n c=0\n a,b=map(int,input().split())\n for j in range(a,b+1):\n k=j%10\n if k==2 or k==3 or k==9:\n c=c+1\n print(c)", "for x in range(int(input())):\n l,r=map(int,input().split())\n c=0\n if l-r<=0:\n for y in range(l,r+1):\n if y%10 in [2,3,9]:\n c+=1\n else:\n c=3*(r//10-l//10)\n for y in range(l%10):\n if y in [2,3,9]:\n c-=1\n for y in range(r%10):\n if y in [2,3,9]:\n c+=1\n print(c)", "# cook your dish here\nz=int(input())\n\nfor i in range(z):\n l,r = map(int, input().split())\n count=0\n for i in range(l,r+1):\n \n if i%10 in [2,3,9]:\n count+=1\n \n print(count)", "# cook your dish here\n# python programs by sourav\n\n\nfor _ in range(int(input())):\n l,r=map(int,input().split())\n\n c=0\n while l<=r:\n i=1\n if str(l)[-1]=='2':\n c+=1\n i=1\n elif str(l)[-1]=='3':\n c+=1\n i=6\n elif str(l)[-1]=='9':\n c+=1\n i=3\n l+=i\n print(c)", "# cook your dish here\nfor x in range(int(input())):\n l,r=list(map(int,input().split()))\n c=0\n if l-r<=0:\n for y in range(l,r+1):\n if y%10 in [2,3,9]:\n c+=1\n else:\n c=3*(r//10-l//10)\n for y in range(l%10):\n if y in [2,3,9]:\n c-=1\n for y in range(r%10):\n if y in [2,3,9]:\n c+=1\n print(c)\n \n", "t=int(input())\nfor j in range(t):\n l,r=list(map(int,input().split()))\n c=0\n for i in range(l,(r+1)):\n if ((i%10)==2) or ((i%10)==3) or ((i%10)==9):\n c+=1\n print(c) \n", "# cook your dish here\nt=int(input())\nfor i in range(t):\n a,b=map(int,input().split())\n c=[2,3,9]\n d=0\n for j in range(a,b+1):\n if(j%10 in c):\n d=d+1\n print(d)", "t= int(input())\nwhile t:\n l,r=input().split()\n l=int(l)\n r=int(r) \n count=0\n for i in range(l,r+1):\n rem = i%10\n if rem ==2 or rem == 3 or rem == 9 :\n count=count+1\n print(count)\n t=t-1\n", "# cook your dish here\ndef prettynumber(m,n):\n count = 0\n for i in range(m, n + 1):\n x = i % 10\n if (x == 2 or x == 3 or x == 9):\n count += 1\n print(count)\n\ndef __starting_point():\n for j in range(int(input())):\n ab = input().split()\n a = int(ab[0])\n b = int(ab[1])\n prettynumber(a,b)\n\n__starting_point()", "# cook your dish here\nn = int(input())\nfor _ in range(n):\n arr = list(map(int, input().split()))\n a = [2,3,9]\n count=0\n for i in range(arr[0], arr[-1]+1):\n if i%10 in a:\n count+=1\n print(count)", "for _ in range(int(input())):\n L, R = map(int, input().split())\n count = 0\n for i in range(L, R+1):\n if str(i)[-1] in ['2','3','9']:\n count += 1 \n print(count)", "t = int(input())\nwhile t>0:\n l,r = tuple([int(i) for i in input().split()])\n c = 0\n for i in range(l,r+1):\n num = list(str(i))[-1]\n if '2' == num or '3' == num or '9' == num:\n #print(i)\n c+=1\n print(c)\n t-=1\n\n", "# cook your dish here\nx = int(input())\n\nlst = []\n\nfor i in range(0, x):\n l , r = input().split()\n l = int(l)\n r = int(r)\n sublst = []\n while l<=r:\n if l%10 == 2 or l%10 == 3 or l%10 == 9:\n sublst.append(l)\n l+=1\n lst.append(len(sublst))\n\nfor i in range(0,x):\n print(lst[i])\n", "# cook your dish here\nT = int(input())\nfor j in range(T):\n ran = list(map(int, input().rstrip().split()))\n count=0\n for i in range(ran[0],ran[1]+1):\n if(i%10==2 or i%10 == 3 or i%10 == 9):\n count+=1\n print(count)", "# cook your dish here\nfor i in range(int(input())):\n m,n = map(int,input().split())\n c = 0\n for i in range(m,n+1):\n p = str(i)\n if(p[-1] == \"2\" or p[-1] == \"3\" or p[-1] == \"9\"):\n c = c+1\n print(c)", "# cook your dish here\ndef __starting_point():\n t=int(input())\n for m in range(t):\n l,r=list(map(int, input().split(\" \")))\n co=0\n for i in range(l,r+1):\n if(i%10 == 2 or i%10==3 or i%10 == 9):\n co+=1\n print(co)\ndef pretty(n):\n if(n%10 == 2 or n%10==3 or n%10 == 9):\n return True\n else:\n return False\n__starting_point()", "def __starting_point():\n t=int(input())\n for m in range(t):\n l,r=list(map(int, input().split(\" \")))\n co=0\n for i in range(l,r+1):\n if(i%10 == 2 or i%10==3 or i%10 == 9):\n co+=1\n print(co)\ndef pretty(n):\n if(n%10 == 2 or n%10==3 or n%10 == 9):\n return True\n else:\n return False\n__starting_point()", "# cook your dish here\nfor i in range(int(input())):\n m,n = list(map(int,input().split()))\n c = 0\n for i in range(m,n+1):\n p = str(i)\n if(p[-1] == \"2\" or p[-1] == \"3\" or p[-1] == \"9\"):\n c = c+1\n print(c)\n \n", "# cook your dish here\nfor _ in range(int(input())):\n l,r = map(int,input().split())\n c = 0\n for i in range(l,r+1):\n if str(i)[-1] in '239':\n c += 1\n print(c)", "# cook your dish here\nt=int(input())\nfor i in range(t):\n c=0\n l,r=list(map(int,input().split()))\n #print(c)\n for i in range(l,r+1,1):\n if(i%10==2 or i%10==3 or i%10==9):\n c+=1\n print(c)\n \n", "# cook your dish here\nfor j in range(int(input())):\n count=0\n l,r=map(int,input().split())\n for i in range(l,r+1,1):\n a=str(i)\n if a[-1]==\"2\" or a[-1]==\"3\" or a[-1]==\"9\":\n count+=1\n print(count)"] | {"inputs": [["2", "1 10", "11 33"]], "outputs": [["3", "8"]]} | INTERVIEW | PYTHON3 | CODECHEF | 5,859 | |
3f9623836b1e99c7889bc5b5e6c5891d | UNKNOWN | Lavanya and Nikhil have K months of holidays ahead of them, and they want to go on exactly K road trips, one a month. They have a map of the various cities in the world with the roads that connect them. There are N cities, numbered from 1 to N. We say that you can reach city B from city A if there is a sequence of roads that starts from city A and ends at city B. Note that the roads are bidirectional. Hence, if you can reach city B from city A, you can also reach city A from city B.
Lavanya first decides which city to start from. In the first month, they will start from that city, and they will visit every city that they can reach by road from that particular city, even if it means that they have to pass through cities that they have already visited previously. Then, at the beginning of the second month, Nikhil picks a city that they haven't visited till then. In the second month, they first fly to that city and visit all the cities that they can reach from that city by road. Then, in the third month, Lavanya identifies a city, and they fly there and visit all cities reachable from there by road. Then in the fourth month it is Nikhil's turn to choose an unvisited city to start a road trip, and they alternate like this. Note that the city that they fly to (that is, the city from where they start each month's road trip) is also considered as being visited.
Each city has some museums, and when they visit a city for the first time, Lavanya makes them visit each of the museums there. Lavanya loves going to museums, but Nikhil hates them. Lavanya always makes her decisions so that they visit the maximum number of museums possible that month, while Nikhil picks cities so that the number of museums visited that month is minimized.
Given a map of the roads, the number of museums in each city, and the number K, find the total number of museums that they will end up visiting at the end of K months. Print -1 if they will have visited all the cities before the beginning of the Kth month, and hence they will be left bored at home for some of the K months.
-----Input-----
- The first line contains a single integer, T, which is the number of testcases. The description of each testcase follows.
- The first line of each testcase contains three integers: N, M and K, which represents the number of cities, number of roads and the number of months.
- The ith of the next M lines contains two integers, ui and vi. This denotes that there is a direct road between city ui and city vi.
- The next line contains N integers, the ith of which represents the number of museums in city i.
-----Output-----
For each test case, if they can go on K road trips, output a single line containing a single integer which should be the total number of museums they visit in the K months. Output -1 if they can't go on K road trips.
-----Constraints-----
- 1 ≤ T ≤ 3
- 1 ≤ N ≤ 106
- 0 ≤ M ≤ 106
- 1 ≤ K ≤ 106
- 1 ≤ ui, vi ≤ N
- There is no road which goes from one city to itself. ie. ui ≠ vi.
- There is at most one direct road between a pair of cities.
- 0 ≤ Number of museums in each city ≤ 1000
- Sum of N over all testcases in a file will be ≤ 1.5 * 106
-----Subtasks-----
- Subtask 1 (11 points): M = 0
- Subtask 2 (21 points): Each city has at most two roads of which it is an end point. That is, for every i, there are at most two roads (u, v) in the input, such that u = i or v = i.
- Subtask 3 (68 points): Original constraints.
-----Example-----
Input:
3
10 10 3
1 3
3 5
5 1
1 6
6 2
5 6
2 5
7 10
4 7
10 9
20 0 15 20 25 30 30 150 35 20
10 10 2
1 3
3 5
5 1
1 6
6 2
5 6
2 5
7 10
4 7
10 9
20 0 15 20 25 30 30 150 35 20
10 10 5
1 3
3 5
5 1
1 6
6 2
5 6
2 5
7 10
4 7
10 9
20 0 15 20 25 30 30 150 35 20
Output:
345
240
-1
-----Explanation-----
Notice that in all the three testcases, everything is the same, except for the value of K. The following figure represents the road map in these testcases. Each node denotes a city, with a label of the form "n (m)", where n is the city number, between 1 and N, and m is the number of museums in this city. For example, the node with label "5 (25)" represents city 5, which has 25 museums.
Testcase 1: Lavanya will first choose to fly to city 8. In the first month, they visit only that city, but they visit 150 museums.
Then in the second month, Nikhil could choose to fly to city 3, and they visit the cities 1, 2, 3, 5 and 6, and visit 20 + 0 + 15 + 25 + 30 = 90 museums that month. Note that Nikhil could have instead chosen to fly to city 1 or 2 or 5 or 6, and they would all result in the same scenario.
Then, Lavanya could choose city 7, and in the third month they will visit the cities 7, 4, 10 and 9. Note that Lavanya could have chosen to fly to city 4 or 10 or 9, and they would all result in the same scenario.
In total, they have visited 345 museums in the three months (which is in fact all the museums), and that is the answer.
Testcase 2: It is same as the previous testcase, but now they have only 2 months. So they visit only 150 + 90 = 240 museums in total.
Testcase 3: It is same as the previous testcase, but now they have 5 months of holidays. But sadly, they finish visiting all the cities within the first three months itself, and hence the answer is -1. | ["def merge(intervals,start,mid,end):\n al = mid-start+1\n bl = end-mid\n \n A = intervals[start:mid+1]\n B = intervals[mid+1:end+1]\n \n p=0;q=0;k=start;\n while(p<al and q<bl):\n if(A[p]<B[q]):\n intervals[k] = A[p]\n k+=1;p+=1;\n else:\n intervals[k] = B[q]\n k+=1;q+=1;\n \n while(p<al):\n intervals[k] = A[p]\n k+=1;p+=1;\n while(q<bl):\n intervals[k] = B[q]\n k+=1;q+=1;\n \n\ndef mergesort(intervals, start, end):\n if(start<end):\n mid = int((start+end)/2)\n mergesort(intervals,start,mid)\n mergesort(intervals,mid+1,end)\n merge(intervals,start,mid,end)\n\nt = int(input())\nfor _ in range(t):\n n,m,k = map(int, input().split())\n \n cities = [[0,[]] for i in range(n)]\n for i in range(m):\n a,b = map(int, input().split())\n cities[a-1][1].append(b-1)\n cities[b-1][1].append(a-1)\n \n li = list(map(int, input().split()))\n \n def specialfunction():\n mergesort(li,0,n-1)\n if(k>len(li)):\n print(-1)\n else:\n sum = 0\n front = 0\n rear = len(li)-1\n for i in range(k):\n if(i%2==0):\n sum += li[rear]\n rear -= 1\n else:\n sum += li[front]\n front += 1\n print(sum)\n \n if(m == 0):\n specialfunction()\n continue\n \n for i in range(n):\n cities[i][0] = li[i]\n \n visited = [-1 for i in range(n)]\n count = 0\n museummonths = []\n def searchUnvisited():\n for i in range(n):\n if(visited[i] == -1):\n return i\n return -1\n \n def bfs(ind,count):\n museumcount = 0\n queue = []\n queue.append(ind)\n visited[ind] = 1\n museumcount += cities[ind][0]\n count += 1\n front = 0\n rear = 0\n while(front<=rear):\n noe = len(cities[ind][1])\n for i in range(noe):\n if(visited[cities[ind][1][i]] == -1):\n queue.append(cities[ind][1][i])\n rear += 1\n count += 1\n museumcount += cities[cities[ind][1][i]][0]\n visited[cities[ind][1][i]] = 1\n front += 1\n try:\n ind = queue[front]\n except:\n break\n museummonths.append(museumcount)\n return count\n \n while(count<n):\n for i in range(n):\n if(visited[i] == -1):\n count = bfs(i,count)\n \n mergesort(museummonths,0,len(museummonths)-1)\n #print(museummonths)\n if(k>len(museummonths)):\n print(-1)\n else:\n sum = 0\n front = 0\n rear = len(museummonths)-1\n for i in range(k):\n if(i%2==0):\n sum += museummonths[rear]\n rear -= 1\n else:\n sum += museummonths[front]\n front += 1\n print(sum)", "# cook your dish here\nfrom collections import defaultdict\n\nt=int(input())\nfor _ in range(t):\n n,m,k=map(int, input().split())\n graph=defaultdict(lambda:[])\n for _ in range(m):\n u, v = map(int,input().split())\n graph[u-1].append(v-1)\n graph[v-1].append(u-1)\n museums=list(map(int,input().split()))\n visited=[0]*n\n lista=[]\n for i in range(n):\n if visited[i]==0:\n visited[i]=1\n stack=[i]\n counter=museums[i]\n while len(stack)>0:\n u=stack.pop()\n for v in graph[u]:\n if visited[v]==0:\n counter+=museums[v]\n stack.append(v)\n visited[v]=1\n lista.append(counter)\n if len(lista)<k:\n print(-1)\n else:\n lista.sort()\n counter=0\n id0=0 \n id1=len(lista)-1 \n for i in range(k):\n if i%2==0:\n counter+=lista[id1]\n id1-=1 \n else:\n counter+=lista[id0]\n id0+=1 \n print(counter)", "def dfs(i):\n visited[i]=True\n musuemsPossible=musuems[i]\n for j in neighbours[i]:\n if(not visited[j]):\n musuemsPossible+=dfs(j)\n return musuemsPossible\n\nt = int(input())\nfor _ in range(t):\n n,m,k = list(map(int, input().split())) \n neighbours=[]\n visited=[]\n for i in range(n):\n visited.append(False)\n neighbours.append([])\n for _ in range(m):\n a,b = list(map(int, input().split()))\n neighbours[a-1].append(b-1)\n neighbours[b-1].append(a-1)\n \n musuems=[int(x) for x in input().split()]\n\n mususeumsBigNode=[]\n for i in range(n):\n if(not visited[i]):\n mususeumsBigNode.append(dfs(i))\n \n if len(mususeumsBigNode) < k:print(-1)\n else:\n mususeumsBigNode.sort()\n if k % 2 == 0:\n k //= 2\n ans = sum(mususeumsBigNode[:k]+mususeumsBigNode[-k:])\n else:\n k //= 2\n ans = mususeumsBigNode[-k-1]\n if k > 0:ans += sum(mususeumsBigNode[:k]+mususeumsBigNode[-k:])\n print(ans)\n", "def dfs(i):\n visited[i]=True\n musuemsPossible=musuems[i]\n for j in neighbours[i]:\n if(not visited[j]):\n musuemsPossible+=dfs(j)\n return musuemsPossible\n\nt = int(input())\nfor _ in range(t):\n n,m,k = list(map(int, input().split())) \n neighbours=[]\n visited=[]\n for i in range(n):\n visited.append(False)\n neighbours.append([])\n for i in range(m):\n a=[int(x) for x in input().split()]\n neighbours[a[0]-1].append(a[1]-1)\n neighbours[a[1]-1].append(a[0]-1)\n \n musuems=[int(x) for x in input().split()]\n\n mususeumsBigNode=[]\n for i in range(n):\n if(not visited[i]):\n mususeumsBigNode.append(dfs(i))\n \n if len(mususeumsBigNode) < k:print(-1)\n else:\n mususeumsBigNode.sort()\n if k % 2 == 0:\n k //= 2\n ans = sum(mususeumsBigNode[:k]+mususeumsBigNode[-k:])\n else:\n k //= 2\n ans = mususeumsBigNode[-k-1]\n if k > 0:ans += sum(mususeumsBigNode[:k]+mususeumsBigNode[-k:])\n print(ans)\n", "def dfs(i):\n visited[i]=True\n musuemsPossible=musuems[i]\n for j in neighbours[i]:\n if(not visited[j]):\n musuemsPossible+=dfs(j)\n return musuemsPossible\n\nt = int(input())\nfor _ in range(t):\n a=[int(x) for x in input().split()]\n n=a[0]\n m=a[1]\n k=a[2]\n neighbours=[]\n visited=[]\n for i in range(n+1):\n visited.append(False)\n neighbours.append([])\n for i in range(m):\n a=[int(x) for x in input().split()]\n neighbours[a[0]].append(a[1])\n neighbours[a[1]].append(a[0])\n \n musuems=[0]\n m2=[int(x) for x in input().split()]\n for i in m2:\n musuems.append(i)\n\n mususeumsBigNode=[]\n for i in range(1,n+1):\n if(not visited[i]):\n mususeumsBigNode.append(dfs(i))\n \n # print(mususeumsBigNode)\n sorted(mususeumsBigNode)\n if len(mususeumsBigNode) < k:print(-1)\n else:\n mususeumsBigNode.sort()\n if k % 2 == 0:\n k //= 2\n ans = sum(mususeumsBigNode[:k]+mususeumsBigNode[-k:])\n else:\n k //= 2\n ans = mususeumsBigNode[-k-1]\n if k > 0:ans += sum(mususeumsBigNode[:k]+mususeumsBigNode[-k:])\n print(ans)\n", "# -*- coding: utf-8 -*-\n\"\"\"\nCreated on Fri Jul 17 14:21:08 2020\n\n@author: shubham gupta\n\"\"\"\n# cook your dish here\nfor _ in range(int(input())):\n n,m,k = list(map(int, input().split())) \n l = [[] for _ in range(n+1)]\n for _ in range(m):\n a,b = list(map(int, input().split()))\n l[a].append(b)\n l[b].append(a)\n m_l = [-1] + list(map(int, input().split())) \n visited = [False for _ in range(n+1)] \n sum_l = []\n for i in range(1, n+1):\n if visited[i] == False:\n summa = 0\n q = [i]\n while len(q) != 0:\n v = q[-1]\n del q[-1]\n if visited[v]:continue \n visited[v] = True\n summa += m_l[v]\n for vv in l[v]:q.append(vv)\n sum_l.append(summa)\n \n # print(sum_l)\n if len(sum_l) < k:print(-1)\n else:\n sum_l.sort()\n if k % 2 == 0:\n k //= 2\n ans = sum(sum_l[:k]+sum_l[-k:])\n else:\n k //= 2\n ans = sum_l[-k-1]\n if k > 0:ans += sum(sum_l[:k]+sum_l[-k:])\n print(ans)\n \n", "# cook your dish here\nfor _ in range(int(input())):\n n,m,k = list(map(int, input().split()))\n \n l = [[] for _ in range(n+1)]\n for _ in range(m):\n a,b = list(map(int, input().split()))\n l[a].append(b)\n l[b].append(a)\n m_l = [-1] + list(map(int, input().split()))\n \n visited = [False for _ in range(n+1)]\n \n sum_l = []\n for i in range(1, n+1):\n if visited[i] == False:\n summa = 0\n q = [i]\n while len(q) != 0:\n v = q[-1]\n del q[-1]\n if visited[v]:\n continue\n \n visited[v] = True\n summa += m_l[v]\n for vv in l[v]:\n q.append(vv)\n sum_l.append(summa)\n \n # print(sum_l)\n if len(sum_l) < k:\n print(-1)\n else:\n sum_l.sort()\n if k % 2 == 0:\n k //= 2\n ans = sum(sum_l[:k]+sum_l[-k:])\n else:\n k //= 2\n ans = sum_l[-k-1]\n if k > 0:\n ans += sum(sum_l[:k]+sum_l[-k:])\n print(ans)\n \n", "def merge(intervals,start,mid,end):\n al = mid-start+1\n bl = end-mid\n \n A = intervals[start:mid+1]\n B = intervals[mid+1:end+1]\n \n p=0;q=0;k=start;\n while(p<al and q<bl):\n if(A[p]<B[q]):\n intervals[k] = A[p]\n k+=1;p+=1;\n else:\n intervals[k] = B[q]\n k+=1;q+=1;\n \n while(p<al):\n intervals[k] = A[p]\n k+=1;p+=1;\n while(q<bl):\n intervals[k] = B[q]\n k+=1;q+=1;\n \n\ndef mergesort(intervals, start, end):\n if(start<end):\n mid = int((start+end)/2)\n mergesort(intervals,start,mid)\n mergesort(intervals,mid+1,end)\n merge(intervals,start,mid,end)\n\nt = int(input())\nfor _ in range(t):\n n,m,k = map(int, input().split())\n \n cities = [[0,[]] for i in range(n)]\n for i in range(m):\n a,b = map(int, input().split())\n cities[a-1][1].append(b-1)\n cities[b-1][1].append(a-1)\n \n li = list(map(int, input().split()))\n \n def specialfunction():\n mergesort(li,0,n-1)\n if(k>len(li)):\n print(-1)\n else:\n sum = 0\n front = 0\n rear = len(li)-1\n for i in range(k):\n if(i%2==0):\n sum += li[rear]\n rear -= 1\n else:\n sum += li[front]\n front += 1\n print(sum)\n \n if(m == 0):\n specialfunction()\n continue\n \n for i in range(n):\n cities[i][0] = li[i]\n \n visited = [-1 for i in range(n)]\n count = 0\n museummonths = []\n def searchUnvisited():\n for i in range(n):\n if(visited[i] == -1):\n return i\n return -1\n \n def bfs(ind,count):\n museumcount = 0\n queue = []\n queue.append(ind)\n visited[ind] = 1\n museumcount += cities[ind][0]\n count += 1\n front = 0\n rear = 0\n while(front<=rear):\n noe = len(cities[ind][1])\n for i in range(noe):\n if(visited[cities[ind][1][i]] == -1):\n queue.append(cities[ind][1][i])\n rear += 1\n count += 1\n museumcount += cities[cities[ind][1][i]][0]\n visited[cities[ind][1][i]] = 1\n front += 1\n try:\n ind = queue[front]\n except:\n break\n museummonths.append(museumcount)\n return count\n \n while(count<n):\n for i in range(n):\n if(visited[i] == -1):\n count = bfs(i,count)\n \n mergesort(museummonths,0,len(museummonths)-1)\n #print(museummonths)\n if(k>len(museummonths)):\n print(-1)\n else:\n sum = 0\n front = 0\n rear = len(museummonths)-1\n for i in range(k):\n if(i%2==0):\n sum += museummonths[rear]\n rear -= 1\n else:\n sum += museummonths[front]\n front += 1\n print(sum)", "def merge(intervals,start,mid,end):\n al = mid-start+1\n bl = end-mid\n \n A = intervals[start:mid+1]\n B = intervals[mid+1:end+1]\n \n p=0;q=0;k=start;\n while(p<al and q<bl):\n if(A[p]<B[q]):\n intervals[k] = A[p]\n k+=1;p+=1;\n else:\n intervals[k] = B[q]\n k+=1;q+=1;\n \n while(p<al):\n intervals[k] = A[p]\n k+=1;p+=1;\n while(q<bl):\n intervals[k] = B[q]\n k+=1;q+=1;\n \n\ndef mergesort(intervals, start, end):\n if(start<end):\n mid = int((start+end)/2)\n mergesort(intervals,start,mid)\n mergesort(intervals,mid+1,end)\n merge(intervals,start,mid,end)\n\nt = int(input())\nfor _ in range(t):\n n,m,k = map(int, input().split())\n \n cities = [[0,[]] for i in range(n)]\n for i in range(m):\n a,b = map(int, input().split())\n cities[a-1][1].append(b-1)\n cities[b-1][1].append(a-1)\n \n li = list(map(int, input().split()))\n \n def specialfunction():\n mergesort(li,0,n-1)\n if(k>len(li)):\n print(-1)\n else:\n sum = 0\n front = 0\n rear = len(li)-1\n for i in range(k):\n if(i%2==0):\n sum += li[rear]\n rear -= 1\n else:\n sum += li[front]\n front += 1\n print(sum)\n \n if(m == 0):\n specialfunction()\n continue\n \n for i in range(n):\n cities[i][0] = li[i]\n \n visited = [-1 for i in range(n)]\n count = 0\n museummonths = []\n def searchUnvisited():\n for i in range(n):\n if(visited[i] == -1):\n return i\n return -1\n \n def bfs(ind,count):\n museumcount = 0\n queue = []\n queue.append(ind)\n visited[ind] = 1\n museumcount += cities[ind][0]\n count += 1\n front = 0\n rear = 0\n while(front<=rear):\n noe = len(cities[ind][1])\n for i in range(noe):\n if(visited[cities[ind][1][i]] == -1):\n queue.append(cities[ind][1][i])\n rear += 1\n count += 1\n museumcount += cities[cities[ind][1][i]][0]\n visited[cities[ind][1][i]] = 1\n front += 1\n try:\n ind = queue[front]\n except:\n break\n museummonths.append(museumcount)\n return count\n \n while(count<n):\n ind = searchUnvisited()\n count = bfs(ind,count)\n \n mergesort(museummonths,0,len(museummonths)-1)\n #print(museummonths)\n if(k>len(museummonths)):\n print(-1)\n else:\n sum = 0\n front = 0\n rear = len(museummonths)-1\n for i in range(k):\n if(i%2==0):\n sum += museummonths[rear]\n rear -= 1\n else:\n sum += museummonths[front]\n front += 1\n print(sum)", "# -*- coding: utf-8 -*-\n\"\"\"\nCreated on Fri Feb 21 15:46:01 2020\n\n@author: pramo\n\"\"\"\n\nimport resource, sys\nresource.setrlimit(resource.RLIMIT_STACK, (2**29,-1))\nsys.setrecursionlimit(10**6)\n\nclass graph:\n \"\"\"docstring for graph\"\"\"\n def __init__(self, N):\n self.N = N\n self.adjacent_list = [[] for i in range(N)]\n \n def add_road(self,a,b):\n self.adjacent_list[a].append(b)\n self.adjacent_list[b].append(a)\n\n def DFS_iterate(self, con_list, n, visited):\n visited[n]=True\n con_list.append(n)\n\n for i in self.adjacent_list[n]:\n if visited[i]==False:\n con_list = self.DFS_iterate(con_list,i,visited)\n return con_list\n\n def connected_groups(self):\n visited = [False for i in range(N)]\n con_groups=[]\n for n in range(N):\n if visited[n]==False:\n con_list=[]\n con_groups.append(self.DFS_iterate(con_list,n,visited))\n\n return con_groups\n\n\n\n\nT = int(input())\n# T=1\n\nfor x in range(T):\n N,M,K=list(map(int,input().split()))\n city_map = graph(N)\n # roads=[]\n for i in range(M):\n road = list(map(int,input().split()))\n city_map.add_road(road[0]-1,road[1]-1)\n museums_city=list(map(int,input().split()))\n\n con_groups=city_map.connected_groups()\n \n if(len(con_groups)<K):\n print(\"-1\")\n else:\n museums_groups=[]\n for group in con_groups:\n museums_group=0\n for city in group:\n # print(museums_city[city])\n museums_group+=museums_city[city]\n museums_groups.append(museums_group)\n \n total_museums=0\n museums_groups.sort(reverse=True)\n # Nikhil=False\n # for j in range(K):\n # index_month=-1*Nikhil\n # total_museums+=museums_groups[index_month]\n # if len(museums_groups)!=0:\n # del(museums_groups[index_month])\n # Nikhil = not Nikhil\n # print(museums_groups)\n Ladki=0\n Nikhil=len(museums_groups)-1\n for j in range(K):\n if j%2==0:\n total_museums+=museums_groups[Ladki]\n Ladki+=1\n else:\n total_museums+=museums_groups[Nikhil]\n Nikhil-=1\n print(total_museums)\n", "# -*- coding: utf-8 -*-\n\"\"\"\nCreated on Fri Feb 21 15:46:01 2020\n\n@author: pramo\n\"\"\"\n\nclass graph:\n \"\"\"docstring for graph\"\"\"\n def __init__(self, N):\n self.N = N\n self.adjacent_list = [[] for i in range(N)]\n \n def add_road(self,a,b):\n self.adjacent_list[a].append(b)\n self.adjacent_list[b].append(a)\n\n def DFS_iterate(self, con_list, n, visited):\n visited[n]=True\n con_list.append(n)\n\n for i in self.adjacent_list[n]:\n if visited[i]==False:\n con_list = self.DFS_iterate(con_list,i,visited)\n return con_list\n\n def connected_groups(self):\n visited = [False for i in range(N)]\n con_groups=[]\n for n in range(N):\n if visited[n]==False:\n con_list=[]\n con_groups.append(self.DFS_iterate(con_list,n,visited))\n\n return con_groups\n\n\n\n\nT = int(input())\n# T=1\n\nfor x in range(T):\n N,M,K=list(map(int,input().split()))\n city_map = graph(N)\n # roads=[]\n for i in range(M):\n road = list(map(int,input().split()))\n city_map.add_road(road[0]-1,road[1]-1)\n museums_city=list(map(int,input().split()))\n\n con_groups=city_map.connected_groups()\n \n if(len(con_groups)<K):\n print(\"-1\")\n else:\n museums_groups=[]\n for group in con_groups:\n museums_group=0\n for city in group:\n # print(museums_city[city])\n museums_group+=museums_city[city]\n museums_groups.append(museums_group)\n \n total_museums=0\n museums_groups.sort(reverse=True)\n # Nikhil=False\n # for j in range(K):\n # index_month=-1*Nikhil\n # total_museums+=museums_groups[index_month]\n # if len(museums_groups)!=0:\n # del(museums_groups[index_month])\n # Nikhil = not Nikhil\n # print(museums_groups)\n Ladki=0\n Nikhil=len(museums_groups)-1\n for j in range(K):\n if j%2==0:\n total_museums+=museums_groups[Ladki]\n Ladki+=1\n else:\n total_museums+=museums_groups[Nikhil]\n Nikhil-=1\n print(total_museums)\n", "# import Queue\n# q = Queue.Queue()\ndef bfs(visited, musium, count, roads, explore):\n visited[explore-1] = True\n count[0] += musium[explore]\n for _ in roads[explore]:\n if not visited[_-1]:\n bfs(visited, musium, count, roads, _)\n\n\nt = int(input())\nwhile t>0:\n n, m, k = list(map(int, input().split()))\n\n roads = {i:[] for i in range(1,n+1)}\n visited = [False for _ in range(n)]\n for _ in range(m):\n s, e = list(map(int, input().split()))\n roads[s].append(e)\n roads[e].append(s)\n musium = []\n hashm = {}\n mp = list(map(int, input().split()))\n for i in enumerate(mp, 1):\n musium.append(i)\n hashm.update({i[0]:i[1]})\n \n musium.sort(key = lambda x : x[1])\n # print(musium)\n \n \n count ,lavany ,end ,begin = [0], True, n-1, 0\n \n while k>0:\n if lavany:\n while visited[ musium[end][0]-1 ] and end > begin:\n end -= 1\n # visited[musium[end][0]] = True\n bfs(visited, hashm, count, roads, musium[end][0])\n end -= 1\n\n else:\n while visited[ musium[begin][0]-1 ] and end > begin:\n begin += 1\n bfs(visited, hashm, count, roads, musium[begin][0])\n begin += 1\n k -= 1\n lavany = not lavany\n if all(visited) and k>0:\n print(-1)\n break\n else:\n print(count[0])\n t -= 1\n", "t = int(input())\nwhile(t):\n t -= 1\n n, m, k = list(map(int, input().split()))\n g = []\n for i in range(1000001):\n g.append([])\n while(m):\n m -= 1\n x, y = list(map(int, input().split()))\n g[x].append(y)\n g[y].append(x)\n a = [0] + list(map(int, input().split()))\n ans = []\n vis = [0]*1000001\n for i in range(1, n+1):\n if(vis[i] == 0):\n vis[i] = 1\n val = a[i]\n bfsQ = [i]\n while(bfsQ):\n x = bfsQ[0]\n del bfsQ[0]\n for y in g[x]:\n if(vis[y] == 0):\n val += a[y]\n vis[y] = 1\n bfsQ.append(y)\n ans.append(val)\n ans = sorted(ans)\n if(k>len(ans)):\n print(-1)\n else:\n print(sum(ans[:k//2]) + sum(ans[len(ans)-(k-k//2):]))", "# -*- coding: utf-8 -*-\n\nimport math\nimport collections\nimport bisect\nimport heapq\nimport time\nimport random\nimport itertools\nimport sys\n\n\"\"\"\ncreated by shhuan at 2019/11/30 18:18\n\n\"\"\"\n\nT = int(input())\nfor ti in range(T):\n N, M, K = list(map(int, input().split()))\n\n G = collections.defaultdict(list)\n for i in range(M):\n u, v = list(map(int, input().split()))\n G[u].append(v)\n G[v].append(u)\n\n museums = [0] + [int(x) for x in input().split()]\n\n vis = [False] * (N+1)\n counts = []\n for s in range(1, N+1):\n if vis[s]:\n continue\n vis[s] = True\n count = 0\n q = [s]\n while q:\n u = q.pop()\n count += museums[u]\n for v in G[u]:\n if not vis[v]:\n vis[v] = True\n q.append(v)\n counts.append(count)\n\n if len(counts) < K:\n print(-1)\n else:\n counts.sort(reverse=True)\n if K == 1:\n print(counts[0])\n elif K % 2 == 0:\n print(sum(counts[:K//2]) + sum(counts[-(K//2):]))\n else:\n print(sum(counts[:K//2+1]) + sum(counts[-(K//2):]))\n\n", "# -*- coding: utf-8 -*-\n\nimport math\nimport collections\nimport bisect\nimport heapq\nimport time\nimport random\nimport itertools\nimport sys\n\n\"\"\"\ncreated by shhuan at 2019/11/30 18:18\n\n\"\"\"\n\nT = int(input())\nfor ti in range(T):\n N, M, K = list(map(int, input().split()))\n\n G = collections.defaultdict(list)\n for i in range(M):\n u, v = list(map(int, input().split()))\n G[u].append(v)\n G[v].append(u)\n\n museums = [0] + [int(x) for x in input().split()]\n\n vis = [False] * (N+1)\n counts = []\n for s in range(1, N+1):\n if vis[s]:\n continue\n vis[s] = True\n count = 0\n q = [s]\n while q:\n u = q.pop()\n count += museums[u]\n for v in G[u]:\n if not vis[v]:\n vis[v] = True\n q.append(v)\n counts.append(count)\n\n\n if len(counts) < K:\n print(-1)\n else:\n counts.sort(reverse=True)\n if K % 2 == 0:\n print(sum(counts[:K//2]) + sum(counts[-(K//2):]))\n else:\n print(sum(counts[:K//2+1]) + sum(counts[-(K//2):]))\n\n", "# cook your dish here\nt=int(input())\nimport sys\nsys.setrecursionlimit(1000000)\ndef dfs(node):\n nonlocal l,vis\n st=True\n for i in adj[node]:\n if i in l:\n vis[a]+=it[i]\n st=False\n l.remove(i)\n #print('visited here',vis)\n #print('L here',l)\n dfs(i)\n if st:\n return ''\n \nfor _ in range(t):\n n,m,k=list(map(int,input().split()))\n adj=[[] for i in range(n)]\n l=set(range(0,n))\n #print('l',l)\n for i in range(m):\n x,y=list(map(int,input().split()))\n adj[x-1].append(y-1)\n adj[y-1].append(x-1)\n #print('graph',adj) \n it=list(map(int,input().split()))\n #print('it',it)\n vis={}\n cost=[]\n while l!=set():\n a=l.pop()\n #print('a',a)\n vis[a]=it[a]\n dfs(a)\n cost.append(vis[a])\n #print('cost',cost)\n cost.sort()\n if len(cost)<k:\n print(-1)\n continue\n mi=0\n ma=len(cost)\n su=0\n for i in range(k):\n if i%2==0:\n #print('EVEN','i',i,'ma-1',ma-1,'cost[ma-1]',cost[ma-1])\n su+=cost[ma-1]\n ma-=1\n else:\n #print('ODD','i',i,'mi',mi,'cost[mi]',cost[mi])\n su+=cost[mi]\n mi+=1\n print(su)\n\n\n\n\n\n \n \n", "# cook your dish here\nt=int(input())\nimport sys\nsys.setrecursionlimit(1000000)\ndef dfs(node):\n nonlocal l,vis\n st=True\n for i in adj[node]:\n if i in l:\n vis[a]+=it[i]\n st=False\n l.remove(i)\n dfs(i)\n if st:\n return ''\n \nfor _ in range(t):\n n,m,k=list(map(int,input().split()))\n adj=[[] for i in range(n)]\n l=set(range(0,n))\n for i in range(m):\n x,y=list(map(int,input().split()))\n adj[x-1].append(y-1)\n adj[y-1].append(x-1)\n it=list(map(int,input().split()))\n vis={}\n cost=[]\n while l!=set():\n a=l.pop()\n vis[a]=it[a]\n dfs(a)\n cost.append(vis[a])\n cost.sort()\n if len(cost)<k:\n print(-1)\n continue\n mi=0\n ma=len(cost)\n su=0\n for i in range(k):\n if i%2==0:\n su+=cost[ma-1]\n ma-=1\n else:\n su+=cost[mi]\n mi+=1\n print(su)\n\n\n\n\n\n \n \n", "# cook your dish here\nt=int(input())\nimport sys\nsys.setrecursionlimit(1000000)\ndef dfs(node):\n nonlocal l,vis\n st=True\n for i in adj[node]:\n if i in l:\n vis[a]+=it[i]\n st=False\n l.remove(i)\n dfs(i)\n if st:\n return ''\n \nfor _ in range(t):\n n,m,k=list(map(int,input().split()))\n adj=[[] for i in range(n)]\n l=set(range(0,n))\n for i in range(m):\n x,y=list(map(int,input().split()))\n adj[x-1].append(y-1)\n adj[y-1].append(x-1)\n it=list(map(int,input().split()))\n vis={}\n cost=[]\n while l!=set():\n a=l.pop()\n vis[a]=it[a]\n dfs(a)\n cost.append(vis[a])\n cost.sort()\n if len(cost)<k:\n print(-1)\n continue\n mi=0\n ma=len(cost)\n su=0\n for i in range(k):\n if i%2==0:\n su+=cost[ma-1]\n ma-=1\n else:\n su+=cost[mi]\n mi+=1\n print(su)\n\n\n\n\n\n \n \n"] | {"inputs": [["3", "10 10 3", "1 3", "3 5", "5 1", "1 6", "6 2", "5 6", "2 5", "7 10", "4 7", "10 9", "20 0 15 20 25 30 30 150 35 20", "10 10 2", "1 3", "3 5", "5 1", "1 6", "6 2", "5 6", "2 5", "7 10", "4 7", "10 9", "20 0 15 20 25 30 30 150 35 20", "10 10 5", "1 3", "3 5", "5 1", "1 6", "6 2", "5 6", "2 5", "7 10", "4 7", "10 9", "20 0 15 20 25 30 30 150 35 20"]], "outputs": [["345", "240", "-1"]]} | INTERVIEW | PYTHON3 | CODECHEF | 23,417 | |
a7f53750abb4e2dd03550f11c70455e1 | UNKNOWN | You have been appointed as the designer for your school's computer network.
In total, there are N computers in the class, and M computer-to-computer connections need to be made. Also, there are three mandatory conditions the design should fulfill.
The first requirement is that any computer in the network should be able to communicate with any other computer through the connections, possibly, through some other computers.
Network attacks are possible, so the second requirement is that even if any one computer from the network gets disabled so that the rest of the computers are unable to communicate with it, the rest of the computers can still communicate with each other. In other words, the first requirement still holds for any subset of (N-1) computers.
The third requirement is that there shouldn't be any irrelevant connections in the network. We will call a connection irrelevant if and only if after its' removal, the above two requirements are still held.
Given N, M, please build a network with N computers and M connections, or state that it is impossible.
-----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 and only line of each test case contains a pair of space-separated integers N and M denoting the number of computers and the number of connections.
-----Output-----
Output T blocks.
If it is impossible to construct a network with the given parameters for the corresponding test case, output just -1 -1. Otherwise, output M lines, each of which contains a space-separated pairs of integers denoting the IDs of the computers that should be connected. Note that multiple connections between any pair of computers and connections connecting a computer to itself are implicitly not allowed due to the third requirement.
-----Constraints-----
- 1 ≤ T ≤ 1000
- 1 ≤ M ≤ N * (N - 1) / 2
- 1 ≤ Sum of all N ≤ 1000
- Subtask 1 (21 point): 1 ≤ N ≤ 4
- Subtask 2 (79 points): 1 ≤ N ≤ 100
-----Example-----
Input:2
10 1
5 5
Output:-1 -1
1 2
2 3
3 4
4 5
5 1
-----Explanation-----
Example case 1. There are not enough connections even to satisfy the first requirement.
Example case 2. The obtained network satisfies all the requirements. | ["\n\nimport fractions\nimport sys\n\nf = sys.stdin\n\nif len(sys.argv) > 1:\n f = open(sys.argv[1], \"rt\")\n\n\ndef calc(N, M):\n if M != N:\n return [(-1, -1)]\n r = [(i+1, ((i+1) % N)+1) for i in range(N)]\n return r\n\nT = int(f.readline().strip())\n\nfor case_id in range(1, T+1):\n N, M = list(map(int, f.readline().strip().split()))\n\n rr = calc(N, M)\n\n for a, b in rr:\n print(a, b)\n", "t = int(input())\nfor _ in range(0,t):\n n,m = input().split()\n n,m = int(n),int(m)\n if m!=n:\n print(\"-1 -1\")\n else:\n for i in range(0,n):\n if i+2<=n : print(i+1,i+2)\n else : print(i+1,\"1\")\n", "# EXNETWRK.py\n\nt = int(input())\nfor _ in range(t):\n n,m = list(map(int, input().split()))\n if n == m :\n for i in range(1,n+1):\n print(i,i%n+1)\n else:\n print(-1,-1)\n"] | {"inputs": [["2", "10 1", "5 5"]], "outputs": [["-1 -1", "1 2", "2 3", "3 4", "4 5", "5 1"]]} | INTERVIEW | PYTHON3 | CODECHEF | 794 | |
470150c75369692c34f87d7c3967744b | UNKNOWN | An area named Renus, is divided into $(N \times M)$ cells. According to archaeological survey the area contains huge amount of treasure. Some cells out of $(N \times M)$ cells contain treasure. But problem is, you can't go to every cell as some of the cells are blocked.
For every $a_{ij}$ cell($1 \leq i \leq N$,$1 \leq j \leq M$), your task is to find the distance of the nearest cell having treasure.
Note:
- You can only traverse up, down, left and right from a given cell.
- Diagonal movements are not allowed.
- Cells having treasure can't be blocked, only empty cells ( cells without treasure) can be blocked.
-----Input Format:------
- First line contains $T$, the number of test cases.
- Second line contains two space-separated integers $N\ and\ M$.
- Third line contains a single integer $X$ denoting number of cells having treasures, followed by $X$ lines containing two space-separated integers $x_i$ and $y_i$ denoting position of row and column of $i^{th}$ treasure, for every $1\leq i \leq X$
- The next line contains a single integer $Y$ denoting the number of cells that are blocked, and it is followed by subsequent $Y$ lines containing two space-separated integers $u_i$ and $v_i$ denoting position of row and column of blocked cells , for every $1\leq i \leq Y$
-----Constraints:------
- $1\le T \le 100$
- $1 \le N, M \le 200$
- $1 \le X < N*M$
- $0 \le Y <(N*M) - X$
- $1 \le x_i,u_j \le N, for\ every\ 1 \le i \le X\ and\ 1 \le j \le Y$
- $1 \le y_i,v_j \le M, for\ every\ 1 \le i \le X\ and\ 1 \le j \le Y$
-----Output Format:------
For each test case print a $N \times M$ matrix where each cell consists of distance of nearest treasure. Cells that are blocked will show "$X$" (without quotes). Also cells that doesn't have access to any treasure will show "$-1$" (without quotes).
Note: Co-ordinate of top left cell is $(1,1)$.
-----Sample Input-----
1
3 3
2
1 1
1 3
2
2 1
2 2
-----Sample Output-----
0 1 0
X X 1
4 3 2
-----Explanation:-----
- Coordinates (1,1) and (1,3) shows "0" because they contain treasure and nearest distance is 0.
- Coordinates (2,1) and (2,2) shows "X" as they are blocked.
- Rest shows distance of nearest cell having treasure. | ["t=int(input())\nfor _ in range(t):\n n,m=[int(x) for x in input().split()]\n mat=[]\n ans=[]\n for i in range(n+2):\n l=[]\n p=[]\n for j in range(m+2):\n l.append(0)\n p.append(1000000000)\n mat.append(l)\n ans.append(p)\n y=int(input())\n for i in range(y):\n a,b=[int(x) for x in input().split()]\n mat[a][b]=1\n ans[a][b]=0\n y=int(input())\n for i in range(y):\n a,b=[int(x) for x in input().split()]\n mat[a][b]=1000000000\n ans[a][b]=1000000000\n for i in range(1,n+1):\n for j in range(1,m+1):\n if mat[i][j]==1 or mat[i][j]==1000000000:\n continue\n else:\n ans[i][j]=min(ans[i][j],ans[i][j-1]+1,ans[i-1][j]+1)\n for i in range(n,0,-1):\n for j in range(m,0,-1):\n if mat[i][j] == 1 or mat[i][j] == 1000000000:\n continue\n else:\n ans[i][j]=min(ans[i][j],ans[i+1][j]+1,ans[i][j+1]+1)\n for i in range(1,n+1):\n for j in range(m, 0, -1):\n if mat[i][j] == 1 or mat[i][j] == 1000000000:\n continue\n else:\n ans[i][j] = min(ans[i][j], ans[i - 1][j] + 1, ans[i][j + 1] + 1)\n for i in range(n, 0, -1):\n for j in range(1,m+1):\n if mat[i][j] == 1 or mat[i][j] == 1000000000:\n continue\n else:\n ans[i][j] = min(ans[i][j], ans[i + 1][j] + 1, ans[i][j - 1] + 1)\n for i in range(1,n+1):\n for j in range(1,m+1):\n if mat[i][j]==1 or mat[i][j]==1000000000:\n continue\n else:\n ans[i][j]=min(ans[i][j],ans[i][j-1]+1,ans[i-1][j]+1)\n for i in range(n,0,-1):\n for j in range(m,0,-1):\n if mat[i][j] == 1 or mat[i][j] == 1000000000:\n continue\n else:\n ans[i][j]=min(ans[i][j],ans[i+1][j]+1,ans[i][j+1]+1)\n for i in range(1,n+1):\n for j in range(m, 0, -1):\n if mat[i][j] == 1 or mat[i][j] == 1000000000:\n continue\n else:\n ans[i][j] = min(ans[i][j], ans[i - 1][j] + 1, ans[i][j + 1] + 1)\n for i in range(n, 0, -1):\n for j in range(1,m+1):\n if mat[i][j] == 1 or mat[i][j] == 1000000000:\n continue\n else:\n ans[i][j] = min(ans[i][j], ans[i + 1][j] + 1, ans[i][j - 1] + 1)\n for i in range(1,n+1):\n for j in range(1,m+1):\n if mat[i][j]==1000000000:\n print('X',end=\" \")\n elif ans[i][j]>=1000000000:\n print('-1',end=\" \")\n else:\n print(ans[i][j],end=\" \")\n print()", "import sys\nimport numpy as np\nfrom collections import deque\n\nreadline = lambda : list(map(int, sys.stdin.readline().replace(\"\\n\", \"\").split(\" \")))\n\n(T,) = readline()\n\ndef run():\n N, M = readline()\n grid = np.full((N, M), -1)\n queue = deque()\n \n (X,) = readline()\n for _ in range(X):\n (x, y) = readline()\n (x, y) = (x-1, y-1)\n queue.append((x, y))\n grid[x, y] = 0\n \n (Y,) = readline()\n for _ in range(Y):\n (x, y) = readline()\n (x, y) = (x-1, y-1)\n grid[x, y] = -2\n \n while(len(queue) > 0):\n (x,y) = queue.popleft()\n #print('Propagate', (x+1,y+1), '; d =', grid[x,y])\n for (u, v) in [(x-1, y), (x+1, y), (x,y-1), (x,y+1)]:\n if u < 0 or v < 0 or u >= N or v >= M:\n continue\n if grid[u, v] == -1:\n grid[u, v] = grid[x, y] + 1\n queue.append((u, v))\n \n val = lambda x : str(x) if x != -2 else 'X'\n \n for i in range(N):\n print(' '.join(val(grid[i, j]) for j in range(M)))\n \nfor _ in range(T):\n run()\n"] | {"inputs": [["1", "3 3", "2", "1 1", "1 3", "2", "2 1", "2 2"]], "outputs": [["0 1 0", "X X 1", "4 3 2"]]} | INTERVIEW | PYTHON3 | CODECHEF | 3,181 | |
5d7b90caf219b230bfaa741a92781d97 | UNKNOWN | The chef was playing with numbers and he found that natural number N can be obtained by sum various unique natural numbers, For challenging himself chef wrote one problem statement, which he decided to solve in future.
Problem statement: N can be obtained as the sum of Kth power of integers in multiple ways, find total number ways?
After that Cheffina came and read what chef wrote in the problem statement, for having some fun Cheffina made some changes in the problem statement as.
New problem statement: N can be obtained as the sum of Kth power of unique +ve integers in multiple ways, find total number ways?
But, the chef is now confused, how to solve a new problem statement, help the chef to solve this new problem statement.
-----Input:-----
- First-line will contain $T$, the number of test cases. Then the test cases follow.
- Each test case contains a single line of input, two integers $N, K$.
-----Output:-----
For each test case, output in a single line answer to the problem statement.
-----Constraints-----
- $1 \leq T \leq 10$
- $1 \leq N \leq 1000$
- $1 \leq K \leq 6$
-----Sample Input:-----
2
4 1
38 2
-----Sample Output:-----
2
1
-----EXPLANATION:-----
For 1) 4 can be obtained by as [ 4^1 ], [1^1, 3^1], [2^1, 2^1]. (here ^ stands for power)
But here [2^1, 2^1] is not the valid way because it is not made up of unique +ve integers.
For 2) 38 can be obtained in the way which is [2^2, 3^2, 5^2] = 4 + 9 + 25 | ["for _ in range(int(input())):\n x,n = map(int,input().split())\n reach = [0]*(x+1)\n reach[0] = 1\n i=1\n while i**n<=x:\n j = 1\n while j+i**n<=x:\n j+=1\n j-=1\n while j>=0:\n if reach[j]>0:\n reach[j+i**n]+=reach[j]\n j-=1\n i+=1\n #print(reach)\n print(reach[-1])", "for _ in range(int(input())):\n x,n = map(int,input().split())\n reach = [0]*(x+1)\n reach[0] = 1\n i=1\n while i**n<=x:\n j = 1\n while j+i**n<=x:\n j+=1\n j-=1\n while j>=0:\n if reach[j]>0:\n reach[j+i**n]+=reach[j]\n j-=1\n i+=1\n #print(reach)\n print(reach[-1])"] | {"inputs": [["2", "4 1", "38 2"]], "outputs": [["2", "1"]]} | INTERVIEW | PYTHON3 | CODECHEF | 750 | |
731161549b35908ec23ecfac97473410 | UNKNOWN | Mohit's girlfriend is playing a game with Nicky. The description of the game is as follows:
- Initially on a table Player 1 will put N gem-stones.
- Players will play alternatively, turn by turn.
- At each move a player can take at most M gem-stones (at least 1 gem-stone must be taken) from the available gem-stones on the table.(Each gem-stone has same cost.)
- Each players gem-stone are gathered in player's side.
- The player that empties the table purchases food from it (using all his gem-stones; one gem-stone can buy one unit of food), and the other one puts all his gem-stones back on to the table. Again the game continues with the "loser" player starting.
- The game continues until all the gem-stones are used to buy food.
- The main objective of the game is to consume maximum units of food.
Mohit's girlfriend is weak in mathematics and prediction so she asks help from Mohit, in return she shall kiss Mohit. Mohit task is to predict the maximum units of food her girlfriend can eat, if, she starts first. Being the best friend of Mohit, help him in predicting the answer.
-----Input-----
- Single line contains two space separated integers N and M.
-----Output-----
- The maximum units of food Mohit's girlfriend can eat.
-----Constraints and Subtasks-----
- 1 <= M <= N <= 100
Subtask 1: 10 points
- 1 <= M <= N <= 5
Subtask 2: 20 points
- 1 <= M <= N <= 10
Subtask 3: 30 points
- 1 <= M <= N <= 50
Subtask 3: 40 points
- Original Constraints.
-----Example-----
Input:
4 2
Output:
2 | ["r=[0,1,1,2,1,4,2,6,1,8,4]\n\nn,m=[int(x) for x in input().split()]\nif m==1:\n while n%2!=1:\n n=n/2\n if n==1:\n print(1)\n else: \n print(n-1) \nelif (n+1)/2<m:\n print(m)\nelse:\n print(n-m)\n\n \n", "\nn,m=[int(x) for x in input().split()]\nif m==1:\n while n%2!=1:\n n=n/2\n if n==1:\n print(1)\n else: \n print(n-1) \nelif (n+1)/2<=m:\n print(m)\nelse:\n print(n-m)", "r=[0,1,1,2,1,4,2,6,1,8,4]\n\nn,m=[int(x) for x in input().split()]\nif m==1:\n print(r[n])\nelif (n+1)/2<=m:\n print(m)\nelse:\n print(n-m)\n\n \n", "n,m=[int(x) for x in input().split()]\nif n==m:\n print(n)\nelif n-1==m:\n print(m)\nelif m==1:\n if n==3:\n print(2)\n elif n==4:\n print(1)\n elif n==5:\n print(4)\nelif m==2:\n if n==4:\n print(2)\n elif n==5:\n print(3)\nelif m==3:\n if n==5:\n print(3)\n", "read = lambda: list(map(int, input().split()))\nread_s = lambda: list(map(str, input().split()))\n\nn, m = read()\nans = 0\nif n == m:\n print(n)\n return\nwhile n > 0:\n if n > m:\n ans += m\n n -= 2*m\n else:\n ans += 1\n n -= 2\nprint(ans)", "read = lambda: list(map(int, input().split()))\nread_s = lambda: list(map(str, input().split()))\n\nn, m = read()\nans = 0\nwhile n > 0:\n if n > m:\n ans += m\n n -= 2*m\n else:\n ans += 1\n n -= 2\nprint(ans)", "read = lambda: list(map(int, input().split()))\nread_s = lambda: list(map(str, input().split()))\n\nn, m = read()\nans = 0\nwhile True:\n if n > m:\n ans += m\n n -= 2*m\n else: break\nprint(ans)", "n,m = list(map(int,input().split()))\nl = [ [1],\n [1,2],\n [2,2,3],\n [1,2,3,4],\n [4,3,3,4,5] ]\nprint(l[n-1][m-1])"] | {"inputs": [["4 2"]], "outputs": [["2"]]} | INTERVIEW | PYTHON3 | CODECHEF | 1,596 | |
364ab3240aeb6f50178200cced3e8d87 | UNKNOWN | The Head Chef is receiving a lot of orders for cooking the best of the problems lately. For this, he organized an hiring event to hire some talented Chefs. He gave the following problem to test the skills of the participating Chefs. Can you solve this problem and be eligible for getting hired by Head Chef.
A non-negative number n is said to be magical if it satisfies the following property. Let S denote the multi-set of numbers corresponding to the non-empty subsequences of the digits of the number n in decimal representation. Please note that the numbers in the set S can have leading zeros. Let us take an element s of the multi-set S, prod(s) denotes the product of all the digits of number s in decimal representation.
The number n will be called magical if sum of prod(s) for all elements s in S, is even.
For example, consider a number 246, its all possible non-empty subsequence will be S = {2, 4, 6, 24, 46, 26, 246}. Products of digits of these subsequences will be {prod(2) = 2, prod(4) = 4, prod(6) = 6, prod(24) = 8, prod(46) = 24, prod(26) = 12, prod(246) = 48, i.e. {2, 4, 6, 8, 24, 12, 48}. Sum of all of these is 104, which is even. Hence 246 is a magical number.
Please note that multi-set S can contain repeated elements, e.g. if number is 55, then S = {5, 5, 55}. Products of digits of these subsequences will be {prod(5) = 5, prod(5) = 5, prod(55) = 25}, i.e. {5, 5, 25}. Sum of all of these is 35 which is odd. Hence 55 is not a
magical number.
Consider a number 204, then S = {2, 0, 4, 20, 04, 24, 204}. Products of digits of these subsequences will be {2, 0, 4, 0, 0, 8, 0}. Sum of all these elements will be 14 which is even. So 204 is a magical number.
The task was to simply find the Kth magical number.
-----Input-----
- First line of the input contains an integer T denoting the number of test cases.
- Each of the next T lines contains a single integer K.
-----Output-----
For each test case, print a single integer corresponding to the Kth magical number.
-----Constraints-----
- 1 ≤ T ≤ 105
- 1 ≤ K ≤ 1012.
-----Subtasks-----
Subtask #1 : (20 points)
- 1 ≤ T ≤ 100
- 1 ≤ K ≤ 104.
Subtask 2 : (80 points) Original Constraints
-----Example-----
Input:
2
2
5
Output:
2
8
-----Explanation-----
Example case 1.
2 is the 2nd magical number, since it satisfies the property of the magical number. The first magical number will be of course 0. | ["def base5(n):\n if n == 0: return\n for x in base5(n // 5): yield x\n yield n % 5\n\ndef seq(n):\n return int(''.join(str(2 * x) for x in base5(n)) or '0')\n\nfor i in range(eval(input())):\n k=eval(input())\n while(i<k):\n i=i+1\n print(seq(i-1))\n", "a=list()\nl=list()\nc=0\nt=eval(input())\nfor i in range(0,t):\n\tk=eval(input())\n\tif(k<=len(a)):\n\t\tprint(a[k-1])\n\telse:\n\t\twhile(len(a)!=k):\n\t\t\tl=list(map(int,str(c)))\n\t\t\tflag=0\n\t\t\t\n\t\t\tfor j in range(0,len(l)):\n\t\t\t\tif(l[j]%2!=0):\n\t\t\t\t\tflag=1\n\t\t\t\t\tbreak\n\n\t\t\tif(flag==0):\n\t\t\t\ta.append(c)\n\t\t\t\tc=c+2\n\t\t\telse:\n\t\t\t\tx=10**(len(l)-j-1)\n\t\t\t\tc=c+x\n\n\t\tprint(a[k-1])", "a=list()\nl=list()\nc=0\nt=eval(input())\nfor i in range(0,t):\n\tk=eval(input())\n\tif(k<=len(a)):\n\t\tprint(a[k-1])\n\telse:\n\t\twhile(len(a)!=k):\n\t\t\tl=list(map(int,str(c)))\n\t\t\tflag=0\n\t\t\t\n\t\t\tfor j in range(0,len(l)):\n\t\t\t\tif(l[j]%2!=0):\n\t\t\t\t\tflag=1\n\t\t\t\t\tbreak\n\n\t\t\tif(flag==0):\n\t\t\t\ta.append(c)\n\t\t\t\tc=c+2\n\t\t\telse:\n\t\t\t\tx=10**(len(l)-j-1)\n\t\t\t\tc=c+x\n\n\t\tprint(a[k-1])", "import math\ndef answer(n):\n n-=1\n if n>0:\n a=int(math.log(n,5))\n else:\n a=0\n total=0\n while a!=0:\n x=math.pow(5,a)\n g=n//x\n n=int(n%x)\n total+=2*math.pow(10,a)*g\n if n>0:\n a=int(math.log(n,5))\n else:\n a=0\n total+=2*(n)\n total=int(total)\n return total\nT=int(input(''))\nwhile T:\n T-=1\n n=int(input(''))\n print(answer(n))\n", "a=list()\nl=list()\nc=0\nt=eval(input())\nfor i in range(0,t):\n\tk=eval(input())\n\tif(k<=len(a)):\n\t\tprint(a[k-1])\n\telse:\n\t\twhile(len(a)!=k):\n\t\t\tl=list(map(int,str(c)))\n\t\t\tflag=0\n\t\t\tif(l[0]%2==0):\n\t\t\t\tfor j in range(0,len(l)):\n\t\t\t\t\tif(l[j]%2!=0):\n\t\t\t\t\t\tflag=1\n\t\t\t\t\t\tbreak\n\n\t\t\telse:\n\t\t\t\tflag=1\n\n\t\t\tif(flag==0):\n\t\t\t\ta.append(c)\n\t\t\tx=10**(len(l)-1)\n\t\t\tif(l[0]%2==0):\n\t\t\t\tc=c+2\n\t\t\telse:\n\t\t\t\tc=c+x\n\n\t\tprint(a[k-1])", "def str_base(number, base):\n (d,m) = divmod(number,len(base))\n if d > 0:\n return str_base(d,base)+base[m]\n return base[m]\n\nfor _ in range(int(eval(input()))):\n\tn = int(eval(input()))\n\tprint(str_base(n-1,'02468')) ", "a=list()\nl=list()\nc=0\nt=eval(input())\nfor i in range(0,t):\n\tk=eval(input())\n\tif(k<=len(a)):\n\t\tprint(a[k-1])\n\telse:\n\t\twhile(len(a)!=k):\n\t\t\tl=list(map(int,str(c)))\n\t\t\tflag=0\n\t\t\tfor j in range(0,len(l)):\n\t\t\t\tif(l[j]%2!=0):\n\t\t\t\t\tflag=1\n\t\t\t\t\tbreak\n\n\t\t\tif(flag==0):\n\t\t\t\ta.append(c)\n\t\t\tc=c+2\n\n\t\tprint(a[k-1])", "a=list()\nl=list()\nc=0\nt=eval(input())\nfor i in range(0,t):\n\tk=eval(input())\n\tif(k<=len(a)):\n\t\tprint(a[k-1])\n\telse:\n\t\twhile(len(a)!=k):\n\t\t\tl=list(map(int,str(c)))\n\t\t\tflag=0\n\t\t\tfor j in range(0,len(l)):\n\t\t\t\tif(l[j]%2!=0):\n\t\t\t\t\tflag=1\n\t\t\t\t\tbreak\n\n\t\t\tif(flag==0):\n\t\t\t\ta.append(c)\n\t\t\tc=c+2\n\n\t\tprint(a[k-1])", "def base5(n):\n if n == 0: return\n for x in base5(n // 5): yield x\n yield n % 5\n\ndef seq(n):\n return int(''.join(str(2 * x) for x in base5(n)) or '0')\nt=eval(input())\nfor i in range(t):\n k=eval(input())\n print(seq(k-1))\n", "import math\nt = eval(input())\nfor i in range(0,t):\n\tK = int(input())\n\tans = []\n\tarr = [8,0,2,4,6]\n\ttemp = 1\n\ti = 0\n\twhile(temp > 0):\n\t\tk = arr[int(math.ceil(K/math.pow(5,i)))%5]\n\t\ti = i + 1\n\t\ttemp = math.floor(float(K-1)/math.pow(5,i))\n\t\tans.append(str(k))\n\tans.reverse();\n\tprint(''.join(ans))", "test = eval(input())\n\nfor i in range(test):\n\tpowOf5 = 762939453125\n\tcoeff = 200000000000000000\n\tsum_ = 0;\n\tx = eval(input())\n\twhile(x>25):\n\t\tif(x%powOf5):\t\t\t# not 0\n\t\t\tsum_ += (x/powOf5)*coeff\n\t\t\tx %= powOf5\n\t\t\tpowOf5 /= 5\n\t\telse:\n\t\t\tsum_ += coeff*((x-1)/powOf5)\n\t\t\tx = powOf5\n\t\t\tpowOf5/=5\n\t\tcoeff /= 10\n\t\t\n\t\t#print str(sum_) + ' ' + str(powOf5) + ' ' + str(coeff) \n\tmod = x%5\n\tif mod ==0:\n\t\tmod = 5\n\n\tsum_ += (x-mod)*4 + (mod-1)*2\n\n\tprint(sum_)\n\n", "def cheffun(k):\n return 10 * cheffun(k // 5) + (k % 5) * 2 if k else 0\ng=eval(input())\nwhile (g>0):\n a=eval(input())\n k=a-1\n print(cheffun(k))\n g=g-1", "def sort(d):\n\tif d==0:\n\t\treturn 1\n\tif d==1:\n\t\treturn 2\n\tif d==2:\n\t\treturn 3\n\ndef sort1(s,e):\n\tif s<e:\n\t\tp=s*e\n\treturn p\n\ndef function1(a):\n if a == 0: \n \treturn\n for b in function1(a // 5): \n \tyield b\n c=a%5\n yield c\n\ndef function(m):\n\t#d=2*c\n return int(''.join(str(2 * c) for c in function1(m)) or '0')\n\nt=eval(input())\nwhile t>0:\n\tn=eval(input())\n\ta=0\n\tm=1\n\tp=0\n\tq=0\n\tr=0\n\tif m==1:\n\t\tp=1\n\t\tm=m+1\n\tif m==2:\n\t\tq=1\n\t\tm=m+1\n\tif m==3:\n\t\tr=1\n\t\tm=m+1\n\tif n==1:\n\t\tprint(a)\n\telse:\n\t\tprint(function(n-1))\n\tt=t-1\nml= [1,5,7,9]\ns=0\t\np=ml[s]\nl=r+1\nr=e=0\nd= False\nte=ml[s]\nml[s]=ml[r]\nml[r]=te\n\n"] | {"inputs": [["2", "2", "5", "", ""]], "outputs": [["2", "8"]]} | INTERVIEW | PYTHON3 | CODECHEF | 5,074 | |
98e2ddde9e8e18f2ea4d1b775f5cf4cf | UNKNOWN | Chef's younger brother is in town. He's a big football fan and has a very important match to watch tonight. But the Chef wants to watch the season finale of MasterChef which will be aired at the same time. Now they don't want to fight over it like they used to when they were little kids. They want to decide it in a fair way. So they agree to play a game to make a decision. Their favourite childhood game!
The game consists of C boards. Each board i is a grid of dimension ni x mi.
Rules of the game:
- A coin is placed at (1,1) on every board initially.
- Each one takes a turn alternatively.
- In one turn, a player can choose any one board and move a coin from a cell (i,j) to one of the following cells:
(i+1,j) OR (i+2,j) OR (i,j+1) OR (i,j+2) OR (i+1,j+1) OR (i+2,j+2).
- A coin cannot be moved out of the board at any point during the game.
- A coin cannot be moved once it reaches the cell (n,m) where n and m are the dimensions of the board of that coin.
- A player MUST make one valid move.
- The player who makes the last move gets to watch TV.
Both of them are passionate about their interests and want to watch their respective shows. So they will obviously make optimal moves in every turn. The Chef, being the elder brother, takes the first turn.
Your task is to predict which show they will be watching tonight.
-----Input:-----
The first line of input contains a single integer T, the number of test cases. T tests follow.Each test case starts with a single line containing C, the number of boards in the game.
Then follow C lines: each containing 2 integers ni and mi, the dimensions of the ith board.
-----Output:-----
Given the number and dimensions of boards, for each test case, output in a single line: "MasterChef" if the Chef wins or "Football" if his brother wins.
-----Constraints:-----
1<=T<=10000
1<=C<=20
2<=ni,mi<=1000
-----Example:-----Input:
1
1
2 2
Output:
MasterChef
Explanation:
The Chef can move the coin on the board from (1,1)->(2,2). This coin cannot be moved any further. And so, the Chef wins.
Notice that if the Chef moves it to any other valid position, i.e. either to (1,2) or (2,1) he will lose! | ["res=\"\"\nfor _ in range(int(input())):\n ans=0\n c=int(input())\n for i in range(c):\n n,m=list(map(int,input().split( )))\n ans^=(n+m-2)%3\n if ans:\n res+=\"MasterChef\\n\"\n else:\n res+=\"Football\\n\"\nprint(res)\n \n \n", "for _ in range(int(input())):\n ans=0\n c=int(input())\n for i in range(c):\n n,m=list(map(int,input().split( )))\n ans^=(n+m-2)%3\n if ans:\n print(\"MasterChef\")\n else:\n print(\"Football\")\n \n", "for _ in range(int(input())):\n ans=0\n c=int(input())\n for i in range(c):\n n,m=list(map(int,input().split( )))\n ans^=(n+m-2)%3\n if not ans:\n print(\"Football\")\n else:\n print(\"MasterChef\")\n \n", "st=''\nfor _ in range(int(input())):\n x=0\n for c in range(int(input())):\n n,m=map(int,input().split())\n g=(m+n-2)%3\n x=x^g\n if x:\n ans=(\"MasterChef\")\n else:\n ans=(\"Football\")\n st+=ans+'\\n'\nprint(st)", "for _ in range(int(input())):\n x=0\n for c in range(int(input())):\n n,m=map(int,input().split())\n g=(m+n-2)%3\n x=x^g\n if x:\n print(\"MasterChef\")\n else:\n print(\"Football\")"] | {"inputs": [["1", "1", "2 2"]], "outputs": [["MasterChef"]]} | INTERVIEW | PYTHON3 | CODECHEF | 1,070 | |
f5d3b83dd8dd43b09d4c725569252de5 | UNKNOWN | Chef likes problems related to learning new languages. He only knows first N letters of English alphabet. Also he explores all M-letter words formed by the characters he knows. Define cost for a given M-letter word S, cost(S) = P1, S1+P2, S2+...+PM, SM, where Pi, j is i, jth entry of matrix P. Sort all the words by descending cost, if costs are equal, sort them lexicographically. You need to find K-th M-letter word in Chef's order.
-----Input-----
First line contains three positive integer numbers N, M and K.
Next M lines contains N integers per line, denoting the matrix P.
-----Output-----
Output in a single line K-th M-letter in Chef's order.
-----Constraints-----
- 1 ≤ N ≤ 16
- 1 ≤ M ≤ 10
- 1 ≤ K ≤ NM
- 0 ≤ Pi, j ≤ 109
-----Subtasks-----
- Subtask #1: (20 points) 1 ≤ K ≤ 10000
- Subtask #2: (20 points) 1 ≤ M ≤ 5
- Subtask #3: (60 points) Original constraints
-----Example-----
Input:2 5 17
7 9
13 18
10 12
4 18
3 9
Output:aaaba | ["def dfs(ind,m,n,k):\n if(ind == m):\n return [\"\"]\n else:\n temp = dfs(ind+1,m,n,k)\n ans = []\n if(len(temp)<k):\n for i in temp:\n for j in range(97,97+n):\n ans += [chr(j)+i]\n else:\n for i in temp:\n ans += [\"z\"+i]\n return ans\nn,m,k = list(map(int,input().split()))\np = []\nmr= []\nfor _ in range(m):\n inp = [int(x) for x in input().split()]\n mc = inp[0]\n mi = 0\n for j in range(1,n):\n if(mc<inp[j]):\n mc = inp[j]\n mi = j\n p += [inp]\n mr += [mi]\nans = dfs(0,m,n,k)\nw = []\nfor i in ans:\n cst = 0\n s = \"\"\n for j in range(m):\n if(i[j]!=\"z\"):\n s+=i[j]\n cst += p[j][ord(i[j])-97]\n else:\n s += chr(mr[j]+97)\n w += [(-cst,s)]\nw.sort()\nprint(w[k-1][1])\n", "def dfs(ind,m,n,k):\n if(ind == m):\n return [\"\"]\n else:\n temp = dfs(ind+1,m,n,k)\n ans = []\n if(len(temp)<k):\n for i in temp:\n for j in range(97,97+n):\n ans += [chr(j)+i]\n else:\n for i in temp:\n ans += [\"z\"+i]\n return ans\nn,m,k = list(map(int,input().split()))\np = []\nfor _ in range(m):\n inp = [int(x) for x in input().split()]\n p += [inp]\nmax_row = []\nfor i in p:\n max_row += [max(i)]\nans = dfs(0,m,n,k)\nw = []\nfor i in ans:\n cst = 0\n for j in range(m):\n if(p[j]!=\"z\"):\n cst += p[j][ord(i[j])-97]\n else:\n cst += max_row[j]\n w += [(-cst,i)]\nw.sort()\nprint(w[k-1][1])\n", "def dfs(ind,m,n):\n if(ind == m):\n return [\"\"]\n else:\n temp = dfs(ind+1,m,n)\n ans = []\n for i in temp:\n for j in range(97,97+n):\n ans += [chr(j)+i]\n return ans\nn,m,k = list(map(int,input().split()))\np = []\nfor _ in range(m):\n inp = [int(x) for x in input().split()]\n p += [inp]\nans = dfs(0,m,n)\nw = []\nfor i in ans:\n cst = 0\n for j in range(m):\n cst += p[j][ord(i[j])-97]\n w += [(-cst,i)]\nw.sort()\nprint(w[k-1][1])\n", "n, m, k = list(map(int, input().split()))\ncost = []\nfor i in range(m):\n cost.append(list(map(int, input().split())))\n\nif (m<=5):\n c = 97\n s = []\n for i in range(n):\n s.append(chr(c+i))\n l = []\n def gen(x, c, ln):\n #print x, c, ln\n if (ln >= m):\n l.append((c, x))\n else:\n for i in range(n):\n xt = x+s[i]\n ct = c+cost[ln][ord(s[i])-97]\n gen(xt, ct, ln+1)\n gen('',0, 0)\n l.sort(reverse = True)\n print(l[k-1][1])"] | {"inputs": [["2 5 17", "7 9", "13 18", "10 12", "4 18", "3 9"]], "outputs": [["aaaba"]]} | INTERVIEW | PYTHON3 | CODECHEF | 2,260 | |
071de1ceb67d6533fab1ca936b11ace3 | UNKNOWN | There is a universal library, where there is a big waiting room with seating capacity for maximum $m$ people, each of whom completes reading $n$ books sequentially. Reading each book requires one unit of time.
Unfortunately, reading service is provided sequentially. After all of the $m$ people enter the library, the entrance gate is closed. There is only one reading table. So when someone reads, others have to wait in the waiting room.
At first everybody chooses $n$ books they want to read. It takes $x$ amount of time. People can choose books simultaneously. Then they enter the waiting room. After reading $n$ books the person leaves the library immediately.
As nothing is free, the cost of reading is also not free. If a person stays in the library $t$ units of time then the cost of reading is $\left \lfloor \frac{t-n}{m} \right \rfloor$ units of money. So, the $i^{th}$ person pays for time $x$ he needs to choose books and the time $(i-1)*n$ he needs to wait for all the persons before him to complete reading.
Note: $\left \lfloor a \right \rfloor$ denotes the floor($a$).
-----Input-----
- Each case contains three space-separated positive integers $n$, $m$ and $x$ where $n, x \leq 1000$ and $m \leq 10^{15}$.
- End of input is determined by three zeros.
- There are no more than 1000 test cases.
-----Output-----
- For each case, output in a single line the total unit of money the library gets in that day.
-----Sample Input-----
1 100 9
11 2 10
12 2 11
0 0 0
-----Sample Output-----
9
15
16
-----Explanation:-----
Testcase 2: Here, $n=11$, $m=2$, $x=10$.
For 1st person,
$t=21$ and he/she gives $\left \lfloor \frac{21-11}{2} \right \rfloor = 5$ units of money.
For 2nd person,
$t=32$ and he/she gives $\left \lfloor \frac{32-11}{2} \right \rfloor= 10$ units of money.
So, total units of money $= 5+10 = 15$ | ["while(True):\n \n n, m, x = map(int, input().split())\n\n if(n==0 and m==0 and x==0): \n break\n \n \n money=0\n for i in range(n):\n \n money=money + (x+m*i)//n \n print(money) ", "# cook your dish here\nfrom math import gcd\ndef abc(n, a, d):return n*(2*a + (n-1) * d)//2\nwhile True:\n n, m, x = map(int, input().split())\n if m==n==x==0:break\n c = gcd(n, m);l = m//c\n print((abc(m, x, n)-c*abc(l, x % c, c))//m)", "from math import gcd\ndef abc(n, a, d):return n*(2*a + (n-1) * d)//2\nwhile True:\n n, m, x = map(int, input().split())\n if m==n==x==0:break\n c = gcd(n, m);l = m//c\n print((abc(m, x, n)-c*abc(l, x % c, c))//m)", "while True:\n n, m, x = list(map(int, input().split()))\n if n == m == x == 0:\n break\n\n y = 0\n for i in range(n):\n y+=((m*i+x)//n)\n print(y)\n\n\n", "while True:\n\n n,m,x = list(map(int,input().split()))\n\n if n == m == x == 0:\n break\n cost = 0\n for i in range(n):\n cost+=((m*i+x)//n)\n print(cost)\n", "def gcd(a,b):\n if b==0:return a\n return gcd(b,a%b)\ndef abc(n, a, d):\n return n*(2*a + (n-1) * d)//2\nwhile 1:\n n, m, x = map(int, input().split())\n if m==n==x==0:break\n c = gcd(n, m)\n l = m//c\n ans = (abc(m, x, n)-c*abc(l, x % c, c))//m\n print(ans)", "while True:\n\n n,m,x = list(map(int,input().split()))\n\n if n == m == x == 0:\n break\n cost = 0\n for i in range(n):\n cost+=((m*i+x)//n)\n print(cost)\n", "\nwhile True:\n\n n,m,x = list(map(int,input().split()))\n\n if n == m == x == 0:\n break\n cost = 0\n for i in range(n):\n cost+=((m*i+x)//n)\n print(cost)\n", "while(1) :\n n, m, x = map(int, input().split()) \n if (n == 0 and m == 0 and x == 0) :\n break\n cost= 0 \n for j in range(n) :\n cost+= (x + j*m)//n\n print(cost)", "n,m,x=map(int,input().split())\nwhile(n!=0 and m!=0 and x!=0):\n i=0\n s=0\n while(i<n):\n s+=(x+i*(m))//n\n i+=1\n print(s)\n n,m,x=map(int,input().split())", "import math\n\ndef main():\n while True:\n n, m, x = map(int, (input().split()) )\n # print(\"n, m, x = \", n, m, x)\n\n if(n==0 and m==0 and x==0):\n break\n\n k = int(1)\n l = int(0)\n r = int(0)\n\n ans = 0\n while True :\n l = (m*k-x+n-1)//n\n l = int(l)\n r = (m*(k+1)-x+n-1)//n\n r -= 1\n r = int(r)\n # print(\"l, r, k = \", l, r, k)\n if l>=m:\n break\n if l<0:\n l = 0\n if r>=m:\n r = m-1\n if l>r:\n k += 1\n continue\n # print(\"Adding to answer\")\n ans += (r-l+1)*k;\n k += 1\n ans = int(ans)\n print(str(ans))\n\nmain()", "def __starting_point():\n while(True):\n n,m,x=map(int,input().split())\n if(n==0 and m==0 and x==0):\n break\n sum=0\n for i in range(n):\n sum+=(x+i*m)//n\n print(sum)\n__starting_point()", "def main():\n while True:\n n, m, x = map(int, input().split())\n if [n, m, x] == [0, 0, 0]:\n break\n \n ans = 0\n for k in range(1111):\n l = ((k * m - x + n - 1) // n)\n r = ((((k + 1) * m - x + n - 1) //n) - 1)\n \n l = max(l, 0)\n r = min(r, m - 1)\n \n if l < m and 0 <= r and l <= r:\n ans += k * (r - l + 1)\n \n print(ans)\n \nmain()", "def main():\n while True:\n n, m, x = map(int, input().split())\n if [n, m, x] == [0, 0, 0]:\n break\n \n ans = 0\n for k in range(1112):\n l = ((k * m - x + n - 1) // n)\n r = ((((k + 1) * m - x + n - 1) //n) - 1)\n \n l = max(l, 0)\n r = min(r, m - 1)\n \n if l < m and 0 <= r and l <= r:\n ans += k * (r - l + 1)\n \n print(ans)\n \nmain()", "import sys\ninput=sys.stdin.readline\n\ndef main():\n while True:\n n, m, x = map(int, input().split())\n if [n, m, x] == [0, 0, 0]:\n break\n \n ans = 0\n for k in range(1112):\n l = ((k * m - x + n - 1) // n)\n r = ((((k + 1) * m - x + n - 1) //n) - 1)\n \n l = max(l, 0)\n r = min(r, m - 1)\n \n if l < m and 0 <= r and l <= r:\n ans += k * (r - l + 1)\n \n print(ans)\n \nmain()", "while True:\n n,m,x=input().split()\n n=int(n)\n m=int(m)\n x=int(x)\n if n==0:\n break\n s=((2*x+(m-1)*n)*m)//2\n a=x%m\n b=n%m\n curr=0\n if b==0:\n s=s-(a*m)\n curr=m\n while curr<m:\n t=(m-a)//b;\n if a+t*b>=m:\n t-=1\n t=min(t,m-curr-1)\n s=s-((2*a+t*b)*(t+1))//2\n curr+=t+1\n a=(a+(t+1)*b)%m\n print(int(s//m))\n if n==0:\n break", "while(True) :\n n, m, x = map(int, input().split()) \n if (n == 0 and m == 0 and x == 0) :\n break\n sum = 0 \n for i in range(n) :\n sum += (x + i*m)//n\n print(sum)", "while True:\n n, m, x = [int(x) for x in input().split()]\n if n==m==x==0: break\n ans = 0\n for i in range(1,n+1):\n ans += (x+(i-1)*m)//n\n print(ans)", "from math import gcd\n\ndef sum(a,d,n):\n return n*(2*a + (n-1) * d)//2\n\nwhile True:\n n, m, x = map(int, input().split())\n if m is 0:\n break\n hcf = gcd(n, m)\n f = m//hcf\n ans = (sum(x, n, m) - hcf * sum(x%hcf, hcf, f))//m\n print(ans)", "from math import gcd\n\ndef sap(n, a, d):\n return n*(2*a + (n-1) * d)//2\n\nwhile True:\n n, m, x = map(int, input().split())\n if m is 0:\n break\n c = gcd(n, m)\n l = m//c\n ans = (sap(m, x, n) - c * sap(l, x % c, c))//m\n print(ans)", "from math import gcd\n\ndef sap(n, a, d):\n return n*(2*a + (n-1) * d)//2\n\nwhile True:\n n, m, x = list(map(int, input().split()))\n if m is 0:\n break\n c = gcd(n, m)\n l = m//c\n ans = (sap(m, x, n) - c * sap(l, x % c, c))//m\n print(ans)\n"] | {"inputs": [["1 100 9", "11 2 10", "12 2 11", "0 0 0"]], "outputs": [["9", "15", "16"]]} | INTERVIEW | PYTHON3 | CODECHEF | 5,258 | |
249be4878ad74942ead079f24b79785c | UNKNOWN | Once again, we have a lot of requests from coders for a challenging problem on geometry. Geometry expert Nitin is thinking about a problem with parabolas, icosahedrons, crescents and trapezoids, but for now, to encourage beginners, he chooses to work with circles and rectangles.
You are given two sequences $A_1, A_2, \ldots, A_N$ and $B_1, B_2, \ldots, B_N$. You should choose a permutation $P_1, P_2, \ldots, P_N$ of the integers $1$ through $N$ and construct $N$ rectangles with dimensions $A_1 \times B_{P_1}, A_2 \times B_{P_2}, \ldots, A_N \times B_{P_N}$. Then, for each of these rectangles, you should construct an inscribed circle, i.e. a circle with the maximum possible area that is completely contained in that rectangle.
Let $S$ be the sum of diameters of these $N$ circles. Your task is to find the maximum value of $S$.
-----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 one integer ― the maximum value of $S$. It is guaranteed that this value is always an integer.
-----Constraints-----
- $1 \le T \le 50$
- $1 \le N \le 10^4$
- $1 \le A_i, B_i \le 10^9$ for each valid $i$
-----Subtasks-----
Subtask #1 (20 points):
- $A_1 = A_2 = \ldots = A_N$
- $B_1 = B_2 = \ldots = B_N$
Subtask #2 (80 points): original constraints
-----Example Input-----
2
4
8 8 10 12
15 20 3 5
3
20 20 20
10 10 10
-----Example Output-----
30
30
-----Explanation-----
Example case 1: Four rectangles with dimensions $8 \times 3$, $8 \times 5$, $10 \times 20$ and $12 \times 15$ lead to an optimal answer. | ["for _ 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 s=0\n for i in range(n):\n s+=min(a[i],b[i])\n print(s)", "for t in range(int(input())):\n n = int(input())\n A = sorted(list(map(int, input().split())))\n B = sorted(list(map(int, input().split())))\n s = 0\n for i in range(n):\n s = s+min(A[i],B[i])\n print(s)\n", "t=int(input())\nwhile t:\n n=int(input())\n a=[int (o) for o in input().split()]\n b=[int (o) for o in input().split()]\n a.sort()\n b.sort()\n s=0\n if a[0]==a[n-1] and b[0]==b[n-1]:\n print(n*min(a[0],b[0]))\n else:\n for i in range(n):\n s+=min(a[i],b[i])\n print(s)\n t-=1\n", "t=int(input())\nwhile t:\n n=int(input())\n a=[int (o) for o in input().split()]\n b=[int (o) for o in input().split()]\n a.sort()\n b.sort()\n if a[0]==a[n-1] and b[0]==b[n-1]:\n print(n*min(a[0],b[0]))\n t-=1\n", "import itertools\nt=int(input())\nfor i in range(t):\n n=int(input())\n a=list(map(int,input().split()))\n a.sort()\n b=list(map(int,input().split()))\n b.sort()\n s=0\n for (f,g) in zip(a,b):\n s+=min(f,g)\n print(s)", "# cook your dish here\nt=int(input())\nfor i in range(t):\n c=0\n n=int(input())\n a=[int(j) for j in input().split()]\n b=[int(j) for j in input().split()]\n a.sort()\n b.sort()\n for j in range(len(a)):\n if(a[j]<b[j]):\n c+=a[j]\n else:\n c+=b[j]\n print(c)\n", "for _ 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 s=0\n for i,j in zip(a,b):\n s+=min(i,j)\n print(s)", "t = int(input())\nfor i in range(t):\n n = int(input())\n sum = 0\n a = sorted((list(map(int,input().split()))))\n b = sorted((list(map(int,input().split()))))\n for j in range(n):\n if(a[j]<b[j]):\n sum += a[j];\n else:\n sum += b[j];\n print(sum)\n\n\n", "for t in range(int(input())):\n n=int(input())\n length=[int(i)for i in input().split()]\n width=[int(i)for i in input().split()]\n length.sort()\n width.sort()\n sum=0\n for j in range(n):\n sum=sum+min(length[j],width[j])\n print(sum) ", "for t in range(int(input())):\n n=int(input())\n length=[int(i)for i in input().split()]\n width=[int(i)for i in input().split()]\n length.sort()\n width.sort()\n sum=0\n for j in range(n):\n sum=sum+min(length[j],width[j])\n print(sum,\"\\n\") ", "for t in range(int(input())):\n n=int(input())\n length=[int(i)for i in input().split()]\n width=[int(i)for i in input().split()]\n length.sort()\n width.sort()\n sum=0\n for j in range(n):\n sum=sum+min(length[j],width[j])\n print(sum) ", "for t in range(int(input())):\n n=int(input())\n length=[int(i)for i in input().split()]\n width=[int(i)for i in input().split()]\n length.sort()\n width.sort()\n sum=0\n for j in range(n):\n sum=sum+min(length[j],width[j])\n print(sum) ", "for t in range(int(input())):\n n=int(input())\n length=[int(i)for i in input().split()]\n width=[int(i)for i in input().split()]\n length.sort()\n width.sort()\n sum=0\n for j in range(n):\n sum+=min(length[j],width[j])\n print(sum) ", "for t in range(int(input())):\n n=int(input())\n length=[int(i)for i in input().split()]\n width=[int(i)for i in input().split()]\n length.sort()\n width.sort()\n sum=0\n for j in range(n):\n sum+=min(length[j],width[j])\n print(sum) \n", "for t in range(int(input())):\n n=int(input())\n length=[int(i)for i in input().split()]\n width=[int(i)for i in input().split()]\n length.sort()\n width.sort()\n s=0\n for j in range(n):\n s+=min(length[j],width[j])\n print(s) \n", "for t in range(int(input())):\n n=int(input())\n l=[int(i)for i in input().split()]\n m=[int(i)for i in input().split()]\n l.sort()\n m.sort()\n s=0\n for j in range(n):\n s+=min(l[j],m[j])\n print(s) \n", "for t in range(int(input())):\n n=int(input())\n l=[int(k)for k in input().split()]\n m=[int(k)for k in input().split()]\n l.sort()\n m.sort()\n s=0\n for j in range(n):\n s+=min(l[j],m[j])\n print(s) \n", "for i in range(int(input())):\n n=int(input())\n l=[int(k)for k in input().split()]\n m=[int(k)for k in input().split()]\n l.sort()\n m.sort()\n s=0\n for j in range(n):\n s+=min(l[j],m[j])\n print(s) \n", "for i in range(int(input())):\n n=int(input())\n l=[int(k)for k in input().split()]\n m=[int(k)for k in input().split()]\n l.sort()\n m.sort()\n s=0\n for j in range(n):\n s+=min(l[j],m[j])\n print(s) \n \n", "for i in range(int(input())):\n n=int(input())\n l=[int(k)for k in input().split()]\n m=[int(k)for k in input().split()]\n l.sort()\n m.sort()\n s=0\n for j in range(n):\n s+=min(l[j],m[j])\n print(s) \n", "# MOD = 1000000007\nfor _ in range(int(input())):\n # n,k = map(int,input().split())\n n = int(input())\n a = sorted(map(int,input().split()))\n b = sorted(map(int,input().split()))\n print(sum(map(min,list(zip(a,b)))))\n", "# cook your dish here\nt = int(input())\n\nfor _ in range(t):\n n = int(input())\n \n a = [int(x) for x in input().split()]\n b = [int(x) for x in input().split()]\n \n a.sort()\n b.sort()\n \n ans = 0\n for i in range(n):\n ans += min(a[i],b[i])\n \n print(ans)", "t = int(input())\n\nfor _ in range(t):\n n = int(input())\n \n a = [int(x) for x in input().split()]\n b = [int(x) for x in input().split()]\n \n a.sort()\n b.sort()\n \n ans = 0\n for i in range(n):\n ans += min(a[i], b[i])\n \n print(ans)", "# cook your dish here\nfor t in range(int(input())):\n n=int(input())\n a=[int(i) for i in input().split()]\n a.sort()\n b=[int(i) for i in input().split()]\n b.sort()\n s=0\n for i in range(n):\n s+=min(a[i],b[i])\n print(s)", "# cook your dish here\nt = int(input())\nfor _ in range(t):\n n = int(input())\n a = list(map(int, input().split()))\n b = list(map(int, input().split()))\n a.sort()\n b.sort()\n tot = 0\n for i in range(n):\n tot = tot + min(a[i],b[i])\n print(tot)\n \n"] | {"inputs": [["2", "4", "8 8 10 12", "15 20 3 5", "3", "20 20 20", "10 10 10"]], "outputs": [["30", "30"]]} | INTERVIEW | PYTHON3 | CODECHEF | 5,832 | |
6d8d18bd9aac0b5b40a2ccac06fc1766 | UNKNOWN | Get excited, folks, because it is time for the final match of Codechef Premier League (CPL)!
Mike and Tracy also want to watch the grand finale, but unfortunately, they could not get tickets to the match. However, Mike is not someone who gives up so easily — he has a plan to watch the match.
The field where the match is played is surrounded by a wall with height $K$. Outside, there are $N$ boxes (numbered $1$ through $N$). For each valid $i$, the $i$-th box has a height $H_i$.
Mike wants to take some boxes and stack them on top of each other to build two towers. The height of each tower is the sum of heights of all the boxes that form it. Of course, no box may be in both towers. The height of each tower should be at least $K$. Then Mike can climb on top of one tower and Tracy on top of the other, and they can watch the match uninterrupted!
While Mike is busy stacking the boxes, Tracy would like to know the smallest number of boxes required to build two towers such that each of them has height at least $K$, or at least that it is impossible to build such towers. Can you help Tracy?
-----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 $H_1, H_2, \ldots, H_N$.
-----Output-----
For each test case, print a single line containing one integer — the smallest number of boxes required to build two towers, or $-1$ if it is impossible.
-----Constraints-----
- $1 \leq T \leq 5$
- $1 \leq N, K \leq 4,000$
- $1 \leq H_i \leq 10^5$ for each valid $i$
-----Subtasks-----
Subtask #1 (30 points):
- $1 \leq N, K \leq 100$
- $1 \leq H_i \leq 100$ for each valid $i$
Subtask #2 (70 points): original constraints
-----Example Input-----
2
8 38
7 8 19 7 8 7 10 20
4 5
2 10 4 9
-----Example Output-----
7
2
-----Explanation-----
Example case 1: The first tower can be built with boxes $8 + 10 + 20 = 38$ and the second tower with boxes $7 + 7 + 8 + 19 = 41$. In this case, the box with height $7$ is left unused.
Example case 2: We only need the box with height $10$ for one tower and the box with height $9$ for the other tower. | ["import sys\nsys.setrecursionlimit(100000)\n\nmemo = {}\ndef recurse(arr, T1, T2, k, i):\n if T1 >= k and T2 >= k:\n return i\n\n if i >= len(arr):\n return float('inf')\n\n if (T1, T2) in memo:\n return memo[(T1, T2)]\n\n t1 = recurse(arr, T1 + arr[i], T2, k, i+1)\n t2 = recurse(arr, T1, T2 + arr[i], k, i+1) \n\n memo[(T1, T2)] = min(t1, t2)\n return memo[(T1, T2)]\n\nfor _ in range(int(input())):\n n, k = list(map(int, input().split()))\n lst = list(map(int, input().split()))\n\n lst.sort(reverse = True)\n memo = {}\n res = recurse(lst, 0, 0, k, 0)\n\n if res == float('inf'):\n print(-1)\n else:\n print(res)\n\n\n\n", "import sys\nsys.setrecursionlimit(100000)\n\nmemo = {}\ndef recurse(arr, T1, T2, k, i):\n if T1 >= k and T2 >= k:\n return i\n\n if i >= len(arr):\n return 10**9\n\n if (T1, T2) in memo:\n return memo[(T1, T2)]\n\n t1 = recurse(arr, T1 + arr[i], T2, k, i+1)\n t2 = recurse(arr, T1, T2 + arr[i], k, i+1) \n\n memo[(T1, T2)] = min(t1, t2)\n return memo[(T1, T2)]\n\nfor _ in range(int(input())):\n n, k = list(map(int, input().split()))\n lst = list(map(int, input().split()))\n\n lst.sort(reverse = True)\n memo = {}\n res = recurse(lst, 0, 0, k, 0)\n\n if res == 10**9:\n print(-1)\n else:\n print(res)\n\n\n\n", "def min_boxes(k, boxes):\n if len(boxes) == 1: return -1\n sum_ = sum(boxes)\n boxes = sorted(boxes, reverse=True)\n n = len(boxes)\n\n\n if sum_ < 2 * k: \n return -1\n elif boxes[0] >= k:\n B = boxes[1]\n if B >= k:\n return 2\n for i in range(2, n):\n B += boxes[i]\n if B >= k:\n return i + 1\n return -1\n\n\n table = [[False for _ in range(2 * k)] for _ in range(n + 1)]\n\n for i in range(n + 1):\n table[i][0] = True\n \n for i in range(1, n + 1):\n for j in range(1, 2 * k):\n if boxes[i - 1] > j:\n table[i][j] = table[i - 1][j]\n else:\n table[i][j] = table[i - 1][j] or table[i - 1][j - boxes[i - 1]]\n\n\n sum_till_here = 0\n for i in range(1, n + 1):\n sum_till_here += boxes[i - 1]\n for j in range(k, sum_till_here - k + 1):\n if table[i][j]:\n return i\n \n \n\n return -1\n\n\ndef __starting_point():\n test_cases = int(input())\n while test_cases:\n\n\n n, k = map(int, input().split())\n boxes = list(map(int, input().split()))\n\n print(min_boxes(k, boxes))\n\n test_cases -= 1\n__starting_point()", "def min_boxes(k, boxes):\n if len(boxes) == 1: return -1\n sum_ = sum(boxes)\n boxes = sorted(boxes, reverse=True)\n n = len(boxes)\n\n\n if sum_ < 2 * k: \n return -1\n elif boxes[0] >= k:\n B = boxes[1]\n if B >= k:\n return 2\n for i in range(2, n):\n B += boxes[i]\n if B >= k:\n return i + 1\n return -1\n\n\n table = [[False for _ in range(2 * k)] for _ in range(n + 1)]\n\n for i in range(n + 1):\n table[i][0] = True\n \n for i in range(1, n + 1):\n for j in range(1, 2 * k):\n if boxes[i - 1] > j:\n table[i][j] = table[i - 1][j]\n else:\n table[i][j] = table[i - 1][j] or table[i - 1][j - boxes[i - 1]]\n\n\n sum_till_here = 0\n for i in range(1, n + 1):\n sum_till_here += boxes[i - 1]\n for j in range(k, sum_till_here - k + 1):\n if table[i][j]:\n return i\n \n \n\n return -1\n\n\ndef __starting_point():\n test_cases = int(input())\n while test_cases:\n\n\n n, k = map(int, input().split())\n boxes = list(map(int, input().split()))\n\n print(min_boxes(k, boxes))\n\n test_cases -= 1\n__starting_point()", "def min_boxes(k, boxes):\n sum_ = sum(boxes)\n if sum_ < 2 * k: return -1\n boxes = sorted(boxes, reverse=True)\n\n n = len(boxes)\n\n table = [[-1 for _ in range(sum_ + 1)] for _ in range(n + 1)]\n\n table[0][:] = [False for _ in range(sum_ + 1)]\n\n for i in range(n + 1):\n table[i][0] = True\n \n for i in range(1, n + 1):\n for j in range(1, sum_ + 1):\n if boxes[i - 1] > j:\n table[i][j] = table[i - 1][j]\n else:\n table[i][j] = table[i - 1][j] or table[i - 1][j - boxes[i - 1]]\n\n\n i = 0\n x = boxes[0]\n while x < 2 * k:\n i += 1\n x += boxes[i]\n \n if i == 1:\n i += 1\n\n while i < n + 1:\n sum_till_here = sum(boxes[ : i])\n for j in range(k, sum_till_here - k + 1):\n if table[i][j]:\n if sum_till_here - j >= k:\n return i\n i += 1\n\n return -1\n\n\ndef __starting_point():\n test_cases = int(input())\n while test_cases:\n\n\n n, k = map(int, input().split())\n boxes = list(map(int, input().split()))\n\n print(min_boxes(k, boxes))\n\n test_cases -= 1\n__starting_point()", "def min_boxes(k, boxes):\n sum_ = sum(boxes)\n if sum_ < 2 * k: return -1\n boxes = sorted(boxes, reverse=True)\n\n n = len(boxes)\n\n table = [[-1 for _ in range(sum_ + 1)] for _ in range(n + 1)]\n\n table[0][:] = [False for _ in range(sum_ + 1)]\n\n for i in range(n + 1):\n table[i][0] = True\n \n for i in range(1, n + 1):\n for j in range(1, sum_ + 1):\n if boxes[i - 1] > j:\n table[i][j] = table[i - 1][j]\n else:\n table[i][j] = table[i - 1][j] or table[i - 1][j - boxes[i - 1]]\n\n\n i = 0\n x = boxes[0]\n while x < 2 * k:\n i += 1\n x += boxes[i]\n \n if i == 1:\n i += 1\n\n while i < n + 1:\n sum_till_here = sum(boxes[ : i])\n for j in range(k, sum_ + 1):\n if table[i][j]:\n if sum_till_here - j >= k:\n return i\n i += 1\n\n return -1\n\n\ndef __starting_point():\n test_cases = int(input())\n while test_cases:\n\n\n n, k = map(int, input().split())\n boxes = list(map(int, input().split()))\n\n print(min_boxes(k, boxes))\n\n test_cases -= 1\n__starting_point()", "for _ in range(int(input())):\n n, k = map(int,input().split())\n h = list(map(int, input().split()))\n sum = 0\n h.sort()\n h1 = set()\n h1.add(h[n-1])\n summ = h[n-1]\n z = -1\n for i in range(n-2,-1,-1):\n h2 = set()\n summ = summ + h[i]\n i1 = iter(h1)\n while True:\n try:\n p = int(next(i1))\n except StopIteration:\n break\n h2.add(p)\n h2.add(h[i])\n h2.add(p+h[i])\n if(((p+h[i])>=k) and ((summ-p-h[i])>=k)):\n z=n-i\n break\n if(((h[i])>=k) and ((summ-h[i])>=k)):\n z=n-i\n break\n if(z!=-1):\n break\n h1=h2\n print(z)", "tc = int(input())\nwhile tc!= 0:\n count=0\n n,k= map(int, input().split())\n h = sorted(map(int,input().split()))\n h.reverse()\n queue = [h[0]]\n sum2 = h[0]\n res = -1\n for i in range(1,len(h)):\n queue2=[]\n s=set()\n sum2+= h[i]\n for x in queue:\n if x not in s:\n queue2.append(x)\n s.add(x)\n if h[i] not in s:\n queue2.append(h[i])\n s.add(h[i])\n if x+h[i] not in s:\n queue2.append(x+h[i])\n s.add(x+h[i])\n if(x+h[i])>=k and (sum2-x-h[i])>=k:\n res= i+1\n break\n if (h[i]>=k) and (sum2-h[i])>=k:\n res= i+1\n break\n if res!= -1:\n break\n queue = queue2\n print(res)\n tc-= 1", "tc = int(input())\nwhile tc!= 0:\n count=0\n n,k= map(int, input().split())\n h = sorted(map(int,input().split()))\n h.reverse()\n queue = [h[0]]\n sum2 = h[0]\n res = -1\n for i in range(1,len(h)):\n queue2=[]\n s=set()\n sum2+= h[i]\n for x in queue:\n if x not in s:\n queue2.append(x)\n s.add(x)\n if h[i] not in s:\n queue2.append(h[i])\n s.add(h[i])\n if x+h[i] not in s:\n queue2.append(x+h[i])\n s.add(x+h[i])\n if(x+h[i])>=k and (sum2-x-h[i])>=k:\n res= i+1\n break\n if (h[i]>=k) and (sum2-h[i])>=k:\n res= i+1\n break\n if res!= -1:\n break\n queue = queue2\n print(res)\n tc-= 1", "# cook your dish here\nfor t in range(int(input())):\n n,k=map(int,input().split())\n a=list(map(int,input().split()))\n a.sort(reverse=True)\n queue1=[a[0]]\n summ=a[0]\n res=-1\n for i in range(1,len(a)):\n queue2=[]\n s=set()\n summ+=a[i]\n for x in queue1:\n if x not in s:\n queue2.append(x)\n s.add(x)\n if a[i] not in s:\n queue2.append(a[i])\n s.add(a[i])\n if x+a[i] not in s:\n queue2.append(x+a[i])\n s.add(x+a[i])\n if (x+a[i])>=k and (summ-x-a[i])>=k:\n res=i+1\n break\n if (a[i])>=k and (summ-a[i])>=k:\n res=i+1\n break\n if res!=-1:break\n queue1=queue2\n print(res)", "for _ in range(int(input())):\n n,k=map(int,input().split())\n h=list(map(int,input().split()))\n h.sort(reverse=True)\n h1=[]\n summ=0\n for i in range(n):\n summ+=h[i]\n h1.append(summ)\n dp=[]\n ele=[200000]*(k+1)\n dp.append(ele)\n for i in range(n):\n ele=[0]*(k+1)\n dp.append(ele)\n for i in range(1,n+1):\n for j in range(1,k+1):\n if h[i-1]>=j:\n dp[i][j]=h[i-1]\n else:\n dp[i][j]=min(dp[i-1][j],h[i-1]+dp[i-1][j-h[i-1]])\n i=1\n while(i<=n):\n if h1[i-1]-dp[i][k]>=k:\n break\n else:\n i+=1\n if i>n:\n print(-1)\n else:\n print(i)"] | {"inputs": [["2", "8 38", "7 8 19 7 8 7 10 20", "4 5", "2 10 4 9"]], "outputs": [["7", "2"]]} | INTERVIEW | PYTHON3 | CODECHEF | 8,499 | |
17a897f88b068af887aa8790f29166a8 | UNKNOWN | You are given a set $S$ and $Q$ queries. Initially, $S$ is empty. In each query:
- You are given a positive integer $X$.
- You should insert $X$ into $S$.
- For each $y \in S$ before this query such that $y \neq X$, you should also insert $y \oplus X$ into $S$ ($\oplus$ denotes the XOR operation).
- Then, you should find two values $E$ and $O$: the number of elements of $S$ with an even number of $1$-s and with an odd number of $1$-s in the binary representation, respectively.
Note that a set cannot have duplicate elements, so if you try to insert into $S$ an element that is already present in $S$, then nothing happens.
-----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 $Q$.
- Each of the next $Q$ lines contains a single integer $X$ describing a query.
-----Output-----
For each query, print a single line containing two space-separated integers $E$ and $O$.
-----Constraints-----
- $1 \le T \le 5$
- $1 \le Q, X \le 10^5$
-----Subtasks-----
Subtask #1 (30 points):
- $1 \le Q \le 1,000$
- $1 \le X \le 128$
Subtask #2 (70 points): original constraints
-----Example Input-----
1
3
4
2
7
-----Example Output-----
0 1
1 2
3 4
-----Explanation-----
Example case 1:
- Initially, the set is empty: $S = \{\}$.
- After the first query, $S = \{4\}$, so there is only one element with an odd number of $1$-s in the binary representation ("100").
- After the second query, $S = \{4,2,6\}$, there is one element with an even number of $1$-s in the binary representation ($6$ is "110") and the other two elements have an odd number of $1$-s.
- After the third query, $S = \{4,2,6,7,3,5,1\}$. | ["# fast io\nimport sys\ndef fop(s): sys.stdout.write(str(s)+'\\n')\ndef fip(): return sys.stdin.readline()\nfintinp = lambda : int(fip()) \ndef flistinp(func= int): return list(map(func,fip().split())) \ndef fnsepline(n,func=str): return [func(fip()) for _ in range(n)]\n#-------------------code------------------------\ndef even(x):\n x = bin(x).count('1')\n return x%2==0\n \nfor _ in range(fintinp()):\n q =fintinp()\n o = e =0 \n nums = set()\n for qn in range(q):\n qn = fintinp()\n if qn not in nums:\n if even(qn): e+=1 \n else: o+=1 \n \n for n in set(nums):\n x = n^qn\n if x not in nums:\n if even(x): e+=1 \n else: o+=1 \n \n nums.add(x)\n \n nums.add(qn)\n print(e,o)\n", "# fast io\nimport sys\ndef fop(s): sys.stdout.write(str(s)+'\\n')\ndef fip(): return sys.stdin.readline()\nfintinp = lambda : int(fip()) \ndef flistinp(func= int): return list(map(func,fip().split())) \ndef fnsepline(n,func=str): return [func(fip()) for _ in range(n)]\n#-------------------code------------------------\ndef even(x):\n x = bin(x).count('1')\n return x%2==0\n \nfor _ in range(fintinp()):\n q =fintinp()\n o = e =0 \n nums = set()\n for qn in range(q):\n qn = fintinp()\n if qn not in nums:\n if even(qn): e+=1 \n else: o+=1 \n \n for n in set(nums):\n x = n^qn\n if x not in nums:\n if even(x): e+=1 \n else: o+=1 \n \n nums.add(x)\n \n nums.add(qn)\n print(e,o)\n", "from sys import stdin, stdout\nfrom math import ceil\nimport numpy as np\nfrom numpy.linalg import matrix_power\n\n\ndef parity(n):\n return bin(n)[2:].count('1') % 2\n\n\ndef solve():\n for _ in range(int(input())):\n s = set()\n q = int(input())\n p = [0, 0]\n while q:\n q -= 1\n x = int(input())\n if s == set():\n p[parity(x)] += 1\n s.add(x)\n else:\n if x not in s:\n se = set()\n for j in s:\n se.add(j ^ x)\n p[parity(j ^ x)] += 1\n s = s.union(se)\n s.add(x)\n p[parity(x)] += 1\n print(p[0], p[1])\n\n\ndef __starting_point():\n solve()\n\n__starting_point()", "import collections\ndef bits(x):\n return bin(x).count('1')\nt=int(input())\nfor _ in range(t):\n q=int(input())\n s=[]\n d=collections.defaultdict(lambda:-1)\n e=0\n o=0\n p=-1\n for i in range(q):\n x=int(input())\n # print(d)\n if d[x]!=-1:\n print(e,o)\n continue\n s.append(x)\n d[x]=1\n #z=len(s)\n for j in s:\n if j!=x:\n l=j^x\n if d[l]!=-1:\n continue\n s.append(l)\n d[l]=1\n \n for j in range(p+1,len(s)):\n p=j\n if bits(s[j])%2==0:\n e=e+1\n elif bits(s[j])%2!=0:\n o=o+1\n print(e,o)\n", "import collections\nt = int(input())\nfor _ in range(t):\n q = int(input())\n s = collections.defaultdict(lambda : -1)\n e , o = 0 , 0\n for __ in range(q):\n x = int(input())\n d = []\n # print(s)\n dd = list(s)\n if s[x] == -1:\n for i in dd:\n xo = i^x\n d.append(xo)\n d=set(d)\n for i in d:\n if s[i]==-1:\n if bin(i).count('1')%2==0:\n e+=1\n else:\n o+=1\n s[i]=1\n s[x]=1\n if bin(x).count('1')%2==0:\n e+=1\n else:\n o+=1\n for i in d:\n s[i]=1\n print(e,o)\n\n\n", "\nt = int(input())\nfor _ in range(t):\n q = int(input())\n s = []\n e , o = 0 , 0\n for __ in range(q):\n x = int(input())\n d = []\n if x not in s:\n for i in s:\n xo = i^x\n d.append(xo)\n d=set(d)\n for i in d:\n if i not in s:\n if bin(i).count('1')%2==0:\n e+=1\n else:\n o+=1\n s.append(x)\n if bin(x).count('1')%2==0:\n e+=1\n else:\n o+=1\n for i in d:\n s.append(i)\n print(e,o)\n\n\n", "\nt = int(input())\nfor _ in range(t):\n q = int(input())\n s = []\n e , o = 0 , 0\n for __ in range(q):\n x = int(input())\n d = []\n if x not in s and x not in d:\n for i in s:\n xo = i^x\n if xo not in s and xo not in d:\n d.append(xo)\n if bin(xo).count('1')%2==0:\n e+=1\n else:\n o+=1\n s.append(x)\n if bin(x).count('1')%2==0:\n e+=1\n else:\n o+=1\n \n \n for i in d:\n s.append(i)\n print(e,o)\n\n\n", "t=int(input())\nfor i in range(t):\n n=int(input())\n a=[]\n s=set()\n cta,ctb=0,0\n while(n!=0):\n x=int(input())\n m=len(a)\n if(x not in s):\n s.add(x)\n a.append(x)\n s2=bin(x).count('1')\n if(s2%2==0):\n cta+=1\n else:\n ctb+=1\n for i in range(m):\n y=x^a[i]\n #print(y)\n if(y not in s):\n s.add(y)\n a.append(y)\n s2=bin(y).count('1')\n if(s2%2==0):\n cta+=1\n else:\n ctb+=1\n print(cta,ctb)\n n-=1", "from collections import Counter\n\nt = int(input())\n\nfor _ in range(t):\n q = int(input())\n orig_set = set()\n orig_set.add(0)\n E, O = 0, 0\n\n for row in range(q):\n x = int(input())\n if x in orig_set:\n print(E, O)\n else:\n l = []\n for i in orig_set:\n elem = i ^ x \n if Counter(bin(elem)[2:])['1'] % 2 == 1:\n O += 1\n else:\n E += 1\n l.append(elem)\n \n for e in l:\n orig_set.add(e)\n print(E, O)", "from collections import Counter\n\n\na= int(input())\nwhile a!=0:\n b = int(input())\n original = list()\n original.append(0)\n ev,od=0,0\n\n for i in range(b):\n\n c = int(input())\n if c in original:\n print(ev,od)\n continue\n else:\n for j in range(len(original)):\n p = c^original[j]\n if Counter(bin(p))['1']%2 == 0:\n ev+=1\n else:\n od+=1\n original.append(p)\n print(ev,od)\n \n\n a-=1\n", "from collections import Counter\n\n\na = int(input())\nwhile a!=0:\n\n b = int(input())\n mylist = list()\n ev, od = 0, 0\n for i in range(b):\n c = int(input())\n\n fla=0\n\n for j in range(len(mylist)):\n\n\n if c==mylist[j]:\n print(ev,od)\n fla=1\n break\n if fla==1:\n continue\n\n temp = list()\n for j in range(len(mylist)):\n if c != mylist[j]:\n\n mylist.append(c^mylist[j])\n r = c^mylist[j]\n elem = mylist[j] ^ c\n \n if Counter(bin(elem)[2:])['1'] % 2 == 1:\n od += 1\n else:\n ev += 1\n mylist.append(r)\n mylist = list(set(mylist))\n mylist.append(c)\n\n\n elem = mylist[len(mylist)-1]\n\n if Counter(bin(elem)[2:])['1'] % 2 == 1:\n od += 1\n else:\n ev += 1\n\n\n\n print(ev,od)\n\n\n\n\n\n\n a-=1\n", "\ndef countSetBits(n):\n count = 0\n while (n):\n count += n & 1\n n >>= 1\n return count\n\n\n\na = int(input())\nwhile a!=0:\n\n b = int(input())\n mylist = list()\n ev, od = 0, 0\n for i in range(b):\n c = int(input())\n\n fla=0\n\n for j in range(len(mylist)):\n\n\n if c==mylist[j]:\n print(ev,od)\n fla=1\n break\n if fla==1:\n continue\n\n temp = list()\n for j in range(len(mylist)):\n if c != mylist[j]:\n\n mylist.append(c^mylist[j])\n r = c^mylist[j]\n p = countSetBits(r)\n\n if p % 2 == 0:\n ev += 1\n else:\n od += 1\n\n mylist.append(c)\n \n p = countSetBits(mylist[len(mylist)-1])\n\n if p % 2 == 0:\n ev += 1\n else:\n od += 1\n\n\n print(ev,od)\n\n\n\n\n\n\n a-=1\n", "\ndef countSetBits(n):\n count = 0\n while (n):\n count += n & 1\n n >>= 1\n return count\n\n\n\na = int(input())\nwhile a!=0:\n\n b = int(input())\n mylist = list()\n ev, od = 0, 0\n for i in range(b):\n c = int(input())\n\n fla=0\n for j in range(len(mylist)):\n if c==mylist[j]:\n print(ev,od)\n fla=1\n break\n if fla==1:\n continue\n ev, od = 0, 0\n for j in range(len(mylist)):\n if c != mylist[j]:\n\n mylist.append(c^mylist[j])\n\n mylist.append(c)\n mylist = list(set(mylist))\n \n for j in range(len(mylist)):\n p = countSetBits(mylist[j])\n\n\n if p%2 == 0:\n ev+=1\n else:\n od+=1\n print(ev,od)\n\n\n\n\n\n\n a-=1\n", "\ndef countSetBits(n):\n count = 0\n while (n):\n count += n & 1\n n >>= 1\n return count\n\n\n\na = int(input())\nwhile a!=0:\n\n b = int(input())\n mylist = list()\n\n for i in range(b):\n c = int(input())\n ev, od = 0, 0\n for j in range(len(mylist)):\n if c != mylist[j]:\n\n mylist.append(c^mylist[j])\n\n mylist.append(c)\n mylist = list(set(mylist))\n\n for j in range(len(mylist)):\n p = countSetBits(mylist[j])\n\n\n if p%2 == 0:\n ev+=1\n else:\n od+=1\n print(ev,od)\n\n\n\n\n\n\n a-=1\n", "from collections import Counter\n\nt = int(input())\n\nfor _ in range(t):\n q = int(input())\n orig_set = set()\n orig_set.add(0)\n E, O = 0, 0\n\n for row in range(q):\n x = int(input())\n if x in orig_set:\n print(E, O)\n else:\n l = []\n for i in orig_set:\n elem = i ^ x \n if Counter(bin(elem)[2:])['1'] % 2 == 1:\n O += 1\n else:\n E += 1\n l.append(elem)\n \n for e in l:\n orig_set.add(e)\n print(E, O)", "from collections import Counter\n\nt = int(input())\n\nfor _ in range(t):\n q = int(input())\n orig_set = set()\n\n for row in range(q):\n E, O = 0, 0\n x = int(input())\n for i in set(orig_set):\n if i != x:\n orig_set.add(i ^ x)\n orig_set.add(x)\n\n for elem in orig_set:\n if Counter(bin(elem)[2:])['1'] % 2:\n O += 1\n else:\n E += 1\n\n print(E, O)", "import math\n\ndef countSetBits(i):\n\n i = i - ((i >> 1) & 0x55555555)\n i = (i & 0x33333333) + ((i >> 2) & 0x33333333)\n return (((i + (i >> 4) & 0xF0F0F0F) * 0x1010101) & 0xffffffff) >> 24\na = int(input())\nwhile a!=0:\n mylist = list()\n b= int(input())\n count_even = 0\n count_odd = 0\n for j in range(b):\n\n c = int(input())\n t=0\n for i in range(len(mylist)):\n if(mylist[i] == c):\n t=1\n break\n if(t == 0):\n for i in range(len(mylist)):\n if(mylist[i] != c):\n p = mylist[i]^c\n q = math.log2(p)\n if(q == int(q)):\n count_odd+=1\n else:\n if(countSetBits(p)%2 == 0):\n count_even+=1\n else:\n count_odd+=1\n mylist.append(p)\n else:\n mylist.append(c)\n mylist.append(c)\n p = math.log2(c)\n if(p == int(p)):\n count_odd+=1\n else:\n if(countSetBits(c)%2 ==0):\n count_even+=1\n else:\n count_odd+=1\n print(count_even,count_odd)\n\n\n\n\n\n\n a-=1\n\n\n\n", "import math\n\ndef countSetBits(n):\n count = 0\n while (n):\n n &= (n - 1)\n count += 1\n\n return count\n\na = int(input())\nwhile a!=0:\n mylist = list()\n b= int(input())\n count_even = 0\n count_odd = 0\n for j in range(b):\n\n c = int(input())\n t=0\n for i in range(len(mylist)):\n if(mylist[i] == c):\n t=1\n break\n if(t == 0):\n for i in range(len(mylist)):\n if(mylist[i] != c):\n p = mylist[i]^c\n q = math.log2(p)\n if(q == int(q)):\n count_odd+=1\n else:\n if(countSetBits(p)%2 == 0):\n count_even+=1\n else:\n count_odd+=1\n mylist.append(p)\n else:\n mylist.append(c)\n mylist.append(c)\n p = math.log2(c)\n if(p == int(p)):\n count_odd+=1\n else:\n if(countSetBits(c)%2 ==0):\n count_even+=1\n else:\n count_odd+=1\n print(count_even,count_odd)\n\n\n\n\n\n\n a-=1\n\n\n\n", "T = int(input())\nfor a in range(T):\n Q = int(input())\n l2 = []\n even = 0\n odd = 0\n for _ in range(Q):\n\n l3 =[]\n z = int(input())\n if z not in l2:\n x = str(bin(z))\n\n if (x.count('1') % 2) == 0:\n even += 1\n else:\n odd += 1\n for w in l2:\n l3.append(w ^ z)\n x = str(bin(w ^ z))\n\n if (x.count('1') % 2) == 0:\n even += 1\n else:\n odd += 1\n l2.append(z)\n l2.extend(l3)\n\n print(even,end = \" \")\n print(odd)\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n", "T = int(input())\nfor a in range(T):\n Q = int(input())\n l2 = []\n for _ in range(Q):\n even = 0\n odd = 0\n l3 =[]\n z = int(input())\n if z not in l2:\n for w in l2:\n\n l3.append(w ^ z)\n l3.append(z)\n l2.extend(l3)\n\n for q in l2:\n x =str(bin(q))\n\n if (x.count('1') % 2) == 0:\n even += 1\n else:\n odd += 1\n print(even ,end = \" \")\n print(odd)\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n", "def eo(n):\n cnt=0\n while(n):\n n&=n-1\n cnt+=1\n return cnt\n\n\n\nfor _ in range(int(input())):\n arr=[]\n even=0\n odd=0\n check={}\n for _ in range(int(input())):\n x=int(input())\n if x not in arr:\n for i in range(len(arr)):\n y=x^arr[i]\n if y not in arr:\n check[y]=0\n arr.append(y)\n j=eo(y)\n if j%2==0:\n even+=1\n else:\n odd+=1\n if x not in arr:\n check[x]=0\n arr.append(x)\n j=eo(x)\n if j%2==0:\n even+=1\n else:\n odd+=1\n print(even,odd)", "def eo(n):\n cnt=0\n while(n):\n n&=n-1\n cnt+=1\n return cnt\n\n\n\nfor _ in range(int(input())):\n arr=[]\n even=0\n odd=0\n check={}\n for _ in range(int(input())):\n x=int(input())\n if check.get(x)==None:\n for i in range(len(arr)):\n y=x^arr[i]\n if check.get(y)==None:\n check[y]=0\n arr.append(y)\n j=eo(y)\n if j%2==0:\n even+=1\n else:\n odd+=1\n if check.get(x)==None:\n check[x]=0\n arr.append(x)\n j=eo(x)\n if j%2==0:\n even+=1\n else:\n odd+=1\n print(even,odd)", "def eo(n):\n cnt=0\n while(n):\n n&=n-1\n cnt+=1\n return cnt\n\ndef xor(a, b):\n ans = a^b\n return ans\n\nfor _ in range(int(input())):\n arr=[]\n even=0\n odd=0\n check={}\n for _ in range(int(input())):\n x=int(input())\n if check.get(x)==None:\n for i in range(len(arr)):\n y=xor(x, arr[i])\n if check.get(y)==None:\n check[y]=0\n arr.append(y)\n j=eo(y)\n if j%2==0:\n even+=1\n else:\n odd+=1\n if check.get(x)==None:\n check[x]=0\n arr.append(x)\n j=eo(x)\n if j%2==0:\n even+=1\n else:\n odd+=1\n print(even,odd)"] | {"inputs": [["1", "3", "4", "2", "7"]], "outputs": [["0 1", "1 2", "3 4"]]} | INTERVIEW | PYTHON3 | CODECHEF | 13,422 | |
bf9a259c566bc672cef4daf6569e0ee2 | UNKNOWN | Given an integer $x$, find two non-negative integers $a$ and $b$ such that $(a \wedge b) + (a \vee b) = x$, where $\wedge$ is the bitwise AND operation and $\vee$ is the bitwise OR operation.
-----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 $x$.
-----Output-----
If there is no valid pair $(a, b)$, print a single line containing the integer $-1$. Otherwise, print a single line containing two space-separated integers $a$ and $b$.
If there are multiple solutions, you may print any one of them.
-----Constraints-----
- $1 \le T \le 10^5$
- $1 \le x \le 10^{18}$
-----Subtasks-----
Subtask #1 (30 points):
- $1 \le T \le 200$
- $1 \le x \le 200$
Subtask #2 (70 points): original constraints
-----Example Input-----
2
1
8
-----Example Output-----
0 1
5 3 | ["# cook your dish here\nn=int(input())\nfor _ in range(n):\n a=int(input())\n if(a%2==0):\n f=(a//2)-1\n s=a-f\n else:\n f=(a//2)\n s=a-f\n print(f,s)"] | {"inputs": [["2", "1", "8"]], "outputs": [["0 1", "5 3"]]} | INTERVIEW | PYTHON3 | CODECHEF | 157 | |
46a82e80ba3ed5ea7e23a72b9aeb1415 | UNKNOWN | There is a haunted town called HauntedLand. The structure of HauntedLand can be thought of as a grid of size n * m. There is a house in each cell of the grid. Some people have fled from their houses because they were haunted. '.' represents a haunted house whereas '*' represents a house in which people are living.
One day, Devu, the famous perfumer came to town with a perfume whose smell can hypnotize people. Devu can put the perfume in at most one of the houses. This takes Devu one second. Then, the perfume spreads from one house (need not be inhabited by people) to all its adjacent houses in one second, and the cycle continues. Two houses are said to be a adjacent to each other, if they share a corner or an edge, i.e., each house (except those on the boundaries) will have 8 adjacent houses.
You want to save people from Devu's dark perfumery by sending them a message to flee from the town. So, you need to estimate the minimum amount of time Devu needs to hypnotize all the people? Note that if there are no houses inhabited by people, Devu doesn't need to put perfume in any cell.
-----Input-----
The first line of 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 two space separated integers n, m denoting the dimensions of the town.
For each of next n lines, each line has m characters (without any space) denoting a row of houses of the town.
-----Output-----
For each test case, output a single integer corresponding to the answer of the problem.
-----Constraints-----
- 1 ≤ T ≤ 20
Subtask #1: (40 points)
- 1 ≤ n, m ≤ 100Subtask #2: (60 points)
- 1 ≤ n, m ≤ 1000
-----Example-----
Input:
2
2 2
*...
3 4
.*..***..*..
Output:
1
2
-----Explanation-----
In the first example, it will take Devu one second for putting the perfume at the only house. So, the answer is 1.
In the second example, He will first put the perfume at the * at cell (1, 1) (assuming 0-based indexing).
Now, it will take Devu 1 secs to put perfume. In the next second, the perfume will spread to all of its adjacent cells, thus making each house haunted.
So, the answer is 2. | ["import math\n\n\nt = int(input().strip())\n\nfor _ in range(t):\n n, m = list(map(int, input().strip().split()))\n a = []\n v = [-1] * 4\n\n for i in range(n):\n a.append(input().strip())\n\n for i, ai in enumerate(a):\n if ai.find('*') > -1:\n v[2] = i\n break\n\n if v[2] == -1:\n print(0)\n else:\n\n for i, ai in reversed(list(enumerate(a))):\n if ai.find('*') > -1:\n v[3] = i\n break\n\n for i in range(m):\n x = [ai[i] for ai in a]\n if '*' in x:\n v[0] = i\n break\n\n for i in reversed(range(m)):\n x = [ai[i] for ai in a]\n if '*' in x:\n v[1] = i\n break\n\n if v.count(v[0]) == len(v):\n print(1)\n else:\n print(int(math.ceil(max(v[3] - v[2], v[1] - v[0]) / 2.0)) + 1)", "import math\n\n\nt = int(input().strip())\n\nfor _ in range(t):\n n, m = list(map(int, input().strip().split()))\n a = []\n v = [-1] * 4\n\n for i in range(n):\n a.append(input().strip())\n\n for i, ai in enumerate(a):\n if ai.find('*') > -1:\n v[2] = i\n break\n\n if v[2] == -1:\n print(0)\n else:\n\n for i, ai in reversed(list(enumerate(a))):\n if ai.find('*') > -1:\n v[3] = i\n break\n\n for i in range(m):\n x = [ai[i] for ai in a]\n if '*' in x:\n v[0] = i\n break\n\n for i in reversed(range(m)):\n x = [ai[i] for ai in a]\n if '*' in x:\n v[1] = i\n break\n\n if v.count(v[0]) == len(v):\n print(1)\n else:\n print(int(math.ceil(max(v[3] - v[2], v[1] - v[0]) / 2.0)) + 1)", "\n\nimport sys\n\n\nt=int(int(sys.stdin.readline().rstrip()))\nwhile t:\n t=t-1\n \n a,b=list(map(int,sys.stdin.readline().rstrip().split(' ')))\n li=[]\n lir=[]\n lic=[]\n for i in range(0,a):\n li.append(sys.stdin.readline().rstrip())\n if '*' in li[i]:\n lir.append(i)\n lic.append(li[i].find('*'))\n lic.append(li[i].rfind('*'))\n \n if not lir:\n print(0)\n else:\n \n\n r=int(int(max(lir))+int(min(lir)))/2\n c=int(int(max(lic))+int(min(lic)))/2\n\n ans=int(max((max(lir)-r),(max(lic)-c),(r-min(lir)),(c-min(lic))))\n\n print(ans+1)\n", "for _ in range(int(input())):\n x,y=list(map(int,input().split()))\n p=q=c=0\n r=s=1001\n for i in range(x):\n a=input()\n for j in range(y):\n if a[j]=='*':\n c=1\n #print i,j\n if i>p:\n p=i\n if j>q:\n q=j\n if i<r:\n r=i\n if j<s:\n s=j\n g=p-((p+r)//2)\n h=q-((q+s)//2)\n if c:\n c+=max(g,h)\n print(c)", "\n\nimport fractions\nimport sys\n\nf = sys.stdin\n\nif len(sys.argv) > 1:\n f = open(sys.argv[1], \"rt\")\n\ndef calc(rows):\n min_x = 10000\n min_y = 10000\n max_x = -1\n max_y = -1\n\n count = 0\n for y, row in enumerate(rows):\n for x, ch in enumerate(row):\n if ch == '*':\n count += 1\n min_x = min(min_x, x)\n min_y = min(min_y, y)\n max_x = max(max_x, x)\n max_y = max(max_y, y)\n\n if count == 0:\n return 0\n return 1 + max(max_x - min_x + 1, max_y - min_y + 1) // 2\n\nT = int(f.readline().strip())\n\nfor case_id in range(1, T+1):\n n, m = list(map(int, f.readline().strip().split()))\n\n rows = []\n for i in range(n):\n rows.append(f.readline().strip())\n\n r = calc(rows)\n\n print(r)\n", "import math\nt=eval(input())\nwhile t>0:\n n,m=list(map(int,input().split()))\n f=[]\n min_x,max_x,min_y,max_y=1001,-1,1001,-1\n for x in range(n):\n f.append(input().strip())\n for i in range(n):\n for j in range(m):\n if f[i][j]=='*':\n if min_x>i:\n min_x=i\n if max_x<i:\n max_x=i\n if min_y>j:\n min_y=j\n if max_y<j:\n max_y=j\n #print 'min_x=',min_x,'min_y=',min_y,'max_x=',max_x,'max_y='\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0,max_y\n if max_x==-1 or min_x==1001 or max_y==-1 or max_y==1001:\n print(0)\n else:\n dx=max_x-min_x\n dy=max_y-min_y\n res=0\n if dx>dy:\n res=int(math.ceil(dx/2.0))+1\n else:\n res=int(math.ceil(dy/2.0))+1\n if res>0:\n print(res)\n else:\n print(res)\n t-=1\n", "t=eval(input())\nfor qq in range(t):\n n,m=list(map(int,input().split()))\n count=0\n xmin,xmax,ymin,ymax=n+1,-1,m+1,-1\n for i in range(n):\n s=input()\n for j in range(m):\n if s[j]==\"*\": #coordinates=i,j\n count+=1\n if i<xmin:xmin=i\n else:\n if i>xmax:xmax=i\n if j<ymin:ymin=j\n else:\n if j>ymax:ymax=j\n if count==0:print(0)\n else:\n if count==1:print(1)\n else:\n # print \"xmax,xmin,ymax,ymin\",xmax,xmin,ymax,ymin\n num=max((xmax-xmin),(ymax-ymin))\n if num&1==0:print((num/2)+1)\n else:print((num/2)+2)", "t = int(input())\nfor i in range(t):\n nm = str(input()).split()\n n = int(nm[0])\n m = int(nm[1])\n up = n\n dn = -1\n l = m\n r = -1\n for j in range(n):\n inp = str(input())\n if '*' in inp:\n p1 = inp.find('*')\n p2t = (inp[::-1]).find('*')\n p2 = m-p2t-1\n if j<up:\n up = j\n if j>dn:\n dn = j\n if p1<l:\n l = p1\n if p2>r:\n r = p2\n if dn == -1:\n print(0)\n else:\n r1 = (dn-up)/2 + (dn-up)%2 + 1\n r2 = (r-l)/2 + (r-l)%2 + 1\n print(max(r1,r2))"] | {"inputs": [["2", "2 2", "*.", "..", "3 4", ".*..", "***.", ".*.."]], "outputs": [["1", "2"]]} | INTERVIEW | PYTHON3 | CODECHEF | 4,981 | |
852d298a28bba55be5c885776c91c69b | 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
2
3
4
-----Sample Output:-----
1121
1222
112131
122232
132333
11213141
12223242
13233343
14243444
-----EXPLANATION:-----
No need, else pattern can be decode easily. | ["for _ in range(int(input().strip())):\n n = int(input().strip())\n lst = []\n for i in range(n):\n lst.append(i+1)\n lst.append(1)\n #print(lst)\n for i in range(n):\n print(''.join(str(e) for e in lst))\n for x in range(n):\n lst[x * 2 + 1] += 1\n", "# cook your dish here\nfor _ in range(int(input())):\n k=int(input())\n for i in range(k):\n for j in range(k):\n print(j+1,end=\"\")\n print(i+1,end=\"\")\n print()", "for _ in range(int(input())):\n n=int(input())\n b=1\n # 1112\n # 2122\n for _ in range(1,n+1):\n a=1\n for __ in range((2*n)):\n if __%2==0:\n print(a,end=\"\")\n a+=1\n else:\n print(b,end=\"\")\n b+=1\n print()\n print() ", "t=int(input())\r\nfor i in range(0,t):\r\n my_int = int(input().strip())\r\n for xyz in range(1,my_int+1):\r\n for abc in range(1,my_int+1):\r\n print('{0}{1}'.format(abc,xyz),end=\"\")\r\n print()", "for _ in range(int(input())):\r\n n = int(input())\r\n for i in range(1,n+1):\r\n for j in range(1,n+1):\r\n print(str(j)+str(i),end='')\r\n print()", "import sys\r\ninput = sys.stdin.readline\r\n\r\nt=int(input())\r\nfor _ in range(t):\r\n n=int(input())\r\n a=[]\r\n for i in range(n):\r\n a.append([str(i+1)]*n)\r\n l=[]\r\n for k in range(1,n+1):\r\n l.append(str(k))\r\n a.append(l)\r\n ans=[]\r\n for i in range(n):\r\n v=[]\r\n for j in range(len(a)):\r\n v.append(a[j][i])\r\n ans.append(v)\r\n for ele in ans:\r\n print(\"\".join(ele))\r\n", "# cook your dish here\nfor u in range(int(input().strip())):\n n = int(input().strip())\n for i in range(1,n+1):\n for j in range(1,n+1):\n #print('{0}{1}'.format(j,i))\n print('{0}{1}'.format(j,i),end=\"\")\n print()", "# cook your dish here\nt=int(input(\"\"))\nwhile(t!=0):\n s=''\n k=int(input(\"\"))\n #print(k)\n for i in range(k):\n for j in range(k):\n s=s+str(j+1)+str(i+1)\n print(s)\n s=''\n t-=1", "T = int(input())\r\n\r\nfor t in range(T):\r\n N = int(input())\r\n \r\n for i in range(N):\r\n sol = \"1\"\r\n for j in range(2,N+1):\r\n sol+=str(i+1)+str(j)\r\n print(sol+str(i+1))", "# cook your dish here\nfor _ in range(int(input())):\n n=int(input())\n for i in range(1,n+1):\n for j in range(1,n+1):\n print(j,end=\"\")\n print(i,end=\"\")\n print()", "for tc in range(int(input())):\r\n K = int(input())\r\n for i in range(K):\r\n ar = [str(i + 1 if j % 2 else j + 2 >> 1) for j in range(2 * K)]\r\n print(''.join(ar))", "n=int(input())\r\ns=\"\"\r\nfor i in range(n):\r\n a=int(input())\r\n k=1\r\n for j in range(1,a+1):\r\n while(k<a+1):\r\n s=s+str(k)+str(j)\r\n k=k+1\r\n print(s)\r\n s=\"\"\r\n k=1", "for _ in range(int(input())):\n n = int(input())\n for i in range(1, n + 1):\n for j in range(1, n + 1):\n print(str(j) + str(i), end = '')\n print()\n\n\n", "t=int(input())\nfor i in range(t):\n k=int(input())\n l=[]\n for i in range(1,101):\n l.append(i)\n arr=[]\n x=1\n for i in range(2*100):\n if i%2==0:\n arr.append([x]*100)\n x=x+1\n else:\n arr.append(l)\n \n j=0\n while j<k:\n i=0\n while i<2*k:\n print(arr[i][j],end=\"\")\n i=i+1\n print()\n j=j+1\n \n \n \n \n", "t=int(input())\r\nfor _ in range(t):\r\n n=int(input())\r\n dp=[[0 for i in range(n*2)] for i in range(n)]\r\n for i in range(2*n):\r\n if i%2:\r\n for j in range(n):\r\n dp[j][i] = j+1\r\n else:\r\n for j in range(n):\r\n dp[j][i]=i//2+1\r\n for i in range(n):\r\n x=\"\".join(map(str,dp[i]))\r\n print(x)\r\n \r\n \r\n \r\n \r\n", "n=int(input())\r\ns=\"\"\r\nfor i in range(n):\r\n a=int(input())\r\n k=1\r\n for j in range(1,a+1):\r\n while(k<a+1):\r\n s=s+str(k)+str(j)\r\n k=k+1\r\n print(s)\r\n s=\"\"\r\n k=1", "# cook your dish here\nfor a0 in range(int(input())):\n n = int(input())\n for j in range(1,n+1):\n s = \"\"\n for i in range(1,n+1):\n s+= str(i)+str(j)\n print(s)\n", "# cook your dish here\nfor _ in range(int(input())):\n n=int(input())\n for i in range(1,n+1):\n for j in range(1,n+1):\n print(\"{}{}\".format(j,i),end='')\n print()", "try:\r\n t = int(input())\r\n for a in range(t):\r\n k = int(input())\r\n for i in range(1,k+1):\r\n s = \"\"\r\n x = 1\r\n for j in range(1,(2*k)+1):\r\n if (j%2==0):\r\n s+=str(i)\r\n else:\r\n s+=str(x)\r\n x+=1\r\n print(s)\r\n\r\nexcept EOFError:\r\n pass", "t = int(input())\nfor _ in range(t):\n n = int(input())\n for i in range(n):\n for j in range(2*n):\n if j%2==0:\n print(int(j/2)+1,end = '')\n else:\n print(i+1,end = '')\n print()\n \n", "for _ in range(int(input())):\r\n n = int(input())\r\n for i in range(1, n + 1):\r\n for j in range(1, n + 1):\r\n print(j, i, sep='', end=\"\")\r\n print()", "t=int(input())\nfor i in range(0,t):\n n=int(input())\n for j in range(0,n):\n p=1\n for k in range(0,2*n):\n if k%2==0:\n print(p,end=\"\")\n p=p+1\n else:\n print(j+1,end=\"\")\n print(\" \")", "t=int(input())\r\nfor i in range(t):\r\n k=int(input())\r\n for j in range(1,k+1):\r\n for k in range(1,k+1):\r\n print(f\"{k}{j}\",end=\"\")\r\n print()"] | {"inputs": [["3", "2", "3", "4"]], "outputs": [["1121", "1222", "112131", "122232", "132333", "11213141", "12223242", "13233343", "14243444"]]} | INTERVIEW | PYTHON3 | CODECHEF | 6,291 | |
b4cce6e55828ee759caa5ed264085c9d | UNKNOWN | N Soldiers are lined up for a memory test. They are numbered from 0 to N-1 from left to right.
In the test, there are M rounds. In each round, Captain selects one position. Soldier at that position will be numbered 0. All the soldiers to the right of selected position will be numbered one greater than the soldier to his left. All the soldiers to the left of selected position will be numbered one greater than the soldier to his right.
eg. if N = 6 and selected position is 3, then the numbering will be [3, 2, 1, 0, 1, 2].
After M rounds, Captain asked each soldier to shout out the greatest number he was assigned during the M rounds. In order to check the correctness, Captain asked you to produce the correct values for each soldier (That is the correct value each soldier should shout out).
-----Input-----
The first line of the input contains an integer T denoting the number of test cases.
First line of each test case contains two integers, N and M.
Second line of each test case contains M integers, the positions selected by Captain, in that order.
-----Output-----
For each test case, output one line with N space separated integers.
-----Constraints-----
- 1 ≤ T ≤ 10^4
- 1 ≤ N ≤ 10^5
- 1 ≤ M ≤ 10^5
- 1 ≤ Sum of N over all testcases ≤ 10^5
- 1 ≤ Sum of M over all testcases ≤ 10^5
- 0 ≤ Positions selected by captain ≤ N-1
-----Example-----
Input
2
4 1
1
6 2
2 3
Output
1 0 1 2
3 2 1 1 2 3 | ["test = int(input())\nfor _ in range(test):\n n, m = map(int, input().split())\n indexArray = list(map(int, input().split()))\n mini = min(indexArray)\n maxi = max(indexArray)\n result = n*[0]\n for i in range(n):\n result[i] = max(maxi - i, i - mini)\n print(result[i], end=\" \")\n print()", "test = int(input())\nfor _ in range(test):\n n, m = map(int, input().split())\n indexArray = list(map(int, input().split()))\n mini = min(indexArray)\n maxi = max(indexArray)\n result = [0 for i in range(n)]\n for i in range(n):\n result[i] = max(maxi - i, i - mini)\n print(result[i], end=\" \")\n print()", "for i in range(int(input())):\n n,m = (int(i) for i in input().split())\n li = [int(i) for i in input().split()]\n ma,mi = max(li),min(li)\n for i in range(n):\n print(max(ma-i,i-mi),end=' ')\n print()", "T = int(input())\nans = []\n\nfor _ in range(T):\n N,M = [int(i) for i in input().split()]\n P = [int(i) for i in input().split()]\n\n left_most = N-1\n right_most = 0\n for i in range(M):\n if(P[i]>right_most):\n right_most = P[i]\n if(P[i]<left_most):\n left_most = P[i]\n s = ''\n for i in range(N):\n s += str(max(abs(i-left_most),abs(i-right_most))) + ' '\n ans.append(s)\n\nfor i in ans:\n print(i)", "for h in range(int(input())):\n n,m = map(int , input().split())\n l=list(map(int,input().split()))\n s=min(l)\n b=max(l)\n l1=[]\n for i in range(n):\n l1.append(max(abs(i-s),abs(i-b)))\n print(*l1)", "# cook your dish here\nfor h in range(int(input())):\n n,m = map(int , input().split())\n l=list(map(int,input().split()))\n s=min(l)\n b=max(l)\n l1=[]\n for i in range(n):\n l1.append(max(abs(i-s),abs(i-b)))\n print(*l1)", "for _ in range(int(input())):\n n,m = map(int,input().split())\n pos = list(map(int,input().split()))\n a = max(pos)\n p = a\n x = []\n j = 0\n for i in range(n):\n if i!=a and i<a:\n x.append(p)\n p-=1\n else:\n x.append(j)\n j+=1\n b = min(pos)\n p = b\n y = []\n j = 0\n for i in range(n):\n if i!=b and i<b:\n y.append(p)\n p-=1\n else:\n y.append(j)\n j+=1\n for i in range(len(y)):\n if x[i]>y[i]:\n print(x[i],end = \" \")\n else:\n print(y[i],end = \" \")\n print()\n", "t=int(input())\nfor i in range(t):\n res=[]\n n,m=map(int,input().strip().split())\n p = set(map(int,input().strip().split()))\n l,r=min(p),max(p)\n nl = []\n for j in range(n):\n nl.append(str(max(abs(r-j),abs(j-l))))\n res.append(' '.join(nl))\n for h in range(len(res)):\n print(res[h])", "def maximum(a, b):\n if a > b:\n return a\n else:\n return b\n\nfor _ in range(int(input())):\n n, m = input().split()\n arr = [0]*int(n)\n val = input().split()\n maxi = 0\n mini = int(n)+1\n for j in val:\n if int(j) > maxi:\n maxi = int(j)\n if int(j) < mini:\n mini = int(j)\n for i in range(int(n)):\n print(maximum(abs(i-mini), abs(maxi-i)), end = \" \")\n print()", "# cook your dish here\nfor _ in range(int(input())):\n n,m=map(int,input().split())\n l=list(map(int,input().split()))\n a=max(l)\n p=a\n b=min(l)\n x=[]\n j=0\n for i in range(n):\n if i!=a and i<a:\n x.append(p)\n p-=1 \n else:\n x.append(j)\n j+=1 \n p=b\n j=0\n y=[]\n for i in range(n):\n if i!=b and i<b:\n y.append(p)\n p-=1 \n else:\n y.append(j)\n j+=1 \n for i in range(len(x)):\n if x[i]>y[i]:\n print(x[i],end=\" \")\n else:\n print(y[i],end=\" \")\n print()\n \n \n \n \n \n ", "t = int(input())\nfor x in range(t):\n d = []\n n,m_len = list(map(int, input().split()))\n m = [ int(x) for x in input().split()]\n m.sort()\n a, b = m[0],m[-1]\n \n for y in range(n):\n d.append(max(y-a,b-y))\n print(*d)\n", "for _ in range(int(input())):\n n,m=map(int,input().split())\n l=list(map(int,input().strip().split(\" \")))\n l.sort()\n for i in range(n):\n print(max(abs(i-l[-1]),abs(l[0]-i)),end=\" \")\n print()", "for _ in range(int(input())):\n n,m = list(map(int,input().split()))\n m = list(map(int,input().split()))\n\n m.sort()\n sm = m[0]\n bg = m[-1]\n\n for i in range(n):\n print(max(abs(i-sm),abs(i-bg)),end=' ')\n\n print()", "test = int(input())\nfor _ in range(test):\n n, m = map(int, input().split())\n indexArray = list(map(int, input().split()))\n mini = min(indexArray)\n maxi = max(indexArray)\n result = [0 for i in range(n)]\n for i in range(n):\n result[i] = max(maxi - i, i - mini)\n print(result[i], end=\" \")\n print()", "# cook your dish here\nfor _ in range(int(input())):\n n,m=map(int,input().split())\n l=list(map(int,input().split()))\n ma=max(l)\n mi=min(l)\n for i in range(n):\n y=max(ma-i,i-mi)\n print(y,end=\" \")\n print()", "for t in range(int(input())):\n n,m=map(int,input().split())\n x=list(map(int,input().split()))\n max1=max(x)\n min1=min(x)\n for i in range(n):\n y=max(max1-i,i-min1)\n print(y,end=' ')\n print()\n ", "for t in range(int(input())):\n n,m=map(int,input().split())\n x=list(map(int,input().split()))\n max1=max(x)\n min1=min(x)\n for i in range(n):\n y=max(max1-i,i-min1)\n print(y,end=' ')\n print()\n ", "import sys \ninput=sys.stdin.readline\nfor i in range(int(input())):\n n,m = (int(i) for i in input().split())\n li = [int(i) for i in input().split()]\n ma,mi = max(li),min(li)\n for i in range(n):\n print(max(ma-i,i-mi),end=' ')\n print()", "import sys\ninput=sys.stdin.readline\nfor _ in range(int(input())):\n n,m=list(map(int,input().split()))\n p=list(map(int,input().split()))\n if m==1:\n s=p[0]\n b=[0]*n\n b[s]=0\n for i in range(n):\n if i<s or i>s:\n b[i]=abs(s-i)\n print(*b)\n else:\n t=min(p)\n r=max(p)\n k=[ ]\n r1=[0]*n\n t1=[0]*n\n t1[t]=0\n r1[r]=0\n for i in range(n):\n if i<t or i>t:\n t1[i]=abs(t-i)\n if i<r or i>r:\n r1[i]=abs(r-i)\n for i in range(n):\n k.append(max(t1[i],r1[i]))\n print(*k)\n"] | {"inputs": [["2", "4 1", "1", "6 2", "2 3"]], "outputs": [["1 0 1 2", "3 2 1 1 2 3"]]} | INTERVIEW | PYTHON3 | CODECHEF | 5,726 | |
f6ce779538fe835fdc054abe6000dc01 | UNKNOWN | Chef Tobby is trying to run a code given to him by Bhuvan for an experiment they want to include in the manuscript to be submitted to a conference. The deadline to submit the manuscript is within a couple of hours and Chef Tobby needs to finish the experiments before then.
The code given by Bhuvan is the following which runs given an array of N integers and another integer K :
void recurse ( array a, int n )
{
// n = size of array
define array b currently empty
consider all 2^n subsets of a[]
{
x = bitwise OR of elements in the subsets
add x into "b" if it is not present yet
}
if (sizeof( b ) == 1 << k)
{
printf(“Won”);
return;
}
recurse ( b, sizeof( b ) );
}
Chef Tobby tried to run an experiment with only one integer in the array with value 2 and K = 3. To his horror, he found out that the algorithm is resulting in an infinite loop. He is livid with the possibility that the algorithm can lead to infinite loops for certain cases. On closer inspection he determines that it might be possible to insert additional elements in the initial array to subvert the problem. Since time is very less, Chef Tobby would like to insert the minimum number of elements.
Chef Tobby has to finish writing the paper, so he asks his graduate student Leamas to fix it. Leamas has no idea how to fix the problem so he asks you for help.
-----Input section-----
The first line contains T, the number of test cases.
Each test case consists of 2 lines. The first line contains 2 integers N and K, denoting the number of elements in the array and parameter mentioned in problem statement.
Next line contains N space separated integers, denoting the elements of the array.
-----Output section-----
Output the minimum number of elements that need to be inserted so that inifinite loop can be avoided.
-----Input constraints-----
1 ≤ T ≤ 10
1 ≤ Sum of N over all test cases ≤ 105
1 ≤ K ≤ 20
0 ≤ A[i] ≤ 2K-1, where A[i] denotes the ith element of the array.
-----Sample Input - 1-----
1
2 2
3 1
-----Sample Output - 1-----
1
-----Explanation - 1-----
You can win the game by inserting the element 2 into the array.
-----Sample Input - 2-----
1
7 3
3 7 5 4 6 2 1
-----Sample Output - 2-----
0
-----Explanation - 2-----
The initial array will result will terminate in the first step of algorithm only. Thus there is no need to insert any new element. | ["from bisect import *\nfor x in range(eval(input())):\n n,k = list(map(int,input().split()))\n arr = list(map(int,input().split()))\n arr.sort()\n t = 1\n result = 0\n y = 0\n while y < n:\n if arr[y]<t:\n y += 1\n elif arr[y]==t:\n t = t*2\n y += 1\n else:\n result += 1\n t = t*2\n \n while t < 2**(k):\n result += 1\n t = t*2\n print(result)", "t = eval(input())\nx = [2**i for i in range(0,20)]\nfor _ in range(t):\n n,k = list(map(int,input().split()))\n arr =set(map(int,input().split()))\n count = 0\n for i in x:\n if i in arr:\n count+=1\n if k-count<=0:\n print(0)\n else:\n print(k-count)\n", "'''input\n1\n7 3\n3 7 5 4 6 2 1\n'''\n\n#~ @author = dwij28 (Abhinav Jha) ~#\n\ndef pow2(n): return n and (not(n & (n-1)))\n\nfor T in range(eval(input())):\n n, k = list(map(int, input().strip().split()))\n data = list(map(int, input().strip().split()))\n ans = set()\n for i in data:\n if pow2(i):\n ans.add(i)\n print(k - len(set(ans)))", "t = eval(input())\nfor i in range(0,t):\n ar = list(map(int , input().split()))\n arr = list(map(int , input().split()))\n count = 0\n for j in range(0, ar[1]):\n z = 1<<j\n if z not in arr :\n count+=1\n print(count)\n", "t = eval(input())\nfor tt in range(t):\n nk = input().split()\n n = int(nk[0])\n k = int(nk[1])\n lis = input().split()\n for i in range(n):\n lis[i] = int(lis[i])\n tmp = []\n for i in range(k):\n tmp.append(1 << i)\n count = 0\n for i in tmp:\n if i not in lis:\n count += 1\n print(count)", "for _ in range(eval(input())):\n n,k = list(map(int,input().split()))\n a = list(map(int,input().split()))\n elementsNeeded = [pow(2,i) for i in range(k)]\n ans = 0\n for i in elementsNeeded:\n if not(i in a):\n ans += 1\n print(ans)\n", "for _ in range(eval(input())):\n n,k=input().split()\n n,k=int(n),int(k)\n l=[int(x) for x in input().split()]\n s1=set(l)\n c=k\n for i in range(k):\n if 1<<i in s1:\n c-=1\n print(max(c,0))", "from bisect import *\nfor x in range(eval(input())):\n n,k = list(map(int,input().split()))\n arr = list(map(int,input().split()))\n arr.sort()\n t = 1\n ans = 0\n y = 0\n while y < n:\n if arr[y]<t:\n y += 1\n elif arr[y]==t:\n t = t*2\n y += 1\n else:\n ans += 1\n t = t*2\n #print t,ans\n while t < 2**(k):\n #print 1\n ans += 1\n t = t*2\n print(ans)", "# cook your code here\n# cook your code here\npow2=[(1<<i) for i in range(21)]\n\n\nfor t in range(eval(input())):\n n,k=list(map(int,input().split()))\n l=list(map(int,input().split()))\n cnt=0\n for i in range(k):\n if pow2[i] not in l:\n cnt+=1\n print(cnt)"] | {"inputs": [["- 1", "1", "2 2", "3 1"]], "outputs": [["1"]]} | INTERVIEW | PYTHON3 | CODECHEF | 2,590 | |
e30630d58bbf5dff7b4baf7050caf6ce | UNKNOWN | Chef recently opened a big e-commerce website where her recipes can be bought online. It's Chef's birthday month and so she has decided to organize a big sale in which grand discounts will be provided.
In this sale, suppose a recipe should have a discount of x percent and its original price (before the sale) is p. Statistics says that when people see a discount offered over a product, they are more likely to buy it. Therefore, Chef decides to first increase the price of this recipe by x% (from p) and then offer a discount of x% to people.
Chef has a total of N types of recipes. For each i (1 ≤ i ≤ N), the number of recipes of this type available for sale is quantityi, the unit price (of one recipe of this type, before the x% increase) is pricei and the discount offered on each recipe of this type (the value of x) is discounti.
Please help Chef find the total loss incurred due to this sale, if all the recipes are sold out.
-----Input-----
- The first line of the input contains a single integer T denoting the number of test cases. The description of T test cases follows.
- The first line of each test case contains a single integer N denoting the number of recipe types.
- N lines follow. The i-th of these lines contains three space-separated integers pricei, quantityi and discounti describing the i-th recipe type.
-----Output-----
For each test case, print a single line containing one real number — the total amount of money lost. Your answer will be considered correct if it has an absolute error less than 10-2.
-----Constraints-----
- 1 ≤ T ≤ 10
- 1 ≤ N ≤ 105
- 1 ≤ pricei, quantityi ≤ 100 for each valid i
- 0 ≤ discounti ≤ 100 for each valid i
-----Subtasks-----
Subtask #1 (30 points): 1 ≤ N ≤ 100
Subtask #2 (70 points): original constraints
-----Example-----
Input:
2
2
100 5 10
100 1 50
3
10 10 0
79 79 79
100 1 100
Output:
30.000000000
3995.0081000
-----Explanation-----
Example case 1: There are two recipes.
There are 5 recipes of the first type, each of them has a price of 100 and there is a 10% discount provided on it. Therefore, Chef first increases the price of each recipe by 10%, from 100 to 110. After that, she decreases the price by 10%, which makes the final price 99. The amount of money lost for each unit is 1, thus losing 5 for recipes of the first type.
There is only one recipe of the second type, with price 100 and a 50% discount. Therefore, Chef increases the price of the recipe by 50% from 100 to 150 and after that, she decreases its price by 50% to make its final price 75. She loses 25 for this recipe.
Overall, the amount of money Chef loses is 30. | ["for i in range(int(input())):\n n=int(input())\n s=0\n for i in range(n):\n a,b,c=map(int,input().split())\n d=(c/100)*a\n e=a+d\n f=e-((c/100)*e)\n g=a-f\n h=b*g\n s=s+h\n print(s)", "for i in range(int(input())):\n n=int(input())\n s=0\n for i in range(n):\n a,b,c=list(map(int,input().split()))\n d=(c/100)*a\n e=a+d\n f=e-((c/100)*e)\n g=a-f\n h=b*g\n s=s+h\n print(s)\n", "# cook your dish here\nfor _ in range(int(input())):\n n=int(input())\n s=0\n for i in range(n):\n p,q,d=map(int,input().split())\n x=(d/100)*p\n pr=p+x \n y=pr-((d/100)*pr)\n l=p-y\n tl=q*l \n s=s+tl\n print(s)", "for _ in range(int(input())):\n n = int(input())\n s =0\n for _ in range(n):\n p,q,d=map(int,input().split())\n pi= p + (d/100 *p)\n p_new = pi -(d/100 * pi)\n loss = (p - p_new)*q\n s=s+(loss)\n print(s)", "# cook your dish here\nt=int(input())\nfor i in range(t):\n n=int(input())\n s=0\n for j in range(n):\n p,q,d=map(int,input().split())\n tmp=p\n p=p+((d/100)*p)\n p=p-((d/100)*p)\n s=s+((tmp-p)*q)\n print(s)", "# cook your dish here\nfor i in range(int(input())):\n m=int(input())\n a=0\n for j in range(0,m):\n p,q,d=list(map(int,input().split()))\n a+=(p-((p+(d*p)/100)-(p+(d*p)/100)*(d/100)))*q\n print(\"{0:.9f}\".format(a))\n", "#Lists\ntempRecipeLossList = []\nanswerList = []\n\n#Functions\ndef split_loss_calculator(userInput):\n (price, quantity, discount) = list(map(int, userInput.split()))\n loss = price - (price * ((100+discount)/100) * ((100-discount)/100))\n tempRecipeLossList.append(loss * quantity)\n \n\n#Program\ntest_cases = int(input())\nfor i in range(test_cases):\n numRecipeTypes = int(input())\n for j in range(numRecipeTypes):\n split_loss_calculator(input())\n answerList.append(sum(tempRecipeLossList))\n tempRecipeLossList.clear()\n \nfor item in range(len(answerList)):\n print(\"{}\".format(answerList[item]))\n", "#Lists\ntempRecipeLossList = []\nanswerList = []\npriceList = []\nquantityList = []\ndiscountList = []\ntotal_lossList = []\n\n#Functions\ndef split_loss_calculator(userInput):\n (price, quantity, discount) = list(map(int, userInput.split()))\n loss = price - (price * ((100+discount)/100) * ((100-discount)/100))\n tempRecipeLossList.append(loss * quantity)\n \n\n#Program\ntest_cases = int(input())\nfor i in range(test_cases):\n numRecipeTypes = int(input())\n for j in range(numRecipeTypes):\n split_loss_calculator(input())\n answerList.append(sum(tempRecipeLossList))\n tempRecipeLossList.clear()\n \nfor item in range(len(answerList)):\n print(\"{}\".format(answerList[item]))\n", "t = int(input())\nfor i in range(t):\n n = int(input())\n loss=0\n for j in range(n):\n p, q, d = map(int, input().split())\n loss = loss + (q*(p-((p-p*(d/100))*((100+d)/100))))\n print(loss)", "# cook your dish here\nT=int(input())\nfor i in range(T):\n N=int(input())\n C=0\n for j in range(N):\n F=0\n P,Q,D=map(int,input().split())\n F=P+(P*(D/100))\n F=F-(F*(D/100))\n C+=((P-F)*Q)\n print(C)", "for i in range(int(input())):\n n=int(input())\n ans=0\n for j in range(0,n):\n p,q,d=list(map(int,input().split()))\n ans+=(p-((p+(d*p)/100)-(p+(d*p)/100)*(d/100)))*q\n print(\"{0:.9f}\".format(ans))\n", "for _ in range(int(input())):\n n=int(input())\n ans=0\n for j in range(0,n):\n p,q,d=map(int,input().split())\n ans+=(p-((p+(d*p)/100)-(p+(d*p)/100)*(d/100)))*q\n print(\"{0:.9f}\".format(ans))", "n=int(input())\nfor i in range(n):\n n1=int(input())\n loss=0\n for j in range(n1):\n l=list(map(int,input().split()))\n loss+=(l[1]*l[0]*(l[2]*l[2]))/10000\n \n print(loss)", "t=int(input())\nfor i in range(t):\n n=int(input())\n res=[]\n initialprice=0\n middleprice=0\n finalprice=0\n totalloss=1\n loss=0\n for i in range(n):\n p,q,d=list(map(float,input().split()))\n initialprice=p\n middleprice=initialprice+((initialprice*d)/100)\n finalprice=middleprice-((middleprice*d)/100)\n loss=initialprice-finalprice\n totalloss=float(q*loss)\n res.append(totalloss)\n print(float(sum(res)))\n \n", "T=int(input())\nfor i in range(T):\n N=int(input())\n C=0\n for j in range(N):\n F=0\n P,Q,D=map(int,input().split())\n F=P+(P*(D/100))\n F=F-(F*(D/100))\n C+=((P-F)*Q)\n print(C)", "T=int(input())\nfor i in range(T):\n N=int(input())\n C=0\n for j in range(N):\n F=0\n P,Q,D=list(map(int,input().split()))\n F=P+(P*(D/100))\n F=F-(F*(D/100))\n C+=((P-F)*Q)\n print(C)\n", "t = int(input())\n\nfor _ in range(t):\n a = int(input())\n l = 0\n for _ in range(a):\n x, y, z = map(int, input().split())\n add_per = x + (x*(z/100))\n act_prz = add_per * (z/100)\n loss = add_per - act_prz\n act_lss = (x-loss) * y\n l += act_lss\n print(\"%0.7f\"%l)", "# cook your dish here\nfor _ in range(int(input())):\n n=int(input())\n loss=0\n for i in range(n):\n p,q,d=list(map(int,input().split()))\n inc=p+(d/100)*p \n dec=inc-(d/100)*inc\n diff=p-dec\n loss+=diff*q \n print(\"{0}\".format(loss))\n", "for t in range(int(input())):\n totallossforthiscase = 0\n for i in range(int(input())):\n price , quantity , discount = map(int,input().split())\n originalprice = price\n price = price*(1 + (discount/100))\n price = price*(1 - (discount /100))\n diff = originalprice - price\n loss = diff * quantity\n totallossforthiscase +=loss\n print(totallossforthiscase)", "for _ in range(int(input())):\n n=int(input())\n lst=[]\n for i in range(n):\n original_price, quantity, discount=[*map(int,input().strip().split())]\n increased_price=original_price+((discount/100)*original_price)\n reduced_price=increased_price-((discount/100)*increased_price)\n lst.append((abs(original_price-reduced_price))*quantity)\n print(\"{:.9f}\".format(sum(lst)))", "t=input()\nt=int(t)\nwhile t!=0 :\n n=input()\n n=int(n)\n f=0\n while n!=0 :\n inp=input().split(\" \")\n inp=[int(x) for x in inp]\n np=(inp[0]*inp[2]*0.01)+inp[0]\n f+=(inp[0]-(np-(np*inp[2]*0.01)))*inp[1]\n n-=1\n print(f)\n t-=1", "# cook your dish here\nfor _ in range(int(input())):\n n=int(input())\n loss=0\n for t in range(n):\n p,q,d=map(int,input().split())\n ip=p+(p*(d/100))\n fp=ip-(ip*(d/100))\n loss+=(p-fp)*q\n print(loss)", "# cook your dish here\nfor e in range(int(input())):\n c = 0 \n num=int(input())\n for i in range(num):\n p,q,r = map(int,input().split()) \n x = p + (r/100)*p \n x-=(r/100)*x \n c+=(p-x)*q \n print(\"{0:.6f}\".format(c)) ", "# cook your dish here\ntry:\n tap=int(input())\n for i in range(tap):\n num=int(input())\n loss=0\n for j in range(num):\n l=list(map(int,input().split()))\n p=l[0]\n r=l[1]\n d=l[2]\n \n t=p+(d/100)*p\n a=t-t*(d/100)\n loss +=(p-a)*r\n \n print(loss)\nexcept:\n pass\n"] | {"inputs": [["2", "2", "100 5 10", "100 1 50", "3", "10 10 0", "79 79 79", "100 1 100"]], "outputs": [["30.000000000", "3995.0081000"]]} | INTERVIEW | PYTHON3 | CODECHEF | 6,653 | |
924265496027162fdb299f6b6e2cbd4a | UNKNOWN | A plot of land can be described by $M x N$ dots such that horizontal and vertical distance between any two dots is 10m.
Mr. Wolf would like to build a house in the land such that all four sides of the house are equal. Help Mr. Wolf to find the total number of unique positions where houses can be built. Two positions are different if and only if their sets of four dots are different.
-----Input:-----
The first line of the input gives the number of test cases, $T$. $T$ lines follow. Each line has two integers $M$ and $N$: the number of dots in each row and column of the plot, respectively.
-----Output:-----
For each test case, output one single integer containing the total number of different positions where the house can be built.
-----Constraints-----
- $1 \leq T \leq 100$
- $2 \leq M \leq 10^9$
- $2 \leq N \leq 10^9$
-----Sample Input:-----
4
2 4
3 4
4 4
1000 500
-----Sample Output:-----
3
10
20
624937395
-----EXPLANATION:-----
Map 1
Map 2
Map 3 | ["# cook your dish here\nfrom sys import stdin,stdout,setrecursionlimit\nfrom math import ceil\n\nmod = 1000000007\nt = int(stdin.readline())\nfor _ in range(t):\n m,n = list(map(int,input().split()))\n if m < n:\n m,n = n,m\n\n y = n-1\n s1 = ((y*(y+1)) //2)%mod\n s2 = ((y*(y+1)*(2*y+1)) //6)%mod\n s3 = ((y*y*(y+1)*(y+1)) //4)%mod\n \n \n ans = (m*n*s1 - (m+n)*s2+s3)%mod\n # ans = (m*(m+1)*(2*m*n + 4*n + 2 - m*m - m)//12)\n \n print(ans)\n \n", "# cook your dish here\nmod = 1000000007\nt = int(input())\nfor _ in range(t):\n m, n = list(map(int, input().split()))\n x = min(m, n)\n f1 = m * n % mod\n s1 = x * (x - 1) // 2 % mod\n f2 = (m + n) % mod\n s2 = x * (x - 1) * (2*x - 1) // 6 % mod\n s3 = s1 * s1 % mod\n ans = (f1 * s1 % mod - f2 * s2 % mod + s3) % mod\n print(ans)\n\n\n", "t=int(input())\r\ne=10**9+7\r\nfor _ in range(t):\r\n a,b=list(map(int,input().split()))\r\n a-=1\r\n b-=1\r\n c=min(a,b)\r\n x= (c*(c+1))//2\r\n c-=1\r\n xx =(c*(c+1))//2\r\n y,z = (c*(c+1)*(2*c+1))//6,xx*xx\r\n ans = x*a*b+y+z\r\n ans-=(xx+y)*(a+b)\r\n print(ans%e)\r\n \r\n"] | {"inputs": [["4", "2 4", "3 4", "4 4", "1000 500"]], "outputs": [["3", "10", "20", "624937395"]]} | INTERVIEW | PYTHON3 | CODECHEF | 1,186 | |
470ce3f53720f92cf1f8eb70ca46102d | UNKNOWN | Chef hates unoptimized codes and people who write such codes. One fine day he decided to look through the kitchen's codebase and found a function whose pseudo-code is given here:
input: integer N, list X[1, 2, ..., N], list Y[1, 2, ..., N]
output: integer res
function:
set res = 0;
for i := 1 to N do
for j := 1 to N do
for k := 1 to N do
if (X[i] = X[j]) OR (X[j] = X[k]) OR (X[k] = X[i])
continue
else
set res = max(res, Y[i] + Y[j] + Y[k])
return res
Luckily enough this code gets triggered only if the Head Chef makes a submission. But still there is a possibility that this can crash the judge. So help Chef by writing a new function which does the same thing but is faster.
-----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 an integer N denoting the number of elements in the two lists.
- The i-th of the next N lines contains a pair of space-separated integers denoting the values of X[i] and Y[i] respectively.
-----Output-----
For each test case, output an integer corresponding to the return value of the function.
-----Constraints-----
- 1 ≤ T ≤ 10
- 1 ≤ N ≤ 105
- 1 ≤ X[i], Y[i] ≤ 108
-----Example-----
Input
2
3
1 3
3 1
1 2
5
1 3
2 4
1 2
3 2
3 4
Output
0
11
-----Explanation-----
Testcase 2: The maximum is attained when i = 1, j = 2 and k = 5. This leads to res being 3 + 4 + 4 = 11. This value is attained in other iterations as well, but it never exceeds this, and hence this is the answer. | ["# cook your dish here\nfor _ in range(int(input())):\n d=dict()\n ls=[]\n for i in range(int(input())):\n ls=list(map(int,input().split()))\n if ls[0] in d:\n d[ls[0]]=max(ls[1],d[ls[0]])\n else:\n d[ls[0]]=ls[1]\n # print(d)\n if len(d)<3:\n print(0)\n else:\n kd=list(d.values())\n kd.sort()\n # print(kd)\n print(kd[-1]+kd[-2]+kd[-3])\n", "# cook your dish here\nfor _ in range(int(input())):\n d=dict()\n ls=[]\n for i in range(int(input())):\n ls=list(map(int,input().split()))\n if ls[0] in d:\n d[ls[0]]=max(ls[1],d[ls[0]])\n else:\n d[ls[0]]=ls[1]\n # print(d)\n if len(d)<3:\n print(0)\n else:\n kd=list(d.values())\n kd.sort()\n # print(kd)\n print(kd[-1]+kd[-2]+kd[-3])\n", "# cook your dish here\nfor _ in range(int(input())):\n d=dict()\n ls=[]\n for i in range(int(input())):\n ls=list(map(int,input().split()))\n if ls[0] in d:\n d[ls[0]]=max(ls[1],d[ls[0]])\n else:\n d[ls[0]]=ls[1]\n # print(d)\n if len(d)<3:\n print(0)\n else:\n kd=list(d.values())\n kd.sort()\n # print(kd)\n print(kd[-1]+kd[-2]+kd[-3])\n", "try:\n from sys import stdin as si , stdout as so\n\n for _ in range(int(si.readline())):\n m = {}\n n = int(si.readline())\n \n for i in range(n):\n a , b = map(int , si.readline().split())\n if a not in m:\n m[a] = b\n else:\n m[a] = max(m[a] , b)\n \n if len(m) < 3:\n so.write(str(0) + '\\n')\n else:\n l = list(m.values())\n l.sort()\n so.write(str(l[-1] + l[-2] + l[-3]) + '\\n')\nexcept:\n pass", "\ndef optimize(d):\n l = list(d.keys())\n if(len(l)<3):\n return 0\n else:\n j = []\n for i in l:\n j.append(d[i])\n j.sort()\n return (j[len(j)-1] + j[len(j)-2] + j[len(j)-3])\n\n\ntry:\n for _ in range(int(input())):\n x,y,d=[],[],{}\n for i in range(int(input())):\n j = list(map(int,input().strip().split()))\n x.append(j[0])\n y.append(j[1])\n if(x[i] not in d):\n d[x[i]] = y[i]\n else:\n d[x[i]] = max(y[i], d[x[i]])\n print(optimize(d))\nexcept EOFError as e : pass\n", "from collections import defaultdict\nfrom operator import itemgetter\nfor _ in range(int(input())):\n n=int(input())\n d=defaultdict(list)\n for i in range(n):\n x,y=map(int,input().split( ))\n if not d[x]:\n d[x].append(y)\n else:\n d[x][0]=max(d[x][0],y)\n #print(d)\n \n l=sorted(d.items(),key=itemgetter(1))[::-1]\n #print(l)\n try:\n print(sum(l[0][1]+l[1][1]+l[2][1]))\n except:\n print(0)", "for _ in range(int(input())):\n n=int(input())\n d={}\n for i in range(n):\n x,y=list(map(int,input().split( )))\n if x not in d:\n d[x]=[]\n d[x].append(y)\n else:\n d[x][0]=max(d[x][0],y)\n y=[]\n for v in d:\n y.extend(d[v])\n #print(y)\n if len(y)>=3:\n v1=max(y)\n y.remove(v1)\n v2=max(y)\n y.remove(v2)\n v3=max(y)\n y.remove(v3)\n print(v1+v2+v3)\n else:\n print(0)\n", "from collections import defaultdict\nfrom operator import itemgetter\nfor _ in range(int(input())):\n n=int(input())\n d=defaultdict(list)\n for i in range(n):\n x,y=list(map(int,input().split( )))\n if not d[x]:\n d[x].append(y)\n else:\n d[x][0]=max(d[x][0],y)\n y=[]\n for v in d:\n y.extend(d[v])\n #print(y)\n if len(y)>=3:\n v1=max(y)\n y.remove(v1)\n v2=max(y)\n y.remove(v2)\n v3=max(y)\n y.remove(v3)\n print(v1+v2+v3)\n else:\n print(0)\n", "# cook your dish here\nT = int(input())\n\nfor _ in range(T):\n\n res = 0\n N = int(input())\n X = []\n Y = []\n for i in range(N):\n words = input().split()\n X.append(int(words[0]))\n Y.append(int(words[1]))\n\n d = {}\n\n for i in range(N):\n if(X[i] not in d.keys()):\n d[X[i]] = []\n d[X[i]].append(Y[i])\n else:\n d[X[i]].append(Y[i])\n\n #print(d)\n sum_lst = []\n for key in d.keys():\n maxi = d[key][0]\n for num in d[key]:\n if(maxi<num):\n maxi = num\n sum_lst.append(maxi)\n\n if(len(sum_lst)>=3):\n max1 = max(sum_lst)\n sum_lst.remove(max1)\n max2 = max(sum_lst)\n sum_lst.remove(max2)\n max3 = max(sum_lst)\n res = max1 + max2 + max3\n else:\n res = 0\n\n print(res)", "T = int(input())\n\nfor _ in range(T):\n\n res = 0\n N = int(input())\n X = []\n Y = []\n for i in range(N):\n words = input().split()\n X.append(int(words[0]))\n Y.append(int(words[1]))\n\n d = {}\n\n for i in range(N):\n if(X[i] not in d.keys()):\n d[X[i]] = []\n d[X[i]].append(Y[i])\n else:\n d[X[i]].append(Y[i])\n\n #print(d)\n sum_lst = []\n for key in d.keys():\n maxi = d[key][0]\n for num in d[key]:\n if(maxi<num):\n maxi = num\n sum_lst.append(maxi)\n\n if(len(sum_lst)>=3):\n max1 = max(sum_lst)\n sum_lst.remove(max1)\n max2 = max(sum_lst)\n sum_lst.remove(max2)\n max3 = max(sum_lst)\n res = max1 + max2 + max3\n else:\n res = 0\n\n print(res)", "for r in range(int(input())):\n x,y,d =[],[],{}\n for p in range(int(input())):\n j=list(map(int,input().split()))\n x.append(j[0]),y.append(j[1])\n if(x[p] not in d):d[x[p]]=y[p]\n else:d[x[p]]=max(y[p],d[x[p]])\n l=list(d.keys())\n if(len(l)<3):print(0)\n else:\n j=[]\n for x in l: j.append(d[x])\n j.sort()\n print(j[len(j)-1]+j[len(j)-2]+j[len(j)-3])", "t=int(input())\nfor r in range(0,t):\n n=int(input())\n x,y=[],[]\n d={}\n for p in range(n):\n j=list(map(int,input().split()))\n x.append(j[0])\n y.append(j[1])\n if(x[p] not in d):\n d[x[p]]=y[p]\n else:\n d[x[p]]=max(y[p],d[x[p]])\n l=list(d.keys())\n if(len(l)<3):\n print(0)\n else:\n j=[]\n for x in l:\n j.append(d[x])\n j.sort()\n print(j[len(j)-1]+j[len(j)-2]+j[len(j)-3])", "import sys\nimport queue\n\nt = int(input())\n\n\n\nwhile(t):\n\n n = int(input())\n d = {}\n\n for i in range(n):\n line = input().split()\n x = int(line[0])\n y = int(line[1])\n if (x not in d):\n d[x] = y\n else:\n d[x] = max(d[x],y)\n\n p = list(d.items())\n\n n = len(p)\n for i in range(n):\n p[i] = (p[i][1],p[i][0])\n\n p.sort()\n #print(p)\n\n if (len(p) > 2):\n n = len(p)\n sys.stdout.write(str(p[n-1][0]+p[n-2][0]+p[n-3][0])+\"\\n\")\n else:\n sys.stdout.write(\"0\\n\")\n\n t -= 1\n\n \n \n \n \n\n \n", "t = int(input())\nwhile t:\n t-=1\n n = int(input())\n d = dict()\n for i in range(n):\n x,y = map(int,input().split())\n f = d.get(x)\n if f == None:\n d[x] = y\n else:\n d[x] = max(d[x],y)\n z = sorted(d.values())[::-1]\n l = len(z)\n if l<3:\n print(0)\n else:\n print(z[0]+z[1]+z[2])", "# Author: Dancing Monkey | Created: 09.DEC.2018\n\nfor _ in range(int(input())):\n n = int(input())\n l = []\n for i in range(n):\n x, y = map(int, input().split())\n l.append((y, x))\n l.sort(reverse=True)\n\n y1, x1 = l[0]\n y2 = x2 = y3 = x3 = -1\n i = 1\n while i < n:\n y, x = l[i]\n if x == x1:p = 0\n else:\n y2, x2 = y, x\n break\n i += 1\n\n if i == n:\n print(0)\n continue\n while i < n:\n y, x = l[i]\n if x == x1 or x == x2:p = 1\n else:\n y3, x3 = y, x\n break\n i += 1\n if i == n:\n print(0)\n continue\n\n print(y3 + y2 + y1)", "for _ in range(int(input())):\n n=int(input())\n l=[]\n x=set()\n res=0\n for z in range(n):\n xi,yi=(list(map(int,input().split())))\n x.add(xi)\n l.append([xi,yi])\n l.sort(reverse=True, key= lambda q: q[1])\n if len(x)<3:\n res=0\n else:\n temp=[]\n for i in range(n):\n if len(temp)==3:\n break\n elif l[i][0] in temp:\n continue\n else:\n res+=l[i][1]\n temp.append(l[i][0])\n print(res)\n \n \n", "t=int(input())\nfor i in range(t):\n a=[]\n n=int(input())\n for i in range(n):\n x,y=[int(i) for i in input().split()]\n a.append((x,y))\n a.sort()\n #print(a)\n q=a[0][0]\n z=[]\n for i in range(1,n):\n #print(a[i][0],q)\n if a[i][0]!=q:\n z.append(a[i-1][1])\n #print(a[i])\n q=a[i][0]\n z.append(a[n-1][1])\n l=len(z)\n if l<3:\n print(0)\n else:\n z.sort()\n print(z[l-1]+z[l-2]+z[l-3])\n", "for T in range(int(input())):\n\n N = int(input())\n \n d = dict()\n for i in range(N):\n x,y = list(map(int,input().split()))\n\n f = d.get(x)\n\n if f==None:\n d[x] = y\n else:\n d[x] = max(f,y)\n\n l = len(d)\n\n if l<3:\n print(0)\n else:\n Y = sorted(list(d.items()), key=lambda x: x[1])\n print(Y[l-1][1]+Y[l-2][1]+Y[l-3][1])\n\n"] | {"inputs": [["2", "3", "1 3", "3 1", "1 2", "5", "1 3", "2 4", "1 2", "3 2", "3 4"]], "outputs": [["0", "11"]]} | INTERVIEW | PYTHON3 | CODECHEF | 8,071 | |
db0d595ba9b0057fefb974c3f9517ead | UNKNOWN | Emily and Mia are friends. Emily got Mia’s essay paper, but since she is a prankster, she decided to meddle with the words present in the paper. She changes all the words in the paper into palindromes. To do this, she follows two rules:
- In one operation she can only reduce the value of an alphabet by 1, i.e. she can change ‘d’ to ‘c’, but she cannot change ‘c’ to ‘d’ or ‘d’ to ‘b’.
- The alphabet ‘a’ will not be reduced any further.
Each reduction in the value of any alphabet is counted as a single operation. Find the minimum number of operations required to convert a given string into a palindrome.
-----Input:-----
- The first line contains an integer $T$, denoting the number of test cases.
- Each test case consists of a string $S$ containing only lowercase characters with no spaces.
-----Output:-----
For each test case on a new line, print the minimum number of operations for the corresponding test case.
-----Constraints-----
- $1<=T<=10$
- $1<=|S|<=10^7$, where $|S|$ denotes length of string S.
-----Sample Input:-----
4
abc
abcba
abcd
cba
-----Sample Output:-----
2
0
4
2
-----EXPLANATION:-----
For the first test case string = “abc”
c->b->a so the string become “aba” which is a palindrome. For this we perform 2 operations | ["t=int(input())\r\nfor _ in range(t):\r\n xyz = input().strip()\r\n \r\n string = 0\r\n\r\n for i in range(len(xyz)//2):\r\n string = string + (abs(ord(xyz[i])-ord(xyz[len(xyz)-i-1])))\r\n \r\n print(string)", "# cook your dish here\nnumbers = int(input())\nfor x in range(numbers):\n st = input().strip()\n l = len(st)\n res = 0\n j = l - 1\n i = 0\n while(i < j):\n if (st[i] != st[j]):\n res += abs(ord(st[i])-ord(st[j]))\n i = i + 1\n j = j - 1\n if res==0:\n print(0)\n else:\n print(res)", "t=int(input())\r\nfor _ in range(t):\r\n l = input().strip()\r\n #pal = l[::-1]\r\n s = 0\r\n #if l == pal:\r\n # print(0)\r\n for i in range(len(l)//2):\r\n s = s + (abs(ord(l[i])-ord(l[len(l)-i-1])))\r\n #print(abs(ord(l[i])-ord(pal[i])))\r\n print(s)", "import sys\r\nfrom functools import lru_cache, cmp_to_key\r\nfrom heapq import merge, heapify, heappop, heappush\r\nfrom math import *\r\nfrom collections import defaultdict as dd, deque, Counter as C\r\nfrom itertools import combinations as comb, permutations as perm\r\nfrom bisect import bisect_left as bl, bisect_right as br, bisect\r\nfrom time import perf_counter\r\nfrom fractions import Fraction\r\nimport copy\r\nimport time\r\nstarttime = time.time()\r\nmod = int(pow(10, 9) + 7)\r\nmod2 = 998244353\r\n# from sys import stdin\r\n# input = stdin.readline\r\ndef data(): return sys.stdin.readline().strip()\r\ndef out(*var, end=\"\\n\"): sys.stdout.write(' '.join(map(str, var))+end)\r\ndef L(): return list(sp())\r\ndef sl(): return list(ssp())\r\ndef sp(): return map(int, data().split())\r\ndef ssp(): return map(str, data().split())\r\ndef l1d(n, val=0): return [val for i in range(n)]\r\ndef l2d(n, m, val=0): return [l1d(n, val) for j in range(m)]\r\ntry:\r\n # sys.setrecursionlimit(int(pow(10,7)))\r\n sys.stdin = open(\"input.txt\", \"r\")\r\n # sys.stdout = open(\"../output.txt\", \"w\")\r\nexcept:\r\n pass\r\ndef pmat(A):\r\n for ele in A:\r\n print(*ele,end=\"\\n\")\r\ndef seive():\r\n prime=[1 for i in range(10**6+1)]\r\n prime[0]=0\r\n prime[1]=0\r\n for i in range(10**6+1):\r\n if(prime[i]):\r\n for j in range(2*i,10**6+1,i):\r\n prime[j]=0\r\n return prime\r\n\r\nfor _ in range(L()[0]):\r\n s=input().strip()\r\n n=len(s)\r\n ans=0\r\n for i in range((n-n%2)//2):\r\n # print(s[i],s[n-1-i],i,n-1-i,n)\r\n ans+=(abs(ord(s[i])-ord(s[n-1-i])))\r\n print(ans)\r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\nendtime = time.time()\r\n# print(f\"Runtime of the program is {endtime - starttime}\")\r\n\r\n", "t = int(input())\nlst = [\"0\",\"a\",\"b\",\"c\",\"d\",\"e\",\"f\",\"g\",\"h\",\"i\",\"j\",\"k\",\"l\",\"m\",\"n\",\"o\",\"p\",\"q\",\"r\",\"s\",\"t\",\"u\",\"v\",\"w\",\"x\",\"y\",\"z\"]\nfor i in range(t):\n s = list(input().strip())\n count=0\n s.insert(0,\"temp\")\n for i in range(1,len(s)):\n #print(s[-i])\n if i > len(s)//2 :\n break\n if s[i] != s[-i] :\n count+=abs(lst.index(s[i])-lst.index(s[-i]))\n print(count)", "t = int(input())\nlst = [\"0\",\"a\",\"b\",\"c\",\"d\",\"e\",\"f\",\"g\",\"h\",\"i\",\"j\",\"k\",\"l\",\"m\",\"n\",\"o\",\"p\",\"q\",\"r\",\"s\",\"t\",\"u\",\"v\",\"w\",\"x\",\"y\",\"z\"]\nfor i in range(t):\n s = list(input().strip())\n count=0\n s.insert(0,\"temp\")\n for i in range(1,len(s)):\n #print(s[-i])\n if i > len(s)//2 :\n break\n if s[i] != s[-i] :\n count+=abs(lst.index(s[i])-lst.index(s[-i]))\n print(count)", "t=int(input())\nfor _ in range(t):\n a=input().strip()\n a=list(a)\n b='abcdefghijklmnopqrstuvwxyz'\n if a==a[::-1]:\n print(0)\n else:\n c=0\n j=len(a)-1\n for i in range(0,len(a)//2):\n if a[i]!=a[j]:\n k=max(a[i],a[j])\n p=min(a[i],a[j])\n c+=ord(k)-ord(p)\n j-=1\n print(c)", "\nn=int(input())\nfor i in range(n):\n s=input().strip()\n c=0 \n I=0 \n J=len(s)-1 \n while I<J:\n c+=abs(ord(s[I])-ord(s[J]))\n I+=1 \n J-=1\n print(c)", "for _ in range(int(input())):\n S = input().strip()\n i, j = 0, len(S)-1\n count = 0\n while i < j:\n if S[i] != S[j]:\n count += abs(ord(S[i]) - ord(S[j]))\n i += 1 \n j -= 1 \n print(count)", "from sys import stdin, stdout\nfrom math import floor, gcd, fabs, factorial, fmod, sqrt, inf, log\nfrom collections import defaultdict as dd, deque\nfrom heapq import merge, heapify, heappop, heappush, nsmallest\nfrom bisect import bisect_left as bl, bisect_right as br, bisect\nmod = pow(10, 9) + 7\nmod2 = 998244353\ndef inp(): return stdin.readline().strip()\ndef out(var, end=\"\\n\"): stdout.write(str(var)+\"\\n\")\ndef outa(*var, end=\"\\n\"): stdout.write(' '.join(map(str, var)) + end)\ndef lmp(): return list(mp())\ndef mp(): return list(map(int, inp().split()))\ndef smp(): return list(map(str, inp().split()))\ndef l1d(n, val=0): return [val for i in range(n)]\ndef l2d(n, m, val=0): return [l1d(n, val) for j in range(m)]\ndef remadd(x, y): return 1 if x%y else 0\ndef ceil(a,b): return (a+b-1)//b\n\ndef isprime(x):\n if x<=1: return False\n if x in (2, 3): return True\n if x%2 == 0: return False\n for i in range(3, int(sqrt(x))+1, 2):\n if x%i == 0: return False\n return True\n\nfor _ in range(int(inp())):\n s = inp()\n l = len(s)\n i=0\n j=l-1\n c = 0\n while(j>i):\n c += abs(ord(s[i])-ord(s[j]))\n i+=1\n j-=1\n print(c)\n", "# cook your dish here\r\nt=int(input())\r\nfor _ in range(t):\r\n str1=input().strip()\r\n n=len(str1)\r\n res=0\r\n for i in range(0,int(n/2)):\r\n #print(ord(str1[i]),ord(str1[n-i-1]))\r\n res += abs(ord(str1[i])-ord(str1[n-i-1]))\r\n print(res)\r\n", "# cook your dish here\nfor t in range(int(input())):\n a=input().strip()\n c=0\n n=len(a)\n for i in range(n//2):\n c+=abs(ord(a[i])-ord(a[n-i-1]))\n print(c)", "\"\"\"\n _____ _ _ __ __ ____ __ _\n/ ____| | | | | | \\ / | / \\ | \\ | |\n| |___ | | | | | \\/ | / _ \\ | . \\ | |\n\\____ \\ | | | | | |\\__/| | | /_\\ | | |\\ \\| |\n____| | | \\__/ | | | | | | __ | | | \\ ` |\n|_____/ \\______/ |_| |_| |__| |__| |_| \\__|\n\n\"\"\"\n\"\"\"\n/*\nTemplate by Sai Suman Chitturi\nLinkedin: https://www.linkedin.com/in/sai-suman-chitturi-9727a2196/\nHackerrank: https://www.hackerrank.com/skynetasspyder?hr_r=1\nCodechef: https://www.codechef.com/users/suman_18733097\nCodeforces: http://codeforces.com/profile/saisumanchitturi\nGithub: https://github.com/ChitturiSaiSuman\nHackerearth: https://www.hackerearth.com/@chitturi7\nSPOJ: Sai Suman Chitturi @out_of_bound\n*/\n\"\"\"\nfrom sys import stdin,stdout,stderr,setrecursionlimit\nfrom math import pi,sqrt,gcd,ceil,floor,log2,log10,factorial\nfrom math import cos,acos,tan,atan,atan2,sin,asin,radians,degrees,hypot\nfrom bisect import insort,insort_left,insort_right,bisect_left,bisect_right,bisect\nfrom functools import reduce\nfrom itertools import combinations,combinations_with_replacement,permutations\nfrom fractions import Fraction\nfrom random import choice,getrandbits,randint,random,randrange,shuffle\nfrom re import compile,findall,escape,search,match\nfrom statistics import mean,median,mode\nfrom heapq import heapify,heappop,heappush,heappushpop,heapreplace,merge,nlargest,nsmallest\nfrom collections import deque,OrderedDict,defaultdict\nfrom collections import Counter,namedtuple,ChainMap,UserDict,UserList,UserString\nfrom numpy import dot,trace,argmax,argmin,array,cumprod,cumsum,matmul\n\nmod = 10**9+7\nhell = 10**9+9\ninf = 10**18\nlcm = lambda x,y: ((x*y)//gcd(x,y))\nadd = lambda x,y: (x%mod+y%mod)%mod\nsub = lambda x,y: ((x%mod-y%mod)+mod)%mod\nmul = lambda x,y: ((x%mod)*(y%mod))%mod\ninverse = lambda x: (pow(x,mod-2,mod))\nsetBitCount = lambda x: bin(x).count(\"1\")\nsumOfDigits = lambda x: sum([int(i) for i in str(x)])\n\nsize = 10**6+1\n\nsetrecursionlimit(size)\n\ndef preCompute():\n return\n\ndef solve():\n return\n\ndef main():\n io = IO()\n testcases = 0\n if testcases == 0:\n testcases = io.nextInt()\n preCompute()\n\n for test in range(testcases):\n # io.write(\"Case #%d: \"%(test+1),end=\"\")\n s = io.String()\n n = len(s)\n ans = 0\n for i in range(n//2):\n ans += abs(ord(s[i])-ord(s[n-i-1]))\n io.write(ans)\n # solve()\n\n\n\nclass IO:\n def next(self):\n return stdin.readline().strip()\n def nextLine(self):\n return self.next()\n def String(self):\n return self.next()\n def nextStrings(self):\n return list(map(str,self.next().split()))\n def nextInt(self):\n return int(self.next())\n def Int(self):\n return self.nextInt()\n def nextFloat(self):\n return float(next())\n def Float(self):\n return self.nextFloat()\n def nextList(self):\n return list(map(int,self.next().split()))\n def List(self):\n return self.nextList()\n def nextTuple(self):\n return tuple(map(int,self.next().split()))\n def Tuple(self):\n return self.nextTuple()\n def debug(self,*obj,sep=\" \",end=\"\\n\"):\n string = sep.join([str(item) for item in obj])+end\n stderr.write(string)\n def print(self,*obj,sep=\" \",end='\\n'):\n string = sep.join([str(item) for item in obj])+end\n stdout.write(string)\n def write(self,*obj,sep=\" \",end=\"\\n\"):\n self.print(*obj,sep=sep,end=end)\n\nmain()", "# cook your dish here\nfor test in range(int(input())):\n s = input().strip()\n \n if not len(s) % 2:\n mid = len(s) // 2\n first = s[:mid]\n second = s[mid:]\n else:\n mid = len(s) // 2\n first = s[:mid]\n second = s[mid + 1:]\n \n second = second[::-1]\n \n \n cost = 0\n for i in range(len(first)):\n cost += abs(ord(first[i]) - ord(second[i]))\n \n print(cost)"] | {"inputs": [["4", "abc", "abcba", "abcd", "cba"]], "outputs": [["2", "0", "4", "2"]]} | INTERVIEW | PYTHON3 | CODECHEF | 10,309 | |
fd42e0f59c78c72302bea6bb6f580692 | UNKNOWN | Chef likes all arrays equally. But he likes some arrays more equally than others. In particular, he loves Rainbow Arrays.
An array is Rainbow if it has the following structure:
- First a1 elements equal 1.
- Next a2 elements equal 2.
- Next a3 elements equal 3.
- Next a4 elements equal 4.
- Next a5 elements equal 5.
- Next a6 elements equal 6.
- Next a7 elements equal 7.
- Next a6 elements equal 6.
- Next a5 elements equal 5.
- Next a4 elements equal 4.
- Next a3 elements equal 3.
- Next a2 elements equal 2.
- Next a1 elements equal 1.
- ai can be any non-zero positive integer.
- There are no other elements in array.
Help Chef in finding out if the given array is a Rainbow Array or not.
-----Input-----
- The first line of the input contains an integer T denoting the number of test cases.
- The first line of each test case contains an integer N, denoting the number of elements in the given array.
- The second line contains N space-separated integers A1, A2, ..., AN denoting the elements of array.
-----Output-----
- For each test case, output a line containing "yes" or "no" (without quotes) corresponding to the case if the array is rainbow array or not.
-----Constraints-----
- 1 ≤ T ≤ 100
- 7 ≤ N ≤ 100
- 1 ≤ Ai ≤ 10
-----Subtasks-----
- Subtask 1 (100 points) : Original constraints
-----Example-----
Input
3
19
1 2 3 4 4 5 6 6 6 7 6 6 6 5 4 4 3 2 1
14
1 2 3 4 5 6 7 6 5 4 3 2 1 1
13
1 2 3 4 5 6 8 6 5 4 3 2 1
Output
yes
no
no
-----Explanation-----
The first example satisfies all the conditions.
The second example has 1 element of value 1 at the beginning and 2 elements of value 1 at the end.
The third one has no elements with value 7 after elements with value 6. | ["t=int(input())\nx=[1,2,3,4,5,6,7]\nfor i in range(t):\n N=int(input())\n a=list(map(int,input().split())) \n rev=a[::-1] \n dup=set(a) \n if rev== a and list(dup) ==x: \n print(\"yes\")\n else:\n print(\"no\")", "# cook your dish here\nt=int(input())\nx=[1,2,3,4,5,6,7]\nfor i in range(t):\n N=int(input())\n a=list(map(int,input().split())) \n rev=a[::-1] \n dup=set(a) \n if rev== a and list(dup) ==x: \n print(\"yes\")\n else:\n print(\"no\")", "# cook your dish here\nt=int(input())\nx=[1,2,3,4,5,6,7]\nfor i in range(t):\n N=int(input())\n a=list(map(int,input().split())) \n rev=a[::-1] \n dup=set(a) \n if rev== a and list(dup) ==x: \n print(\"yes\")\n else:\n print(\"no\")", "t=int(input())\nx=[1,2,3,4,5,6,7]\nfor i in range(t):\n N=int(input())\n a=list(map(int,input().split())) \n rever=a[::-1] \n dupli=set(a) \n if rever== a and list(dupli) ==x: \n print(\"yes\")\n else:\n print(\"no\")", "t=int(input())\nx=[1,2,3,4,5,6,7]\nfor i in range(t):\n N=int(input())\n a=list(map(int,input().split())) \n rever=a[::-1] \n dupli=set(a) \n if rever== a and list(dupli) ==x: \n print(\"yes\")\n else:\n print(\"no\")", "x=[1,2,3,4,5,6,7] #take list to check palindrome or not\nfor i in range(int(input())):\n n=int(input())\n li=list(map(int, input().split())) #take list\n revli=li[::-1] #reverse the list\n dupli=set(li) #remove duplicates from list to compare order of \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0nos.\n if(li==revli and list(dupli)==x): #check conditions\n print(\"yes\")\n else:\n print(\"no\")\n \n \n", "t=int(input())\nx=[1,2,3,4,5,6,7]\nfor i in range(t):\n n=int(input())\n s=list(map(int,input().split()))\n l=s[::-1]\n r=set(s)\n if(s==l and list(r)==x):\n print(\"yes\")\n else:\n print(\"no\")", "# cook your dish here\nt=int(input())\nx=[1,2,3,4,5,6,7]\nfor _ in range(t):\n n=int(input())\n s=list(map(int,input().split()))\n l=s[::-1]\n r=set(s)\n if(s==l and list(r)==x):\n print(\"yes\")\n else:\n print(\"no\")", "for i in range(int(input())):\n r = [1, 2, 3, 4, 5, 6, 7]\n N = int(input())\n li = list(map(int, input().split()))\n x = []\n \n for j in li:\n if j not in x:\n x.append(j)\n \n if li == li[::-1] and x == r:\n print('yes')\n else:\n print('no')", "# cook your dish here\nt = int(input())\nb=[1,2,3,4,5,6,7]\nfor i in range(t):\n n = int(input())\n a=list(map(int,input().split())) \n sevenInt=[]\n revList=a[::-1]\n for j in a:\n if j not in sevenInt:\n sevenInt.append(j)\n if(sevenInt==b and a==revList):\n print('yes')\n else:\n print('no')\n \n", "relist=[1,2,3,4,5,6,7]\nt=int(input())\nfor i in range(t):\n a=int(input())\n list1 = list(map(int,input().split()))\n newlist=list(set(list1))\n revlist= list1[::-1]\n \n if(newlist==relist and list1==revlist):\n print(\"yes\")\n else:\n print('no')\n", "relist=[1,2,3,4,5,6,7]\nt=int(input())\nfor i in range(t):\n a=int(input())\n list1 = list(map(int,input().split()))\n newlist=[]\n revlist= list1[::-1]\n for i in list1 :\n if i not in newlist :\n newlist.append(i)\n if(newlist==relist and list1==revlist):\n print(\"yes\")\n else:\n print('no')\n", "# cook your dish here\nrefList=[1,2,3,4,5,6,7]\nt=int(input())\nfor i in range(t):\n a=int(input())\n list1=list(map(int,input().split()))[:a]\n sevenInt=[]\n revList=list1[::-1]\n for i in list1:\n if i not in sevenInt:\n sevenInt.append(i)\n if(sevenInt==refList and list1==revList):\n print('yes')\n else:\n print('no')", "t=int(input())\nfor i in range(t):\n a=int(input())\n a1=list(map(int,input().split()))[:a]\n x=[]\n y=[1,2,3,4,5,6,7]\n z=a1[::-1]\n for i in a1:\n if i not in x:\n x.append(i)\n if(x==y and a1==z):\n print('yes')\n else:\n print('no')", "# cook your dish here\nfor _ in range(int(input())):\n n=int(input())\n l=list(map(int,input().split()))\n if 7 not in l:\n print('no')\n continue\n s=l.index(7)\n k=list(set(l[:s+1]))\n t=[i for i in range(1,8)]\n if k==t and l==l[::-1]:\n print('yes')\n else:\n print('no')", "# cook your dish here\nt = int(input())\nfor i in range(t):\n l = int(input())\n li = list(map(int, input().split()))[:l]\n a1 = []\n a2 = [1, 2, 3, 4, 5, 6, 7]\n a3 = li[::-1]\n for i in li:\n if i not in a1:\n a1.append(i)\n a1.sort()\n if a1 == a2 and li == a3:\n print('yes')\n else:\n print('no')\n", "t = int(input())\nfor i in range(t):\n l = int(input())\n li = list(map(int, input().split()))[:l]\n a = []\n b = [1, 2, 3, 4, 5, 6, 7]\n c = li[::-1]\n for i in li:\n if i not in a:\n a.append(i)\n a.sort()\n if a == b and li == c:\n print('yes')\n else:\n print('no')", "t = int(input())\nfor i in range(t):\n l = int(input())\n li = list(map(int, input().split()))[:l]\n a = []\n b = [1, 2, 3, 4, 5, 6, 7]\n c = li[::-1]\n for i in li:\n if i not in a:\n a.append(i)\n a.sort()\n if a == b and li == c:\n print('yes')\n else:\n print('no')", "t = int(input())\nfor i in range(t):\n l = int(input())\n li = list(map(int, input().split()))[:l]\n a = []\n b = [1, 2, 3, 4, 5, 6, 7]\n for i in li:\n if i not in a:\n a.append(i)\n a.sort()\n if a == b and li == li[::-1]:\n print('yes')\n else:\n print('no')", "t=int(input())\nfor i in range (t):\n n=int(input())\n l=list(map(int,input().split()))\n li=[]\n for j in l:\n if j not in li:\n li.append(j)\n li.sort()\n print('yes' if (li==[1,2,3,4,5,6,7] and l==l[::-1]) else 'no')\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 li=[]\n for i in l:\n if i not in li:\n li.append(i)\n li.sort()\n print('yes' if (li==[1,2,3,4,5,6,7] and l==l[::-1]) else 'no')", "#!/usr/bin/env python3\n# -*- coding: utf-8 -*-\n\"\"\"\nCreated on Sun Jan 24 09:23:33 2021\n\n@author: gourob\n\"\"\"\n\ntest = int(input())\n\nwhile test:\n \n flag=1\n n=int(input())\n \n elem=list(map(int,input().split()))\n \n p1,p2=0,n-1\n \n if elem[0] != 1:\n flag=0\n else:\n while p1<p2:\n if elem[p1] != elem[p2]:\n flag=0\n break\n if not (elem[p1] == elem[p1+1] or elem[p1]+1 == elem[p1+1]):\n flag=0\n break\n if elem[p1]>7:\n flag=0\n break\n p1+=1\n p2-=1\n if elem[p1] != 7:\n flag=0\n if flag==1:\n print(\"yes\")\n else:\n print(\"no\")\n \n test-=1\n\n\n\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 li=[]\n for i in l:\n if i not in li:\n li.append(i)\n li.sort()\n print('yes' if (li==[1,2,3,4,5,6,7] and l==l[::-1]) else 'no')", "# cook your dish here\n# cook your dish here\nx=int(input())\nfor i in range (x):\n y=int(input())\n lst=list(map(int,input().split()))\n c=[]\n for j in lst:\n if j not in c:\n c.append(j)\n c.sort()\n print('yes' if (c==[1,2,3,4,5,6,7] and lst==lst[::-1]) else 'no')", "# cook your dish here\nt=int(input())\nfor _ in range (t):\n n=int(input())\n l=list(map(int,input().split()))\n c=[]\n for i in l:\n if i not in c:\n c.append(i)\n c.sort()\n print('yes' if (c==[1,2,3,4,5,6,7] and l==l[::-1]) else 'no')"] | {"inputs": [["3", "19", "1 2 3 4 4 5 6 6 6 7 6 6 6 5 4 4 3 2 1", "14", "1 2 3 4 5 6 7 6 5 4 3 2 1 1", "13", "1 2 3 4 5 6 8 6 5 4 3 2 1"]], "outputs": [["yes", "no", "no"]]} | INTERVIEW | PYTHON3 | CODECHEF | 6,989 | |
291c08fd547b59f782a9e8236bc1a3d4 | UNKNOWN | You are given positive integers $L$ and $R$. You have to find the sum
S=∑i=LR(L∧(L+1)∧…∧i),S=∑i=LR(L∧(L+1)∧…∧i),S = \sum_{i=L}^R \left(L \wedge (L+1) \wedge \ldots \wedge i\right) \,,
where $\wedge$ denotes the bitwise AND operation. Since the sum could be large, compute it 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 two space-separated integers $L$ and $R$.
-----Output-----
For each test case, print a single line containing one integer — the sum $S$ modulo $10^9+7$.
-----Constraints-----
- $1 \le T \le 10^5$
- $1 \le L \le R \le 10^{18}$
-----Example Input-----
2
1 4
4 10
-----Example Output-----
1
16
-----Explanation-----
Example case 1: The sum is 1 + 1 AND 2 + 1 AND 2 AND 3 + 1 AND 2 AND 3 AND 4 = 1 + 0 + 0 + 0 = 1.
Example case 2: The sum is 4 + 4 AND 5 + 4 AND 5 AND 6 + 4 AND 5 AND 6 AND 7 + … + 4 AND 5 AND … AND 10 = 4 + 4 + … + 0 = 16. | ["l= []\nfor i in range(62):\n l.append(2**i)\nT = int(input())\n\nflag = 0\nfor t in range(T):\n L,R = [int(i) for i in input().split()]\n bL = bin(L)\n lL = len(bL)-2\n index = 1\n ans = 0\n temp = 0\n \n while(index<=lL):\n temp = L%l[index]\n if temp>=l[index-1]:\n if(l[index]-temp<=R-L+1):\n ans= (ans +(l[index-1])*(l[index]-temp))%1000000007\n else :\n ans=(ans+(l[index-1])*(R-L+1))%1000000007\n \n \n index+=1\n print(ans)\n# 4378578345 584758454958\n# 18091037982636824985 8589934592 4429185025 4294967296\n", "mod=int(1e9)+7\nt=int(input())\nwhile t:\n t-=1\n l, r= map(int , input().split())\n binl=bin(l)[:1:-1]\n f, cnt, ans=1, 0, 0\n for i in binl:\n if i=='1':\n ans= (ans+f*min(f-cnt, r-l+1))%mod\n cnt+=f\n f*=2\n print(ans)", "MOD = 1000000007\na=int(input())\nfor i in range(a):\n \n x,y = list(map(int,input().split()))\n start = x\n end = y\n ans = x\n prev = x\n z = x\n j=-1\n while(start!=0):\n j+=1\n \n if((z&1) != 0):\n \n add = 1 << j\n next = (start + add)\n if(next > end):\n ans=(ans+(((end-prev))*(start)))\n \n break\n \n ans =(ans+ ((((next-prev-1))*(start)) + (start-add)))\n \n ans%=MOD\n start-=add\n if(next == end):\n break\n \n prev = next\n \n \n \n z = z>>1\n \n print(ans%MOD)\n \n\n\n\n", "MOD = 1000000007\na=int(input())\nfor i in range(a):\n \n x,y = list(map(int,input().split()))\n start = x\n end = y\n ans = x\n prev = x\n z = x\n j=-1\n while(start!=0):\n j+=1\n \n if((z&1) != 0):\n \n add = pow(2,j)\n next = (start + add)\n if(next > end):\n ans=(ans+(((end-prev))*(start)))\n \n break\n \n ans =(ans+ ((((next-prev-1))*(start)) + (start-add)))\n \n ans%=MOD\n start-=add\n if(next == end):\n break\n \n prev = next\n \n \n \n z = z>>1\n \n print(ans%MOD)\n \n\n\n\n", "t=int(input())\nwhile(t):\n t-=1\n l,r = [int(i) for i in input().split()]\n bl = bin(l)[2:]\n bl = bl[::-1]\n sub = 0\n val = 1\n ans = 0\n mod = 10**9 + 7\n for i in range (len(bl)):\n if bl[i] == '1':\n ans+= val*(min(val-sub,r-l+1))%mod\n sub+=val\n val*=2\n print(ans%mod)\n", "m = [1]\nmod = 10**9+7\nfor i in range (60):\n a = m[-1]\n a *=2\n a %=mod\n m.append(a)\n \nfor i in range (int(input())):\n L,R = map(int,input().split())\n tmp = 0\n l = bin(L)[2:]\n r = bin(R)[2:]\n a = 1\n ans = L%mod\n for i in range (1,len(l)+1):\n if(l[-i]=='0'):\n if tmp+2**(i-1)<=R-L:\n ans +=((m[i-1])*(L-a+1))%mod\n tmp +=2**(i-1)\n ans %=mod\n else:\n ans +=((R-L-tmp)*(L-a+1))%mod\n ans %=mod\n break\n else:\n a +=m[i-1]\n print(ans)", "mod = 10**9+7\nt = int(input())\nwhile(t>0):\n l, r = map(int, input().split())\n ans = 0\n for i in range(63):\n if(l&(1<<i)):\n x =(1<<i) - (l&((1<<i)-1))\n x = min(x, (r-l+1))\n ans += x*(1<<i)\n print(ans%mod)\n \n \n \n t = t-1", "from sys import stdin, stdout\nmod=(1000*1000*1000+7)\nfor i in range(int(stdin.readline())):\n l,r=map(int,stdin.readline().split())\n act=0\n req=0\n ans=0\n for i in range(60):\n val=min(r-l+1,req-act+1)\n val%=mod\n if(l&(1<<i)):\n ans+=(val*((1<<i)%mod))%mod\n ans%=mod\n act+=(1<<i)\n req+=(1<<i)\n print(ans)", "from sys import stdin\nmod=(1000*1000*1000+7)\nfor i in range(int(stdin.readline())):\n l,r=map(int,stdin.readline().split())\n act=0\n req=0\n ans=0\n for i in range(60):\n val=min(r-l+1,req-act+1)\n val%=mod\n if(l&(1<<i)):\n ans+=(val*((1<<i)%mod))%mod\n ans%=mod\n act+=(1<<i)\n req+=(1<<i)\n print(ans)", "# Ankan Kumar Das\n# Date : 27/02/2020\nMOD = 10**9 + 7\nfor _ in range(int(input())):\n l, r = map(int, input().split())\n max_no_elm = r - l + 1\n ans, multi, l_p, r_p = 0, 1, l, 0\n while l_p != 0:\n curr_bit = l_p & 1\n if curr_bit == 1:\n no_elm = multi - r_p\n ans = (ans + multi * min(no_elm, max_no_elm)) % MOD\n l_p, r_p = l_p >> 1, r_p + multi * curr_bit\n multi = multi << 1\n print(ans)", "# https://www.codechef.com/problems/RGAND\n\nMVAL = 1000000007\n\ndef rangeand(low,hi):\n odf = hi - low + 1\n ra = 0\n p2 = 1\n lmd = 0\n while (low&p2) == 0:\n p2 *= 2\n pmdf = p2 # lowest set bit splits an interval\n if pmdf >= odf:\n return (odf*low)%MVAL\n while p2<=low:\n if (low & p2):\n lmd += p2\n ra += (pmdf*p2)%MVAL\n else:\n pmdf += p2\n if pmdf >= odf:\n ra += (odf*(low-lmd))%MVAL\n break\n p2 *= 2\n\n return ra%MVAL\n\nt = int(input())\nans =[]\nfor ti in range(t):\n l,r = map(int,input().split())\n\n ans.append( rangeand(l,r) )\n\nprint( *ans, sep='\\n' )\n", "# https://www.codechef.com/problems/RGAND\n\nMVAL = 1000000007\n\ndef rangeand(low,hi):\n ra = 0\n p2 = 1\n lmd = 0\n ldv =low\n hdv = hi\n while p2<=low:\n thisbit = low & p2\n p2 *= 2\n ldv //= 2\n hdv //= 2\n if ldv == hdv:\n ra += ((hi+1-low)*(low-lmd))%MVAL\n break\n elif thisbit > 0:\n lmd += thisbit\n ra += ((p2-lmd)*thisbit)%MVAL\n return ra%MVAL\n\nt = int(input())\nfor ti in range(t):\n l,r = list(map(int,input().split()))\n\n print( rangeand(l,r) )\n", "# https://www.codechef.com/problems/RGAND\n\nMVAL = 1000000007\n\ndef rangeand(low,hi):\n ra = 0\n p2 = 1\n while p2<=low:\n ld,lm = divmod(low,p2*2)\n hd,hm = divmod(hi,p2*2)\n if ld == hd:\n ra += ((hm-lm+1)*(p2 & lm))%MVAL\n else:\n ra += ((p2*2-lm)*(p2 & lm))%MVAL\n p2 *= 2\n return ra%MVAL\n\nt = int(input())\nfor ti in range(t):\n l,r = list(map(int,input().split()))\n\n print( rangeand(l,r) )\n", "for _ in range(int(input())):\n a,b=map(int,input().split())\n st=bin(a)[2:]\n s=0;m=1;ans=0\n for i in range(len(st)-1,-1,-1):\n if(st[i]==\"1\"):\n ans += m*min(m-s,b-a+1)\n ans %= 1000000007\n s+=m\n m*=2\n print(ans)", "# cook your dish here\n\nmod = 1000000007\nt=int(input())\nwhile t:\n l,r=list(map(int,input().split( )))\n ans=0\n if l==r:\n print(l%mod)\n else:\n temp = l\n i=1\n j=1\n while temp:\n if temp&1:\n tp2 = l&i\n k=min(r-l+1,i-tp2+1)\n ans=(ans+j*k)%mod\n i<<=1\n i+=1\n j<<=1\n temp>>=1\n print(ans%mod)\n t-=1\n", "mod = 10**9 + 7\nfor _ in range(int(input())):\n l, r = map(int, input().split())\n z = 2\n while(z <= l):\n z *= 2\n if(r > z):\n r = z - 1\n z = z // 2\n ans = l\n lb = bin(l).replace(\"0b\", \"\")\n for i in lb:\n if(i != '0'):\n h = l % z\n h = z - h - 1\n if(h >= r - l):\n g = r % z\n g = z - g - 1\n if(g < h):\n h = h - g\n ans += h * z\n z = z // 2\n print(ans % mod)", "mod = 10**9 + 7\nt=int(input())\nfor _ in range(t):\n l, r = map(int, input().split())\n z = 2\n while(z <= l):\n z *= 2\n if(r > z):\n r = z - 1\n z = z // 2\n ans = l\n lb = bin(l).replace(\"0b\", \"\")\n for i in lb:\n if(i != '0'):\n h = l % z\n h = z - h - 1\n if(h >= r - l):\n g = r % z\n g = z - g - 1\n if(g < h):\n h = h - g\n ans += h * z\n z = z // 2\n print(ans % mod)", "import math\nfor _ in range(int(input())):\n a, b = [int(i) for i in input().split()]\n ans = 1\n sum = 0\n c = int(math.log2(a))\n for i in range(c+1):\n doo = 2 ** i\n po = doo & a\n if po == doo:\n sum += min(b-a+1, ans) * doo\n else:\n ans += doo\n print(sum%1000000007)\n", "# cook your dish here\nimport math\ndef optimalSol(a,b):\n power=int(math.log(a,2))\n add=0\n mod=10**9+7\n previous_i=-1\n present=0\n end=0\n for i in range(power+1):\n bit_add=2**i\n end+=2**i\n if a&bit_add==bit_add:\n present+=bit_add\n total_added=min(b-a+1,end-present+1)\n add+=bit_add*total_added\n return add%mod \nfor _ in range(int(input())):\n a,b=list(map(int,input().split()))\n print(optimalSol(a,b))", "modulo = int(1e9) + 7\nfor t in range(int(input())):\n l,r = map(int,input().split())\n curr = 1\n ans = 0\n for i in range(61):\n q = (l)//curr\n if q&1:\n end = min(r,(q+1)*curr-1)\n ans = (ans + (curr*(end-l+1)%modulo)%modulo)%modulo\n #print(i,end,q,curr,ans)\n curr *= 2\n print(ans)", "# cook your dish here\nt=int(input())\nwhile t>0:\n a,b=list(map(int,input().split()))\n k=1\n m=a\n n=b\n sum=0\n x=0\n y=1\n while a>0:\n a=a//2\n l=m//k\n if l%2!=0:\n p=k*l\n q=k*(l+1)\n else:\n p=k*(l+1)\n q=k*(l+2)\n k*=2\n if m>=p and m<q:\n if b<q:\n o=b-m+1\n lum=((o%1000000007)*(y%1000000007))%1000000007\n sum=sum+lum\n sum=sum%1000000007\n else:\n o=q-m\n lum=((o%1000000007)*(y%1000000007))%1000000007\n sum=sum+lum\n sum=sum%1000000007\n y*=2\n print(sum)\n t-=1", "t=int(input())\nm=10**9+7\nwhile t:\n p=0\n res=0\n l,r=map(int,input().split())\n d=r-l+1\n br=bin(r)[2:]\n lbr=len(br)\n l=bin(l)[2:]\n k=-1\n lol=0\n ll=len(l)\n ind=ll-1\n \n if(2**ll>r):\n for i in range(ll):\n if(l[i]=='0' and br[i]=='1'):\n ind=i\n break\n #print(ind)\n for i in range(len(l)-1,ind,-1):\n k+=1\n if(l[i]=='1'):\n a=2**k\n p+=a\n res+=(min(r+1,2**(k+1))-p)*a\n for i in range(ind+1):\n if(l[i]=='1'):\n res+=2**(ll-i-1)*d\n \n\n else:\n for i in range(len(l)-1,-1,-1):\n k+=1\n if(l[i]=='1'):\n a=2**k\n p+=a\n res+=(min(r+1,2**(k+1))-p)*a\n print(res%m)\n t-=1"] | {"inputs": [["2", "1 4", "4 10"]], "outputs": [["1", "16"]]} | INTERVIEW | PYTHON3 | CODECHEF | 8,978 | |
d0203c07399375cac83c714472ce0739 | UNKNOWN | Chef likes prime numbers. However, there is one thing he loves even more. Of course, it's semi-primes! A semi-prime number is an integer which can be expressed as a product of two distinct primes. For example, $15 = 3 \cdot 5$ is a semi-prime number, but $1$, $9 = 3 \cdot 3$ and $5$ are not.
Chef is wondering how to check if an integer can be expressed as a sum of two (not necessarily distinct) semi-primes. Help Chef with this tough task!
-----Input-----
- The first line of the input contains a single integer $T$ denoting the number of test cases. The description of $T$ test cases follows.
- The first and only line of each test case contains a single integer $N$.
-----Output-----
For each test case, print a single line containing the string "YES" if it is possible to express $N$ as a sum of two semi-primes or "NO" otherwise.
-----Constraints-----
- $1 \le T \le 200$
- $1 \le N \le 200$
-----Example Input-----
3
30
45
62
-----Example Output-----
YES
YES
NO
-----Explanation-----
Example case 1: $N=30$ can be expressed as $15 + 15 = (3 \cdot 5) + (3 \cdot 5)$.
Example case 2: $45$ can be expressed as $35 + 10 = (5 \cdot 7) + (2 \cdot 5)$.
Example case 3: $62$ cannot be expressed as a sum of two semi-primes. | ["# cook your dish here\r\nimport sys\r\nn = 201\r\nv = [0 for i in range(n + 1)] \r\n\r\ndef gen():\r\n for i in range(1, n + 1): \r\n v[i] = i \r\n \r\n countDivision = [0 for i in range(n + 1)] \r\n \r\n for i in range(n + 1): \r\n countDivision[i] = 2\r\n \r\n for i in range(2, n + 1, 1): \r\n \r\n \r\n if (v[i] == i and countDivision[i] == 2): \r\n for j in range(2 * i, n + 1, i): \r\n if (countDivision[j] > 0): \r\n v[j] = int(v[j] / i) \r\n countDivision[j] -= 1\r\ntry:\r\n t=int(sys.stdin.readline())\r\n for _ in range(t):\r\n gen()\r\n x=int(sys.stdin.readline())\r\n flag=0\r\n for i in range(2,x//2+1):\r\n if v[i]==1 and v[x-i]==1:\r\n flag=1\r\n #print(i,x-i)\r\n if flag==1:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nexcept:\r\n pass\r\n", "from itertools import combinations_with_replacement\nn=201\ns=[0]*n\ndef sieve(num):\n for i in range(1, num+1):\n s[i]=i\n cd=[0 for i in range(num+1)]\n for i in range(num+1):\n cd[i]=2\n for i in range(2, num+1,1):\n if(s[i]==i and cd[i]==2):\n for j in range(2*i, num+1, i):\n if(cd[j]>0):\n s[j]=int(s[j]/i)\n cd[j]-=1\n res=[]\n for i in range(2,num+1,1):\n if(s[i]==1 and cd[i]==0):\n res.append(i)\n return res\n\n\nt=int(input())\nl=[int(input()) for i in range(t)]\ncount=0\nfor i in l:\n a=sieve(i)\n c=list(combinations_with_replacement(a,2))\n for j in c:\n if(j[0]+j[1]==i):\n count+=1\n break\n if count>0:\n print('YES')\n else:\n print('NO')\n count=0", "# cook your dish here\ndef AlmostPrime(n):\n pf = []\n while n % 2 == 0:\n n //= 2\n pf.append(2)\n k = 3\n while k <= n:\n while n % k == 0:\n n //= k\n pf.append(k)\n k += 2\n return len(pf) == 2 and pf[0] != pf[1]\ndef semi_prime(n):\n for i in range(6,n//2+1):\n if AlmostPrime(i) and AlmostPrime(n-i):\n # print(i,n-i)\n return \"YES\"\n return \"NO\"\n\nfor _ in range(int(input())):\n print(semi_prime(int(input())))\n \n ", "def seive_array():\n n=200\n seive=[1]*(n+1)\n seive[0]=0\n seive[1]=0\n i=2\n while i*i<=n:\n if seive[i]==1:\n for j in range(i*i,n+1,i):\n seive[j]=0\n i+=1\n return seive\ndef check_semi_prime(x):\n k=2\n p1=0\n p2=0\n while k<x:\n if x%k==0 and seive[k]==1:\n p1=k\n if x==p1*p2 and p1!=p2:\n return 1\n else:\n p2=p1\n k+=1\n return 0\ndef given_number(m):\n for i in range(2,(m//2)+1):\n x=i\n y=m-x\n if check_semi_prime(x) and check_semi_prime(y):\n return 1\nt=int(input())\nseive=seive_array()\nfor i in range(t):\n m=int(input())\n if given_number(m):\n print(\"YES\")\n else:\n print(\"NO\")\n ", "# cook your dish here\ndef primefun(n):\n seive=[1 for i in range(n+1)]\n i=2\n while(i*i<=n+1):\n if seive[i]==1:\n for j in range(i*i,n+1,i):\n seive[j]=0\n i=i+1\n seive[0]=0\n seive[1]=0\n return seive\ndef divide(n,seive):\n #print('divide n is',n)\n for i in range(2,n,1):\n if(n%i==0):\n #print('n%i is',i)\n if(seive[i]==1 and seive[n//i]==1):\n if i!=n//i:\n return True\ncount=int(input())\nfor g in range(count):\n n=int(input())\n flag=0\n seive=primefun(n)\n for i in range(6,n):\n if(i+(n-i)==n):\n #print(i,n-i)\n k=n-i\n if divide(i,seive)==True and divide(k,seive)==True:\n flag=1\n print('YES')\n break\n if flag==0:\n print('NO')\n \n \n \n", "# cook your dish here\r\nimport sys\r\nn = 201\r\nv = [0 for i in range(n + 1)] \r\n\r\ndef gen():\r\n for i in range(1, n + 1): \r\n v[i] = i \r\n \r\n countDivision = [0 for i in range(n + 1)] \r\n \r\n for i in range(n + 1): \r\n countDivision[i] = 2\r\n \r\n for i in range(2, n + 1, 1): \r\n \r\n \r\n if (v[i] == i and countDivision[i] == 2): \r\n for j in range(2 * i, n + 1, i): \r\n if (countDivision[j] > 0): \r\n v[j] = int(v[j] / i) \r\n countDivision[j] -= 1\r\ntry:\r\n t=int(sys.stdin.readline())\r\n for _ in range(t):\r\n gen()\r\n x=int(sys.stdin.readline())\r\n flag=0\r\n for i in range(2,x//2+1):\r\n if v[i]==1 and v[x-i]==1:\r\n flag=1\r\n #print(i,x-i)\r\n if flag==1:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nexcept:\r\n pass\r\n", "def sievearray():\r\n n=200\r\n sieve=[1 for i in range(n+1)]\r\n sieve[0]=0\r\n sieve[1]=0\r\n i=2\r\n while i*i<=n:\r\n if sieve[i]==1:\r\n for j in range(i*i,n+1,i):\r\n sieve[j]=0\r\n i+=1\r\n return sieve\r\ndef semiprime(n):\r\n i=2\r\n m2=0\r\n m1=0\r\n while i!=n:\r\n if n%i==0 and sieve[i]==1:\r\n m1=i\r\n if n==m1*m2 and m1!=m2:\r\n return 1\r\n else:\r\n m2=m1\r\n i+=1\r\n return 0\r\ndef sum_of_two(n):\r\n for i in range(2,n//2+1):\r\n p=i\r\n q=n-i\r\n if semiprime(p) and semiprime(q):\r\n return 1\r\ntry:\r\n t=0\r\n t=int(input())\r\n sieve=sievearray()\r\nexcept Exception:\r\n pass\r\nl1=[0 for i in range(0,t)]\r\nfor i in range(0,t):\r\n l1[i]=int(input())\r\nfor i in range(0,len(l1)):\r\n if sum_of_two(l1[i]):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n \r\n\r\n", "def sievearray():\r\n n=200\r\n sieve=[1 for i in range(n+1)]\r\n sieve[0]=0\r\n sieve[1]=0\r\n i=2\r\n while i*i<=n:\r\n if sieve[i]==1:\r\n for j in range(i*i,n+1,i):\r\n sieve[j]=0\r\n i+=1\r\n return sieve\r\ndef semiprime(n):\r\n i=2\r\n m2=0\r\n m1=0\r\n while i!=n:\r\n if n%i==0 and sieve[i]==1:\r\n m1=i\r\n if n==m1*m2 and m1!=m2:\r\n return 1\r\n else:\r\n m2=m1\r\n i+=1\r\n return 0\r\ndef sum_of_two(n):\r\n for i in range(2,n//2+1):\r\n p=i\r\n q=n-i\r\n if semiprime(p) and semiprime(q):\r\n return 1\r\ntry:\r\n t=0\r\n t=int(input())\r\n sieve=sievearray()\r\nexcept Exception:\r\n pass\r\nl1=[0 for i in range(0,t)]\r\nfor i in range(0,t):\r\n l1[i]=int(input())\r\nfor i in range(0,len(l1)):\r\n if sum_of_two(l1[i]):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n \r\n\r\n", "def sievearray():\r\n n=200\r\n sieve=[1 for i in range(n+1)]\r\n sieve[0]=0\r\n sieve[1]=0\r\n i=2\r\n while i*i<=n:\r\n if sieve[i]==1:\r\n for j in range(i*i,n+1,i):\r\n sieve[j]=0\r\n i+=1\r\n return sieve\r\ndef semiprime(n):\r\n i=2\r\n m2=0\r\n m1=0\r\n while i!=n:\r\n if n%i==0 and sieve[i]==1:\r\n m1=i\r\n if n==m1*m2 and m1!=m2:\r\n return 1\r\n else:\r\n m2=m1\r\n i+=1\r\n return 0\r\ndef sum_of_two(n):\r\n for i in range(2,n//2+1):\r\n p=i\r\n q=n-i\r\n if semiprime(p) and semiprime(q):\r\n return 1\r\ntry:\r\n t=0\r\n t=int(input())\r\n sieve=sievearray()\r\nexcept Exception:\r\n pass\r\nl1=[0 for i in range(0,t)]\r\nfor i in range(0,t):\r\n l1[i]=int(input())\r\nfor i in range(0,len(l1)):\r\n if sum_of_two(l1[i]):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n \r\n\r\n", "# cook your dish here\nimport sys\ninput=sys.stdin.readline\nt=int(input())\nfor you in range(t):\n n=int(input())\n poss=0\n for i in range(1,n+1):\n z=i\n y=n-i\n l=[]\n op=[]\n ok=2\n while(ok*ok<=z):\n if(z%ok==0):\n l.append(ok)\n while(z%ok==0):\n z=z//ok\n ok+=1\n if(z!=1):\n l.append(z)\n ok=2\n while(ok*ok<=y):\n if(y%ok==0):\n op.append(ok)\n while(y%ok==0):\n y=y//ok\n ok+=1\n if(y!=1):\n op.append(y)\n if(len(op)==2 and op[0]*op[1]==n-i and len(l)==2 and l[0]*l[1]==i):\n poss=1\n break\n if(poss):\n print(\"YES\")\n else:\n print(\"NO\")", "try:\n N=205\n seive=[0]*205\n i=2\n while(i*2<N):\n j=i*2\n if(seive[i]==0):\n \n while(j<N):\n seive[j]+=1\n j+=i\n else:\n while(j<N):\n seive[j]=10\n j+=i\n i+=1\n \n pos=[]\n for i in range(N):\n if(seive[i]==2):\n pos.append(i)\n for _ in range(int(input())):\n n=int(input())\n s=0\n e=len(pos)-1\n while(s<=e):\n if(pos[s]+pos[e]>n):\n e-=1\n elif(pos[s]+pos[e]<n):\n s+=1\n else:\n print(\"YES\")\n break\n else:\n print(\"NO\")\nexcept:\n pass\n \n \n", "# cook your dish here\nimport math\ndef prime(n):\n for i in range(2,int(math.sqrt(n))+1):\n if n%i==0:\n return -1\n return 1\n\ndef perfect(n):\n if math.sqrt(n)==int(math.sqrt(n)):\n return -1\n else:\n return 1\n\ndef semiprime(n):\n temp=[]\n for i in range(2,n):\n if n%i==0:\n temp.append(i)\n if len(temp)>2:\n return -1\n if len(temp)==1:\n return -1\n if len(temp)==2:\n if prime(temp[0])==1 and prime(temp[1])==1:\n return 1\n \n\nt=int(input())\nfor _ in range(t):\n n=int(input())\n check=0\n for i in range(2,n//2+1):\n if semiprime(i)==1 and semiprime(n-i)==1:\n check=1\n break\n if check>0:\n print('YES')\n else:\n print('NO')\n ", "# cook your dish here\nsieve=[True for i in range(201)]\nsieve[0],sieve[1]=False,False\ni=2\np=[]\nwhile i<=200:\n if sieve[i]:\n p.append(i)\n j=i*i\n while j<=200:\n sieve[j]=False\n j+=i\n i+=1\nl=len(p)\nsemi=[]\nfor i in range(l):\n for j in range(i+1,l):\n if p[i]*p[j]<=200:\n semi.append(p[i]*p[j])\nsemi=set(semi)\nfor _ in range(int(input())):\n n=int(input())\n i=1\n out=False\n while i<=100:\n if i in semi and n-i in semi:\n print('YES')\n out=True\n break\n i+=1\n if not out:\n print(\"NO\")\n ", "# cook your dish here\npr=[2]\nsv=[0]*(203)\nfor i in range(3,202,2):\n if sv[i]==0:\n pr.append(i)\n for j in range(2*i,203,i):\n sv[j]=1\nsp=[0]*(5*10**4)\nfor i in range(len(pr)):\n for j in range(i+1,len(pr)):\n sp[pr[i]*pr[j]]=1\n#print(sp[:40])\nfor _ in range(int(input())):\n n=int(input())\n an=\"NO\"\n for i in range(1,n):\n if sp[i] and sp[n-i]:\n an=\"YES\"\n break\n print(an)", "p=[3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97]\ne=[2*i for i in p]\nod=[]\nfor i in range(len(p)):\n for j in range(i+1,len(p)):\n if(p[i]*p[j]<=200):\n od.append(p[i]*p[j])\n else:\n break\n if(j==i+1):\n break\nod.sort()\nfor i in range(int(input())):\n ans=0\n n=int(input())\n if(n%2==0):\n for i in range(len(od)):\n for j in range(i,len(od)):\n if(od[i]+od[j]==n):\n ans=1 \n break\n if(od[i]+od[j]>n):\n break\n if(ans==1 or j==i):\n break\n if(ans==0):\n for i in range(len(e)):\n for j in range(i,len(e)):\n if(e[i]+e[j]==n):\n ans=1 \n break\n if(e[i]+e[j]>n):\n break\n if(ans==1 or j==i):\n break\n else:\n for i in range(len(e)):\n for j in range(len(od)):\n if(e[i]+od[j]==n):\n ans=1 \n break\n if(e[i]+od[j]>n):\n break\n if(ans==1 or j==0):\n break\n if(ans==1):\n print(\"YES\")\n else:\n print(\"NO\")", "# cook your dish here\nP = [True]*1001\np = 2\nwhile p*p<=201:\n for i in range(p*p,1001,p):\n P[i]=False\n p+=1\nsp = [False]*1010\nfor i in range(2,1001):\n j=i+1\n while i*j<=1000:\n if P[i]==True and P[j]==True:\n sp[i*j]=True\n j+=1\nfor t in range(int(input())):\n n = int(input())\n ok = False\n for i in range(2,n):\n if sp[i]==True and sp[n-i]==True:\n ok = True\n break\n if ok==False:\n print(\"NO\")\n else:\n print(\"YES\")", "def semiPrime():\r\n semiprimespro = []\r\n prime = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 101, 103, 107, 109, 113, 127, 131, 137, 139, 149, 151, 157, 163, 167, 173, 179, 181, 191, 193, 197, 199]\r\n for i in range(6,201):\r\n for j in prime:\r\n if(j >= i): break;\r\n if(i % j == 0):\r\n if(i//j != j and i//j in prime): semiprimespro.append(i);\r\n else: break;\r\n return semiprimespro\r\nsemiprimespro,x,w = semiPrime(),0,0\r\nfor _ in range(int(input())):\r\n n = int(input())\r\n for i in semiprimespro:\r\n if(n - i in semiprimespro): print(\"YES\"); w = 0; break\r\n else: w = 1;\r\n if(w == 1): print(\"NO\")", "def semiPrime():\r\n semiprimespro = []\r\n prime = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 101, 103, 107, 109, 113, 127, 131, 137, 139, 149, 151, 157, 163, 167, 173, 179, 181, 191, 193, 197, 199]\r\n for i in range(6,201):\r\n for j in prime:\r\n if(j >= i): break;\r\n if(i % j == 0):\r\n if(i//j != j and i//j in prime): semiprimespro.append(i);\r\n else: break;\r\n return semiprimespro\r\nsemiprimespro,x,w = semiPrime(),0,0\r\nfor _ in range(int(input())):\r\n n = int(input())\r\n for i in semiprimespro:\r\n if(n - i in semiprimespro): print(\"YES\"); w = 0; break\r\n else: w = 1;\r\n if(w == 1):\r\n print(\"NO\")", "def semiPrime():\r\n semiprimespro,i = [],6\r\n prime = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 101, 103, 107, 109, 113, 127, 131, 137, 139, 149, 151, 157, 163, 167, 173, 179, 181, 191, 193, 197, 199]\r\n while(i <= 200):\r\n for j in prime:\r\n if(j >= i): break;\r\n if(i % j == 0):\r\n if(i//j != j and i//j in prime): semiprimespro.append(i);\r\n else: break;\r\n i += 1\r\n return semiprimespro\r\nsemiprimespro,x,w = semiPrime(),0,0\r\nfor _ in range(int(input())):\r\n n = int(input())\r\n for i in semiprimespro:\r\n a = n - i\r\n if(a in semiprimespro): print(\"YES\"); w = 0; break\r\n else: w = 1;\r\n if(w == 1):\r\n print(\"NO\")", "# cook your dish here\nt=int(input())\nsp = [6, 10, 14, 15, 21, 22, 26, 33, 34, 35, 38, 39, 46, 51, 55, 57, 58, 62, 65, 69, 74, 77, 82, 85, 86, 87, 91, 93, 94, 95, 106, 111, 115, 118, 119, 122, 123, 129, 133, 134, 141, 142, 143, 145, 146, 155, 158, 159, 161, 166, 177, 178, 183, 185, 187, 194]\nwhile t:\n n=int(input())\n f=1\n for i in range(6,int(n/2)+1):\n if i in sp and n-i in sp:\n print(\"YES\")\n f=0\n break\n if f:\n print(\"NO\")\n t-=1", "try:\n t=int(input())\n for i in range(0,t):\n n=int(input())\n flist=[2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97] \n glist=[]\n hlist=[]\n for j in range(0,len(flist)):\n for k in range(j+1,len(flist)):\n glist.append(flist[j]*flist[k])\n for h in range(0,len(glist)):\n for f in range(h,len(glist)):\n hlist.append(glist[h]+glist[f])\n hlist.sort()\n # print(hlist)\n if (n in hlist):\n print(\"YES\")\n else:\n print(\"NO\")\nexcept:\n pass", "# cook your dish here\nimport math\nt=int(input())\nfor i in range(0,t):\n n=int(input())\n p=[]\n for j in range (2,n+1):\n if j==2:\n p.append(j)\n else:\n f=0\n for k in range(2,int(math.sqrt(j)+1)):\n if(j%k==0):\n f=1\n break\n if f==0:\n p.append(j)\n ar=[]\n for j in range(0,len(p)-1):\n for k in range(j+1,len(p)):\n if(p[j]*p[k]<n):\n ar.append(p[j]*p[k])\n f=0\n for j in range(0,len(ar)):\n if ((ar[j]*2==n)or (n-ar[j] in ar)):\n print('YES')\n f=1\n break\n if f==0:\n print('NO')\n ", "def w(n): \r\n prime,p,a = [True for i in range(n+1)] ,2,[]\r\n while (p * p <= n): \r\n if (prime[p] == True): \r\n for i in range(p * p, n+1, p): prime[i] = False\r\n p += 1\r\n for p in range(2, n): \r\n if prime[p]:a.append(p)\r\n return a\r\ns,e,r = w(200),[],[]\r\nfor i in range(len(s)):\r\n for j in range(len(s)):\r\n if(i!=j): \r\n if (s[i]*s[j]) <= 200 and (s[i]*s[j]) not in e :e.append((s[i]*s[j]))\r\nfor i in range(len(e)):\r\n for j in range(len(e)):\r\n if (e[i]+e[j]) <= 200 and (e[i]+e[j]) not in r :r.append((e[i]+e[j]))\r\nfor _ in range(int(input())):print(\"YES\") if (int(input())) in r else print(\"NO\")", "# cook your dish here\nimport math\ndef prime(n):\n c=0\n if(n==1):\n return 0\n elif(n==2):\n return 1\n else: \n for i in range(2,math.floor(math.sqrt(n))+1):\n if(n%i==0):\n c=1\n break\n if(c==0):\n return 1\n else:\n return 0\nfor i in range(int(input())):\n k=int(input())\n e=0\n for i in range(1,k+1):\n for j in range(i,k+1):\n if(i+j==k):\n c,d=0,0\n for m in range(1,i+1):\n for n in range(m,i+1):\n if(m*n==i and m!=n):\n if(prime(m) and prime(n)):\n c=1\n break\n if(c==1):\n break\n for o in range(1,j+1):\n for p in range(o,j+1):\n if(o*p==j and o!=p):\n if(prime(o) and prime(p)):\n d=1\n break\n if(d==1):\n break\n if(c and d):\n e=1\n break\n if(e==1):\n break\n if(e==1):\n print(\"YES\")\n else:\n print(\"NO\")"] | {"inputs": [["3", "30", "45", "62", ""]], "outputs": [["YES", "YES", "NO"]]} | INTERVIEW | PYTHON3 | CODECHEF | 19,754 | |
0c6d7d5b16df0fc7ef217f4cb5f25f3d | UNKNOWN | Coach Khaled is a swag teacher in HIT (Hag Institute of Technology). However, he has some obsession problems.
Recently, coach Khaled was teaching a course in building 8G networks using TV antennas and programming them with assembly. There are $N$ students (numbered $1$ through $N$) in his class; for some reason, this number is always a multiple of $4$. The final exam has finished and Khaled has all the scores of his $N$ students. For each valid $i$, the score of the $i$-th student is $A_i$; each score is an integer between $0$ and $100$. Currently, the score-grade distribution is as follows:
- grade D for score smaller than $60$
- grade C for score greater or equal to $60$, but smaller than $75$
- grade B for score greater or equal to $75$, but smaller than $90$
- grade A for score greater or equal to $90$
However, coach Khaled is not satisfied with this. He wants exactly $N/4$ students to receive each grade (A, B, C and D), so that the grades are perfectly balanced. The scores cannot be changed, but the boundaries between grades can. Therefore, he wants to choose three integers $x$, $y$ and $z$ and change the grade distribution to the following (note that initially, $x = 60$, $y = 75$ and $z = 90$):
- grade D for score smaller than $x$
- grade C for score greater or equal to $x$, but smaller than $y$
- grade B for score greater or equal to $y$, but smaller than $z$
- grade A for score greater or equal to $z$
Your task is to find thresholds $x$, $y$ and $z$ that result in a perfect balance of grades. If there are multiple solutions, choose the one with the maximum value of $x+y+z$ (because coach Khaled wants seem smarter than his students); it can be proved that there is at most one such solution. Sometimes, there is no way to choose the thresholds and coach Khaled would resign because his exam questions were low-quality.
-----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, if there is no solution, print a single line containing the integer $-1$; otherwise, print a single line containing three space-separated integers $x$, $y$ and $z$.
-----Constraints-----
- $1 \le T \le 1,000$
- $4 \le N \le 100$
- $N$ is divisible by $4$
- $0 \le A_i \le 100$ for each valid $i$
- the sum of $N$ over all test cases does not exceed $5,000$
-----Subtasks-----
Subtask #1 (100 points): original constraints
-----Example Input-----
6
4
90 25 60 75
8
27 29 92 92 67 67 85 92
4
0 1 2 3
4
100 100 100 100
4
30 30 40 50
4
30 40 40 50
-----Example Output-----
60 75 90
-1
1 2 3
-1
-1
-1
-----Explanation-----
Example case 1: The default distribution is the correct one.
Example case 4: All students have the same score and grade, so there is no way to choose the thresholds and coach Khaled must resign. | ["# cook your dish here\nfor _ in range(int(input())):\n n = int(input())\n k = n//4\n # a,b,c = map(int,input().split())\n a = sorted(map(int,input().split()))\n a60 = (a[k-1],a[k])\n a75 = (a[2*k-1],a[2*k])\n a90 = (a[3*k-1],a[3*k])\n if a60[0]==a60[1] or a75[0]==a75[1] or a90[0]==a90[1] :\n print(-1)\n else :\n print(a60[1],a75[1],a90[1])\n", "t=int(input())\nfor i in range(t):\n n=int(input())\n l=list(map(int,input().split()))\n l.sort()\n k=n//4\n if l[k-1]!=l[k] and l[2*k-1]!=l[2*k] and l[3*k-1]!=l[3*k]:\n print(str(l[k])+\" \"+str(l[2*k])+\" \"+str(l[3*k]))\n else:\n print(\"-1\")", "t = int(input())\n\nfor _ in range(t):\n n = int(input())\n l=[]\n waste = input().split(\" \")\n for i in range(n):\n l.append(int(waste[i]))\n \n l.sort()\n for i in range(n//4 + 1):\n \n if i==len(l)//4:\n x = i\n y = x + len(l)//4\n z = y + len(l)//4\n \n #print(x,y,z)\n if l[x]==l[x-1]:\n print(-1)\n elif l[y]==l[y-1]:\n print(-1)\n elif l[z]==l[z-1]:\n print(-1)\n else:\n print(str(l[x]) + \" \" + str(l[y]) + \" \" + str(l[z]))\n", "for _ in range(int(input())):\n n = int(input())\n l = list(map(int,input().split()))\n l.sort()\n a = n//4\n m = []\n for i in l:\n m.append(l.count(i))\n if max(m)>a:\n print(-1)\n \n else:\n x = a\n y = x+a\n z = y+a\n if l[x]==l[x-1]:\n print(-1)\n elif l[y]==l[y-1]:\n print(-1)\n elif l[z]==l[z-1]:\n print(-1)\n else:\n print(l[x],l[y],l[z])\n", "# cook your dish here\nt = int(input())\n\nfor _ in range(t):\n n = int(input())\n l=[]\n waste = input().split(\" \")\n for i in range(n):\n l.append(int(waste[i]))\n \n l.sort()\n for i in range(n//4 + 1):\n \n if i==len(l)//4:\n x = i\n y = x + len(l)//4\n z = y + len(l)//4\n \n #print(x,y,z)\n if l[x]==l[x-1]:\n print(-1)\n elif l[y]==l[y-1]:\n print(-1)\n elif l[z]==l[z-1]:\n print(-1)\n else:\n print(str(l[x]) + \" \" + str(l[y]) + \" \" + str(l[z]))\n", "# cook your dish here\nt = int(input())\n\nfor _ in range(t):\n n = int(input())\n l=[]\n waste = input().split(\" \")\n for i in range(n):\n l.append(int(waste[i]))\n \n l.sort()\n for i in range(n//4 + 1):\n \n if i==len(l)//4:\n x = i\n y = x + len(l)//4\n z = y + len(l)//4\n \n #print(x,y,z)\n if l[x]==l[x-1]:\n print(-1)\n elif l[y]==l[y-1]:\n print(-1)\n elif l[z]==l[z-1]:\n print(-1)\n else:\n print(str(l[x]) + \" \" + str(l[y]) + \" \" + str(l[z]))", "# cook your dish here\nfor _ in range(int(input())):\n n=int(input())\n a=list(map(int,input().split(\" \")))\n a.sort(reverse=True)\n x=(n//4)-1\n y=x+n//4\n z=y+n//4\n # print(x,y,z)\n if a[x]==a[x+1]:\n print(-1)\n continue\n if a[y]==a[y+1]:\n print(-1)\n continue\n if a[z]==a[z+1]:\n print(-1)\n continue\n print(a[z],a[y],a[x])", "for _ in range(int(input())):\n n = int(input())\n k = n//4\n # a,b,c = map(int,input().split())\n a = sorted(map(int,input().split()))\n a60 = (a[k-1],a[k])\n a75 = (a[2*k-1],a[2*k])\n a90 = (a[3*k-1],a[3*k])\n if a60[0]==a60[1] or a75[0]==a75[1] or a90[0]==a90[1] :\n print(-1)\n else :\n print(a60[1],a75[1],a90[1])\n", "for t in range(int(input())):\n n=int(input())\n a=list(map(int,input().split()))\n a.sort()\n i=n//4\n s1=a[0:i]\n s2=a[i:2*i]\n s3=a[2*i:3*i]\n s4=a[3*i:4*i]\n comb=list(set(s1)&set(s2))+list(set(s2)&set(s3))+list(set(s3)&set(s4))\n if(len(comb)==0):\n print(s2[0],s3[0],s4[0])\n else:\n print(-1)", "for _ in range(int(input())):\n N = int(input())\n L = sorted(map(int, input().split()), reverse=True)\n \n cut = []\n flag = True\n for i in range(4):\n a = set(L[:N//4])\n cut.append(min(list(a)))\n L = L[N//4:]\n for i in a:\n if i in L:\n flag = False\n if not flag:\n break\n\n if flag:\n print(*cut[2::-1])\n else:\n print(-1)\n", "def func(n, a):\n if a[n//4]==a[n//4-1]:\n return -1\n else:\n x = a[n//4]\n if a[2*n//4]==a[2*n//4-1]:\n return -1\n else:\n y = a[2*n//4]\n if a[3*n//4]==a[3*n//4-1]:\n return -1\n else:\n z = a[3*n//4]\n \n return str(x)+\" \"+str(y)+\" \"+str(z)\n \n \n\nfor _ in range(int(input())):\n n = int(input())\n a = sorted((map(int, input().split())))\n print(func(n, a))", "def func(n, a):\n if a[n//4]==a[n//4-1]:\n return -1\n else:\n x = a[n//4]\n if a[2*n//4]==a[2*n//4-1]:\n return -1\n else:\n y = a[2*n//4]\n if a[3*n//4]==a[3*n//4-1]:\n return -1\n else:\n z = a[3*n//4]\n \n return str(x)+\" \"+str(y)+\" \"+str(z)\n \n \n\nfor _ in range(int(input())):\n n = int(input())\n a = sorted((map(int, input().split())))\n print(func(n, a))", "# cook your dish here\nt=int(input())\nfor i in range(t):\n n=int(input())\n arr=[int(ele) for ele in input().split()]\n arr.sort()\n x=n//4\n y=2*x\n z=3*x\n if arr[x]==arr[x-1] or arr[y]==arr[y-1] or arr[z]==arr[z-1] :\n print(\"-1\")\n else:\n print(arr[x],arr[y],arr[z])\n \n", "for _ in range(int(input())):\n n = int(input())\n arr = sorted(list(map(int, input().split())))\n a = n // 4\n b = a + a\n c = b + a\n if arr[a] == arr[a-1] or arr[b] == arr[b-1] or arr[c] == arr[c-1]:\n print(-1)\n else:\n print(arr[a], arr[b], arr[c])", "for T in range(int(input())):\n N = int(input())\n A = sorted(list(map(int,input().split())))\n a = N // 4\n b = a + a\n c = b + a\n if A[a] == A[a-1] or A[b] == A[b-1] or A[c] == A[c-1]:\n print(-1)\n else:\n print(A[a],A[b],A[c])", "# cook your dish here\nfor h in range(int(input())):\n n = int(input())\n a = list(map(int,input().split()))\n a.sort()\n x = a[(n//4)]\n y = a[(n//2)]\n z = a[(3*n//4)]\n if x==a[n//4-1] or y==a[n//2-1] or z==a[3*n//4-1]:\n print(-1)\n else:\n print(x,y,z)", "t=int(input())\nfor j in range(t):\n n=int(input())\n l=list(map(int,input().split()))\n l.sort()\n a=n//4\n b=2*a\n c=3*a\n if l[a]==l[a-1] or l[b-1]==l[b] or l[c]==l[c-1]:\n print(\"-1\")\n else:\n print(l[a],l[b],l[c])\n", "# cook your dish here\nt= int(input())\nfor _ in range(t):\n n=int(input())\n l = list(map(int,input().split()))\n a = n//4\n l.sort()\n if(l[a] == l[a-1] or l[2*a]==l[2*a-1] or l[3*a]==l[3*a-1]):\n print(-1)\n else:\n print(l[a],l[2*a],l[3*a])", "t= int(input())\nfor _ in range(t):\n n=int(input())\n l = list(map(int,input().split()))\n a = n//4\n l.sort()\n if(l[a] == l[a-1] or l[2*a]==l[2*a-1] or l[3*a]==l[3*a-1]):\n print(-1)\n else:\n print(l[a],l[2*a],l[3*a])", "# cook your dish here\ndef sree(k, n):\n k.sort()\n l = [0, 0, 0]\n if k[n//2] == k[(n//2)-1]:\n print(-1)\n else:\n l[1] = k[n//2]\n if k[(3*n)//4] == k[(3*n)//4 - 1]:\n print(-1)\n else:\n l[2] = k[(3*n)//4]\n if k[n//4] == k[(n//4)-1]:\n print(-1)\n else:\n l[0] = k[n//4]\n print(l[0], l[1], l[2])\n\n\nt = int(input())\nfor _ in range(t):\n n = int(input())\n k = list(map(int, input().split()))\n sree(k, n)\n"] | {"inputs": [["6", "4", "90 25 60 75", "8", "27 29 92 92 67 67 85 92", "4", "0 1 2 3", "4", "100 100 100 100", "4", "30 30 40 50", "4", "30 40 40 50"]], "outputs": [["60 75 90", "-1", "1 2 3", "-1", "-1", "-1"]]} | INTERVIEW | PYTHON3 | CODECHEF | 6,725 | |
654f637dffffed401d567237bdbbea00 | UNKNOWN | Chef is learning linear algebra. Recently, he learnt that for a square matrix $M$, $\mathop{\rm trace}(M)$ is defined as the sum of all elements on the main diagonal of $M$ (an element lies on the main diagonal if its row index and column index are equal).
Now, Chef wants to solve some excercises related to this new quantity, so he wrote down a square matrix $A$ with size $N\times N$. A square submatrix of $A$ with size $l\times l$ is a contiguous block of $l\times l$ elements of $A$. Formally, if $B$ is a submatrix of $A$ with size $l\times l$, then there must be integers $r$ and $c$ ($1\le r, c \le N+1-l$) such that $B_{i,j} = A_{r+i-1, c+j-1}$ for each $1 \le i, j \le l$.
Help Chef find the maximum trace of a square submatrix of $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 a single integer $N$.
- $N$ lines follow. For each $i$ ($1 \le i \le N$), the $i$-th of these lines contains $N$ space-separated integers $A_{i,1}, A_{i,2}, \dots, A_{i, N}$ denoting the $i$-th row of the matrix $A$.
-----Output-----
For each test case, print a single line containing one integer — the maximum possible trace.
-----Constraints-----
- $1 \le T \le 100$
- $2 \le N \le 100$
- $1 \le A_{i,j} \le 100$ for each valid $i, j$
-----Subtasks-----
Subtask #1 (100 points): original constraints
-----Example Input-----
1
3
1 2 5
6 3 4
2 7 1
-----Example Output-----
13
-----Explanation-----
Example case 1: The submatrix with the largest trace is
6 3
2 7
which has trace equal to $6 + 7 = 13$. (This submatrix is obtained for $r=2, c=1, l=2$.) | ["# cook your dish here\nT=int(input())\nfor k in range(0,T):\n N=int(input())\n matrix=[]\n for i in range(0,N):\n a=list(map(int, input().split()))\n matrix.append(a)\n max_trace = []\n for i in range(0,N):\n trace1=0\n trace2=0\n for j in range(0,i+1):\n trace1+=matrix[j][N+j-i-1]\n trace2+=matrix[N+j-i-1][j]\n max_trace.append(trace1)\n max_trace.append(trace2)\n print(max(max_trace))\n\n \n", "t = int(input())\n\nfor _ in range(t):\n n = int(input())\n \n a = []\n for i in range(n):\n temp = [int(x) for x in input().split()]\n a.append(temp)\n \n # print(a)\n \n trace = 0\n \n i = 0\n for j in range(n):\n r = i\n c = j\n \n m = a[r][c]\n \n while(r<n-1 and c<n-1):\n r += 1\n c += 1\n \n m += a[r][c]\n \n # print(m)\n if(m > trace):\n trace = m\n \n i = 0\n for j in range(1, n):\n r = j\n c = i\n \n m = a[r][c]\n \n while(r<n-1 and c<n-1):\n r += 1\n c += 1\n \n m += a[r][c]\n \n # print(m)\n \n if(m > trace):\n trace = m\n \n print(trace)", "# cook your dish here\nfor i in range(int(input())):\n h = int(input())\n f = []\n ans = []\n for j in range(0,h):\n f.append(list(map(int,input().split())))\n for k in range(0,h):\n sum1 = 0\n sum2 = 0\n for l in range(0,k+1):\n sum1 += f[l][h+l-k-1]\n sum2 += f[h+l-k-1][l]\n \n ans.append(sum1)\n \n ans.append(sum2)\n \n print(max(ans))\n", "for i in range(int(input())):\n h = int(input())\n f = []\n ans = []\n for j in range(0,h):\n f.append(list(map(int,input().split())))\n for k in range(0,h):\n sum1 = 0\n sum2 = 0\n for l in range(0,k+1):\n sum1 += f[l][h+l-k-1]\n sum2 += f[h+l-k-1][l]\n \n ans.append(sum1)\n \n ans.append(sum2)\n \n print(max(ans))\n", "t = int(input())\nfor i in range(t):\n n = int(input())\n matrix = []\n for j in range(n):\n a = list(map(int, input().split(' ')))\n matrix.append(a)\n final_sum = 0 \n for k in range(n):\n sum1 = 0\n sum2 = 0\n for p in range(0,k+1):\n sum1 += matrix[p][n+p-k-1]\n sum2 +=matrix[n+p-k-1][p]\n sumo = max(sum1,sum2)\n final_sum = max(sumo,final_sum)\n print(final_sum) ", "# cook your dish here\nfor i in range(int(input())):\n h = int(input())\n f = []\n ans = []\n for j in range(0,h):\n f.append(list(map(int,input().split())))\n for k in range(0,h):\n sum1 = 0\n sum2 = 0\n for l in range(0,k+1):\n sum1 += f[l][h+l-k-1]\n # print(sum1)\n sum2 += f[h+l-k-1][l]\n # print(sum2)\n ans.append(sum1)\n # print(ans)\n ans.append(sum2)\n # print(ans)\n print(max(ans))", "for i in range(int(input())):\n h = int(input())\n f = []\n su = []\n for j in range(0,h):\n f.append(list(map(int,input().split())))\n for k in range(0,h):\n s = 0\n s1 = 0\n for l in range(0,k+1):\n s += f[l][h+l-k-1]\n s1 += f[h+l-k-1][l]\n su.append(s)\n su.append(s1)\n print(max(su))", "# cook your dish here\nfor i in range(int(input())):\n h = int(input())\n f = []\n su = []\n for j in range(0,h):\n f.append(list(map(int,input().split())))\n for k in range(0,h):\n s = 0\n s1 = 0\n for l in range(0,k+1):\n s += f[l][h+l-k-1]\n s1 += f[h+l-k-1][l]\n su.append(s)\n su.append(s1)\n print(max(su))", "# cook your dish here\nt = int(input())\nwhile(t):\n t-=1\n n, = list(map(int,input().split()))\n arr =[]\n for i in range(n):\n arr.append([int(x) for x in input().split()])\n for i in range(n-1):\n for j in range(n-1):\n arr[i+1][j+1]+=arr[i][j]\n ans = -float('inf')\n for i in range(n):\n for j in range(n):\n ans=max(ans,arr[i][j])\n print(ans)\n", "t = int(input())\nwhile(t):\n t-=1\n n, = list(map(int,input().split()))\n arr =[]\n for i in range(n):\n arr.append([int(x) for x in input().split()])\n for i in range(n-1):\n for j in range(n-1):\n arr[i+1][j+1]+=arr[i][j]\n ans = -float('inf')\n for i in range(n):\n for j in range(n):\n ans=max(ans,arr[i][j])\n print(ans)\n", "# cook your dish here\nfor i in range(int(input())):\n h = int(input())\n f = []\n su = []\n for j in range(0,h):\n f.append(list(map(int,input().split())))\n for k in range(0,h):\n s = 0\n s1 = 0\n for l in range(0,k+1):\n s += f[l][h+l-k-1]\n s1 += f[h+l-k-1][l]\n su.append(s)\n su.append(s1)\n print(max(su))", "def trace_of_matrix_v2(matrix):\n _list = []\n for diff in range(len(matrix)):\n sum1, sum2, index = (0, 0, diff)\n for i in range(len(matrix) - diff):\n sum1 += matrix[index][i]\n sum2 += matrix[i][index]\n index += 1\n _list.append(sum1)\n _list.append(sum2)\n return max(_list)\n\n\ndef __starting_point():\n t = int(input())\n for _ in range(t):\n n = int(input())\n _list = []\n for _ in range(n):\n _list.append(list(map(int, input().split())))\n print(trace_of_matrix_v2(_list))\n__starting_point()", "# cook your dish here\ntests = int(input())\n\nfor test in range(tests):\n N = int(input())\n\n a = []\n for row in range(N):\n a.append([int(x) for x in input().split()])\n \n max_a = []\n for i in range(N):\n max_c = 0\n count = i\n for j in range(N-i):\n if count < N:\n max_c += a[j][count]\n count += 1\n\n max_a.append(max_c)\n\n for i in range(N):\n if i == 0: continue\n\n max_c = 0\n count = i\n for j in range(N-i):\n if count < N:\n max_c += a[count][j]\n count += 1\n max_a.append(max_c)\n \n print(max(max_a))", "import numpy as np\n'''\ndef findTrace(i,j,k):\n trace = 0\n for z in range(0,k+1):\n trace+=matrix[i+z][j+z]\n return trace\n'''\n\ndef traceSum(matrix,n):\n sum,round,j = 0,n-1,0\n i = round\n sumArray = []\n \n while (i>=0):\n while(i<n):\n sum+=matrix[i][j]\n i+=1\n j+=1\n \n round-=1\n i,j = round,0\n sumArray.append(sum)\n sum = 0\n \n round = n-1\n i,j = 0,round\n \n while (j>0):\n while(j<n):\n sum += matrix[i][j]\n i+=1\n j+=1\n \n round-=1\n i,j = 0,round\n sumArray.append(sum)\n sum = 0\n return max(sumArray)\n\n\n \nt = int(input())\nfor i in range(t):\n #Array Size is n\n n = int(input())\n a=[]\n \n for i in range(0,n):\n ele = list(map(int,input().split()))\n a.append(ele)\n \n matrix = np.array(a).reshape(n,n)\n \n #print(matrix)\n '''\n This worked but had a n^3 complexity and gave an error of time limit \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0exceeded on submission.\n trace = 0\n for i in range(0,n): #Row number\n for j in range(0,n): #Column number\n for k in range(0,n): #Length of Sub-matrix\n if i+k<n and j+k<n:\n trace = max(trace,findTrace(i,j,k)) #Check trace of every \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0sub-matrix & get max\n '''\n print(traceSum(matrix,n))\n \n", "# cook your dish here\na=int(input())\nfor i in range(0,a):\n h=int(input())\n f=[]\n su=[]\n for j in range(0,h):\n f.append(list(map(int,input().split())))\n for k in range(0,h):\n s=0\n s1=0\n for l in range(0,k+1):\n s=s+f[l][h+l-k-1]\n s1=s1+f[h+l-k-1][l]\n su.append(s)\n su.append(s1)\n print(max(su))", "# cook your dish here\na=int(input())\nfor i in range(0,a):\n h=int(input())\n f=[]\n su=[]\n for j in range(0,h):\n f.append(list(map(int,input().split())))\n for k in range(0,h):\n s=0\n s1=0\n for l in range(0,k+1):\n s=s+f[l][h+l-k-1]\n s1=s1+f[h+l-k-1][l]\n su.append(s)\n su.append(s1)\n print(max(su))", "for t in range(int(input())):\n l = int(input())\n m = []\n for r in range(l):\n m.append(list(map(int,input().split())))\n maxsum = 0\n for i in range(l):\n s1 = 0\n s2 = 0\n for j in range(i+1):\n s1 += m[j][l+j-i-1]\n s2 += m[l+j-i-1][j]\n if maxsum<s1:\n maxsum=s1\n if maxsum<s2:\n maxsum=s2\n \n \n print(maxsum)", "# cook your dish here\nt=int(input())\nfor i in range(t):\n n=int(input())\n mat=[]\n for i in range(n):\n l=list(map(int,input().split()))\n mat.append(l)\n ans=[]\n for x in range(n-1,-1,-1):\n s=0\n for i,j in zip(range(n),range(x,n)):\n s+=mat[i][j]\n ans.append(s)\n for y in range(1,n):\n s1=0\n for i,j in zip(range(y,n),range(n)):\n s1+=mat[i][j]\n ans.append(s1)\n print(max(ans))", "t=int(input())\nfor i in range(t):\n n=int(input())\n mat=[]\n for i in range(n):\n l=list(map(int,input().split()))\n mat.append(l)\n ans=[]\n for x in range(n-1,-1,-1):\n s=0\n for i,j in zip(list(range(n)),list(range(x,n))):\n s+=mat[i][j]\n ans.append(s)\n for y in range(1,n):\n s1=0\n for i,j in zip(list(range(y,n)),list(range(n))):\n s1+=mat[i][j]\n ans.append(s1)\n print(max(ans))\n", "for _ in range(int(input())):\n n=int(input())\n m=[]\n for i in range(n):\n m.append(list(map(int,input().split())))\n lo=[0 for i in range(n)]\n up=[0 for i in range(n)]\n t=0\n for i in range(n):\n for j in range(n):\n if i>j:\n lo[i-j]=lo[i-j]+m[i][j]\n elif i<j:\n up[j-i]=up[j-i]+m[i][j]\n else:\n t=t+m[i][j]\n print(max(lo+up+[t]))"] | {"inputs": [["1", "3", "1 2 5", "6 3 4", "2 7 1"]], "outputs": [["13"]]} | INTERVIEW | PYTHON3 | CODECHEF | 8,834 | |
d71755ba2b9d0c82307cb30c27404308 | UNKNOWN | Wet Shark once had 2 sequences:
{a_n}= {a_1, a_2, a_3, ... , a_(109)}
{b_n} = {b_1, b_2, b_3, ... , b_(109)}
However, he only kept one element from each sequence. Luckily, both the elements that Wet Shark kept have the same index in Wet Shark's sequences: that is, he took a_i and b_i for some 1 ≤ i ≤ 109.
Right after Wet Shark loses his sequences, he finds that he actually needs them to break the code of Cthulhu to escape a labyrinth. Cthulhu's code is a single floating point number Q. However, the code verifier is faulty. If Wet Shark enters any code c such that |c - Q| ≤ 0.01 , Cthulhu's code checker will allow him to escape.
Wet Shark now starts to panic, and consults Dry Dolphin for help via ultrasonic waves. After the Dry Dolphin Sequence Processing Factory processes data of Wet Shark's sequences, the machines give Wet Shark the following 2 relations his sequences follow for all 1 ≤ n < 109, where x = sqrt(2) and y = sqrt(3).
Wet Shark is now clueless on how to compute anything, and asks you for help.
Wet Shark has discovered that Cthulhu's code is actually defined as Q = (a_k + b_k) / (2^s), where s is a predetermined number, k is the index of another element in Wet Shark's sequence, and a_k, b_k are precisely the kth elements of Wet Shark's sequences {a_n} and {b_n}, respectively.
Given k, i, and the 2 elements of the arrays Wet Shark has lost, find any value of the code c that will allow Wet Shark to exit Cthulhu's labyrinth.
-----Input-----
The first line of input contains 3 space separated integers i, k, s — the common index of the two elements Wet Shark kept, the index of Wet Shark's array needed to break Cthulhu's code, and the number s described in the problem statement, respectively. It is guaranteed that Cthulhu's code, Q, is between -109 and 109 (both inclusive).
The second line of the input contains 2 space separated integers a_i and b_i, representing the ith element of sequence {a_n} and the ith element of sequence {b_n}, respectively.
-----Output-----
Output any number c that will crack Cthulhu's code. Recall that if Wet Shark enters any code c such that |c - Q| ≤ 0.01 , Cthulhu's code checker will allow him to exit the labyrinth.
----- Constraints -----
- SUBTASK 1: 20 POINTS
- 1 ≤ i ≤ 103
- 1 ≤ k ≤ 103
- -103 ≤ s ≤ 103
- 1 ≤ a_i, b_i ≤ 103
- SUBTASK 2: 80 POINTS
- 1 ≤ i ≤ 1010
- 1 ≤ k ≤ 1010
- -1010 ≤ s ≤ 1010
- 1 ≤ a_i, b_i ≤ 1010
It is guaranteed that -1010 ≤ Q ≤ 1010.
-----Example-----
Input:
1 1 5
4 5
Output:
0.28125
-----Explanation-----
Example case 1. In this case, a_1 = 4, b_1 = 5, and s = 5. Cthulhu's code in this case is (a_1 + b_1) / (2s) = 9/32 = 0.28125. | ["import math\r\n\r\ndef main():\r\n #print(\"enter i, k, s\")\r\n IN = '11 6 5'\r\n z = IN.split()\r\n z = input().split()\r\n i = int(z[0])\r\n k = int(z[1])\r\n s = int(z[2])\r\n\r\n #print(\"enter a_i and b_i\")\r\n IN = '4 5'\r\n z = IN.split()\r\n z = input().split()\r\n a_i = int(z[0])\r\n b_i = int(z[1])\r\n\r\n #print( \"i = %d k = %d s = %d \" % (i, k, s) )\r\n #print( \"a_i = %d b_i = %d\" % (a_i, b_i) )\r\n\r\n x = math.sqrt(2)\r\n y = math.sqrt(3)\r\n #print(x,y)\r\n\r\n # Obtaining the k-th element when k >= i\r\n if(i<=k):\r\n diff = k-i\r\n #if both k and i are odd or even\r\n if(k-i)%2==0:\r\n #print(\"#1\")\r\n ans = (a_i + b_i) * math.pow(2,2*(k-i)-s)\r\n #diff = int(diff/2) \r\n #ans = (a_i + b_i) * math.pow(2,4*diff-s)\r\n \r\n #if i and k are of different parities then obtaining first\r\n # a_(i+1) and b_(i+1)\r\n else:\r\n #print(\"#2\")\r\n ans = (2*x*a_i + 2*x*y*b_i) * math.pow(2,2*(k-(i+1))-s )\r\n diff = int(diff/2)\r\n ans = (2*x*a_i + 2*x*y*b_i) * math.pow(2,4*diff - s)\r\n #print(\"1: \", (2*x*a_i + 2*x*y*b_i))\r\n #print(\"2: \", math.pow(2,4*diff - 2- s)) \r\n #print(\"2 sol: \", math.pow(2,4*int(diff)-s))\r\n #print(\"diff: \",diff)\r\n\r\n\r\n # Obtaining the k_th element when k < i\r\n else:\r\n diff = i-k\r\n #if both k and i are odd or even\r\n if(i-k)%2==0:\r\n #print(\"#3\")\r\n ans = (a_i + b_i) / math.pow(2,2*(i-k)+s)\r\n #diff = int(diff/2)\r\n #ans = (a_i + b_i) / math.pow(2,4*diff+s)\r\n\r\n #if i and k are of different parities then obtaining first\r\n # a_(i+1) and b_(i+1)\r\n else:\r\n #print(\"#4\")\r\n ans = (2*x*a_i + 2*x*y*b_i) / math.pow(2,2*(i+1-k)+s)\r\n diff = int(diff/2)\r\n ans = (2*x*a_i + 2*x*y*b_i) / math.pow(2,4*diff + 4 + s)\r\n\r\n\r\n print(ans)\r\n \r\nmain()\r\n"] | {"inputs": [["1 1 5", "4 5"]], "outputs": [["0.28125"]]} | INTERVIEW | PYTHON3 | CODECHEF | 1,941 | |
413995e6848aee78fde4e37f09be8bed | UNKNOWN | You are given a string $s$. And you have a function $f(x)$ defined as:
f(x) = 1, if $x$ is a vowel
f(x) = 0, if $x$ is a constant
Your task is to apply the above function on all the characters in the string s and convert
the obtained binary string in decimal number $M$.
Since the number $M$ can be very large, compute it modulo $10^9+7$.
-----Input:-----
- The first line of the input contains a single integer $T$ i.e the no. of test cases.
- Each test line contains one String $s$ composed of lowercase English alphabet letters.
-----Output:-----
For each case, print a single line containing one integer $M$ modulo $10^9 + 7$.
-----Constraints-----
- $1 ≤ T ≤ 50$
- $|s|≤10^5$
-----Subtasks-----
- 20 points : $|s|≤30$
- 80 points : $ \text{original constraints}$
-----Sample Input:-----
1
hello
-----Sample Output:-----
9 | ["t=int(input())\nMOD=(10**9)+7\nl=['a','e','i','o','u']\nfor i in range(t):\n s=input()\n k=[]\n for j in s:\n if j in l:\n k.append(1)\n else:\n k.append(0)\n r=bin(int(''.join(map(str, k)), 2) << 1)\n print((int(r,2)//2)%MOD)\n", "for _ in range(int(input())):\n s=input()\n ss=list(s)\n for n, i in enumerate(ss):\n if i in 'aeiou':\n ss[n] = 1\n else:\n ss[n]=0\n print(int(''.join(map(str,ss)),2))", "for _ in range(int(input())):\n a=input()\n b=[]\n for i in a:\n if i in ['a','e','i','o','u','A','E','I','O','U']:b.append(1)\n else:b.append(0)\n c=0\n l=len(a)\n for i in range(l):\n if b[-i-1]:c+=1<<i\n print(c)", "for _ in range(int(input())):\n s=input()\n s=list(s)\n for n, i in enumerate(s):\n if i in 'aeiou':\n s[n] = 1\n else:\n s[n]=0\n print(int(''.join(map(str,s)),2))", "for _ in range(int(input())):\n s=input()\n s=list(s)\n for n, i in enumerate(s):\n if i in 'aeiou':\n s[n] = 1\n else:\n s[n]=0\n m = ''.join(map(str,s))\n print(int(m,2))", "# cook your dish here\ndef val(c): \n if c >= '0' and c <= '9': \n return ord(c) - ord('0') \n else: \n return ord(c) - ord('A') + 10; \n\n# Function to convert a number \n# from given base 'b' to decimal \ndef toDeci(str,base): \n llen = len(str) \n power = 1 #Initialize power of base \n num = 0 #Initialize result \n\n # Decimal equivalent is str[len-1]*1 + \n # str[len-1]*base + str[len-1]*(base^2) + ... \n for i in range(llen - 1, -1, -1): \n \n # A digit in input number must \n # be less than number's base \n if val(str[i]) >= base: \n print('Invalid Number') \n return -1\n num += val(str[i]) * power \n power = power * base \n return num \n\nt=int(input())\nfor _ in range(t):\n s=input()\n s1=[]\n \n for i in range(len(s)):\n if s[i]=='a'or s[i]=='e'or s[i]=='i' or s[i]=='o' or s[i]=='u':\n s1.append(1)\n else:\n s1.append(0)\n s2=''.join([str(elem) for elem in s1]) \n print(toDeci(s2, 2)) \n\n \n", "for _ in range(int(input())):\n a=input()\n b=[]\n for i in a:\n if i in ['a','e','i','o','u']:b.append(1)\n else:b.append(0)\n c=0\n l=len(a)\n for i in range(l):\n if b[-i-1]:c+=1<<i\n print(c)", "t=int(input())\nl=['a','e','i','o','u']\nfor i in range(t):\n s=input()\n k=[]\n for j in s:\n if j in l:\n k.append(1)\n else:\n k.append(0)\n r=bin(int(''.join(map(str, k)), 2) << 1)\n print(int(r,2)//2)", "t=int(input())\nl=['a','e','i','o','u']\nfor i in range(t):\n s=input()\n k=[]\n for j in s:\n if j in l:\n k.append(1)\n else:\n k.append(0)\n r=bin(int(''.join(map(str, k)), 2) << 1)\n print(int(r,2)//2)", "# cook your dish here\nt=int(input())\nfor _ in range(t):\n s=input()\n s1=[]\n \n for i in range(len(s)):\n if s[i]=='a'or s[i]=='e'or s[i]=='i' or s[i]=='o' or s[i]=='u':\n s1.append(1)\n else:\n s1.append(0)\n s2=''.join([str(elem) for elem in s1]) \n \n print(int(s2,2))\n \n", "t=int(input())\nfor i in range(0,t):\n s=input()\n l=len(s)\n ans=0\n for j in range(0,l):\n if s[j]=='a' or s[j]=='e' or s[j]=='i' or s[j]=='o' or s[j]=='u':\n c=1\n else:\n c=0\n ans=ans+c*pow(2,l-1)\n l=l-1\n print(ans%1000000007) ", "vowel=['a','e','i','o','u']\ndef f(n):\n return 1 if n in vowel else 0\n\nfor _ in range(int(input())):\n a=input()\n num=''\n for i in a:\n num+=str(f(i))\n print(int(num,2)%1000000007)", "for _ in range(int(input())):\n S=input()\n M = 1000000007\n l=[]\n for i in range(len(S)):\n if (S[i]==\"a\" or S[i]==\"e\" or S[i]==\"i\" or S[i]==\"o\" or S[i]==\"u\"):\n l.append(1)\n else:\n l.append(0)\n k=\"\".join(str(x) for x in l)\n N=int(k,2)%M\n print(N)", "def fun(x):\n if x in ['a','e','i','o','u']:\n return '1'\n else:\n return '0'\n\ntry:\n t=int(input())\n j=0\n while(j<t):\n s=''\n st=input()\n if(not st.isalpha):\n return\n for i in st:\n va=fun(i)\n #print(va)\n s=s+va\n #print(s)\n a=int(s,2)\n print(a%1000000007)\nexcept:\n return\n", "def fun(x):\n if x in ['a','e','i','o','u']:\n return '1'\n else:\n return '0'\n\ntry:\n t=int(input())\n j=0\n while(j<t):\n s=''\n st=input()\n if(not st.isalpha):\n return\n for i in st:\n va=fun(i)\n #print(va)\n s=s+va\n #print(s)\n a=int(s,2)\n print(a%1000000007)\nexcept:\n return\n", "t=int(input())\nfor x in range(t):\n ss=\"\"\n s=input()\n for i in s:\n if i in \"aeiou\":\n ss=ss+\"1\"\n else:\n ss=ss+\"0\"\n l = len(ss)\n res=0\n for i in range(l):\n res=res+((int(ss[i]))*(pow(2,l-1-i,1000000007)))\n res=res%1000000007\n print(res)", "def fun(x):\n if x in ['a','e','i','o','u']:\n return '1'\n else:\n return '0'\n\ntry:\n t=int(input())\n j=0\n while(j<t):\n s=''\n st=input()\n if(not st.isalpha):\n return\n for i in st:\n va=fun(i)\n #print(va)\n s=s+va\n #print(s)\n a=int(s,2)\n print(a)\nexcept:\n return\n", "t=int(input())\nfor i in range(t):\n st=input()\n li=list(map(lambda c:str(int(c.lower() in ['a','i','e','o','u'])),st))\n print(int(\"\".join(li),2)%(10**9+7))", "# cook your dish here\nn=int(input())\nm=pow(10,9)+7\nfor i in range(n):\n s=list(input())\n c=[None]*len(s)\n for j in range(len(s)):\n c[j]=-1\n \n for j in range(len(s)):\n if(s[j]=='a' or s[j]=='i' or s[j]=='e' or s[j]=='o' or s[j]=='u'):\n c[j]=1 \n else:\n c[j]=0\n d=len(s)-1\n a=0\n for j in range(0,len(s)):\n k=pow(2,d)\n a+=(k*c[j])\n d-=1\n print(a%m) \n", "t=int(input())\nfor j in range(t):\n s=input()\n n=len(s)\n e=0\n for i in range(n):\n ch=s[i]\n if(ch=='a'or ch =='e'or ch=='i' or ch=='o' or ch=='u'):\n e+=pow(2,(n-i-1),1000000007)\n e=e%1000000007\n print(int(e))\n \n", "for _ in range(int(input())):\n S=input()\n l=[]\n for i in range(len(S)):\n if (S[i]==\"a\" or S[i]==\"e\" or S[i]==\"i\" or S[i]==\"o\" or S[i]==\"u\"):\n l.append(1)\n else:\n l.append(0)\n k=\"\".join(str(x) for x in l)\n N=int(k,2)\n print(N)", "t=int(input())\nfor i in range(t):\n st=input()\n bi=list(map(lambda c:str(int(c.lower() in ['a','i','e','o','u'])),st))\n print(int(\"\".join(bi),2)%(10**9+7))", "# cook your dish here\nn=int(input())\nm=pow(10,9)+7\nfor i in range(n):\n s=list(input())\n c=[None]*len(s)\n for j in range(len(s)):\n c[j]=-1\n \n for j in range(len(s)):\n if(s[j]=='a' or s[j]=='i' or s[j]=='e' or s[j]=='o' or s[j]=='u'):\n c[j]=1 \n else:\n c[j]=0\n d=len(s)-1\n a=0\n for j in range(0,len(s)):\n k=pow(2,d)\n a+=(k*c[j])\n d-=1\n print(a) \n", "t=int(input())\nfor x in range(t):\n ss=\"\"\n s=input()\n for i in s:\n if i in \"aeiou\":\n ss=ss+\"1\"\n else:\n ss=ss+\"0\"\n l = len(ss)\n res=0\n for i in range(l):\n res=res+((int(ss[i]))*((2**(l-1-i))%1000000007))%1000000007\n print(res)"] | {"inputs": [["1", "hello"]], "outputs": [["9"]]} | INTERVIEW | PYTHON3 | CODECHEF | 6,590 | |
7017fe4d70c7330ae8a09270b2a24587 | UNKNOWN | Chef Shifu wanted to celebrate the success of his new restaurant with all his employees. He was willing to host a party and he had decided the location of the party as well. However, Chef Shifu was a shy person and wanted to communicate with the least possible employees to inform them about the party, and that these employees could inform their friends.
Note that an employee could only inform his/her immediate friends about the party, not his/her friends’ friends.
Chef Shifu has a list of all the friendships among his employees. Help him find the minimum number of employees he should inform, so that every employee knows about the celebration party.
-----Input-----
First line contains a single integer T - the total number of testcases.
T testcases follow. For each testcase:
The first line contains 2 space-separated integers N and M - the total number of employees working under Chef Shifu and the number of friendship relations.
M lines follow - each line contains 2 space-separated integers u and v, indicating that employee u is a friend of employee v and vice-versa.
The employees are numbered from 1 to N, and each employee is assigned a distinct integer.
-----Output-----
For each testcase, print the minimum number of employees to be informed on a new line.
-----Constraints-----
Subtask 1: 5 points
1 ≤ T ≤ 5
1 ≤ N ≤ 4
0 ≤ M ≤ N*(N-1)/2
Subtask 2: 35 points
1 ≤ T ≤ 5
1 ≤ N ≤ 15
0 ≤ M ≤ N*(N-1)/2
Subtask 3: 60 points
1 ≤ T ≤ 5
1 ≤ N ≤ 20
0 ≤ M ≤ N*(N-1)/2
-----Example-----
Input
2
3 3
1 2
2 3
1 3
4 3
1 2
2 3
3 4
Output
1
2
Explanation
In testcase 1, since every employee is a friend of every other employee, we just need to select 1 employee.
In testcase 2, selecting employees 2 and 4 would ensure that all 4 employees are represented.
Similarly, selecting employees 1 and 3 would also ensure that all 4 employees are selected.
In both cases, we must select 2 employees in the best case. | ["t=int(input())\nfor _ in range(t):\n n,m=map(int,input().split())\n mat=[0 for i in range(n)]\n #mat=[[0 for i in range(n)] for j in range(n)]\n for i in range(m):\n u,v=map(int,input().split())\n u,v=(u-1),(v-1)\n mat[u]|=(1<<v)\n mat[v]|=(1<<u)\n for i in range(n):\n mat[i]|=(1<<i) \n \n goal=(2**n)-1\n ans=n\n\n for i in range(1,goal+1):\n mvs=0\n loc=0\n for j in range(n):\n if(i&(1<<j)):\n loc|=mat[j]\n mvs+=1\n if(loc==goal):\n ans=min(mvs,ans)\n print(ans)", "t=int(input())\nfor _ in range(t):\n n,m=map(int,input().split())\n mat=[[0 for i in range(n+1)] for j in range(n+1)]\n for i in range(m):\n u,v=map(int,input().split())\n mat[u][v]=1\n mat[v][u]=1\n ord=[]\n for i in range(n+1):\n ord.append([sum(mat[i]),i])\n ord.sort(reverse=True)\n moves=[]\n tld=0\n ord=ord[:-1]\n for k in range(n):\n mv=0\n for i in range(n):\n loc=ord[(i+k)%n][1]\n if(mat[loc][0]!=1):\n mv+=1\n for j in range(1,n+1):\n if(mat[loc][j]==1 and mat[j][0]!=1):\n mat[j][0]=1\n moves.append(mv)\n print(min(moves))"] | {"inputs": [["2", "3 3", "1 2", "2 3", "1 3", "4 3", "1 2", "2 3", "3 4"]], "outputs": [["1", "2"]]} | INTERVIEW | PYTHON3 | CODECHEF | 1,197 | |
d24c8ef29f393722f5ac0c179a72c75d | UNKNOWN | So the Chef has become health conscious and is now lifting weights at the gym. But its his first time so the trainer gives him a simple job to do.
He has been given a weight lifting rod and N heavy weights, each weighing 20, 21, .... , 2n-1. He has to stick each of the "N" weights on the rod, one after another, in such a way that the right side is never heavier than the left side. At each step he chooses one of the weights that has not yet been fixed on the rod, and fix it on either the left side of the rod or the right, until all of the weights have been placed.
Now help the chef and find out, in how many ways the chef can accomplish this?
-----Input-----
First line of input contains an integer T, the number of test cases. Then T test cases follow. Each line of test case contains one integer, N denoting the number of weights
-----Output-----
The output contains T lines, each containing an integer denoting all possible combinations
-----Example-----
Input:
3
2
5
18
Output:
3
945
221643095476699771875 | ["t = int(input())\n\nwhile(t>0):\n \n n=int(input())\n if(n<=0):\n print(0)\n \n fact=1\n start=1\n for i in range(1,n+1):\n fact*=start\n start+=2\n print(fact)\n \n t=t-1\n", "#!/usr/bin/env python\n\n'''\nfrom sys import stderr\n\ndef f(maxG, remaining):\n #stderr.write('%s %s\\n' % (maxG, remaining))\n if not remaining: return 1\n S = 0\n for i in xrange(len(remaining)):\n if remaining[i] < maxG:\n S += 2 * f(maxG, remaining[:i] + remaining[i+1:])\n else:\n S += 1 * f(remaining[i], remaining[:i] + remaining[i+1:])\n return S\n'''\n\ndef process(N):\n P = 1\n for i in range(1, 2 * N, 2):\n P *= i\n return P\n\ndef main():\n T = int(input())\n for t in range(T):\n N = int(input())\n #stderr.write(('*'*70) + '\\n')\n #print f(-1, range(N))\n print(process(N))\n\nmain()\n\n", "N=input()\nn=int(N)\na=[]\nwhile n>0:\n a.append(input())\n n=n-1\ni=0\nfor value in a:\n a[i]=int(value)\n i=i+1\nb=[1,3]\ni=2\nk=5\nwhile i<100:\n b.append(b[i-1]*k)\n k=k+2\n i=i+1\ni=0\nn=int(N)\nwhile n>0:\n print(b[a[i]-1])\n i=i+1\n n=n-1", "t = eval(input())\ni=1\nwhile(i<=t):\n j=eval(input())\n j=(2*j)-1\n k=1\n p=1\n while(k<=j):\n p=p*k\n k=k+2 \n print(p)\n print(\"\\n\")\n i=i+1", "\ndef comb (i) :\n res = 1\n for k in range(1,i,2) :\n res =res * k\n print(res)\n \nt = eval(input())\nfor i in range( 1 , t + 1 ) :\n h= eval(input())\n h= h+1 \n comb(2*h-1)\n", "t=int(input())\nwhile t>0:\n n=int(input())\n ans=1\n temp=1\n while temp<=n :\n ans=ans*(2*temp-1)\n temp=temp+1\n print(ans)\n t=t-1", "import sys\n\nN=80\nans=[1]\ni=1\nwhile i < N:\n ans.append(ans[i-1] * (2*i-1))\n i = i+1\n\nT=int(sys.stdin.readline().strip())\nwhile T > 0:\n n=int(sys.stdin.readline().strip())\n print(ans[n])\n T=T-1;\n", "N=eval(input())\nn=int(N)\na=[]\nwhile n>0:\n a.append(eval(input()))\n n=n-1\ni=0\nfor value in a:\n a[i]=int(value)\n i=i+1\nb=[1,3]\ni=2\nk=5\nwhile i<100:\n b.append(b[i-1]*k)\n k=k+2\n i=i+1\ni=0\nn=int(N)\nwhile n>0:\n print(b[a[i]-1])\n i=i+1\n n=n-1\n", "\n\ndp = [-1 for i in range(11919)]\nfac = [1 for i in range(111)]\nfor i in range(1,100):\n fac[i] = fac[i-1]*i\ndef comb(n, r):\n return fac[n]/(fac[n-r]*fac[r])\n ret = 1\n for i in range(r):\n ret *= (n-i)\n ret /= (i+1)\n return ret\n # return factorial(n)/(factorial(n-r)*factorial(r))\n\ndef solve(n):\n if dp[n] > 0 :\n return dp[n]\n if n == 0:\n return 1\n ans = 0\n for i in range(n):\n ans += comb(n-1, i)*solve(i)*pow(2,n-1-i)*fac[(n-1-i)]\n dp[n] = ans\n return dp[n]\n\nt = int(input())\nfor i in range(t):\n n = int(input())\n ans = 0\n for i in range(n):\n ans += comb(n-1, i)*solve(i)*pow(2,n-1-i)*fac[(n-1-i)]\n print(ans)\n \n", "testcases = int(input())\nwhile testcases:\n p = int(input())\n Res = 1;\n n = 1;\n while n <= (2*p):\n Res = Res*n\n n = n+2\n print(Res)\n testcases=testcases-1\n", "def dfac ( n ) :\n ans = 1\n for i in range(1,n,2) :\n ans = ans * i\n print(ans)\n \nt = eval(input())\nfor i in range( 1 , t + 1 ) :\n n = eval(input())\n n = n+1 \n dfac ( 2 * n - 1 )\n", "import sys\n\ndef DFact(n):\n s = 1\n for i in range(3, n + 1, 2):\n s *= i\n return s\n\nT = int(sys.stdin.readline())\nfor i in range(T):\n N = int(sys.stdin.readline())\n print(DFact(2 * N - 1))\n", "def dfac ( n ) :\n ans = 1\n for i in range(1,n,2) :\n ans = ans * i\n print(ans)\n\nt = eval(input())\nfor i in range( 1 , t + 1 ) :\n n = eval(input())\n n = n+1 \n dfac ( 2 * n - 1 )", "import sys\ndef fact(x):\n if x==1:\n return 1\n else:\n return x*fact(x-2)\nline = sys.stdin.readline()\nn=int(line)\nwhile n:\n try:\n line = sys.stdin.readline()\n t=int(line)\n except:\n break\n x=fact((2*t)-1)\n print(\"%d\\n\"%x)\n n-=1", "''' \nChef at Gym\nCreated on Mar 3, 2012\n\n@author: Andy Huang\n'''\nt = eval(input())\nmoi = []\nans = 1\nmul = 3\ni = 75\nmoi.append(1);\nmoi.append(1);\nwhile i:\n ans *= mul\n mul += 2\n moi.append(ans)\n i -= 1\nwhile (t):\n n = eval(input())\n print(moi[n])\n t -= 1\n#print(moi)\n", "import sys\n\nk=1\nl=[]\nn=1\nwhile n<=1000:\n l.append(k)\n k=k*(2*n+1)\n n+=1\n\nt = int(input())\n\nfor i in range(t):\n n=int(input())\n print(l[n-1])\n\n\n\nreturn\n", "def D(n): return n and (2*n-1)*D(n-1) or 1\ndef N(n): return n and (4*n*n-8*n+3)*N(n-2)+7*D(n-2) or 1\n\nn=eval(input())\nfor i in range(n):\n n = eval(input())\n print(D(n))\n", "def D(n): return n and (2*n-1)*D(n-1) or 1\ndef N(n): return n and (4*n*n-8*n+3)*N(n-2)+7*D(n-2) or 1\n\nn=eval(input())\nfor i in range(n):\n n = eval(input())\n print(D(n))\n"] | {"inputs": [["3", "2", "5", "18"]], "outputs": [["3", "945", "221643095476699771875"]]} | INTERVIEW | PYTHON3 | CODECHEF | 4,527 | |
63768d1b1caaf4df9f1d9f0689f2dd61 | UNKNOWN | Write a program to obtain a number $(N)$ from the user and display whether the number is a one digit number, 2 digit number, 3 digit number or more than 3 digit number
-----Input:-----
- First line will contain the number $N$,
-----Output:-----
Print "1" if N is a 1 digit number.
Print "2" if N is a 2 digit number.
Print "3" if N is a 3 digit number.
Print "More than 3 digits" if N has more than 3 digits.
-----Constraints-----
- $0 \leq N \leq 1000000$
-----Sample Input:-----
9
-----Sample Output:-----
1 | ["# cook your dish here\nx=input ()\ny=len (x)\nif y==1:\n print('1')\nelif y==2:\n print('2')\nelif y==3:\n print('3')\nelif y>3:\n print('More than 3 digits')", "# cook your dish here\nn = input()\nl = len(n)\n\nif l==1:\n print(1)\nelif l==2:\n print(2)\nelif l==3:\n print(3)\nelse:\n print(\"More than 3 digits\")", "# cook your dish here\nt = int(input())\na = 0\nwhile(t!=0):\n t = int(t/10)\n a += 1\nif(a==1):\n print(\"1\")\nelif(a==2):\n print(\"2\")\nelif(a==3):\n print(\"3\")\nelse:\n print(\"More than 3 digits\")", "# cook your dish here\nn=input()\nif(len(n)<4):\n print(str(len(n)))\nelse:\n print(\"More than 3 digits\")", "n=int(input())\nif n<=9:\n print(1)\nelif n<=99:\n print(2)\nelif n<=999:\n print(3)\nelse:\n print('More than 3 digits')", "N=int(input())\nc=0\nwhile(N>0):\n c=c+1 \n N=N//10\nif(c<=3):\n print(c)\nelif(c>3):\n print('More than 3 digits')", "digit = int(input())\nprint(\"More than 3 digits\" if len(str(digit)) > 3 else len(str(digit)) ) ", "digit = int(input())\n# if(len(str(digit))>3):\n# print(\"More than 3 digits\")\n# else:\n# print(len(str(digit)))\n \nprint(\"More than 3 digits\" if len(str(digit)) > 3 else len(str(digit)) ) ", "N=int(input())\ncount=0\nwhile N!=0:\n count +=1\n N //=10\nif count<=3:\n print(count)\nelse:\n print(\"More than 3 digits\")", "# cook your dish here\nn=int(input())\nc=0\nwhile n>0:\n r=n%10\n c=c+1 \n n=n//10\nif c==1:\n print(1)\nelif c==2:\n print(2)\nelif c==3:\n print(3)\nelse:\n print(\"More than 3 digits\")", "n=int(input())\nif n<=9:\n print(\"1\")\nelif n<=99:\n print(\"2\")\nelif n<=999:\n print(\"3\")\nelse:\n print(\"More than 3 digits\")\n", "N = int(input())\nif N < 10:\n print(1)\nelif N < 100:\n print(2)\nelif N < 1000:\n print(3)\nelse:\n print(\"More than 3 digits\")\n\n", "n=int(input())\nsn=str(n)\nif len(sn)==1:\n print(1)\nelif len(sn)==2:\n print(2)\nelif len(sn)==3:\n print(3)\nelif len(sn)>3:\n print(\"More than 3 digits\")", "num = input()\n\nif(len(num) <= 3):\n print(len(num))\nelse:\n print(\"More than 3 digits\")", "# cook your dish here\nn=input()\nif(len(n)<=3):\n print(len(n))\nelse:\n print('More than 3 digits')", "# cook your dish here\ntry:\n n = int(input())\n i = 0\n while(n>=10**i):\n i = i+1\n if(i<=3):\n print(i)\n else:\n print(\"More than 3 digits\")\nexcept:\n pass", "n=len(input())\n\nif n<4:\n print(n)\nelse:\n print(\"More than 3 digits\")", "# cook your dish here\nn = input()\n\nlent = len(n)\nif lent <= 3:\n print(lent)\nelse:\n print('More than 3 digits')", "# cook your dish here\nn=int(input())\ns=str(n)\na=len(s)\nif a==1:\n print(\"1\")\nelif a==2:\n print(\"2\")\nelif a==3:\n print(\"3\")\nelse:\n print(\"More than 3 digits\")", "n= int(input())\nc=0\nwhile(n>0):\n c+=1 \n n//=10\nif c==1:\n print(1)\nelif c==2:\n print(2)\nelif c==3:\n print(3)\nelif c>3:\n print('More than 3 digits')", "# cook your dish here\ndef __starting_point():\n s = int(input())\n if s<=9:\n print(1)\n elif s<=99:\n print(2)\n elif s<=999:\n print(3)\n else: print('More than 3 digits')\n\n__starting_point()", "# cook your dish here\ns=input()\nif len(s)==1:\n print(1)\nif len(s)==2:\n print(2)\nif len(s)==3:\n print(3)\nelif len(s)>3:\n print( \"More than 3 digits\")", "n=int(input())\ns=str(n)\nl=list(s)\nx=0\nif len(l)>3:\n print(\"More than 3 digits\")\nelse:\n for i in l:\n x+=1\n print(x)"] | {"inputs": [["9"]], "outputs": [["1"]]} | INTERVIEW | PYTHON3 | CODECHEF | 3,366 | |
bb844c57ee2d4c162045ce14ab509b27 | UNKNOWN | Did you hear about the Nibiru collision ? It is a supposed disastrous encounter between the earth and a large planetary object. Astronomers reject this idea. But why listen to other people's beliefs and opinions. We are coders above all, so what better way than to verify it by a small code. The earth and N asteroids are in the 2D plane. Each of them is initially located at some integer coordinates at time = 0 and is moving parallel to one of the X or Y axis with constant velocity of 1 unit per second.
Direction of movement is given as 'U' ( Up = towards positive Y ), 'D' ( Down = towards negative Y ), 'R' ( Right = towards positive X ), 'L' ( Left = towards negative X ). Given the initial position and the direction of movement of the earth and each of the N asteroids, find the earliest time at which the earth collides with one of the asteroids. If there can not be any collisions with the earth, print "SAFE" ( without quotes ). You can ignore the collisions between asteroids ( i.e., they continue to move in same direction even after collisions between them ).
-----Input-----
First line contains T, number of test cases. T cases follow. In each test case, first line contains XE YE DIRE, where (XE,YE) is the initial position of the Earth, DIRE is the direction in which it moves. Second line contains N, the number of
asteroids. N lines follow, each containing XA YA DIRA, the initial position and the direction of movement of each asteroid. No asteroid is initially located at (XE,YE)
-----Output-----
For each test case, output the earliest time at which the earth can collide with an asteroid (rounded to 1 position after decimal). If there can not be any collisions with the earth, print "SAFE" (without quotes).
-----Constraints-----
1 ≤ T ≤ 10
1 ≤ N ≤ 2012
-100 ≤ XE, YE, XA, YA ≤ 100
(XE,YE) != any of (XA,YA)
DIRE, DIRA is one of 'U', 'R', 'D', 'L'
-----Example-----
Input:
3
0 0 R
2
1 -2 U
2 2 D
1 1 U
1
1 0 U
0 0 R
1
3 0 L
Output:
2.0
SAFE
1.5
Explanation:
Case 1 :
Time 0 - Earth (0,0) Asteroids { (1,-2), (2,2) }
Time 1 - Earth (1,0) Asteroids { (1,-1), (2,1) }
Time 2 - Earth (2,0) Asteroids { (1,0 ), (2,0) }
Case 2 :
The only asteroid is just one unit away below the earth and following us always, but it will never collide :)
Case 3 :
Time 0 - Earth (0,0) Asteroid (3,0)
Time 1 - Earth (1,0) Asteroid (2,0)
Time 1.5 - Earth (1.5,0) Asteroid (1.5,0)
Note : There are multiple test sets, and the judge shows the sum of the time taken over all test sets of your submission, if Accepted. | ["#-*- coding:utf-8 -*-\n\nimport sys\n\n\n# class Point:\n# def __init__(self, x, y):\n# self.x = x\n# self.y = y\n\n# def mul(self, k):\n# return Point(k * self.x, k * self.y)\n\n# def __add__(self, other):\n# return Point(self.x + other.x, self.y + other.y)\n\n# def __sub__(self, other):\n# return self + (-other)\n\n# def __neg__(self):\n# return Point(-self.x, -self.y)\n\n# def __eq__(self, other):\n# return self.x == other.x and self.y == other.y\n\n# def __getitem__(self, index):\n# return (self.x, self.y)[index]\n\n# def __str__(self):\n# return \"(%d;%d)\" % (self.x, self.y)\n\n\nDIRS = dict(\n U=(0, 1),\n D=(0, -1),\n R=(1, 0),\n L=(-1, 0)\n)\nKOEF = 0.2\n\n\ndef div(a, b):\n return round(float(a) / b, 1)\n\n\n# class Moving:\n# def __init__(self, x, y, dir):\n# self.p = Point(x, y)\n# self.dir = Point(*DIRS[dir.upper()])\n\n# def collide(self, other):\n# times = []\n# for coord in range(2):\n# d = abs(self.p[coord] - other.p[coord])\n# d2 = abs((self.p + self.dir.mul(KOEF) - other.p)[coord])\n# d3 = abs((other.p + other.dir.mul(KOEF) - self.p)[coord])\n# d_next = abs((self.p + self.dir.mul(KOEF) - (other.p + other.dir\u00a0\u00a0\u00a0\u00a0.mul(KOEF)))[coord])\n# if d2 > d or d3 > d:\n# return None\n\n# speed = abs(d_next - d)\n# if speed == 0:\n# if self.p[coord] != other.p[coord]:\n# return None\n# continue\n# times.append( div(d, speed / KOEF) )\n\n# if len(times) == 2 and times[0] != times[1]:\n# return\n# return times[0]\n\n\ndef collide_coord(ex, edx, x, dx):\n d = abs(ex - x)\n d2 = abs(ex + edx - x)\n d3 = abs(ex - x - dx)\n if d2 > d or d3 > d:\n return False\n\n d_next = abs(ex + edx * KOEF - x - dx * KOEF)\n speed = abs(d_next - d)\n if speed == 0:\n if ex != x:\n return\n return \"all\" # all\n else:\n return div(d, speed / KOEF)\n\n\ndef main():\n t = int(input())\n for _ in range(t):\n ex, ey, dir = sys.stdin.readline().strip().split()\n ex = int(ex)\n ey = int(ey)\n edx, edy = DIRS[dir]\n\n n = int(sys.stdin.readline())\n min_time = float(\"+inf\")\n for _ in range(n):\n x, y, dir = sys.stdin.readline().strip().split()\n x = int(x)\n y = int(y)\n dx, dy = DIRS[dir]\n\n tx = collide_coord(ex, edx, x, dx)\n if tx is False:\n continue\n ty = collide_coord(ey, edy, y, dy)\n if ty is False:\n continue\n\n if tx == \"all\":\n min_time = min(min_time, ty)\n elif ty == \"all\":\n min_time = min(min_time, tx)\n elif tx == ty:\n min_time = min(min_time, tx)\n\n print(min_time if min_time < 1000000 else \"SAFE\")\n\n\ndef __starting_point():\n main()\n\n__starting_point()", "# codechef - easy - collide\n\ndirTable = {}\ndirTable[\"R\"] = (1,0)\ndirTable[\"L\"] = (-1,0)\ndirTable[\"D\"] = (0,-1)\ndirTable[\"U\"] = (0,1)\n\ndef readCoordinates():\n strX, strY, strDir = input().split()\n x = int(strX)\n y = int(strY)\n dx,dy = dirTable[strDir]\n return x,y, dx,dy\n\n\nt = int(input())\nfor test in range(t):\n xe, ye, dxe, dye = readCoordinates()\n n = int(input())\n shortest = 1000\n for i in range(n):\n xa, ya, dxa, dya = readCoordinates()\n xa -= xe\n ya -= ye\n dxa -= dxe \n dya -= dye\n\n if dxa==0 and dya==0:\n #print \"Same direction, pass\"\n continue\n elif dxa==0:\n if xa!=0:\n #print \"parallel, pass\"\n continue\n else:\n time = -ya*1.0/dya\n #print time\n if 0<time<shortest:\n shortest = time\n elif dya==0:\n if ya!=0:\n #print \"parallel Y\"\n continue\n else:\n time = -xa*1.0/dxa\n #print time\n if time>0 and time<shortest:\n shortest = time\n else:\n # dx,dy both !=0\n tx = -xa*1.0/dxa\n ty = -ya*1.0/dya\n #print tx,ty\n if tx==ty and 0<tx<shortest:\n shortest = tx\n if shortest<1000:\n print(\"%.1f\" % shortest)\n else:\n print(\"SAFE\")\n\n \n \n \n \n"] | {"inputs": [["3", "0 0 R", "2", "1 -2 U", "2 2 D", "1 1 U", "1", "1 0 U", "0 0 R", "1", "3 0 L"]], "outputs": [["2.0", "SAFE", "1.5"]]} | INTERVIEW | PYTHON3 | CODECHEF | 4,113 | |
75530d3c0bbb7b5c9afbb98371ac0e3b | UNKNOWN | You are given a grid of size N x M consisting of '.' (empty), 'W' (white) or 'B' (black) cells. We follow the convention that the top left corner is the position (1,1) and bottom right corner is (N,M).
From every '.' cell (i, j), a ray is shot towards the right. If the ray reaches a 'B' cell, it loses it's strength fully and stops there. When a ray
reaches a 'W' cell, it's strength drops drastically so that the ray stops when it reaches a second 'W' cell. That is, if there is no 'B'
cell in between, a ray can cross at most one 'W' cell, and it will stop when it reaches the second 'W' cell. It passes unchanged through any '.' cell. If it reaches a boundary cell (ie. (i,M), for some i), it stops there.
Let L(i, j) be length travelled by the ray starting from the cell (i, j). If (i,j) is 'W' or 'B', no ray starts from here, and hence L(i,j) is defined to be 0. If a ray starts from (i,j) and stops at (i,k), then the distance travelled by this ray is k-j+1. i.e, inclusive of both starting and ending cells.
For the given grid your task is to find the sum of L(i, j) over all 1 <= i <= N and 1 <= j <= M.
The description of the grid is given as follows: In addition to N and M, you are given the number of 'W' cells (w) and the number of 'B' cells (b)
and you are given the locations of these w + b cells. (The other cells contain '.')
-----Constraints:-----
For all testcases,
- 1 <= N, M <= 10^6.
- 0 <= w,b <= 10^5
Subtask 1: 15%
It is guaranteed that 1 <= N,M <= 500
Subtask 2: 25%
It is guaranteed that 1 <= N,M <= 2000
Subtask 3: 60%
No additional guarantees.
-----Input format:-----
- There is only one line of input which contains 4 + 2w + 2b space separated integers. The first four integers are N, M, w and b.
- The next 2*w integers denote the cells which contains a 'W': x1 y1 x2 y2 .. xw yw. These denote that (xi,yi) contains 'W'.
- The next 2*b integers denote the cells which contains a 'B': x1 y1 x2 y2 .. xb yb. These denote that (xi,yi) contains 'B'.
- The cells which are not in the input have to be assumed to be '.'
-----Output format:-----
Output a single integer which is the sum of L(i,j) over all 1 <= i <= N and 1 <= j <= M.
-----Sample Input 1:-----
4 4 5 2 1 3 2 1 3 2 3 3 4 3 1 4 2 3
-----Sample Output 1:-----
22
-----Explanation:-----
The grid is:
. . W B
W . B .
. W W .
. . W .
L(i,j) for each cell is:
4 3 0 0
0 2 0 1
3 0 0 1
4 3 0 1
Therefore, the total is 22.
-----Note:-----
As the answer might be large, please use 64 bit integers (long long int in C/C++ and long in Java) instead of 32 bit int. | ["# cook your dish here\nfrom operator import itemgetter\ninp=list(map(int, input().split()))\nn, m, w, b = inp[:4]\nstops=[]\nfor i in range(w):\n stops.append((inp[4+2*i]-1,inp[5+2*i]-1,'w'))\nfor i in range(b):\n stops.append((inp[4+2*w+2*i]-1,inp[5+2*w+2*i]-1,'b'))\nstops.sort(key=itemgetter(1))\nstops.sort(key=itemgetter(0))\ncounter=0\nstop_rows=[[] for _ in range(n)]\nfor stop in stops:\n stop_rows[stop[0]].append(stop[1:])\nfor row in stop_rows:\n idx=0\n for i in range(len(row)):\n if idx==row[i][0]:\n idx+=1\n else:\n if row[i][1]=='w':\n if i<len(row)-1:\n num=row[i+1][0]-idx+1\n counter+=((num*(num+1))>>1)-1\n idx=row[i][0]+1\n num=row[i+1][0]-row[i][0]+1\n counter-=((num*(num+1))>>1)-1\n else:\n num=m-idx\n counter+=((num*(num+1))>>1)-1\n idx=row[i][0]+1\n num=m-row[i][0]\n counter-=((num*(num+1))>>1)-1\n else:\n num=row[i][0]-idx+1\n counter+=((num*(num+1))>>1)-1\n idx=row[i][0]+1\n num=m-idx\n counter+=(num*(num+1))>>1\nprint(counter)\n", "# cook your dish here\ninputs = list(map(int,input().split()))\nN = inputs[0]\nM=inputs[1]\nW = inputs[2]\nB=inputs[3]\nlist1=[[\".\"]*M for i in range(N)]\nfor i in range(4,(2*W)+4,2):\n list1[inputs[i]-1][inputs[i+1]-1] = 'W'\nfor j in range((2*W)+4,len(inputs),2):\n list1[inputs[j]-1][inputs[j+1]-1]=\"B\"\nlist2 = [[0]*M for i in range(N)]\nfirst=0\ndistance=0\nwhites=0\njs=0\ntotal=0\nfor i in range(N):\n first=0\n for j in range(M):\n if list1[i][j]==\".\" and first==0:\n whites=0\n first=1\n distance =1\n for k in range(j+1,M):\n if list1[i][k]==\"B\":\n distance+=1\n if k!=M-1:\n first=0\n break\n elif list1[i][k]==\"W\":\n whites +=1\n distance +=1\n if whites>1:\n if k!=M-1:\n first=0\n whites=0\n break\n elif list1[i][k]==\".\":\n distance +=1\n js=j+1\n js -=1\n list2[i][j] = distance +0\n total = total + distance\n elif list1[i][j]==\".\":\n list2[i][j] = list2[i][js] - (j-js)\n total += list2[i][j]\n else:\n list2[i][j] = 0\n first=0\n#for row in list2:\n #print(row)\nprint(total)\n\n", "# cook your dish here\ninputs = list(map(int,input().split()))\nN = inputs[0]\nM=inputs[1]\nW = inputs[2]\nB=inputs[3]\nlist1=[[\".\"]*M for i in range(N)]\nfor i in range(4,(2*W)+4,2):\n list1[inputs[i]-1][inputs[i+1]-1] = 'W'\nfor j in range((2*W)+4,len(inputs),2):\n list1[inputs[j]-1][inputs[j+1]-1]=\"B\"\nlist2 = [[0]*M for i in range(N)]\nfirst=0\ndistance=0\nwhites=0\njs=0\nfor i in range(N):\n first=0\n for j in range(M):\n if list1[i][j]==\".\" and first==0:\n whites=0\n first=1\n distance =1\n for k in range(j+1,M):\n if list1[i][k]==\"B\":\n distance+=1\n if k!=M-1:\n first=0\n break\n elif list1[i][k]==\"W\":\n whites +=1\n distance +=1\n if whites>1:\n if k!=M-1:\n first=0\n whites=0\n break\n elif list1[i][k]==\".\":\n distance +=1\n js=j+1\n js -=1\n list2[i][j] = distance +0\n elif list1[i][j]==\".\":\n list2[i][j] = list2[i][js] - (j-js)\n else:\n list2[i][j] = 0\n first=0\n#for row in list2:\n #print(row)\ntotal=0\nfor i in range(N):\n for j in range(M):\n total += list2[i][j]\nprint(total)\n \n", "# cook your dish here\ninputs = list(map(int,input().split()))\nN = inputs[0]\nM=inputs[1]\nW = inputs[2]\nB=inputs[3]\nlist1=[[\".\"]*M for i in range(N)]\nfor i in range(4,(2*W)+4,2):\n list1[inputs[i]-1][inputs[i+1]-1] = 'W'\nfor j in range((2*W)+4,len(inputs),2):\n list1[inputs[j]-1][inputs[j+1]-1]=\"B\"\nlist2 = [[0]*M for i in range(N)]\nfirst=0\ndistance=0\nwhites=0\njs=0\nfor i in range(N):\n first=0\n for j in range(M):\n if list1[i][j]==\".\" and first==0:\n whites=0\n first=1\n distance =1\n for k in range(j+1,M):\n if list1[i][k]==\"B\":\n distance+=1\n first=0\n break\n elif list1[i][k]==\"W\":\n whites +=1\n distance +=1\n if whites>1:\n first=0\n whites=0\n break\n elif list1[i][k]==\".\":\n distance +=1\n js=j+1\n js -=1\n list2[i][j] = distance +0\n elif list1[i][j]==\".\":\n list2[i][j] = list2[i][js] - (j-js)\n else:\n list2[i][j] = 0\n first=0\n#for row in list2:\n #print(row)\ntotal=0\nfor i in range(N):\n for j in range(M):\n total += list2[i][j]\nprint(total)\n \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()]\n\nn,m,w,b,*g = ip()\ndt = {i:[] for i in range(1,n+1)}\nfor i in range(0,2*w,2):\n dt[g[i]].append([g[i+1],'W'])\ng = g[2*w:]\nfor i in range(0,2*b,2):\n dt[g[i]].append([g[i+1],'B'])\nans = 0\nfor i in range(1,n+1):\n t = sorted(dt[i])\n if t == [] or t[-1][0] != m:\n t.append([m,'B'])\n ans += 1\n else:\n t[-1][1] = 'B'\n prev = 1\n for j in range(len(t)):\n ind,cell = t[j]\n no = ind - prev\n if cell == 'B':\n l = 2\n r = ind - prev + 1\n else:\n nxt = t[j+1][0]\n l = nxt - ind + 2\n r = nxt - prev + 1\n ans += no*(l+r)//2\n prev = ind + 1\nprint(ans)\n\n\n\n\n\n\n\n \n", "# cook your dish here\ndef suma(s, e, cnt):\n t = e - s\n if cnt < e:\n t_1 = e - cnt + 1\n ans = t * (t + 1) // 2 - t_1 * (t_1+1) // 2\n else:\n ans = t * (t + 1) // 2 - 1\n return ans\n\nn, m, w, b, *l = list(map(int, input().split()))\n# mat = [[0 for _ in range(m)] for _ in range(n)]\ndic = {}\nfor i in range(0, 2*w, 2):\n y, x = l[i]-1, l[i+1]-1\n # mat[y-1][x-1] = 1\n if y not in dic:\n dic[y] = [[x, 1]]\n else:\n dic[y].append([x, 1])\n\nfor i in range(2*w, 2*(w+b), 2):\n y, x = l[i]-1, l[i+1]-1\n # mat[y-1][x-1] = 2\n if y not in dic:\n dic[y] = [[x, 2]]\n else:\n dic[y].append([x, 2])\n\nans = 0\nfor v in list(dic.values()):\n v.sort()\n v.append([m-1, 2])\n i = len(v) - 1\n cnt_i = m + 1\n ans += 1\n while i >= 0:\n if i-1 >= 0 and v[i - 1][1] == 2:\n ans += suma(v[i - 1][0], v[i][0], cnt_i)\n cnt_i = v[i-1][0]\n i -= 1\n elif i-2 >= 0 and v[i - 2][1] == 1:\n ans += suma(v[i - 2][0], v[i][0], cnt_i)\n if cnt_i != v[i - 1][0]:\n ans -= (v[i][0] - v[i - 1][0] + 1)\n cnt_i = v[i - 2][0]\n i -= 1\n elif i-2 >= 0 and v[i - 2][1] == 2:\n ans += suma(v[i - 2][0], v[i][0], cnt_i)\n if cnt_i != v[i - 1][0]:\n ans -= (v[i][0] - v[i - 1][0] + 1)\n cnt_i = v[i - 2][0]\n i -= 2\n else:\n ans += suma(-1, v[i][0], cnt_i)\n if i == 1 and cnt_i != v[i - 1][0]:\n ans -= (v[i][0] - v[i - 1][0] + 1)\n break\n\n # prev_w = -1\n # blk = m - 1\n # cnted_i = m\n # for i in range(len(v) - 1, -1, -1):\n # prev_blk = -1\n # if v[i][1] == 2:\n # prev_blk = blk\n # blk = v[i][0]\n # prev_w = -1\n # ans -= 1\n # elif v[i][1] == 1:\n # if prev_w != -1:\n # prev_blk = blk\n # blk = prev_w\n # ans -= 1\n # prev_w = v[i][0]\n # ans -= blk - v[i][0] + 1\n\n # if prev_blk != -1:\n # t = prev_blk - v[i][0]\n # t_1 = prev_blk - cnted_i + 1\n # if cnted_i < prev_blk and v[i][1] == 1:\n # ans += 1\n # # if v[i][1] == 1:\n # # ans += blk - v[i][0]+1\n # ans += t * (t + 1) // 2 - t_1 * (t_1 + 1) // 2\n # cnted_i = v[i][0]+1\n # if cnted_i < prev_blk and v[i][1] == 1:\n # ans += 1\n # t = blk + 1\n # t_1 = blk - cnted_i + 1\n # ans += t * (t + 1) // 2 - t_1 * (t_1 + 1) // 2\n\nn -= len(dic)\nans += n*m*(m+1)//2\n# temp = [[0 for _ in range(m)] for _ in range(n)]\n# ans = 0\n# for j in range(n):\n# prev_w = -1\n# blk = m-1\n# for i in range(m-1, -1, -1):\n# if mat[j][i] == 2:\n# blk = i\n# prev_w = -1\n# elif mat[j][i] == 1:\n# if prev_w != -1:\n# blk = prev_w\n# prev_w = i\n# else:\n# ans += blk-i+1\n# temp[j][i] = blk-i+1\nprint(ans)\n# print(temp)\n", "# cook your dish here\nn, m, w, b, *l = list(map(int, input().split()))\nmat = [[0 for _ in range(m)] for _ in range(n)]\nfor i in range(w):\n y, x = l[2*i], l[2*i+1]\n mat[y-1][x-1] = 1\n \nfor i in range(w, w+b):\n y, x = l[2*i], l[2*i+1]\n mat[y-1][x-1] = 2\n\ntemp = [[0 for _ in range(m)] for _ in range(n)]\nans = 0\nfor j in range(n):\n prev_w = -1\n blk = m-1\n for i in range(m-1, -1, -1):\n if mat[j][i] == 2:\n blk = i\n prev_w = -1\n elif mat[j][i] == 1:\n if prev_w != -1:\n blk = prev_w\n prev_w = i\n else:\n ans += blk-i+1\n temp[j][i] = blk-i+1\nprint(ans)\n# print(temp)\n", "# cook your dish here\nit=list(map(int,input().split()))\nn,m=it[:2]\nw,b=it[2:4]\naa=it[4:4+2*w]\n\naa=[[aa[i*2],aa[i*2+1]] for i in range(w)]\nbb=it[4+2*w:]\nbb=[[bb[i*2],bb[i*2+1]] for i in range(b)]\nss=[[] for i in range(n)]\nfor i in aa:\n ss[i[0]-1].append([i[1]-1,1])\nfor i in bb:\n ss[i[0]-1].append([i[1]-1,0])\nss=[sorted(i) for i in ss]\ntot=0\nfor j in range(n):\n ind=0\n co=0\n st=[]\n # print(\"j is\",j)\n for i in ss[j]:\n if i[1]==1:\n co+=1\n if co<=1:\n st.append(i)\n continue\n a=i[0]-ind+1\n b=1+1\n # su=((a+b)*(a-b+1))//2\n \n # st=[]\n # tot+=su\n #print(a,b,tot)\n for ii in st:\n a=ind\n b=ii[0]-1\n a=i[0]-a+1\n b=i[0]-b+1\n \n su=((a+b)*(a-b+1))//2\n tot+=su\n # print(a,b,tot)\n ind=ii[0]+1\n st=[i[:]]\n # print(tot)\n # ind=i[0]+1\n else:\n co=0\n a=i[0]-ind+1\n b=1+1\n su=((a+b)*(a-b+1))//2\n \n tot+=su\n # print(a,b,tot)\n ind=i[0]+1\n for ii in st:\n tot-=(i[0]-ii[0]+1)\n st=[]\n # print(tot)\n a=ind\n b=m-1\n # print(a,b)\n # print(tot)\n if a<=b:\n a=m-a\n b=m-b\n \n # print(a,b)\n su=((a+b)*(a-b+1))//2\n tot+=su\n # print(tot)\n for ii in st:\n tot-=(m-ii[0])\n \n #print(tot)\n # print()\nprint(tot)\n \n \n \n", "it=list(map(int,input().split()))\nn,m=it[:2]\nw,b=it[2:4]\naa=it[4:4+2*w]\n\naa=[[aa[i*2],aa[i*2+1]] for i in range(w)]\nbb=it[4+2*w:]\nbb=[[bb[i*2],bb[i*2+1]] for i in range(b)]\nss=[[] for i in range(n)]\nfor i in aa:\n ss[i[0]-1].append([i[1]-1,1])\nfor i in bb:\n ss[i[0]-1].append([i[1]-1,0])\nss=[sorted(i) for i in ss]\ntot=0\nfor j in range(n):\n ind=0\n co=0\n st=[]\n # print(\"j is\",j)\n for i in ss[j]:\n if i[1]==1:\n co+=1\n if co<=1:\n st.append(i)\n continue\n a=i[0]-ind+1\n b=1+1\n # su=((a+b)*(a-b+1))//2\n \n # st=[]\n # tot+=su\n #print(a,b,tot)\n for ii in st:\n a=ind\n b=ii[0]-1\n a=i[0]-a+1\n b=i[0]-b+1\n \n su=((a+b)*(a-b+1))//2\n tot+=su\n # print(a,b,tot)\n ind=ii[0]+1\n st=[i[:]]\n # print(tot)\n # ind=i[0]+1\n else:\n co=0\n a=i[0]-ind+1\n b=1+1\n su=((a+b)*(a-b+1))//2\n \n tot+=su\n # print(a,b,tot)\n ind=i[0]+1\n for ii in st:\n tot-=(i[0]-ii[0]+1)\n st=[]\n # print(tot)\n a=ind\n b=m-1\n # print(a,b)\n # print(tot)\n if a<=b:\n a=m-a\n b=m-b\n \n # print(a,b)\n su=((a+b)*(a-b+1))//2\n tot+=su\n # print(tot)\n for ii in st:\n tot-=(m-ii[0])\n \n #print(tot)\n # print()\nprint(tot)\n \n \n \n", "arr = list(map(int,input().split()))\n\nn = arr.pop(0)\nm = arr.pop(0)\nw = arr.pop(0)\nb = arr.pop(0)\n\nwhites = {}\nfor i in range(0,2*w-1,2):\n x = arr[i]-1\n y = arr[i+1]-1\n \n if x in whites:\n whites[x].append(y)\n else:\n whites[x] = [y]\n\nblacks = {}\nfor i in range(2*w,2*(w+b),2):\n x = arr[i]-1\n y = arr[i+1]-1\n \n if x in blacks:\n blacks[x].append(y)\n else:\n blacks[x] = [y]\n\ndef simulateRay(x,y): \n wRow = {}\n bRow = {}\n \n if x in whites:\n wRow = whites[x]\n \n if x in blacks:\n bRow = blacks[x]\n else:\n if (len(wRow)==0) or ((len(wRow)==1) and (wRow[0]!=y)):\n return m-y\n\n if (y in wRow) or (y in bRow):\n return 0\n \n wCount = 0\n \n l = 1\n while y<(m-1):\n \n if y in wRow:\n wCount += 1\n if wCount == 2:\n return l\n if y in bRow:\n return l\n \n l += 1\n y += 1\n \n return l\n \ntotal = 0\nallL = int(m*(m+1)/2)\nfor i in range(n):\n if (i in whites) or (i in blacks):\n for j in range(m):\n res = simulateRay(i,j) \n ## print(i,j,res)\n total += res\n else:\n total += allL\nprint(total)\n \n", "arr = list(map(int,input().split()))\n\nn = arr.pop(0)\nm = arr.pop(0)\nw = arr.pop(0)\nb = arr.pop(0)\n\nwhites = {}\nfor i in range(0,2*w-1,2):\n x = arr[i]-1\n y = arr[i+1]-1\n \n if x in whites:\n whites[x].append(y)\n else:\n whites[x] = [y]\n\nblacks = {}\nfor i in range(2*w,2*(w+b),2):\n x = arr[i]-1\n y = arr[i+1]-1\n \n if x in blacks:\n blacks[x].append(y)\n else:\n blacks[x] = [y]\n\ndef simulateRay(x,y): \n wRow = {}\n bRow = {}\n \n if x in whites:\n wRow = whites[x]\n \n if x in blacks:\n bRow = blacks[x]\n else:\n if (len(wRow)==0) or ((len(wRow)==1) and (wRow[0]!=y)):\n return m-y\n\n if (y in wRow) or (y in bRow):\n return 0\n \n wCount = 0\n \n l = 1\n while y<(m-1):\n \n if y in wRow:\n wCount += 1\n if wCount == 2:\n return l\n if y in bRow:\n return l\n \n l += 1\n y += 1\n \n return l\n \ntotal = 0\nallL = m*(m+1)/2\nfor i in range(n):\n for j in range(m):\n res = simulateRay(i,j) \n## print(i,j,res)\n total += res\n\nprint(total)\n \n", "# cook your dish here\nx=list(map(int,input().strip().split()))\nn,m,w,b=x[0],x[1],x[2],x[3]\nl=[[0]*m for _ in range(n)]\nfor i in range(4,4+2*w,2):\n l[x[i]-1][x[i+1]-1]=1\nfor i in range(4+2*w,4+2*w+2*b,2):\n l[x[i]-1][x[i+1]-1]=2\nct=0\ndel(x)\nfor x in l:\n p1,p2,q=m,m,m\n for i in range(m-1,-1,-1):\n if x[i]==2:\n q=i\n elif x[i]==1:\n p2=p1\n p1=i\n else:\n '''if q==-1 and p2==-1:\n ct+=(m-i)\n elif q==-1 and p2!=-1:\n ct+=(p2-i+1)\n elif p2==-1 and q!=-1:\n ct+=(q-i+1)\n else:'''\n ct+=(min(p2,q,m-1)-i+1)\n '''print(ct)\nprint(l)'''\nprint(ct)\n", "# cook your dish here\nx=list(map(int,input().strip().split()))\nn,m,w,b=x[0],x[1],x[2],x[3]\nl=[[0]*m for _ in range(n)]\nfor i in range(4,4+2*w,2):\n l[x[i]-1][x[i+1]-1]=1\nfor i in range(4+2*w,4+2*w+2*b,2):\n l[x[i]-1][x[i+1]-1]=2\nct=0\ndel(x)\nfor x in l:\n p1,p2,q=-1,-1,-1\n for i in range(m-1,-1,-1):\n if x[i]==2:\n q=i\n elif x[i]==1:\n p2=p1\n p1=i\n else:\n if q==-1 and p2==-1:\n ct+=(m-i)\n elif q==-1 and p2!=-1:\n ct+=(p2-i+1)\n elif p2==-1 and q!=-1:\n ct+=(q-i+1)\n else:\n ct+=(min(p2,q)-i+1)\n '''print(ct)\nprint(l)'''\nprint(ct)\n", "def solve(grid,row,col,white):\n s=0\n for thing in grid[row]:\n for i in range(col,len(grid[row])):\n if grid[row][i]=='B':\n s=i-col+1\n return s\n elif grid[row][i]=='W':\n white+=1\n if white==2:\n s=i-col+1\n return s\n if i+1==len(grid[row]):\n s=i-col+1\n return s\n return s\n\narr = [int(x) for x in input().split()]\nn,m,w,b = arr[0],arr[1],arr[2],arr[3]\n\narr = arr[4:]\n\nwh = []\nbl = []\n\ng = [['.' for i in range(m)]for j in range(n)]\n\nfor i in range(0,2*w-1,2):\n g[arr[i]-1][arr[i+1]-1]='W'\nfor i in range(2*w,len(arr)-1,2):\n g[arr[i]-1][arr[i+1]-1]='B'\n\ns=0\nfor i in range(n):\n c=0\n for j in range(m):\n if g[i][j]=='W' or g[i][j]=='B':\n c=0\n continue\n if c==0:\n c=solve(g,i,j,0)\n s+=c\n else:\n c-=1\n s+=c\nprint(s)\n", "def solve(grid,row,col,white):\n s=0\n for thing in grid[row]:\n for i in range(col,len(grid[row])):\n if grid[row][i]=='B':\n s=i-col+1\n return s\n elif grid[row][i]=='W':\n white+=1\n if white==2:\n s=i-col+1\n return s\n if i+1==len(grid[row]):\n s=i-col+1\n return s\n return s\n\n\narray=[int(x) for x in input().split()]\nn,m,w,b=array[0],array[1],array[2],array[3]\narray=array[4:]\nwhite=[]\nblack=[]\ngrid=[['.' for i in range(m)]for j in range(n)]\nfor i in range(0,2*w-1,2):\n grid[array[i]-1][array[i+1]-1]='W'\nfor i in range(2*w,len(array)-1,2):\n grid[array[i]-1][array[i+1]-1]='B'\ns=0\nfor i in range(n):\n current=0\n for j in range(m):\n if grid[i][j]=='W' or grid[i][j]=='B':\n current=0\n continue\n if current==0:\n current=solve(grid,i,j,0)\n s+=current\n else:\n current-=1\n s+=current\nprint(s)\n\n\n\n\n\n\n\n\n", "def solve(grid,row,col,white):\n s=0\n for thing in grid[row]:\n for i in range(col,len(grid[row])):\n if grid[row][i]=='B':\n s=i-col+1\n return s\n elif grid[row][i]=='W':\n white+=1\n if white==2:\n s=i-col+1\n return s\n if i+1==len(grid[row]):\n s=i-col+1\n return s\n return s\n\n\narray=[int(x) for x in input().split()]\nn,m,w,b=array[0],array[1],array[2],array[3]\narray=array[4:]\nwhite=[]\nblack=[]\ngrid=[['.' for i in range(m)]for j in range(n)]\nfor i in range(0,2*w-1,2):\n grid[array[i]-1][array[i+1]-1]='W'\nfor i in range(2*w,len(array)-1,2):\n grid[array[i]-1][array[i+1]-1]='B'\ns=0\nfor i in range(n):\n current=0\n for j in range(m):\n if grid[i][j]=='W' or grid[i][j]=='B':\n current=0\n continue\n if current==0:\n current=solve(grid,i,j,0)\n s+=current\n else:\n current-=1\n s+=current\nprint(s)\n\n\n\n\n\n\n\n\n"] | {"inputs": [["4 4 5 2 1 3 2 1 3 2 3 3 4 3 1 4 2 3"]], "outputs": [["22"]]} | INTERVIEW | PYTHON3 | CODECHEF | 17,019 | |
b03b3c3efff975e7e653ace8a5c0c383 | UNKNOWN | Chef and his friend Miron were getting bored and decided to play a game.
Miron thinks of a sequence of N integers (A1, A2, …., AN) and gives Chef a matrix B, where Bi,j = |Ai - Aj|. He further tells Chef that A1 = 0. The game is for Chef to guess the sequence that Miron thought of.
But Miron is an adversarial player. Every time Chef tries to guess the sequence, he makes a change to the matrix. He makes such a change Q times. Each time, he replaces an entry in some row and the corresponding column with a new one leaving Chef to guess the sequence after each change.
Chef needs a friend to help him against such an adversarial player. Can you be that friend and help Chef find a suitable sequence A for the initial matrix B and also after each change Miron makes?
Note that if several answers exist, then print the lexicographically smallest answer. Further, the numbers in the sequence can be negative.
-----Input-----
The first line contains two space-separated integers N, Q. Each of the N subsequent lines contains N space-separated integers, denoting the matrix B.
Q queries follow. Each query has two lines. The first line of each query contains an integer p, denoting the number of row and column that is changed. The second line of each query contains N space-separated integers F1, F2, F3, ... FN, denoting the new values to the corresponding cells of the matrix (you should make the following assignments Bi,p = Bp,i = Fi for all valid i).
-----Output-----
Print Q + 1 lines which contain N space-separated integers, Miron's initial array and Miron's array after each query.
-----Constraints-----
- 3 ≤ N ≤ 1000
- 1 ≤ Q ≤ 1000
- 0 ≤ Bi,j ≤ 5000
- 1 ≤ p ≤ n
- 0 ≤ Fi ≤ 5000
- it's guaranteed there's always an answer
-----Example-----
Input:
3 2
0 1 2
1 0 1
2 1 0
1
0 4 3
2
4 0 7
Output:
0 -1 -2
0 -4 -3
0 -4 3
-----Explanation-----
Example case 1. Initially, sequence {0, 1, 2} is also suitable, but {0, -1, -2} is lexicografically smaller. | ["def update_B(B, query):\n p, R = query\n for i in range(len(R)):\n B[p][i] = R[i]\n B[i][p] = R[i]\n\ndef get_A(B):\n N = len(B)\n A = [0] * N\n i = 0\n for j in range(N):\n if B[0][j] != 0:\n i = j\n A[i] = -B[0][i]\n break\n\n for j in range(i + 1, N):\n if abs(A[i] - B[0][j]) == B[i][j]:\n A[j] = B[0][j]\n else:\n A[j] = -B[0][j]\n\n return A\n\ndef print_list(A):\n print(' '.join([str(a) for a in get_A(B)]))\n\n\nN, Q = [int(x) for x in input().rstrip().split()]\nB = []\nfor i in range(N):\n B += [[int(x) for x in input().rstrip().split()]]\nqueries = []\nfor i in range(Q):\n p = int(input()) - 1\n arr = input().rstrip().split()\n queries += [(p, [int(x) for x in arr])]\n\nprint_list(get_A(B))\nfor q in queries:\n update_B(B, q)\n print_list(' '.join([str(a) for a in get_A(B)]))\n"] | {"inputs": [["3 2", "0 1 2", "1 0 1", "2 1 0", "1", "0 4 3", "2", "4 0 7"]], "outputs": [["0 -1 -2", "0 -4 -3", "0 -4 3"]]} | INTERVIEW | PYTHON3 | CODECHEF | 814 | |
396bf82a0b3998bfb9fd90f674a20da0 | UNKNOWN | "Say my Name".
Todd Alquist is being taught the process of cooking methamphetamine, but to see whether he's really capable of learning it, Walt gives him a problem to solve. Since he can't solve it, he asks you for help.
You are given a tree with $N$ vertices (numbered $1$ through $N$), rooted at the vertex $1$. There is an integer written at each vertex; for each valid $i$, the value of vertex $i$ is $A$$i$.There also exists a special integer $K$.
Choose any leaf node, denoted by $X$, and go down a simple path from $root$ to $X$.
Let $S$ denote the set of all nodes lying on the simple path from $root$ to $X$.
For all $ i $ $\epsilon $ $ S $, choose an integer $D$ $\epsilon$ $[2^{A[i]-1},2^{A[i]})$.
Informally, for every node $i$ lying on the simple path from $root$ to $X$, you have to choose an integer $D$ such that $2^{A[i]-1}\leq D < 2^{A[i]}$.
You now have to perform one of the two following operations :
- Bitwise XOR of all chosen integers.
- Bitwise AND of all chosen integers.
You have to determine whether you can choose the values in such a way that after performing one of the given operations you can get an integer equal to $K$.
- Note : A leaf is a node of the tree without any child nodes.
Determine if it is possible to obtain the value $K$ by performing the given operations.
-----Input:-----
- First line will contain $T$, number of testcases. Then the testcases follow.
- First line of each testcase contains two space separated integers $N, K$ denoting the number of nodes and the value of the special integer .
- $N-1$ lines follow , each line contains two space separated integers $u,v$ denoting an edge between $u$ and $v$.
- A single line follows containing $N$ space separated integers denoting the value of nodes.
-----Output:-----
For each testcase, output in a single line "YES"(without quotes) or "NO"(without quotes).
-----Constraints-----
- $1 \leq T \leq 10000$
- $2 \leq N \leq 5*10^5$
- $1 \leq K \leq 10^{18}$
- $1 \leq u,v \leq N$
- $ 1\leq A[i] \leq 64$
- Sum of $N$ over all test cases does not exceed 1e6.
-----Sample Input:-----
1
6 85
1 2
2 3
2 4
4 5
3 6
3 5 4 7 1 9
-----Sample Output:-----
YES
-----EXPLANATION:-----
There are two leaf nodes, 5 and 6
considering path from root to 5
we have nodes
1->2->4->5
we can select the values
5,26,75,1 and perform operation 1 that is XOR of all numbers to get 85 | ["# cook your dish here\nimport sys,collections\ninput=sys.stdin.readline\ndef main():\n T=int(input())\n for _ in range(T):\n N,K=map(int,input().split())\n Tree={}\n for j in range(N):\n Tree[j]=[]\n \n for i in range(N-1):\n u,v=map(int,input().split())\n Tree[u-1].append(v-1)\n Tree[v-1].append(u-1)\n \n A=list(map(int,input().split()))\n \n vis=[0 for i in range(N)] #to mark visited vertices 0 for visited and \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a01 for not visited\n maxval=[[0,0] for i in range(N)] #Nx2 list where each i stores max \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0value till now and its count \n minval=[0 for i in range(N)] #Nx2 list where each i stores min value \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0till now \n lfnode=[] #list to store leaf nodes\n \n #Appending node 1\n vis[0]=1\n Q=collections.deque([0])\n maxval[0][0],maxval[0][1]=A[0],1\n minval[0]=A[0]\n \n \n while(len(Q)!=0):\n a=Q.pop()\n mv1=maxval[a][0]\n mv2=minval[a]\n \n flag=0 #to check leaf node\n \n for i in Tree[a]:\n if (vis[i]==0):\n vis[i]=1\n flag=1 #not a leaf node\n v=A[i]\n Q.append(i)\n \n #Comparing maximum value of parent node\n if (mv1<v):\n maxval[i][0],maxval[i][1]=v,1\n \n elif(mv1==v):\n maxval[i][0],maxval[i][1]=mv1,maxval[a][1]+1\n \n else:\n maxval[i][0],maxval[i][1]=maxval[a][0],maxval[a][1]\n \n \n #Comparing minimum value of parent node\n if (mv2>v):\n minval[i]=v\n elif(v==mv2):\n minval[i]=mv2\n else:\n minval[i]=minval[a]\n \n \n if (flag==0):\n lfnode.append(a)\n \n \n flag=0 #For answer if 0 then NO else YES\n \n K1=len(bin(K))-2 #length of K\n \n #print(lfnode,val)\n for i in lfnode:\n v1,v2=maxval[i][0],maxval[i][1]\n \n if (v1>K1 and v2%2==0):\n flag=1\n elif(v1==K1 and v2%2==1):\n flag=1\n \n \n v11=minval[i]\n if (v11>K1 and v11!=v1):\n flag=1\n elif(v11==K1):\n flag=1\n \n \n if(flag==1):\n break\n \n if (flag==1):\n print(\"YES\")\n else:\n print(\"NO\")\nmain()", "# cook your dish here\nimport sys,collections\ninput=sys.stdin.readline\ndef main():\n T=int(input())\n for _ in range(T):\n N,K=map(int,input().split())\n Tree={}\n for j in range(N):\n Tree[j]=[]\n \n for i in range(N-1):\n u,v=map(int,input().split())\n Tree[u-1].append(v-1)\n Tree[v-1].append(u-1)\n \n A=list(map(int,input().split()))\n \n vis=[0 for i in range(N)] #to mark visited vertices 0 for visited and \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a01 for not visited\n maxval=[[0,0] for i in range(N)] #Nx2 list where each i stores max \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0value till now and its count \n minval=[0 for i in range(N)] #Nx2 list where each i stores min value \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0till now \n lfnode=[] #list to store leaf nodes\n \n #Appending node 1\n vis[0]=1\n Q=collections.deque([0])\n maxval[0][0],maxval[0][1]=A[0],1\n minval[0]=A[0]\n \n \n while(len(Q)!=0):\n a=Q.pop()\n mv1=maxval[a][0]\n mv2=minval[a]\n \n flag=0 #to check leaf node\n \n for i in Tree[a]:\n if (vis[i]==0):\n vis[i]=1\n flag=1 #not a leaf node\n v=A[i]\n Q.append(i)\n \n #Comparing maximum value of parent node\n if (mv1<v):\n maxval[i][0],maxval[i][1]=v,1\n \n elif(mv1==v):\n maxval[i][0],maxval[i][1]=mv1,maxval[a][1]+1\n \n else:\n maxval[i][0],maxval[i][1]=maxval[a][0],maxval[a][1]\n \n \n #Comparing minimum value of parent node\n if (mv2>v):\n minval[i]=v\n elif(v==mv2):\n minval[i]=mv2\n else:\n minval[i]=minval[a]\n \n \n if (flag==0):\n lfnode.append(a)\n \n \n flag=0 #For answer if 0 then NO else YES\n \n K1=len(bin(K))-2 #length of K\n \n #print(lfnode,val)\n for i in lfnode:\n v1,v2=maxval[i][0],maxval[i][1]\n \n if (v1>K1 and v2%2==0):\n flag=1\n elif(v1==K1 and v2%2==1):\n flag=1\n \n \n v11=minval[i]\n if (v11>K1 and v11!=v1):\n flag=1\n elif(v11==K1):\n flag=1\n \n \n if(flag==1):\n break\n \n if (flag==1):\n print(\"YES\")\n else:\n print(\"NO\")\nmain()", "import sys,collections\ninput=sys.stdin.readline\ndef main():\n T=int(input())\n for _ in range(T):\n N,K=map(int,input().split())\n Tree={}\n for j in range(N):\n Tree[j]=[]\n \n for i in range(N-1):\n u,v=map(int,input().split())\n Tree[u-1].append(v-1)\n Tree[v-1].append(u-1)\n \n A=list(map(int,input().split()))\n \n vis=[0 for i in range(N)] #to mark visited vertices 0 for visited and \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a01 for not visited\n maxval=[[0,0] for i in range(N)] #Nx2 list where each i stores max \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0value till now and its count \n minval=[0 for i in range(N)] #Nx2 list where each i stores min value \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0till now \n lfnode=[] #list to store leaf nodes\n \n #Appending node 1\n vis[0]=1\n Q=collections.deque([0])\n maxval[0][0],maxval[0][1]=A[0],1\n minval[0]=A[0]\n \n \n while(len(Q)!=0):\n a=Q.pop()\n mv1=maxval[a][0]\n mv2=minval[a]\n \n flag=0 #to check leaf node\n \n for i in Tree[a]:\n if (vis[i]==0):\n vis[i]=1\n flag=1 #not a leaf node\n v=A[i]\n Q.append(i)\n \n #Comparing maximum value of parent node\n if (mv1<v):\n maxval[i][0],maxval[i][1]=v,1\n \n elif(mv1==v):\n maxval[i][0],maxval[i][1]=mv1,maxval[a][1]+1\n \n else:\n maxval[i][0],maxval[i][1]=maxval[a][0],maxval[a][1]\n \n \n #Comparing minimum value of parent node\n if (mv2>v):\n minval[i]=v\n elif(v==mv2):\n minval[i]=mv2\n else:\n minval[i]=minval[a]\n \n \n if (flag==0):\n lfnode.append(a)\n \n \n flag=0 #For answer if 0 then NO else YES\n \n K1=len(bin(K))-2 #length of K\n \n #print(lfnode,val)\n for i in lfnode:\n v1,v2=maxval[i][0],maxval[i][1]\n \n if (v1>K1 and v2%2==0):\n flag=1\n elif(v1==K1 and v2%2==1):\n flag=1\n \n \n v11=minval[i]\n if (v11>K1 and v11!=v1):\n flag=1\n elif(v11==K1):\n flag=1\n \n \n if(flag==1):\n break\n \n if (flag==1):\n print(\"YES\")\n else:\n print(\"NO\")\nmain()", "import sys,collections\ninput = sys.stdin.readline \n\ndef solve():\n T = int(input())\n for _ in range(T):\n N,K = list(map(int,input().split()))\n \n Tree = {}\n for j in range(N):\n Tree[j] = []\n \n for i in range(N-1):\n u,v = list(map(int, input().split()))\n Tree[u-1].append(v-1)\n Tree[v-1].append(u-1)\n \n A = list(map(int, input().split()))\n \n vis = [0 for i in range(N)]\n maxval = [[0,0] for i in range(N)]\n minval = [0 for i in range(N)]\n lfnode = []\n \n vis[0]=1\n Q=collections.deque([0])\n maxval[0][0],maxval[0][1]=A[0],1\n minval[0]=A[0]\n \n \n while(len(Q)!=0):\n a=Q.pop()\n mv1=maxval[a][0]\n mv2=minval[a]\n \n flag=0 #to check leaf node\n \n for i in Tree[a]:\n if (vis[i]==0):\n vis[i]=1\n flag=1 \n v=A[i]\n Q.append(i)\n \n \n if (mv1<v):\n maxval[i][0],maxval[i][1]=v,1\n \n elif(mv1==v):\n maxval[i][0],maxval[i][1]=mv1,maxval[a][1]+1\n \n else:\n maxval[i][0],maxval[i][1]=maxval[a][0],maxval[a][1]\n \n \n \n if (mv2>v):\n minval[i]=v\n elif(v==mv2):\n minval[i]=mv2\n else:\n minval[i]=minval[a]\n \n \n if (flag==0):\n lfnode.append(a)\n \n \n flag=0 \n \n K1=len(bin(K))-2 \n \n #print(lfnode,val)\n for i in lfnode:\n v1,v2=maxval[i][0],maxval[i][1]\n \n if (v1>K1 and v2%2==0):\n flag=1\n elif(v1==K1 and v2%2==1):\n flag=1\n \n \n v11=minval[i]\n if (v11>K1 and v11!=v1):\n flag=1\n elif(v11==K1):\n flag=1\n \n \n if(flag==1):\n break\n \n if (flag==1):\n print(\"YES\")\n else:\n print(\"NO\")\n \n \nsolve() \n", "import sys,collections\ninput = sys.stdin.readline \n\ndef solve():\n T = int(input())\n for _ in range(T):\n N,K = list(map(int,input().split()))\n \n Tree = {}\n for j in range(N):\n Tree[j] = []\n \n for i in range(N-1):\n u,v = list(map(int, input().split()))\n Tree[u-1].append(v-1)\n Tree[v-1].append(u-1)\n \n A = list(map(int, input().split()))\n \n vis = [0 for i in range(N)]\n maxval = [[0,0] for i in range(N)]\n minval = [0 for i in range(N)]\n lfnode = []\n \n vis[0]=1\n Q=collections.deque([0])\n maxval[0][0],maxval[0][1]=A[0],1\n minval[0]=A[0]\n \n \n while(len(Q)!=0):\n a=Q.pop()\n mv1=maxval[a][0]\n mv2=minval[a]\n \n flag=0 #to check leaf node\n \n for i in Tree[a]:\n if (vis[i]==0):\n vis[i]=1\n flag=1 \n v=A[i]\n Q.append(i)\n \n \n if (mv1<v):\n maxval[i][0],maxval[i][1]=v,1\n \n elif(mv1==v):\n maxval[i][0],maxval[i][1]=mv1,maxval[a][1]+1\n \n else:\n maxval[i][0],maxval[i][1]=maxval[a][0],maxval[a][1]\n \n \n \n if (mv2>v):\n minval[i]=v\n elif(v==mv2):\n minval[i]=mv2\n else:\n minval[i]=minval[a]\n \n \n if (flag==0):\n lfnode.append(a)\n \n \n flag=0 \n \n K1=len(bin(K))-2 \n \n #print(lfnode,val)\n for i in lfnode:\n v1,v2=maxval[i][0],maxval[i][1]\n \n if (v1>K1 and v2%2==0):\n flag=1\n elif(v1==K1 and v2%2==1):\n flag=1\n \n \n v11=minval[i]\n if (v11>K1 and v11!=v1):\n flag=1\n elif(v11==K1):\n flag=1\n \n \n if(flag==1):\n break\n \n if (flag==1):\n print(\"YES\")\n else:\n print(\"NO\")\n \n \nsolve() \n", "import sys,collections\ninput=sys.stdin.readline\ndef main1():\n T=int(input())\n for _ in range(T):\n N,K=map(int,input().split())\n Tree={} \n for j in range(N):\n Tree[j]=[]\n \n for i in range(N-1):\n u,v=map(int,input().split())\n Tree[u-1].append(v-1)\n Tree[v-1].append(u-1)\n \n A=list(map(int,input().split()))\n \n vis=[0 for i in range(N)] \n maxval=[[0,0] for i in range(N)] \n minval=[0 for i in range(N)] \n lfnode=[] \n \n #Appending node 1\n vis[0]=1\n Q=collections.deque([0])\n maxval[0][0],maxval[0][1]=A[0],1\n minval[0]=A[0]\n \n \n while(len(Q)!=0):\n a=Q.pop()\n mv1=maxval[a][0]\n mv2=minval[a]\n \n flag=0 #to check leaf node\n \n for i in Tree[a]:\n if (vis[i]==0):\n vis[i]=1\n flag=1 \n v=A[i]\n Q.append(i)\n \n \n if (mv1<v):\n maxval[i][0],maxval[i][1]=v,1\n \n elif(mv1==v):\n maxval[i][0],maxval[i][1]=mv1,maxval[a][1]+1\n \n else:\n maxval[i][0],maxval[i][1]=maxval[a][0],maxval[a][1]\n \n \n \n if (mv2>v):\n minval[i]=v\n elif(v==mv2):\n minval[i]=mv2\n else:\n minval[i]=minval[a]\n \n \n if (flag==0):\n lfnode.append(a)\n \n \n flag=0 \n \n K1=len(bin(K))-2 \n \n #print(lfnode,val)\n for i in lfnode:\n v1,v2=maxval[i][0],maxval[i][1]\n \n if (v1>K1 and v2%2==0):\n flag=1\n elif(v1==K1 and v2%2==1):\n flag=1\n \n \n v11=minval[i]\n if (v11>K1 and v11!=v1):\n flag=1\n elif(v11==K1):\n flag=1\n \n \n if(flag==1):\n break\n \n if (flag==1):\n print(\"YES\")\n else:\n print(\"NO\")\n \n \nmain1() "] | {"inputs": [["1", "6 85", "1 2", "2 3", "2 4", "4 5", "3 6", "3 5 4 7 1 9"]], "outputs": [["YES"]]} | INTERVIEW | PYTHON3 | CODECHEF | 11,516 | |
c55680a7477eed26f2a0799849f6367b | UNKNOWN | In the year 4242, the language Haskell has evolved so much that it has become an AI. It can solve very challenging problems, in very little time. Humanity is worried that Haskell will take over the world. All hopes remain tied to the Competitive Programming community as they are the expert in shaving milliseconds off code runtime. Haskell creators have found one particular task that if solved faster than Haskell itself, can be used to hack into Haskell's codebase and thus defeat it. The exact details of the task are as follows,
" Calculate the sum, S(N, K) = , for Q queries. Here Fi is ith Fibonacci number defined as: Fi = i if i = 0 or 1 and Fi = Fi-1 + Fi-2 if i >= 2. "
You being a member of the Competitive Programming community are encouraged to make a submission to this task.
-----Input-----
The first line contains a single integer Q, the number of queries.
Each of the next Q lines contain two integers each, Ni and Ki.
-----Output-----
Output Q lines with one integer each. The ith line should contain the value S(Ni, Ki).
-----Constraints-----
- 1 <= Q <= 5*104
- 1 <= N <= 1018
- 1 <= K <= 1018
-----Example-----
Input:
1
1 1
Output:
1 | ["mod=10**9+7\ndef fibonacci(n):\n if n < 0:\n raise ValueError(\"Negative arguments not implemented\")\n return (_fib(n)[0]%mod + mod)%mod;\ndef _fib(n):\n if n == 0:\n return (0, 1)\n else:\n a, b = _fib(n // 2)\n c = (a * (b * 2 - a))%mod\n d = (a * a + b * b)%mod\n if n % 2 == 0:\n return (c, d)\n else:\n return (d, c + d)\ndef inv(n):\n return pow(n,mod-2,mod)\ndef brute(n,k):\n ret = 0\n for i in range(0,n+1):\n ret+=fibonacci(i)*pow(k,i,mod)\n return ret%mod\ndef ans(n,k):\n k%=mod\n a = pow(k,n+1,mod)\n b=(a*k)%mod\n x = a*(fibonacci(n+1))+b*fibonacci(n)-k\n y = inv((k*k+k-1)%mod)\n return ((x*y)%mod+mod)%mod\nfor t in range(0,eval(input())):\n n,k = list(map(int,input().split()))\n print(ans(n,k))"] | {"inputs": [["1", "1 1"]], "outputs": [["1"]]} | INTERVIEW | PYTHON3 | CODECHEF | 729 | |
0e3f5ac50abe9aed4bd87bfa2a066aa5 | UNKNOWN | In Byteland there are N cities, numbered 1 through N. Some pairs of cities are connected by bi-directional roads in such a way that starting from any one city you can visit all other cities either directly or indirectly.
Chef is currently at city A and wants to visit all other cities in Byteland. Chef can only move according to following rule.
If Chef is at city A then he continues to move from city A to city B, city B to city C (provided A is directly connected to B, B is directly connected to C) and so on unless there are no more cities leading from current city.
If so he jumps back to previous city and repeat the same tour with other cities leading from it which are not visited. Chef repeat this step unless all cities are not visited.
Help Chef to count number of ways in which he can visit all other cities . As this number can be large print it modulo 109+7
-----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 cities in Byteland.
- Next N-1 lines contain two space-separated integers u and v denoting there is bi-directional road between city numbered u and v.
- Next line contains a single integer A denoting the city number where Chef is present.
-----Output-----
- For each test case, output a single line containing number of ways in which Chef can visit all cities modulo 109+7.
-----Constraints-----
- 1 ≤ T ≤ 5
- 1 ≤ N ≤ 105
- 1 ≤ A ≤ N
-----Subtasks-----
Subtask #1 : (10 points)
- 1 ≤ N ≤ 5
Subtask #2 : (30 points)
- 1 ≤ N ≤ 100
Subtask #3 : (60 points)
- 1 ≤ N ≤ 105
-----Example-----
Input:
2
3
1 2
1 3
1
5
1 2
1 3
2 4
2 5
1
Output:
2
4
-----Explanation-----
Example case 1. Chef can visit cities in two ways according to the problem: 1-2-3 and 1-3-2
Example case 1. Chef can visit cities in four ways according to the problem:
1-2-4-5-3
1-2-5-4-3
1-3-2-4-5
1-3-2-5-4 | ["import sys\nsys.setrecursionlimit(10**8)\n\nMOD = 10**9+7\n\nfac = [0]*(10**5+1)\ndef pre() :\n fac[0] = 1\n for i in range(1,10**5+1) :\n fac[i] = fac[i-1]*i\n fac[i] = fac[i]%MOD\n\ndef dfs(gp , vertex , visited , deg , ans) :\n visited[vertex] = 1\n stack = []\n stack.append(vertex)\n while len(stack)>0 :\n vertex = stack.pop()\n ans = ans%MOD * fac[deg[vertex]]%MOD\n ans %= MOD\n for i in gp[vertex] :\n if not visited[i] :\n visited[i] = 1\n if vertex in gp[i] :\n deg[i] -= 1\n stack.append(i)\n return ans%MOD\n\npre()\nfor __ in range(eval(input())) :\n n = eval(input())\n deg = [0]*(n+1)\n st = [[] for __ in range(n+1)]\n for _ in range(n-1) :\n a , b = list(map(int,sys.stdin.readline().split()))\n st[a].append(b)\n st[b].append(a)\n deg[a] += 1\n deg[b] += 1\n k = eval(input())\n visited = [0]*(n+1)\n print(dfs(st ,k,visited,deg , 1)%MOD)\n \n", "import sys\nsys.setrecursionlimit(10**8)\n\nMOD = 10**9+7\n\nfac = [0]*(10**5+1)\ndef pre() :\n fac[0] = 1\n for i in range(1,10**5+1) :\n fac[i] = fac[i-1]*i\n fac[i] = fac[i]%MOD\n\ndef dfs(gp , vertex , visited , deg , ans) :\n visited[vertex] = 1\n stack = []\n stack.append(vertex)\n while len(stack)>0 :\n vertex = stack.pop()\n ans = ans%MOD * fac[deg[vertex]]%MOD\n ans %= MOD\n for i in gp[vertex] :\n if not visited[i] :\n visited[i] = 1\n if vertex in gp[i] :\n deg[i] -= 1\n stack.append(i)\n return ans%MOD\n\npre()\nfor __ in range(eval(input())) :\n n = eval(input())\n deg = [0]*(n+1)\n st = [[]]*(n+1)\n for _ in range(n-1) :\n a , b = list(map(int,sys.stdin.readline().split()))\n st[a].append(b)\n st[b].append(a)\n deg[a] += 1\n deg[b] += 1\n k = eval(input())\n ans = 1\n visited = [0]*(n+1)\n print(dfs(st ,k,visited,deg , 1)%MOD)\n \n", "import sys\nsys.setrecursionlimit(10**9+7)\n\nMOD = 10**9+7\n\nfac = [0]*(10**5+1)\ndef pre() :\n fac[0] = 1\n for i in range(1,10**5+1) :\n fac[i] = fac[i-1]*i\n fac[i] = fac[i]%MOD\n\ndef dfs(gp , vertex , visited , deg , ans) :\n visited[vertex] = 1\n ans = ans%MOD * fac[deg[vertex]]%MOD\n ans %= MOD\n for i in gp[vertex] :\n if not visited[i] :\n if vertex in gp[i] :\n deg[i] -= 1\n return dfs (gp , i , visited , deg , ans)\n return ans%MOD\n\npre()\nfor __ in range(eval(input())) :\n n = eval(input())\n deg = [0]*(n+1)\n st = [[]]*(n+1)\n for _ in range(n-1) :\n a , b = list(map(int,sys.stdin.readline().split()))\n st[a].append(b)\n st[b].append(a)\n deg[a] += 1\n deg[b] += 1\n k = eval(input())\n ans = 1\n visited = [0]*(n+1)\n print(dfs(st ,k,visited,deg , 1)%MOD)\n \n", "import sys\n\nMOD = 10**9+7\n\nfac = [0]*(10**5+1)\ndef pre() :\n fac[0] = 1\n for i in range(1,10**5+1) :\n fac[i] = fac[i-1]*i\n fac[i] = fac[i]%MOD\n\ndef dfs(gp , vertex , visited , deg , ans) :\n visited[vertex] = 1\n ans = ans * fac[deg[vertex]]\n ans %= MOD\n for i in gp[vertex] :\n if not visited[i] :\n if vertex in gp[i] :\n deg[i] -= 1\n return dfs (gp , i , visited , deg , ans)\n return ans%MOD\n\npre()\nfor __ in range(eval(input())) :\n n = eval(input())\n deg = [0]*(n+1)\n st = [[]]*(n+1)\n for _ in range(n-1) :\n a , b = list(map(int,sys.stdin.readline().split()))\n st[a].append(b)\n st[b].append(a)\n deg[a] += 1\n deg[b] += 1\n k = eval(input())\n ans = 1\n visited = [0]*(n+1)\n print(dfs(st ,k,visited,deg , 1)%MOD)\n \n", "import sys\n\nMOD = 10**9+7\n\nfac = [0]*(10**5+1)\ndef pre() :\n fac[0] = 1\n for i in range(1,10**5+1) :\n fac[i] = fac[i-1]*i\n fac[i] = fac[i]%MOD\n\ndef dfs(gp , vertex , visited , deg , ans) :\n visited[vertex] = 1\n ans = ans * fac[deg[vertex]]\n ans %= MOD\n for i in gp[vertex] :\n if not visited[i] :\n if vertex in gp[i] :\n deg[i] -= 1\n return dfs (gp , i , visited , deg , ans)\n return ans%MOD\n\npre()\nfor __ in range(eval(input())) :\n n = eval(input())\n deg = [0]*(n+1)\n st = [[]]*(10**5+1)\n for _ in range(n-1) :\n a , b = list(map(int,sys.stdin.readline().split()))\n st[a].append(b)\n st[b].append(a)\n deg[a] += 1\n deg[b] += 1\n k = eval(input())\n ans = 1\n visited = [0]*(n+1)\n print(dfs(st ,k,visited,deg , 1)%MOD)\n \n", "import queue, fractions\nclass Node:\n def __init__(self, i):\n self.val = i\n self.children = []\nmod = 10**9+7\nfor t in range(int(input())):\n n = int(input())\n d = []\n for i in range(n+1):\n d.append(Node(i))\n edges = []\n for i in range(n-1):\n a, b = list(map(int, input().split()))\n d[a].children.append(b)\n d[b].children.append(a)\n root = int(input())\n l = len(d[root].children)\n ans = 1\n while (l>0):\n ans*=l\n ans%=mod\n l-=1\n \n for i in d[root].children :\n count = 0\n # get leaf nodes\n q = queue.Queue()\n q.put((i, root))\n while (not q.empty()):\n #print \"size \",q.qsize()\n n, p = q.get()\n #print n,p, \"- pop\"\n flag = 1\n for c in (d[n].children):\n if (c!=p):\n q.put((c,n))\n flag = 0\n if (flag == 1):\n count+=1\n #print count\n ans *= count\n ans %= mod\n print(ans)\n #print \"*****\"\n"] | {"inputs": [["2", "3", "1 2", "1 3", "1", "5", "1 2", "1 3", "2 4", "2 5", "1"]], "outputs": [["2", "4"]]} | INTERVIEW | PYTHON3 | CODECHEF | 4,997 | |
f644e48f31f85568e511b60446551618 | UNKNOWN | Chef has just started Programming, he is in first year of Engineering. Chef is reading about Relational Operators.
Relational Operators are operators which check relatioship between two values. Given two numerical values A and B you need to help chef in finding the relationship between them that is,
- First one is greater than second or,
- First one is less than second or,
- First and second one are equal.
-----Input-----
First line contains an integer T, which denotes the number of testcases. Each of the T lines contain two integers A and B.
-----Output-----
For each line of input produce one line of output. This line contains any one of the relational operators
'<' , '>' , '='.
-----Constraints-----
- 1 ≤ T ≤ 10000
- 1 ≤ A, B ≤ 1000000001
-----Example-----
Input:
3
10 20
20 10
10 10
Output:
<
>
=
-----Explanation-----
Example case 1. In this example 1 as 10 is lesser than 20. | ["# cook your dish here\nfor _ in range(int(input())):\n x, y= map(int, input().split())\n if x<y:\n print('<')\n elif x>y:\n print('>')\n else:\n print('=')", "t=int(input())\nfor i in range(t):\n a,b=list(map(int,input().split()))\n if a>b:\n print(\">\")\n elif b>a:\n print(\"<\")\n else:\n print(\"=\")\n", "n=int(input())\nfor i in range(n):\n a,b=list(map(int,input().split()))\n if a<b:\n print(\"<\")\n elif a>b:\n print(\">\")\n else:\n print(\"=\")\n", "n = int(input())\nfor i in range(n):\n x,y = map(int,input().split())\n if x > y:\n print(\">\")\n elif x < y:\n print(\"<\")\n elif x == y:\n print(\"=\")", "# cook your dish here\nn = int(input())\nwhile n>0:\n x,y = map(int,input().strip().split())\n if x<y:\n print(\"<\")\n elif x>y:\n print(\">\")\n else:\n print(\"=\")\n n = n-1", "for _ in range (int(input())):\n a,b = map(int,input().split())\n if(a>b):\n print(\">\")\n elif(a<b):\n print(\"<\")\n else:\n print(\"=\")", "# cook your dish here\nt=int(input())\nfor i in range(t):\n a,b=map(int,input().split())\n if(a>b):\n print('>')\n elif(a<b):\n print('<')\n else:\n print('=')", "# cook your dish here\ntry:\n t=int(input())\n for i in range(0,t):\n a,b=map(int,input().split())\n if(a>b):\n print('>')\n elif(a<b):\n print('<')\n else:\n print('=')\nexcept:pass", "for _ in range(int(input())):\r\n z = list(map(int,input().split()))\r\n if z[0]==z[1]:\r\n print(\"=\")\r\n elif z[0]>z[1]:\r\n print(\">\")\r\n else:\r\n print(\"<\")\r\n", "# cook your dish here\nfor t in range(int(input())):\n x,y=map(int,input().split())\n if x==y:print(\"=\")\n else:\n a=\">\" if x>y else \"<\"\n print(a)", "# cook your dish here\nx=int(input())\nfor i in range(x):\n (a, b) = map(int, input().split(' '))\n if(a>b):\n print(\">\")\n if(a<b):\n print(\"<\")\n if(a==b):\n print(\"=\") ", "# cook your dish here\nT=int(input())\nfor i in range(T):\n m,n=list(map(int,input().split()))\n if m<n:\n print(\"<\")\n elif m>n:\n print(\">\")\n else:\n print(\"=\")\n", "# cook your dish here\nt = int(input())\nfor i in range(t):\n a, b = map(int, input().split())\n if(a < b):\n print(\"<\")\n elif(a > b):\n print(\">\")\n else:\n print(\"=\")", "for t in range(int(input())):\n x,y=map(int,input().split())\n if x==y:print(\"=\")\n else:\n a=\">\" if x>y else \"<\"\n print(a)", "# cook your dish here\nn=int(input())\nfor i in range(n):\n x,y=map(int,input().split())\n if x==y:print(\"=\")\n else:\n a=\">\" if x>y else \"<\"\n print(a)", "# cook your dish here\nfor _ in range(int(input())):\n a,b=map(int,input().split(' '))\n if(a>b):\n print('>')\n elif(a<b):\n print('<')\n elif(a==b):\n print('=')", "t=int(input())\nfor i in range(t):\n (a,b)=list(map(int,input().split(\" \")))\n if a>b:\n print(\">\")\n elif a<b:\n print(\"<\")\n else:\n print(\"=\")\n", "# cook your dish here\nt=int(input())\nfor i in range(0,t):\n a,b=(input().split())\n a=int(a)\n b=int(b)\n if(a>b):\n print(\">\")\n elif(a<b):\n print(\"<\")\n elif(a==b):\n print(\"=\")", "# cook your dish here\nt=int(input())\nwhile t!=0:\n a,b=map(int,input().split())\n if a<b:\n print(\"<\")\n elif a>b:\n print(\">\")\n else:\n print(\"=\")\n t-=1", "t = int(input())\nwhile t:\n a,b = map(int,input().split())\n if (a > b):\n print(\">\")\n elif (a == b):\n print(\"=\")\n else:\n print(\"<\")\n t=t-1", "t=int(input())\r\ni=0\r\nwhile i<t:\r\n\ta,b=input().split()\r\n\ta=int(a)\r\n\tb=int(b)\r\n\tif a==b:\r\n\t\tprint(\"=\")\r\n\telif a>b:\r\n\t\tprint(\">\")\r\n\telse:\r\n\t\tprint(\"<\")\r\n\ti+=1", "# cook your dish here\nfor i in range(int(input())):\n a,b=map(int,input().split())\n if a>b:\n print(\">\")\n elif a<b:\n print(\"<\")\n else:\n print(\"=\")", "N=int(input())\n\nfor i in range(N):\n a,b=list(map(int,input().split()))\n if(a<b):\n print('<')\n elif(a>b):\n print('>')\n else:\n print('=')\n", "t=int(input())\nfor k in range(t):\n line=input().split()\n a=int(line[0])\n b=int(line[1])\n if a<b:\n print(\"<\")\n elif a>b:\n print(\">\")\n else:\n print(\"=\")", "n = int(input())\r\nli = []\r\nfor i in range(n):\r\n a = input().split(\" \")\r\n l = []\r\n for i in a:\r\n l.append(int(i))\r\n a,b=l[0],l[1]\r\n if a < b:\r\n li.append(\"<\")\r\n elif a > b:\r\n li.append(\">\")\r\n else:\r\n li.append(\"=\")\r\nfor i in li:\r\n print(i)"] | {"inputs": [["3", "10 20", "20 10", "10 10"]], "outputs": [["<", ">", "="]]} | INTERVIEW | PYTHON3 | CODECHEF | 5,103 | |
4859347f68d0cc2455d9e0d2b2dcaa40 | UNKNOWN | Batman is about to face Superman so he decides to prepare for the battle by upgrading his Batmobile. He manufactures multiple duplicates of his standard Batmobile each tweaked in a different way such that the maximum speed of each is never less than that of the standard model.
After carrying out this process, he wishes to know how many of his prototypes are faster than his standard Batmobile?
-----Input-----
- The first line of the input contains an integer T denoting the number of test cases. The description of T test cases follow:
- The first line of each test case contains a single integer N denoting the number of copies of the standard Batmobile.
- The second line contains a sequence of N+1 space-separated integers, S0 to SN, sorted in non-decreasing order separated by space. S0 is the maximum speed of the standard Batmobile. S1 to SN denote the maximum speeds of the prototypes.
-----Output-----
- For each test case, output a single line containing an integer denoting the answer.
-----Constraints-----
- 1 ≤ T ≤ 1000
- 1 ≤ N ≤ 1000
- 1 ≤ Si ≤ 109
-----Example-----
Input:
2
4
1 2 3 4 5
5
1 10 100 1000 10000 100000
Output:
4
5 | ["t = int(input())\nwhile(t):\n n = int(input())\n ar = list(map(int,input().strip().split(\" \")))\n print(len([x for x in ar[1:len(ar)] if ar[0]<x]))\n t-=1\n", "t=eval(input())\nwhile t>0:\n n=eval(input())\n input_arr=input().split(' ')\n counter=0\n for i in range(1,n+1):\n if(int(input_arr[0])<int(input_arr[i])):\n counter+=1\n print(counter)\n t-=1\n", "# your code goes here raw_input()\n#This is basic python file\n#print \"Hello Vedhika Fan!!!\"\n# except EOFError: break\n#sys.stdin.readline().split()\n#arr = map(int,raw_input().strip().split(' '))\n\nt = int(input())\nfor d in range(t):\n n = int(input())\n n+=1\n ans = 0\n arr = list(map(int,input().split()))\n index = 1\n while(index<n):\n if(arr[index]>arr[index-1]):\n ans = index\n break\n index+=1\n if(ans!=0):\n print(n-ans)\n else:\n print(0)", "# cook your code here\ntest_cases=int(input())\nfor case in range(test_cases):\n copies=int(input())\n line=input().split()\n speeds=[int(s_car) for s_car in line]\n count=0\n for loop in range(1,copies+1):\n if (speeds[loop]>speeds[0]):\n count=count+1\n print(count)", "# cook your code here\ntest_cases=int(input())\nfor case in range(test_cases):\n copies=int(input())\n line=input().split()\n speeds=[int(s_car) for s_car in line]\n count=0\n for loop in range(1,copies+1):\n if (speeds[loop]>speeds[0]):\n count=count+1\n print(count)", "for i in range(eval(input())):\n n=eval(input())\n c=0\n l=list(map(int, input().split()))\n for j in range(1,n+1):\n if l[0]<l[j]:c+=1\n print(c)", "for z in range(eval(input())):\n n=eval(input())\n arr=list(map(int,input().split()))\n c=0\n i=1\n s=arr[0]\n while i<=n:\n if arr[i]>s:c+=1\n i+=1\n print(c)\n", "T=int(input())\nfor i in range(0,T):\n N=int(input())\n a=input().split()\n re=0\n for i in range(1,len(a)):\n if int(a[i])>int(a[0]):\n re+=1\n print(re)\n", "t=int(input().strip())\nfor j in range(t):\n n=int(input().strip())\n arr=list(map(int,input().strip().split()))\n x=1\n while x<n+1:#for x in range(1,n+1):\n if arr[x]>arr[0]:\n #i=x\n break\n x=x+1\n if x==n+1:\n print(0)\n else:\n print(n-x+1)", "t=int(input().strip())\nfor j in range(t):\n n=int(input().strip())\n arr=list(map(int,input().strip().split()))\n x=1\n while x<n+1:#for x in range(1,n+1):\n if arr[x]>arr[0]:\n #i=x\n break\n x=x+1\n if x==n+1:\n print(0)\n else:\n print(n-x+1)", "for _ in range(eval(input())):\n n=eval(input())\n a=list(map(int,input().split()))\n c=0\n for i in range(1,n+1):\n if a[0]<a[i]:\n c+=1\n print(c) ", "for i in range(eval(input())):\n n = eval(input())\n l = list(map(int, input().split()))\n b = l[0]\n c = [x for x in l[1:] if x>b]\n print(len(c))", "for t in range(int(input())):\n n = int(input())\n a = list(map(int, input().split()))\n for i in range(1,n+1):\n if (a[i]>a[0]):\n break\n if (a[0]==a[n]):\n print(0)\n else:\n print(n - i + 1)", "n = int(input())\nwhile(n!=0):\n k = int(input())\n l = list(map(int,input().split(' ')))\n k = l[0]\n c = 0\n for i in l:\n if i>k:\n c+=1\n print(c)\n n-=1", "for L_I in range(eval(input())):\n num=eval(input())\n ok=0\n a=list(map(int,input().split()))\n for I_I in range(1,len(a)):\n if a[0]==a[I_I]:\n ok=ok+1\n print(num-ok)\n", "for I_I in range(eval(input())):\n n=eval(input())\n count=0\n a=list(map(int,input().split()))\n for ii in range(1,len(a)):\n if a[ii]==a[0]:\n count=count+1\n print(n-count)\n", "for _ in range(eval(input())):\n noc = eval(input())\n power = list(map(int, input().split()))\n spower = power[0]\n ppowers= power[1:]\n ans = sum([1 for x in ppowers if x > spower])\n print(ans)", "t=eval(input())\nfor i in range(0, t):\n count=0\n copies=eval(input())\n \n bats = [int(x) for x in input().split(\" \")]\n standard=bats[0]\n for i in range(1, len(bats)):\n if(bats[i]>standard):\n count=count+1\n \n print(count)\n", "for i in range(0,int(input())):\n n,m=int(input()),list(map(int,input().split()))\n print(sum([1 for i in m if i > m[0]]))"] | {"inputs": [["2", "4", "1 2 3 4 5", "5", "1 10 100 1000 10000 100000"]], "outputs": [["4", "5"]]} | INTERVIEW | PYTHON3 | CODECHEF | 3,983 | |
ce923f2ee25f45b43bebd47e94e0393f | UNKNOWN | Chef has $N$ dishes of different types arranged in a row: $A_1, A_2, \ldots, A_N$, where $A_i$ denotes the type of the $i^{th}$ dish. He wants to choose as many dishes as possible from the given list but while satisfying two conditions:
- He can choose only one type of dish.
- No two chosen dishes should be adjacent to each other.
Chef wants to know which type of dish he should choose from, so that he can pick the maximum number of dishes.
Example:
Given $N$=$9$ and $A$=$[1, 2, 2, 1, 2, 1, 1, 1, 1]$.
For type 1, Chef can choose at most four dishes. One of the ways to choose four dishes of type 1 is $A_1$, $A_4$, $A_7$ and $A_9$.
For type 2, Chef can choose at most two dishes. One way is to choose $A_3$ and $A_5$.
So in this case, Chef should go for type 1, in which he can pick more dishes.
-----Input:-----
- The first line contains $T$, the number of test cases. Then the test cases follow.
- For each test case, the first line contains a single integer $N$.
- The second line contains $N$ integers $A_1, A_2, \ldots, A_N$.
-----Output:-----
For each test case, print a single line containing one integer ― the type of the dish that Chef should choose from. If there are multiple answers, print the smallest one.
-----Constraints-----
- $1 \le T \le 10^3$
- $1 \le N \le 10^3$
- $1 \le A_i \le 10^3$
- Sum of $N$ over all test cases doesn't exceed $10^4$
-----Sample Input:-----
3
5
1 2 2 1 2
6
1 1 1 1 1 1
8
1 2 2 2 3 4 2 1
-----Sample Output:-----
1
1
2
-----Explanation:-----
Test case 1:
For both type 1 and type 2, Chef can pick at most two dishes. In the case of multiple answers, we pick the smallest one. Hence the answer will be $1$.
Test case 2:
There are only dishes of type 1. So the answer is $1$.
Test case 3:
For type 1, Chef can choose at most two dishes. For type 2, he can choose three dishes. For type 3 and type 4, Chef can choose the only dish available. Hence the maximum is in type 2 and so the answer is $2$. | ["t=int(input())\nf=0\ny=0\nfor _ in range(t):\n n=int(input())\n seq=[int(x) for x in input().split()]\n prev=seq[0]\n for i in range(1,len(seq)):\n if prev==seq[i]:\n seq[i]=0\n prev=seq[i] \n ans=0\n anss=0\n for el in seq:\n if el!=0:\n c=seq.count(el)\n if ans<c:\n ans=c\n \n anss=el\n elif ans==c:\n if el<anss:\n anss=el\n else:\n anss=anss\n print(anss)", "test = int(input())\n\nfor _ in range(test):\n n = int(input())\n arr = list(map(int,input().split(\" \")))\n se = set(arr)\n t = 0\n res = 0\n for i in se:\n c = 0\n j = 0\n while j<n:\n if arr[j] == i:\n pp = 0\n while(arr[j] == i):\n j += 1\n pp += 1\n if j >= n:\n break\n c += ((pp+1)//2)\n j += 1\n if c > t:\n t = c\n res = i\n if c == t:\n res = min(res,i)\n print(res)", "for _ in range(int(input())):\n n=int(input())\n l=list(map(int,input().split()))\n s=set(l)\n for i in range(1,n):\n if l[i]==l[i-1]:\n l[i]=-1\n # print(l)\n m=0\n sx=list(s)\n sx.sort()\n for i in sx:\n x=l.count(i)\n if m<x:\n m=x\n z=i\n \n print(z)", "# cook your dish here\n# -*- coding: utf-8 -*-\n\"\"\"\nCreated on Mon Apr 27 21:08:53 2020\n\n@author: pavan\n\"\"\"\n\nfor _ in range(int(input())):\n N = int(input())\n ls = list(map(int, input().split()))\n types = []\n type_count = []\n for i in ls:\n if i not in types:\n types.append(i)\n types.sort()\n for j in types:\n indices = []\n for k in range(N):\n if ls[k] == j:\n if k-1 not in indices:\n indices.append(k)\n type_count.append(len(indices))\n \n print(types[type_count.index(max(type_count))])\n \n \n# 3\n# 5\n# 1 2 2 1 2\n# 6\n# 1 1 1 1 1 1\n# 8\n# 1 2 2 2 3 4 2 1\n", "# cook your dish here\n# -*- coding: utf-8 -*-\n\"\"\"\nCreated on Mon Apr 27 23:13:37 2020\n\n@author: SRILEKHA\n\"\"\"\n\n\nfor _ in range(int(input())):\n num = int(input())\n length = list(map(int, input().split()))\n temp = []\n ls = []\n for i in length:\n if i not in temp:\n temp.append(i)\n temp.sort()\n for j in temp:\n indices = []\n for k in range(0, num):\n if length[k] == j:\n if k-1 not in indices:\n indices.append(k)\n ls.append(len(indices))\n print(temp[ls.index(max(ls))])", "from collections import Counter\nt=int(input())\nfor _ in range(t):\n n=int(input())\n A=[]\n L=list(map(int,input().split()))\n i=0\n while(i<n):\n if i==n-1:\n A.append(L[i])\n #print(i+1)\n else:\n if L[i]==L[i+1]:\n A.append(L[i+1])\n #print(i+2)\n i=i+1\n else:\n A.append(L[i])\n #print(i+1)\n i+=1\n count=Counter(A)\n z=[]\n maxvalue=max(count.values())\n for k, v in list(count.items()):\n if v == maxvalue:\n z.append(k)\n print(min(z))\n \n \n", "# cook your dish here\ntry:\n for _ in range(int(input())):\n s1=int(input())\n po=list(map(int,input().split()))\n yp=set(po)\n mo=[]\n sa=[po[0]]\n da=[]\n for x in yp:\n mo.append(x)\n mo.sort()\n bun=0\n cop=po[0]\n for x in range(1,len(po)):\n if(po[x]!=cop or x-bun>1 ):\n sa.append(po[x])\n bun=x\n cop=po[x]\n for x in range(len(mo)):\n da.append(sa.count(mo[x]))\n daa=da.index(max(da))\n print(mo[daa])\nexcept:\n pass", "try:\n for _ in range(int(input())):\n n1=int(input())\n list2=list(map(int,input().split()))\n set1=set(list2)\n list3=[]\n list4=[list2[0]]\n list5=[]\n for i in set1:\n list3.append(i)\n list3.sort()\n m=0\n n=list2[0]\n for i in range(1,len(list2)):\n if(list2[i]!=n or i-m>1 ):\n list4.append(list2[i])\n m=i\n n=list2[i]\n for i in range(len(list3)):\n list5.append(list4.count(list3[i]))\n val=list5.index(max(list5))\n print(list3[val])\nexcept:\n pass", "def selectDish(arr, n):\n res = 0\n maxS = 0\n dd = dict()\n\n for i in range(n):\n if arr[i] in dd:\n dd[arr[i]].append(i)\n else:\n dd[arr[i]] = [i]\n \n for dish in dd:\n indexes = dd[dish]\n count = 0\n prevIdx = -2\n\n for idx in indexes:\n if idx - prevIdx > 1:\n count += 1\n prevIdx = idx\n \n if count > maxS:\n res = dish\n maxS = count\n elif count == maxS:\n if dish < res:\n res = dish\n \n return res\n\ndef __starting_point():\n for _ in range(int(input())):\n n = int(input())\n arr = list(map(int, input().split()))\n\n print(selectDish(arr, n))\n__starting_point()", "T = int(input())\nwhile(T > 0):\n n = int(input())\n l = list(map(int, input().split()))\n s = list(sorted(set(l)))\n maxx = 0\n ans = 0\n for i in s:\n curr = 0\n j = 0\n while(j < n):\n if(l[j] == i):\n curr += 1\n j += 2\n else:\n j += 1\n if(curr > maxx):\n maxx = curr\n ans = i\n print(ans)\n T -= 1", "# cook your dish here\nfrom collections import Counter\nt=int(input())\nwhile(t):\n t-=1\n n=int(input())\n a=list(map(int,input().split()))\n keys=list(Counter(a).keys())\n l=[]\n for i in range(len(keys)):\n ctr=0\n j=0\n while(j<n):\n if(keys[i]==a[j]):\n ctr+=1\n j=j+2\n else:\n j+=1\n l.append(ctr)\n x=max(l)\n ll=[]\n for i in range(len(l)):\n if(l[i]==x):\n ll.append(keys[i])\n print(min(ll)) ", "# cook your dish here\nfor _ in range(int(input())):\n n=int(input())\n a=list(map(int,input().split()))\n types=[0]*(1001)\n flag=0\n for i in range(n):\n if i!=0:\n if a[i-1]==a[i] and flag==0:\n flag=1\n continue\n types[a[i]]+=1\n flag=0\n #print(i,a[i],types)\n print(types.index(max(types)))", "# cook your dish here\ntry:\n for _ in range(int(input())):\n number=int(input())\n list_hai_bhai=list(map(int,input().split(\" \")))\n dic={}\n verma=0\n for cv in range(number-1):\n if(list_hai_bhai[cv]==list_hai_bhai[cv+1]):\n list_hai_bhai[cv+1]=-1\n verma=1\n #print(list_hai_bhai)\n list_hai_bhai.sort()\n for cv in range(number):\n if list_hai_bhai[cv] in dic:\n dic[list_hai_bhai[cv]]+=1\n else:\n dic[list_hai_bhai[cv]]=1\n #print(dic)\n if verma==1:\n dic.pop(-1)\n #print(dic)\n print(max(dic,key=dic.get) )\nexcept:\n pass", "# cook your dish here\nT = int(input())\nfor case in range(T):\n N = int(input())\n A = [int(x) for x in input().split()]\n NewA = []\n NewA.append(A[0])\n flag = False\n net = 0\n count = 0\n num = [0 for i in range(max(A)+1)]\n num[A[0]] += 1\n for i in range(1,len(A)):\n if A[i] != A[i-1] or flag:\n # print('A')\n NewA.append(A[i])\n num[A[i]] += 1\n if flag:\n # print('B')\n flag = False\n else:\n flag = True\n # print('C')\n # print(NewA,i)\n # print(NewA)\n # print(num)\n print(num.index(max(num)))\n\n\n", "# cook your dish here\nfor _ in range(int(input())):\n N = int(input())\n arr = list(map(int, input().split()))\n maxx = 0\n ans= 0\n for i in range(1,max(arr)+1):\n temp = 0\n ind =0\n for j in range(N):\n if i == arr[j] and temp == 0:\n temp += 1\n ind = j\n elif i == arr[j] and (j-1) != ind:\n temp += 1\n ind = j\n if temp > maxx:\n maxx = temp\n ans = i\n print(ans)", "t=int(input())\nfor _ in range(t):\n n=int(input())\n lst=list(map(int,input().split()))\n d=dict.fromkeys(set(lst), 0)\n d[lst[0]]=1\n lst[0]*=-1\n for i in range(1,len(lst)):\n if(lst[i]!=-1*lst[i-1]):\n d[lst[i]]+=1\n lst[i]*=-1\n resl=[]\n mx=0\n k=0\n for i in d:\n if(d[i]>mx):\n mx=d[i]\n for i in d:\n if(d[i]==mx):\n resl.append(i)\n print(min(resl))", "def f():\n n=int(input())\n a=list(map(int,input().split()))\n ind=[]*1001\n for i in range(0,1001):\n ind.append([])\n for i in range(0,len(a)):\n ind[a[i]].append(i)\n maxi=0\n data=0\n for i in range(1,1001):\n s=0\n c=1\n if (len(ind[i])==1):\n s=1\n if (maxi<s):\n maxi=s\n data=i\n elif (maxi==s):\n data=min(data,i)\n continue\n for j in range(1,len(ind[i])):\n if (ind[i][j]-ind[i][j-1]==1):\n c+=1\n if (ind[i][j]-ind[i][j-1]!=1):\n s+=(c//2+(c%2))\n c=1\n if (j==len(ind[i])-1):\n s+=(c//2+c%2)\n c=1\n if (maxi<s):\n maxi=s\n data=i\n elif (maxi==s):\n data=min(data,i)\n if (len(a)==1):\n print(a[0])\n else:\n print(data)\nfor i in range(int(input())):\n f()", "def main():\n n=int(input())\n l=list(map(int,input().split()))\n s=set(l)\n d=dict()\n d1={}\n for i in s:\n d[i]=[l.index(i),False]\n d1[i]=1\n for i in range(n):\n if d[l[i]][1]==False:\n d[l[i]][1]=True\n continue\n else:\n if (d[l[i]][0]+1)!=i:\n d1[l[i]]+=1\n d[l[i]][0]=i\n maxi=0\n for i in d1.values():\n if i>maxi:\n maxi=i\n for i in sorted(d1):\n if d1[i]==maxi:\n print(i)\n break\n\nfor _ in range(int(input())):\n main()", "# cook your dish here\nfor T in range(int(input())):\n n = int(input())\n a_lst = list(map(int, input().split()))\n dish_type = []\n dish_type_count = []\n for i in a_lst:\n if i not in dish_type:\n dish_type.append(i)\n dish_type.sort()\n for j in dish_type:\n dish_indices = []\n for k in range(n):\n if a_lst[k] == j:\n if k-1 not in dish_indices:\n dish_indices.append(k)\n dish_type_count.append(len(dish_indices))\n \n print(dish_type[dish_type_count.index(max(dish_type_count))])", "# cook your dish here\n# cook your dish here\nfor _ in range(int(input())):\n n=int(input())\n l=[int(x) for x in input().split()]\n s=list(set(l))\n s.sort()\n arr=[]\n for i in s:\n a=[]\n for j in range(n):\n if(i == l[j]):\n a.append(j)\n arr.append(a)\n if(len(arr)==1):\n print(l[0])\n else:\n count=1\n m=0\n c=-1\n for i in arr:\n c+=1\n for j in range(len(i)-1):\n if(j==0):\n p=i[j]\n \n if((i[j+1]-p)>1):\n count+=1\n p=i[j+1]\n if(m<count):\n m=count\n x=s[c]\n count=1\n print(x)\n", "for _ in range(int(input())):\n \n n = int(input())\n l = list(map(int,input().split()))\n \n d = {}\n for ele in set(l):\n d[ele] = 0\n \n i=0 \n while i<n:\n \n count = 0\n type = l[i]\n while l[i] == type:\n count += 1 \n i+=1 \n if i==n:\n break \n d[type] += (count + 1)//2 \n \n ans = min(l)\n for ele in d:\n if d[ele] > d[ans] or (d[ele] == d[ans] and ans > ele):\n ans = ele\n print(ans)"] | {"inputs": [["3", "5", "1 2 2 1 2", "6", "1 1 1 1 1 1", "8", "1 2 2 2 3 4 2 1"]], "outputs": [["1", "1", "2"]]} | INTERVIEW | PYTHON3 | CODECHEF | 9,892 | |
f1381659b73a7999d0bdb093c98807d1 | UNKNOWN | Sunita has lots of tasks pending and she has no time to complete. She needs your help and wants you complete the task.
You are given a list of integers and two values $N$ and $K$ $-$ the size of array of integers and the numbers of partitions to be made respectively.
You have to partition the list of integers without changing the order of elements ,into exactly $K$ parts.
Calculate Greatest Common Divisor of all $K$ partition and sum up the gcd values for each partition.
Maximize the sum obtained.
Can you help Sunita ?
-----Input:-----
- First line will contain $T$, number of test cases. Then the test cases follow.
- Each test case contains of a single line of input, two integers $N, K$.
- Next line contains $N$ integers $-$ the list of integers.
-----Output:-----
For each test case, output in a single line integer $-$ the maximal result.
-----Constraints-----
- $1 \leq T \leq 100$
- $1 \leq N, K \leq 250$
- $1 \leq K \leq N$
- $1 \leq A[i] \leq 1e5$
-----Sample Input:-----
1
4 2
5 6 3 2
-----Sample Output:-----
6
-----EXPLANATION:-----
[5] [6 3 2] is the best partition [5 + GCD(6,3,2)] = 6 | ["from sys import stdin,stdout\r\nfrom math import gcd\r\nfor _ in range(int(stdin.readline())):\r\n # n=int(stdin.readline()) k-pieces\r\n n,k=list(map(int,stdin.readline().split()))\r\n a=list(map(int,stdin.readline().split()))\r\n gr=[[0 for _ in range(n)]for _ in range(n)];ans=0;k-=1\r\n for sz in range(n):\r\n for i in range(n-sz):\r\n j=i+sz\r\n if sz==0:gr[i][j]=a[i]\r\n else:\r\n gr[i][j]=gcd(gr[i+1][j],gr[i][j-1])\r\n # print(*gr,sep='\\n')\r\n dp=[[0 for _ in range(n)]for _ in range(k+1)]\r\n for i in range(n):\r\n dp[0][i]=gr[0][i]\r\n for i in range(1,k+1):\r\n for j in range(i,n):\r\n for par in range(j-1,-1,-1):\r\n dp[i][j]=max(dp[i][j],gr[par+1][j]+dp[i-1][par])\r\n # print(*dp,sep='\\n')\r\n print(dp[k][n-1])\r\n\r\n"] | {"inputs": [["1", "4 2", "5 6 3 2"]], "outputs": [["6"]]} | INTERVIEW | PYTHON3 | CODECHEF | 873 | |
36fca690a74ed3b9bcadad5dfc48c63f | UNKNOWN | The chef has a number N, Cheffina challenges chef to form the largest number X from the digits of N.
-----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^5$
- $1 \leq N \leq 10^6$
-----Sample Input:-----
2
2
212
-----Sample Output:-----
2
221 | ["# cook your dish here\nn=int(input())\nl=[]\nfor i in range(n):\n a=int(input())\n l.append(a)\nfor i in l:\n b = list(map(int, str(i)))\n b.sort(reverse=True)\n s = [str(i) for i in b]\n r = int(\"\".join(s))\n print(r)", "# cook your dish here\nresult=[]\nfor i in range(int(input())):\n m=input()\n result.append(\"\".join(sorted(m,reverse=True)))\nfor i in range(len(result)):\n print(result[i])", "from sys import *\ninput=stdin.readline\nfor u in range(int(input())):\n n=input()\n s=sorted(n,reverse=True)\n print(''.join(s))\n", "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 a=sorted(list(str(n)),reverse=True)\r\n print(int(''.join(a)))\r\n\r\n\r\ndef __starting_point():\r\n solve()\r\n\n__starting_point()"] | {"inputs": [["2", "2", "212"]], "outputs": [["2", "221"]]} | INTERVIEW | PYTHON3 | CODECHEF | 1,152 | |
af36556f841ba6cbe19d7c159c8a7558 | UNKNOWN | The Chef has bought $N$ boxes of Tiles. The number of tiles present in $i^{th}$ box is $i$ ($i $ varies from $1$ to $N$) . The Chef has two houses with $N$ rooms each, whose floors is a square with area $(i*i)$ ,i varies from $(1....N)$. He want to distribute equal number of tiles from $i^{th}$ box to any two rooms (each room must belong to one house ) such that all tiles of $i^ { th}$ box is used and floor of both rooms of different houses are tiled completely.
Since chef is busy doing some other works so he wants your help to count the total number of rooms of both houses that will be tiled completely.
Note $:$ size of each tile present in boxes has length and breadth equal to $1$. It is not mandatory to use all the boxes.
A room should be tilled completely from a single box.
-----Input:-----
- First line will contain $T$, number of testcases. Then the testcases follow.
- Each testcase contains one integer $N$.
-----Output:-----
For each testcase print the total number of rooms of both houses that will be tiled completely.
-----Constraints-----
- $1 \leq T \leq 5000$
- $1 \leq N \leq 10^{12}$
-----Sample Input:-----
1
16
-----Sample Output:-----
4
-----EXPLANATION:-----
The room $1$ and $2$ of both the houses are completely tiled. | ["from sys import stdin\r\n\r\nfor _ in range(int(stdin.readline())):\r\n n = int(stdin.readline())\r\n n //= 2\r\n k = 2 * int(n**0.5)\r\n print(k)\r\n", "# cook your dish here\nfrom math import sqrt\ndef solve(N):\n\n return int(sqrt(N/2)) * 2\n\n\nt = int(input())\n\nfor i in range(t):\n N = int(input())\n print(solve(N))", "# cook your dish here\nfrom math import floor,sqrt\nfor _ in range(int(input())):\n n=int(input())\n\n x=floor(sqrt(n/2))\n print(x*2)", "# cook your dish here\nfrom math import floor,sqrt\nfor _ in range(int(input())):\n n=int(input())\n y=n/2\n x=floor(sqrt(y))\n print(x*2)", "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 n//=2\r\n a=n**(1/2)\r\n a=int(a)\r\n print(2*a)\r\n \r\n", "from math import sqrt\nt = int(input())\nfor _ in range(t):\n n = int(input())\n print(int(sqrt(n >> 1)) << 1)", "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 n//=2\r\n a=n**(1/2)\r\n a=int(a)\r\n print(2*a)\r\n \r\n", "# cook your dish here\nfrom collections import defaultdict \nimport sys\nimport math \nimport random\ndef get_array(): return list(map(int , sys.stdin.readline().strip().split()))\ndef get_ints(): return map(int, sys.stdin.readline().strip().split())\ndef input(): return sys.stdin.readline().strip()\n\n\n\nfor _ in range(int(input())):\n n = int(input())\n\n\n print(2*int(math.sqrt(n//2)))", "#dt = {} for i in x: dt[i] = dt.get(i,0)+1\nimport sys;input = sys.stdin.readline\ninp,ip = lambda :int(input()),lambda :[int(w) for w in input().split()]\n\nfrom math import sqrt\nfor _ in range(inp()):\n n = inp()\n t = int(sqrt(n//2)//1)\n print(2*t)\n", "for _ in range(int(input())):\n n=int(input())\n n=n//2\n from math import sqrt as sq \n \n print(2*int(sq(n)))", "# cook your dish here\nimport math\n\nt = int(input())\nwhile t:\n n = int(input())\n xx = math.sqrt(n / 2);\n print(int(2 * int(xx)))\n t-= 1", "t = int(input())\r\nfor _ in range(t):\r\n\tn = int(input())\r\n\r\n\ts, e = 0, n\r\n\twhile s <= e:\r\n\t\tmid = (s+e)//2\r\n\t\tif n >= 2*mid*mid:\r\n\t\t\tans = mid\r\n\t\t\ts = mid+1\r\n\t\telse:\r\n\t\t\te = mid-1\r\n\tprint(2*ans)\t", "from math import sqrt\r\n\r\nfor _ in range(int(input())):\r\n N = int(input()) // 2\r\n print(int(sqrt(N)) * 2)", "\r\nimport math\r\nfor _ in range(int(input())):\r\n n=int(input())\r\n n//=2\r\n ans=0\r\n ans+=int(math.sqrt(n))\r\n print(int(2*ans))", "\r\nimport math\r\nfor _ in range(int(input())):\r\n n=int(input())\r\n n//=2\r\n ans=0\r\n ans+=int(math.sqrt(n))\r\n print(int(2*ans))", "'''\r\n Auther: ghoshashis545 Ashis Ghosh\r\n College: jalpaiguri Govt Enggineering College\r\n\r\n'''\r\nfrom os import path\r\nimport sys\r\nfrom heapq import heappush,heappop\r\nfrom functools import cmp_to_key as ctk\r\nfrom collections import deque,defaultdict as dd \r\nfrom bisect import bisect,bisect_left,bisect_right,insort,insort_left,insort_right\r\nfrom itertools import permutations\r\nfrom datetime import datetime\r\nfrom math import ceil,sqrt,log,gcd\r\ndef ii():return int(input())\r\ndef si():return input().rstrip()\r\ndef mi():return map(int,input().split())\r\ndef li():return list(mi())\r\nabc='abcdefghijklmnopqrstuvwxyz'\r\nmod=1000000007\r\n# mod=998244353\r\ninf = float(\"inf\")\r\nvow=['a','e','i','o','u']\r\ndx,dy=[-1,1,0,0],[0,0,1,-1]\r\n\r\ndef bo(i):\r\n return ord(i)-ord('a')\r\n\r\nfile=1\r\n\r\n\r\n\r\n\r\n\r\n \r\ndef solve():\r\n\r\n for _ in range(ii()):\r\n \r\n n = ii()\r\n x = n//2\r\n c = int(sqrt(x))\r\n print(2*c)\r\n\r\n\r\n \r\ndef __starting_point():\r\n\r\n if(file):\r\n\r\n if path.exists('input.txt'):\r\n sys.stdin=open('input.txt', 'r')\r\n sys.stdout=open('output.txt','w')\r\n else:\r\n input=sys.stdin.readline\r\n solve()\n__starting_point()", "from math import sqrt\nt=int(input())\nfor _ in range (t):\n n=int(input())\n room=int(sqrt(n//2))\n print(room*2)\n", "# cook your dish here\nimport math\nt=int(input())\nfor i in range(t):\n\tn=int(input())\n\tp=n//2\n\tprint(math.floor(math.sqrt(p))*2)", "# cook your dish here\nimport math\nt=int(input())\nfor i in range(t):\n\tn=int(input())\n\tp=n//2\n\tprint(math.floor(math.sqrt(p))*2)", "import math\nt=int(input())\nfor _ in range(t):\n\tn=int(input())\n\tz=2*int(math.sqrt(n/2))\n\tprint(int(z))", "import math\r\nfor t in range(int(input())):\r\n n=int(input())\r\n print(math.floor(math.sqrt(n//2))*2)", "import math\r\ntest = int(input())\r\nfor t in range(test):\r\n\tn = int(input())\r\n\tx = int(math.sqrt(n//2))\r\n\tprint(x*2)"] | {"inputs": [["1", "16"]], "outputs": [["4"]]} | INTERVIEW | PYTHON3 | CODECHEF | 6,473 | |
b4ba8713de9d9dfd35f2f44c616012b7 | UNKNOWN | After the death of their mother, Alphonse and Edward now live with Pinako and Winry.
Pinako is worried about their obsession with Alchemy, and that they don't give attention to their studies.
So to improve their mathematical solving ability, every day she gives a mathematical problem to solve. They can go out to practice Alchemy only after they have solved the problem.
Help them by solving the given problem, so that they can go early today for their Alchemy practice.
Given an array A$A$ of N$N$ non-negative integers and two integers K$K$ and M$M$. Find the number of subsequences of array A$A$ of length K$K$ which satisfies the following property:
Suppose the subsequence is S=S1S2…SK$S = S_1S_2 \ldots S_K$, then for all i$i$ such that 1≤i≤K$1 \leq i \leq K$,
Si%M=i%M S_i \% M = i \% M
should hold true, where Si$S_i$ denotes the i$i$-th element of the subsequence, using 1-based indexing.
As the number of subsequences may be very large, output the answer modulo 1000000007$1000000007$.
PS: We also proposed the idea of making a look-alike clone through alchemy and keeping it in front of the study table. But it seems impossible to convince Edward to make a clone of his exact same height, and not taller than him. So solving the problem for him was a better choice.
-----Input:-----
- The first line contains T$T$, the number of test cases. Then the test cases follow.
- For every test case, the first line contains N$N$, K$K$ and M$M$.
- For every test case, the second line contains N$N$ integers Ai$A_{i}$ ( 1≤i≤N$1 \leq i \leq N$).
-----Output:-----
For every test case, output in a single line an integer denoting the number of valid subsequences modulo 109+7$10^9+7$
-----Constraints-----
- 1≤T≤100$1 \leq T \leq 100$
- 1≤N≤104$1 \leq N \leq 10^{4}$
- 1≤K≤N$1 \leq K \leq N$
- ⌈K100⌉≤M≤100×K$\lceil \frac{K}{100}\rceil \leq M \leq 100\times K$
- 0≤Ai≤109$0 \leq A_{i} \leq 10^{9}$
-----Sample Input:-----
1
12 4 3
4 5 6 7 1 4 6 9 0 0 10 2
-----Sample Output:-----
8
-----Explanation:-----
The subsequences of length 4$4$, satisfying the given criteria are [4,5,6,7]$[4, 5, 6, 7]$, [4,5,6,10]$[4, 5, 6, 10]$, [4,5,6,10]$[4, 5, 6, 10]$, [4,5,6,1]$[4, 5, 6, 1]$, [4,5,9,10]$[4, 5, 9, 10]$ ,[4,5,6,4]$[4, 5, 6, 4]$ , [4,5,0,10]$[4, 5, 0, 10]$ and [4,5,0,10]$[4, 5, 0, 10]$. This accounts for a total of 8$8$ valid subsequences.
Let us take one subsequence and see why it satisfies the given property. Consider [4,5,9,10]$[4, 5, 9, 10]$.
- S1%M=4%3=1=1%3=1%M$ S_1 \% M = 4 \% 3 = 1 = 1 \% 3 = 1 \% M $
- S2%M=5%3=2=2%3=2%M$ S_2 \% M = 5 \% 3 = 2 = 2 \% 3 = 2 \% M $
- S3%M=9%3=0=3%3=3%M$ S_3 \% M = 9 \% 3 = 0 = 3 \% 3 = 3 \% M $
- S4%M=10%3=1=4%3=4%M$ S_4 \% M = 10 \% 3 = 1 = 4 \% 3 = 4 \% M $
All the valid i$i$ satisfy the condition, and hence this is a valid subsequence. | ["# cook your dish here\nmod = 10**9 + 7\nfor i in range(int(input())):\n n,k,m = tuple(map(int, input().split()))\n a = list(map(int, input().split()))\n ans = [0 for i in range(k+1)]\n ans[0] = 1\n curr_ending = 1\n for i in range(n):\n mod_a = a[i]%m\n start = curr_ending - (curr_ending%m - mod_a)%m\n if(mod_a == curr_ending%m and curr_ending<k):\n curr_ending += 1\n for i in range(start, 0, -m):\n ans[i] += ans[i-1]\n if(ans[i] > mod):\n ans[i] = ans[i] - mod\n print(ans[k])", "# cook your dish here\nmod = 10**9 + 7\nfor i in range(int(input())):\n n,k,m = tuple(map(int, input().split()))\n a = list(map(int, input().split()))\n ans = [0 for i in range(k+1)]\n ans[0] = 1\n curr_ending = 1\n for i in range(n):\n mod_a = a[i]%m\n start = curr_ending - (curr_ending%m - mod_a)%m\n if(mod_a == curr_ending%m and curr_ending<k):\n curr_ending += 1\n for i in range(start, 0, -m):\n ans[i] += ans[i-1]\n if(ans[i] > mod):\n ans[i] = ans[i] - mod\n print(ans[k])", "# cook your dish here\nmod = 10**9 + 7\nfor i in range(int(input())):\n n,k,m = tuple(map(int, input().split()))\n a = list(map(int, input().split()))\n ans = [0 for i in range(k+1)]\n ans[0] = 1\n curr_ending = 1\n for i in range(n):\n mod_a = a[i]%m\n start = curr_ending - (curr_ending%m - mod_a)%m\n if(mod_a == curr_ending%m and curr_ending<k):\n curr_ending += 1\n for i in range(start, 0, -m):\n ans[i] += ans[i-1]\n if(ans[i] > mod):\n ans[i] = ans[i] - mod\n print(ans[k])\n\n \n", "# cook your dish here\nM = 10**9+7\nfor _ in range(int(input())):\n n,k,m=(int(s) for s in input().split())\n l = [int(s)%m for s in input().split()]\n ans = [0]*(k+1)\n i = 1\n for j in range(n):\n mov = 0\n just = 0\n if (i%m+1)%m==l[j] and i<k:\n if ans[i]!=0:\n just=1\n mov = 1\n w = i - (i%m-l[j])%m\n while w>=1:\n if w==1:\n ans[w]+=1\n else:\n ans[w]+=ans[w-1]\n w-=m\n if mov:\n i+=1\n if just:\n ans[i] = ans[i-1]\n print(ans[k]%M) ", "M = 10**9+7\nfor _ in range(int(input())):\n n,k,m=(int(s) for s in input().split())\n l = [int(s)%m for s in input().split()]\n ans = [0]*(k+1)\n i = 1\n for j in range(n):\n mov = 0\n just = 0\n if (i%m+1)%m==l[j] and i<k:\n if ans[i]!=0:\n just=1\n mov = 1\n w = i - (i%m-l[j])%m\n while w>=1:\n if w==1:\n ans[w]+=1\n else:\n ans[w]+=ans[w-1]\n w-=m\n if mov:\n i+=1\n if just:\n ans[i] = ans[i-1]\n print(ans[k]%M) ", "# cook your dish here\nt = int(input())\nMOD = 10**9+7\nfor _ in range(t) :\n n,k,m= list(map(int,input().split()))\n b = [0 for i in range(k)]\n a = list(map(int,input().split()))\n if(m == 1) :\n for i in range(n) :\n for j in range(k-1,-1,-1) :\n if(j == 0) :\n b[j] = (b[j]+1)%MOD\n else :\n b[j] = (b[j-1] + b[j])%MOD\n else :\n for val in a:\n mod = val % m\n if(mod == 0) :\n mod = m\n for j in range(mod-1,k,m) :\n if(j == 0) :\n b[j] = (b[j]+1)%MOD\n else :\n b[j] = (b[j-1] + b[j])%MOD\n print(b[-1]%MOD)", "mod=10**9+7\nfor _ in range(int(input())):\n n,k,m=list(map(int,input().split()))\n a=list([(int(x)-1)%m+1 for x in input().split()])\n arr=[0]*k\n arr.insert(0,1)\n for i in range(n):\n end=a[i]+m*((k-a[i])//m)\n for j in range(end,a[i]-1,-m):\n arr[j]=(arr[j]+arr[j-1])%mod\n print(arr[-1])\n \n", "def modinv(v,m):\n v %= m\n pv = m\n pc = 0\n c = 1\n while v > 0:\n q, a = divmod(pv, v)\n pc, c = c, pc-q*c\n pv, v = v, a\n return pc % m\n\ndef binmod(n,r,m):\n if 2*r > n: r = n - r\n if r < 0: return 0\n if r == 0: return 1\n tp = 1\n bm = 1\n for t in range(1, r+1):\n bm = bm*t%m\n tp = tp*(n+1-t)%m\n return (tp*modinv(bm,m))%m\n\nMVAL = 1000000007\nfor ti in range(int(input())):\n n,k,m = map(int,input().split())\n ays = list(map(int,input().split()))", "# https://www.codechef.com/problems/GRUMPMA\nfrom sys import stdin\n\ndef modinv(v,m):\n v %= m\n pv = m\n pc = 0\n c = 1\n while v > 0:\n q, a = divmod(pv, v)\n pc, c = c, pc-q*c\n pv, v = v, a\n return pc % m\n\ndef binmod(n,r,m):\n if 2*r > n: r = n - r\n if r < 0: return 0\n if r == 0: return 1\n tp = 1\n bm = 1\n for t in range(1, r+1):\n bm = bm*t%m\n tp = tp*(n+1-t)%m\n return (tp*modinv(bm,m))%m\n\nMVAL = 1000000007", "# https://www.codechef.com/problems/GRUMPMA\nfrom sys import stdin\n\ndef modinv(v,m):\n v %= m\n pv = m\n pc = 0\n c = 1\n while v > 0:\n q, a = divmod(pv, v)\n pc, c = c, pc-q*c\n pv, v = v, a\n return pc % m\n\ndef binmod(n,r,m):\n if 2*r > n: r = n - r\n if r < 0: return 0\n if r == 0: return 1\n tp = 1\n bm = 1\n for t in range(1, r+1):\n bm = bm*t%m\n tp = tp*(n+1-t)%m\n return (tp*modinv(bm,m))%m\n\nMVAL = 1000000007"] | {"inputs": [["1", "12 4 3", "4 5 6 7 1 4 6 9 0 0 10 2"]], "outputs": [["8"]]} | INTERVIEW | PYTHON3 | CODECHEF | 5,176 | |
9ab869724b27a250f95cf477239f8311 | UNKNOWN | It is an interesting exercise to write a program to print out all permutations of $1, 2, …, n$. However, since there are $6227020800$ permutations of $1, 2, …, 13$, it is unlikely that we would ever run this program on an input of size more than $10$.
However, here is another interesting problem whose solution can also be used to generate permutations. We can order the permutations of $1, 2, …, n$ under the lexicographic (or dictionary) order. Here are the permutations of $1,2,3$ in lexicographic order:
123132213231312321123132213231312321 1 \, 2 \, 3 \quad 1 \, 3 \, 2 \quad 2 \, 1 \, 3 \quad 2 \, 3 \, 1 \quad 3 \, 1 \, 2 \quad 3 \, 2 \, 1
The problem we have is the following: given a permutation of $1,2, …, n$, generate the next permutation in lexicographic order. For example, for $2 3 1 4$ the answer is $2 3 4 1$.
-----Input:-----
The first line of the input contains two integers, $N$ and $K$. This is followed by $K$ lines, each of which contains one permutation of $1, 2,…,N$.
-----Output:-----
The output should consist of $K$ lines. Line $i$ should contain the lexicographically next permutation correponding to the permutation on line $i+1$ in the input.
-----Constraints:-----
- $1 \leq N \leq 1000$.
- $1 \leq K \leq 10$.
-----Sample input-----
3 2
3 1 2
2 3 1
-----Sample output-----
3 2 1
3 1 2 | ["import sys\n# import math as mt\n# from collections import Counter\n# from itertools import permutations\n# from functools import reduce\n# from heapq import nsmallest, nlargest, heapify, heappop, heappush, heapreplace\n\ndef get_inpt(): return sys.stdin.readline().strip()\ndef get_int(): return int(sys.stdin.readline().strip())\ndef get_ints(): return map(int, sys.stdin.readline().strip().split())\ndef get_array(): return list(map(int, sys.stdin.readline().strip().split()))\n\n# sys.setrecursionlimit(10**7)\n# INF = float('inf')\n# MOD1, MOD2 = 10**9+7, 998244353\n\nn, k = get_ints()\n\nfor _ in range(k):\n \n arr = get_array()\n \n for i in reversed(range(n-1)):\n \n if arr[i] < arr[i+1]:\n \n ind = i+1\n minn = arr[i+1]\n for j in range(i+1, n):\n if arr[j] > arr[i]:\n minn = min(arr[j], minn)\n ind = j\n \n arr[i], arr[ind] = arr[ind], arr[i]\n \n arr = arr[:i+1] + sorted(arr[i+1:])\n \n break\n \n print(*arr)", "class Solution(object):\r\n def nextPermutation(self, nums):\r\n found = False\r\n i = len(nums)-2\r\n while i >=0:\r\n if nums[i] < nums[i+1]:\r\n found =True\r\n break\r\n i-=1\r\n if not found:\r\n nums.sort()\r\n else:\r\n m = self.findMaxIndex(i+1,nums,nums[i])\r\n nums[i],nums[m] = nums[m],nums[i]\r\n nums[i+1:] = nums[i+1:][::-1]\r\n return nums\r\n def findMaxIndex(self,index,a,curr):\r\n ans = -1\r\n index = 0\r\n for i in range(index,len(a)):\r\n if a[i]>curr:\r\n if ans == -1:\r\n ans = curr\r\n index = i\r\n else:\r\n ans = min(ans,a[i])\r\n index = i\r\n return index\r\nob1 = Solution()\r\nn,k=map(int,input().split())\r\nl=[]\r\nfor i in range(k):\r\n t=list(map(int,input().split()))\r\n l.append(t)\r\nfor i in l:\r\n print(*ob1.nextPermutation(i))\r\n", "n, t = list(map(int, input().split()))\r\nwhile(t):\r\n t -= 1\r\n a = list(map(int, input().split()))\r\n i = n-1\r\n while(i > 0 and a[i] < a[i-1]):\r\n i -= 1\r\n j = i\r\n i -= 1\r\n mini = j\r\n while(j < n):\r\n if(a[j] > a[i] and a[j] < a[mini]):\r\n mini = j\r\n j += 1\r\n a[i], a[mini] = a[mini], a[i]\r\n a[i+1:] = sorted(a[i+1:])\r\n print(*a)", "n, k=map(int, input().split())\r\nfor i in range(k):\r\n arr=list(map(int, input().split()))\r\n res=[]\r\n \r\n for i in range(len(arr)-1, 0, -1):\r\n if(arr[i]>arr[i-1]):\r\n res.append(arr[i-1])\r\n res.append(arr[i])\r\n temp=arr[i-1]\r\n break\r\n else:\r\n res.append(arr[i])\r\n \r\n res.sort()\r\n for j in range(len(res)):\r\n if(res[j]>temp):\r\n arr[i-1]=res[j]\r\n res.remove(res[j])\r\n break\r\n \r\n for j in range(len(res)):\r\n arr[i]=res[j]\r\n i+=1\r\n \r\n print(*arr)"] | {"inputs": [["3 2", "3 1 2", "2 3 1", ""]], "outputs": [["3 2 1", "3 1 2 "]]} | INTERVIEW | PYTHON3 | CODECHEF | 3,212 | |
dc032012560522d213c01d0df384ed15 | UNKNOWN | Due to the COVID pandemic, there has been an increase in the number of cases if a hospital. The management has decided to clear a large square area for the patients and arrange for beds. But the beds can't be too near to each other.
The area is of dimension $N$ x $N$
The whole area is already divided into blocks. $1$ means there's a bed in the block, $0$ denotes there isn't. Note, beds placed on consecutive diagonal blocks are safe.
This is a SAFE example:
1 0
0 1
This is an UNSAFE example:
0 1 1
0 0 0
1 0 0
To avoid spreading the virus even further, you have to make sure no two adjacent blocks have beds in them. This is done to maintain distance between beds.
Return an output of "SAFE" if you find the workers have arranged the beds with due consideration to the distance needed. Return "UNSAFE" otherwise.
-----Input:-----
- First line will contain $T$, number of testcases. Then the testcases follow.
- Next line contains $N$.
- Next $N$ lines will contain $N$ number of space-separated integers $Ai$ which make denote the beds in the area.
-----Output:-----
For each test case, output in a single line whether the total arrangement is "SAFE" or "UNSAFE". Even if there's a single unsafe bed in the whole area, report the whole area as "UNSAFE".
-----Constraints-----
- $1 \leq T \leq 100$
- $0 \leq Ai \leq 1$
- $2 \leq N \leq 100$
-----Subtasks-----
- 30 points : $1 \leq N \leq 7$
- 70 points : Original constraints
-----Sample Input:-----
2
4
1 0 1 0
0 0 0 1
0 1 0 0
1 0 0 1
4
1 0 1 0
0 0 0 0
1 0 1 1
0 1 0 0
-----Sample Output:-----
SAFE
UNSAFE
-----EXPLANATION:-----
Beds placed on blocks diagonally are not a problem. | ["res = []\nfor _ in range(int(input())):\n lst = []\n flag = 0\n n = int(input())\n for i in range(n):\n lst.append(list(map(int, input().split())))\n for i in lst:\n for j in range(n-1):\n if i[j] == i[j+1] == 1:\n res.append(\"UNSAFE\")\n flag = 1\n break\n if flag != 0:\n break\n for i in range(n-1):\n for j in range(n):\n if lst[i][j] == lst[i+1] == 1:\n res.append(\"UNSAFE\")\n flag = 1\n break\n if flag != 0:\n break\n if flag == 0:\n res.append(\"SAFE\")\nfor i in res:\n print(i)\n", "T = int(input())\n\nfor t in range(T):\n\n N = int(input())\n\n l = []\n\n for i in range(N):\n l.append(list(map(int,input().split())))\n \n flg = True\n \n for i in range(N):\n for j in range(1,N):\n if l[i][j] == l[i][j-1] and l[i][j] == 1:\n flg = False\n break \n if flg == False:\n break\n \n if flg == False:\n print('UNSAFE')\n else:\n for i in range(1,N):\n for j in range(N):\n if l[i][j] == l[i-1][j] and l[i][j] == 1:\n flg = False\n break\n if flg == False:\n break\n if flg == False:\n print('UNSAFE')\n else:\n print('SAFE')", "for _ in range(int(input())):\n n=int(input());l = [];f=0\n while not l or len(l) < len(l[0]):\n l.append(list(map(int, input().split())))\n a=sum(l, [])\n b = [i for i in range(len(a)) if a[i] ==1]\n for j in range(len(b)-1):\n if b[j+1]-b[j]==1:\n f=1;print(\"UNSAFE\");break\n if f != 1:\n print(\"SAFE\")", "res = []\nfor _ in range(int(input())):\n lst = []\n flag = 0\n n = int(input())\n for i in range(n):\n lst.append(list(map(int, input().split())))\n for i in lst:\n for j in range(n-1):\n if i[j] == i[j+1] == 1:\n res.append(\"UNSAFE\")\n flag = 1\n break\n if flag != 0:\n break\n for i in range(n-1):\n for j in range(n):\n if lst[i][j] == lst[i+1] == 1:\n res.append(\"UNSAFE\")\n flag = 1\n break\n if flag != 0:\n break\n if flag == 0:\n res.append(\"SAFE\")\nfor i in res:\n print(i)\n", "# cook your dish here\nt=int(input())\nfor i in range(t):\n b=int(input())\n g=[]\n for i in range(b):\n s=[]\n l=list(map(int,input().split()))\n for i in range(len(l)):\n if(l[i]==1):\n s.append(i)\n if(len(s)==1):\n g.append(\"SAFE\")\n else:\n for i in range(len(s)-1):\n if(s[i+1]-s[i]>=2):\n g.append(\"SAFE\")\n else:\n g.append(\"UNSAFE\")\n if \"UNSAFE\" in g:\n print(\"UNSAFE\")\n else:\n print(\"SAFE\")", "res = []\nfor _ in range(int(input())):\n lst = []\n flag = 0\n n = int(input())\n for i in range(n):\n lst.append(list(map(int, input().split())))\n for i in lst:\n for j in range(n-1):\n if i[j] == i[j+1] == 1:\n res.append(\"UNSAFE\")\n flag = 1\n break\n if flag != 0:\n break\n for i in range(n-1):\n for j in range(n):\n if lst[i][j] == lst[i+1] == 1:\n res.append(\"UNSAFE\")\n flag = 1\n break\n if flag != 0:\n break\n if flag == 0:\n res.append(\"SAFE\")\nfor i in res:\n print(i)\n", "res = []\nfor _ in range(int(input())):\n lst = []\n flag = 0\n n = int(input())\n for i in range(n):\n lst.append(list(map(int, input().split())))\n for i in lst:\n for j in range(n-1):\n if i[j] == i[j+1] == 1:\n res.append(\"UNSAFE\")\n flag = 1\n break\n if flag != 0:\n break\n for i in range(n-1):\n for j in range(n):\n if lst[i][j] == lst[i+1] == 1:\n res.append(\"UNSAFE\")\n flag = 1\n break\n if flag != 0:\n break\n if flag == 0:\n res.append(\"SAFE\")\nfor i in res:\n print(i)\n", "res = []\nfor _ in range(int(input())):\n lst = []\n flag = 0\n n = int(input())\n for i in range(n):\n lst.append(list(map(int, input().split())))\n for i in lst:\n for j in range(n-1):\n if i[j] == i[j+1] == 1:\n res.append(\"UNSAFE\")\n flag = 1\n break\n if flag != 0:\n break\n for i in range(n-1):\n for j in range(n):\n if lst[i][j] == lst[i+1] == 1:\n res.append(\"UNSAFE\")\n flag = 1\n break\n if flag != 0:\n break\n if flag == 0:\n res.append(\"SAFE\")\nfor i in res:\n print(i)\n", "for _ in range(int(input())):\n n = int(input())\n ar = [[0]*n]*n\n for i in range(n):\n ar[i] = list(map(int, input().split()))\n flag = 1\n for r in range(n-1):\n for c in range(n-1):\n if ar[r][c]==1 :\n if ar[r][c+1]==1:\n flag = 0\n break\n elif ar[r+1][c]==1:\n flag = 0\n break\n if flag==1:\n print(\"SAFE\")\n else:\n print(\"UNSAFE\")", "res = []\nfor _ in range(int(input())):\n lst = []\n flag = 0\n n = int(input())\n for i in range(n):\n lst.append(list(map(int, input().split())))\n for i in lst:\n for j in range(n-1):\n if i[j] == i[j+1] == 1:\n res.append(\"UNSAFE\")\n flag = 1\n break\n if flag != 0:\n break\n for i in range(n-1):\n for j in range(n):\n if lst[i][j] == lst[i+1] == 1:\n res.append(\"UNSAFE\")\n flag = 1\n break\n if flag != 0:\n break\n if flag == 0:\n res.append(\"SAFE\")\nfor i in res:\n print(i)\n", "# cook your dish here\ntry:\n t=int(input())\n for i in range(t):\n rc=int(input())\n matr=[]\n flag=0\n for i in range(rc):\n matr.append(list(map(int,input().split())))\n # print(matr)\n for i in range(rc-1):\n for j in range(rc-1):\n if(matr[i][j]==1):\n if(matr[i+1][j]==1 or matr[i][j+1]==1):\n flag=1\n break\n if(flag==1):\n break\n if(flag==1):\n print(\"UNSAFE\")\n else:\n print(\"SAFE\")\nexcept:\n pass\n", "t=int(input())\nfor _ in range(t):\n n=int(input())\n cnt=0\n arr = [[0 for j in range(n)] for i in range(n)]\n for i in range(n):\n l=list(map(int,input().split()))\n arr.insert(i,l)\n arr.pop()\n for i in range(n-1):\n for j in range(n-1):\n if arr[i][j]==arr[i][j+1]:\n if arr[i][j+1]==1:\n cnt=1\n break\n elif arr[i][j]==arr[i+1][j]:\n if arr[i+1][j]==1:\n cnt=1\n break\n if cnt==0:\n print(\"SAFE\")\n else:\n print(\"UNSAFE\")", "res = []\nfor _ in range(int(input())):\n lst = []\n flag = 0\n n = int(input())\n for i in range(n):\n lst.append(list(map(int, input().split())))\n for i in lst:\n for j in range(n-1):\n if i[j] == i[j+1] == 1:\n res.append(\"UNSAFE\")\n flag = 1\n break\n if flag != 0:\n break\n for i in range(n-1):\n for j in range(n):\n if lst[i][j] == lst[i+1] == 1:\n res.append(\"UNSAFE\")\n flag = 1\n break\n if flag != 0:\n break\n if flag == 0:\n res.append(\"SAFE\")\nfor i in res:\n print(i)\n", "for ts in range(int(input())):\n N=int(input())\n l = []\n f=1\n while not l or len(l) < len(l[0]):\n l.append(list(map(int, input().split())))\n p=sum(l, [])\n k = [i for i in range(len(p)) if p[i] ==1]\n for j in range(len(k)-1):\n if k[j+1]-k[j]==1:\n f=0\n break\n if f==0:\n print(\"UNSAFE\")\n else:\n print(\"SAFE\")", "res = []\nfor _ in range(int(input())):\n lst = []\n flag = 0\n n = int(input())\n for i in range(n):\n lst.append(list(map(int, input().split())))\n for i in lst:\n for j in range(n-1):\n if i[j] == i[j+1] == 1:\n res.append(\"UNSAFE\")\n flag = 1\n break\n if flag != 0:\n break\n for i in range(n-1):\n for j in range(n):\n if lst[i][j] == lst[i+1] == 1:\n res.append(\"UNSAFE\")\n flag = 1\n break\n if flag != 0:\n break\n if flag == 0:\n res.append(\"SAFE\")\nfor i in res:\n print(i)\n", "# cook your dish here\ntry:\n for i in range(int(input())):\n n=int(input())\n li=[]\n for j in range(n):\n li.append(list(map(int,input().split())))\n x=0\n for k in range(n):\n for j in range(n):\n if(k!=n-1 and j!=n-1):\n if(li[k][j]==1):\n if(li[k][j+1]==1 or li[k+1][j]==1):\n #print(k,' ',j,' ','1')\n x=1\n break\n \n elif(j==n-1 and k!=n-1):\n if(li[k][j]==1):\n if(li[k+1][j]==1):\n x=1\n #print(k,' ',j,' ','2')\n break\n elif(k==n-1 and j!=n-1):\n if(li[k][j]==1):\n if(li[k][j+1]==1):\n x=1\n #print(k,' ',j,' ','3')\n break\n if(x==1):\n print('UNSAFE')\n break\n if(x==0):\n print('SAFE')\n \nexcept:\n pass\n", "try:\n t=int(input())\n for i in range(t):\n rc=int(input())\n matr=[]\n flag=0\n for i in range(rc):\n matr.append(list(map(int,input().split())))\n # print(matr)\n for i in range(rc-1):\n for j in range(rc-1):\n if(matr[i][j]==1):\n if(matr[i+1][j]==1 or matr[i][j+1]==1):\n flag=1\n break\n if(flag==1):\n break\n if(flag==1):\n print(\"UNSAFE\")\n else:\n print(\"SAFE\")\nexcept:\n pass\n", "# cook your dish here\nt = int(input())\n\nfor xx in range(t):\n n = int(input()) \n \n A = []\n \n for i in range(n):\n A.append([int(x) for x in input().split()])\n \n check = 0\n for i in range(n):\n for j in range(n):\n if A[i][j] == 1:\n if i < n - 1 and A[i + 1][j] == 1:\n check = 1\n break\n elif j < n - 1 and A[i][j + 1] == 1:\n check = 1\n break\n if check == 1:\n break\n \n if check == 0:\n print(\"SAFE\")\n else:\n print(\"UNSAFE\")", "res = []\nfor _ in range(int(input())):\n lst = []\n flag = 0\n n = int(input())\n for i in range(n):\n lst.append(list(map(int, input().split())))\n for i in lst:\n for j in range(n-1):\n if i[j] == i[j+1] == 1:\n res.append(\"UNSAFE\")\n flag = 1\n break\n if flag != 0:\n break\n for i in range(n-1):\n for j in range(n):\n if lst[i][j] == lst[i+1] == 1:\n res.append(\"UNSAFE\")\n flag = 1\n break\n if flag != 0:\n break\n if flag == 0:\n res.append(\"SAFE\")\nfor i in res:\n print(i)\n", "for _ in range(int(input())):\n n = int(input())\n a = []\n for i in range(n):\n a.append(list(map(int,input().split())))\n flag=1\n for i in range(n-1):\n for j in range(n-1):\n if(a[i][j]==1):\n if(a[i+1][j]==1 or a[i][j+1]==1):\n flag = 0\n break\n else:\n pass\n j = 0\n i = n-1\n while(j<n-1):\n if(a[i][j]==1):\n if(a[i][j+1]==1):\n flag = 0\n break\n else:\n pass\n j+=1\n i = 0\n j = n-1\n while(i<n-1):\n if(a[i][j]==1):\n if(a[i+1][j]==1):\n flag = 0\n break\n else:\n pass\n i+=1\n if(flag==1):\n print('SAFE')\n else:\n print('UNSAFE')", "# cook your dish here\nT = int(input())\nfor t in range(T):\n N = int(input())\n mat = []\n for i in range(N):\n mat.append(list(map(int, input().strip().split())))\n # print(mat)\n safe = True\n for i in range(N-1):\n for j in range(N-1):\n if mat[i][j] == 1:\n if mat[i+1][j] == 1:\n safe = False\n break\n if mat[i][j+1] == 1:\n safe = False\n break\n # if mat[i-1][j] == 1:\n # safe = False\n # break\n # if mat[i-1][j] == 1:\n # safe = False\n # break\n \n if not safe:\n # print(\"UNSAFE\")\n break\n if safe:\n print(\"SAFE\")\n else:\n print(\"UNSAFE\")\n \n"] | {"inputs": [["2", "4", "1 0 1 0", "0 0 0 1", "0 1 0 0", "1 0 0 1", "4", "1 0 1 0", "0 0 0 0", "1 0 1 1", "0 1 0 0"]], "outputs": [["SAFE", "UNSAFE"]]} | INTERVIEW | PYTHON3 | CODECHEF | 10,658 | |
63a42a72176c9c847e80a08bba22f942 | UNKNOWN | You are given a string S constisting of uppercase Latin letters. Is it possible to reorder the characters in this string to get a string with prefix "LTIME" and suffix "EMITL"?
We remind you that a prefix of a string is any substring which contains its first character, while a suffix of a string is substring containing its last character.
-----Input-----
The first line contains a single integer T, denoting the number of testcases. The descriptions of T test cases follow.
The first and only line of the test case description has one non-empty string S consisting of uppercase Latin letters only.
-----Output-----
For each testcase output a single line containing the string "YES" (without quotes) if it's possible to reorder the characters to get the required prefix and suffix, or "NO" (without quotes) otherwise.
-----Constraints-----
- Subtask 1 (23 points) : 1 ≤ T ≤ 100, 1 ≤ |S| ≤ 9
- Subtask 2 (77 points) : 1 ≤ T ≤ 1000, 1 ≤ |S| ≤ 100
-----Example-----
Input:3
LTIMEAZAZAITLME
LLLTTTIIIMMMEEEAHA
LTIMEM
Output:YES
YES
NO
-----Explanation-----
Test case 1: we can permute the last 5 letters and get LTIMEAZAZAEMITL
Test case 2: we have 3 copies of each of the letters 'L', 'T', 'I', 'M', 'E' so we can leave 5 of them in the beginning and move 5 of them to the end.
Test case 3: we have only one letter 'L' so we can't make necessary prefix and suffix at the same time. | ["# cook your dish here\nfrom collections import Counter\nfor i in range(int(input())):\n s=input().upper()\n res=Counter(s)\n if res[\"L\"]>=2 and res[\"T\"]>=2 and res[\"I\"]>=2 and res[\"M\"]>=2 :\n if len(s)==9:\n if res[\"E\"] >=1 :\n print(\"YES\")\n else:\n print(\"NO\")\n elif len(s)>9:\n if res[\"E\"]>=2:\n print(\"YES\")\n else:\n print(\"NO\")\n else:\n print(\"NO\")\n else:\n print(\"NO\")\n \n", "# cook your dish here\nfrom collections import Counter\nfor _ in range(int(input())):\n s=input()\n c=Counter(s)\n #LTIME\n if c['L']>=2 and c['T']>=2 and c['I']>=2 and c['M']>=2:\n \n if len(s)==9:\n if c['E']>=1:\n print('YES')\n else:\n print('NO')\n \n elif len(s)>9:\n if c['E']>=2:\n print('YES')\n else:\n print('NO')\n else:\n print('NO')\n else:\n print('NO')\n \n", "# cook your dish here\nfrom collections import Counter\nfor _ in range(int(input())):\n s=input()\n c=Counter(s)\n #LTIME\n if c['L']>=2 and c['T']>=2 and c['I']>=2 and c['M']>=2:\n \n if len(s)==9:\n if c['E']>=1:\n print('YES')\n else:\n print('NO')\n \n elif len(s)>9:\n if c['E']>=2:\n print('YES')\n else:\n print('NO')\n else:\n print('NO')\n else:\n print('NO')\n \n", "# cook your dish here\nfrom collections import Counter\nfor _ in range(int(input())):\n \n c=Counter(input())\n #LTIME\n if c['L']>=2 and c['T']>=2 and c['I']>=2 and c['M']>=2 and c['E']>=1:\n print('YES')\n else:\n print('NO')\n \n", "# cook your dish here\nt=int(input())\nwhile t:\n s=input()\n f=1\n for i in 'MITL':\n if s.count(i)<2:\n f=0\n break\n if f:\n if len(s)==9:\n if s.count('E'):\n print(\"YES\")\n else:\n print(\"NO\")\n else:\n if s.count('E')>1:\n print(\"YES\")\n else:\n print(\"NO\")\n else:\n print(\"NO\")\n t-=1", "# cook your dish here\nfor i in range(int(input())):\n s = input()\n n = len(s)\n L,T,M,I,E=0,0,0,0,0\n for i in range(n):\n if s[i]==\"L\":\n L=L+1\n elif s[i]==\"T\":\n T=T+1\n elif s[i]==\"I\":\n I=I+1\n elif s[i]==\"M\":\n M=M+1\n elif s[i]==\"E\":\n E=E+1\n if L>1 and T>1 and I>1 and M>1 and E>1:\n print(\"YES\")\n elif L==2 and T==2 and I==2 and M==2 and (E==1 or E==2):\n print(\"YES\")\n elif n==5 and L==1 and T==1 and I==1 and M==1 and E==1:\n print(\"YES\")\n else:\n print(\"NO\")", "for _ in range(int(input())):\n s=input()\n flag=0\n if len(s)<9:\n flag=1\n else: \n if s.count('L')<2 or s.count('T')<2 or s.count('I')<2 or s.count('M')<2:\n flag=1\n if ((s.count('E')==1 and len(s)==9) or (s.count('E')>=2)) and flag!=1:\n flag=0\n else:\n flag=1\n if flag==1:\n print(\"NO\")\n else:\n print(\"YES\")", "# cook your dish here\nfor _ in range(int(input())):\n s=input()\n flag=0\n if len(s)<9:\n flag=1\n else: \n if s.count('L')<2 or s.count('T')<2 or s.count('I')<2 or s.count('M')<2:\n flag=1\n if ((s.count('E')==1 and len(s)==9) or (s.count('E')>=2)) and flag!=1:\n flag=0\n else:\n flag=1\n if flag==1:\n print(\"NO\")\n else:\n print(\"YES\")", "t=int(input())\nfor _ in range(t):\n s=input()\n d={}\n for i in s:\n try:\n d[i]+=1\n except:\n d[i]=1\n if len(s)<5:\n print('NO')\n elif len(s)==5:\n s=sorted(s)\n if \"\".join(s)==\"EILMT\":\n print('YES')\n else:\n print('NO')\n else:\n a=0\n s=sorted(s)\n if \"\".join(s)==\"EIILLMMTT\":\n print('YES')\n else:\n k='LTIME'\n a=0\n for j in k:\n try:\n x=d[j]\n if x>=2:\n a+=1\n except:\n pass\n if a==5:\n print('YES')\n else:\n print('NO')\n", "# cook your dish here\nfor _ in range(int(input())):\n s=input()\n s1=s2=s3=s4=s5=0\n for i in range(len(s)):\n if s[i]=='L':\n s1+=1\n if s[i]=='T':\n s2+=1\n if s[i]=='I':\n s3+=1\n if s[i]=='M':\n s4+=1\n if s[i]=='E':\n s5+=1\n if s1>=2 and s2>=2 and s3>=2 and s4>=2 and s5>=2 and len(s)>9:\n print(\"YES\")\n elif s1>=2 and s2>=2 and s3>=2 and s4>=2 and s5>=1 and len(s)==9:\n print(\"YES\")\n else:\n print(\"NO\")", "t = int(input())\nfor T in range(t):\n s = input()\n l = s.count(\"L\")\n t = s.count(\"T\")\n i = s.count(\"I\")\n m = s.count(\"M\")\n e = s.count(\"E\")\n\n if min(l, t, i, m, e) >= 2 and len(s) > 9:\n print(\"YES\")\n elif min(l, t, i, m) >= 2 and e >= 1 and len(s) == 9:\n print(\"YES\")\n else:\n print(\"NO\")\n", "# God Bless\ndef possible(s):\n for i in \"LTIM\":\n if s.count(i) < 2:\n return False\n \n if len(s)==9:\n if s.count('E') < 1:\n return False\n else:\n if s.count('E') < 2:\n return False\n \n return True\n\nfor T in range(int(input())):\n S = input()\n \n if possible(S):\n print('YES')\n else:\n print('NO')"] | {"inputs": [["3", "LTIMEAZAZAITLME", "LLLTTTIIIMMMEEEAHA", "LTIMEM"]], "outputs": [["YES", "YES", "NO"]]} | INTERVIEW | PYTHON3 | CODECHEF | 4,650 | |
33f08add2bda9d4ee862c3426fd3882d | UNKNOWN | As we all know, F.C. Barcelona is the best soccer team of our era! Their entangling and mesmerizing game style usually translates into very high ball possession, consecutive counter-attack plays and goals. Lots of goals, thanks to the natural talent of their attacker and best player in history, Lionel Andres Messi.
However, at the most prestigious tournament of individual teams, the UEFA Champions League, there are no guarantees and believe it or not, Barcelona is in trouble.... They are tied versus Chelsea, which is a very defending team that usually relies on counter-strike to catch opposing teams off guard and we are in the last minute of the match. So Messi decided to settle things down for good and now he is conducting the ball on his teams' midfield and he will start a lethal counter-attack :D
After dribbling the 2 strikers from Chelsea, he now finds himself near the center of the field and he won't be able to dribble the entire team on his own, so he will need to pass the ball to one of his teammates, run forward and receive the ball once again to score the final goal.
Exactly K players are with him on his counter-attack and the coach, Tito Villanova knows that this counter-attack will end in a goal only if after exactly N passes are performed between the players, Messi ends up with the ball.
(Note that the ball only needs to end with Messi after exactly N passes are performed between all the K+1 players, i.e. Messi can receive the ball several times during the N passes. See the 2nd test case explanation for further clarification. )
However, he realized that there are many scenarios possible for this, so he asked you, his assistant coach, to tell him in how many ways can Messi score the important victory goal. So help him!!
-----Input-----
Input will contain a number T denoting the number of test cases.
Then T test cases follow, each one consisting of two space-sparated integers N and K.
-----Output-----
For each test case, output a single integer, the number of ways the winning play might happen modulo 1000000007 (109+7).
-----Constraints-----
- 1 ≤ T ≤ 100
- 2 ≤ N ≤ 1000
- 1 ≤ K ≤ 10
-----Example-----
Input:
2
2 4
4 2
Output:
4
6
-----Explanation-----
In the first test case, say four players with Messi are Xavi, Busquets, Iniesta and Jordi Alba. Then the ways of the winning play to happen when exactly 2 passes are to be performed are:
1) Messi - Xavi - Messi
2) Messi - Busquets - Messi
3) Messi - Iniesta - Messi
4) Messi - Alba - Messi
In the second test case, also say that two players with Messi are Xavi and Iniesta. There are 6 ways for the winning play to happen when exactly 4 passes are performed. All the examples of such winning play are:
1) Messi - Xavi - Messi - Iniesta - Messi
2) Messi - Xavi - Iniesta - Xavi - Messi
3) Messi - Xavi - Messi - Xavi - Messi
4) Messi - Iniesta - Messi - Iniesta - Messi
5) Messi - Iniesta - Messi - Xavi - Messi
6) Messi - Iniesta - Xavi - Iniesta - Messi | ["T = int(input())\nfor _ in range(T):\n p,n=map(int,input().split())\n mod = 1000000007\n if p == 2:\n print(n)\n else:\n f=n\n t=n\n for i in range(p-2):\n f=(f%mod*n)%mod\n a=(f-t+mod)%mod\n t=a\n print(a)", "T = int(input())\nfor _ in range(T):\n p,n=map(int,input().split())\n mod = 1000000007\n if p == 2:\n print(n)\n else:\n f=n\n t=n\n for i in range(p-2):\n f=(f%mod*n)%mod\n a=(f-t+mod)%mod\n t=a\n print(a)", "# cook your dish here\n\nfor _ in range(int(input())):\n n, k = [int(i) for i in input().split()]\n A = [[1],[0]]\n for i in range(1, n + 1):\n A[0].append(k * A[1][i - 1])\n A[1].append(A[0][i - 1] + (k - 1) * A[1][i - 1])\n print(A[0][n] % (10**9+7))\n\n\n\n", "e=10**9+7\nt=int(input())\nfor _ in range(t):\n n,k=list(map(int,input().split()))\n messi=0\n non_messi=k\n for i in range(n-2):\n z = non_messi\n non_messi =(messi*k+z*(k-1))%e\n messi=z\n \n print(non_messi)\n", "# cook your dish here\ns=pow(10,9)+7\na=[[0 for i in range(11)]for j in range(1001)]\nfor i in range(1,11):\n a[2][i]=i\nfor n in range(3,1001):\n for k in range(1,11):\n a[n][k]=pow(k,n-1,s)-a[n-1][k]\n if(a[n][k]<0):\n a[n][k]+=s\nt=int(input())\nfor i in range(t):\n inp = list(map(int,input().split()))\n n=inp[0]\n k=inp[1]\n print(a[n][k])", "t=int(input())\nwhile(t>0):\n n,k=map(int,input().split())\n j=(k**n+k*((-1) ** n))//(k+1)\n\n j=j%1000000007\n print(j)\n t-=1", "# cook your dish here\nt=int(input())\nfor i in range(t):\n n,k=list(map(int,input().split(\" \")))\n sum=0\n z=0\n while(n>1):\n sum+=(k**(n-1))*((-1)**z)\n n-=1\n z+=1\n print(sum%1000000007)\n\n", "t=int(input())\nwhile(t>0):\n n,k=list(map(int,input().split()))\n j=(k**n+k*((-1) ** n))//(k+1)\n # j=(k**n+k*((-1)**n))//k+1\n #print(j)\n j=j%1000000007\n print(j)\n t-=1\n", "mod = int(1e9+7)\n\nfor _ in range(int(input())):\n n, k = map(int, input().split())\n ans = (k ** n + k * ((-1) ** n)) // (k + 1)\n print(ans % mod)", "mod = int(1e9+7)\n\nfor _ in range(int(input())):\n n, k = map(int, input().split())\n ls = [0] * (n + 1)\n ls[0], ls[1] = 1, 0\n for i in range(2, n+1):\n ls[i] = ((k-1) * ls[i-1] + k * ls[i-2]) % mod\n print(ls[n])", "t=int(input())\n\nfor i in range(t):\n arr = input()\n l = list(map(int,arr.split(' ')))\n n=l[0]\n k=l[1]\n f=[]\n f.append(k)\n f.append(k*(k-1))\n if(n==2):\n print(f[0]%1000000007)\n if(n==3):\n print(f[-1]%1000000007)\n if(n>3):\n for j in range(n-3):\n f.append((f[-2]*k)+((k-1)*f[-1]))\n #print(f)\n print(f[-1]%1000000007)\n\n\n \n"] | {"inputs": [["2", "2 4", "4 2"]], "outputs": [["4", "6"]]} | INTERVIEW | PYTHON3 | CODECHEF | 2,519 | |
9a827e8975afc46d44a19861700a8ae3 | UNKNOWN | Raj is suffering from shot term memory loss so he is unable to remember his laptop password but he has a list of some string and the only thing that he remember about his password is alphanumeric and also that all the characters are unique.
Given a list of strings, your task is to find a valid password.
-----Input-----
Each String contains lower case alphabets and 0-9.
-----Output-----
print "Invalid"(without quotes) if password is not valid else print "Valid"(without quotes) and stop processing input after it.
-----Constraints-----
1<=length of string <=100
-----Example-----
Input:
absdbads
asdjenfef
tyerbet
abc564
Output:
Invalid
Invalid
Invalid
Valid | ["import collections\n\nwhile True:\n d = input().strip()\n myCounter = collections.Counter(d)\n flag = 1\n\n for x in list(myCounter.keys()):\n if myCounter[x] > 1:\n flag = 0\n break\n\n isAlp = sum([myCounter[x] for x in list(myCounter.keys()) if x.isalnum()])\n\n if flag and isAlp:\n print(\"Valid\")\n break\n else:\n print(\"Invalid\")\n", "def password():\n \n\n while True:\n st=input()\n ls=list(st)\n ln=len(st)\n c=0\n fl=0\n \n for i in range(0,ln):\n \n \n if(ord(ls[i])<=122 and ord(ls[i])>=97):\n c=1\n \n elif ls[i].isdigit():\n fl=1\n \n a=1\n for i in range(0,ln-1):\n for j in range(i+1,ln):\n if(ls[i]==ls[j]):\n a=a+1 \n if(c==1 and fl==1 and a==1):\n print(\"Valid\")\n break\n else:\n print(\"Invalid\")\n \n \npassword()", "def findPassword():\n m = \"Invalid\"\n while(m != \"Valid\"):\n x = input() \n t = 1\n flag = 0\n for i in x:\n if x.count(i) > 1:\n print(\"Invalid\")\n t = 0\n break\n if i.isdigit():\n flag = 1\n if flag == 1 and t != 0:\n print(\"Valid\")\n m = \"Valid\"\n elif t == 1:\n print(\"Invalid\")\n #else:\n #print \"Invalid\"\nfindPassword()", "f = False\nwhile f == False:\n s = input().strip()\n d = dict()\n f = True\n for i in s:\n if i in list(d.keys()):\n f = False\n else:\n d[i] = 1\n if not f : print(\"Invalid\")\n else : print(\"Valid\")", "def password():\n \n\n while True:\n st=input()\n ls=list(st)\n ln=len(st)\n c=0\n fl=0\n \n for i in range(0,ln):\n \n \n if(ord(ls[i])<=122 and ord(ls[i])>=97):\n c=1\n \n elif ls[i].isdigit():\n fl=1\n \n a=1\n for i in range(0,ln-1):\n for j in range(i+1,ln):\n if(ls[i]==ls[j]):\n a=a+1 \n if(c==1 and fl==1 and a==1):\n print(\"\\nValid\")\n break\n else:\n print(\"\\nInvalid\")\n \n \npassword()", "\ndef findPassword():\n flag = 0\n t = 1\n m = \"Invalid\"\n while(m != \"Valid\"):\n x = input() \n t = 1\n flag = 0\n for i in x:\n if x.count(i) > 1:\n print(\"Invalid\")\n t = 0\n break\n if i.isdigit():\n flag = 1\n if flag == 1 and t != 0:\n print(\"Valid\")\n m = \"Valid\"\n #else:\n #print \"Invalid\"\nfindPassword()", "def password():\n \n\n while True:\n st=input()\n ls=list(st)\n ln=len(st)\n c=0\n fl=0\n \n for i in range(0,ln):\n \n \n if(ord(ls[i])<=122 and ord(ls[i])>=97):\n c=1\n \n elif ls[i].isdigit():\n fl=1\n \n a=1\n for i in range(0,ln-1):\n for j in range(i+1,ln):\n if(ls[i]==ls[j]):\n a=a+1 \n if(c==1 and fl==1 and a==1):\n print(\"Valid\")\n break\n else:\n print(\"Invalid\\n\")\n \n \npassword()", "from sys import stdin\na = stdin.readlines()\nfor i in a:\n b = list(i.strip())\n ans = 'Invalid'\n if len(b)==len(set(b)):\n ans = 'Valid'\n print(ans)\n break\n print(ans)", "def password():\n \n\n while True:\n st=input()\n ls=list(st)\n ln=len(st)\n c=0\n fl=0\n \n for i in range(0,ln):\n \n \n if(ord(ls[i])<=122 and ord(ls[i])>=97):\n c=1\n \n elif ls[i].isdigit():\n fl=1\n \n a=1\n for i in range(0,ln-1):\n for j in range(i+1,ln):\n if(ls[i]==ls[j]):\n a=a+1 \n if(c==1 and fl==1 and a==1):\n print(\"\\nValid\")\n break\n else:\n print(\"\\nInvalid\")\n \n \npassword()", "def password():\n \n\n while True:\n st=input()\n ls=list(st)\n ln=len(st)\n c=0\n fl=0\n \n for i in range(0,ln):\n \n \n if(ord(ls[i])<=122 and ord(ls[i])>=97):\n c=1\n \n elif ls[i].isdigit():\n fl=1\n \n a=1\n for i in range(0,ln-1):\n for j in range(i+1,ln):\n if(ord(ls[i])>=97 and ord(ls[i])<=122 and ls[i]==ls[j]):\n a=a+1 \n if(c==1 and fl==1 and a==1):\n print(\"Valid\\n\")\n break\n else:\n print(\"Invalid\\n\")\n \n \npassword()", "while True:\n x=input()\n dic={}\n for i in range(len(x)):\n if x[i] in dic:\n dic[x[i]]+=1\n else:\n dic[x[i]]=1\n if len(dic)==len(x):\n if x.isalnum()==True:\n print(\"Valid\")\n break\n else:\n print(\"Invalid\")\n else:\n print(\"Invalid\")", "def password():\n \n\n while True:\n st=input()\n ls=list(st)\n ln=len(st)\n c=0\n fl=0\n \n for i in range(0,ln):\n \n \n if(ord(ls[i])<=122 and ord(ls[i])>=97):\n c=1\n \n elif ls[i].isdigit():\n fl=1\n \n a=1\n for i in range(0,ln-1):\n for j in range(i+1,ln):\n if(ord(ls[i])>=97 and ord(ls[i])<=122 and ls[i]==ls[j]):\n a=a+1 \n if(c==1 and fl==1 and a==1):\n print(\"\\nValid\")\n break\n else:\n print(\"\\nInvalid\")\n \n \npassword()", "while True:\n a = input()\n if len(a):\n if a.isalnum():\n if len(a) == len(set(list(a))):\n print(\"Valid\");break\n else:print(\"Invalid\")\n else:print(\"Invalid\")\n else:break", "def password():\n \n\n while True:\n str=input()\n ls=list(str)\n ln=len(str)\n c=0\n fl=0\n \n for i in range(0,ln):\n \n \n if(ord(ls[i])<=122 and ord(ls[i])>=97):\n c=1\n \n elif ls[i].isdigit():\n fl=1\n a=1\n for i in range(0,ln):\n \n for j in range(i+1,ln):\n if(ls[i]==ls[j]):\n a+=1 \n if(c==1 and fl==1 and a==1):\n print(\"\\nValid\")\n break\n else:\n print(\"\\nInvalid\")\n \n \npassword()", "try:\n while True:\n password=list(input().strip())\n temp=password[:]\n for i in password:\n if i.isdigit():\n temp.remove(i)\n password1=set(temp)\n #print password1,temp\n if len(password1)!=len(temp):\n print('Invalid')\n else:\n print('Valid')\n 4/0\nexcept:\n return\n", "while True :\n s = input()\n t = ''.join(set(s))\n if len(s) != len(t) or (not s.isalnum()) :\n print('Invalid')\n continue\n print('Valid')\n break", "import collections\nwhile True:\n list1 = []\n c = input()\n flag = 1\n d = collections.Counter(c)\n for x in list(d.keys()):\n if d[x] > 1:\n flag = 0\n break\n temp1 = sum([d[x] for x in list(d.keys()) if x.isalnum])\n\n if flag and temp1:\n print(\"Valid\")\n break\n\n else:\n print(\"Invalid\")", "import collections\nwhile True:\n list1 = []\n c = input()\n flag = 1\n flag2 = 0\n d = collections.Counter(c)\n for x in list(d.keys()):\n if d[x] > 1:\n flag = 0\n break\n\n temp1 = sum([d[x] for x in list(d.keys()) if x.isalpha()])\n temp2 = sum([d[x] for x in list(d.keys()) if x.isdigit()])\n\n if flag and temp1 and temp2:\n print(\"Valid\")\n break\n\n else:\n print(\"Invalid\")"] | {"inputs": [["absdbads", "asdjenfef", "tyerbet", "abc564"]], "outputs": [["Invalid", "Invalid", "Invalid", "Valid"]]} | INTERVIEW | PYTHON3 | CODECHEF | 6,329 | |
42415e4bc191b27623827cbaba9a4b10 | UNKNOWN | The chef is trying to solve some pattern problems, Chef wants your help to code it. Chef has one number K to form a new pattern. Help the chef to code this pattern problem.
-----Input:-----
- First-line will contain $T$, the number of test cases. Then the test cases follow.
- Each test case contains a single line of input, one integer $K$.
-----Output:-----
For each test case, output as the pattern.
-----Constraints-----
- $1 \leq T \leq 100$
- $1 \leq K \leq 100$
-----Sample Input:-----
4
1
2
3
4
-----Sample Output:-----
1
21
*1
321
*21
**1
4321
*321
**21
***1
-----EXPLANATION:-----
No need, else pattern can be decode easily. | ["for _ in range(int(input())):\r\n n = int(input())\r\n s = [str(i) for i in range(n,0,-1)]\r\n for i in range(n):\r\n print('*'*i+''.join(s))\r\n del(s[0])", "for i in range(int(input())):\n p=int(input())\n for i in range(p):\n for k in range(i):\n print(\"*\", end=\"\")\n for j in range(i,p):\n print(p-j, end=\"\")\n print()\n ", "try:\n\tfor _ in range(int(input())):\n\t\tn=int(input())\n\t\tL=[*map(lambda i: str(i), range(n,0,-1))]\n\t\tprint(\"\".join(L))\n\t\tfor i in range(len(L)-1):\n\t\t\tL[i]=\"*\"\n\t\t\tprint(\"\".join(L))\nexcept: pass", "try:\r\n\tfor _ in range(int(input())):\r\n\t\tn=int(input())\r\n\t\tL=[*[str(i) for i in range(n,0,-1)]]\r\n\t\tprint(\"\".join(L))\r\n\t\tfor i in range(len(L)-1):\r\n\t\t\tL[i]=\"*\"\r\n\t\t\tprint(\"\".join(L))\r\nexcept: pass\r\n", "from sys import*\r\ninput=stdin.readline\r\nt=int(input())\r\nfor _ in range(t):\r\n n=int(input())\r\n c=0\r\n for i in range(n):\r\n d=c\r\n for j in range(n,0,-1):\r\n if d>0:\r\n print(\"*\",end=\"\")\r\n d-=1\r\n else:\r\n print(j,end=\"\")\r\n c+=1\r\n print()\r\n", "# cook your dish here\nt=int(input())\nfor i in range(t):\n n=int(input())\n if(n==1):\n print(1)\n else:\n a=\"\"\n l=0\n for k in range(n):\n a=\"\"\n a=a+'*'*l\n for j in range(n-l,0,-1):\n a=a+str(j)\n l+=1\n print(a)", "# cook your dish here\nt=int(input())\nwhile(t>0):\n n=int(input())\n c=0\n for i in range(1,n+1):\n print('*'*c,end='')\n for j in range(n-i+1,0,-1):\n print(j,end='')\n c=c+1\n print()\n t=t-1", "for _ in range(int(input())):\n n = int(input())\n if n == 1:\n print(1)\n continue\n ans = \"\"\n ctr = 0\n for i in range(n):\n ans = \"\"\n for j in range(ctr):\n ans+='*'\n for j in range(n - ctr, 0, -1):\n ans += str(j)\n print(ans)\n ctr += 1\n", "# cook your dish here\nt=int(eval(input(\"\")))\nwhile(t!=0):\n k=int(eval(input(\"\")))\n s=''\n for i in range(k,0,-1):\n #print(i)\n for j in range(k,0,-1):\n if i>=k and j==i:\n s=s+str(j)\n continue\n if i<k and j>i:\n s=s+'*'\n else:\n s=s+str(j)\n print(s)\n s=''\n t-=1\n", "# cook your dish here\n\nfor _ in range(int(input())):\n k=int(input())\n for i in range(k):\n print('*'*i,end='')\n for j in range(k-i,0,-1):\n print(j,end=\"\")\n print()", "# cook your dish here\nfor a0 in range(int(input())):\n n = int(input())\n l = []\n for i in range(1,n+1):\n l.append(str(i))\n l = l[::-1]\n s = \"\"\n for i in l:\n s+=i\n print(s)\n i = 0\n while len(set(l))>2 or \"2\" in l:\n l[i] = \"*\"\n s = \"\"\n for j in l:\n s+=j\n print(s)\n \n i+=1\n \n \n", "# cook your dish here\n\nt = int(input())\n\nwhile t:\n n = int(input())\n \n \n for i in range(n):\n for j in range(i, 0, -1):\n print('*', end='')\n for j in range(n - i, 0, -1):\n print(j, end='')\n print()\n \n t -= 1\n", "# cook your dish here\nt=int(input())\nfor i in range(0,t):\n my_inp = int(input().strip())\n for abc in range(my_inp):\n for xyz in range(1,abc+1):\n print('*',end=\"\")\n for xyz in range(my_inp-abc):\n print(my_inp-abc-xyz,end=\"\")\n\n print()", "# cook your dish here\ndef solve():\n n=int(input())\n i=0\n while i<n:\n j=n-i\n for l in range(i):\n print(\"*\",end=\"\")\n while(j>=1):\n print(j,end=\"\")\n j-=1\n print() \n \n i+=1 \n\nt=int(input())\ni=0\nwhile(i<t):\n solve()\n i+=1", "for _ in range(int(input())):\n n=int(input())\n for _ in range(n,0,-1):\n x=_\n print('*'*(n-_),end=\"\")\n for _ in range(x):\n print(x-_,end=\"\")\n print() \n ", "for u in range(int(input().strip())):\r\n n = int(input().strip())\r\n for i in range(n):\r\n for space in range(1,i+1):\r\n print('*',end=\"\")\r\n for j in range(n-i):\r\n print(n-i-j,end=\"\")\r\n \r\n print()", "def solve():\n n=int(input())\n i=0\n while i<n:\n j=n-i\n for l in range(i):\n print(\"*\",end=\"\")\n while(j>=1):\n print(j,end=\"\")\n j-=1\n print() \n \n i+=1 \n\nt=int(input())\ni=0\nwhile(i<t):\n solve()\n i+=1# cook your dish here\n", "# cook your dish here\nfor i in range(int(input())):\n n = int(input())\n for i in range(n,0,-1):\n temp = i\n val = n-temp\n while(val!=0):\n print(\"*\",end=\"\")\n val-=1\n \n while(temp!=0):\n print(temp,end=\"\")\n temp-=1\n \n print()", "\r\nt=int(input())\r\nwhile t>0:\r\n t-=1\r\n n=int(input())\r\n a=[]\r\n for i in range(1,n+1):\r\n a.append(i)\r\n a=a[::-1]\r\n for j in a:\r\n print(j,end=\"\")\r\n print()\r\n for i in range(n-1):\r\n a[i]=\"*\"\r\n for j in a:\r\n print(j,end=\"\")\r\n print()\r\n", "for i in range(int(input())):\n s=int(input())\n for i in range(s):\n for k in range(i):\n print(\"*\", end=\"\")\n for j in range(i,s):\n print(s-j, end=\"\")\n print()# cook your dish here\n", "for _ in range(int(input())):\n n = int(input())\n for i in range(n, 0, -1):\n print('*' * (n - i), end = '')\n for j in range(i, 0, -1): print(j, end = '')\n print()", "n=int(input())\r\nfor i in range(n):\r\n a=int(input())\r\n for j in range(a,0,-1):\r\n for k in range(a-j):\r\n print(\"*\",end=\"\")\r\n for k in range(j,0,-1):\r\n print(k,end=\"\")\r\n print()", "# cook your dish here\nfor _ in range(int(input())):\n n=int(input())\n for i in range(1,n+1):\n for j in range(1,i):\n print(\"*\",end=\"\")\n for j in range(n-i+1,0,-1):\n print(j,end=\"\")\n\n\n print()"] | {"inputs": [["4", "1", "2", "3", "4"]], "outputs": [["1", "21", "*1", "321", "*21", "**1", "4321", "*321", "**21", "***1"]]} | INTERVIEW | PYTHON3 | CODECHEF | 6,575 | |
071ba062410b491df4cd3d3589c47e27 | UNKNOWN | Bohan loves milk tea so much and he drinks one cup of milk tea every day. The local shop sells milk tea in two sizes: a Medium cup for $3 and a Large cup for $4. For every cup of milk tea purchased Bohan receives a promotional stamp. Bohan may redeem 6 stamps for a free drink of milk tea regardless of the size. No stamp will be given for a free drink.
Determine the amount of money Bohan have spent on milk tea, given a sequence of milk tea sizes he got in the past a few days. Assume Bohan had no stamps in the beginning and he always redeemed the stamps for the next drink once he had collected 6 stamps.
-----Input-----
The input begins with the number of test cases T.
Each test case has a single line of letters. The i-th letter is either 'M' or 'L' denoting a Medium cup or a Large cup of milk tea Bohan got on the i-th day.
-----Output-----
For each case, output the amount of money in dollars Bohan have spent on milk tea.
-----Constraints-----
- T ≤ 100
- 1 ≤ length of each sequence ≤ 100
-----Example-----
Input:
3
MLM
MMLLMMLL
MMMMMMML
Output:
10
24
22
-----Explanation-----
Example 1: Bohan didn't redeem any stamps.
Example 2: Bohan redeemed 6 stamps for the Large cup of milk tea on the 7th day.
Example 3: Bohan redeemed 6 stamps for the Medium cup of milk tea on the 7th day. | ["t = int(input())\nfor tc in range(t):\n seq = input()\n dollar = 0\n stamp = 0\n for ct in seq:\n if stamp >= 6:\n stamp -= 6\n continue\n elif ct == 'M':\n dollar += 3\n elif ct == 'L':\n dollar += 4\n stamp += 1\n print(dollar)\n\n\n", "t=int(input())\nwhile t>0:\n t-=1\n s=input()\n val=0\n ctr=0\n for i in s:\n if ctr==6:\n ctr=0\n else:\n if i=='M':\n val+=3\n ctr+=1\n else:\n val+=4\n ctr+=1\n print(val)\n", "t = eval(input())\nwhile t>0 :\n p = input()\n count = 0\n cost = 0\n i=0\n while i<len(p):\n if count == 6:\n count = 0\n i = i +1\n continue\n if p[i] == 'M':\n cost = cost + 3\n else:\n cost = cost + 4\n count = count +1\n i = i+1\n print(cost)\n t = t-1", "t=int(input())\nfor _ in range(t):\n a=input()\n c=0\n m=0\n for i in range(len(a)):\n if c==6:\n c=0\n continue\n if a[i]=='M':\n m+=3\n c+=1\n continue\n if a[i]=='L':\n m+=4\n c+=1\n continue\n print(m)", "for _ in range(eval(input())):\n l=list(map(str,input().strip()))\n print(sum([3 if j=='M' else 4 for i,j in enumerate(l) if (i+1)%7!=0]))\n", "def f(s):\n s=list(s)\n cost=count=0\n for i in s:\n if count==6:\n count=0\n continue\n else:\n count+=1\n if i==\"M\":\n cost+=3\n else:\n cost+=4\n return cost\nt=int(input())\nfor i in range(t):\n s=input()\n print(f(s))"] | {"inputs": [["3", "MLM", "MMLLMMLL", "MMMMMMML"]], "outputs": [["10", "24", "22"]]} | INTERVIEW | PYTHON3 | CODECHEF | 1,345 | |
aa4736a10b9a11e4622baebde19a762c | UNKNOWN | You are given two positive integers $N$ and $K$, where $K \le N$. Find a sequence $A_1, A_2, \ldots, A_N$ such that:
- for each valid $i$, $A_i$ is either $i$ or $-i$
- there are exactly $K$ values of $i$ such that $1 \le i \le N$ and $A_1 + A_2 + \ldots + A_i > 0$
If there are multiple solutions, you may print any one of them. It can be proved that at least one solution always exists.
-----Input-----
- The first line of the input contains a single integer $T$ denoting the number of test cases. The description of $T$ test cases follows.
- The first and only line of each test case contains two space-separated integers $N$ and $K$.
-----Output-----
For each test case, print a single line containing $N$ space-separated integers $A_1, A_2, \ldots, A_N$.
-----Constraints-----
- $1 \le T \le 1,000$
- $1 \le K \le N \le 1,000$
-----Subtasks-----
Subtask #1 (10 points): $N \le 10$
Subtask #2 (90 points): original constraints
-----Example Input-----
1
3 3
-----Example Output-----
1 2 3 | ["test=int(input())\nfor i in range(test):\n n,k=map(int,input().split())\n x=n-k\n for j in range(1,n+1):\n if(j%2==0 and x>0):\n print(-j,end=' ')\n x-=1\n elif(k<=0):\n print(-j,end=' ')\n else:\n print(j,end=' ')\n k-=1\n print()", "# cook your dish here\nimport math\n\ntry:\n tc = int(input())\n for _ in range(tc):\n n, k = list(map(int, input().split()))\n ans = []\n need = 0\n for i in range(1, n+1):\n if i % 2 != 0:\n ans.append(i)\n else:\n ans.append(-i)\n p = math.ceil(n/2)\n\n need = p - k if p > k else k-p\n\n if k < p:\n i = n-1\n while need > 0:\n if ans[i] > 0:\n ans[i] *= -1\n need -= 1\n i -= 1\n\n if k > p:\n i = n-1\n while need > 0:\n if ans[i] < 0:\n ans[i] *= -1\n need -= 1\n i -= 1\n print(*ans)\nexcept:\n pass\n", "# cook your dish here\nt=int(input())\nimport math\nwhile t:\n t=t-1\n n,k=input().split()\n n=int(n)\n k=int(k)\n l=[-1*(i+1) for i in range(n)]\n for i in range(1,n,2):\n l[i]=l[i]*(-1)\n #print(l)\n if k-(math.floor(n/2))>0:\n s=k-(math.floor(n/2))\n i=n-1\n while s:\n # print(s,i,l,\"**\")\n if l[i]<0:\n # print(s,i,l,\"*\")\n l[i]=(-1)*l[i]\n s=s-1\n i=i-1\n if (math.floor(n/2))-k>0:\n s=(math.floor(n/2))-k\n i=n-1\n while s:\n if l[i]>0:\n l[i]=(-1)*l[i]\n s=s-1\n i=i-1\n for i in range(n):\n print(l[i],end=\" \")", "# cook your dish here\nt=int(input())\nimport math\nwhile t:\n t=t-1\n n,k=input().split()\n n=int(n)\n k=int(k)\n l=[-1*(i+1) for i in range(n)]\n for i in range(1,n,2):\n l[i]=l[i]*(-1)\n #print(l)\n if k-(math.floor(n/2))>0:\n s=k-(math.floor(n/2))\n while s:\n for i in range(n-1,-1,-1):\n # print(i,s,\"*\",l)\n if l[i]<0:\n l[i]=(-1)*l[i]\n s=s-1\n break\n if (math.floor(n/2))-k>0:\n s=(math.floor(n/2))-k\n while s:\n for i in range(n-1,-1,-1):\n if l[i]>0:\n l[i]=(-1)*l[i]\n s=s-1\n break\n for i in range(n):\n print(l[i],end=\" \")", "t = int(input())\n\nwhile (t > 0):\n n, k = map(int, input().split())\n a = list()\n if 2*k <= n:\n for i in range(2*k):\n if i % 2 == 0:\n a.append(i+1)\n else:\n a.append(-i-1)\n for i in range(2*k, n, 1):\n a.append(-i-1)\n elif 2*k > n:\n for i in range(2*(n-k)):\n if i % 2 == 0:\n a.append(i+1)\n else:\n a.append(-i-1)\n for i in range(2*(n-k), n, 1):\n a.append(i+1)\n else:\n for i in range(2*k):\n if i % 2 == 0:\n a.append(i+1)\n else:\n a.append(-i-1)\n for i in a:\n print(i, end=\" \")\n t -= 1\n", "import sys\nimport math\nimport collections\nimport heapq\nimport queue\nimport itertools\nimport functools\nimport operator\nimport time\n\nreadline = sys.stdin.readline\n \nIPS = lambda: readline().rstrip()\nIP = lambda: int(readline().rstrip())\nMP = lambda: map(int, readline().split())\nLS = lambda: list(map(int, readline().split()))\nAR = lambda: [int(x) for x in readline().split()]\n\ndef solve():\n for _ in range(IP()):\n n,k = MP()\n \n ans = [-x for x in range(1,n+1)]\n \n ans[0] = -ans[0]\n k-=1\n \n i, j = 1, -1\n if n&1 == 1: j = n-1\n else: j = n-2\n \n while k>0:\n if(i<n): ans[i] = -ans[i]; i+=2\n elif j>0: ans[j] = -ans[j]; j-=2\n k -= 1 \n \n for a in ans: print(a,end=\" \")\n print()\n \ndef __starting_point():\n solve()\n__starting_point()", "test_case = int(input())\nfor i in range(0,test_case):\n line = input().split(' ')\n N = int (line[0])\n K = int (line[1])\n ans = []\n for i in range(1,N+1):\n if i%2==0:\n ans.append(0-i)\n else:\n ans.append(i)\n \n temp = K - int((N+1)/2)\n ind = N-1\n if temp>0:\n while temp>0:\n if ans[ind]<0:\n ans[ind] = 0-ans[ind]\n temp = temp - 1 \n ind = ind - 1\n else:\n temp = 0 - temp\n while temp>0:\n if ans[ind]>0:\n ans[ind] = 0-ans[ind]\n temp = temp -1\n ind = ind - 1\n for i in range(0,N):\n print(ans[i], end=\" \")\n print()", "t=int(input())\nwhile(t>0):\n n,k=map(int,input().split())\n cnt = n/2\n diff = n-k\n\n if(k>cnt):\n for i in range(1,n+1):\n if(diff>0 and i%2==1):\n diff-=1\n print(-i,end=\" \")\n else:\n print(i,end=\" \")\n\n else:\n for i in range(1, n + 1):\n if(k>0 and i%2==0):\n k=k-1\n print(i,end=\" \")\n else:\n print(-i,end=\" \")\n\n print()\n t=t-1\n", "import math\n \ntc = int(input())\n \nfor _ in range(tc):\n \n n, k = map(int, input().split())\n \n ans = []\n for i in range(1, n+1):\n if i % 2 != 0:\n ans.append(i)\n else:\n ans.append(-i)\n \n positive = math.ceil(n/2)\n \n if positive > k:\n i = n-1\n needed = positive-k\n while needed > 0:\n if ans[i] > 0:\n ans[i] *= -1\n needed -= 1\n i -= 1\n \n if positive < k:\n i = n-1\n needed = k-positive\n while needed > 0:\n if ans[i] < 0:\n ans[i] *= -1\n needed -= 1\n i -= 1\n \n print(*ans)", "# cook your dish here\nimport math\n \ntc = int(input())\n \nfor _ in range(tc):\n \n n, k = map(int, input().split())\n \n ans = []\n for i in range(1, n+1):\n if i % 2 != 0:\n ans.append(i)\n else:\n ans.append(-i)\n \n positive = math.ceil(n/2)\n \n if positive > k:\n i = n-1\n needed = positive-k\n while needed > 0:\n if ans[i] > 0:\n ans[i] *= -1\n needed -= 1\n i -= 1\n \n if positive < k:\n i = n-1\n needed = k-positive\n while needed > 0:\n if ans[i] < 0:\n ans[i] *= -1\n needed -= 1\n i -= 1\n \n print(*ans)", "# Post Prefixes\nfor t in range(int(input())):\n\n n, k = list(map(int, input().split())) # Two inputs\n flips = n - k\n A = []\n # Logic: Flip n-k numbers from i to (-i). First start with even numbers\n # beginning from 2. If n-k > n/2 ie no of flips is greater than even\n # numbers available, then flip remaining odd numbers starting from \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0the\n # back, ie bigger numbers till total (n-k) numbers are flipped.\n\n for i in range(n):\n a = i\n if (i + 1) % 2 == 0 and flips > 0: # If even and flips > 0, i = -i\n A.append(-(a+1))\n flips -= 1\n else:\n A.append(a+1)\n\n if flips > 0: # If no. of flips still exist\n if n % 2:\n last_odd = n-1 # List is 0 based\n else:\n last_odd = n-2\n\n while (flips > 0):\n A[last_odd] *= -1\n flips -= 1\n last_odd -= 2\n\n print(*A)\n\n", "import math\ntry :\n t=int(input())\n for i in range(t):\n n,k=map(int,input().split())\n h=math.ceil(n/2)\n l=[x*pow(-1,x+1) for x in range(1,n+1)]\n if k<h :\n for j in range(2*k,n):\n l[j]=-abs(l[j])\n elif k>h :\n if l[n-1]<0 : m=n-1\n else : m=n-2\n for j in range(k-h) :\n l[m]=-l[m]\n m=m-2\n for j in range(n):\n print(l[j],end=\" \")\n print()\nexcept :\n pass", "# cook your dish here\nimport math\ntry:\n t=int(input())\n for _ in range (t):\n n,k=list(map(int,input().split()))\n seq=[]\n for i in range(1,n+1):\n if i%2!=0:\n seq.append(i)\n else:\n seq.append(-i)\n positive=math.ceil(n/2)\n if(positive>k):\n i=n-1\n req=positive-k\n while (req>0):\n if seq[i]>0:\n seq[i] =-(i+1)\n req -=1\n i -=1\n if(positive<k):\n i=n-1\n req=k-positive\n while (req>0):\n if seq[i]<0:\n seq[i] =(i+1)\n req -=1\n i -=1\n print(*seq)\nexcept EOFError as t : pass\n \n", "# cook your dish here\nimport math\ntry:\n t=int(input())\n for _ in range (t):\n n,k=list(map(int,input().split()))\n seq=[]\n for i in range(1,n+1):\n if i%2!=0:\n seq.append(i)\n else:\n seq.append(-i)\n positive=math.ceil(n/2)\n if(positive>k):\n i=n-1\n req=positive-k\n while (req>0):\n if seq[i]>0:\n seq[i] *=-1\n req -=1\n i -=1\n if(positive<k):\n i=n-1\n req=k-positive\n while (req>0):\n if seq[i]<0:\n seq[i] *=-1\n req -=1\n i -=1\n print(*seq)\nexcept EOFError as t : pass\n \n", "for i in range(int(input())):\n n,k=list(map(int,input().split()))\n l=[]\n pos=0\n for i in range(1,n+1):\n if i%2==0:\n l.append(-1*i)\n else:\n l.append(i)\n pos+=1\n if pos<k:\n g=k-pos\n c=0\n for i in range(n-1,-1,-1):\n if l[i]<0:\n l[i]=-1*l[i]\n c+=1\n if c==g:\n break\n if pos>k:\n g=pos-k\n c=0\n for i in range(n-1,-1,-1):\n if l[i]>0:\n l[i]=-1*l[i]\n c+=1\n if c==g:\n break\n print(*l)\n\n", "# cook your dish here\nfrom math import ceil\nT = int(input())\nfor _ in range(T):\n N, K = map(int,input().split())\n L = []\n for i in range(1, N+1):\n if i%2==0:\n L.append(-i)\n else:\n L.append(i)\n C=ceil(N/2) \n if K<=C: \n d=C-K\n \n c=0\n for i in range(N-1,-1,-1):\n if c==d:\n break\n if L[i]>0:\n L[i]=-(L[i])\n c+=1\n else:\n d=K-C \n c=0\n for i in range(N-1,-1,-1):\n if c==d:\n break\n if L[i]<0:\n L[i]=abs(L[i])\n c+=1\n print(*L)", "\n# cook your dish here\nfor _ in range(int(input())):\n\n n, k = map(int, input().split())\n\n arr = []\n for i in range(n):\n if i%2==0:\n arr.append(i+1)\n else:\n arr.append(-i-1)\n\n pos = (n//2) + (n%2)\n neg = n//2\n \n if k<pos:\n for i in range(n-1, -1, -1):\n if k==pos:\n break\n if arr[i]>0:\n arr[i] = -arr[i]\n pos -= 1\n else:\n for i in range(n-1, -1, -1):\n if k==pos:\n break\n if arr[i]<0:\n arr[i] = -arr[i]\n pos += 1\n \n print(*arr)", "# cook your dish here\nfor i in range(int(input())):\n n,k=list(map(int,input().split()))\n arr=[1]\n p=1\n ne=0\n m=0\n for j in range(2,n+1):\n if j%2==0:\n if p!=k:\n arr.append(j)\n p+=1\n else:\n m=1\n break\n else:\n if ne!=(n-k):\n arr.append(-j)\n ne+=1\n else:\n m=-1\n break\n \n if abs(arr[-1])!=n and m==-1:\n for x in range(arr[-1]+1,n+1):\n arr.append(x)\n elif abs(arr[-1])!=n and m==1:\n \n for x in range(abs(arr[-1])+1,n+1):\n \n arr.append(-x)\n print(*arr)\n \n \n", "# cook your dish here\n# Let's hack this code.\n\nfrom sys import stdin, stdout\nimport math\nfrom itertools import permutations, combinations\nfrom collections import defaultdict\nfrom bisect import bisect_left, bisect_right \n\nmod = 1000000007\n\ndef L():\n return list(map(int, stdin.readline().split()))\n\ndef In():\n return map(int, stdin.readline().split())\n\ndef I():\n return int(stdin.readline())\n\ndef printIn(ob):\n return stdout.write(str(ob)+'\\n')\n\ndef powerLL(n, p):\n result = 1\n while (p):\n if (p&1):\n result = result * n % mod\n p = int(p / 2)\n n = n * n % mod\n return result\n\n#--------------------------------------\n\ndef myCode():\n n,k = In()\n seq = []\n for i in range(1,n+1):\n if i%2 == 0:\n seq.append(-i)\n else:\n seq.append(i)\n if k == math.ceil(n/2):\n print(*seq)\n elif k < math.ceil(n/2):\n req = abs(k - (math.ceil(n/2)))\n for i in range(n-1,-1,-1):\n if seq[i] > 0:\n seq[i] = -1 * seq[i]\n req -= 1\n if req == 0:\n break\n print(*seq)\n else:\n req = abs(k - (math.ceil(n/2)))\n for i in range(n-1,-1,-1):\n if seq[i] < 0:\n seq[i] = -1 * seq[i]\n req -= 1\n if req == 0:\n break\n print(*seq)\n \ndef main():\n for t in range(I()):\n myCode()\ndef __starting_point():\n main()\n__starting_point()", "# cook your dish her\nimport math\nt=int(input())\nwhile(t):\n n,k=list(map(int,input().split()))\n l=[]\n for i in range(1,n+1):\n if i%2==0:\n l.append(-i)\n else:\n l.append(i)\n mid=math.ceil(n/2)\n if mid>k:\n c=mid-k\n i=n-1\n while(c>0):\n if l[i]>0:\n l[i]=l[i]*-1\n c-=1\n i-=1\n if mid<k:\n c=k-mid\n j=n-1\n while(c>0):\n if l[j]<0:\n l[j]=l[j]*-1\n c-=1\n j-=1\n \n print(*l)\n t-=1\n", "for _ in range(int(input())):\n a,b=map(int,input().split())\n arr=[0]*a\n for i in range(a):\n arr[i]=i+1\n x=0\n b=a-b\n if(b>a//2):\n x=b-a//2\n b=a//2\n #print(b,x)\n for i in range(b):\n arr[(2*i)+1]*=-1\n if(a%2==0):\n for i in range(x):\n arr[a-2*i-2]*=-1\n if(a%2!=0):\n for i in range(x):\n arr[a-2*i-1]*=-1\n print(*arr)", "for _ in range(int(input())):\n N,K=map(int,input().split())\n cumsum=0\n coupo=0\n coune=0\n for i in range(N):\n if coupo==K:\n print(-(i+1), end=' ')\n coune+=1\n continue\n elif coune==N-K:\n print((i+1), end=' ')\n coupo+=1\n continue\n a=cumsum+(i+1)\n b=cumsum-(i+1)\n if abs(a)>abs(b):\n cumsum=b\n print(-(i+1), end=' ')\n else:\n cumsum=a\n print((i+1), end=' ')\n if cumsum>0:\n coupo+=1\n else:\n coune+=1\n \n \n \n", "for _ in range(int(input())):\n N,K=map(int,input().split())\n po=K\n ne=N-K\n arr=[]\n cumsum=0\n coupo=0\n coune=0\n for i in range(N):\n if coupo==K:\n arr.append(-(i+1))\n coune+=1\n continue\n elif coune==ne:\n arr.append(i+1)\n coupo+=1\n continue\n a=cumsum+(i+1)\n b=cumsum-(i+1)\n if abs(a)>abs(b):\n cumsum=b\n arr.append(-(i+1))\n else:\n cumsum=a\n arr.append(i+1)\n if cumsum>0:\n coupo+=1\n else:\n coune+=1\n for i in range(len(arr)):\n print(arr[i],end=\" \")\n \n \n \n"] | {"inputs": [["1", "3 3"]], "outputs": [["1 2 3"]]} | INTERVIEW | PYTHON3 | CODECHEF | 12,792 | |
62d909ae977df52c3e8722b0d26d6611 | UNKNOWN | Chef recently saw the movie Matrix. He loved the movie overall but he didn't agree with some things in it. Particularly he didn't agree with the bald boy when he declared - There is no spoon. Being a chef, he understands the importance of the spoon and realizes that the universe can't survive without it. Furthermore, he is sure there is a spoon; he saw it in his kitchen this morning. So he has set out to prove the bald boy is wrong and find a spoon in the matrix. He has even obtained a digital map already. Can you help him?
Formally you're given a matrix of lowercase and uppercase Latin letters. Your job is to find out if the word "Spoon" occurs somewhere in the matrix or not. A word is said to be occurred in the matrix if it is presented in some row from left to right or in some column from top to bottom. Note that match performed has to be case insensitive.
-----Input-----
The first line of input contains a positive integer T, the number of test cases. After that T test cases follow. The first line of each test case contains two space separated integers R and C, the number of rows and the number of columns of the matrix M respectively. Thereafter R lines follow each containing C characters, the actual digital map itself.
-----Output-----
For each test case print one line. If a "Spoon" is found in Matrix, output "There is a spoon!" else output "There is indeed no spoon!" (Quotes only for clarity).
-----Constraints-----
1 ≤ T ≤ 100
1 ≤ R, C ≤ 100
-----Sample Input-----
3
3 6
abDefb
bSpoon
NIKHil
6 6
aaaaaa
ssssss
xuisdP
oooooo
ioowoo
bdylan
6 5
bdfhj
cacac
opqrs
ddddd
india
yucky
-----Sample Output-----
There is a spoon!
There is a spoon!
There is indeed no spoon!
-----Explanation-----
In the first test case, "Spoon" occurs in the second row. In the second test case, "spOon" occurs in the last column. | ["import sys\n\nspoon = [ \"SPOON\", \"spoon\" ]\n\ndef main():\n try:\n tc=int(input())\n while tc>0:\n tc=tc-1\n [r,c] = input().split()\n r=int(r)\n c=int(c)\n k=0\n flag=0\n matrix=[0]*r\n i=0\n while i<r:\n matrix[i]=input()\n i=i+1\n \n #Check row wise\n for m in matrix:\n for s in m:\n if s==spoon[0][k] or s==spoon[1][k]:\n k=k+1\n if k==5:\n flag=1\n k=0\n break\n else:\n k=0\n \n if flag==1:\n print(\"There is a spoon!\")\n continue\n \n #Check column wise\n i=0\n k=0\n while i<c:\n j=0\n while j<r:\n if matrix[j][i]==spoon[0][k] or matrix[j][i]==spoon[1][k]:\n k=k+1\n if k==5:\n flag=1\n k=0\n break\n else:\n k=0\n j=j+1\n i=i+1\n \n if flag==1:\n print(\"There is a spoon!\")\n continue\n \n print(\"There is indeed no spoon!\")\n \n except:\n return 0\nmain()\n", "def check(L):\n for l in L:\n if \"spoon\" in \"\".join(l):\n return True\n return False\n\ndef change(r,c,L):\n n = []\n for x in range(c):\n t = []\n for q in range(r):\n t.append(L[q][x])\n n.append(t)\n return n\n\nfor case in range(eval(input())):\n r, c = list(map(int, input().strip().split()))\n \n m = []\n for row in range(r):\n m.append(list(input().lower().strip()))\n if check(m):\n print(\"There is a spoon!\")\n else:\n m = change(r, c, m)\n if check(m):\n print(\"There is a spoon!\")\n else:\n print(\"There is indeed no spoon!\")\n \n \n", "import string\n\nt=0\ntry:\n t=int(input().strip())\nexcept:\n pass\nfor _ in range(0,t):\n r,c=[int(j) for j in input().split()]\n a=[]\n flag=False\n m=\"\"\n for q in range(0,r):\n ll=input().lower()\n a.append(ll)\n m=m+ll\n \n for q in a:\n if q.find(\"spoon\")!=-1:\n flag = True\n break\n if not flag:\n q=0\n bb=(r-4)*c\n while q<bb:\n if m[q]==\"s\":\n ja=m[q]+m[q+c]+m[q+2*c]+m[q+3*c]+m[q+4*c]\n if ja==\"spoon\":\n flag=True\n break\n q+=1\n if flag:\n print(\"There is a spoon!\")\n else:\n print(\"There is indeed no spoon!\")\n", "t=int(input().strip())\nfor i in range(t):\n R,C=list(map(int,input().strip().split()))\n hit=['']*R\n for j in range(R):\n hit[j]=input().strip().lower()\n found=False\n for w in hit:\n if w.find('spoon')!=-1:\n print('There is a spoon!')\n found=True\n break\n if not found:\n for i in range(C):\n new=''.join([x[i] for x in hit])\n if new.find('spoon')!=-1:\n print('There is a spoon!')\n found=True\n break\n if not found: print('There is indeed no spoon!')\n\n \n", "import sys\n\nt = int(input())\n\ndebug = 0\n\nfor x in range(t):\n row, col = list(map(int, sys.stdin.readline().split()))\n\n spoon = 0\n\n matrix = []\n for r in range(row):\n row_in = sys.stdin.readline().strip().lower()\n pos = row_in.find('spoon')\n if pos != -1:\n spoon = 1\n matrix.append(row_in)\n \n if spoon == 1:\n print(\"There is a spoon!\")\n continue\n\n # If not found in row major form, then try the column major form\n for c in range(col):\n col_in = ''\n for r in range(row):\n col_in += matrix[r][c]\n\n pos = col_in.find('spoon')\n if pos != -1:\n spoon = 1\n\n if spoon == 1:\n print(\"There is a spoon!\")\n else:\n print(\"There is indeed no spoon!\")\n \n if debug == 1:\n print(spoon)\n print(matrix)\n", "import sys\n\nt = int(input())\n\ndebug = 0\n\nfor x in range(t):\n row, col = list(map(int, sys.stdin.readline().split()))\n\n spoon = 0\n\n matrix = []\n for r in range(row):\n row_in = sys.stdin.readline().strip().lower()\n pos = row_in.find('spoon')\n if pos != -1:\n spoon = 1\n matrix.append(row_in)\n \n\n # If not found in row major form, then try the column major form\n for c in range(col):\n col_in = ''\n for r in range(row):\n col_in += matrix[r][c]\n\n pos = col_in.find('spoon')\n if pos != -1:\n spoon = 1\n\n if spoon == 1:\n print(\"There is a spoon!\")\n else:\n print(\"There is indeed no spoon!\")\n \n if debug == 1:\n print(spoon)\n print(matrix)\n", "import sys\n\nT = int( sys.stdin.readline() )\n\nwhile( T ):\n T -= 1\n ins = sys.stdin.readline().split()\n R = int( ins[0] )\n C = int( ins[1] )\n horiwords = []\n vertiwords = [' ']*C\n flag = False\n for i in range( R ):\n horiwords.append( sys.stdin.readline().lower() )\n if 'spoon' in horiwords[i]:\n flag = True\n\n if not flag:\n for i in range( C ):\n for j in range( R ):\n vertiwords[i] += horiwords[j][i]\n if 'spoon' in vertiwords[i]:\n flag = True\n break\n\n if( flag ):\n print( 'There is a spoon!' )\n else:\n print( 'There is indeed no spoon!' )\n", "#Program question at: http://www.codechef.com/MARCH12/problems/SPOON\n\nt = int(input())\nwhile t>0:\n t-=1\n s = input().split()\n m = int(s[0]); n = int(s[1])\n ar = []; f = True\n for i in range(m):\n s = input().lower()\n if s.find('spoon') >=0:\n print('There is a spoon!')\n f = False\n ar.append(s)\n if not f: continue\n for i in range(n):\n s = ''\n for j in range(m):\n s += ar[j][i]\n if s.find('spoon') >= 0:\n print('There is a spoon!')\n f = False\n break\n if f: print('There is indeed no spoon!')\n", "t = int(input())\nspoon = \"spoon\"\nwhile t>0:\n t -= 1\n x, y = list(map(int, input().split(\" \")))\n inp = []\n done = False\n for i in range(x):\n inp.append(input().lower())\n if y>4:\n for i in range(x):\n if inp[i].find(spoon) != -1:\n print(\"There is a spoon!\")\n done = True\n break\n if done:\n continue\n if x>4:\n for i in range(y):\n temp = \"\"\n for j in range(x):\n temp += inp[j][i]\n if temp.find(spoon) != -1:\n print(\"There is a spoon!\")\n done = True\n break\n if done:\n continue\n print(\"There is indeed no spoon!\")", "t=int(input())\nwhile t:\n t-=1\n r,c=list(map(int,input().split(\" \")))\n l=['']*c\n flag=0\n while r:\n r-=1\n str = input()\n if 'spoon' in str.lower():\n flag=1\n else:\n j=0\n for char in list(str):\n l[j]+=char\n j+=1\n for str1 in l:\n if 'spoon' in str1.lower():\n flag = 1\n break\n if flag==1: print('There is a spoon!')\n if flag==0: print('There is indeed no spoon!')", "t = eval(input())\nfor p in range(t):\n line = input().split()\n r,c = int(line[0]),int(line[1])\n matrix = []\n found = False\n for i in range(r):\n matrix.append(input().lower())\n for i in range(r):\n if(matrix[i].find(\"spoon\") != -1):\n print(\"There is a spoon!\")\n found = True\n break\n if(not found):\n for i in range(c):\n line = \"\"\n for j in range(r):\n line += matrix[j][i]\n #print line\n if(line.find(\"spoon\") != -1):\n print(\"There is a spoon!\")\n found = True\n break\n if(not found):\n print(\"There is indeed no spoon!\")\n", "t = eval(input())\nfor ti in range(t):\n x = [int(i) for i in input().split()]\n found = False\n a = []\n for i in range(x[0]):\n a.append(input().lower())\n for i in range(x[0]):\n if a[i].find(\"spoon\") != -1:\n found = True\n break;\n if not found:\n for j in range(x[1]):\n str = \"\"\n for i in range(x[0]):\n str += a[i][j]\n if str.find(\"spoon\") != -1:\n found = True\n break;\n if found:\n print(\"There is a spoon!\")\n else:\n print(\"There is indeed no spoon!\")", "cases=int(input())\nfor i in range(cases):\n flag,lines=0,[]\n nums=input().split()\n r,c=int(nums[0]),int(nums[1])\n for j in range(r):\n lines.append(input().lower())\n if lines[j].find(\"spoon\")>=0:\n flag=1\n for j in range(c):\n line=\"\"\n for k in range(r):\n line+=lines[k][j]\n if line.find(\"spoon\")>=0:\n flag=1\n if flag==1:\n print(\"There is a spoon!\")\n else:\n print(\"There is indeed no spoon!\")\n \n \n"] | {"inputs": [["3", "3 6", "abDefb", "bSpoon", "NIKHil", "6 6", "aaaaaa", "ssssss", "xuisdP", "oooooo", "ioowoo", "bdylan", "6 5", "bdfhj", "cacac", "opqrs", "ddddd", "india", "yucky"]], "outputs": [["There is a spoon!", "There is a spoon!", "There is indeed no spoon!"]]} | INTERVIEW | PYTHON3 | CODECHEF | 7,694 | |
5be84740443f3dd7e1be019783672bd4 | UNKNOWN | The Little Elephant from the Zoo of Lviv has an array A that consists of N positive integers. Let A[i] be the i-th number in this array (i = 1, 2, ..., N).
Find the minimal number x > 1 such that x is a divisor of all integers from array A. More formally, this x should satisfy the following relations:
A[1] mod x = 0, A[2] mod x = 0, ..., A[N] mod x = 0,
where mod stands for the modulo operation. For example, 8 mod 3 = 2, 2 mod 2 = 0, 100 mod 5 = 0 and so on. If such number does not exist, output -1.
-----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 single integer N, the size of the array A for the corresponding test case. The second line contains N space separated integers A[1], A[2], ..., A[N].
-----Output-----
For each test case output a single line containing the answer for the corresponding test case.
-----Constraints-----
1 ≤ T ≤ 100000
1 ≤ N ≤ 100000
The sum of values of N in each test file does not exceed 100000
1 ≤ A[i] ≤ 100000
-----Example-----
Input:
2
3
2 4 8
3
4 7 5
Output:
2
-1
-----Explanation-----
Case 1. Clearly 2 is a divisor of each of the numbers 2, 4 and 8. Since 2 is the least number greater than 1 then it is the answer.
Case 2. Let's perform check for several first values of x.
x4 mod x7 mod x5 mod x20113112403154206415740584759475
As we see each number up to 9 does not divide all of the numbers in the array. Clearly all larger numbers also will fail to do this. So there is no such number x > 1 and the answer is -1. | ["from math import sqrt,gcd\n\nfor _ in range(int(input())):\n n=int(input())\n ar=[int(x) for x in input().split()]\n g=ar[0]\n for i in range(1,n):\n g=gcd(g,ar[i])\n \n f=g\n for i in range(2,int(sqrt(g))+1):\n if g%i==0:\n f=i\n break\n if g!=1:\n print(f)\n else:\n print(-1)\n \n \n ", "from math import gcd,sqrt\n\nT = int(input())\nans = []\n\nfor _ in range(T):\n N = int(input())\n A = [int(i) for i in input().split()]\n\n g = A[0]\n for i in range(1,N):\n g = gcd(g,A[i])\n\n f = g\n # print(g,'$')\n for i in range(2,int(sqrt(g))+1):\n if(g%i==0):\n f = i\n break\n if(g!=1):\n ans.append(f)\n else:\n ans.append(-1)\n\nfor i in ans:\n print(i)", "# cook your dish here\nimport math\n\nfor _ in range(int(input())):\n n=int(input())\n l=list(map(int, input().split()))\n if l[0]==1:\n print(-1)\n \n else:\n l1=[l[0]]\n flag=0\n for i in range(1, n):\n p=math.gcd(l1[-1], l[i])\n if p==1:\n print(-1)\n flag=1 \n break\n \n else:\n l1.append(p)\n\n if flag==0:\n p=l1[-1]\n for i in range(2, int(p**0.5)+1):\n if p%i==0:\n print(i)\n flag=1 \n break\n \n if flag==0:\n print(p)", "from functools import reduce\r\nfrom math import gcd\r\ndef sieve(n):\r\n start = int(n**0.5) +2\r\n arr =[True]*(n+1)\r\n primes= []\r\n for i in range(2,start):\r\n if arr[i]==True:\r\n primes.append(i)\r\n for j in range(i*2,n+1,i):\r\n arr[j]=False\r\n #saved till start primes now saving from start till n\r\n for i in range(start,n+1):\r\n if arr[i] ==True:\r\n primes.append(i)\r\n return primes\r\ndef divs(n,primes):\r\n sq= n**0.5\r\n fac =[]\r\n for i in primes:\r\n if i > sq:\r\n break\r\n if n%i==0:\r\n fac.append(i)\r\n if len(fac)==0:\r\n fac = [n]\r\n return fac\r\nprimes =sieve(int((10**5)**0.5+1))\r\n#print(primes)\r\nfor _ in range(int(input())):\r\n n = int(input())\r\n ls = [int(X) for X in input().split()]\r\n gc = reduce(gcd,ls)\r\n x = divs(gc,primes)\r\n if x[0]!=1:\r\n print(x[0])\r\n elif x[0]==1 and len(x)>1:\r\n print(x[1])\r\n else:print(-1)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n #gcd gives you the greatest common divisor simply printing this is incorrect\r\n #since gcd divides all the numbers in the array it's divisors will also do the same\r\n #find the smallest divisor (smallest prime)", "from functools import reduce\r\nfrom math import gcd\r\ndef sieve(n):\r\n start = int(n**0.5) +2\r\n arr =[True]*(n+1)\r\n primes= []\r\n for i in range(2,start):\r\n if arr[i]==True:\r\n primes.append(i)\r\n for j in range(i*2,n+1,i):\r\n arr[j]=False\r\n #saved till start primes now saving from start till n\r\n for i in range(start,n+1):\r\n if arr[i] ==True:\r\n primes.append(i)\r\n return primes\r\ndef divs(n,primes):\r\n sq= n**0.5\r\n fac =[]\r\n for i in primes:\r\n if i > sq:\r\n break\r\n if n%i==0:\r\n fac.append(i)\r\n if len(fac)==0:\r\n fac = [n]\r\n return fac\r\nprimes =sieve(int((10**5)**0.5+1))\r\n#print(primes)\r\nfor _ in range(int(input())):\r\n n = int(input())\r\n ls = [int(X) for X in input().split()]\r\n gc = reduce(gcd,ls)\r\n x = divs(gc,primes)\r\n if x[0]!=1:\r\n print(x[0])\r\n elif x[0]==1 and len(x)>1:\r\n print(x[1])\r\n else:print(-1)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n #gcd gives you the greatest common divisor simply printing this is incorrect\r\n #since gcd divides all the numbers in the array it's divisors will also do the same\r\n #find the smallest divisor (smallest prime)", "from functools import reduce\r\nfrom math import gcd\r\ndef divisor(n):\r\n i = 3\r\n while i*i <= n:\r\n if n%i==0:\r\n return i\r\n i+=2\r\n return n\r\nfor _ in range(int(input())):\r\n n = int(input())\r\n ls = [int(X) for X in input().split()]\r\n gc = reduce(gcd,ls)\r\n #gcd gives you the greatest common divisor simply printing this is incorrect\r\n #since gcd divides all the numbers in the array it's divisors will also do the same\r\n #find the smallest divisor (smallest prime)\r\n if gc ==1:\r\n print(-1)\r\n elif gc %2 ==0:\r\n print(2)\r\n else:\r\n print(divisor(gc))", "# cook your dish here\nimport math\nfor _ in range(int(input())):\n n=int(input())\n l=list(map(int,input().split()))\n s=l[0]\n for i in range(1,n):\n s=math.gcd(s,l[i])\n if s==1:\n print(-1)\n elif s%2==0:\n print(2)\n else:\n ans=0\n for i in range(3,int(s**0.5)+1):\n if s%i==0:\n ans=i \n break \n if ans==0:\n print(s)\n else:\n print(ans)\n ", "import math\nT = int(input())\nwhile T:\n N = int(input())\n A = list(map(int, input().split()))\n hcf = A[0]\n n = len(A)\n for i in range(1,len(A)):\n hcf = math.gcd(hcf, A[i])\n if hcf == 1:\n print(-1)\n elif hcf % 2 == 0:\n print(2)\n else:\n answer = 0\n for j in range(3, int(hcf ** 0.5)+1):\n if hcf%j == 0:\n answer = j\n break\n if answer == 0:\n print(hcf)\n else:\n print(answer)\n T -= 1", "# cook your dish here\nfrom math import gcd\nfor _ in range(int(input())):\n \n n = int(input())\n l = list(map(int,input().split()))\n \n g=l[0]\n \n for x in l:\n g = gcd(x,g)\n \n if g==1:\n print(-1)\n elif g%2==0:\n print(2)\n else:\n \n for i in range(3,int((g)**0.5) +1):\n \n if g%i==0:\n \n print(i)\n break\n else:\n print(g)\n \n", "import math\ntest = int(input())\nfor _ in range(test):\n n = int(input())\n array = list(map(int, input().split()))\n hcf = array[0]\n for i in range(1, n):\n hcf = math.gcd(hcf, array[i])\n \n if hcf==1:\n print(-1)\n elif hcf%2==0:\n print(2)\n else:\n answer=0\n for i in range(3, int((hcf)**0.5) +1):\n if hcf%i==0:\n answer = i\n break\n if answer==0:\n print(hcf)\n else:\n print(answer)", "import math\r\ndef hcf(a,b):\r\n if a==0:\r\n return 1\r\n if a%b==0:\r\n return b\r\n return hcf(b,a%b)\r\n \r\nt=int(input())\r\nfor _ in range(t):\r\n n=int(input())\r\n list1=list(map(int,input().strip().split()))\r\n \r\n curr=list1[0]\r\n for i in range(1,n):\r\n curr=hcf(curr,list1[i])\r\n if curr==1:\r\n break\r\n\r\n if curr==1:\r\n print(-1)\r\n else:\r\n ans=-1\r\n for i in range(2,math.floor(math.sqrt(curr))+1):\r\n if curr%i==0:\r\n ans=i\r\n break\r\n \r\n if ans==-1:\r\n #curr is a prime number\r\n print(curr)\r\n else:\r\n print(i)\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n", "import math\r\ndef solve():\r\n n = int(input())\r\n a = list(map(int, input().split()))\r\n x = a[0]\r\n for i in a:\r\n x = math.gcd(i, x)\r\n if x == 1:\r\n k = -1\r\n else:\r\n k = x\r\n x1 = x ** 0.5\r\n t = int(x1)\r\n for i in range(2, t + 1):\r\n if x % i == 0:\r\n k = i\r\n break\r\n print(k)\r\n\r\n\r\ndef __starting_point():\r\n t = int(input())\r\n while t != 0:\r\n solve()\r\n t -= 1\n__starting_point()", "import functools\nimport math\nfor _ in range(int(input())):\n n=int(input())\n l=list(map(int,input().split()))\n g_1=functools.reduce(math.gcd,l)\n if g_1==1:\n print(-1)\n continue\n t_1=int(math.sqrt(g_1))\n c=0\n for i in range(2,t_1+2):\n if g_1%i==0:\n c=i\n break\n if c==0:\n print(g_1)\n else:\n print(c)", "# cook your dish here\nimport math\nfor _ in range(int(input())):\n n=int(input())\n a=map(int,input().split())\n a=list(a)\n x=a[0]\n for i in a:\n x=math.gcd(i,x)\n if x==1:\n k=-1\n else:\n k=x\n x1=x**0.5\n t=int(x1)\n for i in range(2,t+1):\n if(x%i==0):\n k=i\n break\n print(k)", "import math\r\nfor _ in range(int(input())):\r\n n = int(input())\r\n a = list(map(int, input().split()))\r\n g = a[0]\r\n for i in a:\r\n g = math.gcd(g,i)\r\n if g == 1:\r\n print(-1)\r\n else:\r\n for i in range(2,int(math.sqrt(g)) + 1):\r\n if g%i == 0:\r\n print(i)\r\n break\r\n else:\r\n print(g)\r\n", "from functools import reduce\nfrom math import sqrt\nfrom math import gcd\nfor i in range(int(input())):\n\tn = int(input())\n\tli= list((int(i) for i in input().split()))\n\ta = reduce(lambda a,b:gcd(a,b),li)\n\tif a==1:\n\t\tprint(-1)\n\telse:\n\t\tfor i in range(2,int(sqrt(a))+1):\n\t\t\tif a%i==0:\n\t\t\t\tprint(i)\n\t\t\t\tbreak\n\t\telse:\n\t\t\tprint(a)", "from math import *\r\nfor j in range(int(input())):\r\n n=int(input())\r\n x=list(map(int,input().split()))\r\n a=x[0]\r\n am=0\r\n for i in range(1,n):\r\n a=gcd(a,x[i])\r\n if(a==1):\r\n print(-1)\r\n else:\r\n for i in range(2,int(sqrt(a))+1):\r\n if(a%i==0):\r\n print(i)\r\n am=1\r\n break\r\n if(am==0):\r\n print(a)", "# cook your dish here\nimport math\ntest=int(input())\nfor _ in range(test):\n n=int(input())\n l=list(map(int,input().split()))\n for i in range(1, n):\n l[i]=math.gcd(l[i],l[i-1])\n a=l[-1]\n if a==1:\n print(-1)\n else:\n f=0\n p=int(math.sqrt(l[-1]))\n i=2\n while i<=p:\n if a%i==0:\n print(i)\n f=1\n break\n i+=1\n if f==0:\n print(a)", "import math\nfor _ in range(int(input())):\n n=int(input())\n l=list(map(int,input().split()))\n for i in range(1, n):\n l[i]=math.gcd(l[i],l[i-1])\n a=l[-1]\n if a==1:\n print(-1)\n else:\n f=0\n p=int(math.sqrt(l[-1]))\n i=2\n while i<=p:\n if a%i==0:\n print(i)\n f=1\n break\n i+=1\n if f==0:\n print(a)", "# cook your dish here\n# cook your dish here\nfrom math import gcd,sqrt\nfor _ in range(int(input())):\n s=0\n f=1\n n=int(input())\n a=list(map(int,input().split()))\n for i in range(len(a)):\n s=gcd(s,a[i])\n if(s==1):\n print(-1)\n else:\n for i in range(2,int(sqrt(s))+1):\n if(s%i==0):\n print(i)\n f=0\n break;\n if(f==1):\n \n print(s) \n \n\n \n \n\n \n ", "# cook your dish here\nfrom math import gcd,sqrt\nfor _ in range(int(input())):\n s=0\n f=1\n n=int(input())\n a=list(map(int,input().split()))\n for i in range(len(a)):\n s=gcd(s,a[i])\n if(s==1):\n print(-1)\n else:\n for i in range(2,int(sqrt(s))+1):\n if(s%i==0):\n print(i)\n f=0\n break;\n if(f==1):\n \n print(s) \n \n \n \n \n "] | {"inputs": [["2", "3", "2 4 8", "3", "4 7 5", "", ""]], "outputs": [["2", "-1"]]} | INTERVIEW | PYTHON3 | CODECHEF | 12,706 | |
242ae0f2ce85745865987e2a5231a96a | UNKNOWN | Devu and Churu love to play games a lot. Today, they have an array A consisting of N positive integers. First they listed all N × (N+1) / 2 non-empty continuous subarrays of the array A on a piece of paper and then replaced all the subarrays on the paper with the maximum element present in the respective subarray.
Devu and Churu decided to play a game with numbers on the paper. They both have decided to make moves turn by turn. In one turn, the player picks some number from the list and discards that number. The one who is not able to make a valid move will be the loser. To make the game more interesting, they decided to put some constraints on their moves.
A constraint on a game can be any of following three types :
- > K : They are allowed to choose numbers having values strictly greater than K only.
- < K : They are allowed to choose numbers having values strictly less than K only.
- = K : They are allowed to choose numbers having values equal to K only.
Given M constraints and who goes first, you have to tell the outcome of each game. Print 'D' if Devu wins otherwise print 'C' without quotes.
Note that M games are independent, that is, they'll rewrite numbers by using array A after each game. (This is the task for the loser of the previous game!)
-----Input -----
First line of input contains two space separated integers N and M denoting the size of array A and number of game played by them. Next line of input contains N space-separated integers denoting elements of array A. Each of the next M lines of input contains three space-separated parameters describing a game. First two parameter are a character C ∈ {<, >, =} and an integer K denoting the constraint for that game. The last parameter is a character X ∈ {D, C} denoting the player who will start the game.
----- Output -----
Output consists of a single line containing a string of length M made up from characters D and C only, where ith character in the string denotes the outcome of the ith game.
----- Constraints: -----
- 1 ≤ N, M ≤ 106
- 1 ≤ Ai, K ≤ 109
- X ∈ {D, C}
- C ∈ {<, >, =}
-----Subtasks: -----
- Subtask 1 : 1 ≤ N, M ≤ 104 : ( 20 pts )
- Subtask 2 : 1 ≤ N, M ≤ 105 : ( 30 pts )
- Subtask 3 : 1 ≤ N, M ≤ 106 : ( 50 pts )
-----Example:-----
Input:
3 5
1 2 3
> 1 D
< 2 C
= 3 D
> 4 C
< 5 D
Output:
DCDDC
-----Explanation: -----
Subarray List :
- [1]
- [2]
- [3]
- [1,2]
- [2,3]
- [1,2,3]
Numbers on the paper after replacement :
- [1]
- [2]
- [3]
- [2]
- [3]
- [3]
Game 1 : There are only 5 numbers > 1 in the list.
Game 2 : There is only 1 number < 2 in the list.
Game 3 : There are only 3 numbers = 3 in the list.
Game 4 : There are no numbers > 4 in the list. So the first player cannot make his move.
Game 5 : There are 6 numbers < 5 in the list. | ["def left_span(arr,n):\n ans=[0]\n span=[0]\n for i in range(1,n):\n \n while span and arr[i]>arr[span[-1]]:\n span.pop()\n \n if not span:\n ans.append(0)\n \n else:\n ans.append(span[-1]+1)\n span.append(i)\n return ans\n\ndef right_span(arr,n):\n ans=[n+1]\n span=[n-1]\n for i in range(n-2,-1,-1):\n \n while span and arr[i]>=arr[span[-1]]:\n span.pop()\n \n if not span:\n ans.append(n+1)\n else:\n ans.append(span[-1]+1)\n span.append(i)\n return ans[::-1]\nfrom collections import Counter\nfrom bisect import bisect_left,bisect_right\nfrom operator import itemgetter\nn,q=list(map(int,input().split( )))\narr=list(map(int,input().split( )))\n\nleft=left_span(arr,n)\nright=right_span(arr,n)\nc=Counter()\nfor i in range(n):\n c[arr[i]]+=(right[i]-(i+1))*(i+1-left[i])\na=sorted(c)\nf=[]\nfor v in a:\n f.append(c[v])\nprefix_sum=[f[0]]\nn=len(f)\nfor i in range(1,n):\n prefix_sum.append(f[i]+prefix_sum[-1])\nr=[0]*q\nfor i in range(q):\n sign,k,player=list(map(str,input().split( )))\n k=int(k)\n if sign==\"=\":\n if k in c:\n res=c[k]\n else:\n res=0\n elif sign==\">\":\n j=bisect_left(a,k)\n if j==n:\n res=0\n elif a[j]==k:\n res=prefix_sum[-1] - prefix_sum[j]\n else:\n if j>0:\n res=prefix_sum[-1] - prefix_sum[j-1]\n else:\n res=prefix_sum[-1]\n else:\n j=bisect_left(a,k)\n if j==0:\n res=0\n else:\n res=prefix_sum[j-1]\n \n if res%2==0:\n if player==\"D\":\n r[i]=\"C\"\n else:\n r[i]=\"D\"\n else:\n r[i]=player\nprint(''.join(r))\n \n \n\n\n"] | {"inputs": [["3 5", "1 2 3", "> 1 D", "< 2 C", "= 3 D", "> 4 C", "< 5 D"]], "outputs": [["DCDDC"]]} | INTERVIEW | PYTHON3 | CODECHEF | 1,534 | |
26300c05ffe55054f20d6e0634cbe5c8 | UNKNOWN | -----
RANJANA QUIZ
-----
Prof. Ranjana decided to conduct a quiz in her class. She divided all the students of her
class into groups of three. Consider that no student was left out after the division. She gave
different sets of questions to every group. A set is said to be unique if there is no other team that
received the same number of maths, science and english questions. In every set, maximum
questions for each group were related to maths, then science, and the least number of
questions were related to English. Total number of questions given to each team can be
different.
After the test, the CR of the class asked every team to report the number of questions
they got on each subject. The CR wants to know the number of unique sets of questions that
were given to the teams, the problem is that all the students have just submitted the number of
questions of each subject but in no particular order. Help the CR to find the number of unique
sets
-----Input Format-----
Line 1 contains the number of teams ‘n’. In the next n lines, each line contains three space separated integers,i.e, the number of questions of each subject(in no particular order).
employee
-----Output-----
Print the number of unique sets
-----Example Text Case-----
Input:
5
6 5 4
2 3 7
4 6 5
7 2 3
5 3 1
Output:
1
| ["n=int(input())\nl=[]\ncount=0\nwhile n:\n n-=1\n a,b,c=sorted(map(int,input().split()))\n if (a,b,c) in l:\n count-=1\n else:\n l.append((a,b,c))\n count+=1\nprint(count)", "try:\n s=[]\n for i in range(int(input())):\n n=list(map(int,input().split()))\n n.sort()\n s.append(n)\n unique=[]\n for i in s:\n if(s.count(i)==1):\n unique.append(i)\n else:\n continue\n print(len(unique))\n \nexcept:\n pass", "#\nn = int(input())\nans = {}\ncount=0\nfor _ in range(n):\n arr = list(map(int,input().split()))\n temp=sum(arr)\n if temp in ans:\n ans[temp]+=1 \n else:\n ans[temp]=1\ncount=0\nfor i in list(ans.values()):\n if i == 1:\n count+=1 \nprint(count)\n", "n=int(input())\r\nd=dict()\r\nfor i in range(n):\r\n l=list(map(int,input().split(' ')))\r\n l1=[]\r\n l1.append(max(l))\r\n l1.append(sum(l)-(l1[0]+min(l)))\r\n l1.append(min(l))\r\n t=tuple(l1)\r\n try:\r\n d[t]+=1\r\n except:\r\n d[t]=0\r\nc=0\r\nfor i in d:\r\n if(d[i]==0):\r\n c+=1\r\nprint(c)", "# cook your dish here\r\nl=[]\r\nfor i in range(int(input())):\r\n t=list(set(list(map(int,input().split()))))\r\n if t not in l:\r\n l.append(t)\r\n else:\r\n l.remove(t)\r\nprint(len(l))", "n=int(input())\nk=0\nd={}\nfor _ in range(n):\n a=list(map(int,input().split()))\n a.sort()\n a=str(a)\n if a in d.keys():\n d[a]=d[a]+1\n else:\n d[a]=1\nfor key in d:\n if(d[key]==1):\n k=k+1\nprint(k)", "n=int(input())\r\nd={}\r\ns=0\r\nfor i in range(n):\r\n t=list(map(int,input().split()))\r\n t.sort()\r\n t=tuple(t)\r\n if t in d:\r\n d[t]=d[t]+1\r\n s=s-1\r\n else:\r\n d[t]=1\r\n s=s+1\r\n\r\n\r\nprint(s)\r\n \r\n", "s=[]\nres=0\nfor _ in range(int(input())):\n a=list(map(int,input().split()))\n a.sort()\n s.append(a)\n# ss=list(ss)\nfor _ in range(len(s)):\n if s.count(s[_])==1:\n res+=1\nprint(res) ", "# cook your dish here\ntry:\n n = int(input())\n arr = []\n for i in range(n):\n arr.append(list(map(int,input().split(\" \"))))\n out = list(map(sorted,arr))\n dic = {}\n for elem in out:\n #print(\"elem:\",elem)\n dic.setdefault(tuple(elem),list()).append(1)\n for k,v in list(dic.items()):\n dic[k]=sum(v)\n unique_set=0\n for v in list(dic.values()):\n if v == 1:\n unique_set+=1\n print(unique_set)\n \n\nexcept:\n pass\n \n \n \n", "# cook your dish here\ntry:\n n = int(input())\n arr = []\n for i in range(n):\n arr.append(list(map(int,input().split(\" \"))))\n out = list(map(sorted,arr))\n dic = {}\n for elem in out:\n #print(\"elem:\",elem)\n dic.setdefault(tuple(elem),list()).append(1)\n for k,v in list(dic.items()):\n dic[k]=sum(v)\n unique_set=0\n for v in list(dic.values()):\n if v == 1:\n unique_set+=1\n print(unique_set)\n \n\nexcept:\n pass\n \n \n \n", "# cook your dish here\nn = int(input())\nlst = []\n\nfor i in range(n):\n l1 = list(map(int, input().split()))\n l1.sort()\n if l1 not in lst:\n lst.extend([l1])\n else:\n lst.remove(l1)\n \n\n\nprint(len(lst))", "# cook your dish here\nn=int(input())\nlst=[]\nunique=0\nfor _ in range(n):\n a=list(map(int,input().split()))\n a.sort(reverse=True)\n lst.append(a)\nfor ele in lst:\n if(lst.count(ele)==1):\n unique+=1\nprint(unique)", "# cook your dish here\ntry:\n cnt=0\n l=[]\n d={}\n t=tuple()\n for _ in range(int(input())):\n w=[int(i) for i in input().split()]\n w.sort()\n l.append(w)\n # print(l)\n t=tuple(l)\n # print(t)\n for i in t:\n if tuple(i) not in d:\n d[tuple(i)]=1\n else:\n d[tuple(i)]+=1\n # print(d)\n for i in d:\n if d[i]==1:\n cnt+=1\n print(cnt)\nexcept EOFError as e: \n pass", "n = int(input())\nA = {}\nfor i in range(n):\n a = list(map(int, input().split()))\n a.sort()\n for i in range(3):\n a[i] = str(a[i])\n s = ''.join(a)\n if s in A:\n A[s] += 1\n else:\n A[s] = 1\n\ncount = 0\nfor i in A:\n if A[i] == 1:\n count += 1\nprint(count)", "# cook your dish here\nn=int(input())\ndct=dict()\nc=0\nfor i in range(n):\n x=input()\n for j in x:\n if j.isdigit():\n if j in list(dct.keys()):\n dct[j]+=1\n else:\n dct[j]=1\nfor k in dct:\n if dct[k]==1:\n c+=1\nprint(c)\n", "# cook your dish here\nfrom collections import Counter\n\nquiz_set = []\n\nfor question_set in range(int(input())):\n qs = tuple(sorted(map(int, input().split())))\n quiz_set.append(qs)\n\n# print(quiz_set)\nquiz_set = Counter(quiz_set)\n# print(quiz_set)\n\nunique_counts = list(quiz_set.values()).count(1)\n\nprint(unique_counts)", "try:\n n=int(input())\n my_list=[]\n for i in range(n):\n marks = list(map(int,input().split()))\n marks=sorted(marks)\n my_list.append(marks)\n \n unique=0\n i=0\n while i<len(my_list):\n if my_list.count(my_list[i])==1:\n unique+=1\n i+=1\n print(unique)\nexcept:\n pass", "# cook your dish here\nfrom sys import stdin, stdout\ninput = stdin.readline\nfrom collections import defaultdict as dd\nimport math\ndef geti(): return list(map(int, input().strip().split()))\ndef getl(): return list(map(int, input().strip().split()))\ndef gets(): return input()\ndef geta(): return int(input())\ndef print_s(s): stdout.write(s+'\\n')\n\ndef solve():\n occur=dd(int)\n n=geta()\n a=[]\n for i in range(n):\n temp=getl()\n temp.sort(reverse=True)\n # print(temp)\n a.append(tuple(temp))\n occur[a[-1]]+=1\n ans=0\n for i in a:\n if occur[i]==1:\n ans+=1\n print(ans)\n\n\n\ndef __starting_point():\n solve()\n\n__starting_point()", "# cook your dish here\nimport sys\nn=int(input().strip())\ndiz={}\ncounter=0\nfor _ in range(n):\n values=list(map(int, input().strip().split()))\n values.sort(reverse=True)\n values=tuple(values)\n if values not in diz:\n diz[values]=1 \n counter+=1 \n else:\n if diz[values]==1:\n counter-=1 \n diz[values]=0\nprint(counter)\n", "n=int(input())\nl=[]\nfor i in range(n):\n a,b,c=list(map(int,input().split()))\n t=[a,b,c]\n l.append(sorted(t))\n\nl.sort()\nl1=[]\nfor i in l:\n l1.append(l.count(i))\ncounter=0\nfor i in l1:\n if i==1:\n counter+= 1\nprint(counter)\n\n\n", "n=int(input())\na=[sorted(list(map(int,input().split()))) for i in range(n)];c=0\nfor j in range(n):\n if a.count(a[j])==1:\n c=c+1\nprint(c)", "# cook your dish here\nn=int(input())\nl=[]\nfor i in range(n):\n x=list(map(int,input().split()))\n x.sort(reverse=True)\n l.append(x)\ns=0\nfor i in range(n):\n c=0\n for j in range(n):\n if(l[i]==l[j]):\n c+=1\n if(c==1):\n s+=1\nprint(s)\n", "n=int(input())\nar = [sorted(list(map(int,input().split()))) for i in range(n)]\nc=0\nfor j in range(n):\n if ar.count(ar[j])==1:\n c+=1\n else:\n pass\nprint(c)", "from collections import Counter\nl = []\nfor _ in range(int(input())):\n s = list(map(int, input().split()))\n s = sorted(s)\n l.append(tuple(s))\n\nc = Counter(l)\nt=0\nfor v in list(c.values()):\n if v==1:\n t+=1\nprint(t)\n", "# cook your dish here\nn=int(input())\nl=[]\nfor i in range(n):\n l.append(list(map(int,input().split())))\n l[i].sort()\ncountu=0\nfor i in l:\n if l.count(i)==1:\n countu+=1\nprint(countu)"] | {"inputs": [["5", "6 5 4", "2 3 7", "4 6 5", "7 2 3", "5 3 1"]], "outputs": [["1"]]} | INTERVIEW | PYTHON3 | CODECHEF | 7,955 | |
cad133c54f90c3f8df35e1e019c37c09 | UNKNOWN | You are given a weighted undirected graph consisting of n$n$ nodes and m$m$ edges. The nodes are numbered from 1$1$ to n$n$. The graph does not contain any multiple edges or self loops.
A walk W$W$ on the graph is a sequence of vertices (with repetitions of vertices and edges allowed) such that every adjacent pair of vertices in the sequence is an edge of the graph. We define the cost of a walk W$W$, Cost(W)$Cost(W)$, as the maximum over the weights of the edges along the walk.
You will be given q$q$ queries. In each query, you will be given an integer X$X$.
You have to count the number of different walks W$W$ of length 4$4$ such that Cost(W)$Cost(W)$ = X$X$.
Two walks are considered different if they do not represent the same edge sequence.
-----Input:-----
- First line contains 2 integers : the number of nodes n$n$ and number of edges m$m$.
- Next m$m$ lines each describe u$u$, v$v$ and w$w$, describing an edge between u$u$ and v$v$ with weight w$w$.
- Next line contains q$q$, the number of queries.
- Next q$q$ lines each describe an integer X$X$ - the cost of the walk in the query.
-----Output:-----
For each query, output in a single line the number of different possible walks.
-----Constraints-----
- 1≤n≤100$1 \leq n \leq 100$
- 1≤m≤n(n−1)2$1 \leq m \leq \frac{n (n-1)}{2}$
- 1≤u,v≤n$1 \leq u, v \leq n$
- 1≤w≤100$1 \leq w \leq 100$
- 1≤q≤100$1 \leq q \leq 100$
- 1≤X≤100$1 \leq X \leq 100$
-----Sample Input:-----
3 3
1 2 1
2 3 2
3 1 3
3
1
2
3
-----Sample Output:-----
2
10
36
-----EXPLANATION:-----
For X=2$X = 2$, all possible 10$10$ walks are listed below :
- 1 -> 2 -> 1 -> 2 -> 3
- 1 -> 2 -> 3 -> 2 -> 1
- 1 -> 2 -> 3 -> 2 -> 3
- 2 -> 1 -> 2 -> 3 -> 2
- 2 -> 3 -> 2 -> 1 -> 2
- 2 -> 3 -> 2 -> 3 -> 2
- 3 -> 2 -> 1 -> 2 -> 1
- 3 -> 2 -> 1 -> 2 -> 3
- 3 -> 2 -> 3 -> 2 -> 1
- 3 -> 2 -> 3 -> 2 -> 3 | ["# cook your dish here\nfrom collections import defaultdict\n\nclass sol():\n def __init__(self,n,edges):\n self.n = n\n self.edges = edges\n self.graph = self.create_graph()\n self.precompute()\n \n def create_graph(self):\n graph = defaultdict(list)\n for e in self.edges:\n u = e[0]\n v = e[1]\n w = e[2]\n graph[u].append([v,w])\n graph[v].append([u,w])\n return graph\n \n def precompute(self):\n self.maxiedges = [0]*6\n self.B = [[0 for i in range(101)] for i in range(101)]\n def func(u,v,l):\n if l==2:\n self.B[u][self.maxiedges[l]] += 1\n else:\n for j in self.graph[v]:\n self.maxiedges[l+1] = max(self.maxiedges[l],j[1])\n func(u,j[0],l+1)\n for i in range(1,self.n+1):\n func(i,i,0)\n \n def paths(self,X):\n freq = 0\n for u in range(1,self.n+1):\n for x in range(X+1):\n freq += 2*self.B[u][X]*self.B[u][x]\n freq -= self.B[u][X]*self.B[u][X]\n return freq\n \nn, m = map(int, input().split())\nedges = []\nwhile m:\n uvw = list(map(int, input().split()))\n edges.append(uvw)\n m -= 1\nq = int(input())\nGraph = sol(n,edges)\nwhile q:\n query = int(input())\n print(Graph.paths(query))\n q -= 1\n", "# cook your dish here\nfrom collections import defaultdict\n\nclass sol():\n def __init__(self,n,edges):\n self.n = n\n self.edges = edges\n self.graph = self.create_graph()\n self.precompute()\n \n def create_graph(self):\n graph = defaultdict(list)\n for e in self.edges:\n u = e[0]\n v = e[1]\n w = e[2]\n graph[u].append([v,w])\n graph[v].append([u,w])\n return graph\n \n def precompute(self):\n self.maxiedges = [0]*6\n self.B = [[0 for i in range(101)] for i in range(101)]\n def func(u,v,l):\n if l==2:\n self.B[u][self.maxiedges[l]] += 1\n else:\n for j in self.graph[v]:\n self.maxiedges[l+1] = max(self.maxiedges[l],j[1])\n func(u,j[0],l+1)\n for i in range(1,self.n+1):\n func(i,i,0)\n \n def paths(self,X):\n freq = 0\n for u in range(1,self.n+1):\n for x in range(X+1):\n freq += 2*self.B[u][X]*self.B[u][x]\n freq -= self.B[u][X]*self.B[u][X]\n return freq\n \nn, m = map(int, input().split())\nedges = []\nwhile m:\n uvw = list(map(int, input().split()))\n edges.append(uvw)\n m -= 1\nq = int(input())\nGraph = sol(n,edges)\nwhile q:\n query = int(input())\n print(Graph.paths(query))\n q -= 1\n ", "# cook your dish here\n# cook your dish here\n\nfrom collections import defaultdict\n\nclass sol():\n def __init__(self,n,edges):\n self.n = n\n self.edges = edges\n self.graph = self.create_graph()\n self.precompute()\n \n def create_graph(self):\n graph = defaultdict(list)\n for e in self.edges:\n u = e[0]\n v = e[1]\n w = e[2]\n graph[u].append([v,w])\n graph[v].append([u,w])\n return graph\n \n def precompute(self):\n self.maxiedges = [0]*6\n self.B = [[0 for i in range(101)] for i in range(101)]\n def func(u,v,l):\n if l==2:\n self.B[u][self.maxiedges[l]] += 1\n else:\n for j in self.graph[v]:\n self.maxiedges[l+1] = max(self.maxiedges[l],j[1])\n func(u,j[0],l+1)\n for i in range(1,self.n+1):\n func(i,i,0)\n \n def paths(self,X):\n freq = 0\n for u in range(1,self.n+1):\n for x in range(X+1):\n freq += 2*self.B[u][X]*self.B[u][x]\n freq -= self.B[u][X]*self.B[u][X]\n return freq\n \nn, m = map(int, input().split())\nedges = []\nwhile m:\n uvw = list(map(int, input().split()))\n edges.append(uvw)\n m -= 1\nq = int(input())\nGraph = sol(n,edges)\nwhile q:\n query = int(input())\n print(Graph.paths(query))\n q -= 1\n ", "# cook your dish here\n# cook your dish here\n\nfrom collections import defaultdict\n\nclass sol():\n def __init__(self,n,edges):\n self.n = n\n self.edges = edges\n self.graph = self.create_graph()\n self.precompute()\n \n def create_graph(self):\n graph = defaultdict(list)\n for e in self.edges:\n u = e[0]\n v = e[1]\n w = e[2]\n graph[u].append([v,w])\n graph[v].append([u,w])\n return graph\n \n def precompute(self):\n self.maxiedges = [0]*6\n self.B = [[0 for i in range(101)] for i in range(101)]\n def func(u,v,l):\n if l==2:\n self.B[u][self.maxiedges[l]] += 1\n else:\n for j in self.graph[v]:\n self.maxiedges[l+1] = max(self.maxiedges[l],j[1])\n func(u,j[0],l+1)\n for i in range(1,self.n+1):\n func(i,i,0)\n \n def paths(self,X):\n freq = 0\n for u in range(1,self.n+1):\n for x in range(X+1):\n freq += 2*self.B[u][X]*self.B[u][x]\n freq -= self.B[u][X]*self.B[u][X]\n return freq\n \nn, m = map(int, input().split())\nedges = []\nwhile m:\n uvw = list(map(int, input().split()))\n edges.append(uvw)\n m -= 1\nq = int(input())\nGraph = sol(n,edges)\nwhile q:\n query = int(input())\n print(Graph.paths(query))\n q -= 1\n ", "# cook your dish here\n\nfrom collections import defaultdict\n\nclass sol():\n def __init__(self,n,edges):\n self.n = n\n self.edges = edges\n self.graph = self.create_graph()\n self.precompute()\n \n def create_graph(self):\n graph = defaultdict(list)\n for e in self.edges:\n u = e[0]\n v = e[1]\n w = e[2]\n graph[u].append([v,w])\n graph[v].append([u,w])\n return graph\n \n def precompute(self):\n self.maxiedges = [0]*6\n self.B = [[0 for i in range(101)] for i in range(101)]\n def func(u,v,l):\n if l==2:\n self.B[u][self.maxiedges[l]] += 1\n else:\n for j in self.graph[v]:\n self.maxiedges[l+1] = max(self.maxiedges[l],j[1])\n func(u,j[0],l+1)\n for i in range(1,self.n+1):\n func(i,i,0)\n \n def paths(self,X):\n freq = 0\n for u in range(1,self.n+1):\n for x in range(X+1):\n freq += 2*self.B[u][X]*self.B[u][x]\n freq -= self.B[u][X]*self.B[u][X]\n return freq\n \nn, m = map(int, input().split())\nedges = []\nwhile m:\n uvw = list(map(int, input().split()))\n edges.append(uvw)\n m -= 1\nq = int(input())\nGraph = sol(n,edges)\nwhile q:\n query = int(input())\n print(Graph.paths(query))\n q -= 1\n ", "# cook your dish here\n\nfrom collections import defaultdict\n\nclass sol():\n def __init__(self,n,edges):\n self.n = n\n self.edges = edges\n self.graph = self.create_graph()\n self.precompute()\n \n def create_graph(self):\n graph = defaultdict(list)\n for e in self.edges:\n u = e[0]\n v = e[1]\n w = e[2]\n graph[u].append([v,w])\n graph[v].append([u,w])\n return graph\n \n def precompute(self):\n self.maxiedges = [0]*6\n self.B = [[0 for i in range(101)] for i in range(101)]\n def func(u,v,l):\n if l==2:\n self.B[u][self.maxiedges[l]] += 1\n else:\n for j in self.graph[v]:\n self.maxiedges[l+1] = max(self.maxiedges[l],j[1])\n func(u,j[0],l+1)\n for i in range(1,self.n+1):\n func(i,i,0)\n \n def paths(self,X):\n freq = 0\n for u in range(1,self.n+1):\n for x in range(X+1):\n freq += 2*self.B[u][X]*self.B[u][x]\n freq -= self.B[u][X]*self.B[u][X]\n return freq\n \nn, m = map(int, input().split())\nedges = []\nwhile m:\n uvw = list(map(int, input().split()))\n edges.append(uvw)\n m -= 1\nq = int(input())\nGraph = sol(n,edges)\nwhile q:\n query = int(input())\n print(Graph.paths(query))\n q -= 1\n ", "\nfrom collections import defaultdict\n\nclass sol():\n def __init__(self,n,edges):\n self.n = n\n self.edges = edges\n self.graph = self.create_graph()\n self.precompute()\n \n def create_graph(self):\n graph = defaultdict(list)\n for e in self.edges:\n u = e[0]\n v = e[1]\n w = e[2]\n graph[u].append([v,w])\n graph[v].append([u,w])\n return graph\n \n def precompute(self):\n self.maxiedges = [0]*6\n self.B = [[0 for i in range(101)] for i in range(101)]\n def func(u,v,l):\n if l==2:\n self.B[u][self.maxiedges[l]] += 1\n else:\n for j in self.graph[v]:\n self.maxiedges[l+1] = max(self.maxiedges[l],j[1])\n func(u,j[0],l+1)\n for i in range(1,self.n+1):\n func(i,i,0)\n \n def paths(self,X):\n freq = 0\n for u in range(1,self.n+1):\n for x in range(X+1):\n freq += 2*self.B[u][X]*self.B[u][x]\n freq -= self.B[u][X]*self.B[u][X]\n return freq\n \nn, m = map(int, input().split())\nedges = []\nwhile m:\n uvw = list(map(int, input().split()))\n edges.append(uvw)\n m -= 1\nq = int(input())\nGraph = sol(n,edges)\nwhile q:\n query = int(input())\n print(Graph.paths(query))\n q -= 1\n ", "# cook your dish here\nfrom collections import defaultdict\n\nclass sol():\n def __init__(self,n,edges):\n self.n = n\n self.edges = edges\n self.graph = self.create_graph()\n self.precompute()\n \n def create_graph(self):\n graph = defaultdict(list)\n for e in self.edges:\n u = e[0]\n v = e[1]\n w = e[2]\n graph[u].append([v,w])\n graph[v].append([u,w])\n return graph\n \n def precompute(self):\n self.maxiedges = [0]*6\n self.B = [[0 for i in range(101)] for i in range(101)]\n def func(u,v,l):\n if l==2:\n self.B[u][self.maxiedges[l]] += 1\n else:\n for j in self.graph[v]:\n self.maxiedges[l+1] = max(self.maxiedges[l],j[1])\n func(u,j[0],l+1)\n for i in range(1,self.n+1):\n func(i,i,0)\n \n def paths(self,X):\n freq = 0\n for u in range(1,self.n+1):\n for x in range(X+1):\n freq += 2*self.B[u][X]*self.B[u][x]\n freq -= self.B[u][X]*self.B[u][X]\n return freq\n \nn, m = map(int, input().split())\nedges = []\nwhile m:\n uvw = list(map(int, input().split()))\n edges.append(uvw)\n m -= 1\nq = int(input())\nGraph = sol(n,edges)\nwhile q:\n query = int(input())\n print(Graph.paths(query))\n q -= 1\n ", "# cook your dish here\nfrom collections import defaultdict\n\nclass sol():\n def __init__(self,n,edges):\n self.n = n\n self.edges = edges\n self.graph = self.create_graph()\n self.precompute()\n \n def create_graph(self):\n graph = defaultdict(list)\n for e in self.edges:\n u = e[0]\n v = e[1]\n w = e[2]\n graph[u].append([v,w])\n graph[v].append([u,w])\n return graph\n \n def precompute(self):\n self.maxiedges = [0]*6\n self.B = [[0 for i in range(101)] for i in range(101)]\n def func(u,v,l):\n if l==2:\n self.B[u][self.maxiedges[l]] += 1\n else:\n for j in self.graph[v]:\n self.maxiedges[l+1] = max(self.maxiedges[l],j[1])\n func(u,j[0],l+1)\n for i in range(1,self.n+1):\n func(i,i,0)\n \n def paths(self,X):\n freq = 0\n for u in range(1,self.n+1):\n for x in range(X+1):\n freq += 2*self.B[u][X]*self.B[u][x]\n freq -= self.B[u][X]*self.B[u][X]\n return freq\n \nn, m = map(int, input().split())\nedges = []\nwhile m:\n uvw = list(map(int, input().split()))\n edges.append(uvw)\n m -= 1\nq = int(input())\nGraph = sol(n,edges)\nwhile q:\n query = int(input())\n print(Graph.paths(query))\n q -= 1\n "] | {"inputs": [["3 3", "1 2 1", "2 3 2", "3 1 3", "3", "1", "2", "3"]], "outputs": [["2", "10", "36"]]} | INTERVIEW | PYTHON3 | CODECHEF | 13,277 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.