question stringlengths 0 30.2k | answer stringlengths 55 2.44k |
|---|---|
<line-1>a,b=list(map(int,input().split()))</line-1>
<line-3></line-3>
<line-4></line-4>
<line-5>x,y=list(map(int,input().split()))</line-5>
<line-6>z,w=list(map(int,input().split()))</line-6>
<line-7></line-7>
<line-8></line-8>
<line-9>Team1=False</line-9>
<line-10>Team2=False</line-10>
<line-11>if(a>w and a>y and d>x ... | {"code": "<line-2>c,d=list(map(int,input().split()))</line-2>\n<line-25>else:</line-25>", "lines": [2, 25]}
#### 0 |
<line-1>import sys</line-1>
<line-3>from math import sqrt</line-3>
<line-4>import numpy as np</line-4>
<line-5></line-5>
<line-6>read = sys.stdin.read</line-6>
<line-7>readline = sys.stdin.readline</line-7>
<line-8></line-8>
<line-9></line-9>
<line-10>def main():</line-10>
<line-11> N, K, *xyc = list(map(int, read()... | {"code": "<line-2>from itertools import combinations</line-2>\n<line-61> main()</line-61>", "lines": [2, 61]}
#### 0 |
<line-1>n=int(input())</line-1>
<line-3>left=0</line-3>
<line-4>right=0</line-4>
<line-5>left_ques=0</line-5>
<line-6>right_ques=0</line-6>
<line-7>for i in range(n):</line-7>
<line-8> if i<n//2:</line-8>
<line-9> if s[i]=='?':</line-9>
<line-10> left_ques+=1</line-10>
<line-11> else :</line... | {"code": "<line-2>s=input()</line-2>\n<line-43> else :</line-43>", "lines": [2, 43]}
#### 0 |
<line-1># AC</line-1>
<line-3></line-3>
<line-4></line-4>
<line-5>class Main:</line-5>
<line-6> def __init__(self):</line-6>
<line-7> self.buff = None</line-7>
<line-8> self.index = 0</line-8>
<line-9></line-9>
<line-10> def __next__(self):</line-10>
<line-11> if self.buff is None or self.ind... | {"code": "<line-2>import sys</line-2>\n<line-48> Main().solve()</line-48>", "lines": [2, 48]}
#### 0 |
<line-1>def nck(n, k, cache = {}):</line-1>
<line-3> if k == 0 or k == n: return 1</line-3>
<line-4> if k*2 > n: k = n-k</line-4>
<line-5> if (n, k) in cache: return cache[(n, k)]</line-5>
<line-6></line-6>
<line-7> z = cache[(n, k)] = nck(n-1, k-1) + nck(n-1, k)</line-7>
<line-8> return z</line-8>
<line... | {"code": "<line-2> if k > n or k < 0: return 0</line-2>\n<line-36>m, k = [int(x) for x in input().split()]</line-36>", "lines": [2, 36]}
#### 0 |
<line-1>kk=0</line-1>
<line-3>y = input()</line-3>
<line-4>z = [i for i in range(len(y)) if y[i] == '*']</line-4>
<line-5>for i in range(0, 100):</line-5>
<line-6> for j in range(1, 100):</line-6>
<line-7> if i in z and i+j in z and i+2*j in z and i+3*j in z and i+4*j in z:</line-7>
<line-8> kk=1</... | {"code": "<line-2>x = int(input())</line-2>\n<line-11>else:</line-11>", "lines": [2, 11]}
#### 0 |
<line-1>#!/usr/bin/env python3</line-1>
<line-3></line-3>
<line-4>def func():</line-4>
<line-5> N = int(input())</line-5>
<line-6> cells = [0] * N</line-6>
<line-7></line-7>
<line-8> if N == 1:</line-8>
<line-9> return 1</line-9>
<line-10></line-10>
<line-11> mx = 0</line-11>
<line-12> for n in ra... | {"code": "<line-2># -*- coding: utf-8 -*-</line-2>\n<line-37> return ans</line-37>", "lines": [2, 37]}
#### 0 |
<line-1>n = int(input())</line-1>
<line-3>a = []</line-3>
<line-4>for i in range(n):</line-4>
<line-5> a.append(int(input()))</line-5>
<line-6></line-6>
<line-7>mx = max(a) + m</line-7>
<line-8></line-8>
<line-9></line-9>
<line-10></line-10>
<line-11>while m:</line-11>
<line-12> for i in range(n):</line-12>
<line... | {"code": "<line-2>m = int(input())</line-2>\n<line-16> break</line-16>", "lines": [2, 16]}
#### 0 |
<line-1>MOD = 10 ** 9 + 7</line-1>
<line-3>n = int(n)</line-3>
<line-4>m = int(m)</line-4>
<line-5>ans = pow(2 * (n + 1), m, MOD)</line-5>
<line-6>ans = (ans * (n + 1 - m)) % MOD</line-6>
<line-8>print(ans)</line-8> | {"code": "<line-2>n, m = input().split(' ')</line-2>\n<line-7>ans = (ans * pow(n + 1, MOD - 2, MOD)) % MOD</line-7>", "lines": [2, 7]}
#### 0 |
<line-1># author: ThePonyCoder</line-1>
<line-3># filename: f.py</line-3>
<line-4># path: C:/Users/User/Desktop/python/Prog/CodeForces/rounds/cf_568/f.py</line-4>
<line-5></line-5>
<line-6>import os</line-6>
<line-7></line-7>
<line-8># import random</line-8>
<line-9></line-9>
<line-10># sys.setrecursionlimit(9999999... | {"code": "<line-2># created: 23.06.2019, 21:58</line-2>\n<line-133> print(*aans, sep=' ')</line-133>", "lines": [2, 133]}
#### 0 |
<line-1>M,S=list(map(int,input().split()))</line-1>
<line-2></line-2>
<line-4> print('0 0')</line-4>
<line-5> return</line-5>
<line-6>elif S==0 or M*9 < S:</line-6>
<line-7> print('-1 -1')</line-7>
<line-8> return</line-8>
<line-9></line-9>
<line-10>m,s=M,S</line-10>
<line-11>l=[]</line-11>
<line-12>if s<=(m-1)*9+1... | {"code": "<line-3>if S==0 and M==1:</line-3>\n<line-30> s=0</line-30>", "lines": [3, 30]}
#### 0 |
<line-1></line-1>
<line-2></line-2>
<line-3></line-3>
<line-4>l, r, k =list(map(int,input().split()))</line-4>
<line-5></line-5>
<line-7></line-7>
<line-8>cache = {}</line-8>
<line-9></line-9>
<line-10>def can(i, m):</line-10>
<line-11> return d[i] & m</line-11>
<line-12></line-12>
<line-13>def calc(m):</line-13>
<l... | {"code": "<line-6>d = {i:2**i for i in range(10)}</line-6>\n<line-65>#print(call(r, k) - call(l-1, k))</line-65>", "lines": [6, 65]}
#### 0 |
<line-1>#!/usr/bin/env python3</line-1>
<line-2></line-2>
<line-4></line-4>
<line-5>[n, k, d] = list(map(int, input().strip().split()))</line-5>
<line-6>ais = list(map(int, input().strip().split()))</line-6>
<line-7>if k == 1:</line-7>
<line-8> print ('YES')</line-8>
<line-9> return</line-9>
<line-10></line-10>
<line-1... | {"code": "<line-3>from bisect import bisect</line-3>\n<line-34>else:</line-34>", "lines": [3, 34]}
#### 0 |
<line-1>s = input()</line-1>
<line-3>t = 'RBYG'</line-3>
<line-4>for i in t:</line-4>
<line-5> ind = s.find(i) % 4</line-5>
<line-6> ans = 0</line-6>
<line-7> while ind < n:</line-7>
<line-8> ans += s[ind] == '!'</line-8>
<line-10> print(ans, end=' ')</line-10> | {"code": "<line-2>n = len(s)</line-2>\n<line-9>\t\tind += 4</line-9>", "lines": [2, 9]}
#### 0 |
<line-1>n, m = list(map(int, input().split()))</line-1>
<line-3>edges_to = [[] for _ in range(n)]</line-3>
<line-4></line-4>
<line-5>for _ in range(m):</line-5>
<line-6> _from, to = [int(x)-1 for x in input().split()]</line-6>
<line-7> edges_from[_from].append(to)</line-7>
<line-8></line-8>
<line-9>E_dist_to_goal... | {"code": "<line-2>edges_from = [[] for _ in range(n)]</line-2>\n<line-38> answers.append(candidate)</line-38>", "lines": [2, 38]}
#### 0 |
<line-2></line-2>
<line-3>n = int(input())</line-3>
<line-4>print(10 * round(n / 10))</line-4> | {"code": "<line-1>import math</line-1>", "lines": [1]}
#### 0 |
<line-1>a = input()</line-1>
<line-3></line-3>
<line-4>symbols = {}</line-4>
<line-5>pairs = []</line-5>
<line-6></line-6>
<line-7>for i in range(len(a)):</line-7>
<line-8> if a[i] in symbols:</line-8>
<line-9> if symbols[a[i]] != b[i]:</line-9>
<line-10> print('-1')</line-10>
<line-11> ... | {"code": "<line-2>b = input()</line-2>\n<line-23> for elem in pairs:</line-23>", "lines": [2, 23]}
#### 0 |
<line-1>from collections import *</line-1>
<line-3>import sys</line-3>
<line-4></line-4>
<line-5>def main():</line-5>
<line-6> a, b = input().split()</line-6>
<line-7> ans = a + b</line-7>
<line-8> n = len(a)</line-8>
<line-9> m = len(b)</line-9>
<line-10> for i in range(1, n + 1):</line-10>
<line-11> ... | {"code": "<line-2>import itertools</line-2>\n<line-15> print(ans)</line-15>", "lines": [2, 15]}
#### 0 |
<line-1>n = int(input())</line-1>
<line-3>d = [0] * n</line-3>
<line-4>cd = 0</line-4>
<line-5>xp = []</line-5>
<line-6>for i in range(n):</line-6>
<line-7> if x[i] == '[':</line-7>
<line-8> d[i] = cd</line-8>
<line-9> cd = cd + 1</line-9>
<line-10> else:</line-10>
<line-11> cd = cd - 1</line-11>
<line-12> d[i] = c... | {"code": "<line-2>x = input()</line-2>\n<line-37>for i in range(h):</line-37>", "lines": [2, 37]}
#### 0 |
<line-1>u = v = 0</line-1>
<line-3>n, m = len(a), len(b)</line-3>
<line-4>if n > m: b = '0' * (n - m) + b</line-4>
<line-5>else: a = '0' * (m - n) + a</line-5>
<line-6>for i in range(max(n, m)):</line-6>
<line-7> u, v = v + u, u + int(a[i]) - int(b[i])</line-7>
<line-8> if u > 1:</line-8>
<line-9> print('>... | {"code": "<line-2>a, b = input(), input()</line-2>\n<line-17>elif u <= 0 and d <= 0: print('<')</line-17>", "lines": [2, 17]}
#### 0 |
<line-1>n = int(input())</line-1>
<line-3>sol = []</line-3>
<line-4>for i in range(6):</line-4>
<line-5> c = ['purple', 'green', 'blue', 'orange', 'red', 'yellow'][i]</line-5>
<line-6> if c not in a:</line-6>
<line-7> sol.append(['Power', 'Time', 'Space', 'Soul', 'Reality', 'Mind'][i])</line-7>
<line-8>pri... | {"code": "<line-2>a = [input() for i in range(n)]</line-2>\n<line-9>for i in sol:</line-9>", "lines": [2, 9]}
#### 0 |
<line-1>import sys</line-1>
<line-3></line-3>
<line-4>cnt = 0</line-4>
<line-5>l = [set([x]) for x in range(1, n+1)]</line-5>
<line-6></line-6>
<line-7>while 1:</line-7>
<line-8> l = list([tup[0] | tup[1] for tup in zip(l[::2], l[1::2])])</line-8>
<line-9> cnt += 1</line-9>
<line-10> for el in l:</line-10>
<li... | {"code": "<line-2>n, a, b = list(map(int, input().split()))</line-2>\n<line-12> print(cnt if len(el) < n else 'Final!')</line-12>", "lines": [2, 12]}
#### 0 |
<line-1>import sys</line-1>
<line-2></line-2>
<line-4>p = [int(i) for i in input().split()]</line-4>
<line-5>b = [int(i) for i in input().split()]</line-5>
<line-6></line-6>
<line-7>ans = 0</line-7>
<line-8>num_cycles = 0</line-8>
<line-9>checked = set()</line-9>
<line-10></line-10>
<line-11>for i in range(n):</line-11... | {"code": "<line-3>n = int(input())</line-3>\n<line-26>ans += (sum(b) % 2) == 0</line-26>", "lines": [3, 26]}
#### 0 |
<line-1>v1, v2 = list(map(int, input().split()))</line-1>
<line-3>vm = [0] * t</line-3>
<line-4></line-4>
<line-5>v = v1</line-5>
<line-6>for i in range(t):</line-6>
<line-7> vm[i] = v</line-7>
<line-8> v += d</line-8>
<line-9></line-9>
<line-10>v = v2</line-10>
<line-11>for i in range(t - 1, -1, -1):</line-11>
<... | {"code": "<line-2>t, d = list(map(int, input().split()))</line-2>\n<line-13> v += d</line-13>", "lines": [2, 13]}
#### 0 |
<line-1>import sys</line-1>
<line-3>from itertools import permutations, accumulate</line-3>
<line-4>import heapq</line-4>
<line-5>import bisect</line-5>
<line-6>from operator import itemgetter</line-6>
<line-7></line-7>
<line-8>def dijkstra(start, edge):</line-8>
<line-9> n = len(edge)</line-9>
<line-10> dist = [... | {"code": "<line-2>input = sys.stdin.readline</line-2>\n<line-53> ans = min(ans, f(K))</line-53>", "lines": [2, 53]}
#### 0 |
<line-1>a, b = map(int, input().split())</line-1>
<line-2></line-2>
<line-4> print(0)</line-4>
<line-5>else:</line-5>
<line-6> s = 1</line-6>
<line-7> for i in range(a + 1, b + 1):</line-7>
<line-9> print(str(s)[-1])</line-9> | {"code": "<line-3>if b - a > 10:</line-3>\n<line-8>\t\ts *= i</line-8>", "lines": [3, 8]}
#### 0 |
<line-1>'''input</line-1>
<line-3>1001</line-3>
<line-4>'''</line-4>
<line-5></line-5>
<line-6>def list_input():</line-6>
<line-7> return list(map(int,input().split()))</line-7>
<line-8>def map_input():</line-8>
<line-9> return map(int,input().split())</line-9>
<line-10>def map_string():</line-10>
<line-11> re... | {"code": "<line-2>4 2</line-2>\n<line-25>\tcnt += 1</line-25>", "lines": [2, 25]}
#### 0 |
<line-1>def prime(x):</line-1>
<line-3> return False</line-3>
<line-4> if x == 2:</line-4>
<line-5> return True</line-5>
<line-6> if x % 2 == 0:</line-6>
<line-7> return False</line-7>
<line-8></line-8>
<line-9> for d in range(3, x, 2):</line-9>
<line-10> if d * d > x:</line-10>
<li... | {"code": "<line-2> if x < 2:</line-2>\n<line-24> print(ans)</line-24>", "lines": [2, 24]}
#### 0 |
<line-1>3</line-1>
<line-3>#</line-3>
<line-4># This program is free software; you can redistribute it and/or</line-4>
<line-5># modify it under the terms of the GNU General Public License as</line-5>
<line-6># published by the Free Software Foundation; version 3</line-6>
<line-7>#</line-7>
<line-8># This program is di... | {"code": "<line-2># Copyright (C) 2016 Sayutin Dmitry.</line-2>\n<line-24> print(\"YES\" if ans else \"NO\")</line-24>", "lines": [2, 24]}
#### 0 |
<line-1>k = []</line-1>
<line-2></line-2>
<line-4>c, d = list(map(int, input().split(' ')))</line-4>
<line-5>for i in range(x):</line-5>
<line-6> a, b = list(map(int, input().split(' ')))</line-6>
<line-7> k.append([c*a+b, d*a+b])</line-7>
<line-8></line-8>
<line-9>k.sort()</line-9>
<line-10>for i in range(len(k)... | {"code": "<line-3>x = int(input())</line-3>\n<line-13> quit()</line-13>", "lines": [3, 13]}
#### 0 |
<line-2></line-2>
<line-3>print(1 + n // 2)</line-3> | {"code": "<line-1>n = int(input())</line-1>", "lines": [1]}
#### 0 |
<line-1>import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,copy,functools</line-1>
<line-2></line-2>
<line-4>inf = 10**20</line-4>
<line-5>gosa = 1.0 / 10**10</line-5>
<line-6>mod = 10**9+7</line-6>
<line-7></line-7>
<line-8>def LI(): return [int(x) for x in sys.stdin.readline().sp... | {"code": "<line-3>sys.setrecursionlimit(10**7)</line-3>\n<line-22> return \"1 {}\".format(min(n-k, k*2))</line-22>", "lines": [3, 22]}
#### 0 |
<line-1>n = int(input())</line-1>
<line-3>cur = 1</line-3>
<line-4>lst = 1</line-4>
<line-5>while cur + lst <= n:</line-5>
<line-6> cur, lst = cur + lst, cur</line-6>
<line-8>print(x)</line-8> | {"code": "<line-2>x = 0</line-2>\n<line-7> x += 1</line-7>", "lines": [2, 7]}
#### 0 |
<line-1>s = input()</line-1>
<line-3>d['V'] = 'K'</line-3>
<line-4>d['K'] = 'V'</line-4>
<line-5>m = s.count('VK')</line-5>
<line-6>s = list(s)</line-6>
<line-7>for i in range(len(s)):</line-7>
<line-8> s[i] = d[s[i]]</line-8>
<line-9> m = max(m,''.join(s).count('VK'))</line-9>
<line-11>print(m)</line-11> | {"code": "<line-2>d = dict()</line-2>\n<line-10> s[i] = d[s[i]]</line-10>", "lines": [2, 10]}
#### 0 |
<line-1>n = int(input())</line-1>
<line-2></line-2>
<line-4></line-4>
<line-5>while a * b < n:</line-5>
<line-6> if a < b:</line-6>
<line-7> a += 1</line-7>
<line-8> else:</line-8>
<line-10></line-10>
<line-11>print(a+b)</line-11> | {"code": "<line-3>a = b = 1</line-3>\n<line-9> b += 1</line-9>", "lines": [3, 9]}
#### 0 |
<line-1>def l2i(s):</line-1>
<line-3>a, b=l2i(input())</line-3>
<line-4>t=0</line-4>
<line-5>while (a<=b):</line-5>
<line-6> a*=3</line-6>
<line-7> b*=2</line-7>
<line-9>print(t)</line-9> | {"code": "<line-2>\treturn [int(i) for i in s.split()]</line-2>\n<line-8>\tt+=1</line-8>", "lines": [2, 8]}
#### 0 |
<line-1>h, n = list(map(int, input().split()))</line-1>
<line-3>r = 0</line-3>
<line-4>while m > 1:</line-4>
<line-5> if c == 0:</line-5>
<line-6> if n > m // 2:</line-6>
<line-7> r += m - 1</line-7>
<line-8> n -= m // 2</line-8>
<line-9> c = 1 - c</line-9>
<line-10> else:<... | {"code": "<line-2>c, m = 0, 2 ** h</line-2>\n<line-19> #print(c, m, r, n)</line-19>", "lines": [2, 19]}
#### 0 |
<line-1>x = int(input())</line-1>
<line-2></line-2>
<line-4> count = 0</line-4>
<line-5> lst = []</line-5>
<line-6> x6 = x * 6</line-6>
<line-7> for n in range(1, x + 1):</line-7>
<line-8> t, r = divmod(x6, n*(n+1))</line-8>
<line-9> if t < 2*n + 1:</line-9>
<line-10> break</line-10... | {"code": "<line-3>def solve(x):</line-3>\n<line-28> print(m, n)</line-28>", "lines": [3, 28]}
#### 0 |
<line-1>n = int(input())</line-1>
<line-3>a = [0] * n</line-3>
<line-4>m = [31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31, 31, 29, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31, 31, ... | {"code": "<line-2>s = input().split()</line-2>\n<line-11> break</line-11>", "lines": [2, 11]}
#### 0 |
<line-1>from math import sqrt</line-1>
<line-2></line-2>
<line-4> ans = u</line-4>
<line-5> for i in range(2, int(sqrt(n)) + 1):</line-5>
<line-6> if u % i == 0:</line-6>
<line-7> while u % i == 0:</line-7>
<line-8> u = u / i</line-8>
<line-9> ans = ans - int(ans / i)</line-9>
<line-10> if n > 1:</line-10>
<lin... | {"code": "<line-3>def phi(u):</line-3>\n<line-47>print(a1, b1)</line-47>", "lines": [3, 47]}
#### 0 |
<line-1>r = open('input.txt')</line-1>
<line-3></line-3>
<line-4>f = lambda: map(int, r.readline().split())</line-4>
<line-5></line-5>
<line-6>f()</line-6>
<line-7>a, b = f()</line-7>
<line-8>if a > b: a, b = b, a</line-8>
<line-9>n = 40001</line-9>
<line-10>u, v = [n] * n, [n] * n</line-10>
<line-11>x = s = 0</line-11... | {"code": "<line-2>w = open('output.txt', mode='w')</line-2>\n<line-36>w.close()</line-36>", "lines": [2, 36]}
#### 0 |
<line-1>def gcd(a, b):</line-1>
<line-3> while b:</line-3>
<line-4> a, b = b, a % b</line-4>
<line-5> return a</line-5>
<line-6></line-6>
<line-7></line-7>
<line-8>n, m, k = list(map(int, input().split()))</line-8>
<line-9>_n, _m = n, m</line-9>
<line-10>n, k = n // gcd(n, k), k // gcd(n, k)</line-10>
<lin... | {"code": "<line-2> a, b = max(a, b), min(a, b)</line-2>\n<line-26>else:</line-26>", "lines": [2, 26]}
#### 0 |
<line-2>n=(n//k)%2</line-2>
<line-3>print('YES' if n==1 else 'NO')</line-3> | {"code": "<line-1>n,k=list(map(int,input().split()))</line-1>", "lines": [1]}
#### 0 |
<line-1>n=int(input())</line-1>
<line-2></line-2>
<line-4></line-4>
<line-5>A=[0,0,0]</line-5>
<line-6>for i in range(n):</line-6>
<line-7> A[i%3]+=int(s[i])</line-7>
<line-8></line-8>
<line-9>m=max(A)</line-9>
<line-10></line-10>
<line-11>if(m==A[0]):</line-11>
<line-12> print("chest")</line-12>
<line-13>elif(m=... | {"code": "<line-3>s=input().split()</line-3>\n<line-15>else:</line-15>", "lines": [3, 15]}
#### 0 |
<line-1>def read_input():</line-1>
<line-3></line-3>
<line-4>n = int(input())</line-4>
<line-5>a = sorted(read_input())</line-5>
<line-6></line-6>
<line-7>s = sum(a)</line-7>
<line-8>i = 0</line-8>
<line-9></line-9>
<line-10>while 2 * s < 9 * n:</line-10>
<line-11> delta = 5 - a[i]</line-11>
<line-12> s += delta</line-... | {"code": "<line-2>\treturn map(int, input().split())</line-2>\n<line-13>\ti += 1</line-13>", "lines": [2, 13]}
#### 0 |
<line-1>u, v = list(map(int, input().split()))</line-1>
<line-3> print(-1)</line-3>
<line-4>else:</line-4>
<line-5> if u == v:</line-5>
<line-6> if u == 0:</line-6>
<line-7> print(0)</line-7>
<line-8> else:</line-8>
<line-9> print("1\n" + str(u))</line-9>
<line-10> else:</li... | {"code": "<line-2>if v < u or (v - u) % 2 != 0:</line-2>\n<line-14> else:</line-14>", "lines": [2, 14]}
#### 0 |
<line-1>"""</line-1>
<line-3></line-3>
<line-4>Author : chaotic_iak</line-4>
<line-5>Language: Python 3.3.4</line-5>
<line-6>"""</line-6>
<line-7></line-7>
<line-8>def read(mode=2):</line-8>
<line-9> # 0: String</line-9>
<line-10> # 1: List of strings</line-10>
<line-11> # 2: List of integers</line-11>
<line-... | {"code": "<line-2>Codeforces Testing Round 10 Problem C</line-2>\n<line-48>n, = read()</line-48>", "lines": [2, 48]}
#### 0 |
<line-1>x1, y1, x2, y2 = list(map(int, input().split()))</line-1>
<line-3></line-3>
<line-4>x, y = abs(x), abs(y)</line-4>
<line-5></line-5>
<line-6>x_ = abs(x2 - x1)</line-6>
<line-7>y_ = abs(y2 - y1)</line-7>
<line-8></line-8>
<line-9>if x_ % x == 0 and y_ % y == 0:</line-9>
<line-10> if (x_ // x + y_ // y) % 2 ==... | {"code": "<line-2>x, y = list(map(int, input().split()))</line-2>\n<line-14>else:</line-14>", "lines": [2, 14]}
#### 0 |
<line-1>n=input()</line-1>
<line-3>for i in n: rg[int(i)]+=1</line-3>
<line-4>rl=[]</line-4>
<line-5>ff=0</line-5>
<line-6>for i in range(len(rg)):</line-6>
<line-7> if rg[i]!=0:</line-7>
<line-8> rl.append(rg[i])</line-8>
<line-9> if i==0: ff=1</line-9>
<line-10>fact=[1]</line-10>
<line-11>fc=1</line-... | {"code": "<line-2>rg=[0]*10</line-2>\n<line-48>////////////// /////////// /////////// ////// /// /// // // // //</line-48>", "lines": [2, 48]}
#### 0 |
<line-1>a=int(input())</line-1>
<line-3>c=int(input())</line-3>
<line-4>d=int(input())</line-4>
<line-5>e=int(input())</line-5>
<line-6>f=int(input())</line-6>
<line-7>if e>=f:</line-7>
<line-8> ans=min(a,d)</line-8>
<line-9> d-=ans</line-9>
<line-10> a-=ans</line-10>
<line-11> ans*=e</line-11>
<line-12> ... | {"code": "<line-2>b=int(input())</line-2>\n<line-17> ans+=min(a,d)*e</line-17>", "lines": [2, 17]}
#### 0 |
<line-1>a, b, p, x = [int(x) for x in input().split()]</line-1>
<line-2></line-2>
<line-4></line-4>
<line-5>while powers[-1] != 1:</line-5>
<line-6> powers.append(powers[-1] * a % p)</line-6>
<line-7> </line-7>
<line-8>order = len(powers)</line-8>
<line-9>powers = [powers[-1]] + powers</line-9>
<line-10></line-10... | {"code": "<line-3>powers = [a]</line-3>\n<line-28> res += f(sol)</line-28>", "lines": [3, 28]}
#### 0 |
<line-1>k2, k3, k5, k6 = list(map(int, input().split()))</line-1>
<line-3>k2 -= c</line-3>
<line-4>ans = 256 * c</line-4>
<line-6>print(ans)</line-6> | {"code": "<line-2>c = min(k2, k5, k6)</line-2>\n<line-5>ans += 32 * min(k3, k2)</line-5>", "lines": [2, 5]}
#### 0 |
<line-1>x, y, n, c = 0, 0, 0, 0</line-1>
<line-3> return m * m</line-3>
<line-4>def suma_n(m):</line-4>
<line-5> return m * (m - 1) // 2</line-5>
<line-6>def cnt(t):</line-6>
<line-7> u, d, l, r = x + t, x - t, y - t, y + t</line-7>
<line-8> suma = t ** 2 + (t + 1) ** 2</line-8>
<line-9> if u > n: suma -= suma_impares(... | {"code": "<line-2>def suma_impares(m):</line-2>\n<line-37>\t\tcont = paso</line-37>", "lines": [2, 37]}
#### 0 |
<line-1>import sys</line-1>
<line-3>i=64</line-3>
<line-4>while i>=0:</line-4>
<line-5> if ((1<<i)&l!=0 and (1<<i)&r!=0) or ((1<<i)&l==0 and (1<<i)&r==0):i-=1</line-5>
<line-7>print((1<<(i+1))-1)</line-7> | {"code": "<line-2>l,r=map(int,(sys.stdin.readline().split()))</line-2>\n<line-6> else:break</line-6>", "lines": [2, 6]}
#### 0 |
<line-2></line-2>
<line-3>print((K+N-1)//N)</line-3> | {"code": "<line-1>N, K = list(map(int, input().split()))</line-1>", "lines": [1]}
#### 0 |
<line-1>x, y, z, t1, t2, t3 = map(int, input().split())</line-1>
<line-3>elevator = abs(x - z) * t2 + 3 * t3 + abs(x - y) * t2</line-3>
<line-4>if elevator > ladder:</line-4>
<line-5> print("NO")</line-5>
<line-7> print("YES")</line-7> | {"code": "<line-2>ladder = abs(x - y) * t1</line-2>\n<line-6>else:</line-6>", "lines": [2, 6]}
#### 0 |
<line-1>n, m = list(map(int, input().split()))</line-1>
<line-3> print(1)</line-3>
<line-4>elif m - 1 >= n - m:</line-4>
<line-5> print(m - 1)</line-5>
<line-7> print(m + 1)</line-7> | {"code": "<line-2>if n == 1:</line-2>\n<line-6>else:</line-6>", "lines": [2, 6]}
#### 0 |
<line-1>n = int(input())</line-1>
<line-3>c = 0</line-3>
<line-4>l = 0</line-4>
<line-5>b = 0</line-5>
<line-6>while c < len(a) and a[c] == 0:</line-6>
<line-7> c += 1</line-7>
<line-8> b += 1</line-8>
<line-9></line-9>
<line-10>if c == len(a):</line-10>
<line-11> print(0)</line-11>
<line-12> return</line-1... | {"code": "<line-2>a = list(map(int, input().split()))</line-2>\n<line-26> c += 1</line-26>", "lines": [2, 26]}
#### 0 |
<line-1>#!/bin/python</line-1>
<line-2></line-2>
<line-4>p = list(map(int, input().split()))</line-4>
<line-5></line-5>
<line-6>a, b = 0, 0</line-6>
<line-7>for i in range(n):</line-7>
<line-8> a += p[i]</line-8>
<line-9> x = min(8, a)</line-9>
<line-10> b += x</line-10>
<line-11> a -= x</line-11>
<line-12>... | {"code": "<line-3>n, k = list(map(int, input().split()))</line-3>\n<line-15>else:</line-15>", "lines": [3, 15]}
#### 0 |
<line-1>n, k = list(map(int, input().split()))</line-1>
<line-3></line-3>
<line-4>ans = 0</line-4>
<line-5>for i in range(1, n):</line-5>
<line-6> diff = k - (a[i] + a[i - 1])</line-6>
<line-7> if diff > 0:</line-7>
<line-8> a[i] += diff</line-8>
<line-9> ans += diff</line-9>
<line-10></line-10>
<li... | {"code": "<line-2>a = list(map(int, input().split()))</line-2>\n<line-11>print(ans)</line-11>", "lines": [2, 11]}
#### 0 |
<line-2>a = n * (n + 1) // 2</line-2>
<line-3>print(4 * a - 4 * n + 1)</line-3> | {"code": "<line-1>n = int(input())</line-1>", "lines": [1]}
#### 0 |
<line-1>n = int(input())</line-1>
<line-3>a = [False for i in range(26)]</line-3>
<line-4>for x in s:</line-4>
<line-5> a[ord(x.lower()) - ord('a')] = True</line-5>
<line-6>for x in a:</line-6>
<line-7> if not x:</line-7>
<line-8> print('NO')</line-8>
<line-10>print('YES')</line-10> | {"code": "<line-2>s = input()</line-2>\n<line-9> return</line-9>", "lines": [2, 9]}
#### 0 |
<line-1>def main():</line-1>
<line-3> c = int(input())</line-3>
<line-4></line-4>
<line-5> a += c // 60</line-5>
<line-6> b += c % 60</line-6>
<line-7> if b > 59:</line-7>
<line-8> b %= 60</line-8>
<line-9> a += 1</line-9>
<line-10></line-10>
<line-11> aa = str(a % 24)</line-11>
<line-12> ... | {"code": "<line-2> a, b = map(int, input().split(\":\"))</line-2>\n<line-22> main()</line-22>", "lines": [2, 22]}
#### 0 |
<line-1>n, m = list(map(int, input().split()))</line-1>
<line-3></line-3>
<line-4>ignorable = [True] * n</line-4>
<line-5></line-5>
<line-6>for i in range(m):</line-6>
<line-7> cnt = 0</line-7>
<line-8> for j in range(n):</line-8>
<line-9> cnt += a[j][i]</line-9>
<line-10> if cnt == 1:</line-10>
<line-1... | {"code": "<line-2>a = [list(map(int, input())) for i in range(n)]</line-2>\n<line-17>else:</line-17>", "lines": [2, 17]}
#### 0 |
<line-1>N = int(input())</line-1>
<line-3>Sum = 0</line-3>
<line-4>Sum_l, Sum_r = 0, 0</line-4>
<line-5>for i in range(N):</line-5>
<line-6> x, y = list(map(int, input().split()))</line-6>
<line-7> Sum_l += x</line-7>
<line-8> Sum_r += y</line-8>
<line-9> Sum += x + y</line-9>
<line-10> if (x % 2 + y % 2... | {"code": "<line-2>Check = False</line-2>\n<line-19>elif Sum_l % 2 == 0:</line-19>", "lines": [2, 19]}
#### 0 |
<line-1>def isPrime(n) : </line-1>
<line-3> if (n <= 1) : </line-3>
<line-4> return False</line-4>
<line-5> if (n <= 3) : </line-5>
<line-6> return True</line-6>
<line-7> </line-7>
<line-8> # This is checked so that we can skip </line-8>
<line-9> # middle five numbers in below loop </line-9>... | {"code": "<line-2> # Corner cases </line-2>\n<line-27>\telse:</line-27>", "lines": [2, 27]}
#### 0 |
<line-1>n = int(input())</line-1>
<line-3>rcnt = 0</line-3>
<line-4>for i in range(n):</line-4>
<line-5> x, y = map(int, input().split())</line-5>
<line-6> if x < 0:</line-6>
<line-7> lcnt += 1</line-7>
<line-8> else:</line-8>
<line-9> rcnt += 1</line-9>
<line-10></line-10>
<line-11>if (lcnt <= 1... | {"code": "<line-2>lcnt = 0</line-2>\n<line-13>else:</line-13>", "lines": [2, 13]}
#### 0 |
<line-1>a, b = map(int, input().split())</line-1>
<line-3>ans = 1</line-3>
<line-4>for i in range(1, a + 1):</line-4>
<line-6>print(ans)</line-6> | {"code": "<line-2>a = min(a, b)</line-2>\n<line-5> ans *= i</line-5>", "lines": [2, 5]}
#### 0 |
<line-2>print (9 * n, 8 * n)</line-2> | {"code": "<line-1>n = int(input())</line-1>", "lines": [1]}
#### 0 |
<line-1>def reachable(es, source):</line-1>
<line-3> Q = [source]</line-3>
<line-4> while Q:</line-4>
<line-5> cur = Q.pop()</line-5>
<line-6> for nxt in es[cur]:</line-6>
<line-7> if nxt not in ret:</line-7>
<line-8> Q.append(nxt)</line-8>
<line-9> ret.add(nxt)</line-9>
<line-10> return ret</line-10>
<line-1... | {"code": "<line-2>\tret = {source}</line-2>\n<line-45>\tmain()</line-45>", "lines": [2, 45]}
#### 0 |
<line-1>it = lambda: list(map(int, input().strip().split()))</line-1>
<line-3></line-3>
<line-4></line-4>
<line-5>def solve():</line-5>
<line-6> N = int(input())</line-6>
<line-7> S = []</line-7>
<line-8> R = []</line-8>
<line-9> C = []</line-9>
<line-10> for _ in range(N):</line-10>
<line-11> s, ... | {"code": "<line-2>INF = float('inf')</line-2>\n<line-43> print(ans)</line-43>", "lines": [2, 43]}
#### 0 |
<line-1>R=lambda:list(map(int,input().split()))</line-1>
<line-3>if k==1:print(n)</line-3>
<line-4>else:</line-4>
<line-5> i=0</line-5>
<line-7> print((1<<i)-1)</line-7> | {"code": "<line-2>n,k=R()</line-2>\n<line-6> while (1<<i)<=n:i+=1</line-6>", "lines": [2, 6]}
#### 0 |
<line-1>n = int(input())</line-1>
<line-3>for _ in range(n):</line-3>
<line-4> a,b = list(map(int,input().split()))</line-4>
<line-6>print(res)</line-6> | {"code": "<line-2>res = -float('inf')</line-2>\n<line-5> res = max(res,a+b)</line-5>", "lines": [2, 5]}
#### 0 |
<line-2>for i in input(): t[i] += 1</line-2>
<line-3>print(min([t['i'], t['t'], t['e'] // 3, max(0, (t['n'] - 1)) // 2]))</line-3> | {"code": "<line-1>t = {i: 0 for i in 'qwertyuiopasdfghjklzxcvbnm'}</line-1>", "lines": [1]}
#### 0 |
<line-1>import sys, math</line-1>
<line-2></line-2>
<line-4>f = sys.stdin</line-4>
<line-5></line-5>
<line-6>P, Y = list(map(int, f.readline().split()))</line-6>
<line-7></line-7>
<line-8>is_ok = False</line-8>
<line-9>for t in range(Y, P, -1):</line-9>
<line-10> is_ok = True</line-10>
<line-11> for x in range(2, P+1... | {"code": "<line-3>#f = open('input_0', 'r')</line-3>\n<line-20>if not is_ok:</line-20>", "lines": [3, 20]}
#### 0 |
<line-1>n, m, k = list(map(int, input().split()))</line-1>
<line-3>line = list(map(int, input().split()))</line-3>
<line-4>answer = n</line-4>
<line-5>for i in range(n):</line-5>
<line-6> if line[i] == 0:</line-6>
<line-7> continue</line-7>
<line-8> if line[i] > k:</line-8>
<line-9> continue</line-9... | {"code": "<line-2>m -= 1</line-2>\n<line-10> answer = min(answer, abs(m - i))</line-10>", "lines": [2, 10]}
#### 0 |
<line-1>from collections import Counter</line-1>
<line-2></line-2>
<line-3></line-3>
<line-5> res = tuple((Counter() for _ in range(n + m)))</line-5>
<line-6> for i in range(n):</line-6>
<line-7> for j, a in enumerate(map(int, input().split())):</line-7>
<line-8> res[i + j][a] += 1</line-8>
<lin... | {"code": "<line-4>def input_matrix():</line-4>\n<line-15>else:</line-15>", "lines": [4, 15]}
#### 0 |
<line-1>import sys</line-1>
<line-3>b = input()</line-3>
<line-4>if a != b:</line-4>
<line-5> print(max(len(a), len(b)))</line-5>
<line-7> print(-1)</line-7> | {"code": "<line-2>a = input()</line-2>\n<line-6>else:</line-6>", "lines": [2, 6]}
#### 0 |
<line-1>a, b = map(int,input().split())</line-1>
<line-3>ONE = set()</line-3>
<line-4>TWO = set()</line-4>
<line-5>for i in range(b, 50000, a):</line-5>
<line-6> ONE.add(i)</line-6>
<line-7>for i in range(d, 50000, c):</line-7>
<line-8> TWO.add(i)</line-8>
<line-9></line-9>
<line-10>opt = 99999</line-10>
<line-11... | {"code": "<line-2>c, d = map(int,input().split())</line-2>\n<line-16>else:</line-16>", "lines": [2, 16]}
#### 0 |
<line-2>if n%3 == 0: print(1, 1, n-2)</line-2>
<line-3>elif n%3 == 1: print(1, 1, n-2)</line-3>
<line-4>else: print(1, 2, n-3)</line-4> | {"code": "<line-1>n = int(input())</line-1>", "lines": [1]}
#### 0 |
<line-1>n, a, b, c, d= [int(i) for i in input().split()]</line-1>
<line-3>for i in range(1, n+1):</line-3>
<line-4> if i+b-c>0 and i+b-c<=n:</line-4>
<line-5> if i+a-d>0 and i+a-d<=n:</line-5>
<line-6> if i+a+b-c-d>0 and i+a+b-c-d<=n:</line-6>
<line-8>print(o*n)</line-8> | {"code": "<line-2>o = 0</line-2>\n<line-7>\t\t\t\to+=1</line-7>", "lines": [2, 7]}
#### 0 |
<line-1>w, h = map(int, input().split())</line-1>
<line-3>u2, d2 = map(int, input().split())</line-3>
<line-4></line-4>
<line-5>for i in range(h, -1, -1):</line-5>
<line-6> w += i</line-6>
<line-7> if i == d1:</line-7>
<line-8> w = max(w - u1, 0)</line-8>
<line-9> elif i == d2:</line-9>
<line-11></line-... | {"code": "<line-2>u1, d1 = map(int, input().split())</line-2>\n<line-10> w = max(w - u2, 0)</line-10>", "lines": [2, 10]}
#### 0 |
<line-1>m = int(input())</line-1>
<line-3>x, y = list(map(int,input().split()))</line-3>
<line-4></line-4>
<line-5>for i in range(m):</line-5>
<line-6> sb = sum(c[:-i-1])</line-6>
<line-7> si = sum(c[-i-1:])</line-7>
<line-8> if x <= sb <= y:</line-8>
<line-9> if x <= si <= y:</line-9>
<line-10> print(m-i)</line-10>... | {"code": "<line-2>c = list(map(int,input().split()))</line-2>\n<line-12>else:</line-12>", "lines": [2, 12]}
#### 0 |
<line-1>import sys</line-1>
<line-2></line-2>
<line-4> return int(input())</line-4>
<line-5></line-5>
<line-6>def read_ints():</line-6>
<line-7> return [int(x) for x in input().split()]</line-7>
<line-8></line-8>
<line-9>n = read_int()</line-9>
<line-10>k = read_int()</line-10>
<line-11>a = read_int()</line-11>
<... | {"code": "<line-3>def read_int():</line-3>\n<line-31> cost -= a</line-31>", "lines": [3, 31]}
#### 0 |
<line-1>def ii():</line-1>
<line-3>def mi():</line-3>
<line-4> return list(map(int, input().split()))</line-4>
<line-5>def li():</line-5>
<line-6> return list(mi())</line-6>
<line-7>MX = 10 ** 5</line-7>
<line-8></line-8>
<line-9>n = ii()</line-9>
<line-10>fac = 2</line-10>
<line-11>pr = []</line-11>
<line-12>whi... | {"code": "<line-2> return int(input())</line-2>\n<line-35> pdt, ans = 1, 0</line-35>", "lines": [2, 35]}
#### 0 |
<line-1>###Prediction and Restriction</line-1>
<line-3>r,s,p=list(map(int,input().split()))</line-3>
<line-4>t=input()</line-4>
<line-5>win=[False]*n</line-5>
<line-6>def janken(char):</line-6>
<line-7> if char=='r':</line-7>
<line-8> return p</line-8>
<line-9> elif char=='s':</line-9>
<line-10> ret... | {"code": "<line-2>n,k=list(map(int,input().split()))</line-2>\n<line-28> win[i]=True</line-28>", "lines": [2, 28]}
#### 0 |
<line-1>a, b, c = list(map(int, input().split()))</line-1>
<line-3>if a != b:</line-3>
<line-5>print(x)</line-5> | {"code": "<line-2>x = 2 * (c + min(a, b))</line-2>\n<line-4> x += 1</line-4>", "lines": [2, 4]}
#### 0 |
<line-1>def read_data():</line-1>
<line-3> As = list(map(int, input().split()))</line-3>
<line-4> return n, k, p, x, y, As</line-4>
<line-5></line-5>
<line-6>def solve(n, k, p, x, y, As):</line-6>
<line-7> '''median (As + Bs) >= y</line-7>
<line-8> sum(As + Bs) <= x</line-8>
<line-9> 1 <= Bi <= p</line-9... | {"code": "<line-2> n, k, p, x, y = map(int, input().split())</line-2>\n<line-31> print(' '.join(seq))</line-31>", "lines": [2, 31]}
#### 0 |
<line-1>s = input()</line-1>
<line-3>n = len(s)</line-3>
<line-4></line-4>
<line-5>def is_vowel(c):</line-5>
<line-6> return c in "aouie"</line-6>
<line-7></line-7>
<line-8>for i, x in enumerate(s):</line-8>
<line-9> if not is_vowel(x) and x != 'n':</line-9>
<line-11></line-11>
<line-12>print("YES" if ok else "NO")</li... | {"code": "<line-2>ok = 1</line-2>\n<line-10>\t\tok &= ((i + 1 < n) and is_vowel(s[i + 1]))</line-10>", "lines": [2, 10]}
#### 0 |
<line-1>n, m = map(int, input().split())</line-1>
<line-2></line-2>
<line-4>g = [[] for i in range(7)]</line-4>
<line-5></line-5>
<line-6>for i in range(m):</line-6>
<line-7> x, y = map(int, input().split())</line-7>
<line-8> x -= 1</line-8>
<line-9> y -= 1</line-9>
<line-10> d[x] += 1</line-10>
<line-11> d[y] += 1</li... | {"code": "<line-3>d = [0 for i in range(7)]</line-3>\n<line-24>m -= mn</line-24>", "lines": [3, 24]}
#### 0 |
<line-1>n, m = list(map(int, input().split()))</line-1>
<line-3>auci = list(map(int, input().split()))</line-3>
<line-4></line-4>
<line-5>scores = 0</line-5>
<line-6></line-6>
<line-7># m auc</line-7>
<line-8># n - m default</line-8>
<line-9></line-9>
<line-10>for i in range(len(prices)):</line-10>
<line-11> if (i+... | {"code": "<line-2>prices = list(map(int, input().split()))</line-2>\n<line-28>print(scores)</line-28>", "lines": [2, 28]}
#### 0 |
<line-1>m = list(map(int, input().split()))</line-1>
<line-3>a = [500, 1000, 1500, 2000, 2500]</line-3>
<line-4>v = list(map(int, input().split()))</line-4>
<line-5>ans = 0</line-5>
<line-6>for i in range(len(m)):</line-6>
<line-7> ans += max(0.3 * a[i], (1 - m[i] / 250) * a[i] - 50 * w[i])</line-7>
<line-8>ans += v... | {"code": "<line-2>w = list(map(int, input().split()))</line-2>\n<line-9>ans -= v[1] * 50</line-9>", "lines": [2, 9]}
#### 0 |
<line-1>n,m,L,R = list(map(int,input().split()))</line-1>
<line-3>pp = p//2</line-3>
<line-4>#liczba pokryc n x m ze jest parzyscie wiele zer albo parzyscie wiele jedynek</line-4>
<line-5>def pow(a,w):</line-5>
<line-6> wyn = 1</line-6>
<line-7> mn = a</line-7>
<line-8> while w > 0:</line-8>
<line-9> if w%2 == 1:</lin... | {"code": "<line-2>p = 998244353*2</line-2>\n<line-20>\telse:</line-20>", "lines": [2, 20]}
#### 0 |
<line-1>def main():</line-1>
<line-3></line-3>
<line-4> def read():</line-4>
<line-5> return stdin.readline().rstrip('\n')</line-5>
<line-6></line-6>
<line-7> def read_array(sep=None, maxsplit=-1):</line-7>
<line-8> return read().split(sep, maxsplit)</line-8>
<line-9></line-9>
<line-10> def read_... | {"code": "<line-2> from sys import stdin, stdout</line-2>\n<line-47> write(\"Possible\")</line-47>", "lines": [2, 47]}
#### 0 |
<line-1>n = int(input())</line-1>
<line-3>arr.sort()</line-3>
<line-4>arr = arr[::-1]</line-4>
<line-5>ans = [arr[0]]</line-5>
<line-6>for i in range(1, n):</line-6>
<line-7> if(arr[i] < ans[-1]):</line-7>
<line-8> ans.append(arr[i])</line-8>
<line-9> else:</line-9>
<line-11>print(sum(ans))</line-11> | {"code": "<line-2>arr = list(map(int, input().split()))</line-2>\n<line-10>\t\tans.append(max(0, ans[-1] - 1))</line-10>", "lines": [2, 10]}
#### 0 |
<line-1>R=lambda:list(map(int,input().split()))</line-1>
<line-3>a=sorted(R())</line-3>
<line-4>b=0</line-4>
<line-5>for i in a:</line-5>
<line-6> while i>k+k:</line-6>
<line-7> k+=k</line-7>
<line-8> b+=1</line-8>
<line-10>print(b)</line-10> | {"code": "<line-2>n,k=R()</line-2>\n<line-9> k=max(k,i)</line-9>", "lines": [2, 9]}
#### 0 |
<line-1>n = int(input())</line-1>
<line-3>min2, max2 = map(int, input().split())</line-3>
<line-4>min3, max3 = map(int, input().split())</line-4>
<line-5></line-5>
<line-6>d1 = min(n - min2 - min3, max1)</line-6>
<line-7>d2 = min(n - d1 - min3, max2)</line-7>
<line-9></line-9>
<line-10>print(d1,d2,d3)</line-10> | {"code": "<line-2>min1, max1 = map(int, input().split())</line-2>\n<line-8>d3 = n - d1 - d2</line-8>", "lines": [2, 8]}
#### 0 |
<line-1># You lost the game.</line-1>
<line-2></line-2>
<line-4>L = list(map(int, input().split()))</line-4>
<line-5></line-5>
<line-6>if n == 1:</line-6>
<line-7> if L[0] == 0:</line-7>
<line-8> print("UP")</line-8>
<line-9> elif L[0] == 15:</line-9>
<line-10> print("DOWN")</line-10>
<line-11> e... | {"code": "<line-3>n = int(input())</line-3>\n<line-23> else:</line-23>", "lines": [3, 23]}
#### 0 |
<line-1>v = list('aeiou')</line-1>
<line-3>t = [c in v for c in input()]</line-3>
<line-4>if s == t:</line-4>
<line-5> print('Yes')</line-5>
<line-7> print('No')</line-7> | {"code": "<line-2>s = [c in v for c in input()]</line-2>\n<line-6>else:</line-6>", "lines": [2, 6]}
#### 0 |
<line-1>grid = [list(input()) for i in range(8)]</line-1>
<line-3>w = 9</line-3>
<line-4>tblock = False</line-4>
<line-5>bblock = False</line-5>
<line-6>for r in range(8):</line-6>
<line-7> for c in range(8):</line-7>
<line-8> for ri in range(r):</line-8>
<line-9> if grid[ri][c] == 'B':</line-9>
<l... | {"code": "<line-2>b = 9</line-2>\n<line-22>else:</line-22>", "lines": [2, 22]}
#### 0 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.