question
stringlengths 0
30.2k
| answer
stringlengths 55
2.44k
|
|---|---|
<line-1>from sys import *</line-1>
<line-3>a = input()</line-3>
<line-4>s = 0</line-4>
<line-5>i = 0</line-5>
<line-6>while i <= n-1:</line-6>
<line-7> if s == 0:</line-7>
<line-8> if a[i:i+3] == 'ogo':</line-8>
<line-9> s = 1</line-9>
<line-10> print('***', end = '')</line-10>
<line-11> i+=3</line-11>
<line-12> else:</line-12>
<line-13> print(a[i], end = '')</line-13>
<line-14> i += 1</line-14>
<line-15> </line-15>
<line-16> else:</line-16>
<line-17> if a[i:i+2] == 'go':</line-17>
<line-18> i += 2</line-18>
<line-20> s = 0</line-20>
|
{"code": "<line-2>n = int(input())</line-2>\n<line-19> else:</line-19>", "lines": [2, 19]}
#### 0
|
<line-1>x, n = list(map(int, input().split()))</line-1>
<line-2></line-2>
<line-4> i, n, ret, d, sq = 2, N, {}, 2, 99</line-4>
<line-5> while i <= sq:</line-5>
<line-6> k = 0</line-6>
<line-7> while n % i == 0: n, k, ret[i] = n//i, k+1, k+1</line-7>
<line-8> if k > 0 or i == 97: sq = int(n**(1/2)+0.5)</line-8>
<line-9> if i < 4: i = i * 2 - 1</line-9>
<line-10> else: i, d = i+d, d^6</line-10>
<line-11> if n > 1: ret[n] = 1</line-11>
<line-12> return ret</line-12>
<line-13></line-13>
<line-14>pf = primeFactor(x)</line-14>
<line-15>mod = 10 ** 9 + 7</line-15>
<line-16>def calc(p):</line-16>
<line-17> s = 0</line-17>
<line-18> a = n//p</line-18>
<line-19> while a:</line-19>
<line-20> s += a</line-20>
<line-21> a //= p</line-21>
<line-22> return pow(p, s, mod)</line-22>
<line-23></line-23>
<line-24>ans = 1</line-24>
<line-25>for p in pf:</line-25>
<line-27>print(ans)</line-27>
<line-28></line-28>
<line-29></line-29>
|
{"code": "<line-3>def primeFactor(N):</line-3>\n<line-26> ans = ans * calc(p) % mod</line-26>", "lines": [3, 26]}
#### 0
|
<line-1>a, b, c = list(map(int, input().split()))</line-1>
<line-3>for sum in range(1, 200):</line-3>
<line-4> x = b * sum ** a + c</line-4>
<line-5> if x <= 0 or x >= 10 ** 9:</line-5>
<line-6> continue</line-6>
<line-7> summ = 0</line-7>
<line-8> for aa in str(x):</line-8>
<line-9> summ += int(aa)</line-9>
<line-10> if sum == summ:</line-10>
<line-11> ans.append(x)</line-11>
<line-13>print(*ans)</line-13>
|
{"code": "<line-2>ans = []</line-2>\n<line-12>print(len(ans))</line-12>", "lines": [2, 12]}
#### 0
|
<line-1>l=list(map(int,input().split()))</line-1>
<line-3>c1=[1,6,3,8,5,10,7,12,9,23,11,21,13,14,15,16,17,18,19,20,4,22,2,24]</line-3>
<line-4>c2=[1,23,3,21,5,2,7,4,9,6,11,8,13,14,15,16,17,18,19,20,12,22,10,24]</line-4>
<line-5>c3=[1,2,3,4,5,6,15,16,9,10,11,12,13,14,23,24,17,18,7,8,21,22,19,20]</line-5>
<line-6>c4=[1,2,3,4,5,6,19,20,9,10,11,12,13,14,7,8,17,18,23,24,21,22,15,16]</line-6>
<line-7>c5=[1,2,16,14,5,6,7,8,19,17,11,12,13,9,15,10,3,18,4,20,21,22,23,24]</line-7>
<line-8>c6=[1,2,17,19,5,6,7,8,14,16,11,12,13,4,15,3,10,18,9,20,21,22,23,24]</line-8>
<line-9>flag=0</line-9>
<line-10>mark=0</line-10>
<line-11>for i in range(6):</line-11>
<line-12> if(l[c1[4*i]] == l[c1[4*i+1]] == l[c1[4*i+2]] == l[c1[4*i+3]]):</line-12>
<line-13> mark=1</line-13>
<line-14> else:</line-14>
<line-15> mark=0</line-15>
<line-16> break</line-16>
<line-17>if(mark):</line-17>
<line-18> flag=1</line-18>
<line-19></line-19>
<line-20>mark=0</line-20>
<line-21>for i in range(6):</line-21>
<line-22> if(l[c2[4*i]] == l[c2[4*i+1]] == l[c2[4*i+2]] == l[c2[4*i+3]]):</line-22>
<line-23> mark=1</line-23>
<line-24> else:</line-24>
<line-25> mark=0</line-25>
<line-26> break</line-26>
<line-27>if(mark):</line-27>
<line-28> flag=1</line-28>
<line-29></line-29>
<line-30>mark=0</line-30>
<line-31>for i in range(6):</line-31>
<line-32> if(l[c3[4*i]] == l[c3[4*i+1]] == l[c3[4*i+2]] == l[c3[4*i+3]]):</line-32>
<line-33> mark=1</line-33>
<line-34> else:</line-34>
<line-35> mark=0</line-35>
<line-36> break</line-36>
<line-37>if(mark):</line-37>
<line-38> flag=1</line-38>
<line-39></line-39>
<line-40>mark=0</line-40>
<line-41>for i in range(6):</line-41>
<line-42> if(l[c4[4*i]] == l[c4[4*i+1]] == l[c4[4*i+2]] == l[c4[4*i+3]]):</line-42>
<line-43> mark=1</line-43>
<line-44> else:</line-44>
<line-45> mark=0</line-45>
<line-46> break</line-46>
<line-47>if(mark):</line-47>
<line-48> flag=1</line-48>
<line-49></line-49>
<line-50>mark=0</line-50>
<line-51>for i in range(6):</line-51>
<line-52> if(l[c5[4*i]] == l[c5[4*i+1]] == l[c5[4*i+2]] == l[c5[4*i+3]]):</line-52>
<line-53> mark=1</line-53>
<line-54> else:</line-54>
<line-55> mark=0</line-55>
<line-56> break</line-56>
<line-57>if(mark):</line-57>
<line-58> flag=1</line-58>
<line-59></line-59>
<line-60>mark=0</line-60>
<line-61>for i in range(6):</line-61>
<line-62> if(l[c6[4*i]] == l[c6[4*i+1]] == l[c6[4*i+2]] == l[c6[4*i+3]]):</line-62>
<line-63> mark=1</line-63>
<line-64> else:</line-64>
<line-65> mark=0</line-65>
<line-66> break</line-66>
<line-67>if(mark):</line-67>
<line-68> flag=1</line-68>
<line-69></line-69>
<line-70>if(flag):</line-70>
<line-71> print("YES")</line-71>
<line-73> print("NO")</line-73>
|
{"code": "<line-2>l.insert(0,0)</line-2>\n<line-72>else:</line-72>", "lines": [2, 72]}
#### 0
|
<line-1>from math import ceil</line-1>
<line-2></line-2>
<line-4>h = x</line-4>
<line-5>while h >=y:</line-5>
<line-6> h-=50</line-6>
<line-7>h+=50</line-7>
<line-8>for i in range(h, 10000000000, 50):</line-8>
<line-9> u = (i//50)%475</line-9>
<line-10> d = []</line-10>
<line-11> for j in range(25):</line-11>
<line-12> u = (u * 96 + 42)%475</line-12>
<line-13> d.append(26 + u)</line-13>
<line-14> if p in d:</line-14>
<line-15> k = i</line-15>
<line-16> break</line-16>
<line-17>if k-x>0:</line-17>
<line-18> print(ceil((k-x)/100))</line-18>
<line-20> print(0)</line-20>
|
{"code": "<line-3>p,x,y = map(int, input().split())</line-3>\n<line-19>else:</line-19>", "lines": [3, 19]}
#### 0
|
<line-1>'''input</line-1>
<line-3>2</line-3>
<line-4>3</line-4>
<line-5>5</line-5>
<line-6>'''</line-6>
<line-7>n = int(input())</line-7>
<line-8>a = int(input())</line-8>
<line-9>b = int(input())</line-9>
<line-10>c = int(input())</line-10>
<line-11>cur = 0</line-11>
<line-12>pos = 0</line-12>
<line-13>for i in range(n-1):</line-13>
<line-14> if pos == 0:</line-14>
<line-15> if a < b:</line-15>
<line-16> pos = 1</line-16>
<line-17> cur += a</line-17>
<line-18> else:</line-18>
<line-19> pos = 2</line-19>
<line-20> cur += b </line-20>
<line-21> elif pos == 1:</line-21>
<line-22> if a < c: </line-22>
<line-23> pos = 1</line-23>
<line-24> cur += a</line-24>
<line-25> else:</line-25>
<line-26> pos = 3</line-26>
<line-27> cur += c</line-27>
<line-28> else:</line-28>
<line-29> if b < c: </line-29>
<line-30> pos = 2</line-30>
<line-31> cur += b</line-31>
<line-32> else:</line-32>
<line-33> pos = 3</line-33>
<line-35>print(cur) </line-35>
|
{"code": "<line-2>1</line-2>\n<line-34> cur += c </line-34>", "lines": [2, 34]}
#### 0
|
<line-2></line-2>
<line-3>print(max(l) - min(l))</line-3>
|
{"code": "<line-1>l = list(map(int, input().split()))</line-1>", "lines": [1]}
#### 0
|
<line-1>n, x = list(map(int, input().split()))</line-1>
<line-3>b = [0] * 1000000</line-3>
<line-4>ans = 0</line-4>
<line-5>go = False</line-5>
<line-6></line-6>
<line-7>for i in a:</line-7>
<line-8> b[i] += 1</line-8>
<line-9> if b[i] > 1:</line-9>
<line-10> go = True</line-10>
<line-11></line-11>
<line-12>if go:</line-12>
<line-13> print(ans)</line-13>
<line-14>else:</line-14>
<line-15> for i in a:</line-15>
<line-16> b[i] -= 1</line-16>
<line-17> if b[i & x] + 1 > 1:</line-17>
<line-18> go = True</line-18>
<line-19> ans = 1</line-19>
<line-20> break</line-20>
<line-21> </line-21>
<line-22> b[i] += 1</line-22>
<line-23> </line-23>
<line-24> if go:</line-24>
<line-25> print(ans)</line-25>
<line-26> else:</line-26>
<line-27> c = [i & x for i in a]</line-27>
<line-28> b = [0] * 1000000</line-28>
<line-29> for i in c:</line-29>
<line-30> b[i] += 1</line-30>
<line-31> if (b[i] > 1):</line-31>
<line-32> ans = 2</line-32>
<line-33> go = True</line-33>
<line-34> break</line-34>
<line-35> if go:</line-35>
<line-36> print(ans)</line-36>
<line-38> print(-1)</line-38>
|
{"code": "<line-2>a = list(map(int, input().split()))</line-2>\n<line-37> else:</line-37>", "lines": [2, 37]}
#### 0
|
<line-1>h,w = map(int,input().split())</line-1>
<line-3>hh = -1</line-3>
<line-4>tmp = -1</line-4>
<line-5>for k,i in enumerate(s):</line-5>
<line-6> a = i.count('*')</line-6>
<line-7> if tmp < a:</line-7>
<line-8> tmp = a</line-8>
<line-9> hh = k</line-9>
<line-10></line-10>
<line-11>t = [list(i) for i in list(zip(*s))]</line-11>
<line-12>ww = -1</line-12>
<line-13>tmp = -1</line-13>
<line-14>for k,i in enumerate(t):</line-14>
<line-15> a = i.count('*')</line-15>
<line-16> if tmp < a:</line-16>
<line-17> tmp = a</line-17>
<line-18> ww = k</line-18>
<line-19></line-19>
<line-20>if s[hh][ww] != '*':</line-20>
<line-21> print('NO')</line-21>
<line-22> return</line-22>
<line-23></line-23>
<line-24>if hh in (0, h - 1) or ww in (0, w - 1):</line-24>
<line-25> print('NO')</line-25>
<line-26> return</line-26>
<line-27></line-27>
<line-28>if '.' in (s[hh-1][ww], s[hh+1][ww], s[hh][ww-1], s[hh][ww+1]):</line-28>
<line-29> print('NO')</line-29>
<line-30> return</line-30>
<line-31></line-31>
<line-32>cnt = 1</line-32>
<line-33>for i in range(hh - 1, -1, -1):</line-33>
<line-34> if s[i][ww] == '.':</line-34>
<line-35> break</line-35>
<line-36> cnt += 1</line-36>
<line-37>for i in range(ww - 1, -1, -1):</line-37>
<line-38> if s[hh][i] == '.':</line-38>
<line-39> break</line-39>
<line-40> cnt += 1</line-40>
<line-41>for i in range(hh + 1, h):</line-41>
<line-42> if s[i][ww] == '.':</line-42>
<line-43> break</line-43>
<line-44> cnt += 1</line-44>
<line-45>for i in range(ww + 1, w):</line-45>
<line-46> if s[hh][i] == '.':</line-46>
<line-47> break</line-47>
<line-48> cnt += 1</line-48>
<line-49></line-49>
<line-50>for i in range(h):</line-50>
<line-51> for j in range(w):</line-51>
<line-52> cnt -= (s[i][j] == '*')</line-52>
<line-53></line-53>
<line-54>if cnt != 0:</line-54>
<line-55> print('NO')</line-55>
<line-57> print('YES')</line-57>
|
{"code": "<line-2>s = [list(input()) for i in range(h)]</line-2>\n<line-56>else:</line-56>", "lines": [2, 56]}
#### 0
|
<line-1>n, a, b = map(int,input().split())</line-1>
<line-3>if 2<=n<=3 and a == b == 1: print("NO"); return</line-3>
<line-4>print("YES")</line-4>
<line-5></line-5>
<line-6>if b == 1:</line-6>
<line-7> adj = [[0]*n for i in range(n)]</line-7>
<line-8> conn = n</line-8>
<line-9> for i in range(n):</line-9>
<line-10> if conn == a: break</line-10>
<line-11> adj[i][i+1] = adj[i+1][i] = 1</line-11>
<line-12> conn-= 1</line-12>
<line-13> if conn == a: break</line-13>
<line-14>elif a == 1:</line-14>
<line-15> adj = [[1]*n for i in range(n)]</line-15>
<line-16> conn = n</line-16>
<line-17> for i in range(n): adj[i][i] = 0</line-17>
<line-18> for i in range(n):</line-18>
<line-19> if conn == b: break</line-19>
<line-20> adj[i][i+1] = adj[i+1][i] = 0</line-20>
<line-21> conn-= 1</line-21>
<line-22> if conn == b: break</line-22>
<line-23></line-23>
<line-25> print(*row, sep='')</line-25>
|
{"code": "<line-2>if a>1 and b>1: print(\"NO\"); return</line-2>\n<line-24>for row in adj:</line-24>", "lines": [2, 24]}
#### 0
|
<line-1>c,d=list(map(int,input().split()))</line-1>
<line-2></line-2>
<line-4></line-4>
<line-5>k=int(input())</line-5>
<line-6></line-6>
<line-7>z=0</line-7>
<line-8>best=10**10</line-8>
<line-9>while(1):</line-9>
<line-10> x=n*m-k</line-10>
<line-11> x-=z*n</line-11>
<line-12> best=min(best,z*c+(max(x,0)*d))</line-12>
<line-13> if(x<0):</line-13>
<line-14> break</line-14>
<line-16>print(best)</line-16>
<line-17> </line-17>
|
{"code": "<line-3>n,m=list(map(int,input().split()))</line-3>\n<line-15> z+=1</line-15>", "lines": [3, 15]}
#### 0
|
<line-1>3</line-1>
<line-2></line-2>
<line-4>n = len(s)</line-4>
<line-5></line-5>
<line-6>a, b = 0, 0</line-6>
<line-7>d = dict()</line-7>
<line-8>for i in range(len(s)):</line-8>
<line-9> if s[i] in d:</line-9>
<line-10> a = d[s[i]]</line-10>
<line-11> b = i</line-11>
<line-12> d[s[i]] = i</line-12>
<line-13></line-13>
<line-14>if a == b - 1:</line-14>
<line-15> print("Impossible")</line-15>
<line-16>else:</line-16>
<line-17> ans = [[' '] * 13 for i in range(2)]</line-17>
<line-18> if (b - a) % 2 == 1:</line-18>
<line-19> for i in range((b - a) // 2):</line-19>
<line-20> ans[0][-(b - a) // 2 + i + 1] = s[a + i + 1]</line-20>
<line-21> ans[1][-i - 1] = s[a + i + (b - a) // 2 + 1]</line-21>
<line-22> x = -(b - a) // 2</line-22>
<line-23> y = 0</line-23>
<line-24> for i in range(b, n):</line-24>
<line-25> ans[y][x] = s[i]</line-25>
<line-26> if y == 0:</line-26>
<line-27> x -= 1</line-27>
<line-28> else:</line-28>
<line-29> x += 1</line-29>
<line-30> if x == -14:</line-30>
<line-31> y = 1</line-31>
<line-32> x = 0</line-32>
<line-33> for i in range(a):</line-33>
<line-34> ans[y][x] = s[i]</line-34>
<line-35> if y == 0:</line-35>
<line-36> x -= 1</line-36>
<line-37> else:</line-37>
<line-38> x += 1</line-38>
<line-39> if x == -14:</line-39>
<line-40> y = 1</line-40>
<line-41> x = 0</line-41>
<line-42> print("".join(ans[0]))</line-42>
<line-43> print("".join(ans[1]))</line-43>
<line-44> else:</line-44>
<line-45> for i in range((b - a) // 2):</line-45>
<line-46> ans[0][-(b - a) // 2 + i + 1] = s[a + i + 1]</line-46>
<line-47> ans[1][-i - 1] = s[a + i + (b - a) // 2]</line-47>
<line-48> x = -(b - a) // 2</line-48>
<line-49> y = 0</line-49>
<line-50> for i in range(b, n):</line-50>
<line-51> ans[y][x] = s[i]</line-51>
<line-52> if y == 0:</line-52>
<line-53> x -= 1</line-53>
<line-54> else:</line-54>
<line-55> x += 1</line-55>
<line-56> if x == -14:</line-56>
<line-57> y = 1</line-57>
<line-58> x = 0</line-58>
<line-59> for i in range(a):</line-59>
<line-60> ans[y][x] = s[i]</line-60>
<line-61> if y == 0:</line-61>
<line-62> x -= 1</line-62>
<line-63> else:</line-63>
<line-64> x += 1</line-64>
<line-65> if x == -14:</line-65>
<line-66> y = 1</line-66>
<line-67> x = 0</line-67>
<line-69> print("".join(ans[1]))</line-69>
<line-70></line-70>
<line-71></line-71>
<line-72></line-72>
|
{"code": "<line-3>s = input()</line-3>\n<line-68> print(\"\".join(ans[0]))</line-68>", "lines": [3, 68]}
#### 0
|
<line-1>import math</line-1>
<line-2></line-2>
<line-4></line-4>
<line-5>xly = x * math.log(y)</line-5>
<line-6>ylx = y * math.log(x)</line-6>
<line-7></line-7>
<line-8>if abs(xly - ylx) < 1e-8:</line-8>
<line-9> print('=')</line-9>
<line-10>elif ylx < xly:</line-10>
<line-11> print('<')</line-11>
<line-13> print('>')</line-13>
|
{"code": "<line-3>x, y = [int(v) for v in input().split()]</line-3>\n<line-12>else:</line-12>", "lines": [3, 12]}
#### 0
|
<line-1>from math import *</line-1>
<line-2></line-2>
<line-4>d = h % r</line-4>
<line-5></line-5>
<line-6>if d * 2 < r:</line-6>
<line-7> print(h // r * 2 + 1)</line-7>
<line-8>elif sqrt(3) * (r / 2) + r - 1e-6 <= d + r:</line-8>
<line-9> print(h // r * 2 + 3)</line-9>
<line-11> print(h // r * 2 + 2)</line-11>
|
{"code": "<line-3>r, h = list(map(int, input().split()))</line-3>\n<line-10>else:</line-10>", "lines": [3, 10]}
#### 0
|
<line-1>cards = list(map(int, input().split()))</line-1>
<line-2></line-2>
<line-4></line-4>
<line-5>for i in range(5):</line-5>
<line-6> cnt = cards.count(cards[i])</line-6>
<line-7> cnt = min(cnt, 3)</line-7>
<line-8> if cnt not in [2, 3]:</line-8>
<line-9> continue</line-9>
<line-11></line-11>
<line-12>print(result)</line-12>
|
{"code": "<line-3>result = sum(cards)</line-3>\n<line-10> result = min(result, sum(cards) - cnt * cards[i])</line-10>", "lines": [3, 10]}
#### 0
|
<line-1>from math import *</line-1>
<line-3>A = list(map(int, input().split()))</line-3>
<line-4>A.sort()</line-4>
<line-5>if n == 1:</line-5>
<line-6> print(0)</line-6>
<line-7> </line-7>
<line-8>else:</line-8>
<line-9> if a > A[-1]:</line-9>
<line-10> print(abs(a - A[1]))</line-10>
<line-11> elif a < A[0]:</line-11>
<line-12> print(abs(a - A[-2]))</line-12>
<line-13> else:</line-13>
<line-14> per1 = abs(A[0] - A[-2])</line-14>
<line-15> per2 = abs(A[1] - A[-1])</line-15>
<line-16> ans1 = abs(A[0] - a) + per1</line-16>
<line-17> ans2 = per1 + abs(A[-2] - a)</line-17>
<line-18> ans3 = per2 + abs(a - A[-1])</line-18>
<line-20> print(min(ans1, ans2, ans3, ans4))</line-20>
|
{"code": "<line-2>n, a = map(int, input().split())</line-2>\n<line-19> ans4 = per2 + abs(a - A[1])</line-19>", "lines": [2, 19]}
#### 0
|
<line-1>import re</line-1>
<line-3>from collections import Counter, deque</line-3>
<line-4></line-4>
<line-5>class Task:</line-5>
<line-6> maxDigitSum = 18 * 9</line-6>
<line-7> n = 0</line-7>
<line-8> answer = "" </line-8>
<line-9> </line-9>
<line-10> def getData(self):</line-10>
<line-11> self.n = int(input())</line-11>
<line-12> #inFile = open('input.txt', 'r')</line-12>
<line-13> #inFile.readline().rstrip()</line-13>
<line-14> #self.childs = inFile.readline().rstrip()</line-14>
<line-15></line-15>
<line-16> def solve(self):</line-16>
<line-17> if self.n == 1:</line-17>
<line-18> self.answer = '-1'</line-18>
<line-19> return</line-19>
<line-20></line-20>
<line-21> xL, xR = 0, self.n</line-21>
<line-22> while xL + self.maxDigitSum < xR:</line-22>
<line-23> xM = (xL + xR) // 2</line-23>
<line-24> if xM**2 + self.digitSum(xM) * xM < self.n:</line-24>
<line-25> for x in range(xM - 1, max(xL, xM - self.maxDigitSum) - 1, -1):</line-25>
<line-26> if x**2 + self.digitSum(x) * x == self.n:</line-26>
<line-27> self.answer = x</line-27>
<line-28> return</line-28>
<line-29> xL = xM</line-29>
<line-30> else:</line-30>
<line-31> for x in range(xM + 1, min(xR, xM + self.maxDigitSum) + 1):</line-31>
<line-32> if x**2 + self.digitSum(x) * x == self.n:</line-32>
<line-33> self.answer = x</line-33>
<line-34> return</line-34>
<line-35> xR = xM</line-35>
<line-36> for x in range(xL, xR + 1):</line-36>
<line-37> if x**2 + self.digitSum(x) * x == self.n:</line-37>
<line-38> self.answer = x</line-38>
<line-39> return</line-39>
<line-40> self.answer = -1</line-40>
<line-41></line-41>
<line-42> def digitSum(self, n):</line-42>
<line-43> return sum([int(x) for x in str(n)])</line-43>
<line-44></line-44>
<line-45> def printAnswer(self):</line-45>
<line-46> print(self.answer)</line-46>
<line-47> #outFile = open('output.txt', 'w')</line-47>
<line-48> #outFile.write(self.answer)</line-48>
<line-49></line-49>
<line-50>task = Task()</line-50>
<line-51>task.getData()</line-51>
<line-53>task.printAnswer()</line-53>
|
{"code": "<line-2>import itertools</line-2>\n<line-52>task.solve()</line-52>", "lines": [2, 52]}
#### 0
|
<line-1>s = input()</line-1>
<line-3>a, b = int(s[:2]), int(s[3:])</line-3>
<line-4>c, d = int(t[:2]), int(t[3:])</line-4>
<line-5>a -= c</line-5>
<line-6>b -= d</line-6>
<line-7>if b < 0:</line-7>
<line-8> a -= 1</line-8>
<line-9> b = 60 + b</line-9>
<line-10>if a < 0:</line-10>
<line-11> a = 24 + a</line-11>
<line-12>if a < 10:</line-12>
<line-13> print(0, end = '')</line-13>
<line-14>print(a, ':', end = '', sep = '')</line-14>
<line-15>if b < 10:</line-15>
<line-17>print(b)</line-17>
|
{"code": "<line-2>t = input()</line-2>\n<line-16> print(0, end = '')</line-16>", "lines": [2, 16]}
#### 0
|
<line-1>n = int(input())</line-1>
<line-3>m = max(a)</line-3>
<line-4></line-4>
<line-5>current = 0</line-5>
<line-6>longest = 0</line-6>
<line-7>for x in a:</line-7>
<line-8> if x == m:</line-8>
<line-9> current +=1</line-9>
<line-10> else:</line-10>
<line-11> longest = max(current,longest)</line-11>
<line-12> current = 0</line-12>
<line-14>print (longest)</line-14>
<line-15></line-15>
|
{"code": "<line-2>a = list(map(int,input().split()))</line-2>\n<line-13>longest = max(current,longest)</line-13>", "lines": [2, 13]}
#### 0
|
<line-1>import math</line-1>
<line-3>out=1</line-3>
<line-4>for i in range(k):</line-4>
<line-5> out*=(m-1)</line-5>
<line-6> out%=998244353</line-6>
<line-7>out*=m</line-7>
<line-8>out%=998244353</line-8>
<line-9>out*=(math.factorial(n-1)//math.factorial(k)//math.factorial(n-1-k))</line-9>
<line-11>print(out)</line-11>
|
{"code": "<line-2>n,m,k=map(int,input().split())</line-2>\n<line-10>out%=998244353</line-10>", "lines": [2, 10]}
#### 0
|
<line-1>n = input()</line-1>
<line-3>while n != '' and good:</line-3>
<line-4> if n.endswith('144'):</line-4>
<line-5> n = n[:-3]</line-5>
<line-6> elif n.endswith('14'):</line-6>
<line-7> n = n[:-2]</line-7>
<line-8> elif n.endswith('1'):</line-8>
<line-9> n = n[:-1]</line-9>
<line-10> else:</line-10>
<line-12>print('YES' if good else 'NO')</line-12>
|
{"code": "<line-2>good = True</line-2>\n<line-11> good = False</line-11>", "lines": [2, 11]}
#### 0
|
<line-1>n,m,i,j,a,b=list(map(int,input().split()))</line-1>
<line-2></line-2>
<line-4></line-4>
<line-5>if((i,j)==(n,1) or (i,j)==(1,1) or (i,j)==(1,m) or (i,j)==(n,m)):</line-5>
<line-6> print(0)</line-6>
<line-7></line-7>
<line-8>else:</line-8>
<line-9> #Corner (1,1)</line-9>
<line-10></line-10>
<line-11> hor=i-1</line-11>
<line-12> ver=j-1</line-12>
<line-13></line-13>
<line-14> if(hor%a==0 and ver%b==0):</line-14>
<line-15> x=hor//a</line-15>
<line-16> y=ver//b</line-16>
<line-17> if(x%2==y%2 and a<=n-1 and b<=m-1):</line-17>
<line-18> ans=min(ans,max(x,y))</line-18>
<line-19></line-19>
<line-20> #Corner (n,m)</line-20>
<line-21></line-21>
<line-22> hor=abs(i-n)</line-22>
<line-23> ver=abs(j-m)</line-23>
<line-24></line-24>
<line-25> if(hor%a==0 and ver%b==0):</line-25>
<line-26> x=hor//a</line-26>
<line-27> y=ver//b</line-27>
<line-28> if(x%2==y%2 and a<=n-1 and b<=m-1):</line-28>
<line-29> ans=min(ans,max(x,y))</line-29>
<line-30></line-30>
<line-31> #Corner (1,m)</line-31>
<line-32></line-32>
<line-33> hor=i-1</line-33>
<line-34> ver=abs(j-m)</line-34>
<line-35></line-35>
<line-36> if(hor%a==0 and ver%b==0):</line-36>
<line-37> x=hor//a</line-37>
<line-38> y=ver//b</line-38>
<line-39> if(x%2==y%2 and a<=n-1 and b<=m-1):</line-39>
<line-40> ans=min(ans,max(x,y))</line-40>
<line-41></line-41>
<line-42> #Corner (n,1)</line-42>
<line-43></line-43>
<line-44> hor=abs(n-i)</line-44>
<line-45> ver=j-1</line-45>
<line-46></line-46>
<line-47> if(hor%a==0 and ver%b==0):</line-47>
<line-48> x=hor//a</line-48>
<line-49> y=ver//b</line-49>
<line-50> if(x%2==y%2 and a<=n-1 and b<=m-1):</line-50>
<line-51> ans=min(ans,max(x,y))</line-51>
<line-52> if(ans!=100000000000):</line-52>
<line-53> print(ans)</line-53>
<line-55> print("Poor Inna and pony!")</line-55>
<line-56> </line-56>
|
{"code": "<line-3>ans=100000000000</line-3>\n<line-54> else:</line-54>", "lines": [3, 54]}
#### 0
|
<line-1>from sys import stdin</line-1>
<line-3></line-3>
<line-4>n = int(input())</line-4>
<line-5>s = list(input().strip())</line-5>
<line-6></line-6>
<line-7>for i in range(26):</line-7>
<line-8> char = chr(ord('z') - i)</line-8>
<line-9> prev = chr(ord('z') - i - 1)</line-9>
<line-10></line-10>
<line-11> updated = True</line-11>
<line-12> while updated:</line-12>
<line-13> updated = False</line-13>
<line-14> for idx in range(len(s)-1, -1, -1):</line-14>
<line-15> if s[idx] == char:</line-15>
<line-16> if idx < len(s)-1 and s[idx+1] == prev:</line-16>
<line-17> s.pop(idx)</line-17>
<line-18> updated = True</line-18>
<line-19> elif idx > 0 and s[idx-1] == prev:</line-19>
<line-20> s.pop(idx)</line-20>
<line-22></line-22>
<line-23>print( n - len(s))</line-23>
<line-24></line-24>
|
{"code": "<line-2>input = stdin.readline</line-2>\n<line-21> updated = True</line-21>", "lines": [2, 21]}
#### 0
|
<line-1>n, k = map(int, input().split())</line-1>
<line-3>q = int(input())</line-3>
<line-4></line-4>
<line-5># def isIn(x, fm, to):</line-5>
<line-6># if fm >= to:</line-6>
<line-7># return a[fm] == x</line-7>
<line-8># t = a[(fm+to) // 2]</line-8>
<line-9># if t > x:</line-9>
<line-10># return isIn(x, fm, (fm+to) // 2 - 1)</line-10>
<line-11># elif t < x:</line-11>
<line-12># return isIn(x, (fm+to) // 2 + 1, to)</line-12>
<line-13># else:</line-13>
<line-14># return True</line-14>
<line-15></line-15>
<line-16>for _ in range(q):</line-16>
<line-17> x = int(input())</line-17>
<line-18> if x in a:</line-18>
<line-19> print(1)</line-19>
<line-20> continue</line-20>
<line-21> found = False</line-21>
<line-22> for i in range(2, k + 1):</line-22>
<line-23> for j in range(1, i // 2 + 1):</line-23>
<line-24> for l in a:</line-24>
<line-25> t = x - l * j</line-25>
<line-26> if t % (i - j) != 0:</line-26>
<line-27> continue</line-27>
<line-28> # if isIn(t // (i - j), 0, n - 1):</line-28>
<line-29> if t // (i - j) in a:</line-29>
<line-30> print(i)</line-30>
<line-31> found = True</line-31>
<line-32> break</line-32>
<line-33> if found:</line-33>
<line-34> break</line-34>
<line-35> if found:</line-35>
<line-36> break</line-36>
<line-38> print(-1)</line-38>
|
{"code": "<line-2>a = set(map(int, input().split()))</line-2>\n<line-37>\tif not found:</line-37>", "lines": [2, 37]}
#### 0
|
<line-1>#!/usr/bin/env python3</line-1>
<line-2></line-2>
<line-4> try:</line-4>
<line-5> while True:</line-5>
<line-6> s, x1, x2 = list(map(int, input().split()))</line-6>
<line-7> t1, t2 = list(map(int, input().split()))</line-7>
<line-8> p, d = list(map(int, input().split()))</line-8>
<line-9></line-9>
<line-10> def travel(src, trg):</line-10>
<line-11> nonlocal d</line-11>
<line-12> if src == trg:</line-12>
<line-13> return 0</line-13>
<line-14> if src < trg:</line-14>
<line-15> if d > 0:</line-15>
<line-16> return trg - src</line-16>
<line-17> else:</line-17>
<line-18> d = 1</line-18>
<line-19> return trg + src</line-19>
<line-20> else:</line-20>
<line-21> if d < 0:</line-21>
<line-22> return src - trg</line-22>
<line-23> else:</line-23>
<line-24> d = -1</line-24>
<line-25> return s - src + s - trg</line-25>
<line-26></line-26>
<line-27> a = travel(p, x1)</line-27>
<line-28> b = travel(x1, x2)</line-28>
<line-29> print("%d" % min(abs(x1 - x2) * t2, (a + b) * t1))</line-29>
<line-30></line-30>
<line-31> except EOFError:</line-31>
<line-33></line-33>
<line-34>main()</line-34>
|
{"code": "<line-3>def main():</line-3>\n<line-32> pass</line-32>", "lines": [3, 32]}
#### 0
|
<line-1>n, x = map(int, input().split())</line-1>
<line-3>for i in range(n, 0, -1):</line-3>
<line-4> if x % i == 0 and x//i <= n:</line-4>
<line-6>print(ans)</line-6>
|
{"code": "<line-2>ans = 0</line-2>\n<line-5> ans += 1</line-5>", "lines": [2, 5]}
#### 0
|
<line-2>print(('abcdefghijklmnopqrstuvwxyz'[:k] * n)[:n])</line-2>
|
{"code": "<line-1>n, k = map(int, input().split())</line-1>", "lines": [1]}
#### 0
|
<line-1>import sys, math</line-1>
<line-3>s=input()</line-3>
<line-4>z=list(map(int,input().split()))</line-4>
<line-5>best = 10**9</line-5>
<line-6>for i in range(len(s)-1):</line-6>
<line-7> if s[i]=='R' and s[i+1]=='L':</line-7>
<line-8> best=min(best, z[i+1]-(z[i]+z[i+1])//2)</line-8>
<line-9>if best != 10**9:</line-9>
<line-10> print(best)</line-10>
<line-12> print(-1)</line-12>
|
{"code": "<line-2>n=int(input())</line-2>\n<line-11>else:</line-11>", "lines": [2, 11]}
#### 0
|
<line-1>R=lambda:list(map(int,input().split()))</line-1>
<line-3>xy = [R() for _ in range(n)]</line-3>
<line-4>ans = 0</line-4>
<line-5>def f(xy1, xy2):</line-5>
<line-6> tans = 0</line-6>
<line-7> for _ in range(2):</line-7>
<line-8> for __ in range(2):</line-8>
<line-9> if (xy1[0]+xy2[0]<=a and max(xy1[1], xy2[1])<=b) or\</line-9>
<line-10> (max(xy1[0], xy2[0])<=a and xy1[1]+xy2[1]<=b):</line-10>
<line-11> tans=max(tans, xy1[0]*xy1[1] + xy2[0]*xy2[1])</line-11>
<line-12> xy2[0], xy2[1] = xy2[1], xy2[0]</line-12>
<line-13> xy1[0], xy1[1] = xy1[1], xy1[0]</line-13>
<line-14> return tans</line-14>
<line-15>for i in range(n):</line-15>
<line-16> for j in range(i+1,n):</line-16>
<line-18>print(ans)</line-18>
|
{"code": "<line-2>n,a,b=R()</line-2>\n<line-17> ans=max(ans, f(xy[i], xy[j]))</line-17>", "lines": [2, 17]}
#### 0
|
<line-1>#!/usr/bin/env python</line-1>
<line-3></line-3>
<line-4>n = int(input())</line-4>
<line-5>k = (n << 2) + 1</line-5>
<line-6></line-6>
<line-7>x, y = [], []</line-7>
<line-8>for i in range(k):</line-8>
<line-9> xi, yi = list(map(int, input().split()))</line-9>
<line-10> x.append(xi)</line-10>
<line-11> y.append(yi)</line-11>
<line-12></line-12>
<line-13>for lx in range(0, 50):</line-13>
<line-14> for ly in range(0, 50):</line-14>
<line-15> for side_len in range(1, 51):</line-15>
<line-16> ok, idx = True, -1</line-16>
<line-17> for i in range(k):</line-17>
<line-18> if not (((x[i] == lx or x[i] == lx + side_len) and ly <= y[i] <= ly + side_len) or</line-18>
<line-19> ((lx <= x[i] <= lx + side_len) and (y[i] == ly or y[i] == ly + side_len))):</line-19>
<line-20> if idx != -1:</line-20>
<line-21> ok = False</line-21>
<line-22> else:</line-22>
<line-23> idx = i</line-23>
<line-24> if ok:</line-24>
<line-26> return</line-26>
|
{"code": "<line-2>import sys</line-2>\n<line-25> print(x[idx], y[idx])</line-25>", "lines": [2, 25]}
#### 0
|
<line-1>n = int(input())</line-1>
<line-3> ans = 1</line-3>
<line-4> while x > 0:</line-4>
<line-5> ans *= x % 10</line-5>
<line-6> x //= 10</line-6>
<line-7> return ans</line-7>
<line-8>ans = p(n)</line-8>
<line-9>for i in range(len(str(n))):</line-9>
<line-10> cans = 9 ** i * p((n // 10 ** i) - 1)</line-10>
<line-12>print(ans)</line-12>
|
{"code": "<line-2>def p(x):</line-2>\n<line-11> ans = max(ans, cans)</line-11>", "lines": [2, 11]}
#### 0
|
<line-1>n = int(input())</line-1>
<line-3>s = sum(a)</line-3>
<line-4>for k in range(max(a), 999999):</line-4>
<line-6> if vote > s: print(k); break</line-6>
|
{"code": "<line-2>a = list(map(int,input().split()))</line-2>\n<line-5> vote = sum(k-x for x in a)</line-5>", "lines": [2, 5]}
#### 0
|
<line-1>s = input()</line-1>
<line-2></line-2>
<line-4>a = []</line-4>
<line-5>char = []</line-5>
<line-6>for i in range(1, len(s)):</line-6>
<line-7> if s[i] == s[i-1]: cur_len += 1</line-7>
<line-8> else:</line-8>
<line-9> a.append(cur_len)</line-9>
<line-10> char.append(s[i-1])</line-10>
<line-11> cur_len = 1</line-11>
<line-12> </line-12>
<line-13>a.append(cur_len)</line-13>
<line-14>char.append(s[len(s)-1])</line-14>
<line-15></line-15>
<line-16>ans = 0</line-16>
<line-17>while len(a) > 1:</line-17>
<line-18> n = len(a)</line-18>
<line-19> inner_min = 100000000</line-19>
<line-20> for i in range(1,n-1):</line-20>
<line-21> if a[i] < inner_min: inner_min = a[i]</line-21>
<line-22> </line-22>
<line-23> k = min(a[0], a[n-1],(inner_min + 1)//2)</line-23>
<line-24> #print("a: ", a, "; k = ", k)</line-24>
<line-25> b = []</line-25>
<line-26> new_char = []</line-26>
<line-27> for i in range(n):</line-27>
<line-28> if i == 0 or i == n-1:</line-28>
<line-29> if a[i] > k:</line-29>
<line-30> b.append(a[i]-k)</line-30>
<line-31> new_char.append(char[i])</line-31>
<line-32> else:</line-32>
<line-33> if a[i] > 2*k:</line-33>
<line-34> b.append(a[i] - 2*k)</line-34>
<line-35> new_char.append(char[i])</line-35>
<line-36>## print(b)</line-36>
<line-37> ans += k</line-37>
<line-38> if len(b) > 1:</line-38>
<line-39> c = [0]*n</line-39>
<line-40> newnew_char = [new_char[0]]</line-40>
<line-41> count = 0</line-41>
<line-42> </line-42>
<line-43> for i in range(0,len(b)-1):</line-43>
<line-44> c[count] += b[i]</line-44>
<line-45> if new_char[i] == new_char[i+1]: continue</line-45>
<line-46> else:</line-46>
<line-47> count += 1</line-47>
<line-48> newnew_char.append(new_char[i+1])</line-48>
<line-49> if new_char[len(b)-2] == new_char[len(b) - 1]: c[count] += b[len(b)-1]</line-49>
<line-50> else:</line-50>
<line-51> #count += 1</line-51>
<line-52> newnew_char.append(new_char[i+1])</line-52>
<line-53> c[count] = b[len(b)-1]</line-53>
<line-54> a = c[:count+1]</line-54>
<line-55> char = newnew_char[:]</line-55>
<line-56> else:</line-56>
<line-58></line-58>
<line-59>print(ans)</line-59>
<line-60> </line-60>
|
{"code": "<line-3>cur_len = 1</line-3>\n<line-57> a = b[:]</line-57>", "lines": [3, 57]}
#### 0
|
<line-1>n=int(input())</line-1>
<line-3>l=[]</line-3>
<line-4>for val in inp:</line-4>
<line-5> l.append(int(val))</line-5>
<line-6>l.sort()</line-6>
<line-7>count=3</line-7>
<line-8>while(count<n and l[count]==l[count-1]):</line-8>
<line-9> count+=1</line-9>
<line-10>if(l[2]!=l[1]):</line-10>
<line-11> print(count-2)</line-11>
<line-12>elif(l[2]!=l[0]):</line-12>
<line-13> print(((count-1)*(count-2))//2)</line-13>
<line-15> print((count*(count-1)*(count-2))//6)</line-15>
|
{"code": "<line-2>inp=input().split()</line-2>\n<line-14>else:</line-14>", "lines": [2, 14]}
#### 0
|
<line-2>if n==1: print(0)</line-2>
<line-3>else: print(n if n%2==1 else n//2)</line-3>
|
{"code": "<line-1>n=int(input())+1</line-1>", "lines": [1]}
#### 0
|
<line-1>n = int(input())</line-1>
<line-3> print(n)</line-3>
<line-4>else:</line-4>
<line-6> print(max(int(n[:-1]), int(n[:-2] + n[-1])))</line-6>
|
{"code": "<line-2>if n >= 0:</line-2>\n<line-5> n = str(n)</line-5>", "lines": [2, 5]}
#### 0
|
<line-1>a, b = input().split(' ')</line-1>
<line-3></line-3>
<line-4>d = {'v': 0, '>': 1, '^': 2, '<': 3}</line-4>
<line-5></line-5>
<line-6>a, b = d[a], d[b]</line-6>
<line-7></line-7>
<line-8>ccw = bool((a + n) % 4 == b)</line-8>
<line-9>cw = bool((a - n) % 4 == b)</line-9>
<line-10></line-10>
<line-11>if cw and not ccw:</line-11>
<line-12> print('cw')</line-12>
<line-13>elif ccw and not cw:</line-13>
<line-14> print('ccw')</line-14>
<line-16> print('undefined')</line-16>
|
{"code": "<line-2>n = int(input())</line-2>\n<line-15>else:</line-15>", "lines": [2, 15]}
#### 0
|
<line-1>n = int(input())</line-1>
<line-3>nextl = [-1] * n</line-3>
<line-4>lastr = [-1] * n</line-4>
<line-5>ll = -1</line-5>
<line-6>for i in range(n):</line-6>
<line-7> if a[i] == "R":</line-7>
<line-8> ll = i</line-8>
<line-9> if a[i] == "L":</line-9>
<line-10> ll = -1</line-10>
<line-11> lastr[i] = ll</line-11>
<line-12>nl = -1</line-12>
<line-13>for i in range(n - 1, -1, -1):</line-13>
<line-14> if a[i] == "L":</line-14>
<line-15> nl = i</line-15>
<line-16> if a[i] == "R":</line-16>
<line-17> nl = -1</line-17>
<line-18> nextl[i] = nl</line-18>
<line-19>ans = 0</line-19>
<line-20>#print(lastr)</line-20>
<line-21>#print(nextl)</line-21>
<line-22>for i in range(n):</line-22>
<line-23> if nextl[i] == lastr[i] == -1:</line-23>
<line-24> ans += 1</line-24>
<line-25> if nextl[i] == -1 or lastr[i] == -1:</line-25>
<line-26> continue</line-26>
<line-27> d1 = nextl[i] - i</line-27>
<line-28> d2 = i - lastr[i]</line-28>
<line-29> if d1 == d2:</line-29>
<line-31>print(ans)</line-31>
|
{"code": "<line-2>a = input().strip()</line-2>\n<line-30> ans += 1</line-30>", "lines": [2, 30]}
#### 0
|
<line-1></line-1>
<line-2>import sys</line-2>
<line-4>input=sys.stdin.readline</line-4>
<line-5></line-5>
<line-6>n,m=map(int,input().split())</line-6>
<line-7></line-7>
<line-8>l=list(map(int,input().split()))</line-8>
<line-9>for i in range(len(l)):</line-9>
<line-10> l[i]-=1</line-10>
<line-11></line-11>
<line-12>use=[0]*n</line-12>
<line-13>a=[0]*n</line-13>
<line-14>bad=0</line-14>
<line-15></line-15>
<line-16>for i in range(len(l)-1):</line-16>
<line-17> # transfer l[i] to l[i+1]</line-17>
<line-18> if a[l[i]] and a[l[i]]%n!=(l[i+1]-l[i])%n:</line-18>
<line-19> bad=1</line-19>
<line-20> break</line-20>
<line-21> use[(l[i+1]-l[i])%n]=1</line-21>
<line-22> a[l[i]]=(l[i+1]-l[i])%n</line-22>
<line-23> if a[l[i]]==0: a[l[i]]=n</line-23>
<line-24></line-24>
<line-25>if not bad:</line-25>
<line-26> # fill in gaps</line-26>
<line-27> for i in range(n):</line-27>
<line-28> if a[i]==0:</line-28>
<line-29> for j in range(1,n+1):</line-29>
<line-30> if not use[j%n]:</line-30>
<line-31> a[i]=j</line-31>
<line-32> use[j%n]=1</line-32>
<line-33> break</line-33>
<line-34> if sum(use)==n:</line-34>
<line-35> print(" ".join(map(str,a)))</line-35>
<line-36> else:</line-36>
<line-37> print("-1")</line-37>
<line-39> print("-1")</line-39>
|
{"code": "<line-3>#sys.stdin=open(\"data.txt\")</line-3>\n<line-38>else:</line-38>", "lines": [3, 38]}
#### 0
|
<line-1>a, k = input().split()</line-1>
<line-3>a = [i for i in a]</line-3>
<line-4>i = 0</line-4>
<line-5>while k > 0 and i < len(a):</line-5>
<line-6> m = a[i : i + k + 1].index(max(a[i : i + k + 1]))</line-6>
<line-7> if a[i + m] > a[i]:</line-7>
<line-8> k -= m</line-8>
<line-9> for j in range(i + m, i, -1):</line-9>
<line-10> a[j], a[j - 1] = a[j - 1], a[j]</line-10>
<line-12>print("".join(a))</line-12>
|
{"code": "<line-2>k = int(k)</line-2>\n<line-11> i += 1</line-11>", "lines": [2, 11]}
#### 0
|
<line-1>def isZ(a):</line-1>
<line-3>def geom(a,b,c,d):</line-3>
<line-4> if 0 in (a,b,c,d) and not (a==b==c==d==0):</line-4>
<line-5> return False</line-5>
<line-6> if(b/a==c/b==d/c):</line-6>
<line-7> nxt = d * (d/c)</line-7>
<line-8> if not isZ(nxt): return False</line-8>
<line-9> print(int(nxt))</line-9>
<line-10> return True</line-10>
<line-11> return False</line-11>
<line-12>def ar(a,b,c,d):</line-12>
<line-13> if(b-a==c-b==d-c):</line-13>
<line-14> print(int(2*d-c))</line-14>
<line-15> return True</line-15>
<line-16> return False</line-16>
<line-17></line-17>
<line-18>a,b,c,d = map(float,input().split())</line-18>
<line-20> print(42)</line-20>
|
{"code": "<line-2> return a == int(a)</line-2>\n<line-19>if not geom(a,b,c,d) and not ar(a,b,c,d):</line-19>", "lines": [2, 19]}
#### 0
|
<line-1>import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,copy,functools</line-1>
<line-2></line-2>
<line-4>inf = 10**20</line-4>
<line-5>eps = 1.0 / 10**10</line-5>
<line-6>mod = 10**9+7</line-6>
<line-7>dd = [(-1,0),(0,1),(1,0),(0,-1)]</line-7>
<line-8>ddn = [(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]</line-8>
<line-9></line-9>
<line-10>def LI(): return tuple(map(int, sys.stdin.readline().split()))</line-10>
<line-11>def LLI(): return [tuple(map(int, l.split())) for l in sys.stdin]</line-11>
<line-12>def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]</line-12>
<line-13>def LF(): return [float(x) for x in sys.stdin.readline().split()]</line-13>
<line-14>def LS(): return sys.stdin.readline().split()</line-14>
<line-15>def I(): return int(sys.stdin.readline())</line-15>
<line-16>def F(): return float(sys.stdin.readline())</line-16>
<line-17>def S(): return input()</line-17>
<line-18>def pf(s): return print(s, flush=True)</line-18>
<line-19></line-19>
<line-20>def main():</line-20>
<line-21> n = I()</line-21>
<line-22> a = LI()</line-22>
<line-23> b = a[0]</line-23>
<line-24> c = a[-1]</line-24>
<line-25> r = 0</line-25>
<line-26> for i in range(n-1,-1,-1):</line-26>
<line-27> if a[i] != b:</line-27>
<line-28> r = i</line-28>
<line-29> break</line-29>
<line-30></line-30>
<line-31> for i in range(n):</line-31>
<line-32> if a[i] != b:</line-32>
<line-33> t = n-1 - i</line-33>
<line-34> if r < t:</line-34>
<line-35> r = t</line-35>
<line-36></line-36>
<line-38></line-38>
<line-39>print(main())</line-39>
<line-40></line-40>
<line-41></line-41>
|
{"code": "<line-3>sys.setrecursionlimit(10**7)</line-3>\n<line-37> return r</line-37>", "lines": [3, 37]}
#### 0
|
<line-1>n, m, k = list(map(int, input().split()))</line-1>
<line-3>print((k - 1) % (2 * m) // 2 + 1, end=" ")</line-3>
<line-4>if ((k - 1) % (2 * m) % 2 == 0):</line-4>
<line-5> print("L")</line-5>
<line-7> print("R")</line-7>
|
{"code": "<line-2>print((k - 1) // (2 * m) + 1, end=\" \")</line-2>\n<line-6>else:</line-6>", "lines": [2, 6]}
#### 0
|
<line-1>def main():</line-1>
<line-3> s = input()</line-3>
<line-4> </line-4>
<line-5> b, g, r = [s.count(i) for i in "BGR"]</line-5>
<line-6> </line-6>
<line-7> if min(b, g, r) > 0:</line-7>
<line-8> print("BGR")</line-8>
<line-9> return</line-9>
<line-10> if max(b, g, r) == n:</line-10>
<line-11> if b == n: print("B")</line-11>
<line-12> if g == n: print("G")</line-12>
<line-13> if r == n: print("R")</line-13>
<line-14> return</line-14>
<line-15> if max(b, g, r) == 1:</line-15>
<line-16> if b == 0: print("B")</line-16>
<line-17> if g == 0: print("G")</line-17>
<line-18> if r == 0: print("R")</line-18>
<line-19> return</line-19>
<line-20> if max(b, g, r) == n - 1:</line-20>
<line-21> if b == n - 1: print("GR")</line-21>
<line-22> if g == n - 1: print("BR")</line-22>
<line-23> if r == n - 1: print("BG")</line-23>
<line-24> return </line-24>
<line-25> </line-25>
<line-27> </line-27>
<line-28> </line-28>
<line-29>main()</line-29>
|
{"code": "<line-2> n = int(input())</line-2>\n<line-26> print(\"BGR\")</line-26>", "lines": [2, 26]}
#### 0
|
<line-1>def dfs(v, x, y, t, l, pr):</line-1>
<line-3> nx = [(l, 0), (0, -l), (-l, 0), (0, l)]</line-3>
<line-4> if t == 0: p = 0, 1, 3</line-4>
<line-5> if t == 1: p = 0, 1, 2</line-5>
<line-6> if t == 2: p = 1, 2, 3</line-6>
<line-7> if t == 3: p = 0, 2, 3</line-7>
<line-8> listv = [u for u in g[v] if u != pr]</line-8>
<line-9> g[v] = listv[:]</line-9>
<line-10> for i in range(min(len(p), len(g[v]))):</line-10>
<line-11> dx = nx[p[i]][0]</line-11>
<line-12> dy = nx[p[i]][1]</line-12>
<line-13> newx = x + dx</line-13>
<line-14> newy = y + dy</line-14>
<line-15> u = g[v][i]</line-15>
<line-16> dfs(u, newx, newy, p[i], l // 4, v)</line-16>
<line-17></line-17>
<line-18>read = lambda: map(int, input().split())</line-18>
<line-19>n = int(input())</line-19>
<line-20>g = [list() for i in range(n + 1)]</line-20>
<line-21>for i in range(n - 1):</line-21>
<line-22> u, v = read()</line-22>
<line-23> g[u].append(v)</line-23>
<line-24> g[v].append(u)</line-24>
<line-25>def fail():</line-25>
<line-26> print('NO')</line-26>
<line-27> return</line-27>
<line-28>root = 1</line-28>
<line-29>for i in range(n + 1):</line-29>
<line-30> if len(g[i]) > 4:</line-30>
<line-31> fail()</line-31>
<line-32> if len(g[i]) > len(g[root]):</line-32>
<line-33> root = i</line-33>
<line-34>ans = [0] * (n + 1)</line-34>
<line-35>ans[root] = (0, 0)</line-35>
<line-36>inf = 10 ** 18</line-36>
<line-37>l = inf // 4</line-37>
<line-38>nx = [(l, 0), (0, -l), (-l, 0), (0, l)]</line-38>
<line-39>for i in range(len(g[root])):</line-39>
<line-40> dx = nx[i][0]</line-40>
<line-41> dy = nx[i][1]</line-41>
<line-42> newx = 0 + dx</line-42>
<line-43> newy = 0 + dy </line-43>
<line-44> dfs(g[root][i], newx, newy, i, l // 4, root)</line-44>
<line-46>[print(*i) for i in ans[1:]]</line-46>
|
{"code": "<line-2> ans[v] = x, y</line-2>\n<line-45>print('YES')</line-45>", "lines": [2, 45]}
#### 0
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.