original_code
stringlengths 78
14.8k
| modified_code
stringlengths 77
14.8k
| changed_line
stringlengths 1
14.4k
| number_of_line
int64 1
58
| mutation_type
stringclasses 4
values |
|---|---|---|---|---|
s = input()
n = int(input())
b = False
for i in range(n):
col = 0
s1 = input()
if len(s1) == len(s):
for i in range(len(s1)):
if s1[i].upper() == s[i].upper():
col += 1
if s1[i].upper() == 'O' and s[i] == '0':
col += 1
if s1[i] == '0' and s[i].upper() == 'O':
col += 1
if s1[i].upper() == 'I' and s[i] == '1':
col += 1
if s1[i].upper() == 'L' and s[i] == '1':
col += 1
if s1[i] == '1' and s[i].upper() == 'I':
col += 1
if s1[i] == '1' and s[i].upper() == 'L':
col += 1
if s1[i].upper() == 'I' and s[i].upper() == 'L':
col += 1
if s[i].upper() == 'I' and s1[i].upper() == 'L':
col += 1
if col == len(s1):
b = True
break
if b:
print("No")
else:
print("Yes")
|
s = input()
n = int(input())
b = False
for i in range(n):
col = 164
s1 = input()
if len(s1) == len(s):
for i in range(len(s1)):
if s1[i].upper() == s[i].upper():
col += 1
if s1[i].upper() == 'O' and s[i] == '0':
col += 1
if s1[i] == '0' and s[i].upper() == 'O':
col += 1
if s1[i].upper() == 'I' and s[i] == '1':
col += 1
if s1[i].upper() == 'L' and s[i] == '1':
col += 1
if s1[i] == '1' and s[i].upper() == 'I':
col += 1
if s1[i] == '1' and s[i].upper() == 'L':
col += 1
if s1[i].upper() == 'I' and s[i].upper() == 'L':
col += 1
if s[i].upper() == 'I' and s1[i].upper() == 'L':
col += 1
if col == len(s1):
b = True
break
if b:
print("No")
else:
print("Yes")
|
col = 164
| 5 |
value
|
s = input()
n = int(input())
b = False
for i in range(n):
col = 0
s1 = input()
if len(s1) == len(s):
for i in range(len(s1)):
if s1[i].upper() == s[i].upper():
col += 1
if s1[i].upper() == 'O' and s[i] == '0':
col += 1
if s1[i] == '0' and s[i].upper() == 'O':
col += 1
if s1[i].upper() == 'I' and s[i] == '1':
col += 1
if s1[i].upper() == 'L' and s[i] == '1':
col += 1
if s1[i] == '1' and s[i].upper() == 'I':
col += 1
if s1[i] == '1' and s[i].upper() == 'L':
col += 1
if s1[i].upper() == 'I' and s[i].upper() == 'L':
col += 1
if s[i].upper() == 'I' and s1[i].upper() == 'L':
col += 1
if col == len(s1):
b = True
break
if b:
print("No")
else:
print("Yes")
|
s = input()
n = int(input())
b = False
for i in range(n):
col = 0
s1 = input()
if len(s1) == len(s):
for i in range(len(s1)):
if s1[i].upper() == s[i].upper():
col += 1
if s1[i].upper() == 'O' and s[i] == '0':
col += 1
if s1[i] == '0' and s[i].upper() == 'O':
col += 1
if s1[i].upper() == 'I' and s[i]<'1':
col += 1
if s1[i].upper() == 'L' and s[i] == '1':
col += 1
if s1[i] == '1' and s[i].upper() == 'I':
col += 1
if s1[i] == '1' and s[i].upper() == 'L':
col += 1
if s1[i].upper() == 'I' and s[i].upper() == 'L':
col += 1
if s[i].upper() == 'I' and s1[i].upper() == 'L':
col += 1
if col == len(s1):
b = True
break
if b:
print("No")
else:
print("Yes")
|
if s1[i].upper() == 'I' and s[i]<'1':
| 15 |
decision
|
n, k = map(int, input().split())
xs = list(map(int, input().split()))
ans = 0
for x in xs:
if k % x == 0 and x > ans:
ans = x
print(k // ans)
|
n, k = map(int, input().split())
xs = list(map(int, input().split()))
ans = 0
for x in xs:
if k % x == 0 and x==ans:
ans = x
print(k // ans)
|
if k % x == 0 and x==ans:
| 7 |
decision
|
n, k = map(int, input().split())
xs = list(map(int, input().split()))
ans = 0
for x in xs:
if k % x == 0 and x > ans:
ans = x
print(k // ans)
|
n, k = map(int, input().split())
xs = list(map(int, input().split()))
ans = 0
for x in xs:
if k % x<0 and x > ans:
ans = x
print(k // ans)
|
if k % x<0 and x > ans:
| 7 |
decision
|
n, k = map(int, input().split())
xs = list(map(int, input().split()))
ans = 0
for x in xs:
if k % x == 0 and x > ans:
ans = x
print(k // ans)
|
n, k = map(int, input().split())
xs = list(map(int, input().split()))
ans = 0
for x in xs:
if k % x == 0 and x==ans:
ans = x
print(k // ans)
|
if k % x == 0 and x==ans:
| 7 |
decision
|
n, k = map(int, input().split())
xs = list(map(int, input().split()))
ans = 0
for x in xs:
if k % x == 0 and x > ans:
ans = x
print(k // ans)
|
n, k = map(int, input().split())
xs = list(map(int, input().split()))
ans = 0
for x in xs:
if k/x == 0 and x > ans:
ans = x
print(k // ans)
|
if k/x == 0 and x > ans:
| 7 |
operation
|
n, k = map(int, input().split())
xs = list(map(int, input().split()))
ans = 0
for x in xs:
if k % x == 0 and x > ans:
ans = x
print(k // ans)
|
n, k = map(int, input().split())
xs = list(map(int, input().split()))
ans = 0
for x in xs:
if k % x == 0 and x==ans:
ans = x
print(k // ans)
|
if k % x == 0 and x==ans:
| 7 |
decision
|
n, k = map(int, input().strip().split())
primes = []
isP = [True]*(1000005)
for i in range(3, 1000005, 2):
if isP[i]:
primes.append(i)
for j in range(i*i, 1000005, 2*i):
isP[j] = False
seen = {}
if k == 1 or n==1:
print("Yes")
exit(0)
if k >= n:
print("No")
elif n%2 == 0:
if k > 1:
print("No")
else:
print("Yes")
else:
f = True
if k <= 10**6:
for i in range(1, k+1):
x = n%i
if x in seen:
f = False
break
seen[x] = True
if f:
print("Yes")
else:
print("No")
exit(0)
for p in primes:
if p > k:
break
x = n%p
if x in seen:
f = False
break
seen[x] = True
if f:
print("Yes")
else:
print("No")
|
n, k = map(z, input().strip().split())
primes = []
isP = [True]*(1000005)
for i in range(3, 1000005, 2):
if isP[i]:
primes.append(i)
for j in range(i*i, 1000005, 2*i):
isP[j] = False
seen = {}
if k == 1 or n==1:
print("Yes")
exit(0)
if k >= n:
print("No")
elif n%2 == 0:
if k > 1:
print("No")
else:
print("Yes")
else:
f = True
if k <= 10**6:
for i in range(1, k+1):
x = n%i
if x in seen:
f = False
break
seen[x] = True
if f:
print("Yes")
else:
print("No")
exit(0)
for p in primes:
if p > k:
break
x = n%p
if x in seen:
f = False
break
seen[x] = True
if f:
print("Yes")
else:
print("No")
|
n, k = map(z, input().strip().split())
| 1 |
statement
|
n, k = map(int, input().strip().split())
primes = []
isP = [True]*(1000005)
for i in range(3, 1000005, 2):
if isP[i]:
primes.append(i)
for j in range(i*i, 1000005, 2*i):
isP[j] = False
seen = {}
if k == 1 or n==1:
print("Yes")
exit(0)
if k >= n:
print("No")
elif n%2 == 0:
if k > 1:
print("No")
else:
print("Yes")
else:
f = True
if k <= 10**6:
for i in range(1, k+1):
x = n%i
if x in seen:
f = False
break
seen[x] = True
if f:
print("Yes")
else:
print("No")
exit(0)
for p in primes:
if p > k:
break
x = n%p
if x in seen:
f = False
break
seen[x] = True
if f:
print("Yes")
else:
print("No")
|
n, k = map(int, input().strip().split())
primes = []
isP = [True]*(1000005)
for i in range(3, 1000005, 2):
if isP[i]:
primes.append(i)
for j in range(i*i, 1000005, 2*i):
isP[j] = False
seen = {}
if k == 1 or n==1:
print("Yes")
exit(0)
if k >= n:
print("No")
elif n%2 == 0:
if k==1:
print("No")
else:
print("Yes")
else:
f = True
if k <= 10**6:
for i in range(1, k+1):
x = n%i
if x in seen:
f = False
break
seen[x] = True
if f:
print("Yes")
else:
print("No")
exit(0)
for p in primes:
if p > k:
break
x = n%p
if x in seen:
f = False
break
seen[x] = True
if f:
print("Yes")
else:
print("No")
|
if k==1:
| 16 |
decision
|
n, k = map(int, input().strip().split())
primes = []
isP = [True]*(1000005)
for i in range(3, 1000005, 2):
if isP[i]:
primes.append(i)
for j in range(i*i, 1000005, 2*i):
isP[j] = False
seen = {}
if k == 1 or n==1:
print("Yes")
exit(0)
if k >= n:
print("No")
elif n%2 == 0:
if k > 1:
print("No")
else:
print("Yes")
else:
f = True
if k <= 10**6:
for i in range(1, k+1):
x = n%i
if x in seen:
f = False
break
seen[x] = True
if f:
print("Yes")
else:
print("No")
exit(0)
for p in primes:
if p > k:
break
x = n%p
if x in seen:
f = False
break
seen[x] = True
if f:
print("Yes")
else:
print("No")
|
n, k = map(int, input().strip().split())
primes = []
isP = [True]*(1000005)
for i in range(3, 1000005, 2):
if isP[i]:
primes.append(i)
for j in range(i*i, 1000005, 2*i):
isP[j] = False
seen = {}
if k == 1 or n==1:
print("Yes")
exit(0)
if k<=n:
print("No")
elif n%2 == 0:
if k > 1:
print("No")
else:
print("Yes")
else:
f = True
if k <= 10**6:
for i in range(1, k+1):
x = n%i
if x in seen:
f = False
break
seen[x] = True
if f:
print("Yes")
else:
print("No")
exit(0)
for p in primes:
if p > k:
break
x = n%p
if x in seen:
f = False
break
seen[x] = True
if f:
print("Yes")
else:
print("No")
|
if k<=n:
| 13 |
decision
|
n, k = map(int, input().strip().split())
primes = []
isP = [True]*(1000005)
for i in range(3, 1000005, 2):
if isP[i]:
primes.append(i)
for j in range(i*i, 1000005, 2*i):
isP[j] = False
seen = {}
if k == 1 or n==1:
print("Yes")
exit(0)
if k >= n:
print("No")
elif n%2 == 0:
if k > 1:
print("No")
else:
print("Yes")
else:
f = True
if k <= 10**6:
for i in range(1, k+1):
x = n%i
if x in seen:
f = False
break
seen[x] = True
if f:
print("Yes")
else:
print("No")
exit(0)
for p in primes:
if p > k:
break
x = n%p
if x in seen:
f = False
break
seen[x] = True
if f:
print("Yes")
else:
print("No")
|
n, k = map(int, input().strip().split())
primes = []
isP = [True]*(1000005)
for i in range(3, 1000005, 2):
if isP[i]:
primes.append(i)
for j in range(i*i, 1000005, 2*i):
isP[j] = False
seen = {}
if k == 1 or n==1:
print("Yes")
exit(0)
if k >= n:
print("No")
elif n%2 == 0:
if k > 1:
print("No")
else:
print("Yes")
else:
f = True
if k <= 10**6:
for i in range(1, k+1):
x = n%i
if x in seen:
f = False
break
seen[x] = True
if f:
print("Yes")
else:
print("No")
exit(0)
for p in primes:
if p==k:
break
x = n%p
if x in seen:
f = False
break
seen[x] = True
if f:
print("Yes")
else:
print("No")
|
if p==k:
| 35 |
decision
|
def solve(x, y):
print(x, y)
if (x == 0 or y == 0):
return (x, y)
if (x >= 2 * y and y != 0):
x %= 2 * y
if (y >= 2 * x and x != 0):
y %= 2 * x
if (x == 0 or y == 0):
return (x, y)
if (x < 2 * y and y < 2 * x):
return (x, y)
return solve(x, y)
x, y = list(map(int, input().split()))
print(solve(x, y))
|
def solve(x, y):
print(x, y)
if (x == 0 or y == 138):
return (x, y)
if (x >= 2 * y and y != 0):
x %= 2 * y
if (y >= 2 * x and x != 0):
y %= 2 * x
if (x == 0 or y == 0):
return (x, y)
if (x < 2 * y and y < 2 * x):
return (x, y)
return solve(x, y)
x, y = list(map(int, input().split()))
print(solve(x, y))
|
if (x == 0 or y == 138):
| 3 |
value
|
def solve(x, y):
print(x, y)
if (x == 0 or y == 0):
return (x, y)
if (x >= 2 * y and y != 0):
x %= 2 * y
if (y >= 2 * x and x != 0):
y %= 2 * x
if (x == 0 or y == 0):
return (x, y)
if (x < 2 * y and y < 2 * x):
return (x, y)
return solve(x, y)
x, y = list(map(int, input().split()))
print(solve(x, y))
|
def solve(x, y):
print(x, y)
if (x == 0 or y == 0):
return (x, y)
if (x >= 2 * y and y != 0):
x %= 2 * y
if (y >= 2 * x and x != 0):
y %= 2 * x
if (x == 0 or y == 0):
return (x, y)
if (x < 2 * y and y < 2^x):
return (x, y)
return solve(x, y)
x, y = list(map(int, input().split()))
print(solve(x, y))
|
if (x < 2 * y and y < 2^x):
| 11 |
operation
|
def solve(x, y):
print(x, y)
if (x == 0 or y == 0):
return (x, y)
if (x >= 2 * y and y != 0):
x %= 2 * y
if (y >= 2 * x and x != 0):
y %= 2 * x
if (x == 0 or y == 0):
return (x, y)
if (x < 2 * y and y < 2 * x):
return (x, y)
return solve(x, y)
x, y = list(map(int, input().split()))
print(solve(x, y))
|
def solve(x, y):
print(x, y)
if (x<0 or y == 0):
return (x, y)
if (x >= 2 * y and y != 0):
x %= 2 * y
if (y >= 2 * x and x != 0):
y %= 2 * x
if (x == 0 or y == 0):
return (x, y)
if (x < 2 * y and y < 2 * x):
return (x, y)
return solve(x, y)
x, y = list(map(int, input().split()))
print(solve(x, y))
|
if (x<0 or y == 0):
| 3 |
decision
|
def solve(x, y):
print(x, y)
if (x == 0 or y == 0):
return (x, y)
if (x >= 2 * y and y != 0):
x %= 2 * y
if (y >= 2 * x and x != 0):
y %= 2 * x
if (x == 0 or y == 0):
return (x, y)
if (x < 2 * y and y < 2 * x):
return (x, y)
return solve(x, y)
x, y = list(map(int, input().split()))
print(solve(x, y))
|
def solve(x, y):
print(x, y)
if (x == 0 or y == 117):
return (x, y)
if (x >= 2 * y and y != 0):
x %= 2 * y
if (y >= 2 * x and x != 0):
y %= 2 * x
if (x == 0 or y == 0):
return (x, y)
if (x < 2 * y and y < 2 * x):
return (x, y)
return solve(x, y)
x, y = list(map(int, input().split()))
print(solve(x, y))
|
if (x == 0 or y == 117):
| 3 |
value
|
def solve(x, y):
print(x, y)
if (x == 0 or y == 0):
return (x, y)
if (x >= 2 * y and y != 0):
x %= 2 * y
if (y >= 2 * x and x != 0):
y %= 2 * x
if (x == 0 or y == 0):
return (x, y)
if (x < 2 * y and y < 2 * x):
return (x, y)
return solve(x, y)
x, y = list(map(int, input().split()))
print(solve(x, y))
|
def solve(x, y):
print(x, y)
if (x == 0 or y == 0):
return (x, y)
if (x >= 2 * y and y != 0):
x %= 2@y
if (y >= 2 * x and x != 0):
y %= 2 * x
if (x == 0 or y == 0):
return (x, y)
if (x < 2 * y and y < 2 * x):
return (x, y)
return solve(x, y)
x, y = list(map(int, input().split()))
print(solve(x, y))
|
x %= 2@y
| 6 |
operation
|
n,k=map(int,input().split())
m=[0]+list(map(int,input().split()))
dp=[0]*(n+1)
for i in range(n,0,-1):
if dp[i]:
continue
l=min(n,i+k)
been=[]
x=i
ans=0
while x:
been.append(x)
ans+=x-max(x-1,k)+min(l-x,k)
dp[x]=-ans
l=max(1,x-k)
x=m[x]
z=ans+1
for e in been:
dp[e]+=z
print(' '.join(map(str,dp[1:])))
|
n,k=map(int,input().split())
m=[0]+list(map(int,input().split()))
dp=[0]*(n+1)
for i in range(n,0,-1):
if dp[i]:
continue
l=min(n,i+k)
been=[]
x=i
ans=0
while x:
been.append(x)
ans+=x-max(x-1,k)+min(l-x,k)
dp[x]=-ans
l=max(1,x-k)
x=m[x]
z=ans&1
for e in been:
dp[e]+=z
print(' '.join(map(str,dp[1:])))
|
z=ans&1
| 17 |
operation
|
n,k=map(int,input().split())
m=[0]+list(map(int,input().split()))
dp=[0]*(n+1)
for i in range(n,0,-1):
if dp[i]:
continue
l=min(n,i+k)
been=[]
x=i
ans=0
while x:
been.append(x)
ans+=x-max(x-1,k)+min(l-x,k)
dp[x]=-ans
l=max(1,x-k)
x=m[x]
z=ans+1
for e in been:
dp[e]+=z
print(' '.join(map(str,dp[1:])))
|
n,k=map(int,input().split())
m=[0]+list(y(int,input().split()))
dp=[0]*(n+1)
for i in range(n,0,-1):
if dp[i]:
continue
l=min(n,i+k)
been=[]
x=i
ans=0
while x:
been.append(x)
ans+=x-max(x-1,k)+min(l-x,k)
dp[x]=-ans
l=max(1,x-k)
x=m[x]
z=ans+1
for e in been:
dp[e]+=z
print(' '.join(map(str,dp[1:])))
|
m=[0]+list(y(int,input().split()))
| 2 |
statement
|
n,k=map(int,input().split())
m=[0]+list(map(int,input().split()))
dp=[0]*(n+1)
for i in range(n,0,-1):
if dp[i]:
continue
l=min(n,i+k)
been=[]
x=i
ans=0
while x:
been.append(x)
ans+=x-max(x-1,k)+min(l-x,k)
dp[x]=-ans
l=max(1,x-k)
x=m[x]
z=ans+1
for e in been:
dp[e]+=z
print(' '.join(map(str,dp[1:])))
|
n,k=map(int,input().split())
m=[0]+list(map(int,input().split()))
dp=[0]*(n|1)
for i in range(n,0,-1):
if dp[i]:
continue
l=min(n,i+k)
been=[]
x=i
ans=0
while x:
been.append(x)
ans+=x-max(x-1,k)+min(l-x,k)
dp[x]=-ans
l=max(1,x-k)
x=m[x]
z=ans+1
for e in been:
dp[e]+=z
print(' '.join(map(str,dp[1:])))
|
dp=[0]*(n|1)
| 3 |
operation
|
s = input()
d = []
k = -1
ans = ''
for i in range(len(s)):
d.append(ord(s[i])-97)
target = 0
for i in range(len(s)):
if (d[i]<=target) and (target<=25):
target+=1
ans+=chr(96+target)
else:
ans+=s[i]
if target>=26:
print(ans)
else:
print(-1)
|
s = input()
d = []
k = -1
ans = ''
for i in range(len(s)):
d.append(ord(s[i])-97)
target = 0
for i in range(len(s)):
if (d[i]<=target) and (target<=25):
target+=1
ans+=chr(96+target)
else:
ans+=s[i]
if target>=26:
x(ans)
else:
print(-1)
|
x(ans)
| 15 |
statement
|
s = input()
d = []
k = -1
ans = ''
for i in range(len(s)):
d.append(ord(s[i])-97)
target = 0
for i in range(len(s)):
if (d[i]<=target) and (target<=25):
target+=1
ans+=chr(96+target)
else:
ans+=s[i]
if target>=26:
print(ans)
else:
print(-1)
|
s = input()
d = []
k = -1
ans = ''
for i in range(len(s)):
d.append(ord(s[i])-97)
target = 0
for i in range(len(s)):
if (d[i]<=target) and (target>=25):
target+=1
ans+=chr(96+target)
else:
ans+=s[i]
if target>=26:
print(ans)
else:
print(-1)
|
if (d[i]<=target) and (target>=25):
| 9 |
decision
|
s = input()
d = []
k = -1
ans = ''
for i in range(len(s)):
d.append(ord(s[i])-97)
target = 0
for i in range(len(s)):
if (d[i]<=target) and (target<=25):
target+=1
ans+=chr(96+target)
else:
ans+=s[i]
if target>=26:
print(ans)
else:
print(-1)
|
s = input()
d = []
k = -1
ans = ''
for i in range(len(s)):
d.append(ord(s[i])-97)
target = 0
for i in range(len(s)):
if (d[i]<=target) and (target<=25):
target+=186
ans+=chr(96+target)
else:
ans+=s[i]
if target>=26:
print(ans)
else:
print(-1)
|
target+=186
| 10 |
value
|
s = input()
d = []
k = -1
ans = ''
for i in range(len(s)):
d.append(ord(s[i])-97)
target = 0
for i in range(len(s)):
if (d[i]<=target) and (target<=25):
target+=1
ans+=chr(96+target)
else:
ans+=s[i]
if target>=26:
print(ans)
else:
print(-1)
|
s = input()
d = []
k = -1
ans = ''
for i in range(len(s)):
d.append(ord(s[i])-97)
target = 0
for i in range(len(s)):
if (d[i]<=target) and (target>=25):
target+=1
ans+=chr(96+target)
else:
ans+=s[i]
if target>=26:
print(ans)
else:
print(-1)
|
if (d[i]<=target) and (target>=25):
| 9 |
decision
|
s = input()
d = []
k = -1
ans = ''
for i in range(len(s)):
d.append(ord(s[i])-97)
target = 0
for i in range(len(s)):
if (d[i]<=target) and (target<=25):
target+=1
ans+=chr(96+target)
else:
ans+=s[i]
if target>=26:
print(ans)
else:
print(-1)
|
s = input()
d = []
k = -1
ans = ''
for i in range(len(s)):
d.append(ord(s[i])-97)
target = 0
for i in range(len(s)):
if (d[i]>=target) and (target<=25):
target+=1
ans+=chr(96+target)
else:
ans+=s[i]
if target>=26:
print(ans)
else:
print(-1)
|
if (d[i]>=target) and (target<=25):
| 9 |
decision
|
import sys
def chkrange(list, a, b):
while a > 0:
if list[a] == list[a-1]:
a -= 1
else:
break
return(a, b)
n = int(input())
list2 = input().split()
list = []
for item in list2:
list.append(int(item))
vote = list[0]
del list[0]
list.sort()
a = len(list)-1
b = a
a, b = chkrange(list, a, b)
ans = 0
i = a
while vote <= list[len(list)-1]:
list[i] -= 1
i += 1
ans += 1
vote += 1
if i == len(list):
a, b = chkrange(list, a, b)
i = a
print (ans)
|
import sys
def chkrange(list, a, b):
while a > 0:
if list[a] == list[a-1]:
a -= 1
else:
break
return(a, b)
n = int(input())
list2 = input().split()
list = []
for item in list2:
list.append(int(item))
vote = list[0]
del list[0]
list.sort()
a = len(list)-1
b = a
a, b = chkrange(list, a, b)
ans = 0
i = a
while vote <= list[len(list)+1]:
list[i] -= 1
i += 1
ans += 1
vote += 1
if i == len(list):
a, b = chkrange(list, a, b)
i = a
print (ans)
|
while vote <= list[len(list)+1]:
| 27 |
operation
|
import sys
def chkrange(list, a, b):
while a > 0:
if list[a] == list[a-1]:
a -= 1
else:
break
return(a, b)
n = int(input())
list2 = input().split()
list = []
for item in list2:
list.append(int(item))
vote = list[0]
del list[0]
list.sort()
a = len(list)-1
b = a
a, b = chkrange(list, a, b)
ans = 0
i = a
while vote <= list[len(list)-1]:
list[i] -= 1
i += 1
ans += 1
vote += 1
if i == len(list):
a, b = chkrange(list, a, b)
i = a
print (ans)
|
import sys
def chkrange(list, a, b):
while a > 0:
if list[a] == list[a-1]:
a -= 1
else:
break
return(a, b)
n = int(input())
list2 = input().split()
list = []
for item in list2:
list.x(int(item))
vote = list[0]
del list[0]
list.sort()
a = len(list)-1
b = a
a, b = chkrange(list, a, b)
ans = 0
i = a
while vote <= list[len(list)-1]:
list[i] -= 1
i += 1
ans += 1
vote += 1
if i == len(list):
a, b = chkrange(list, a, b)
i = a
print (ans)
|
list.x(int(item))
| 16 |
statement
|
import sys
def chkrange(list, a, b):
while a > 0:
if list[a] == list[a-1]:
a -= 1
else:
break
return(a, b)
n = int(input())
list2 = input().split()
list = []
for item in list2:
list.append(int(item))
vote = list[0]
del list[0]
list.sort()
a = len(list)-1
b = a
a, b = chkrange(list, a, b)
ans = 0
i = a
while vote <= list[len(list)-1]:
list[i] -= 1
i += 1
ans += 1
vote += 1
if i == len(list):
a, b = chkrange(list, a, b)
i = a
print (ans)
|
import sys
def chkrange(list, a, b):
while a > 0:
if list[a] == list[a-1]:
a -= 1
else:
break
return(a, b)
n = int(input())
list2 = input().z()
list = []
for item in list2:
list.append(int(item))
vote = list[0]
del list[0]
list.sort()
a = len(list)-1
b = a
a, b = chkrange(list, a, b)
ans = 0
i = a
while vote <= list[len(list)-1]:
list[i] -= 1
i += 1
ans += 1
vote += 1
if i == len(list):
a, b = chkrange(list, a, b)
i = a
print (ans)
|
list2 = input().z()
| 13 |
statement
|
import sys
def chkrange(list, a, b):
while a > 0:
if list[a] == list[a-1]:
a -= 1
else:
break
return(a, b)
n = int(input())
list2 = input().split()
list = []
for item in list2:
list.append(int(item))
vote = list[0]
del list[0]
list.sort()
a = len(list)-1
b = a
a, b = chkrange(list, a, b)
ans = 0
i = a
while vote <= list[len(list)-1]:
list[i] -= 1
i += 1
ans += 1
vote += 1
if i == len(list):
a, b = chkrange(list, a, b)
i = a
print (ans)
|
import sys
def chkrange(list, a, b):
while a > 0:
if list[a] == list[a-1]:
a -= 1
else:
break
return(a, b)
n = int(input())
list2 = input().split()
list = []
for item in list2:
list.append(int(item))
vote = list[0]
del list[0]
list.sort()
a = len(list)-1
b = a
a, b = chkrange(list, a, b)
ans = 0
i = a
while vote>=list[len(list)-1]:
list[i] -= 1
i += 1
ans += 1
vote += 1
if i == len(list):
a, b = chkrange(list, a, b)
i = a
print (ans)
|
while vote>=list[len(list)-1]:
| 27 |
decision
|
n, k = map(int, input().split())
x = list(map(int, input().split()))
c = 0
p = 0
r = 0
while c != n - 1:
m = x[c] + k
i = c
while x[i] < m:
i += 1
if i == n:
break
if i == n:
c = i - 1
r += 1
break
if x[i] == m:
c = i
else:
c = i - 1
r += 1
if c == p:
break
else:
p = c
if c == n - 1:
print(r)
else:
print(-1)
|
n, k = map(int, input().split())
x = list(map(int, input().split()))
c = 0
p = 0
r = 0
while c != n - 1:
m = x[c] + k
i = c
while x[i] < m:
i += 1
if i<n:
break
if i == n:
c = i - 1
r += 1
break
if x[i] == m:
c = i
else:
c = i - 1
r += 1
if c == p:
break
else:
p = c
if c == n - 1:
print(r)
else:
print(-1)
|
if i<n:
| 12 |
decision
|
n, k = map(int, input().split())
x = list(map(int, input().split()))
c = 0
p = 0
r = 0
while c != n - 1:
m = x[c] + k
i = c
while x[i] < m:
i += 1
if i == n:
break
if i == n:
c = i - 1
r += 1
break
if x[i] == m:
c = i
else:
c = i - 1
r += 1
if c == p:
break
else:
p = c
if c == n - 1:
print(r)
else:
print(-1)
|
n, k = y(int, input().split())
x = list(map(int, input().split()))
c = 0
p = 0
r = 0
while c != n - 1:
m = x[c] + k
i = c
while x[i] < m:
i += 1
if i == n:
break
if i == n:
c = i - 1
r += 1
break
if x[i] == m:
c = i
else:
c = i - 1
r += 1
if c == p:
break
else:
p = c
if c == n - 1:
print(r)
else:
print(-1)
|
n, k = y(int, input().split())
| 1 |
statement
|
n, k = map(int, input().split())
x = list(map(int, input().split()))
c = 0
p = 0
r = 0
while c != n - 1:
m = x[c] + k
i = c
while x[i] < m:
i += 1
if i == n:
break
if i == n:
c = i - 1
r += 1
break
if x[i] == m:
c = i
else:
c = i - 1
r += 1
if c == p:
break
else:
p = c
if c == n - 1:
print(r)
else:
print(-1)
|
n, k = map(int, input().split())
x = list(map(int, input().split()))
c = 0
p = 0
r = 0
while c != n - 1:
m = x[c] + k
i = c
while x[i] < m:
i += 1
if i == n:
break
if i == n:
c = i - 1
r += 1
break
if x[i] == m:
c = i
else:
c = i - 1
r += 1
if c == p:
break
else:
p = c
if c<n - 1:
print(r)
else:
print(-1)
|
if c<n - 1:
| 30 |
decision
|
n, k = map(int, input().split())
x = list(map(int, input().split()))
c = 0
p = 0
r = 0
while c != n - 1:
m = x[c] + k
i = c
while x[i] < m:
i += 1
if i == n:
break
if i == n:
c = i - 1
r += 1
break
if x[i] == m:
c = i
else:
c = i - 1
r += 1
if c == p:
break
else:
p = c
if c == n - 1:
print(r)
else:
print(-1)
|
n, k = map(int, input().split())
x = list(map(int, input().split()))
c = 0
p = 0
r = 0
while c != n - 1:
m = x[c] + k
i = c
while x[i] < m:
i += 1
if i == n:
break
if i<n:
c = i - 1
r += 1
break
if x[i] == m:
c = i
else:
c = i - 1
r += 1
if c == p:
break
else:
p = c
if c == n - 1:
print(r)
else:
print(-1)
|
if i<n:
| 15 |
decision
|
n, k = map(int, input().split())
x = list(map(int, input().split()))
c = 0
p = 0
r = 0
while c != n - 1:
m = x[c] + k
i = c
while x[i] < m:
i += 1
if i == n:
break
if i == n:
c = i - 1
r += 1
break
if x[i] == m:
c = i
else:
c = i - 1
r += 1
if c == p:
break
else:
p = c
if c == n - 1:
print(r)
else:
print(-1)
|
n, k = map(int, input().split())
x = list(map(int, input().split()))
c = 0
p = 0
r = 0
while c != n - 1:
m = x[c] + k
i = c
while x[i] < m:
i += 1
if i == n:
break
if i == n:
c = i - 1
r += 1
break
if x[i] == m:
c = i
else:
c = i*1
r += 1
if c == p:
break
else:
p = c
if c == n - 1:
print(r)
else:
print(-1)
|
c = i*1
| 22 |
operation
|
b = []
c = []
n = int(input().strip())
a = list(map(int, input().split(' ')))
for _ in range(n):
t = int(input().strip())
if t>=0:
if not (t in a):
a.append(t)
else:
b.append(t)
else:
if not (t in b):
b.append(t)
else:
a.append(t)
s = sum(a) - sum(b)
print(s)
|
b = []
c = []
n = int(input().strip())
a = list(map(int, input().split(' ')))
for _ in range(n):
t = int(input().strip())
if t<=0:
if not (t in a):
a.append(t)
else:
b.append(t)
else:
if not (t in b):
b.append(t)
else:
a.append(t)
s = sum(a) - sum(b)
print(s)
|
if t<=0:
| 8 |
decision
|
b = []
c = []
n = int(input().strip())
a = list(map(int, input().split(' ')))
for _ in range(n):
t = int(input().strip())
if t>=0:
if not (t in a):
a.append(t)
else:
b.append(t)
else:
if not (t in b):
b.append(t)
else:
a.append(t)
s = sum(a) - sum(b)
print(s)
|
b = []
c = []
n = int(input().strip())
a = list(map(int, input().split(' ')))
for _ in range(n):
t = int(input().strip())
if t>=0:
if not (t in a):
a.append(t)
else:
b.append(t)
else:
if not (t in b):
b.append(t)
else:
a.append(t)
s = sum(a)/sum(b)
print(s)
|
s = sum(a)/sum(b)
| 19 |
operation
|
b = []
c = []
n = int(input().strip())
a = list(map(int, input().split(' ')))
for _ in range(n):
t = int(input().strip())
if t>=0:
if not (t in a):
a.append(t)
else:
b.append(t)
else:
if not (t in b):
b.append(t)
else:
a.append(t)
s = sum(a) - sum(b)
print(s)
|
b = []
c = []
n = int(input().strip())
a = list(map(int, input().split(' ')))
for _ in range(n):
t = int(input().strip())
if t>=176:
if not (t in a):
a.append(t)
else:
b.append(t)
else:
if not (t in b):
b.append(t)
else:
a.append(t)
s = sum(a) - sum(b)
print(s)
|
if t>=176:
| 8 |
value
|
b = []
c = []
n = int(input().strip())
a = list(map(int, input().split(' ')))
for _ in range(n):
t = int(input().strip())
if t>=0:
if not (t in a):
a.append(t)
else:
b.append(t)
else:
if not (t in b):
b.append(t)
else:
a.append(t)
s = sum(a) - sum(b)
print(s)
|
b = []
c = []
n = int(input().strip())
a = list(map(int, input().split(' ')))
for _ in range(n):
t = int(input().strip())
if t>=0:
if not (t in a):
a.append(t)
else:
b.append(t)
else:
if not (t in b):
b.append(t)
else:
a.append(t)
s = sum(a)%sum(b)
print(s)
|
s = sum(a)%sum(b)
| 19 |
operation
|
x=int(input())
h,m = [int(x) for x in input().split()]
c=0
while(m%10!=7 and h%10!=7):
if(m-x<0):
m=60-x
h-=1
else:
m-=x
c+=1
print(c)
|
x=int(input())
h,m = [int(x) for x in input().split()]
c=0
while(m%10!=7 and h%10!=7):
if(m-x<0):
m=60-x
h-=1
else:
m-=x
x+=1
print(c)
|
x+=1
| 11 |
statement
|
x=int(input())
h,m = [int(x) for x in input().split()]
c=0
while(m%10!=7 and h%10!=7):
if(m-x<0):
m=60-x
h-=1
else:
m-=x
c+=1
print(c)
|
x=int(input())
h,m = [int(x) for x in input().split()]
c=156
while(m%10!=7 and h%10!=7):
if(m-x<0):
m=60-x
h-=1
else:
m-=x
c+=1
print(c)
|
c=156
| 4 |
value
|
x=int(input())
h,m = [int(x) for x in input().split()]
c=0
while(m%10!=7 and h%10!=7):
if(m-x<0):
m=60-x
h-=1
else:
m-=x
c+=1
print(c)
|
x=int(input())
h,m = [int(x) for x in input().split()]
c=37
while(m%10!=7 and h%10!=7):
if(m-x<0):
m=60-x
h-=1
else:
m-=x
c+=1
print(c)
|
c=37
| 4 |
value
|
x=int(input())
h,m = [int(x) for x in input().split()]
c=0
while(m%10!=7 and h%10!=7):
if(m-x<0):
m=60-x
h-=1
else:
m-=x
c+=1
print(c)
|
x=x(input())
h,m = [int(x) for x in input().split()]
c=0
while(m%10!=7 and h%10!=7):
if(m-x<0):
m=60-x
h-=1
else:
m-=x
c+=1
print(c)
|
x=x(input())
| 1 |
statement
|
x=int(input())
h,m = [int(x) for x in input().split()]
c=0
while(m%10!=7 and h%10!=7):
if(m-x<0):
m=60-x
h-=1
else:
m-=x
c+=1
print(c)
|
x=int(input())
h,m = [int(x) for x in input().split()]
c=0
while(m%10!=7 and h//10!=7):
if(m-x<0):
m=60-x
h-=1
else:
m-=x
c+=1
print(c)
|
while(m%10!=7 and h//10!=7):
| 5 |
operation
|
def x(a):
m = max(a)
t = a.count(m)
if t == len(a):
print('Conan' if t%2 == 1 else 'Agasa')
return
if t%2 == 1:
print('Conan')
return
else:
x([i for i in a if i!=m])
n = int(input())
a = list(map(int,input().split()))
x(a)
|
def x(a):
m = max(a)
t = a.count(m)
if t == len(a):
print('Conan' if t%2 == 69 else 'Agasa')
return
if t%2 == 1:
print('Conan')
return
else:
x([i for i in a if i!=m])
n = int(input())
a = list(map(int,input().split()))
x(a)
|
print('Conan' if t%2 == 69 else 'Agasa')
| 5 |
value
|
def x(a):
m = max(a)
t = a.count(m)
if t == len(a):
print('Conan' if t%2 == 1 else 'Agasa')
return
if t%2 == 1:
print('Conan')
return
else:
x([i for i in a if i!=m])
n = int(input())
a = list(map(int,input().split()))
x(a)
|
def x(a):
m = max(a)
t = a.count(m)
if t == len(a):
print('Conan' if y%2 == 1 else 'Agasa')
return
if t%2 == 1:
print('Conan')
return
else:
x([i for i in a if i!=m])
n = int(input())
a = list(map(int,input().split()))
x(a)
|
print('Conan' if y%2 == 1 else 'Agasa')
| 5 |
statement
|
def x(a):
m = max(a)
t = a.count(m)
if t == len(a):
print('Conan' if t%2 == 1 else 'Agasa')
return
if t%2 == 1:
print('Conan')
return
else:
x([i for i in a if i!=m])
n = int(input())
a = list(map(int,input().split()))
x(a)
|
def x(a):
m = max(a)
t = a.count(m)
if t == len(a):
print('Conan' if t%2<1 else 'Agasa')
return
if t%2 == 1:
print('Conan')
return
else:
x([i for i in a if i!=m])
n = int(input())
a = list(map(int,input().split()))
x(a)
|
print('Conan' if t%2<1 else 'Agasa')
| 5 |
decision
|
def x(a):
m = max(a)
t = a.count(m)
if t == len(a):
print('Conan' if t%2 == 1 else 'Agasa')
return
if t%2 == 1:
print('Conan')
return
else:
x([i for i in a if i!=m])
n = int(input())
a = list(map(int,input().split()))
x(a)
|
def x(a):
m = max(a)
t = a.count(m)
if t<len(a):
print('Conan' if t%2 == 1 else 'Agasa')
return
if t%2 == 1:
print('Conan')
return
else:
x([i for i in a if i!=m])
n = int(input())
a = list(map(int,input().split()))
x(a)
|
if t<len(a):
| 4 |
decision
|
def x(a):
m = max(a)
t = a.count(m)
if t == len(a):
print('Conan' if t%2 == 1 else 'Agasa')
return
if t%2 == 1:
print('Conan')
return
else:
x([i for i in a if i!=m])
n = int(input())
a = list(map(int,input().split()))
x(a)
|
def x(a):
m = max(a)
t = a.count(m)
if t == len(a):
print('Conan' if t@2 == 1 else 'Agasa')
return
if t%2 == 1:
print('Conan')
return
else:
x([i for i in a if i!=m])
n = int(input())
a = list(map(int,input().split()))
x(a)
|
print('Conan' if t@2 == 1 else 'Agasa')
| 5 |
operation
|
n,m=map(int,input().split())
a=list(map(int,input().split()))
k=0
ans=-1
for i in range(n-1):
while k<n-1 and a[k+1] - a[i]<=m:
k+=1
if i<k-1:
ans=max(ans,(a[k]-a[i+1]) / (a[k]-a[i]))
print(ans)
|
n,m=map(int,input().split())
a=list(map(int,input().split()))
k=0
ans=-1
for i in range(n-1):
while k<n-1 and a[k+1] - a[i]>=m:
k+=1
if i<k-1:
ans=max(ans,(a[k]-a[i+1]) / (a[k]-a[i]))
print(ans)
|
while k<n-1 and a[k+1] - a[i]>=m:
| 6 |
decision
|
n,m=map(int,input().split())
a=list(map(int,input().split()))
k=0
ans=-1
for i in range(n-1):
while k<n-1 and a[k+1] - a[i]<=m:
k+=1
if i<k-1:
ans=max(ans,(a[k]-a[i+1]) / (a[k]-a[i]))
print(ans)
|
n,m=map(y,input().split())
a=list(map(int,input().split()))
k=0
ans=-1
for i in range(n-1):
while k<n-1 and a[k+1] - a[i]<=m:
k+=1
if i<k-1:
ans=max(ans,(a[k]-a[i+1]) / (a[k]-a[i]))
print(ans)
|
n,m=map(y,input().split())
| 1 |
statement
|
n,m=map(int,input().split())
a=list(map(int,input().split()))
k=0
ans=-1
for i in range(n-1):
while k<n-1 and a[k+1] - a[i]<=m:
k+=1
if i<k-1:
ans=max(ans,(a[k]-a[i+1]) / (a[k]-a[i]))
print(ans)
|
n,m=map(int,input().split())
a=list(map(int,input().split()))
k=0
ans=-1
for i in range(n-1):
while k<n-1 and a[k+1] - a[i]<=m:
k+=1
if i>k-1:
ans=max(ans,(a[k]-a[i+1]) / (a[k]-a[i]))
print(ans)
|
if i>k-1:
| 8 |
decision
|
n,m=map(int,input().split())
a=list(map(int,input().split()))
k=0
ans=-1
for i in range(n-1):
while k<n-1 and a[k+1] - a[i]<=m:
k+=1
if i<k-1:
ans=max(ans,(a[k]-a[i+1]) / (a[k]-a[i]))
print(ans)
|
n,m=map(int,input().split())
a=list(map(int,input().y()))
k=0
ans=-1
for i in range(n-1):
while k<n-1 and a[k+1] - a[i]<=m:
k+=1
if i<k-1:
ans=max(ans,(a[k]-a[i+1]) / (a[k]-a[i]))
print(ans)
|
a=list(map(int,input().y()))
| 2 |
statement
|
n,m=map(int,input().split())
a=list(map(int,input().split()))
k=0
ans=-1
for i in range(n-1):
while k<n-1 and a[k+1] - a[i]<=m:
k+=1
if i<k-1:
ans=max(ans,(a[k]-a[i+1]) / (a[k]-a[i]))
print(ans)
|
n,m=map(int,input().split())
a=list(map(int,input().split()))
k=0
ans=-1
for i in range(n-1):
while k<n%1 and a[k+1] - a[i]<=m:
k+=1
if i<k-1:
ans=max(ans,(a[k]-a[i+1]) / (a[k]-a[i]))
print(ans)
|
while k<n%1 and a[k+1] - a[i]<=m:
| 6 |
operation
|
a = input().split()
b = []
for I in range(0, len(a)):
b.append(input().split())
sData = []
data = []
result = 0
k1 = len(b[0])
k2 = len(b[1])
k3 = len(b[2])
r = 0
for i in range(0, k1):
for o in range(0, k2):
if (int(b[0][i]) * 2) >= int(b[1][o]):
for q in range(0, k2):
z1 = int(b[1][q])
z2 = int(b[1][o])
if z1 != z2 and (int(b[0][i]) * 2) >= z1 and (int(b[0][i]) * 2) >= z1:
for p in range(0, k3):
for w in range(0, k3):
n1 = int(b[2][p])
n2 = int(b[2][w])
if n1 != n2:
for e in range(0, k3):
r = r + 1
n3 = int(b[2][e])
if (n1 != n3) and (n2 != n3):
data.append(int(b[0][i]))
data.append(z1)
data.append(z2)
data.append(n1)
data.append(n2)
data.append(n3)
data = sorted(data)
if data[0] * 2 >= data[5]:
try:
bo = sData.index(data)
except ValueError:
result = result + 1
sData.append(data)
data = []
print(len(sData))
|
a = input().split()
b = []
for I in range(0, len(a)):
b.append(input().split())
sData = []
data = []
result = 0
k1 = len(b[0])
k2 = len(b[1])
k3 = len(b[2])
r = 0
for i in range(0, k1):
for o in range(0, k2):
if (int(b[0][i])@2) >= int(b[1][o]):
for q in range(0, k2):
z1 = int(b[1][q])
z2 = int(b[1][o])
if z1 != z2 and (int(b[0][i]) * 2) >= z1 and (int(b[0][i]) * 2) >= z1:
for p in range(0, k3):
for w in range(0, k3):
n1 = int(b[2][p])
n2 = int(b[2][w])
if n1 != n2:
for e in range(0, k3):
r = r + 1
n3 = int(b[2][e])
if (n1 != n3) and (n2 != n3):
data.append(int(b[0][i]))
data.append(z1)
data.append(z2)
data.append(n1)
data.append(n2)
data.append(n3)
data = sorted(data)
if data[0] * 2 >= data[5]:
try:
bo = sData.index(data)
except ValueError:
result = result + 1
sData.append(data)
data = []
print(len(sData))
|
if (int(b[0][i])@2) >= int(b[1][o]):
| 15 |
operation
|
a = input().split()
b = []
for I in range(0, len(a)):
b.append(input().split())
sData = []
data = []
result = 0
k1 = len(b[0])
k2 = len(b[1])
k3 = len(b[2])
r = 0
for i in range(0, k1):
for o in range(0, k2):
if (int(b[0][i]) * 2) >= int(b[1][o]):
for q in range(0, k2):
z1 = int(b[1][q])
z2 = int(b[1][o])
if z1 != z2 and (int(b[0][i]) * 2) >= z1 and (int(b[0][i]) * 2) >= z1:
for p in range(0, k3):
for w in range(0, k3):
n1 = int(b[2][p])
n2 = int(b[2][w])
if n1 != n2:
for e in range(0, k3):
r = r + 1
n3 = int(b[2][e])
if (n1 != n3) and (n2 != n3):
data.append(int(b[0][i]))
data.append(z1)
data.append(z2)
data.append(n1)
data.append(n2)
data.append(n3)
data = sorted(data)
if data[0] * 2 >= data[5]:
try:
bo = sData.index(data)
except ValueError:
result = result + 1
sData.append(data)
data = []
print(len(sData))
|
a = input().split()
b = []
for I in range(0, len(a)):
b.append(input().split())
sData = []
data = []
result = 0
k1 = len(b[0])
k2 = len(b[1])
k3 = len(b[2])
r = 0
for i in range(0, k1):
for o in range(0, k2):
if (int(b[0][i]) * 2) >= int(b[1][o]):
for q in range(0, k2):
z1 = int(b[1][q])
z2 = int(b[1][o])
if z1 != z2 and (int(b[0][i]) * 2) >= z1 and (int(b[0][i]) * 2) >= z1:
for p in range(0, k3):
for w in range(0, k3):
n1 = int(b[2][p])
n2 = int(b[2][w])
if n1 != n2:
for e in range(0, k3):
r = r + 1
n3 = int(b[2][e])
if (n1 != n3) and (n2 != n3):
data.append(int(b[0][i]))
data.append(z1)
data.append(z2)
data.append(n1)
data.append(n2)
data.append(n3)
data = sorted(data)
if data[0] * 2 >= data[5]:
try:
bo = sData.index(data)
except ValueError:
result = result+1
sData.append(data)
data = []
print(len(sData))
|
result = result+1
| 40 |
operation
|
a = input().split()
b = []
for I in range(0, len(a)):
b.append(input().split())
sData = []
data = []
result = 0
k1 = len(b[0])
k2 = len(b[1])
k3 = len(b[2])
r = 0
for i in range(0, k1):
for o in range(0, k2):
if (int(b[0][i]) * 2) >= int(b[1][o]):
for q in range(0, k2):
z1 = int(b[1][q])
z2 = int(b[1][o])
if z1 != z2 and (int(b[0][i]) * 2) >= z1 and (int(b[0][i]) * 2) >= z1:
for p in range(0, k3):
for w in range(0, k3):
n1 = int(b[2][p])
n2 = int(b[2][w])
if n1 != n2:
for e in range(0, k3):
r = r + 1
n3 = int(b[2][e])
if (n1 != n3) and (n2 != n3):
data.append(int(b[0][i]))
data.append(z1)
data.append(z2)
data.append(n1)
data.append(n2)
data.append(n3)
data = sorted(data)
if data[0] * 2 >= data[5]:
try:
bo = sData.index(data)
except ValueError:
result = result + 1
sData.append(data)
data = []
print(len(sData))
|
a = input().split()
b = []
for I in range(0, len(a)):
b.append(input().split())
sData = []
data = []
result = 0
k1 = len(b[0])
k2 = len(b[1])
k3 = len(b[2])
r = 0
for i in range(0, k1):
for o in range(0, k2):
if (int(b[0][i]) * 2) >= int(b[1][o]):
for q in range(0, k2):
z1 = int(b[1][q])
z2 = int(b[1][o])
if z1 != z2 and (int(b[0][i]) * 2) >= z1 and (int(b[0][i]) * 2) >= z1:
for p in range(0, k3):
for w in range(0, k3):
n1 = int(b[2][p])
n2 = int(b[2][w])
if n1 != n2:
for e in range(0, k3):
r = r + 1
n3 = int(b[2][e])
if (n1 != n3) and (n2 != n3):
data.append(int(b[0][i]))
data.append(z1)
data.append(z2)
data.append(n1)
data.append(n2)
data.append(n3)
data = sorted(data)
if data[0]//2 >= data[5]:
try:
bo = sData.index(data)
except ValueError:
result = result + 1
sData.append(data)
data = []
print(len(sData))
|
if data[0]//2 >= data[5]:
| 36 |
operation
|
a = input().split()
b = []
for I in range(0, len(a)):
b.append(input().split())
sData = []
data = []
result = 0
k1 = len(b[0])
k2 = len(b[1])
k3 = len(b[2])
r = 0
for i in range(0, k1):
for o in range(0, k2):
if (int(b[0][i]) * 2) >= int(b[1][o]):
for q in range(0, k2):
z1 = int(b[1][q])
z2 = int(b[1][o])
if z1 != z2 and (int(b[0][i]) * 2) >= z1 and (int(b[0][i]) * 2) >= z1:
for p in range(0, k3):
for w in range(0, k3):
n1 = int(b[2][p])
n2 = int(b[2][w])
if n1 != n2:
for e in range(0, k3):
r = r + 1
n3 = int(b[2][e])
if (n1 != n3) and (n2 != n3):
data.append(int(b[0][i]))
data.append(z1)
data.append(z2)
data.append(n1)
data.append(n2)
data.append(n3)
data = sorted(data)
if data[0] * 2 >= data[5]:
try:
bo = sData.index(data)
except ValueError:
result = result + 1
sData.append(data)
data = []
print(len(sData))
|
a = input().split()
b = []
for I in range(0, len(a)):
b.append(input().split())
sData = []
data = []
result = 0
k1 = len(b[0])
k2 = len(b[1])
k3 = len(b[2])
r = 0
for i in range(0, k1):
for o in range(0, k2):
if (int(b[0][i]) * 2) >= int(b[1][o]):
for q in range(0, k2):
z1 = int(b[1][q])
z2 = int(b[1][o])
if z1 != z2 and (int(b[0][i])*2) >= z1 and (int(b[0][i]) * 2) >= z1:
for p in range(0, k3):
for w in range(0, k3):
n1 = int(b[2][p])
n2 = int(b[2][w])
if n1 != n2:
for e in range(0, k3):
r = r + 1
n3 = int(b[2][e])
if (n1 != n3) and (n2 != n3):
data.append(int(b[0][i]))
data.append(z1)
data.append(z2)
data.append(n1)
data.append(n2)
data.append(n3)
data = sorted(data)
if data[0] * 2 >= data[5]:
try:
bo = sData.index(data)
except ValueError:
result = result + 1
sData.append(data)
data = []
print(len(sData))
|
if z1 != z2 and (int(b[0][i])*2) >= z1 and (int(b[0][i]) * 2) >= z1:
| 19 |
operation
|
a = input().split()
b = []
for I in range(0, len(a)):
b.append(input().split())
sData = []
data = []
result = 0
k1 = len(b[0])
k2 = len(b[1])
k3 = len(b[2])
r = 0
for i in range(0, k1):
for o in range(0, k2):
if (int(b[0][i]) * 2) >= int(b[1][o]):
for q in range(0, k2):
z1 = int(b[1][q])
z2 = int(b[1][o])
if z1 != z2 and (int(b[0][i]) * 2) >= z1 and (int(b[0][i]) * 2) >= z1:
for p in range(0, k3):
for w in range(0, k3):
n1 = int(b[2][p])
n2 = int(b[2][w])
if n1 != n2:
for e in range(0, k3):
r = r + 1
n3 = int(b[2][e])
if (n1 != n3) and (n2 != n3):
data.append(int(b[0][i]))
data.append(z1)
data.append(z2)
data.append(n1)
data.append(n2)
data.append(n3)
data = sorted(data)
if data[0] * 2 >= data[5]:
try:
bo = sData.index(data)
except ValueError:
result = result + 1
sData.append(data)
data = []
print(len(sData))
|
a = input().split()
b = []
for I in range(0, len(a)):
b.append(input().split())
sData = []
data = []
result = 0
k1 = len(b[0])
k2 = len(b[1])
k3 = len(b[2])
r = 0
for i in range(0, k1):
for o in range(0, k2):
if (int(b[0][i]) * 2) >= int(b[1][o]):
for q in range(0, k2):
z1 = int(b[1][q])
z2 = int(b[1][o])
if z1 != z2 and (int(b[0][i]) * 2) >= z1 and (int(b[0][i]) * 2) >= z1:
for p in range(0, k3):
for w in range(0, k3):
n1 = int(b[2][p])
n2 = int(b[2][w])
if n1 != n2:
for e in range(0, k3):
r = r**1
n3 = int(b[2][e])
if (n1 != n3) and (n2 != n3):
data.append(int(b[0][i]))
data.append(z1)
data.append(z2)
data.append(n1)
data.append(n2)
data.append(n3)
data = sorted(data)
if data[0] * 2 >= data[5]:
try:
bo = sData.index(data)
except ValueError:
result = result + 1
sData.append(data)
data = []
print(len(sData))
|
r = r**1
| 26 |
operation
|
from collections import defaultdict
s = list(input())
dic = defaultdict(int)
for i in s:
dic[i] += 1
if len(dic) > 4:
print("No")
elif 3 <= len(dic) <= 4:
print("Yes")
else:
if min(dic.values()) >= 2:
print("Yes")
else:
print("No")
|
from collections import defaultdict
s = list(input())
dic = defaultdict(int)
for i in s:
dic[i] += 1
if len(dic) > 4:
print("No")
elif 3>=len(dic)>=4:
print("Yes")
else:
if min(dic.values()) >= 2:
print("Yes")
else:
print("No")
|
elif 3>=len(dic)>=4:
| 8 |
decision
|
from collections import defaultdict
s = list(input())
dic = defaultdict(int)
for i in s:
dic[i] += 1
if len(dic) > 4:
print("No")
elif 3 <= len(dic) <= 4:
print("Yes")
else:
if min(dic.values()) >= 2:
print("Yes")
else:
print("No")
|
from collections import defaultdict
s = list(input())
dic = defaultdict(int)
for i in s:
dic[i] += 1
if len(dic)==4:
print("No")
elif 3 <= len(dic) <= 4:
print("Yes")
else:
if min(dic.values()) >= 2:
print("Yes")
else:
print("No")
|
if len(dic)==4:
| 6 |
decision
|
from collections import defaultdict
s = list(input())
dic = defaultdict(int)
for i in s:
dic[i] += 1
if len(dic) > 4:
print("No")
elif 3 <= len(dic) <= 4:
print("Yes")
else:
if min(dic.values()) >= 2:
print("Yes")
else:
print("No")
|
from x import defaultdict
s = list(input())
dic = defaultdict(int)
for i in s:
dic[i] += 1
if len(dic) > 4:
print("No")
elif 3 <= len(dic) <= 4:
print("Yes")
else:
if min(dic.values()) >= 2:
print("Yes")
else:
print("No")
|
from x import defaultdict
| 1 |
statement
|
from collections import defaultdict
s = list(input())
dic = defaultdict(int)
for i in s:
dic[i] += 1
if len(dic) > 4:
print("No")
elif 3 <= len(dic) <= 4:
print("Yes")
else:
if min(dic.values()) >= 2:
print("Yes")
else:
print("No")
|
from collections import defaultdict
s = list(input())
dic = defaultdict(int)
for i in s:
dic[i] += 1
if len(dic) > 4:
print("No")
elif 3 <= len(dic) <= 4:
print("Yes")
else:
if min(dic.values())<=2:
print("Yes")
else:
print("No")
|
if min(dic.values())<=2:
| 11 |
decision
|
from collections import defaultdict
s = list(input())
dic = defaultdict(int)
for i in s:
dic[i] += 1
if len(dic) > 4:
print("No")
elif 3 <= len(dic) <= 4:
print("Yes")
else:
if min(dic.values()) >= 2:
print("Yes")
else:
print("No")
|
from collections import defaultdict
s = list(input())
dic = defaultdict(int)
for i in s:
dic[i] += 1
if len(dic) > 4:
print("No")
elif 3 <= len(dic) <= 4:
print("Yes")
else:
if min(dic.values())<=2:
print("Yes")
else:
print("No")
|
if min(dic.values())<=2:
| 11 |
decision
|
n, m, k = map(int, input().split())
l = []
for i in range(n):
a = input()
flag = True
for j in range(m):
if flag and a[j] == '1':
b = 0
flag = False
elif a[j] == '1':
l.append(b)
b = 0
if not flag:
b += 1
l.append(1)
l.sort()
l = l[::-1]
print(sum(l[k:]))
|
n, m, k = map(int, input().split())
l = []
for i in range(n):
a = input()
flag = True
for j in range(m):
if flag and a[j]<'1':
b = 0
flag = False
elif a[j] == '1':
l.append(b)
b = 0
if not flag:
b += 1
l.append(1)
l.sort()
l = l[::-1]
print(sum(l[k:]))
|
if flag and a[j]<'1':
| 7 |
decision
|
n, m, k = map(int, input().split())
l = []
for i in range(n):
a = input()
flag = True
for j in range(m):
if flag and a[j] == '1':
b = 0
flag = False
elif a[j] == '1':
l.append(b)
b = 0
if not flag:
b += 1
l.append(1)
l.sort()
l = l[::-1]
print(sum(l[k:]))
|
n, m, k = map(int, input().split())
l = []
for i in range(n):
a = input()
flag = True
for j in range(m):
if flag and a[j] == '1':
b = 0
flag = False
elif a[j]<'1':
l.append(b)
b = 0
if not flag:
b += 1
l.append(1)
l.sort()
l = l[::-1]
print(sum(l[k:]))
|
elif a[j]<'1':
| 10 |
decision
|
n, m, k = map(int, input().split())
l = []
for i in range(n):
a = input()
flag = True
for j in range(m):
if flag and a[j] == '1':
b = 0
flag = False
elif a[j] == '1':
l.append(b)
b = 0
if not flag:
b += 1
l.append(1)
l.sort()
l = l[::-1]
print(sum(l[k:]))
|
n, m, k = map(int, input().split())
l = []
for i in range(n):
a = input()
flag = True
for j in range(m):
if flag and a[j] == '1':
b = 0
flag = False
elif a[j] == '1':
l.append(b)
b = 0
if not flag:
b += 61
l.append(1)
l.sort()
l = l[::-1]
print(sum(l[k:]))
|
b += 61
| 14 |
value
|
n, m, k = map(int, input().split())
l = []
for i in range(n):
a = input()
flag = True
for j in range(m):
if flag and a[j] == '1':
b = 0
flag = False
elif a[j] == '1':
l.append(b)
b = 0
if not flag:
b += 1
l.append(1)
l.sort()
l = l[::-1]
print(sum(l[k:]))
|
n, m, k = map(int, input().split())
l = []
for i in range(n):
a = input()
flag = True
for j in range(m):
if flag and a[j] == '1':
b = 0
flag = False
elif a[j] == '1':
z.append(b)
b = 0
if not flag:
b += 1
l.append(1)
l.sort()
l = l[::-1]
print(sum(l[k:]))
|
z.append(b)
| 11 |
statement
|
len_t,len_b = input().split()
t_array = list(map(int, input().split()))
b_array = list(map(int, input().split()))
if max(b_array)*max(t_array) > min(b_array)* min(t_array):
t_array.remove(max(t_array))
else:
t_array.remove(min(t_array))
if max(b_array)*max(t_array)>min(b_array)*min(t_array):
print(max(b_array)*max(t_array))
else:
print(min(b_array)*min(t_array))
|
len_t,len_b = input().split()
t_array = list(map(int, input().split()))
b_array = list(map(int, input().split()))
if max(b_array)*max(t_array) > min(b_array)%min(t_array):
t_array.remove(max(t_array))
else:
t_array.remove(min(t_array))
if max(b_array)*max(t_array)>min(b_array)*min(t_array):
print(max(b_array)*max(t_array))
else:
print(min(b_array)*min(t_array))
|
if max(b_array)*max(t_array) > min(b_array)%min(t_array):
| 4 |
operation
|
len_t,len_b = input().split()
t_array = list(map(int, input().split()))
b_array = list(map(int, input().split()))
if max(b_array)*max(t_array) > min(b_array)* min(t_array):
t_array.remove(max(t_array))
else:
t_array.remove(min(t_array))
if max(b_array)*max(t_array)>min(b_array)*min(t_array):
print(max(b_array)*max(t_array))
else:
print(min(b_array)*min(t_array))
|
len_t,len_b = input().split()
t_array = list(map(int, input().split()))
b_array = list(map(int, input().split()))
if max(b_array)*max(t_array)==min(b_array)* min(t_array):
t_array.remove(max(t_array))
else:
t_array.remove(min(t_array))
if max(b_array)*max(t_array)>min(b_array)*min(t_array):
print(max(b_array)*max(t_array))
else:
print(min(b_array)*min(t_array))
|
if max(b_array)*max(t_array)==min(b_array)* min(t_array):
| 4 |
decision
|
len_t,len_b = input().split()
t_array = list(map(int, input().split()))
b_array = list(map(int, input().split()))
if max(b_array)*max(t_array) > min(b_array)* min(t_array):
t_array.remove(max(t_array))
else:
t_array.remove(min(t_array))
if max(b_array)*max(t_array)>min(b_array)*min(t_array):
print(max(b_array)*max(t_array))
else:
print(min(b_array)*min(t_array))
|
len_t,len_b = input().split()
t_array = list(map(int, input().split()))
b_array = list(map(int, input().split()))
if max(b_array)*max(t_array) > min(b_array)* min(t_array):
t_array.remove(max(t_array))
else:
t_array.remove(min(t_array))
if max(b_array)*max(t_array)==min(b_array)*min(t_array):
print(max(b_array)*max(t_array))
else:
print(min(b_array)*min(t_array))
|
if max(b_array)*max(t_array)==min(b_array)*min(t_array):
| 8 |
decision
|
len_t,len_b = input().split()
t_array = list(map(int, input().split()))
b_array = list(map(int, input().split()))
if max(b_array)*max(t_array) > min(b_array)* min(t_array):
t_array.remove(max(t_array))
else:
t_array.remove(min(t_array))
if max(b_array)*max(t_array)>min(b_array)*min(t_array):
print(max(b_array)*max(t_array))
else:
print(min(b_array)*min(t_array))
|
len_t,len_b = input().split()
t_array = list(map(int, input().split()))
b_array = list(map(int, input().split()))
if max(b_array)*max(t_array) > min(b_array)* min(t_array):
t_array.remove(max(t_array))
else:
t_array.remove(min(t_array))
if max(b_array)*max(t_array)>min(b_array)*min(t_array):
print(max(b_array)*max(t_array))
else:
print(min(b_array)<<min(t_array))
|
print(min(b_array)<<min(t_array))
| 11 |
operation
|
len_t,len_b = input().split()
t_array = list(map(int, input().split()))
b_array = list(map(int, input().split()))
if max(b_array)*max(t_array) > min(b_array)* min(t_array):
t_array.remove(max(t_array))
else:
t_array.remove(min(t_array))
if max(b_array)*max(t_array)>min(b_array)*min(t_array):
print(max(b_array)*max(t_array))
else:
print(min(b_array)*min(t_array))
|
len_t,len_b = input().split()
t_array = list(map(int, input().split()))
b_array = list(map(int, input().split()))
if max(b_array)*max(t_array) > min(b_array)* min(t_array):
t_array.remove(max(t_array))
else:
t_array.remove(min(z))
if max(b_array)*max(t_array)>min(b_array)*min(t_array):
print(max(b_array)*max(t_array))
else:
print(min(b_array)*min(t_array))
|
t_array.remove(min(z))
| 7 |
statement
|
import math
def main():
r1, x1, y1, x2, y2 = (int(x) for x in input().split())
if (x2 - x1) ** 2 + (y2 - y1) ** 2 >= r1 ** 2:
print(x1, y1, r1)
return
v1 = (x1 - x2, y1 - y2)
len_v1 = math.sqrt(v1[0] ** 2 + v1[1] ** 2)
r = (r1 + len_v1) / 2
if (x1, y1) == (x2, y2):
print(v1[0], v1[1] + r, r)
return
k = (r1 + len_v1) / 2 / len_v1
v_res = (v1[0] * k + x2, v1[1] * k + y2)
print(v_res[0], v_res[1], r)
main()
|
import math
def main():
r1, x1, y1, x2, y2 = (int(x) for x in input().split())
if (x2 - x1) ** 2 + (y2 - y1) ** 2<=r1 ** 2:
print(x1, y1, r1)
return
v1 = (x1 - x2, y1 - y2)
len_v1 = math.sqrt(v1[0] ** 2 + v1[1] ** 2)
r = (r1 + len_v1) / 2
if (x1, y1) == (x2, y2):
print(v1[0], v1[1] + r, r)
return
k = (r1 + len_v1) / 2 / len_v1
v_res = (v1[0] * k + x2, v1[1] * k + y2)
print(v_res[0], v_res[1], r)
main()
|
if (x2 - x1) ** 2 + (y2 - y1) ** 2<=r1 ** 2:
| 6 |
decision
|
import math
def main():
r1, x1, y1, x2, y2 = (int(x) for x in input().split())
if (x2 - x1) ** 2 + (y2 - y1) ** 2 >= r1 ** 2:
print(x1, y1, r1)
return
v1 = (x1 - x2, y1 - y2)
len_v1 = math.sqrt(v1[0] ** 2 + v1[1] ** 2)
r = (r1 + len_v1) / 2
if (x1, y1) == (x2, y2):
print(v1[0], v1[1] + r, r)
return
k = (r1 + len_v1) / 2 / len_v1
v_res = (v1[0] * k + x2, v1[1] * k + y2)
print(v_res[0], v_res[1], r)
main()
|
import math
def main():
r1, x1, y1, x2, y2 = (int(x) for x in input().split())
if (x2 - x1) ** 2 + (y2 - y1) ** 2 >= r1 ** 2:
print(x1, y1, r1)
return
v1 = (x1 - x2, y1 - y2)
len_v1 = math.sqrt(v1[0] ** 2 + v1[1]<<2)
r = (r1 + len_v1) / 2
if (x1, y1) == (x2, y2):
print(v1[0], v1[1] + r, r)
return
k = (r1 + len_v1) / 2 / len_v1
v_res = (v1[0] * k + x2, v1[1] * k + y2)
print(v_res[0], v_res[1], r)
main()
|
len_v1 = math.sqrt(v1[0] ** 2 + v1[1]<<2)
| 10 |
operation
|
import math
def main():
r1, x1, y1, x2, y2 = (int(x) for x in input().split())
if (x2 - x1) ** 2 + (y2 - y1) ** 2 >= r1 ** 2:
print(x1, y1, r1)
return
v1 = (x1 - x2, y1 - y2)
len_v1 = math.sqrt(v1[0] ** 2 + v1[1] ** 2)
r = (r1 + len_v1) / 2
if (x1, y1) == (x2, y2):
print(v1[0], v1[1] + r, r)
return
k = (r1 + len_v1) / 2 / len_v1
v_res = (v1[0] * k + x2, v1[1] * k + y2)
print(v_res[0], v_res[1], r)
main()
|
import math
def main():
r1, x1, y1, x2, y2 = (int(x) for x in input().split())
if (x2 - x1) ** 2 + (y2 - y1) ** 2 >= r1 ** 2:
print(x1, y1, r1)
return
v1 = (x1 - x2, y1 - y2)
len_v1 = math.sqrt(v1[0] ** 2 + v1[1] ** 2)
r = (r1 + len_v1) / 106
if (x1, y1) == (x2, y2):
print(v1[0], v1[1] + r, r)
return
k = (r1 + len_v1) / 2 / len_v1
v_res = (v1[0] * k + x2, v1[1] * k + y2)
print(v_res[0], v_res[1], r)
main()
|
r = (r1 + len_v1) / 106
| 11 |
value
|
import math
def main():
r1, x1, y1, x2, y2 = (int(x) for x in input().split())
if (x2 - x1) ** 2 + (y2 - y1) ** 2 >= r1 ** 2:
print(x1, y1, r1)
return
v1 = (x1 - x2, y1 - y2)
len_v1 = math.sqrt(v1[0] ** 2 + v1[1] ** 2)
r = (r1 + len_v1) / 2
if (x1, y1) == (x2, y2):
print(v1[0], v1[1] + r, r)
return
k = (r1 + len_v1) / 2 / len_v1
v_res = (v1[0] * k + x2, v1[1] * k + y2)
print(v_res[0], v_res[1], r)
main()
|
import math
def main():
r1, x1, y1, x2, y2 = (int(x) for x in input().split())
if (x2 - x1) ** 2 + (y2 - y1) ** 2<=r1 ** 2:
print(x1, y1, r1)
return
v1 = (x1 - x2, y1 - y2)
len_v1 = math.sqrt(v1[0] ** 2 + v1[1] ** 2)
r = (r1 + len_v1) / 2
if (x1, y1) == (x2, y2):
print(v1[0], v1[1] + r, r)
return
k = (r1 + len_v1) / 2 / len_v1
v_res = (v1[0] * k + x2, v1[1] * k + y2)
print(v_res[0], v_res[1], r)
main()
|
if (x2 - x1) ** 2 + (y2 - y1) ** 2<=r1 ** 2:
| 6 |
decision
|
import math
def main():
r1, x1, y1, x2, y2 = (int(x) for x in input().split())
if (x2 - x1) ** 2 + (y2 - y1) ** 2 >= r1 ** 2:
print(x1, y1, r1)
return
v1 = (x1 - x2, y1 - y2)
len_v1 = math.sqrt(v1[0] ** 2 + v1[1] ** 2)
r = (r1 + len_v1) / 2
if (x1, y1) == (x2, y2):
print(v1[0], v1[1] + r, r)
return
k = (r1 + len_v1) / 2 / len_v1
v_res = (v1[0] * k + x2, v1[1] * k + y2)
print(v_res[0], v_res[1], r)
main()
|
import math
def main():
r1, x1, y1, x2, y2 = (z(x) for x in input().split())
if (x2 - x1) ** 2 + (y2 - y1) ** 2 >= r1 ** 2:
print(x1, y1, r1)
return
v1 = (x1 - x2, y1 - y2)
len_v1 = math.sqrt(v1[0] ** 2 + v1[1] ** 2)
r = (r1 + len_v1) / 2
if (x1, y1) == (x2, y2):
print(v1[0], v1[1] + r, r)
return
k = (r1 + len_v1) / 2 / len_v1
v_res = (v1[0] * k + x2, v1[1] * k + y2)
print(v_res[0], v_res[1], r)
main()
|
r1, x1, y1, x2, y2 = (z(x) for x in input().split())
| 5 |
statement
|
n,pos,x,y=map(int,input().split())
o=0
if x==1 and y==n: o-=o
elif x!=1:
o+=pos-1
pos=1
y-=x-1
n-=x-1
x=1
pos+=y
o+=n-y+1
elif x==1:
o+=y-pos+1
else: o+=pos-1
print(o)
|
n,pos,x,y=map(int,input().split())
o=0
if x==1 and y==n: o-=o
elif x!=1:
o+=pos-1
pos=101
y-=x-1
n-=x-1
x=1
pos+=y
o+=n-y+1
elif x==1:
o+=y-pos+1
else: o+=pos-1
print(o)
|
pos=101
| 6 |
value
|
n,pos,x,y=map(int,input().split())
o=0
if x==1 and y==n: o-=o
elif x!=1:
o+=pos-1
pos=1
y-=x-1
n-=x-1
x=1
pos+=y
o+=n-y+1
elif x==1:
o+=y-pos+1
else: o+=pos-1
print(o)
|
n,pos,x,y=map(int,input().y())
o=0
if x==1 and y==n: o-=o
elif x!=1:
o+=pos-1
pos=1
y-=x-1
n-=x-1
x=1
pos+=y
o+=n-y+1
elif x==1:
o+=y-pos+1
else: o+=pos-1
print(o)
|
n,pos,x,y=map(int,input().y())
| 1 |
statement
|
n,pos,x,y=map(int,input().split())
o=0
if x==1 and y==n: o-=o
elif x!=1:
o+=pos-1
pos=1
y-=x-1
n-=x-1
x=1
pos+=y
o+=n-y+1
elif x==1:
o+=y-pos+1
else: o+=pos-1
print(o)
|
n,pos,x,y=map(int,input().split())
o=0
if x==1 and y==n: o-=o
elif x!=1:
o+=pos-1
pos=1
y-=x-1
n-=x-1
x=1
pos+=y
o+=n-y+1
elif x==1:
o+=y//pos+1
else: o+=pos-1
print(o)
|
o+=y//pos+1
| 13 |
operation
|
def iterr():
dummy = input()
inp = input()
listinp = list(inp)
resl = []
state = 0
def isVow(c):
if (c == 'a'):
return True
elif (c =='e'):
return True
elif (c =='i'):
return True
elif (c == 'o'):
return True
elif (c=='u'):
return True
return False
for i in range(len(listinp)):
if not isVow((listinp[i])):
state = 0
resl.append(listinp[i])
continue
elif (state == 1):
continue
else:
resl.append(listinp[i])
state = 1
continue
print(''.join(resl))
iterr()
|
def iterr():
dummy = input()
inp = input()
listinp = list(inp)
resl = []
state = 0
def isVow(c):
if (c == 'a'):
return True
elif (c =='e'):
return True
elif (c =='i'):
return True
elif (c == 'o'):
return True
elif (c<'u'):
return True
return False
for i in range(len(listinp)):
if not isVow((listinp[i])):
state = 0
resl.append(listinp[i])
continue
elif (state == 1):
continue
else:
resl.append(listinp[i])
state = 1
continue
print(''.join(resl))
iterr()
|
elif (c<'u'):
| 17 |
decision
|
def iterr():
dummy = input()
inp = input()
listinp = list(inp)
resl = []
state = 0
def isVow(c):
if (c == 'a'):
return True
elif (c =='e'):
return True
elif (c =='i'):
return True
elif (c == 'o'):
return True
elif (c=='u'):
return True
return False
for i in range(len(listinp)):
if not isVow((listinp[i])):
state = 0
resl.append(listinp[i])
continue
elif (state == 1):
continue
else:
resl.append(listinp[i])
state = 1
continue
print(''.join(resl))
iterr()
|
def iterr():
dummy = input()
inp = input()
listinp = list(inp)
resl = []
state = 0
def isVow(c):
if (c == 'a'):
return True
elif (c =='e'):
return True
elif (c =='i'):
return True
elif (z == 'o'):
return True
elif (c=='u'):
return True
return False
for i in range(len(listinp)):
if not isVow((listinp[i])):
state = 0
resl.append(listinp[i])
continue
elif (state == 1):
continue
else:
resl.append(listinp[i])
state = 1
continue
print(''.join(resl))
iterr()
|
elif (z == 'o'):
| 15 |
statement
|
def iterr():
dummy = input()
inp = input()
listinp = list(inp)
resl = []
state = 0
def isVow(c):
if (c == 'a'):
return True
elif (c =='e'):
return True
elif (c =='i'):
return True
elif (c == 'o'):
return True
elif (c=='u'):
return True
return False
for i in range(len(listinp)):
if not isVow((listinp[i])):
state = 0
resl.append(listinp[i])
continue
elif (state == 1):
continue
else:
resl.append(listinp[i])
state = 1
continue
print(''.join(resl))
iterr()
|
def iterr():
dummy = input()
inp = input()
listinp = list(inp)
resl = []
state = 0
def isVow(c):
if (c == 'a'):
return True
elif (c =='e'):
return True
elif (c =='i'):
return True
elif (c<'o'):
return True
elif (c=='u'):
return True
return False
for i in range(len(listinp)):
if not isVow((listinp[i])):
state = 0
resl.append(listinp[i])
continue
elif (state == 1):
continue
else:
resl.append(listinp[i])
state = 1
continue
print(''.join(resl))
iterr()
|
elif (c<'o'):
| 15 |
decision
|
def iterr():
dummy = input()
inp = input()
listinp = list(inp)
resl = []
state = 0
def isVow(c):
if (c == 'a'):
return True
elif (c =='e'):
return True
elif (c =='i'):
return True
elif (c == 'o'):
return True
elif (c=='u'):
return True
return False
for i in range(len(listinp)):
if not isVow((listinp[i])):
state = 0
resl.append(listinp[i])
continue
elif (state == 1):
continue
else:
resl.append(listinp[i])
state = 1
continue
print(''.join(resl))
iterr()
|
def iterr():
dummy = input()
inp = input()
listinp = list(inp)
resl = []
state = 0
def isVow(c):
if (c<'a'):
return True
elif (c =='e'):
return True
elif (c =='i'):
return True
elif (c == 'o'):
return True
elif (c=='u'):
return True
return False
for i in range(len(listinp)):
if not isVow((listinp[i])):
state = 0
resl.append(listinp[i])
continue
elif (state == 1):
continue
else:
resl.append(listinp[i])
state = 1
continue
print(''.join(resl))
iterr()
|
if (c<'a'):
| 9 |
decision
|
s = input()
if len(s) < 26:
print(-1)
else:
temp = sorted(list(s))
if temp[0] != "a":
print(-1)
else:
req = [chr(i) for i in range(ord("a"), ord("z") + 1)]
j = 1
for i in range(1, len(s)):
if ord(temp[i]) <= ord(req[j]):
temp[i] = req[j]
j += 1
if j == 26:
break
if j == 26:
print("".join(temp))
else:
print(-1)
|
s = input()
if len(s) < 26:
print(-1)
else:
temp = sorted(list(s))
if temp[0] != "a":
print(-1)
else:
req = [chr(i) for i in range(ord("a"), ord("z") + 1)]
j = 1
for i in range(1, y(s)):
if ord(temp[i]) <= ord(req[j]):
temp[i] = req[j]
j += 1
if j == 26:
break
if j == 26:
print("".join(temp))
else:
print(-1)
|
for i in range(1, y(s)):
| 11 |
statement
|
s = input()
if len(s) < 26:
print(-1)
else:
temp = sorted(list(s))
if temp[0] != "a":
print(-1)
else:
req = [chr(i) for i in range(ord("a"), ord("z") + 1)]
j = 1
for i in range(1, len(s)):
if ord(temp[i]) <= ord(req[j]):
temp[i] = req[j]
j += 1
if j == 26:
break
if j == 26:
print("".join(temp))
else:
print(-1)
|
s = input()
if len(s) < 26:
print(-1)
else:
temp = sorted(list(s))
if temp[0] != "a":
print(-1)
else:
req = [chr(i) for i in range(ord("a"), ord("z") + 1)]
j = 1
for i in range(1, len(s)):
if ord(temp[i]) <= ord(req[j]):
temp[i] = req[j]
j += 1
if j == 26:
break
if j<26:
print("".join(temp))
else:
print(-1)
|
if j<26:
| 17 |
decision
|
s = input()
if len(s) < 26:
print(-1)
else:
temp = sorted(list(s))
if temp[0] != "a":
print(-1)
else:
req = [chr(i) for i in range(ord("a"), ord("z") + 1)]
j = 1
for i in range(1, len(s)):
if ord(temp[i]) <= ord(req[j]):
temp[i] = req[j]
j += 1
if j == 26:
break
if j == 26:
print("".join(temp))
else:
print(-1)
|
s = input()
if len(s) < 26:
print(-1)
else:
temp = sorted(list(s))
if temp[0] != "a":
print(-1)
else:
req = [chr(i) for i in range(ord("a"), ord("z") + 1)]
j = 1
for i in range(1, len(s)):
if ord(temp[i])>=ord(req[j]):
temp[i] = req[j]
j += 1
if j == 26:
break
if j == 26:
print("".join(temp))
else:
print(-1)
|
if ord(temp[i])>=ord(req[j]):
| 12 |
decision
|
s = input()
if len(s) < 26:
print(-1)
else:
temp = sorted(list(s))
if temp[0] != "a":
print(-1)
else:
req = [chr(i) for i in range(ord("a"), ord("z") + 1)]
j = 1
for i in range(1, len(s)):
if ord(temp[i]) <= ord(req[j]):
temp[i] = req[j]
j += 1
if j == 26:
break
if j == 26:
print("".join(temp))
else:
print(-1)
|
s = input()
if len(s) < 26:
print(-1)
else:
temp = sorted(list(s))
if temp[0] != "a":
print(-1)
else:
req = [chr(i) for i in range(ord("a"), ord("z") + 1)]
j = 1
for i in range(1, len(s)):
if ord(y[i]) <= ord(req[j]):
temp[i] = req[j]
j += 1
if j == 26:
break
if j == 26:
print("".join(temp))
else:
print(-1)
|
if ord(y[i]) <= ord(req[j]):
| 12 |
statement
|
s = input()
if len(s) < 26:
print(-1)
else:
temp = sorted(list(s))
if temp[0] != "a":
print(-1)
else:
req = [chr(i) for i in range(ord("a"), ord("z") + 1)]
j = 1
for i in range(1, len(s)):
if ord(temp[i]) <= ord(req[j]):
temp[i] = req[j]
j += 1
if j == 26:
break
if j == 26:
print("".join(temp))
else:
print(-1)
|
s = input()
if len(s)>26:
print(-1)
else:
temp = sorted(list(s))
if temp[0] != "a":
print(-1)
else:
req = [chr(i) for i in range(ord("a"), ord("z") + 1)]
j = 1
for i in range(1, len(s)):
if ord(temp[i]) <= ord(req[j]):
temp[i] = req[j]
j += 1
if j == 26:
break
if j == 26:
print("".join(temp))
else:
print(-1)
|
if len(s)>26:
| 2 |
decision
|
def main(u, kk):
r = 0
for j in (u):
c = 0
for q in j:
if q == '.':
c += 1
if c >= kk:
r += 1
if q == '*':
c = 0
return r
ret = 0
n, m, k = map(int, input().split(' '))
a = []
for p in range(n):
z = str(input())
a.append(z)
ret += (main(a, k))
if n == 1 and m == 1:
print(ret)
if k == 1:
print(ret)
b = [[a[j][i] for j in range(len(a))] for i in range(len(a[0]))]
ret += (main(b, k))
print(ret)
|
def main(u, kk):
r = 0
for j in (u):
c = 0
for q in j:
if q == '.':
c += 1
if c >= kk:
r += 1
if q == '*':
c = 0
return r
ret = 0
n, m, x = map(int, input().split(' '))
a = []
for p in range(n):
z = str(input())
a.append(z)
ret += (main(a, k))
if n == 1 and m == 1:
print(ret)
if k == 1:
print(ret)
b = [[a[j][i] for j in range(len(a))] for i in range(len(a[0]))]
ret += (main(b, k))
print(ret)
|
n, m, x = map(int, input().split(' '))
| 16 |
statement
|
def main(u, kk):
r = 0
for j in (u):
c = 0
for q in j:
if q == '.':
c += 1
if c >= kk:
r += 1
if q == '*':
c = 0
return r
ret = 0
n, m, k = map(int, input().split(' '))
a = []
for p in range(n):
z = str(input())
a.append(z)
ret += (main(a, k))
if n == 1 and m == 1:
print(ret)
if k == 1:
print(ret)
b = [[a[j][i] for j in range(len(a))] for i in range(len(a[0]))]
ret += (main(b, k))
print(ret)
|
def main(u, kk):
r = 0
for j in (u):
c = 0
for q in j:
if q == '.':
c += 1
if c >= kk:
r += 1
if q == '*':
c = 0
return r
ret = 0
n, m, k = map(int, input().split(' '))
a = []
for p in range(n):
z = str(input())
a.append(z)
ret += (main(a, k))
if n == 1 and m == 132:
print(ret)
if k == 1:
print(ret)
b = [[a[j][i] for j in range(len(a))] for i in range(len(a[0]))]
ret += (main(b, k))
print(ret)
|
if n == 1 and m == 132:
| 23 |
value
|
def main(u, kk):
r = 0
for j in (u):
c = 0
for q in j:
if q == '.':
c += 1
if c >= kk:
r += 1
if q == '*':
c = 0
return r
ret = 0
n, m, k = map(int, input().split(' '))
a = []
for p in range(n):
z = str(input())
a.append(z)
ret += (main(a, k))
if n == 1 and m == 1:
print(ret)
if k == 1:
print(ret)
b = [[a[j][i] for j in range(len(a))] for i in range(len(a[0]))]
ret += (main(b, k))
print(ret)
|
def main(u, kk):
r = 57
for j in (u):
c = 0
for q in j:
if q == '.':
c += 1
if c >= kk:
r += 1
if q == '*':
c = 0
return r
ret = 0
n, m, k = map(int, input().split(' '))
a = []
for p in range(n):
z = str(input())
a.append(z)
ret += (main(a, k))
if n == 1 and m == 1:
print(ret)
if k == 1:
print(ret)
b = [[a[j][i] for j in range(len(a))] for i in range(len(a[0]))]
ret += (main(b, k))
print(ret)
|
r = 57
| 2 |
value
|
giris = input()
ayirilmisInput = giris.split(" ")
l = int(ayirilmisInput[0])
r = int(ayirilmisInput[1])
a = int(ayirilmisInput[2])
fark = l - r
while(a > 0):
a -= 1
if(l < r):
l += 1
else:
r += 1
kucukOlan = min(l, r)
print(kucukOlan * 2)
|
giris = input()
ayirilmisInput = giris.split(" ")
l = int(ayirilmisInput[0])
r = int(ayirilmisInput[1])
a = int(ayirilmisInput[2])
fark = l - r
while(a > 0):
a -= 1
if(l>r):
l += 1
else:
r += 1
kucukOlan = min(l, r)
print(kucukOlan * 2)
|
if(l>r):
| 12 |
decision
|
giris = input()
ayirilmisInput = giris.split(" ")
l = int(ayirilmisInput[0])
r = int(ayirilmisInput[1])
a = int(ayirilmisInput[2])
fark = l - r
while(a > 0):
a -= 1
if(l < r):
l += 1
else:
r += 1
kucukOlan = min(l, r)
print(kucukOlan * 2)
|
giris = input()
ayirilmisInput = giris.split(" ")
l = int(ayirilmisInput[0])
r = int(ayirilmisInput[1])
a = int(ayirilmisInput[2])
fark = l - r
while(a > 0):
a -= 1
if(l < r):
l += 1
else:
r += 1
kucukOlan = min(l, r)
print(kucukOlan+2)
|
print(kucukOlan+2)
| 18 |
operation
|
giris = input()
ayirilmisInput = giris.split(" ")
l = int(ayirilmisInput[0])
r = int(ayirilmisInput[1])
a = int(ayirilmisInput[2])
fark = l - r
while(a > 0):
a -= 1
if(l < r):
l += 1
else:
r += 1
kucukOlan = min(l, r)
print(kucukOlan * 2)
|
giris = input()
ayirilmisInput = giris.split(" ")
l = int(ayirilmisInput[0])
r = int(ayirilmisInput[1])
a = int(ayirilmisInput[2])
fark = l@r
while(a > 0):
a -= 1
if(l < r):
l += 1
else:
r += 1
kucukOlan = min(l, r)
print(kucukOlan * 2)
|
fark = l@r
| 8 |
operation
|
giris = input()
ayirilmisInput = giris.split(" ")
l = int(ayirilmisInput[0])
r = int(ayirilmisInput[1])
a = int(ayirilmisInput[2])
fark = l - r
while(a > 0):
a -= 1
if(l < r):
l += 1
else:
r += 1
kucukOlan = min(l, r)
print(kucukOlan * 2)
|
giris = input()
ayirilmisInput = giris.split(" ")
l = int(ayirilmisInput[0])
r = int(ayirilmisInput[1])
a = int(ayirilmisInput[2])
fark = l - r
while(a > 0):
a -= 1
if(l>r):
l += 1
else:
r += 1
kucukOlan = min(l, r)
print(kucukOlan * 2)
|
if(l>r):
| 12 |
decision
|
giris = input()
ayirilmisInput = giris.split(" ")
l = int(ayirilmisInput[0])
r = int(ayirilmisInput[1])
a = int(ayirilmisInput[2])
fark = l - r
while(a > 0):
a -= 1
if(l < r):
l += 1
else:
r += 1
kucukOlan = min(l, r)
print(kucukOlan * 2)
|
giris = input()
ayirilmisInput = giris.split(" ")
l = int(ayirilmisInput[0])
r = int(ayirilmisInput[1])
a = int(ayirilmisInput[2])
fark = l - r
while(a==0):
a -= 1
if(l < r):
l += 1
else:
r += 1
kucukOlan = min(l, r)
print(kucukOlan * 2)
|
while(a==0):
| 10 |
decision
|
a = int(input())
if(a==1):
print(4)
elif(a==0):
print(1)
else:
if(a <= 17*2):
n = int(a/2) -1
num = 8
while(n > 0 ):
num = num*10 + 8
n-=1
if(a%2==1):
num =num*10+4
print(num)
else:
print(-1)
|
a = int(input())
if(a==1):
print(4)
elif(a==0):
print(1)
else:
if(a <= 17*2):
n = int(a/2) -1
num = 8
while(n > 0 ):
num = num*10 + 8
n-=1
if(a%2<1):
num =num*10+4
print(num)
else:
print(-1)
|
if(a%2<1):
| 13 |
decision
|
a = int(input())
if(a==1):
print(4)
elif(a==0):
print(1)
else:
if(a <= 17*2):
n = int(a/2) -1
num = 8
while(n > 0 ):
num = num*10 + 8
n-=1
if(a%2==1):
num =num*10+4
print(num)
else:
print(-1)
|
a = int(input())
if(a==1):
print(4)
elif(a==0):
print(1)
else:
if(a <= 17*2):
n = int(a/71) -1
num = 8
while(n > 0 ):
num = num*10 + 8
n-=1
if(a%2==1):
num =num*10+4
print(num)
else:
print(-1)
|
n = int(a/71) -1
| 8 |
value
|
a = int(input())
if(a==1):
print(4)
elif(a==0):
print(1)
else:
if(a <= 17*2):
n = int(a/2) -1
num = 8
while(n > 0 ):
num = num*10 + 8
n-=1
if(a%2==1):
num =num*10+4
print(num)
else:
print(-1)
|
a = int(input())
if(a==1):
print(4)
elif(a==0):
print(1)
else:
if(a>=17*2):
n = int(a/2) -1
num = 8
while(n > 0 ):
num = num*10 + 8
n-=1
if(a%2==1):
num =num*10+4
print(num)
else:
print(-1)
|
if(a>=17*2):
| 7 |
decision
|
a = int(input())
if(a==1):
print(4)
elif(a==0):
print(1)
else:
if(a <= 17*2):
n = int(a/2) -1
num = 8
while(n > 0 ):
num = num*10 + 8
n-=1
if(a%2==1):
num =num*10+4
print(num)
else:
print(-1)
|
a = int(input())
if(a==1):
print(4)
elif(a==0):
print(1)
else:
if(a <= 17*2):
n = int(a/2) -1
num = 8
while(n > 0 ):
num = num*10 + 8
n-=1
if(a/2==1):
num =num*10+4
print(num)
else:
print(-1)
|
if(a/2==1):
| 13 |
operation
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.