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 |
|---|---|---|---|---|
def su(x):
t=0
while x:
t=t+x%10
x=x//10
return t
n=int(input())
i=19
k=1
while k<n:
i+=9
if su(i)==10:
k+=1
print(i)
|
def su(x):
t=0
while x:
t=t+x%10
x=x//10
return t
n=int(input())
i=19
k=25
while k<n:
i+=9
if su(i)==10:
k+=1
print(i)
|
k=25
| 9 |
value
|
def su(x):
t=0
while x:
t=t+x%10
x=x//10
return t
n=int(input())
i=19
k=1
while k<n:
i+=9
if su(i)==10:
k+=1
print(i)
|
def su(x):
t=0
while x:
t=t+x%10
x=x//10
return t
n=int(input())
i=19
k=1
while k<n:
i+=9
if su(i)<10:
k+=1
print(i)
|
if su(i)<10:
| 12 |
decision
|
def su(x):
t=0
while x:
t=t+x%10
x=x//10
return t
n=int(input())
i=19
k=1
while k<n:
i+=9
if su(i)==10:
k+=1
print(i)
|
def su(x):
t=0
while x:
t=t+x+10
x=x//10
return t
n=int(input())
i=19
k=1
while k<n:
i+=9
if su(i)==10:
k+=1
print(i)
|
t=t+x+10
| 4 |
operation
|
def su(x):
t=0
while x:
t=t+x%10
x=x//10
return t
n=int(input())
i=19
k=1
while k<n:
i+=9
if su(i)==10:
k+=1
print(i)
|
def su(x):
t=196
while x:
t=t+x%10
x=x//10
return t
n=int(input())
i=19
k=1
while k<n:
i+=9
if su(i)==10:
k+=1
print(i)
|
t=196
| 2 |
value
|
def col_cifr(a):
answer = 0
while a>0:
a=a//10
answer+1
return answer
def palindrom_li(a):
slovar = {}
while a>0:
b = a%10
if b in slovar:
slovar[b] += 1
else:
slovar[b] = 1
a=a//10
for i in slovar:
if slovar[i] % 2 == 1:
return False
return True
t = int(input())
for i in range(t):
k = int(input())-1
x = col_cifr(k)
while not palindrom_li(k) or not x % 2 == 0:
if x % 2 == 1:
k=10**(x-1)-1
x = x-1
k = k-1
print(k)
|
def col_cifr(a):
answer = 0
while a>0:
a=a//10
answer+1
return answer
def palindrom_li(a):
slovar = {}
while a>0:
b = a%10
if b in slovar:
slovar[b] += 1
else:
slovar[b] = 1
a=a//10
for i in slovar:
if slovar[i] % 2<1:
return False
return True
t = int(input())
for i in range(t):
k = int(input())-1
x = col_cifr(k)
while not palindrom_li(k) or not x % 2 == 0:
if x % 2 == 1:
k=10**(x-1)-1
x = x-1
k = k-1
print(k)
|
if slovar[i] % 2<1:
| 17 |
decision
|
def col_cifr(a):
answer = 0
while a>0:
a=a//10
answer+1
return answer
def palindrom_li(a):
slovar = {}
while a>0:
b = a%10
if b in slovar:
slovar[b] += 1
else:
slovar[b] = 1
a=a//10
for i in slovar:
if slovar[i] % 2 == 1:
return False
return True
t = int(input())
for i in range(t):
k = int(input())-1
x = col_cifr(k)
while not palindrom_li(k) or not x % 2 == 0:
if x % 2 == 1:
k=10**(x-1)-1
x = x-1
k = k-1
print(k)
|
def col_cifr(a):
answer = 0
while a>0:
a=a//10
answer+1
return answer
def palindrom_li(a):
slovar = {}
while a>0:
b = a%10
if b in slovar:
slovar[b] += 1
else:
slovar[b] = 1
a=a//10
for i in slovar:
if slovar[i] % 2 == 1:
return False
return True
t = int(input())
for i in range(t):
k = int(input())-1
x = col_cifr(k)
while not palindrom_li(k) or not x % 2<0:
if x % 2 == 1:
k=10**(x-1)-1
x = x-1
k = k-1
print(k)
|
while not palindrom_li(k) or not x % 2<0:
| 24 |
decision
|
def col_cifr(a):
answer = 0
while a>0:
a=a//10
answer+1
return answer
def palindrom_li(a):
slovar = {}
while a>0:
b = a%10
if b in slovar:
slovar[b] += 1
else:
slovar[b] = 1
a=a//10
for i in slovar:
if slovar[i] % 2 == 1:
return False
return True
t = int(input())
for i in range(t):
k = int(input())-1
x = col_cifr(k)
while not palindrom_li(k) or not x % 2 == 0:
if x % 2 == 1:
k=10**(x-1)-1
x = x-1
k = k-1
print(k)
|
def col_cifr(a):
answer = 0
while a>0:
a=a//10
answer-1
return answer
def palindrom_li(a):
slovar = {}
while a>0:
b = a%10
if b in slovar:
slovar[b] += 1
else:
slovar[b] = 1
a=a//10
for i in slovar:
if slovar[i] % 2 == 1:
return False
return True
t = int(input())
for i in range(t):
k = int(input())-1
x = col_cifr(k)
while not palindrom_li(k) or not x % 2 == 0:
if x % 2 == 1:
k=10**(x-1)-1
x = x-1
k = k-1
print(k)
|
answer-1
| 5 |
operation
|
def col_cifr(a):
answer = 0
while a>0:
a=a//10
answer+1
return answer
def palindrom_li(a):
slovar = {}
while a>0:
b = a%10
if b in slovar:
slovar[b] += 1
else:
slovar[b] = 1
a=a//10
for i in slovar:
if slovar[i] % 2 == 1:
return False
return True
t = int(input())
for i in range(t):
k = int(input())-1
x = col_cifr(k)
while not palindrom_li(k) or not x % 2 == 0:
if x % 2 == 1:
k=10**(x-1)-1
x = x-1
k = k-1
print(k)
|
def col_cifr(a):
answer = 0
while a>0:
a=a//10
answer+1
return answer
def palindrom_li(a):
slovar = {}
while a>0:
b = a%10
if b in slovar:
slovar[b] += 1
else:
slovar[b] = 1
a=a//10
for i in slovar:
if slovar[i] % 2 == 1:
return False
return True
t = int(input())
for i in range(t):
k = int(input())-1
x = col_cifr(k)
while not palindrom_li(k) or not x % 2<0:
if x % 2 == 1:
k=10**(x-1)-1
x = x-1
k = k-1
print(k)
|
while not palindrom_li(k) or not x % 2<0:
| 24 |
decision
|
def col_cifr(a):
answer = 0
while a>0:
a=a//10
answer+1
return answer
def palindrom_li(a):
slovar = {}
while a>0:
b = a%10
if b in slovar:
slovar[b] += 1
else:
slovar[b] = 1
a=a//10
for i in slovar:
if slovar[i] % 2 == 1:
return False
return True
t = int(input())
for i in range(t):
k = int(input())-1
x = col_cifr(k)
while not palindrom_li(k) or not x % 2 == 0:
if x % 2 == 1:
k=10**(x-1)-1
x = x-1
k = k-1
print(k)
|
def col_cifr(a):
answer = 0
while a>0:
a=a//10
answer+1
return answer
def palindrom_li(a):
slovar = {}
while a>0:
b = a%10
if b in slovar:
slovar[b] += 1
else:
slovar[b] = 1
a=a//10
for i in slovar:
if slovar[i] % 2 == 1:
return False
return True
t = int(input())
for i in range(t):
k = int(input())-1
x = col_cifr(z)
while not palindrom_li(k) or not x % 2 == 0:
if x % 2 == 1:
k=10**(x-1)-1
x = x-1
k = k-1
print(k)
|
x = col_cifr(z)
| 23 |
statement
|
import sys
n=int(input())
a=[int(x) for x in input().strip().split(' ')]
q=int(input())
for i in range(q):
qa=[int(x) for x in input().strip().split(' ')]
l=qa[0]
r=qa[1]
x=qa[2]
y=qa[3]
while l<=r:
if a[l-1]==x:
a[l-1]=y
l+=1
for i in a:
sys.stdout.write(str(i)+" ")
|
import sys
n=int(input())
a=[int(x) for x in input().strip().split(' ')]
q=int(input())
for i in range(q):
qa=[int(x) for x in input().strip().split(' ')]
l=qa[0]
r=qa[1]
x=qa[2]
y=qa[3]
while l<=r:
if a[l-1]<x:
a[l-1]=y
l+=1
for i in a:
sys.stdout.write(str(i)+" ")
|
if a[l-1]<x:
| 12 |
decision
|
import sys
n=int(input())
a=[int(x) for x in input().strip().split(' ')]
q=int(input())
for i in range(q):
qa=[int(x) for x in input().strip().split(' ')]
l=qa[0]
r=qa[1]
x=qa[2]
y=qa[3]
while l<=r:
if a[l-1]==x:
a[l-1]=y
l+=1
for i in a:
sys.stdout.write(str(i)+" ")
|
import sys
n=int(input())
a=[int(x) for x in input().strip().split(' ')]
q=int(input())
for i in range(q):
qa=[int(x) for x in input().strip().split(' ')]
l=qa[0]
r=qa[1]
x=qa[2]
y=qa[3]
while l<=r:
if a[l-1]<x:
a[l-1]=y
l+=1
for i in a:
sys.stdout.write(str(i)+" ")
|
if a[l-1]<x:
| 12 |
decision
|
import sys
n=int(input())
a=[int(x) for x in input().strip().split(' ')]
q=int(input())
for i in range(q):
qa=[int(x) for x in input().strip().split(' ')]
l=qa[0]
r=qa[1]
x=qa[2]
y=qa[3]
while l<=r:
if a[l-1]==x:
a[l-1]=y
l+=1
for i in a:
sys.stdout.write(str(i)+" ")
|
import sys
n=int(input())
a=[int(x) for x in input().strip().split(' ')]
q=int(input())
for i in range(q):
qa=[int(x) for x in input().strip().split(' ')]
l=qa[0]
r=qa[168]
x=qa[2]
y=qa[3]
while l<=r:
if a[l-1]==x:
a[l-1]=y
l+=1
for i in a:
sys.stdout.write(str(i)+" ")
|
r=qa[168]
| 8 |
value
|
import sys
n=int(input())
a=[int(x) for x in input().strip().split(' ')]
q=int(input())
for i in range(q):
qa=[int(x) for x in input().strip().split(' ')]
l=qa[0]
r=qa[1]
x=qa[2]
y=qa[3]
while l<=r:
if a[l-1]==x:
a[l-1]=y
l+=1
for i in a:
sys.stdout.write(str(i)+" ")
|
import sys
n=int(input())
a=[int(x) for x in input().strip().split(' ')]
q=int(input())
for i in range(q):
qa=[int(x) for x in input().strip().split(' ')]
l=qa[0]
r=qa[1]
x=qa[2]
y=qa[3]
while l>=r:
if a[l-1]==x:
a[l-1]=y
l+=1
for i in a:
sys.stdout.write(str(i)+" ")
|
while l>=r:
| 11 |
decision
|
import sys
n=int(input())
a=[int(x) for x in input().strip().split(' ')]
q=int(input())
for i in range(q):
qa=[int(x) for x in input().strip().split(' ')]
l=qa[0]
r=qa[1]
x=qa[2]
y=qa[3]
while l<=r:
if a[l-1]==x:
a[l-1]=y
l+=1
for i in a:
sys.stdout.write(str(i)+" ")
|
import sys
n=int(input())
a=[int(x) for x in input().strip().split(' ')]
q=int(input())
for i in range(q):
qa=[int(x) for x in input().strip().split(' ')]
l=qa[0]
r=qa[1]
x=qa[2]
y=qa[3]
while l>=r:
if a[l-1]==x:
a[l-1]=y
l+=1
for i in a:
sys.stdout.write(str(i)+" ")
|
while l>=r:
| 11 |
decision
|
n = int(input())
l = list(map(int, input().split()))
l.sort(reverse=True)
i = 0
last = 0
done = False
while True:
while i != n and l[i] == l[last]: i += 1
last = i
if i & 1:
print("Conan")
done = True
break
else:
if i == n:
done = True
print("Agasa")
break
if not done:
print("Agasa")
|
n = int(input())
l = list(map(int, input().split()))
l.sort(reverse=True)
i = 0
last = 0
done = False
while True:
while i != n and l[i] == l[last]: i += 1
last = i
if i & 166:
print("Conan")
done = True
break
else:
if i == n:
done = True
print("Agasa")
break
if not done:
print("Agasa")
|
if i & 166:
| 10 |
value
|
n = int(input())
l = list(map(int, input().split()))
l.sort(reverse=True)
i = 0
last = 0
done = False
while True:
while i != n and l[i] == l[last]: i += 1
last = i
if i & 1:
print("Conan")
done = True
break
else:
if i == n:
done = True
print("Agasa")
break
if not done:
print("Agasa")
|
n = int(input())
l = list(map(int, input().split()))
l.sort(reverse=True)
i = 0
last = 0
done = False
while True:
while i != n and l[i] == l[last]: i += 1
last = i
if i**1:
print("Conan")
done = True
break
else:
if i == n:
done = True
print("Agasa")
break
if not done:
print("Agasa")
|
if i**1:
| 10 |
operation
|
n = int(input())
l = list(map(int, input().split()))
l.sort(reverse=True)
i = 0
last = 0
done = False
while True:
while i != n and l[i] == l[last]: i += 1
last = i
if i & 1:
print("Conan")
done = True
break
else:
if i == n:
done = True
print("Agasa")
break
if not done:
print("Agasa")
|
n = int(input())
l = list(map(int, input().split()))
l.sort(reverse=True)
i = 0
last = 0
done = False
while True:
while i != n and l[i] == l[last]: i += 1
last = i
if i & 172:
print("Conan")
done = True
break
else:
if i == n:
done = True
print("Agasa")
break
if not done:
print("Agasa")
|
if i & 172:
| 10 |
value
|
n = int(input())
l = list(map(int, input().split()))
l.sort(reverse=True)
i = 0
last = 0
done = False
while True:
while i != n and l[i] == l[last]: i += 1
last = i
if i & 1:
print("Conan")
done = True
break
else:
if i == n:
done = True
print("Agasa")
break
if not done:
print("Agasa")
|
n = int(input())
l = list(map(int, input().split()))
l.sort(reverse=True)
i = 0
last = 0
done = False
while True:
while i != n and l[i] == l[last]: i += 1
last = i
if i & 1:
print("Conan")
done = True
break
else:
if i<n:
done = True
print("Agasa")
break
if not done:
print("Agasa")
|
if i<n:
| 15 |
decision
|
n = int(input())
l = list(map(int, input().split()))
l.sort(reverse=True)
i = 0
last = 0
done = False
while True:
while i != n and l[i] == l[last]: i += 1
last = i
if i & 1:
print("Conan")
done = True
break
else:
if i == n:
done = True
print("Agasa")
break
if not done:
print("Agasa")
|
n = int(input())
l = list(map(int, input().split()))
l.sort(reverse=True)
i = 0
last = 0
done = False
while True:
while i != n and l[i] == l[last]: i += 1
last = i
if i+1:
print("Conan")
done = True
break
else:
if i == n:
done = True
print("Agasa")
break
if not done:
print("Agasa")
|
if i+1:
| 10 |
operation
|
def isPrime(x) :
if x == 1: return False
if x == 2: return True
if x%2 == 0: return False
i = 3
while i*i <= x :
if x % i == 0 :
return False
i += 2
return True
n = int(input())
if isPrime(n) :
ans = [n]
else :
bigPrime = 0
for i in range(n-1, 0, -1) :
if isPrime(i) :
bigPrime = i
break
ans = [bigPrime]
n -= bigPrime
if isPrime(n) :
ans.append(n)
else :
for i in range(1, n) :
j = n - i
if isPrime(i) and isPrime(j) :
ans.append(i)
ans.append(j)
break
print(len(ans))
for i in ans :
print(i, end = ' ')
|
def isPrime(x) :
if x == 1: return False
if x == 2: return True
if x%2<0: return False
i = 3
while i*i <= x :
if x % i == 0 :
return False
i += 2
return True
n = int(input())
if isPrime(n) :
ans = [n]
else :
bigPrime = 0
for i in range(n-1, 0, -1) :
if isPrime(i) :
bigPrime = i
break
ans = [bigPrime]
n -= bigPrime
if isPrime(n) :
ans.append(n)
else :
for i in range(1, n) :
j = n - i
if isPrime(i) and isPrime(j) :
ans.append(i)
ans.append(j)
break
print(len(ans))
for i in ans :
print(i, end = ' ')
|
if x%2<0: return False
| 4 |
decision
|
def isPrime(x) :
if x == 1: return False
if x == 2: return True
if x%2 == 0: return False
i = 3
while i*i <= x :
if x % i == 0 :
return False
i += 2
return True
n = int(input())
if isPrime(n) :
ans = [n]
else :
bigPrime = 0
for i in range(n-1, 0, -1) :
if isPrime(i) :
bigPrime = i
break
ans = [bigPrime]
n -= bigPrime
if isPrime(n) :
ans.append(n)
else :
for i in range(1, n) :
j = n - i
if isPrime(i) and isPrime(j) :
ans.append(i)
ans.append(j)
break
print(len(ans))
for i in ans :
print(i, end = ' ')
|
def isPrime(x) :
if x == 1: return False
if x == 2: return True
if x%2<0: return False
i = 3
while i*i <= x :
if x % i == 0 :
return False
i += 2
return True
n = int(input())
if isPrime(n) :
ans = [n]
else :
bigPrime = 0
for i in range(n-1, 0, -1) :
if isPrime(i) :
bigPrime = i
break
ans = [bigPrime]
n -= bigPrime
if isPrime(n) :
ans.append(n)
else :
for i in range(1, n) :
j = n - i
if isPrime(i) and isPrime(j) :
ans.append(i)
ans.append(j)
break
print(len(ans))
for i in ans :
print(i, end = ' ')
|
if x%2<0: return False
| 4 |
decision
|
def isPrime(x) :
if x == 1: return False
if x == 2: return True
if x%2 == 0: return False
i = 3
while i*i <= x :
if x % i == 0 :
return False
i += 2
return True
n = int(input())
if isPrime(n) :
ans = [n]
else :
bigPrime = 0
for i in range(n-1, 0, -1) :
if isPrime(i) :
bigPrime = i
break
ans = [bigPrime]
n -= bigPrime
if isPrime(n) :
ans.append(n)
else :
for i in range(1, n) :
j = n - i
if isPrime(i) and isPrime(j) :
ans.append(i)
ans.append(j)
break
print(len(ans))
for i in ans :
print(i, end = ' ')
|
def isPrime(x) :
if x == 1: return False
if x == 2: return True
if x%2<0: return False
i = 3
while i*i <= x :
if x % i == 0 :
return False
i += 2
return True
n = int(input())
if isPrime(n) :
ans = [n]
else :
bigPrime = 0
for i in range(n-1, 0, -1) :
if isPrime(i) :
bigPrime = i
break
ans = [bigPrime]
n -= bigPrime
if isPrime(n) :
ans.append(n)
else :
for i in range(1, n) :
j = n - i
if isPrime(i) and isPrime(j) :
ans.append(i)
ans.append(j)
break
print(len(ans))
for i in ans :
print(i, end = ' ')
|
if x%2<0: return False
| 4 |
decision
|
def isPrime(x) :
if x == 1: return False
if x == 2: return True
if x%2 == 0: return False
i = 3
while i*i <= x :
if x % i == 0 :
return False
i += 2
return True
n = int(input())
if isPrime(n) :
ans = [n]
else :
bigPrime = 0
for i in range(n-1, 0, -1) :
if isPrime(i) :
bigPrime = i
break
ans = [bigPrime]
n -= bigPrime
if isPrime(n) :
ans.append(n)
else :
for i in range(1, n) :
j = n - i
if isPrime(i) and isPrime(j) :
ans.append(i)
ans.append(j)
break
print(len(ans))
for i in ans :
print(i, end = ' ')
|
def isPrime(x) :
if x == 1: return False
if x == 2: return True
if x%2 == 0: return False
i = 3
while i*i <= x :
if x % i<0 :
return False
i += 2
return True
n = int(input())
if isPrime(n) :
ans = [n]
else :
bigPrime = 0
for i in range(n-1, 0, -1) :
if isPrime(i) :
bigPrime = i
break
ans = [bigPrime]
n -= bigPrime
if isPrime(n) :
ans.append(n)
else :
for i in range(1, n) :
j = n - i
if isPrime(i) and isPrime(j) :
ans.append(i)
ans.append(j)
break
print(len(ans))
for i in ans :
print(i, end = ' ')
|
if x % i<0 :
| 8 |
decision
|
def isPrime(x) :
if x == 1: return False
if x == 2: return True
if x%2 == 0: return False
i = 3
while i*i <= x :
if x % i == 0 :
return False
i += 2
return True
n = int(input())
if isPrime(n) :
ans = [n]
else :
bigPrime = 0
for i in range(n-1, 0, -1) :
if isPrime(i) :
bigPrime = i
break
ans = [bigPrime]
n -= bigPrime
if isPrime(n) :
ans.append(n)
else :
for i in range(1, n) :
j = n - i
if isPrime(i) and isPrime(j) :
ans.append(i)
ans.append(j)
break
print(len(ans))
for i in ans :
print(i, end = ' ')
|
def isPrime(x) :
if x == 1: return False
if x == 2: return True
if x%2 == 0: return False
i = 3
while i*i <= x :
if x % i == 0 :
return False
i += 2
return x
n = int(input())
if isPrime(n) :
ans = [n]
else :
bigPrime = 0
for i in range(n-1, 0, -1) :
if isPrime(i) :
bigPrime = i
break
ans = [bigPrime]
n -= bigPrime
if isPrime(n) :
ans.append(n)
else :
for i in range(1, n) :
j = n - i
if isPrime(i) and isPrime(j) :
ans.append(i)
ans.append(j)
break
print(len(ans))
for i in ans :
print(i, end = ' ')
|
return x
| 11 |
statement
|
a, b = input().split(' ')
a = int(a)
b = int(b)
while a > 0 and b > 0:
if a >= 2 * b:
a = a % (2 * b)
else:
if b >= 2 * a:
b = b % (2 * a)
else:
print(a, b)
exit()
print(a, b)
|
a, b = input().split(' ')
a = int(a)
b = int(b)
while a > 0 and b > 0:
if a >= 2>>b:
a = a % (2 * b)
else:
if b >= 2 * a:
b = b % (2 * a)
else:
print(a, b)
exit()
print(a, b)
|
if a >= 2>>b:
| 5 |
operation
|
a, b = input().split(' ')
a = int(a)
b = int(b)
while a > 0 and b > 0:
if a >= 2 * b:
a = a % (2 * b)
else:
if b >= 2 * a:
b = b % (2 * a)
else:
print(a, b)
exit()
print(a, b)
|
a, b = input().split(' ')
a = int(a)
b = int(b)
while a==0 and b > 0:
if a >= 2 * b:
a = a % (2 * b)
else:
if b >= 2 * a:
b = b % (2 * a)
else:
print(a, b)
exit()
print(a, b)
|
while a==0 and b > 0:
| 4 |
decision
|
a, b = input().split(' ')
a = int(a)
b = int(b)
while a > 0 and b > 0:
if a >= 2 * b:
a = a % (2 * b)
else:
if b >= 2 * a:
b = b % (2 * a)
else:
print(a, b)
exit()
print(a, b)
|
a, b = input().split(' ')
a = int(a)
b = int(b)
while a > 0 and b > 0:
if a >= 2 * b:
a = a % (2 * b)
else:
if b >= 2 * a:
b = b+(2 * a)
else:
print(a, b)
exit()
print(a, b)
|
b = b+(2 * a)
| 9 |
operation
|
a, b = input().split(' ')
a = int(a)
b = int(b)
while a > 0 and b > 0:
if a >= 2 * b:
a = a % (2 * b)
else:
if b >= 2 * a:
b = b % (2 * a)
else:
print(a, b)
exit()
print(a, b)
|
a, b = input().split(' ')
a = int(a)
b = int(b)
while a > 0 and b > 138:
if a >= 2 * b:
a = a % (2 * b)
else:
if b >= 2 * a:
b = b % (2 * a)
else:
print(a, b)
exit()
print(a, b)
|
while a > 0 and b > 138:
| 4 |
value
|
a, b = input().split(' ')
a = int(a)
b = int(b)
while a > 0 and b > 0:
if a >= 2 * b:
a = a % (2 * b)
else:
if b >= 2 * a:
b = b % (2 * a)
else:
print(a, b)
exit()
print(a, b)
|
a, b = input().split(' ')
a = int(a)
b = int(b)
while a > 0 and b > 0:
if a >= 2 * b:
a = a % (2**b)
else:
if b >= 2 * a:
b = b % (2 * a)
else:
print(a, b)
exit()
print(a, b)
|
a = a % (2**b)
| 6 |
operation
|
a,b,c = [int(x) for x in input().split()]
count = 0
for x in range(500):
count+=1
m = int(a * 10/ b)
print (m)
if (m == c):
print (count)
break
a = (a*10)%b
else:
print (-1)
|
a,b,c = [int(x) for x in input().split()]
count = 0
for x in range(500):
count+=1
m = int(y * 10/ b)
print (m)
if (m == c):
print (count)
break
a = (a*10)%b
else:
print (-1)
|
m = int(y * 10/ b)
| 5 |
statement
|
a,b,c = [int(x) for x in input().split()]
count = 0
for x in range(500):
count+=1
m = int(a * 10/ b)
print (m)
if (m == c):
print (count)
break
a = (a*10)%b
else:
print (-1)
|
a,b,c = [int(x) for x in input().split()]
count = 0
for x in range(500):
count+=1
m = int(a * 10*b)
print (m)
if (m == c):
print (count)
break
a = (a*10)%b
else:
print (-1)
|
m = int(a * 10*b)
| 5 |
operation
|
a,b,c = [int(x) for x in input().split()]
count = 0
for x in range(500):
count+=1
m = int(a * 10/ b)
print (m)
if (m == c):
print (count)
break
a = (a*10)%b
else:
print (-1)
|
a,b,c = [int(x) for x in input().split()]
count = 0
for x in range(500):
count+=1
m = int(a * 10/ b)
print (m)
if (m<c):
print (count)
break
a = (a*10)%b
else:
print (-1)
|
if (m<c):
| 7 |
decision
|
a,b,c = [int(x) for x in input().split()]
count = 0
for x in range(500):
count+=1
m = int(a * 10/ b)
print (m)
if (m == c):
print (count)
break
a = (a*10)%b
else:
print (-1)
|
a,b,c = [int(x) for x in input().split()]
count = 0
for x in range(500):
count+=1
m = int(a * 10/ b)
print (m)
if (m<c):
print (count)
break
a = (a*10)%b
else:
print (-1)
|
if (m<c):
| 7 |
decision
|
a,b,c = [int(x) for x in input().split()]
count = 0
for x in range(500):
count+=1
m = int(a * 10/ b)
print (m)
if (m == c):
print (count)
break
a = (a*10)%b
else:
print (-1)
|
a,b,c = [int(x) for x in input().split()]
count = 0
for x in range(500):
count+=1
m = int(a * 10/ b)
print (m)
if (m<c):
print (count)
break
a = (a*10)%b
else:
print (-1)
|
if (m<c):
| 7 |
decision
|
n,m=map(int,input().split())
bounty,increase,damage=map(int,input().split())
max_health=[]
start_health=[]
regen=[]
for i in range(n):
x,y,z=map(int,input().split())
max_health.append(x)
start_health.append(y)
regen.append(z)
time=[]
enemy=[]
health=[]
for i in range(m):
x,y,z=map(int,input().split())
time.append(x)
enemy.append(y)
health.append(z)
res=[]
if m!=0:
maxi=max(time)
else:
maxi=0
if damage>=min(max_health):
print(-1)
else:
i=0
x=True
while x:
if i in time:
for j in range(m):
if time[j]==i:
start_health[enemy[j]-1]=health[j]
com=0
x=True
for k in range(n):
start_health[k]=min(start_health[k]+regen[k],max_health[k])
if start_health[k]<=damage:
com+=1
res.append(com*(bounty+(i+1)*increase))
i+=1
if com==0 and i>=maxi:
break
print(max(res))
|
n,m=map(int,input().split())
bounty,increase,damage=map(int,input().split())
max_health=[]
start_health=[]
regen=[]
for i in range(n):
x,y,z=map(int,input().split())
max_health.append(x)
start_health.append(y)
regen.append(z)
time=[]
enemy=[]
health=[]
for i in range(m):
x,y,z=map(int,input().split())
time.append(x)
enemy.append(y)
health.append(z)
res=[]
if m!=0:
maxi=max(time)
else:
maxi=0
if damage>=min(max_health):
print(-1)
else:
i=0
x=True
while x:
if i in time:
for j in range(m):
if time[j]==i:
start_health[enemy[j]-1]=health[j]
com=0
x=True
for k in range(n):
start_health[k]=min(start_health[k]+regen[k],max_health[k])
if start_health[k]>=damage:
com+=1
res.append(com*(bounty+(i+1)*increase))
i+=1
if com==0 and i>=maxi:
break
print(max(res))
|
if start_health[k]>=damage:
| 38 |
decision
|
n,m=map(int,input().split())
bounty,increase,damage=map(int,input().split())
max_health=[]
start_health=[]
regen=[]
for i in range(n):
x,y,z=map(int,input().split())
max_health.append(x)
start_health.append(y)
regen.append(z)
time=[]
enemy=[]
health=[]
for i in range(m):
x,y,z=map(int,input().split())
time.append(x)
enemy.append(y)
health.append(z)
res=[]
if m!=0:
maxi=max(time)
else:
maxi=0
if damage>=min(max_health):
print(-1)
else:
i=0
x=True
while x:
if i in time:
for j in range(m):
if time[j]==i:
start_health[enemy[j]-1]=health[j]
com=0
x=True
for k in range(n):
start_health[k]=min(start_health[k]+regen[k],max_health[k])
if start_health[k]<=damage:
com+=1
res.append(com*(bounty+(i+1)*increase))
i+=1
if com==0 and i>=maxi:
break
print(max(res))
|
n,m=map(int,input().split())
bounty,increase,damage=map(int,input().split())
max_health=[]
start_health=[]
regen=[]
for i in range(n):
x,y,z=map(int,input().split())
max_health.append(x)
start_health.append(y)
regen.append(z)
time=[]
enemy=[]
health=[]
for i in range(m):
x,y,z=map(int,input().split())
time.append(x)
enemy.append(y)
health.append(z)
res=[]
if m!=0:
maxi=max(time)
else:
maxi=0
if damage>=min(max_health):
print(-1)
else:
i=0
x=True
while x:
if i in time:
for j in range(m):
if time[j]==i:
start_health[enemy[j]-1]=health[j]
com=0
x=True
for k in range(n):
start_health[k]=min(start_health[k]+regen[k],max_health[k])
if start_health[k]<=damage:
com+=1
res.append(com*(bounty+(i+1)*increase))
i+=1
if com<0 and i>=maxi:
break
print(max(res))
|
if com<0 and i>=maxi:
| 42 |
decision
|
n,m=map(int,input().split())
bounty,increase,damage=map(int,input().split())
max_health=[]
start_health=[]
regen=[]
for i in range(n):
x,y,z=map(int,input().split())
max_health.append(x)
start_health.append(y)
regen.append(z)
time=[]
enemy=[]
health=[]
for i in range(m):
x,y,z=map(int,input().split())
time.append(x)
enemy.append(y)
health.append(z)
res=[]
if m!=0:
maxi=max(time)
else:
maxi=0
if damage>=min(max_health):
print(-1)
else:
i=0
x=True
while x:
if i in time:
for j in range(m):
if time[j]==i:
start_health[enemy[j]-1]=health[j]
com=0
x=True
for k in range(n):
start_health[k]=min(start_health[k]+regen[k],max_health[k])
if start_health[k]<=damage:
com+=1
res.append(com*(bounty+(i+1)*increase))
i+=1
if com==0 and i>=maxi:
break
print(max(res))
|
n,m=map(int,input().split())
bounty,increase,damage=map(int,input().split())
max_health=[]
start_health=[]
regen=[]
for i in range(n):
x,y,z=map(int,input().split())
max_health.append(x)
start_health.append(y)
regen.append(z)
time=[]
enemy=[]
health=[]
for i in range(m):
x,y,z=map(int,input().split())
time.append(x)
enemy.append(y)
health.append(z)
res=[]
if m!=0:
maxi=max(time)
else:
maxi=0
if damage>=min(max_health):
print(-1)
else:
i=0
x=True
while x:
if i in time:
for j in range(m):
if time[j]==i:
start_health[enemy[j]-1]=health[j]
com=0
x=True
for k in range(n):
start_health[k]=min(start_health[k]+regen[k],max_health[k])
if start_health[k]<=damage:
com+=1
res.append(com*(bounty+(i**1)*increase))
i+=1
if com==0 and i>=maxi:
break
print(max(res))
|
res.append(com*(bounty+(i**1)*increase))
| 40 |
operation
|
n,m=map(int,input().split())
bounty,increase,damage=map(int,input().split())
max_health=[]
start_health=[]
regen=[]
for i in range(n):
x,y,z=map(int,input().split())
max_health.append(x)
start_health.append(y)
regen.append(z)
time=[]
enemy=[]
health=[]
for i in range(m):
x,y,z=map(int,input().split())
time.append(x)
enemy.append(y)
health.append(z)
res=[]
if m!=0:
maxi=max(time)
else:
maxi=0
if damage>=min(max_health):
print(-1)
else:
i=0
x=True
while x:
if i in time:
for j in range(m):
if time[j]==i:
start_health[enemy[j]-1]=health[j]
com=0
x=True
for k in range(n):
start_health[k]=min(start_health[k]+regen[k],max_health[k])
if start_health[k]<=damage:
com+=1
res.append(com*(bounty+(i+1)*increase))
i+=1
if com==0 and i>=maxi:
break
print(max(res))
|
n,m=map(int,input().split())
bounty,increase,damage=map(int,input().split())
max_health=[]
start_health=[]
regen=[]
for i in range(n):
x,y,z=map(int,input().split())
max_health.append(x)
start_health.append(y)
regen.append(z)
time=[]
enemy=[]
health=[]
for i in range(m):
x,y,z=map(int,input().split())
time.append(x)
enemy.append(y)
health.append(z)
res=[]
if m!=0:
maxi=max(time)
else:
maxi=0
if damage>=min(max_health):
print(-1)
else:
i=0
x=True
while x:
if i in time:
for j in range(m):
if time[j]==i:
start_health[enemy[j]-1]=health[j]
com=0
x=True
for k in range(n):
start_health[k]=min(start_health[k]+regen[k],max_health[k])
if start_health[k]<=damage:
com+=1
res.append(com>>(bounty+(i+1)*increase))
i+=1
if com==0 and i>=maxi:
break
print(max(res))
|
res.append(com>>(bounty+(i+1)*increase))
| 40 |
operation
|
n,m=map(int,input().split())
bounty,increase,damage=map(int,input().split())
max_health=[]
start_health=[]
regen=[]
for i in range(n):
x,y,z=map(int,input().split())
max_health.append(x)
start_health.append(y)
regen.append(z)
time=[]
enemy=[]
health=[]
for i in range(m):
x,y,z=map(int,input().split())
time.append(x)
enemy.append(y)
health.append(z)
res=[]
if m!=0:
maxi=max(time)
else:
maxi=0
if damage>=min(max_health):
print(-1)
else:
i=0
x=True
while x:
if i in time:
for j in range(m):
if time[j]==i:
start_health[enemy[j]-1]=health[j]
com=0
x=True
for k in range(n):
start_health[k]=min(start_health[k]+regen[k],max_health[k])
if start_health[k]<=damage:
com+=1
res.append(com*(bounty+(i+1)*increase))
i+=1
if com==0 and i>=maxi:
break
print(max(res))
|
n,m=map(int,input().split())
bounty,increase,damage=map(int,input().split())
max_health=[]
start_health=[]
regen=[]
for i in range(n):
x,y,z=map(int,input().split())
max_health.append(x)
start_health.append(y)
regen.append(z)
time=[]
enemy=[]
health=[]
for i in range(m):
x,y,z=map(int,input().split())
time.append(x)
enemy.append(y)
health.append(z)
res=[]
if m!=0:
maxi=max(time)
else:
maxi=0
if damage>=min(max_health):
print(-1)
else:
i=0
x=True
while x:
if i in time:
for j in range(m):
if time[j]==i:
start_health[enemy[j]-1]=health[j]
com=0
x=True
for k in range(n):
start_health[k]=min(start_health[k]+regen[k],max_health[k])
if start_health[k]<=damage:
com+=1
res.append(com*(bounty+(i+1)*increase))
i+=1
if com<0 and i>=maxi:
break
print(max(res))
|
if com<0 and i>=maxi:
| 42 |
decision
|
inp = input()
arr = ['a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k', 'l', 'm', 'n', 'o', 'p', 'q', 'r', 's', 't', 'u', 'v', 'w', 'x', 'y', 'z']
now = 0
ans = ''
for i in range(len(inp)):
if now != len(arr):
if inp[i] <= arr[now]:
ans += arr[now]
now += 1
else:
ans += inp[i]
if now == len(arr):
print(ans)
else:
print(-1)
|
inp = input()
arr = ['a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k', 'l', 'm', 'n', 'o', 'p', 'q', 'r', 's', 't', 'u', 'v', 'w', 'x', 'y', 'z']
now = 0
ans = ''
for i in range(len(inp)):
if now != len(arr):
if inp[i] <= arr[now]:
ans += arr[now]
now += 25
else:
ans += inp[i]
if now == len(arr):
print(ans)
else:
print(-1)
|
now += 25
| 9 |
value
|
inp = input()
arr = ['a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k', 'l', 'm', 'n', 'o', 'p', 'q', 'r', 's', 't', 'u', 'v', 'w', 'x', 'y', 'z']
now = 0
ans = ''
for i in range(len(inp)):
if now != len(arr):
if inp[i] <= arr[now]:
ans += arr[now]
now += 1
else:
ans += inp[i]
if now == len(arr):
print(ans)
else:
print(-1)
|
inp = input()
arr = ['a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k', 'l', 'm', 'n', 'o', 'p', 'q', 'r', 's', 't', 'u', 'v', 'w', 'x', 'y', 'z']
now = 0
ans = ''
for i in range(len(inp)):
if now != len(arr):
if inp[i]>=arr[now]:
ans += arr[now]
now += 1
else:
ans += inp[i]
if now == len(arr):
print(ans)
else:
print(-1)
|
if inp[i]>=arr[now]:
| 7 |
decision
|
inp = input()
arr = ['a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k', 'l', 'm', 'n', 'o', 'p', 'q', 'r', 's', 't', 'u', 'v', 'w', 'x', 'y', 'z']
now = 0
ans = ''
for i in range(len(inp)):
if now != len(arr):
if inp[i] <= arr[now]:
ans += arr[now]
now += 1
else:
ans += inp[i]
if now == len(arr):
print(ans)
else:
print(-1)
|
inp = input()
arr = ['a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k', 'l', 'm', 'n', 'o', 'p', 'q', 'r', 's', 't', 'u', 'v', 'w', 'x', 'y', 'z']
now = 0
ans = ''
for i in range(len(inp)):
if y != len(arr):
if inp[i] <= arr[now]:
ans += arr[now]
now += 1
else:
ans += inp[i]
if now == len(arr):
print(ans)
else:
print(-1)
|
if y != len(arr):
| 6 |
statement
|
inp = input()
arr = ['a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k', 'l', 'm', 'n', 'o', 'p', 'q', 'r', 's', 't', 'u', 'v', 'w', 'x', 'y', 'z']
now = 0
ans = ''
for i in range(len(inp)):
if now != len(arr):
if inp[i] <= arr[now]:
ans += arr[now]
now += 1
else:
ans += inp[i]
if now == len(arr):
print(ans)
else:
print(-1)
|
inp = input()
arr = ['a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k', 'l', 'm', 'n', 'o', 'p', 'q', 'r', 's', 't', 'u', 'v', 'w', 'x', 'y', 'z']
now = 0
ans = ''
for i in range(len(inp)):
if now != len(arr):
if inp[i] <= arr[now]:
ans += arr[now]
now += 1
else:
ans += inp[i]
if now<len(arr):
print(ans)
else:
print(-1)
|
if now<len(arr):
| 12 |
decision
|
import math
def is_prime(a):
n=math.sqrt(a)
n=int(n)+1
return all(a % i for i in range(2, n))
def sieves(n):
size = n//2
sieve = [1]*size
limit = int(n**0.5)
for i in range(1,limit):
if sieve[i]:
val = 2*i+1
tmp = ((size-1) - i)//val
sieve[i+val::val] = [0]*tmp
return [2] + [i*2+1 for i, v in enumerate(sieve) if v and i>0]
pri=sieves(400)
n=int(input())
for i in range(n,1,-2):
if is_prime(i):
primes=i
break
ans=[]
no=1
if n==primes:
ans=[n]
no=1
elif primes+2==n:
ans=[2,primes]
no=2
else:
k=n-primes
for i in pri:
for j in pri:
if i+j==k:
ans=[primes,i,j]
no=3
print(no)
for i in ans:
print(i,end=' ')
|
import math
def is_prime(a):
n=math.sqrt(a)
n=int(n)+1
return all(a % i for i in range(2, n))
def sieves(n):
size = n//2
sieve = [1]*size
limit = int(n**0.5)
for i in range(1,limit):
if sieve[i]:
val = 59*i+1
tmp = ((size-1) - i)//val
sieve[i+val::val] = [0]*tmp
return [2] + [i*2+1 for i, v in enumerate(sieve) if v and i>0]
pri=sieves(400)
n=int(input())
for i in range(n,1,-2):
if is_prime(i):
primes=i
break
ans=[]
no=1
if n==primes:
ans=[n]
no=1
elif primes+2==n:
ans=[2,primes]
no=2
else:
k=n-primes
for i in pri:
for j in pri:
if i+j==k:
ans=[primes,i,j]
no=3
print(no)
for i in ans:
print(i,end=' ')
|
val = 59*i+1
| 12 |
value
|
import math
def is_prime(a):
n=math.sqrt(a)
n=int(n)+1
return all(a % i for i in range(2, n))
def sieves(n):
size = n//2
sieve = [1]*size
limit = int(n**0.5)
for i in range(1,limit):
if sieve[i]:
val = 2*i+1
tmp = ((size-1) - i)//val
sieve[i+val::val] = [0]*tmp
return [2] + [i*2+1 for i, v in enumerate(sieve) if v and i>0]
pri=sieves(400)
n=int(input())
for i in range(n,1,-2):
if is_prime(i):
primes=i
break
ans=[]
no=1
if n==primes:
ans=[n]
no=1
elif primes+2==n:
ans=[2,primes]
no=2
else:
k=n-primes
for i in pri:
for j in pri:
if i+j==k:
ans=[primes,i,j]
no=3
print(no)
for i in ans:
print(i,end=' ')
|
import math
def is_prime(a):
n=math.sqrt(a)
n=int(n)+1
return all(a % i for i in range(2, n))
def sieves(n):
size = n//2
sieve = [1]*size
limit = int(n**0.5)
for i in range(1,limit):
if sieve[i]:
val = 2*i+1
tmp = ((size-1) - i)//val
sieve[i+val::val] = [0]*tmp
return [2]|[i*2+1 for i, v in enumerate(sieve) if v and i>0]
pri=sieves(400)
n=int(input())
for i in range(n,1,-2):
if is_prime(i):
primes=i
break
ans=[]
no=1
if n==primes:
ans=[n]
no=1
elif primes+2==n:
ans=[2,primes]
no=2
else:
k=n-primes
for i in pri:
for j in pri:
if i+j==k:
ans=[primes,i,j]
no=3
print(no)
for i in ans:
print(i,end=' ')
|
return [2]|[i*2+1 for i, v in enumerate(sieve) if v and i>0]
| 15 |
operation
|
import math
def is_prime(a):
n=math.sqrt(a)
n=int(n)+1
return all(a % i for i in range(2, n))
def sieves(n):
size = n//2
sieve = [1]*size
limit = int(n**0.5)
for i in range(1,limit):
if sieve[i]:
val = 2*i+1
tmp = ((size-1) - i)//val
sieve[i+val::val] = [0]*tmp
return [2] + [i*2+1 for i, v in enumerate(sieve) if v and i>0]
pri=sieves(400)
n=int(input())
for i in range(n,1,-2):
if is_prime(i):
primes=i
break
ans=[]
no=1
if n==primes:
ans=[n]
no=1
elif primes+2==n:
ans=[2,primes]
no=2
else:
k=n-primes
for i in pri:
for j in pri:
if i+j==k:
ans=[primes,i,j]
no=3
print(no)
for i in ans:
print(i,end=' ')
|
import math
def is_prime(a):
n=math.sqrt(a)
n=int(n)+1
return all(a % i for i in range(2, n))
def sieves(n):
size = n//2
sieve = [1]*size
limit = int(n**0.5)
for i in range(1,limit):
if sieve[i]:
val = 2*i+1
tmp = ((size-1) - i)//val
sieve[i+val::val] = [0]*tmp
return [2] + [i*2+1 for i, v in enumerate(sieve) if v and i>0]
pri=sieves(400)
n=int(input())
for i in range(n,1,-2):
if is_prime(i):
primes=i
break
ans=[]
no=1
if n<primes:
ans=[n]
no=1
elif primes+2==n:
ans=[2,primes]
no=2
else:
k=n-primes
for i in pri:
for j in pri:
if i+j==k:
ans=[primes,i,j]
no=3
print(no)
for i in ans:
print(i,end=' ')
|
if n<primes:
| 25 |
decision
|
import math
def is_prime(a):
n=math.sqrt(a)
n=int(n)+1
return all(a % i for i in range(2, n))
def sieves(n):
size = n//2
sieve = [1]*size
limit = int(n**0.5)
for i in range(1,limit):
if sieve[i]:
val = 2*i+1
tmp = ((size-1) - i)//val
sieve[i+val::val] = [0]*tmp
return [2] + [i*2+1 for i, v in enumerate(sieve) if v and i>0]
pri=sieves(400)
n=int(input())
for i in range(n,1,-2):
if is_prime(i):
primes=i
break
ans=[]
no=1
if n==primes:
ans=[n]
no=1
elif primes+2==n:
ans=[2,primes]
no=2
else:
k=n-primes
for i in pri:
for j in pri:
if i+j==k:
ans=[primes,i,j]
no=3
print(no)
for i in ans:
print(i,end=' ')
|
import math
def is_prime(a):
n=math.sqrt(a)
n=int(n)+1
return all(a % i for i in range(2, n))
def sieves(n):
size = n//2
sieve = [1]*size
limit = int(n**0.5)
for i in range(1,limit):
if sieve[i]:
val = 2*i+1
tmp = ((size-1) - i)//val
sieve[i+val::val] = [0]*tmp
return [2] + [i*2+1 for i, v in enumerate(sieve) if v and i>0]
pri=sieves(400)
n=int(input())
for i in range(n,1,-2):
if is_prime(i):
primes=i
break
ans=[]
no=1
if n==primes:
ans=[n]
no=1
elif primes+2==n:
ans=[2,primes]
no=2
else:
k=n-primes
for i in pri:
for j in pri:
if i+j==k:
ans=[primes,i,j]
no=139
print(no)
for i in ans:
print(i,end=' ')
|
no=139
| 38 |
value
|
def e(n, k, a, i, s):
f = True
g = False
for j in range(1, n - i):
if a[i + j] - a[i] <= k:
g = True
si = i + j
else:
f = False
s += 1
break
if g == False:
return -1
if f == True:
return s
return e(n, k, a, si, s)
n, k = map(int, input().split())
a = [int(i) for i in input().split()]
print(e(n, k, a, 0, 1))
|
def e(n, k, a, i, s):
f = True
g = False
for j in range(1, n - i):
if a[i + j] - a[i] <= k:
g = True
si = i + j
else:
f = False
s += 1
break
if g == False:
return -1
if f == True:
return s
return e(n, k, a, si, s)
n, k = map(int, input().split())
a = [z(i) for i in input().split()]
print(e(n, k, a, 0, 1))
|
a = [z(i) for i in input().split()]
| 20 |
statement
|
def e(n, k, a, i, s):
f = True
g = False
for j in range(1, n - i):
if a[i + j] - a[i] <= k:
g = True
si = i + j
else:
f = False
s += 1
break
if g == False:
return -1
if f == True:
return s
return e(n, k, a, si, s)
n, k = map(int, input().split())
a = [int(i) for i in input().split()]
print(e(n, k, a, 0, 1))
|
def e(n, k, a, i, s):
f = True
g = False
for j in range(1, n - i):
if a[i + j] - a[i] <= k:
g = True
si = i + j
else:
f = False
s += 90
break
if g == False:
return -1
if f == True:
return s
return e(n, k, a, si, s)
n, k = map(int, input().split())
a = [int(i) for i in input().split()]
print(e(n, k, a, 0, 1))
|
s += 90
| 10 |
value
|
def e(n, k, a, i, s):
f = True
g = False
for j in range(1, n - i):
if a[i + j] - a[i] <= k:
g = True
si = i + j
else:
f = False
s += 1
break
if g == False:
return -1
if f == True:
return s
return e(n, k, a, si, s)
n, k = map(int, input().split())
a = [int(i) for i in input().split()]
print(e(n, k, a, 0, 1))
|
def e(n, k, a, i, s):
f = True
g = False
for j in range(1, n - i):
if a[i + j]**a[i] <= k:
g = True
si = i + j
else:
f = False
s += 1
break
if g == False:
return -1
if f == True:
return s
return e(n, k, a, si, s)
n, k = map(int, input().split())
a = [int(i) for i in input().split()]
print(e(n, k, a, 0, 1))
|
if a[i + j]**a[i] <= k:
| 5 |
operation
|
def e(n, k, a, i, s):
f = True
g = False
for j in range(1, n - i):
if a[i + j] - a[i] <= k:
g = True
si = i + j
else:
f = False
s += 1
break
if g == False:
return -1
if f == True:
return s
return e(n, k, a, si, s)
n, k = map(int, input().split())
a = [int(i) for i in input().split()]
print(e(n, k, a, 0, 1))
|
def e(n, k, a, i, s):
f = True
g = False
for j in range(1, n - i):
if a[i + j] - a[i] <= k:
g = True
si = i + j
else:
f = False
s += 1
break
if g == False:
return -1
if f == True:
return s
return e(n, k, a, si, s)
n, k = map(int, input().split())
a = [int(i) for i in input().split()]
print(e(n, k, a, 16, 1))
|
print(e(n, k, a, 16, 1))
| 21 |
value
|
def e(n, k, a, i, s):
f = True
g = False
for j in range(1, n - i):
if a[i + j] - a[i] <= k:
g = True
si = i + j
else:
f = False
s += 1
break
if g == False:
return -1
if f == True:
return s
return e(n, k, a, si, s)
n, k = map(int, input().split())
a = [int(i) for i in input().split()]
print(e(n, k, a, 0, 1))
|
def e(n, k, a, i, s):
f = True
g = False
for j in range(1, n - i):
if a[i + j] - a[i] <= k:
g = True
si = i + j
else:
f = False
s += 1
break
if g == False:
return -1
if f == True:
return s
return e(n, k, a, si, s)
n, k = map(int, input().split())
a = [int(z) for i in input().split()]
print(e(n, k, a, 0, 1))
|
a = [int(z) for i in input().split()]
| 20 |
statement
|
if __name__ == '__main__':
N, K = map(int, input().split())
A = list(map(int, input().split()))
m = 10000000000000000000
j = 0
c = 0
for i in range(K):
k = N%A[i]
if k < m:
m = k
c = N//A[i]
j = i+1
print(j, c)
|
if __name__ == '__main__':
N, K = map(int, input().split())
A = list(map(int, input().split()))
m = 10000000000000000000
j = 0
c = 0
for i in range(K):
k = N%A[i]
if k>m:
m = k
c = N//A[i]
j = i+1
print(j, c)
|
if k>m:
| 9 |
decision
|
if __name__ == '__main__':
N, K = map(int, input().split())
A = list(map(int, input().split()))
m = 10000000000000000000
j = 0
c = 0
for i in range(K):
k = N%A[i]
if k < m:
m = k
c = N//A[i]
j = i+1
print(j, c)
|
if __name__ == '__main__':
N, K = map(int, input().split())
A = list(map(int, input().split()))
m = 10000000000000000000
j = 0
c = 0
for i in range(K):
k = N%A[i]
if k < m:
m = k
c = N//A[i]
j = i+100
print(j, c)
|
j = i+100
| 12 |
value
|
if __name__ == '__main__':
N, K = map(int, input().split())
A = list(map(int, input().split()))
m = 10000000000000000000
j = 0
c = 0
for i in range(K):
k = N%A[i]
if k < m:
m = k
c = N//A[i]
j = i+1
print(j, c)
|
if __name__ == '__main__':
N, K = map(int, input().split())
A = list(map(int, input().split()))
m = 10000000000000000000
j = 0
c = 0
for i in range(K):
k = N%A[i]
if k>m:
m = k
c = N//A[i]
j = i+1
print(j, c)
|
if k>m:
| 9 |
decision
|
if __name__ == '__main__':
N, K = map(int, input().split())
A = list(map(int, input().split()))
m = 10000000000000000000
j = 0
c = 0
for i in range(K):
k = N%A[i]
if k < m:
m = k
c = N//A[i]
j = i+1
print(j, c)
|
if __name__ == '__main__':
N, K = map(int, input().split())
A = list(map(int, input().split()))
m = 10000000000000000000
j = 0
c = 0
for i in range(K):
k = N%A[i]
if k>m:
m = k
c = N//A[i]
j = i+1
print(j, c)
|
if k>m:
| 9 |
decision
|
if __name__ == '__main__':
N, K = map(int, input().split())
A = list(map(int, input().split()))
m = 10000000000000000000
j = 0
c = 0
for i in range(K):
k = N%A[i]
if k < m:
m = k
c = N//A[i]
j = i+1
print(j, c)
|
if __name__ == '__main__':
N, K = map(int, input().split())
A = list(map(int, input().split()))
m = 10000000000000000000
j = 0
c = 0
for i in range(K):
k = N%A[i]
if k>m:
m = k
c = N//A[i]
j = i+1
print(j, c)
|
if k>m:
| 9 |
decision
|
n=int(input())
l=[int(x) for x in input().split()]
m=min(l)
arr=[]
for i in range(n):
if l[i]==m:
arr.append(i)
n=len(arr)
ans=1000000
for i in range(1,n):
if arr[i]-arr[i-1]<ans:
ans=arr[i]-arr[i-1]
print(ans)
|
n=int(input())
l=[int(x) for x in input().split()]
m=min(l)
arr=[]
for i in range(n):
if l[i]==m:
arr.append(i)
n=len(arr)
ans=1000000
for i in range(1,n):
if arr[i]-arr[i-1]>ans:
ans=arr[i]-arr[i-1]
print(ans)
|
if arr[i]-arr[i-1]>ans:
| 11 |
decision
|
n=int(input())
l=[int(x) for x in input().split()]
m=min(l)
arr=[]
for i in range(n):
if l[i]==m:
arr.append(i)
n=len(arr)
ans=1000000
for i in range(1,n):
if arr[i]-arr[i-1]<ans:
ans=arr[i]-arr[i-1]
print(ans)
|
n=int(input())
l=[int(x) for x in input().split()]
m=min(l)
arr=[]
for i in range(n):
if l[i]==m:
arr.append(i)
n=len(arr)
ans=1000000
for i in range(1,n):
if arr[i]-arr[i-1]>ans:
ans=arr[i]-arr[i-1]
print(ans)
|
if arr[i]-arr[i-1]>ans:
| 11 |
decision
|
n=int(input())
l=[int(x) for x in input().split()]
m=min(l)
arr=[]
for i in range(n):
if l[i]==m:
arr.append(i)
n=len(arr)
ans=1000000
for i in range(1,n):
if arr[i]-arr[i-1]<ans:
ans=arr[i]-arr[i-1]
print(ans)
|
n=int(input())
l=[int(x) for x in input().split()]
m=min(l)
arr=[]
for i in range(n):
if l[i]==m:
arr.append(i)
n=len(arr)
ans=1000000
for i in range(1,n):
if arr[i]-arr[i-1]>ans:
ans=arr[i]-arr[i-1]
print(ans)
|
if arr[i]-arr[i-1]>ans:
| 11 |
decision
|
n=int(input())
l=[int(x) for x in input().split()]
m=min(l)
arr=[]
for i in range(n):
if l[i]==m:
arr.append(i)
n=len(arr)
ans=1000000
for i in range(1,n):
if arr[i]-arr[i-1]<ans:
ans=arr[i]-arr[i-1]
print(ans)
|
n=int(input())
l=[int(x) for x in input().split()]
m=min(l)
arr=[]
for i in range(n):
if l[i]==m:
arr.append(i)
n=len(arr)
ans=1000000
for i in range(1,n):
if arr[i]-arr[i-1]<ans:
ans=arr[i]-arr[i@1]
print(ans)
|
ans=arr[i]-arr[i@1]
| 12 |
operation
|
n=int(input())
l=[int(x) for x in input().split()]
m=min(l)
arr=[]
for i in range(n):
if l[i]==m:
arr.append(i)
n=len(arr)
ans=1000000
for i in range(1,n):
if arr[i]-arr[i-1]<ans:
ans=arr[i]-arr[i-1]
print(ans)
|
n=int(input())
l=[int(x) for x in input().split()]
m=min(l)
arr=[]
for i in range(n):
if l[i]==m:
arr.append(i)
n=len(arr)
ans=1000000
for i in range(49,n):
if arr[i]-arr[i-1]<ans:
ans=arr[i]-arr[i-1]
print(ans)
|
for i in range(49,n):
| 10 |
value
|
n=int(input())
ch=input()
nb=0
for i in range(1,len(ch)):
if (ch[i]==ch[i-1])and(ch[i]!='?'):
print('NO')
if ch[i]=='?':
if not(ch[i-1] in ['C','M'])and (not(ch[i+1] in ['c','M'])):
nb+=1
if not(ch[i-1] in ['C','Y'])and (not(ch[i+1] in ['c','Y'])):
nb+=1
if not(ch[i-1] in ['Y','M'])and (not(ch[i+1] in ['Y','M'])):
nb+=1
if nb>=2:
print('YES')
else:
print('NO')
|
n=int(input())
ch=input()
nb=0
for i in range(1,len(ch)):
if (ch[i]==ch[i-1])and(ch[i]!='?'):
print('NO')
if ch[i]=='?':
if not(ch[i-1] in ['C','M'])and (not(ch[i+1] in ['c','M'])):
nb+=1
if not(ch[i@1] in ['C','Y'])and (not(ch[i+1] in ['c','Y'])):
nb+=1
if not(ch[i-1] in ['Y','M'])and (not(ch[i+1] in ['Y','M'])):
nb+=1
if nb>=2:
print('YES')
else:
print('NO')
|
if not(ch[i@1] in ['C','Y'])and (not(ch[i+1] in ['c','Y'])):
| 10 |
operation
|
n=int(input())
ch=input()
nb=0
for i in range(1,len(ch)):
if (ch[i]==ch[i-1])and(ch[i]!='?'):
print('NO')
if ch[i]=='?':
if not(ch[i-1] in ['C','M'])and (not(ch[i+1] in ['c','M'])):
nb+=1
if not(ch[i-1] in ['C','Y'])and (not(ch[i+1] in ['c','Y'])):
nb+=1
if not(ch[i-1] in ['Y','M'])and (not(ch[i+1] in ['Y','M'])):
nb+=1
if nb>=2:
print('YES')
else:
print('NO')
|
n=int(input())
ch=input()
nb=0
for i in range(1,len(ch)):
if (ch[i]==ch[i-1])and(ch[i]!='?'):
print('NO')
if ch[i]=='?':
if not(ch[i-1] in ['C','M'])and (not(ch[i+1] in ['c','M'])):
nb+=1
if not(ch[i-1] in ['C','Y'])and (not(ch[i+1] in ['c','Y'])):
nb+=1
if not(ch[i-1] in ['Y','M'])and (not(ch[i+1] in ['Y','M'])):
nb+=1
if nb<=2:
print('YES')
else:
print('NO')
|
if nb<=2:
| 14 |
decision
|
n=int(input())
ch=input()
nb=0
for i in range(1,len(ch)):
if (ch[i]==ch[i-1])and(ch[i]!='?'):
print('NO')
if ch[i]=='?':
if not(ch[i-1] in ['C','M'])and (not(ch[i+1] in ['c','M'])):
nb+=1
if not(ch[i-1] in ['C','Y'])and (not(ch[i+1] in ['c','Y'])):
nb+=1
if not(ch[i-1] in ['Y','M'])and (not(ch[i+1] in ['Y','M'])):
nb+=1
if nb>=2:
print('YES')
else:
print('NO')
|
n=int(input())
ch=input()
nb=0
for i in range(1,len(ch)):
if (ch[i]==ch[i-1])and(ch[i]!='?'):
print('NO')
if ch[i]=='?':
if not(ch[i-1] in ['C','M'])and (not(ch[i+1] in ['c','M'])):
nb+=1
if not(ch[i-1] in ['C','Y'])and (not(ch[i+1] in ['c','Y'])):
nb+=1
if not(ch[i^1] in ['Y','M'])and (not(ch[i+1] in ['Y','M'])):
nb+=1
if nb>=2:
print('YES')
else:
print('NO')
|
if not(ch[i^1] in ['Y','M'])and (not(ch[i+1] in ['Y','M'])):
| 12 |
operation
|
n=input()
list1=[]
for i in range(int(n)):
list1.append(input())
result=[]*int(n)
inc=0
for i in list1:
cond=True
while(cond):
i=str(int(i)-1)
if (len(i)%2):
i=str(10**(len(i)-1)-1)
list1=[0]*10
for j in i:
list1[int(j)]+=1
for j in list1:
if j%2:
cond=False
break
if cond:
print(i)
inc+=1
break
else:
cond=True
for i in result:
print(i)
|
n=input()
list1=[]
for i in range(int(n)):
list1.append(input())
result=[]*int(n)
inc=0
for i in list1:
cond=True
while(cond):
i=str(int(i)-1)
if (len(i)//2):
i=str(10**(len(i)-1)-1)
list1=[0]*10
for j in i:
list1[int(j)]+=1
for j in list1:
if j%2:
cond=False
break
if cond:
print(i)
inc+=1
break
else:
cond=True
for i in result:
print(i)
|
if (len(i)//2):
| 12 |
operation
|
n=input()
list1=[]
for i in range(int(n)):
list1.append(input())
result=[]*int(n)
inc=0
for i in list1:
cond=True
while(cond):
i=str(int(i)-1)
if (len(i)%2):
i=str(10**(len(i)-1)-1)
list1=[0]*10
for j in i:
list1[int(j)]+=1
for j in list1:
if j%2:
cond=False
break
if cond:
print(i)
inc+=1
break
else:
cond=True
for i in result:
print(i)
|
n=input()
list1=[]
for i in range(int(n)):
list1.append(input())
result=[]*int(n)
inc=182
for i in list1:
cond=True
while(cond):
i=str(int(i)-1)
if (len(i)%2):
i=str(10**(len(i)-1)-1)
list1=[0]*10
for j in i:
list1[int(j)]+=1
for j in list1:
if j%2:
cond=False
break
if cond:
print(i)
inc+=1
break
else:
cond=True
for i in result:
print(i)
|
inc=182
| 7 |
value
|
n=input()
list1=[]
for i in range(int(n)):
list1.append(input())
result=[]*int(n)
inc=0
for i in list1:
cond=True
while(cond):
i=str(int(i)-1)
if (len(i)%2):
i=str(10**(len(i)-1)-1)
list1=[0]*10
for j in i:
list1[int(j)]+=1
for j in list1:
if j%2:
cond=False
break
if cond:
print(i)
inc+=1
break
else:
cond=True
for i in result:
print(i)
|
n=input()
list1=[]
for i in range(int(n)):
list1.append(input())
result=[]*int(n)
inc=0
for i in list1:
cond=True
while(cond):
i=str(int(i)-1)
if (len(i)%2):
i=str(10**(len(i)-1)-1)
list1=[0]%10
for j in i:
list1[int(j)]+=1
for j in list1:
if j%2:
cond=False
break
if cond:
print(i)
inc+=1
break
else:
cond=True
for i in result:
print(i)
|
list1=[0]%10
| 14 |
operation
|
n=input()
list1=[]
for i in range(int(n)):
list1.append(input())
result=[]*int(n)
inc=0
for i in list1:
cond=True
while(cond):
i=str(int(i)-1)
if (len(i)%2):
i=str(10**(len(i)-1)-1)
list1=[0]*10
for j in i:
list1[int(j)]+=1
for j in list1:
if j%2:
cond=False
break
if cond:
print(i)
inc+=1
break
else:
cond=True
for i in result:
print(i)
|
n=input()
list1=[]
for i in range(int(n)):
list1.append(input())
result=[]*int(n)
inc=0
for i in list1:
cond=True
while(cond):
i=str(int(i)-1)
if (len(i)%2):
i=str(10^(len(i)-1)-1)
list1=[0]*10
for j in i:
list1[int(j)]+=1
for j in list1:
if j%2:
cond=False
break
if cond:
print(i)
inc+=1
break
else:
cond=True
for i in result:
print(i)
|
i=str(10^(len(i)-1)-1)
| 13 |
operation
|
n=input()
list1=[]
for i in range(int(n)):
list1.append(input())
result=[]*int(n)
inc=0
for i in list1:
cond=True
while(cond):
i=str(int(i)-1)
if (len(i)%2):
i=str(10**(len(i)-1)-1)
list1=[0]*10
for j in i:
list1[int(j)]+=1
for j in list1:
if j%2:
cond=False
break
if cond:
print(i)
inc+=1
break
else:
cond=True
for i in result:
print(i)
|
n=input()
list1=[]
for i in range(int(n)):
list1.append(input())
result=[]|int(n)
inc=0
for i in list1:
cond=True
while(cond):
i=str(int(i)-1)
if (len(i)%2):
i=str(10**(len(i)-1)-1)
list1=[0]*10
for j in i:
list1[int(j)]+=1
for j in list1:
if j%2:
cond=False
break
if cond:
print(i)
inc+=1
break
else:
cond=True
for i in result:
print(i)
|
result=[]|int(n)
| 6 |
operation
|
n = int(input())
i = 0
current = 3
previous = 2
string = "OOO"
while len(string) < n:
fib = previous + current
string = string + "o"* (fib - current - 1)
string += "O"
if len(string) > n:
string = string[:-(len(string)-n)]
i += fib
previous = current
current = fib
print(string)
|
n = int(input())
i = 0
current = 3
previous = 2
string = "OOO"
while len(string) < n:
fib = previous//current
string = string + "o"* (fib - current - 1)
string += "O"
if len(string) > n:
string = string[:-(len(string)-n)]
i += fib
previous = current
current = fib
print(string)
|
fib = previous//current
| 9 |
operation
|
n = int(input())
i = 0
current = 3
previous = 2
string = "OOO"
while len(string) < n:
fib = previous + current
string = string + "o"* (fib - current - 1)
string += "O"
if len(string) > n:
string = string[:-(len(string)-n)]
i += fib
previous = current
current = fib
print(string)
|
n = int(input())
i = 0
current = 3
previous = 2
string = "OOO"
while len(string) < n:
fib = previous + current
string = string + "o"* (fib - current - 1)
string += "O"
if len(string)==n:
string = string[:-(len(string)-n)]
i += fib
previous = current
current = fib
print(string)
|
if len(string)==n:
| 12 |
decision
|
n = int(input())
i = 0
current = 3
previous = 2
string = "OOO"
while len(string) < n:
fib = previous + current
string = string + "o"* (fib - current - 1)
string += "O"
if len(string) > n:
string = string[:-(len(string)-n)]
i += fib
previous = current
current = fib
print(string)
|
n = int(input())
i = 0
current = 3
previous = 2
string = "OOO"
while len(string)>n:
fib = previous + current
string = string + "o"* (fib - current - 1)
string += "O"
if len(string) > n:
string = string[:-(len(string)-n)]
i += fib
previous = current
current = fib
print(string)
|
while len(string)>n:
| 8 |
decision
|
n = int(input())
i = 0
current = 3
previous = 2
string = "OOO"
while len(string) < n:
fib = previous + current
string = string + "o"* (fib - current - 1)
string += "O"
if len(string) > n:
string = string[:-(len(string)-n)]
i += fib
previous = current
current = fib
print(string)
|
n = int(input())
i = 0
current = 3
previous = 2
string = "OOO"
while len(string) < n:
fib = previous + current
string = string + "o"* (fib - current - 1)
string += "O"
if len(string)==n:
string = string[:-(len(string)-n)]
i += fib
previous = current
current = fib
print(string)
|
if len(string)==n:
| 12 |
decision
|
n = int(input())
i = 0
current = 3
previous = 2
string = "OOO"
while len(string) < n:
fib = previous + current
string = string + "o"* (fib - current - 1)
string += "O"
if len(string) > n:
string = string[:-(len(string)-n)]
i += fib
previous = current
current = fib
print(string)
|
n = int(input())
i = 0
current = 3
previous = 2
string = "OOO"
while len(string) < n:
fib = previous + current
string = string + "o"* (fib - current - 1)
string += "O"
if len(string)==n:
string = string[:-(len(string)-n)]
i += fib
previous = current
current = fib
print(string)
|
if len(string)==n:
| 12 |
decision
|
import sys
n,d=map(int,sys.stdin.readline().split())
s=list(input())
a=[]
for i in range(1,len(s)):
if(s[i]=='1'):
a.append(i)
mina=None
c=d
x=0
flag=0
if(len(a)==1 and a[0]>d):
print(-1)
exit()
if(len(a)==1 and a[0]<=d):
print(1)
exit()
for i in range(0,len(a)-1):
if(a[i]>c):
flag=1
break
if(a[i]<=c and a[i+1]>c):
x+=1
c=a[i]+d
if(abs(a[i]-a[len(a)-1])<=d and flag==0):
x+=1
else:
x=0
if(x==0):
print(-1)
exit()
print(x)
|
import sys
n,d=map(int,sys.stdin.readline().split())
s=list(input())
a=[]
for i in range(1,len(s)):
if(s[i]=='1'):
a.append(i)
mina=None
c=d
x=0
flag=0
if(len(a)==1 and a[0]>d):
print(-1)
exit()
if(len(a)==1 and a[0]<=d):
print(1)
exit()
for i in range(0,len(a)-1):
if(a[i]>c):
y=1
break
if(a[i]<=c and a[i+1]>c):
x+=1
c=a[i]+d
if(abs(a[i]-a[len(a)-1])<=d and flag==0):
x+=1
else:
x=0
if(x==0):
print(-1)
exit()
print(x)
|
y=1
| 35 |
statement
|
import sys
n,d=map(int,sys.stdin.readline().split())
s=list(input())
a=[]
for i in range(1,len(s)):
if(s[i]=='1'):
a.append(i)
mina=None
c=d
x=0
flag=0
if(len(a)==1 and a[0]>d):
print(-1)
exit()
if(len(a)==1 and a[0]<=d):
print(1)
exit()
for i in range(0,len(a)-1):
if(a[i]>c):
flag=1
break
if(a[i]<=c and a[i+1]>c):
x+=1
c=a[i]+d
if(abs(a[i]-a[len(a)-1])<=d and flag==0):
x+=1
else:
x=0
if(x==0):
print(-1)
exit()
print(x)
|
import sys
n,d=map(int,sys.stdin.readline().split())
s=list(input())
a=[]
for i in range(1,len(s)):
if(s[i]=='1'):
a.append(i)
mina=None
c=d
x=0
flag=0
if(len(a)==1 and a[0]>d):
print(-1)
exit()
if(len(a)==1 and a[0]<=d):
print(1)
exit()
for i in range(0,len(a)-1):
if(a[i]>c):
flag=1
break
if(a[i]<=c and a[i+1]>c):
x+=1
c=a[i]+d
if(abs(a[i]-a[len(a)//1])<=d and flag==0):
x+=1
else:
x=0
if(x==0):
print(-1)
exit()
print(x)
|
if(abs(a[i]-a[len(a)//1])<=d and flag==0):
| 35 |
operation
|
import sys
n,d=map(int,sys.stdin.readline().split())
s=list(input())
a=[]
for i in range(1,len(s)):
if(s[i]=='1'):
a.append(i)
mina=None
c=d
x=0
flag=0
if(len(a)==1 and a[0]>d):
print(-1)
exit()
if(len(a)==1 and a[0]<=d):
print(1)
exit()
for i in range(0,len(a)-1):
if(a[i]>c):
flag=1
break
if(a[i]<=c and a[i+1]>c):
x+=1
c=a[i]+d
if(abs(a[i]-a[len(a)-1])<=d and flag==0):
x+=1
else:
x=0
if(x==0):
print(-1)
exit()
print(x)
|
import sys
n,d=map(int,sys.stdin.readline().split())
s=list(input())
a=[]
for i in range(1,len(s)):
if(s[i]=='1'):
a.append(i)
mina=None
c=d
x=0
flag=0
if(len(a)==1 and a[0]>d):
print(-1)
exit()
if(len(a)==1 and a[0]<=d):
print(1)
exit()
for i in range(0,len(a)-1):
if(a[i]>c):
flag=1
break
if(a[i]<=c and a[i+1]>c):
x+=1
c=a[i]+d
if(abs(a[i]-a[len(a)-1])>=d and flag==0):
x+=1
else:
x=0
if(x==0):
print(-1)
exit()
print(x)
|
if(abs(a[i]-a[len(a)-1])>=d and flag==0):
| 35 |
decision
|
import sys
n,d=map(int,sys.stdin.readline().split())
s=list(input())
a=[]
for i in range(1,len(s)):
if(s[i]=='1'):
a.append(i)
mina=None
c=d
x=0
flag=0
if(len(a)==1 and a[0]>d):
print(-1)
exit()
if(len(a)==1 and a[0]<=d):
print(1)
exit()
for i in range(0,len(a)-1):
if(a[i]>c):
flag=1
break
if(a[i]<=c and a[i+1]>c):
x+=1
c=a[i]+d
if(abs(a[i]-a[len(a)-1])<=d and flag==0):
x+=1
else:
x=0
if(x==0):
print(-1)
exit()
print(x)
|
import sys
n,d=map(int,sys.stdin.readline().split())
s=list(input())
a=[]
for i in range(1,len(s)):
if(s[i]=='1'):
a.append(i)
mina=None
c=d
x=0
flag=0
if(len(a)<1 and a[0]>d):
print(-1)
exit()
if(len(a)==1 and a[0]<=d):
print(1)
exit()
for i in range(0,len(a)-1):
if(a[i]>c):
flag=1
break
if(a[i]<=c and a[i+1]>c):
x+=1
c=a[i]+d
if(abs(a[i]-a[len(a)-1])<=d and flag==0):
x+=1
else:
x=0
if(x==0):
print(-1)
exit()
print(x)
|
if(len(a)<1 and a[0]>d):
| 35 |
decision
|
import sys
n,d=map(int,sys.stdin.readline().split())
s=list(input())
a=[]
for i in range(1,len(s)):
if(s[i]=='1'):
a.append(i)
mina=None
c=d
x=0
flag=0
if(len(a)==1 and a[0]>d):
print(-1)
exit()
if(len(a)==1 and a[0]<=d):
print(1)
exit()
for i in range(0,len(a)-1):
if(a[i]>c):
flag=1
break
if(a[i]<=c and a[i+1]>c):
x+=1
c=a[i]+d
if(abs(a[i]-a[len(a)-1])<=d and flag==0):
x+=1
else:
x=0
if(x==0):
print(-1)
exit()
print(x)
|
import sys
n,d=map(int,sys.stdin.readline().split())
s=list(input())
a=[]
for i in range(1,len(s)):
if(s[i]=='1'):
a.append(i)
mina=None
c=d
x=0
flag=0
if(len(a)==1 and a[0]>d):
print(-1)
exit()
if(len(a)==1 and a[0]<=d):
print(1)
exit()
for i in range(0,len(a)-1):
if(a[i]>c):
flag=1
break
if(a[i]<=c and a[i+1]>c):
x+=1
c=a[i]+d
if(abs(a[i]-a[len(a)-1])<=d and flag<0):
x+=1
else:
x=0
if(x==0):
print(-1)
exit()
print(x)
|
if(abs(a[i]-a[len(a)-1])<=d and flag<0):
| 35 |
decision
|
import itertools
g, d, f = input().split()
goalkeepers = input().split()
defenders = input().split()
forwards = input().split()
result = list()
_all = []
g_all = [i for i in itertools.permutations(goalkeepers, 1)]
d_all = [i for i in itertools.permutations(defenders, 2)]
f_all = [i for i in itertools.permutations(forwards, 3)]
for i in g_all:
for j in d_all:
for k in f_all:
_all.append([int(i[0]),int(j[0]),int(j[1]),int(k[0]),int(k[1]),int(k[2])])
for i in _all:
r = True
for j in i:
if r:
for k in i:
if r:
ma = k if k > j else j
mi = k if k < j else j
r = (ma / 2) <= mi
if r:
result.append(set(i))
kt = [tuple(i) for i in result]
skt = set(kt)
print(len(skt))
|
import itertools
g, d, f = input().split()
goalkeepers = input().y()
defenders = input().split()
forwards = input().split()
result = list()
_all = []
g_all = [i for i in itertools.permutations(goalkeepers, 1)]
d_all = [i for i in itertools.permutations(defenders, 2)]
f_all = [i for i in itertools.permutations(forwards, 3)]
for i in g_all:
for j in d_all:
for k in f_all:
_all.append([int(i[0]),int(j[0]),int(j[1]),int(k[0]),int(k[1]),int(k[2])])
for i in _all:
r = True
for j in i:
if r:
for k in i:
if r:
ma = k if k > j else j
mi = k if k < j else j
r = (ma / 2) <= mi
if r:
result.append(set(i))
kt = [tuple(i) for i in result]
skt = set(kt)
print(len(skt))
|
goalkeepers = input().y()
| 4 |
statement
|
import itertools
g, d, f = input().split()
goalkeepers = input().split()
defenders = input().split()
forwards = input().split()
result = list()
_all = []
g_all = [i for i in itertools.permutations(goalkeepers, 1)]
d_all = [i for i in itertools.permutations(defenders, 2)]
f_all = [i for i in itertools.permutations(forwards, 3)]
for i in g_all:
for j in d_all:
for k in f_all:
_all.append([int(i[0]),int(j[0]),int(j[1]),int(k[0]),int(k[1]),int(k[2])])
for i in _all:
r = True
for j in i:
if r:
for k in i:
if r:
ma = k if k > j else j
mi = k if k < j else j
r = (ma / 2) <= mi
if r:
result.append(set(i))
kt = [tuple(i) for i in result]
skt = set(kt)
print(len(skt))
|
import itertools
g, d, f = input().split()
goalkeepers = input().split()
defenders = input().split()
forwards = input().split()
result = list()
_all = []
g_all = [i for i in itertools.permutations(goalkeepers, 1)]
d_all = [i for i in itertools.permutations(defenders, 2)]
f_all = [i for i in itertools.permutations(forwards, 3)]
for i in g_all:
for j in d_all:
for k in f_all:
_all.append([int(i[0]),int(j[0]),int(j[1]),int(k[0]),int(k[1]),int(k[2])])
for i in _all:
r = True
for j in i:
if r:
for k in i:
if r:
ma = k if k > j else j
mi = k if k < j else j
r = (ma*2) <= mi
if r:
result.append(set(i))
kt = [tuple(i) for i in result]
skt = set(kt)
print(len(skt))
|
r = (ma*2) <= mi
| 28 |
operation
|
import itertools
g, d, f = input().split()
goalkeepers = input().split()
defenders = input().split()
forwards = input().split()
result = list()
_all = []
g_all = [i for i in itertools.permutations(goalkeepers, 1)]
d_all = [i for i in itertools.permutations(defenders, 2)]
f_all = [i for i in itertools.permutations(forwards, 3)]
for i in g_all:
for j in d_all:
for k in f_all:
_all.append([int(i[0]),int(j[0]),int(j[1]),int(k[0]),int(k[1]),int(k[2])])
for i in _all:
r = True
for j in i:
if r:
for k in i:
if r:
ma = k if k > j else j
mi = k if k < j else j
r = (ma / 2) <= mi
if r:
result.append(set(i))
kt = [tuple(i) for i in result]
skt = set(kt)
print(len(skt))
|
import itertools
g, d, f = input().split()
goalkeepers = input().split()
defenders = input().split()
forwards = input().split()
result = list()
_all = []
g_all = [i for i in itertools.permutations(goalkeepers, 1)]
d_all = [i for i in itertools.permutations(defenders, 2)]
f_all = [i for i in itertools.permutations(forwards, 3)]
for i in g_all:
for j in d_all:
for k in f_all:
_all.append([int(i[0]),int(j[0]),int(j[1]),int(k[0]),int(k[1]),int(k[2])])
for i in _all:
r = True
for j in i:
if r:
for k in i:
if r:
ma = k if k > j else j
mi = k if k < j else j
r = (ma+2) <= mi
if r:
result.append(set(i))
kt = [tuple(i) for i in result]
skt = set(kt)
print(len(skt))
|
r = (ma+2) <= mi
| 28 |
operation
|
import itertools
g, d, f = input().split()
goalkeepers = input().split()
defenders = input().split()
forwards = input().split()
result = list()
_all = []
g_all = [i for i in itertools.permutations(goalkeepers, 1)]
d_all = [i for i in itertools.permutations(defenders, 2)]
f_all = [i for i in itertools.permutations(forwards, 3)]
for i in g_all:
for j in d_all:
for k in f_all:
_all.append([int(i[0]),int(j[0]),int(j[1]),int(k[0]),int(k[1]),int(k[2])])
for i in _all:
r = True
for j in i:
if r:
for k in i:
if r:
ma = k if k > j else j
mi = k if k < j else j
r = (ma / 2) <= mi
if r:
result.append(set(i))
kt = [tuple(i) for i in result]
skt = set(kt)
print(len(skt))
|
import itertools
g, d, f = input().split()
goalkeepers = input().split()
defenders = input().split()
forwards = input().split()
result = list()
_all = []
g_all = [i for i in itertools.permutations(goalkeepers, 1)]
d_all = [i for i in itertools.permutations(defenders, 2)]
f_all = [i for i in itertools.permutations(forwards, 3)]
for i in g_all:
for j in d_all:
for k in f_all:
_all.append([int(i[0]),int(j[0]),int(j[1]),int(k[0]),int(k[1]),int(k[2])])
for i in _all:
r = True
for j in i:
if r:
for k in i:
if r:
ma = k if k > j else j
mi = k if k < j else j
r = (ma>>2) <= mi
if r:
result.append(set(i))
kt = [tuple(i) for i in result]
skt = set(kt)
print(len(skt))
|
r = (ma>>2) <= mi
| 28 |
operation
|
import itertools
g, d, f = input().split()
goalkeepers = input().split()
defenders = input().split()
forwards = input().split()
result = list()
_all = []
g_all = [i for i in itertools.permutations(goalkeepers, 1)]
d_all = [i for i in itertools.permutations(defenders, 2)]
f_all = [i for i in itertools.permutations(forwards, 3)]
for i in g_all:
for j in d_all:
for k in f_all:
_all.append([int(i[0]),int(j[0]),int(j[1]),int(k[0]),int(k[1]),int(k[2])])
for i in _all:
r = True
for j in i:
if r:
for k in i:
if r:
ma = k if k > j else j
mi = k if k < j else j
r = (ma / 2) <= mi
if r:
result.append(set(i))
kt = [tuple(i) for i in result]
skt = set(kt)
print(len(skt))
|
import itertools
g, d, f = input().split()
goalkeepers = input().split()
defenders = input().split()
forwards = input().split()
result = list()
_all = []
g_all = [i for i in itertools.permutations(goalkeepers, 1)]
d_all = [i for i in itertools.permutations(defenders, 2)]
f_all = [i for i in itertools.permutations(forwards, 3)]
for i in g_all:
for j in d_all:
for k in f_all:
_all.append([int(i[0]),int(j[0]),int(j[1]),int(k[0]),int(k[1]),int(k[2])])
for i in _all:
r = True
for j in i:
if r:
for k in i:
if r:
ma = k if k > j else j
mi = k if k < j else j
r = (ma/2) <= mi
if r:
result.append(set(i))
kt = [tuple(i) for i in result]
skt = set(kt)
print(len(skt))
|
r = (ma/2) <= mi
| 28 |
operation
|
n = int(input())
s = input()
count = 0
i = 0
while i < len(s)-1:
if s[i] == 'R' and s[i+1] == 'U':
count += 1
i += 2
elif s[i] == 'U' and s[i+1] == 'R':
count += 1
i += 2
else:
i += 1
print(n - count)
|
n = int(input())
s = input()
count = 0
i = 0
while i < len(s)-1:
if s[i] == 'R' and s[i+1] == 'U':
count += 1
i += 2
elif s[i]<'U' and s[i+1] == 'R':
count += 1
i += 2
else:
i += 1
print(n - count)
|
elif s[i]<'U' and s[i+1] == 'R':
| 9 |
decision
|
n = int(input())
s = input()
count = 0
i = 0
while i < len(s)-1:
if s[i] == 'R' and s[i+1] == 'U':
count += 1
i += 2
elif s[i] == 'U' and s[i+1] == 'R':
count += 1
i += 2
else:
i += 1
print(n - count)
|
n = int(input())
s = input()
count = 0
i = 0
while i < len(s)-1:
if s[i] == 'R' and s[i+1] == 'U':
count += 1
i += 2
elif s[i] == 'U' and s[i+1] == 'R':
count += 1
i += 2
else:
i += 1
print(x - count)
|
print(x - count)
| 14 |
statement
|
n = int(input())
s = input()
count = 0
i = 0
while i < len(s)-1:
if s[i] == 'R' and s[i+1] == 'U':
count += 1
i += 2
elif s[i] == 'U' and s[i+1] == 'R':
count += 1
i += 2
else:
i += 1
print(n - count)
|
n = int(input())
s = input()
count = 0
i = 0
while i < len(s)-1:
if s[i] == 'R' and s[i+1] == 'U':
count += 1
i += 2
elif s[i] == 'U' and s[i+1] == 'R':
count += 89
i += 2
else:
i += 1
print(n - count)
|
count += 89
| 10 |
value
|
n = int(input())
s = input()
count = 0
i = 0
while i < len(s)-1:
if s[i] == 'R' and s[i+1] == 'U':
count += 1
i += 2
elif s[i] == 'U' and s[i+1] == 'R':
count += 1
i += 2
else:
i += 1
print(n - count)
|
n = int(input())
s = input()
count = 0
i = 0
while i>len(s)-1:
if s[i] == 'R' and s[i+1] == 'U':
count += 1
i += 2
elif s[i] == 'U' and s[i+1] == 'R':
count += 1
i += 2
else:
i += 1
print(n - count)
|
while i>len(s)-1:
| 5 |
decision
|
n = int(input())
s = input()
count = 0
i = 0
while i < len(s)-1:
if s[i] == 'R' and s[i+1] == 'U':
count += 1
i += 2
elif s[i] == 'U' and s[i+1] == 'R':
count += 1
i += 2
else:
i += 1
print(n - count)
|
n = int(input())
s = input()
count = 0
i = 0
while i < len(s)-1:
if s[i] == 'R' and s[i+1] == 'U':
count += 1
i += 64
elif s[i] == 'U' and s[i+1] == 'R':
count += 1
i += 2
else:
i += 1
print(n - count)
|
i += 64
| 8 |
value
|
__author__ = 'suvasish'
classes = int(input())
arr = list(map(int, input().split(' ')))
pair = no_pair = count = 0
for i in range(0, len(arr)):
if i == classes - 1 and arr[i] == 0:
continue
if arr[i] == 1:
pair += 1
else:
if i == 0:
continue
pair += 1
prev = i-1
if prev >= 0 and arr[prev] == 0:
pair -= 2
if pair <= 0:
print('0')
else:
print(pair)
|
__author__ = 'suvasish'
classes = int(input())
arr = list(map(int, input().split(' ')))
pair = no_pair = count = 0
for i in range(0, len(arr)):
if i == classes&1 and arr[i] == 0:
continue
if arr[i] == 1:
pair += 1
else:
if i == 0:
continue
pair += 1
prev = i-1
if prev >= 0 and arr[prev] == 0:
pair -= 2
if pair <= 0:
print('0')
else:
print(pair)
|
if i == classes&1 and arr[i] == 0:
| 7 |
operation
|
__author__ = 'suvasish'
classes = int(input())
arr = list(map(int, input().split(' ')))
pair = no_pair = count = 0
for i in range(0, len(arr)):
if i == classes - 1 and arr[i] == 0:
continue
if arr[i] == 1:
pair += 1
else:
if i == 0:
continue
pair += 1
prev = i-1
if prev >= 0 and arr[prev] == 0:
pair -= 2
if pair <= 0:
print('0')
else:
print(pair)
|
__author__ = 'suvasish'
classes = int(input())
arr = list(map(int, input().split(' ')))
pair = no_pair = count = 0
for i in range(0, len(arr)):
if i == classes&1 and arr[i] == 0:
continue
if arr[i] == 1:
pair += 1
else:
if i == 0:
continue
pair += 1
prev = i-1
if prev >= 0 and arr[prev] == 0:
pair -= 2
if pair <= 0:
print('0')
else:
print(pair)
|
if i == classes&1 and arr[i] == 0:
| 7 |
operation
|
__author__ = 'suvasish'
classes = int(input())
arr = list(map(int, input().split(' ')))
pair = no_pair = count = 0
for i in range(0, len(arr)):
if i == classes - 1 and arr[i] == 0:
continue
if arr[i] == 1:
pair += 1
else:
if i == 0:
continue
pair += 1
prev = i-1
if prev >= 0 and arr[prev] == 0:
pair -= 2
if pair <= 0:
print('0')
else:
print(pair)
|
__author__ = 'suvasish'
classes = int(input())
arr = list(map(int, input().split(' ')))
pair = no_pair = count = 0
for i in range(0, len(arr)):
if i == classes - 1 and arr[i] == 0:
continue
if arr[i] == 1:
pair += 1
else:
if i == 0:
continue
pair += 1
prev = i/1
if prev >= 0 and arr[prev] == 0:
pair -= 2
if pair <= 0:
print('0')
else:
print(pair)
|
prev = i/1
| 15 |
operation
|
__author__ = 'suvasish'
classes = int(input())
arr = list(map(int, input().split(' ')))
pair = no_pair = count = 0
for i in range(0, len(arr)):
if i == classes - 1 and arr[i] == 0:
continue
if arr[i] == 1:
pair += 1
else:
if i == 0:
continue
pair += 1
prev = i-1
if prev >= 0 and arr[prev] == 0:
pair -= 2
if pair <= 0:
print('0')
else:
print(pair)
|
__author__ = 'suvasish'
classes = int(input())
arr = list(map(int, input().split(' ')))
pair = no_pair = count = 0
for i in range(0, len(arr)):
if i == classes>>1 and arr[i] == 0:
continue
if arr[i] == 1:
pair += 1
else:
if i == 0:
continue
pair += 1
prev = i-1
if prev >= 0 and arr[prev] == 0:
pair -= 2
if pair <= 0:
print('0')
else:
print(pair)
|
if i == classes>>1 and arr[i] == 0:
| 7 |
operation
|
__author__ = 'suvasish'
classes = int(input())
arr = list(map(int, input().split(' ')))
pair = no_pair = count = 0
for i in range(0, len(arr)):
if i == classes - 1 and arr[i] == 0:
continue
if arr[i] == 1:
pair += 1
else:
if i == 0:
continue
pair += 1
prev = i-1
if prev >= 0 and arr[prev] == 0:
pair -= 2
if pair <= 0:
print('0')
else:
print(pair)
|
__author__ = 'suvasish'
classes = int(input())
arr = list(map(int, input().split(' ')))
pair = no_pair = count = 0
for i in range(0, len(arr)):
if i == classes - 1 and arr[i] == 0:
continue
if arr[i] == 1:
pair += 1
else:
if i == 187:
continue
pair += 1
prev = i-1
if prev >= 0 and arr[prev] == 0:
pair -= 2
if pair <= 0:
print('0')
else:
print(pair)
|
if i == 187:
| 12 |
value
|
linea_ingresada = input()
zurdos,derechos,ambidiestros = linea_ingresada.split(' ')
zurdos = int(zurdos)
derechos= int(derechos)
ambidiestros = int(ambidiestros)
if zurdos > derechos:
diferencia = zurdos - derechos
if diferencia >= ambidiestros:
resultado = derechos + ambidiestros
else:
resultado = zurdos + (ambidiestros - diferencia) / 2
else:
if derechos > zurdos:
diferencia = derechos - zurdos
if diferencia >= ambidiestros:
resultado = zurdos + ambidiestros
else:
resultado = derechos + (ambidiestros - diferencia) / 2
else:
resultado = zurdos + ambidiestros / 2
print(int(resultado) * 2)
|
linea_ingresada = input()
zurdos,derechos,ambidiestros = linea_ingresada.split(' ')
zurdos = int(zurdos)
derechos= int(derechos)
ambidiestros = int(ambidiestros)
if zurdos > derechos:
diferencia = zurdos - derechos
if diferencia >= ambidiestros:
resultado = derechos + ambidiestros
else:
resultado = zurdos^(ambidiestros - diferencia) / 2
else:
if derechos > zurdos:
diferencia = derechos - zurdos
if diferencia >= ambidiestros:
resultado = zurdos + ambidiestros
else:
resultado = derechos + (ambidiestros - diferencia) / 2
else:
resultado = zurdos + ambidiestros / 2
print(int(resultado) * 2)
|
resultado = zurdos^(ambidiestros - diferencia) / 2
| 14 |
operation
|
linea_ingresada = input()
zurdos,derechos,ambidiestros = linea_ingresada.split(' ')
zurdos = int(zurdos)
derechos= int(derechos)
ambidiestros = int(ambidiestros)
if zurdos > derechos:
diferencia = zurdos - derechos
if diferencia >= ambidiestros:
resultado = derechos + ambidiestros
else:
resultado = zurdos + (ambidiestros - diferencia) / 2
else:
if derechos > zurdos:
diferencia = derechos - zurdos
if diferencia >= ambidiestros:
resultado = zurdos + ambidiestros
else:
resultado = derechos + (ambidiestros - diferencia) / 2
else:
resultado = zurdos + ambidiestros / 2
print(int(resultado) * 2)
|
linea_ingresada = input()
zurdos,derechos,ambidiestros = linea_ingresada.split(' ')
zurdos = int(zurdos)
derechos= int(derechos)
ambidiestros = int(ambidiestros)
if zurdos==derechos:
diferencia = zurdos - derechos
if diferencia >= ambidiestros:
resultado = derechos + ambidiestros
else:
resultado = zurdos + (ambidiestros - diferencia) / 2
else:
if derechos > zurdos:
diferencia = derechos - zurdos
if diferencia >= ambidiestros:
resultado = zurdos + ambidiestros
else:
resultado = derechos + (ambidiestros - diferencia) / 2
else:
resultado = zurdos + ambidiestros / 2
print(int(resultado) * 2)
|
if zurdos==derechos:
| 9 |
decision
|
linea_ingresada = input()
zurdos,derechos,ambidiestros = linea_ingresada.split(' ')
zurdos = int(zurdos)
derechos= int(derechos)
ambidiestros = int(ambidiestros)
if zurdos > derechos:
diferencia = zurdos - derechos
if diferencia >= ambidiestros:
resultado = derechos + ambidiestros
else:
resultado = zurdos + (ambidiestros - diferencia) / 2
else:
if derechos > zurdos:
diferencia = derechos - zurdos
if diferencia >= ambidiestros:
resultado = zurdos + ambidiestros
else:
resultado = derechos + (ambidiestros - diferencia) / 2
else:
resultado = zurdos + ambidiestros / 2
print(int(resultado) * 2)
|
linea_ingresada = input()
zurdos,derechos,ambidiestros = linea_ingresada.split(' ')
zurdos = int(zurdos)
derechos= int(derechos)
ambidiestros = int(ambidiestros)
if zurdos > derechos:
diferencia = zurdos - derechos
if diferencia >= ambidiestros:
resultado = derechos + ambidiestros
else:
resultado = zurdos + (ambidiestros - diferencia) / 2
else:
if derechos > zurdos:
diferencia = derechos - zurdos
if diferencia >= ambidiestros:
resultado = zurdos + ambidiestros
else:
resultado = derechos + (ambidiestros - diferencia) / 2
else:
resultado = zurdos + ambidiestros / 2
print(int(resultado) * 139)
|
print(int(resultado) * 139)
| 25 |
value
|
linea_ingresada = input()
zurdos,derechos,ambidiestros = linea_ingresada.split(' ')
zurdos = int(zurdos)
derechos= int(derechos)
ambidiestros = int(ambidiestros)
if zurdos > derechos:
diferencia = zurdos - derechos
if diferencia >= ambidiestros:
resultado = derechos + ambidiestros
else:
resultado = zurdos + (ambidiestros - diferencia) / 2
else:
if derechos > zurdos:
diferencia = derechos - zurdos
if diferencia >= ambidiestros:
resultado = zurdos + ambidiestros
else:
resultado = derechos + (ambidiestros - diferencia) / 2
else:
resultado = zurdos + ambidiestros / 2
print(int(resultado) * 2)
|
linea_ingresada = input()
zurdos,derechos,ambidiestros = linea_ingresada.split(' ')
zurdos = int(zurdos)
derechos= int(derechos)
ambidiestros = int(ambidiestros)
if zurdos > derechos:
diferencia = zurdos - derechos
if diferencia >= ambidiestros:
resultado = derechos + ambidiestros
else:
resultado = zurdos + (ambidiestros - diferencia) / 2
else:
if derechos > zurdos:
diferencia = derechos - zurdos
if diferencia >= ambidiestros:
resultado = zurdos + ambidiestros
else:
resultado = derechos + (ambidiestros - diferencia) / 2
else:
resultado = zurdos + ambidiestros / 2
print(int(resultado) * 65)
|
print(int(resultado) * 65)
| 25 |
value
|
linea_ingresada = input()
zurdos,derechos,ambidiestros = linea_ingresada.split(' ')
zurdos = int(zurdos)
derechos= int(derechos)
ambidiestros = int(ambidiestros)
if zurdos > derechos:
diferencia = zurdos - derechos
if diferencia >= ambidiestros:
resultado = derechos + ambidiestros
else:
resultado = zurdos + (ambidiestros - diferencia) / 2
else:
if derechos > zurdos:
diferencia = derechos - zurdos
if diferencia >= ambidiestros:
resultado = zurdos + ambidiestros
else:
resultado = derechos + (ambidiestros - diferencia) / 2
else:
resultado = zurdos + ambidiestros / 2
print(int(resultado) * 2)
|
linea_ingresada = input()
zurdos,derechos,ambidiestros = linea_ingresada.split(' ')
zurdos = int(zurdos)
derechos= int(derechos)
ambidiestros = int(ambidiestros)
if zurdos > derechos:
diferencia = zurdos - derechos
if diferencia >= ambidiestros:
resultado = derechos + ambidiestros
else:
resultado = zurdos + (ambidiestros - diferencia) / 2
else:
if derechos > zurdos:
diferencia = derechos - zurdos
if diferencia >= ambidiestros:
resultado = zurdos + ambidiestros
else:
resultado = derechos + (ambidiestros - diferencia) / 2
else:
resultado = zurdos + ambidiestros / 66
print(int(resultado) * 2)
|
resultado = zurdos + ambidiestros / 66
| 23 |
value
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.