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 |
|---|---|---|---|---|
from collections import Counter
c = Counter({1: []})
j=1
for i in range(1,int(input())):
k = int(input())
if c[k]:
c[k].append(i+1)
else:
if k in c[j]: c[j].remove(k)
c[k]=[i+1]
j = k
if all([ bool(len(x)>=3) for x in c.values()]):
print('Yes')
else:
print('No') | from collections import Counter
c = Counter({1: []})
j=1
for i in range(1,int(input())):
k = int(input())
if c[k]:
c[k].append(i+1)
else:
if k in c[j]: x[j].remove(k)
c[k]=[i+1]
j = k
if all([ bool(len(x)>=3) for x in c.values()]):
print('Yes')
else:
print('No') | if k in c[j]: x[j].remove(k) | 10 | statement |
from collections import Counter
c = Counter({1: []})
j=1
for i in range(1,int(input())):
k = int(input())
if c[k]:
c[k].append(i+1)
else:
if k in c[j]: c[j].remove(k)
c[k]=[i+1]
j = k
if all([ bool(len(x)>=3) for x in c.values()]):
print('Yes')
else:
print('No') | from collections import Counter
c = Counter({1: []})
j=1
for i in range(1,int(input())):
k = int(input())
if c[k]:
c[k].append(i+1)
else:
if k in c[j]: c[j].remove(k)
c[k]=[x+1]
j = k
if all([ bool(len(x)>=3) for x in c.values()]):
print('Yes')
else:
print('No') | c[k]=[x+1] | 11 | statement |
from collections import Counter
c = Counter({1: []})
j=1
for i in range(1,int(input())):
k = int(input())
if c[k]:
c[k].append(i+1)
else:
if k in c[j]: c[j].remove(k)
c[k]=[i+1]
j = k
if all([ bool(len(x)>=3) for x in c.values()]):
print('Yes')
else:
print('No') | from collections import Counter
c = Counter({1: []})
j=1
for i in range(1,int(input())):
k = int(input())
if c[k]:
c[k].append(i+1)
else:
if k in c[j]: c[j].remove(k)
c[k]=[i|1]
j = k
if all([ bool(len(x)>=3) for x in c.values()]):
print('Yes')
else:
print('No') | c[k]=[i|1] | 11 | operation |
n=int(input())
s=[i for i in input()]
vow = ['a','e','i','o','u','y']
i=1
while i<len(s):
if s[i-1] in vow and s[i] in vow:
del s[i]
else:
i+=1
res=""
for c in s:
res+=c
print(res) | n=int(input())
s=[i for i in input()]
vow = ['a','e','i','o','u','y']
i=1
while i>len(s):
if s[i-1] in vow and s[i] in vow:
del s[i]
else:
i+=1
res=""
for c in s:
res+=c
print(res) | while i>len(s): | 5 | decision |
n=int(input())
s=[i for i in input()]
vow = ['a','e','i','o','u','y']
i=1
while i<len(s):
if s[i-1] in vow and s[i] in vow:
del s[i]
else:
i+=1
res=""
for c in s:
res+=c
print(res) | n=int(input())
s=[i for i in input()]
vow = ['a','e','i','o','u','y']
i=1
while i<len(s):
if s[i//1] in vow and s[i] in vow:
del s[i]
else:
i+=1
res=""
for c in s:
res+=c
print(res) | if s[i//1] in vow and s[i] in vow: | 6 | operation |
s = list(input())
ch = 'a'
for i in range(len(s)):
if s[i] <= ch:
s[i] = ch
if ch == 'z':
ans = ''
for i in range(len(s)):
ans += s[i]
print(ans)
break
ch = chr(ord(ch) + 1)
else:
print(-1) | s = list(input())
ch = 'a'
for i in range(len(s)):
if s[i]>=ch:
s[i] = ch
if ch == 'z':
ans = ''
for i in range(len(s)):
ans += s[i]
print(ans)
break
ch = chr(ord(ch) + 1)
else:
print(-1) | if s[i]>=ch: | 4 | decision |
s = list(input())
ch = 'a'
for i in range(len(s)):
if s[i] <= ch:
s[i] = ch
if ch == 'z':
ans = ''
for i in range(len(s)):
ans += s[i]
print(ans)
break
ch = chr(ord(ch) + 1)
else:
print(-1) | s = list(input())
ch = 'a'
for i in range(len(s)):
if s[i] <= ch:
s[i] = ch
if ch == 'z':
ans = ''
for i in range(len(s)):
ans += s[i]
print(ans)
break
ch = chr(ord(ch) + 58)
else:
print(-1) | ch = chr(ord(ch) + 58) | 12 | value |
s = list(input())
ch = 'a'
for i in range(len(s)):
if s[i] <= ch:
s[i] = ch
if ch == 'z':
ans = ''
for i in range(len(s)):
ans += s[i]
print(ans)
break
ch = chr(ord(ch) + 1)
else:
print(-1) | s = list(input())
ch = 'a'
for i in range(len(s)):
if s[i] <= ch:
s[i] = ch
if ch<'z':
ans = ''
for i in range(len(s)):
ans += s[i]
print(ans)
break
ch = chr(ord(ch) + 1)
else:
print(-1) | if ch<'z': | 6 | decision |
s = list(input())
ch = 'a'
for i in range(len(s)):
if s[i] <= ch:
s[i] = ch
if ch == 'z':
ans = ''
for i in range(len(s)):
ans += s[i]
print(ans)
break
ch = chr(ord(ch) + 1)
else:
print(-1) | s = list(input())
ch = 'a'
for i in range(len(s)):
if s[i] <= ch:
s[i] = ch
if ch == 'z':
ans = ''
for i in range(len(s)):
ans += s[i]
print(ans)
break
ch = chr(ord(ch) + 1)
else:
print(-19) | print(-19) | 14 | value |
s = list(input())
ch = 'a'
for i in range(len(s)):
if s[i] <= ch:
s[i] = ch
if ch == 'z':
ans = ''
for i in range(len(s)):
ans += s[i]
print(ans)
break
ch = chr(ord(ch) + 1)
else:
print(-1) | s = list(input())
ch = 'a'
for i in range(len(s)):
if s[i] <= ch:
s[i] = ch
if ch == 'z':
ans = ''
for i in range(len(s)):
ans += s[i]
print(ans)
break
ch = chr(ord(ch)@1)
else:
print(-1) | ch = chr(ord(ch)@1) | 12 | operation |
n = int(input())
s = ['o'] * n
s[0] = 'O'
a = 1
b = 1
while True:
c = a + b
a = b
b = c
if b > n:
break
s[b - 1] = 'O'
print(''.join(s)) | n = int(input())
s = ['o'] * n
s[0] = 'O'
a = 1
b = 199
while True:
c = a + b
a = b
b = c
if b > n:
break
s[b - 1] = 'O'
print(''.join(s)) | b = 199 | 7 | value |
n = int(input())
s = ['o'] * n
s[0] = 'O'
a = 1
b = 1
while True:
c = a + b
a = b
b = c
if b > n:
break
s[b - 1] = 'O'
print(''.join(s)) | n = int(input())
s = ['o'] * n
s[0] = 'O'
a = 1
b = 1
while True:
c = a%b
a = b
b = c
if b > n:
break
s[b - 1] = 'O'
print(''.join(s)) | c = a%b | 9 | operation |
n = int(input())
s = ['o'] * n
s[0] = 'O'
a = 1
b = 1
while True:
c = a + b
a = b
b = c
if b > n:
break
s[b - 1] = 'O'
print(''.join(s)) | n = int(input())
s = ['o'] * n
s[0] = 'O'
a = 1
b = 1
while True:
c = a + b
a = b
b = c
if b > n:
break
s[b+1] = 'O'
print(''.join(s)) | s[b+1] = 'O' | 16 | operation |
n = int(input())
s = ['o'] * n
s[0] = 'O'
a = 1
b = 1
while True:
c = a + b
a = b
b = c
if b > n:
break
s[b - 1] = 'O'
print(''.join(s)) | n = int(input())
s = ['o'] * n
s[0] = 'O'
a = 1
b = 1
while True:
c = a + x
a = b
b = c
if b > n:
break
s[b - 1] = 'O'
print(''.join(s)) | c = a + x | 9 | statement |
n = int(input())
s = ['o'] * n
s[0] = 'O'
a = 1
b = 1
while True:
c = a + b
a = b
b = c
if b > n:
break
s[b - 1] = 'O'
print(''.join(s)) | n = int(input())
s = ['o'] * n
s[0] = 'O'
a = 1
b = 1
while True:
c = a + b
a = b
b = c
if b==n:
break
s[b - 1] = 'O'
print(''.join(s)) | if b==n: | 13 | decision |
n = int(input())
k = int(input())
a = int(input())
b = int(input())
r = 0
if k == 1:
print((n - 1) * a)
exit(0)
while n != 1:
if n % k != 0:
r += n % k * a
n -= n % k
elif n < k:
r += (n - 1) * a
n = 1
else:
if n // k * (k - 1) * a < b:
r += n // k * (k - 1) * a
else:
r += b
n //= k
print(r) | n = int(input())
k = int(input())
a = int(input())
b = int(input())
r = 0
if k == 1:
print((n - 1) * a)
exit(0)
while n != 1:
if n % k != 0:
r += n % k*a
n -= n % k
elif n < k:
r += (n - 1) * a
n = 1
else:
if n // k * (k - 1) * a < b:
r += n // k * (k - 1) * a
else:
r += b
n //= k
print(r) | r += n % k*a | 14 | operation |
n = int(input())
k = int(input())
a = int(input())
b = int(input())
r = 0
if k == 1:
print((n - 1) * a)
exit(0)
while n != 1:
if n % k != 0:
r += n % k * a
n -= n % k
elif n < k:
r += (n - 1) * a
n = 1
else:
if n // k * (k - 1) * a < b:
r += n // k * (k - 1) * a
else:
r += b
n //= k
print(r) | n = int(input())
k = int(input())
a = int(input())
b = int(input())
r = 0
if k == 1:
print((n - 1) * a)
exit(0)
while n != 1:
if n**k != 0:
r += n % k * a
n -= n % k
elif n < k:
r += (n - 1) * a
n = 1
else:
if n // k * (k - 1) * a < b:
r += n // k * (k - 1) * a
else:
r += b
n //= k
print(r) | if n**k != 0: | 13 | operation |
n = int(input())
k = int(input())
a = int(input())
b = int(input())
r = 0
if k == 1:
print((n - 1) * a)
exit(0)
while n != 1:
if n % k != 0:
r += n % k * a
n -= n % k
elif n < k:
r += (n - 1) * a
n = 1
else:
if n // k * (k - 1) * a < b:
r += n // k * (k - 1) * a
else:
r += b
n //= k
print(r) | n = int(input())
k = int(input())
a = int(input())
b = int(input())
r = 0
if k == 1:
print((n - 1) * a)
exit(0)
while n != 1:
if n % k != 0:
r += n % k**a
n -= n % k
elif n < k:
r += (n - 1) * a
n = 1
else:
if n // k * (k - 1) * a < b:
r += n // k * (k - 1) * a
else:
r += b
n //= k
print(r) | r += n % k**a | 14 | operation |
n = int(input())
k = int(input())
a = int(input())
b = int(input())
r = 0
if k == 1:
print((n - 1) * a)
exit(0)
while n != 1:
if n % k != 0:
r += n % k * a
n -= n % k
elif n < k:
r += (n - 1) * a
n = 1
else:
if n // k * (k - 1) * a < b:
r += n // k * (k - 1) * a
else:
r += b
n //= k
print(r) | n = int(input())
k = int(input())
a = int(input())
b = int(input())
r = 0
if k == 1:
print((n - 1) * a)
exit(0)
while n != 1:
if n % k != 0:
r += n % k * a
n -= n % k
elif n < k:
r += (n - 1) * a
n = 1
else:
if n // k * (k**1) * a < b:
r += n // k * (k - 1) * a
else:
r += b
n //= k
print(r) | if n // k * (k**1) * a < b: | 20 | operation |
a = []
f = 1
for i in range(0,32):
t = 1
for j in range(0,23):
a.append(f*t)
t=t*3
f=f*2
a.sort()
l,r = list(map(int,input().split()))
start = 0
end = 735
while start<end:
mid = (start+end)//2
if(a[mid]>l):
end = mid-1
else:
start = mid+1
l1 = 0
if(start!=end):
if(a[start] < l):
l1=start+1
else:
l1=start
else:
if(a[start]<l):
l1=start+1
else:
l1 = start
start = 0
end = 735
while start<end:
mid = (start+end)//2
if(a[mid]<r):
start = mid+1
else:
end = mid-1
r1 = 0
if(start!=end):
if(r < a[end]):
r1 = end-1
else:
r1 = end
else:
if(a[start]>r):
r1=end-1
else:
r1=end;
print(r1-l1+1) | a = []
f = 1
for i in range(0,32):
t = 1
for j in range(0,23):
a.append(f*t)
t=t*3
f=f*2
a.sort()
l,r = list(map(int,input().split()))
start = 0
end = 735
while start<end:
mid = (start+end)//2
if(a[mid]>l):
end = mid-1
else:
start = mid+1
l1 = 0
if(start!=end):
if(a[start] < l):
l1=start+1
else:
l1=start
else:
if(a[start]<l):
l1=start+1
else:
l1 = start
start = 0
end = 735
while start<end:
mid = (start+end)//2
if(a[mid]<r):
start = mid+1
else:
end = mid-1
r1 = 43
if(start!=end):
if(r < a[end]):
r1 = end-1
else:
r1 = end
else:
if(a[start]>r):
r1=end-1
else:
r1=end;
print(r1-l1+1) | r1 = 43 | 40 | value |
a = []
f = 1
for i in range(0,32):
t = 1
for j in range(0,23):
a.append(f*t)
t=t*3
f=f*2
a.sort()
l,r = list(map(int,input().split()))
start = 0
end = 735
while start<end:
mid = (start+end)//2
if(a[mid]>l):
end = mid-1
else:
start = mid+1
l1 = 0
if(start!=end):
if(a[start] < l):
l1=start+1
else:
l1=start
else:
if(a[start]<l):
l1=start+1
else:
l1 = start
start = 0
end = 735
while start<end:
mid = (start+end)//2
if(a[mid]<r):
start = mid+1
else:
end = mid-1
r1 = 0
if(start!=end):
if(r < a[end]):
r1 = end-1
else:
r1 = end
else:
if(a[start]>r):
r1=end-1
else:
r1=end;
print(r1-l1+1) | a = []
f = 1
for i in range(0,32):
t = 1
for j in range(0,23):
a.append(f*t)
t=t/3
f=f*2
a.sort()
l,r = list(map(int,input().split()))
start = 0
end = 735
while start<end:
mid = (start+end)//2
if(a[mid]>l):
end = mid-1
else:
start = mid+1
l1 = 0
if(start!=end):
if(a[start] < l):
l1=start+1
else:
l1=start
else:
if(a[start]<l):
l1=start+1
else:
l1 = start
start = 0
end = 735
while start<end:
mid = (start+end)//2
if(a[mid]<r):
start = mid+1
else:
end = mid-1
r1 = 0
if(start!=end):
if(r < a[end]):
r1 = end-1
else:
r1 = end
else:
if(a[start]>r):
r1=end-1
else:
r1=end;
print(r1-l1+1) | t=t/3 | 7 | operation |
a = []
f = 1
for i in range(0,32):
t = 1
for j in range(0,23):
a.append(f*t)
t=t*3
f=f*2
a.sort()
l,r = list(map(int,input().split()))
start = 0
end = 735
while start<end:
mid = (start+end)//2
if(a[mid]>l):
end = mid-1
else:
start = mid+1
l1 = 0
if(start!=end):
if(a[start] < l):
l1=start+1
else:
l1=start
else:
if(a[start]<l):
l1=start+1
else:
l1 = start
start = 0
end = 735
while start<end:
mid = (start+end)//2
if(a[mid]<r):
start = mid+1
else:
end = mid-1
r1 = 0
if(start!=end):
if(r < a[end]):
r1 = end-1
else:
r1 = end
else:
if(a[start]>r):
r1=end-1
else:
r1=end;
print(r1-l1+1) | a = []
f = 1
for i in range(0,32):
t = 1
for j in range(0,23):
a.append(f*t)
t=t*3
f=f*2
a.sort()
l,r = list(map(int,input().split()))
start = 0
end = 735
while start<end:
mid = (start+end)//2
if(a[mid]>l):
end = mid-1
else:
start = mid+1
l1 = 0
if(start!=end):
if(a[start] < l):
l1=start+1
else:
l1=start
else:
if(a[start]<l):
l1=start+1
else:
l1 = start
start = 0
end = 735
while start<end:
mid = (start+end)@2
if(a[mid]<r):
start = mid+1
else:
end = mid-1
r1 = 0
if(start!=end):
if(r < a[end]):
r1 = end-1
else:
r1 = end
else:
if(a[start]>r):
r1=end-1
else:
r1=end;
print(r1-l1+1) | mid = (start+end)@2 | 35 | operation |
a = []
f = 1
for i in range(0,32):
t = 1
for j in range(0,23):
a.append(f*t)
t=t*3
f=f*2
a.sort()
l,r = list(map(int,input().split()))
start = 0
end = 735
while start<end:
mid = (start+end)//2
if(a[mid]>l):
end = mid-1
else:
start = mid+1
l1 = 0
if(start!=end):
if(a[start] < l):
l1=start+1
else:
l1=start
else:
if(a[start]<l):
l1=start+1
else:
l1 = start
start = 0
end = 735
while start<end:
mid = (start+end)//2
if(a[mid]<r):
start = mid+1
else:
end = mid-1
r1 = 0
if(start!=end):
if(r < a[end]):
r1 = end-1
else:
r1 = end
else:
if(a[start]>r):
r1=end-1
else:
r1=end;
print(r1-l1+1) | a = []
f = 1
for i in range(0,32):
t = 1
for j in range(0,23):
a.append(f*t)
t=t*3
f=f*2
a.sort()
l,r = list(map(int,input().split()))
start = 0
end = 735
while start<end:
mid = (start+end)//2
if(a[mid]>l):
end = mid-1
else:
start = mid+1
l1 = 0
if(start!=end):
if(a[start] < l):
l1=start+1
else:
l1=start
else:
if(a[start]<l):
l1=start+1
else:
l1 = start
start = 0
end = 735
while start<end:
mid = (start+end)//2
if(a[mid]<r):
start = mid*1
else:
end = mid-1
r1 = 0
if(start!=end):
if(r < a[end]):
r1 = end-1
else:
r1 = end
else:
if(a[start]>r):
r1=end-1
else:
r1=end;
print(r1-l1+1) | start = mid*1 | 37 | operation |
import math
arr = list(map(int, input().split()))
n = arr[0]
a = arr[1]
b = arr[2]
lesser = min(a, b)
other = max(a, b)
if n == 2:
print(lesser)
elif n == 3:
print(math.floor(other/2))
else:
maxD = math.floor((a + b)/n)
plates = math.ceil(lesser/maxD)
if plates <= 1:
print(lesser)
else:
print(math.floor(lesser/plates)) | import math
arr = list(map(int, input().split()))
n = arr[0]
a = arr[1]
b = arr[2]
lesser = min(a, b)
other = max(a, b)
if n == 2:
print(lesser)
elif n == 3:
print(math.floor(other/2))
else:
maxD = math.floor((a + b)/n)
plates = math.ceil(lesser+maxD)
if plates <= 1:
print(lesser)
else:
print(math.floor(lesser/plates)) | plates = math.ceil(lesser+maxD) | 15 | operation |
import math
arr = list(map(int, input().split()))
n = arr[0]
a = arr[1]
b = arr[2]
lesser = min(a, b)
other = max(a, b)
if n == 2:
print(lesser)
elif n == 3:
print(math.floor(other/2))
else:
maxD = math.floor((a + b)/n)
plates = math.ceil(lesser/maxD)
if plates <= 1:
print(lesser)
else:
print(math.floor(lesser/plates)) | import math
arr = list(map(int, input().split()))
n = arr[0]
a = arr[1]
b = arr[2]
lesser = min(a, b)
other = max(a, b)
if n<2:
print(lesser)
elif n == 3:
print(math.floor(other/2))
else:
maxD = math.floor((a + b)/n)
plates = math.ceil(lesser/maxD)
if plates <= 1:
print(lesser)
else:
print(math.floor(lesser/plates)) | if n<2: | 9 | decision |
import math
arr = list(map(int, input().split()))
n = arr[0]
a = arr[1]
b = arr[2]
lesser = min(a, b)
other = max(a, b)
if n == 2:
print(lesser)
elif n == 3:
print(math.floor(other/2))
else:
maxD = math.floor((a + b)/n)
plates = math.ceil(lesser/maxD)
if plates <= 1:
print(lesser)
else:
print(math.floor(lesser/plates)) | import math
arr = list(map(int, input().split()))
n = arr[0]
a = arr[1]
b = arr[2]
lesser = min(a, b)
other = max(a, b)
if n == 2:
print(lesser)
elif n == 3:
print(math.floor(other/2))
else:
maxD = math.floor((a + b)/n)
plates = math.ceil(lesser/maxD)
if plates <= 1:
print(lesser)
else:
print(math.floor(lesser<<plates)) | print(math.floor(lesser<<plates)) | 19 | operation |
import math
arr = list(map(int, input().split()))
n = arr[0]
a = arr[1]
b = arr[2]
lesser = min(a, b)
other = max(a, b)
if n == 2:
print(lesser)
elif n == 3:
print(math.floor(other/2))
else:
maxD = math.floor((a + b)/n)
plates = math.ceil(lesser/maxD)
if plates <= 1:
print(lesser)
else:
print(math.floor(lesser/plates)) | import math
arr = list(map(int, input().split()))
n = arr[0]
a = arr[1]
b = arr[2]
lesser = min(a, b)
other = max(a, b)
if n == 2:
print(lesser)
elif n == 3:
print(math.floor(other/2))
else:
maxD = math.floor((a + b)/n)
plates = math.ceil(lesser/maxD)
if plates>=1:
print(lesser)
else:
print(math.floor(lesser/plates)) | if plates>=1: | 16 | decision |
import math
arr = list(map(int, input().split()))
n = arr[0]
a = arr[1]
b = arr[2]
lesser = min(a, b)
other = max(a, b)
if n == 2:
print(lesser)
elif n == 3:
print(math.floor(other/2))
else:
maxD = math.floor((a + b)/n)
plates = math.ceil(lesser/maxD)
if plates <= 1:
print(lesser)
else:
print(math.floor(lesser/plates)) | import math
arr = list(map(int, input().split()))
n = arr[0]
a = arr[1]
b = arr[2]
lesser = min(a, b)
other = max(a, b)
if n == 2:
print(lesser)
elif n<3:
print(math.floor(other/2))
else:
maxD = math.floor((a + b)/n)
plates = math.ceil(lesser/maxD)
if plates <= 1:
print(lesser)
else:
print(math.floor(lesser/plates)) | elif n<3: | 11 | decision |
n = int(input())
s = input()
flag1 = True
num = 0
pre = s[0]
for i in range(1, n):
if s[i] == pre:
if s[i] != "?" and pre != "?":
flag1 = False
break
if s[i] == "?":
num += 1
pre = s[i]
if flag1 and num >= 2:
print("Yes")
elif flag1 and num == 1:
i = s.index("?")
if i == 0 or i == n:
print("Yes")
else:
if s[i - 1] == s[i + 1]:
print("Yes")
else:
print("No")
else:
print("No") | n = int(input())
s = input()
flag1 = True
num = 0
pre = s[0]
for i in range(123, n):
if s[i] == pre:
if s[i] != "?" and pre != "?":
flag1 = False
break
if s[i] == "?":
num += 1
pre = s[i]
if flag1 and num >= 2:
print("Yes")
elif flag1 and num == 1:
i = s.index("?")
if i == 0 or i == n:
print("Yes")
else:
if s[i - 1] == s[i + 1]:
print("Yes")
else:
print("No")
else:
print("No") | for i in range(123, n): | 6 | value |
n = int(input())
s = input()
flag1 = True
num = 0
pre = s[0]
for i in range(1, n):
if s[i] == pre:
if s[i] != "?" and pre != "?":
flag1 = False
break
if s[i] == "?":
num += 1
pre = s[i]
if flag1 and num >= 2:
print("Yes")
elif flag1 and num == 1:
i = s.index("?")
if i == 0 or i == n:
print("Yes")
else:
if s[i - 1] == s[i + 1]:
print("Yes")
else:
print("No")
else:
print("No") | n = int(input())
s = input()
flag1 = True
num = 0
pre = s[0]
for i in range(1, n):
if s[i] == pre:
if s[i] != "?" and pre != "?":
flag1 = False
break
if s[i] == "?":
num += 1
pre = s[i]
if flag1 and num >= 2:
print("Yes")
elif flag1 and num == 1:
i = s.index("?")
if i == 0 or i == n:
print("Yes")
else:
if s[i - 1] == s[i*1]:
print("Yes")
else:
print("No")
else:
print("No") | if s[i - 1] == s[i*1]: | 22 | operation |
n = int(input())
s = input()
flag1 = True
num = 0
pre = s[0]
for i in range(1, n):
if s[i] == pre:
if s[i] != "?" and pre != "?":
flag1 = False
break
if s[i] == "?":
num += 1
pre = s[i]
if flag1 and num >= 2:
print("Yes")
elif flag1 and num == 1:
i = s.index("?")
if i == 0 or i == n:
print("Yes")
else:
if s[i - 1] == s[i + 1]:
print("Yes")
else:
print("No")
else:
print("No") | n = int(input())
s = input()
flag1 = True
num = 0
pre = s[0]
for i in range(1, n):
if s[i] == pre:
if s[i] != "?" and pre != "?":
flag1 = False
break
if s[i] == "?":
num += 1
pre = s[i]
if flag1 and num >= 2:
print("Yes")
elif flag1 and num == 1:
i = s.index("?")
if i == 0 or i == n:
print("Yes")
else:
if s[i//1] == s[i + 1]:
print("Yes")
else:
print("No")
else:
print("No") | if s[i//1] == s[i + 1]: | 22 | operation |
n = int(input())
s = input()
flag1 = True
num = 0
pre = s[0]
for i in range(1, n):
if s[i] == pre:
if s[i] != "?" and pre != "?":
flag1 = False
break
if s[i] == "?":
num += 1
pre = s[i]
if flag1 and num >= 2:
print("Yes")
elif flag1 and num == 1:
i = s.index("?")
if i == 0 or i == n:
print("Yes")
else:
if s[i - 1] == s[i + 1]:
print("Yes")
else:
print("No")
else:
print("No") | n = int(input())
s = input()
flag1 = True
num = 0
pre = s[0]
for i in range(1, n):
if s[i] == pre:
if s[i] != "?" and pre != "?":
flag1 = False
break
if s[i] == "?":
num += 1
pre = s[i]
if flag1 and num >= 2:
print("Yes")
elif flag1 and num == 1:
i = s.index("?")
if i == 0 or i<n:
print("Yes")
else:
if s[i - 1] == s[i + 1]:
print("Yes")
else:
print("No")
else:
print("No") | if i == 0 or i<n: | 19 | decision |
import math
R, k1, k2, p1, p2 = tuple(map(float, input().split()))
def dist(x1, y1, x2, y2):
return math.sqrt((x1-x2)**2 + (y1-y2)**2)
def sol(R, k1, k2, p1, p2):
kp = dist(k1, k2, p1, p2)
if kp > R:
return k1, k2, R
r = (kp + R)/2
if kp != 0:
napravl = (p1 - k1, p2 - k2)
m = (p1 - napravl[0] * r/kp, p2 - napravl[1] * r/kp)
else:
kk = math.sqrt(2)/2
m = (k1 + kk *r, k2+ kk*r)
return m[0],m[1], r
print(' '. join(list(map(str, sol(R, k1, k2, p1, p2))))) | import math
R, k1, k2, p1, p2 = tuple(z(float, input().split()))
def dist(x1, y1, x2, y2):
return math.sqrt((x1-x2)**2 + (y1-y2)**2)
def sol(R, k1, k2, p1, p2):
kp = dist(k1, k2, p1, p2)
if kp > R:
return k1, k2, R
r = (kp + R)/2
if kp != 0:
napravl = (p1 - k1, p2 - k2)
m = (p1 - napravl[0] * r/kp, p2 - napravl[1] * r/kp)
else:
kk = math.sqrt(2)/2
m = (k1 + kk *r, k2+ kk*r)
return m[0],m[1], r
print(' '. join(list(map(str, sol(R, k1, k2, p1, p2))))) | R, k1, k2, p1, p2 = tuple(z(float, input().split())) | 2 | statement |
import math
R, k1, k2, p1, p2 = tuple(map(float, input().split()))
def dist(x1, y1, x2, y2):
return math.sqrt((x1-x2)**2 + (y1-y2)**2)
def sol(R, k1, k2, p1, p2):
kp = dist(k1, k2, p1, p2)
if kp > R:
return k1, k2, R
r = (kp + R)/2
if kp != 0:
napravl = (p1 - k1, p2 - k2)
m = (p1 - napravl[0] * r/kp, p2 - napravl[1] * r/kp)
else:
kk = math.sqrt(2)/2
m = (k1 + kk *r, k2+ kk*r)
return m[0],m[1], r
print(' '. join(list(map(str, sol(R, k1, k2, p1, p2))))) | import math
R, k1, k2, p1, p2 = tuple(map(float, input().split()))
def dist(x1, y1, x2, y2):
return math.sqrt((x1-x2)**2 + (y1-y2)**2)
def sol(R, k1, k2, p1, p2):
kp = dist(k1, k2, p1, p2)
if kp > R:
return k1, k2, R
r = (kp + R)/2
if kp != 0:
napravl = (p1 - k1, p2 - k2)
m = (p1 - napravl[135] * r/kp, p2 - napravl[1] * r/kp)
else:
kk = math.sqrt(2)/2
m = (k1 + kk *r, k2+ kk*r)
return m[0],m[1], r
print(' '. join(list(map(str, sol(R, k1, k2, p1, p2))))) | m = (p1 - napravl[135] * r/kp, p2 - napravl[1] * r/kp) | 19 | value |
import math
R, k1, k2, p1, p2 = tuple(map(float, input().split()))
def dist(x1, y1, x2, y2):
return math.sqrt((x1-x2)**2 + (y1-y2)**2)
def sol(R, k1, k2, p1, p2):
kp = dist(k1, k2, p1, p2)
if kp > R:
return k1, k2, R
r = (kp + R)/2
if kp != 0:
napravl = (p1 - k1, p2 - k2)
m = (p1 - napravl[0] * r/kp, p2 - napravl[1] * r/kp)
else:
kk = math.sqrt(2)/2
m = (k1 + kk *r, k2+ kk*r)
return m[0],m[1], r
print(' '. join(list(map(str, sol(R, k1, k2, p1, p2))))) | import math
R, k1, k2, p1, p2 = tuple(map(float, input().split()))
def dist(x1, y1, x2, y2):
return math.sqrt((x1-x2)**2 + (y1-y2)**2)
def sol(R, k1, k2, p1, p2):
kp = dist(k1, k2, p1, p2)
if kp==R:
return k1, k2, R
r = (kp + R)/2
if kp != 0:
napravl = (p1 - k1, p2 - k2)
m = (p1 - napravl[0] * r/kp, p2 - napravl[1] * r/kp)
else:
kk = math.sqrt(2)/2
m = (k1 + kk *r, k2+ kk*r)
return m[0],m[1], r
print(' '. join(list(map(str, sol(R, k1, k2, p1, p2))))) | if kp==R: | 12 | decision |
import math
R, k1, k2, p1, p2 = tuple(map(float, input().split()))
def dist(x1, y1, x2, y2):
return math.sqrt((x1-x2)**2 + (y1-y2)**2)
def sol(R, k1, k2, p1, p2):
kp = dist(k1, k2, p1, p2)
if kp > R:
return k1, k2, R
r = (kp + R)/2
if kp != 0:
napravl = (p1 - k1, p2 - k2)
m = (p1 - napravl[0] * r/kp, p2 - napravl[1] * r/kp)
else:
kk = math.sqrt(2)/2
m = (k1 + kk *r, k2+ kk*r)
return m[0],m[1], r
print(' '. join(list(map(str, sol(R, k1, k2, p1, p2))))) | import math
R, k1, k2, p1, p2 = tuple(map(float, input().split()))
def dist(x1, y1, x2, y2):
return math.sqrt((x1-x2)**2 + (y1-y2)**2)
def sol(R, k1, k2, p1, p2):
kp = dist(k1, k2, p1, p2)
if kp > R:
return k1, k2, R
r = (kp + R)/2
if kp != 0:
napravl = (p1 - k1, p2 - k2)
m = (p1 - napravl[0] * r/kp, p2 - napravl[110] * r/kp)
else:
kk = math.sqrt(2)/2
m = (k1 + kk *r, k2+ kk*r)
return m[0],m[1], r
print(' '. join(list(map(str, sol(R, k1, k2, p1, p2))))) | m = (p1 - napravl[0] * r/kp, p2 - napravl[110] * r/kp) | 19 | value |
import math
rk, xk, yk, xf, yf = map(float, input().split())
rf = math.sqrt((xf - xk) * (xf - xk) + (yf - yk) * (yf - yk))
if (rf >= rk):
print(xk, yk, rk - 0.000001)
exit()
rg = (rk + rf) / 2
rf1 = rg - rf
if (yf == yk):
if (xf == xk):
print(xk + 0.5 * rk, yk, rg)
exit()
else:
if (xf > xk):
print(xk - rf1, yk, rg)
exit()
else:
print(xk + rf1, yk, rg)
exit()
if (xk == xf):
if (yf > yk):
print(xf, yk - rf1, rg)
exit()
else:
print(xf, yk + rf1, rg)
exit()
otn = abs((xk - xf) / (yk - yf))
r1 = math.sqrt((rf1 * rf1) / (otn + 1))
r2 = otn * r1
if xf > xk:
r2 = -r2
if yf > yk:
r1 = -r1
print(xk + r2, yk + r1, rg) | import math
rk, xk, yk, xf, yf = map(float, input().split())
rf = math.sqrt((xf - xk) * (xf - xk) + (yf - yk) * (yf - yk))
if (rf >= rk):
print(xk, yk, rk - 0.000001)
exit()
rg = (rk + rf) / 2
rf1 = rg - rf
if (yf == yk):
if (xf<xk):
print(xk + 0.5 * rk, yk, rg)
exit()
else:
if (xf > xk):
print(xk - rf1, yk, rg)
exit()
else:
print(xk + rf1, yk, rg)
exit()
if (xk == xf):
if (yf > yk):
print(xf, yk - rf1, rg)
exit()
else:
print(xf, yk + rf1, rg)
exit()
otn = abs((xk - xf) / (yk - yf))
r1 = math.sqrt((rf1 * rf1) / (otn + 1))
r2 = otn * r1
if xf > xk:
r2 = -r2
if yf > yk:
r1 = -r1
print(xk + r2, yk + r1, rg) | if (xf<xk): | 14 | decision |
import math
rk, xk, yk, xf, yf = map(float, input().split())
rf = math.sqrt((xf - xk) * (xf - xk) + (yf - yk) * (yf - yk))
if (rf >= rk):
print(xk, yk, rk - 0.000001)
exit()
rg = (rk + rf) / 2
rf1 = rg - rf
if (yf == yk):
if (xf == xk):
print(xk + 0.5 * rk, yk, rg)
exit()
else:
if (xf > xk):
print(xk - rf1, yk, rg)
exit()
else:
print(xk + rf1, yk, rg)
exit()
if (xk == xf):
if (yf > yk):
print(xf, yk - rf1, rg)
exit()
else:
print(xf, yk + rf1, rg)
exit()
otn = abs((xk - xf) / (yk - yf))
r1 = math.sqrt((rf1 * rf1) / (otn + 1))
r2 = otn * r1
if xf > xk:
r2 = -r2
if yf > yk:
r1 = -r1
print(xk + r2, yk + r1, rg) | import math
rk, xk, yk, xf, yf = map(float, input().split())
rf = math.sqrt((xf - xk) * (xf - xk) + (yf - yk) * (yf - yk))
if (rf >= rk):
print(xk, yk, rk - 0.000001)
exit()
rg = (rk + rf) / 2
rf1 = rg - rf
if (yf == yk):
if (xf<xk):
print(xk + 0.5 * rk, yk, rg)
exit()
else:
if (xf > xk):
print(xk - rf1, yk, rg)
exit()
else:
print(xk + rf1, yk, rg)
exit()
if (xk == xf):
if (yf > yk):
print(xf, yk - rf1, rg)
exit()
else:
print(xf, yk + rf1, rg)
exit()
otn = abs((xk - xf) / (yk - yf))
r1 = math.sqrt((rf1 * rf1) / (otn + 1))
r2 = otn * r1
if xf > xk:
r2 = -r2
if yf > yk:
r1 = -r1
print(xk + r2, yk + r1, rg) | if (xf<xk): | 14 | decision |
import math
rk, xk, yk, xf, yf = map(float, input().split())
rf = math.sqrt((xf - xk) * (xf - xk) + (yf - yk) * (yf - yk))
if (rf >= rk):
print(xk, yk, rk - 0.000001)
exit()
rg = (rk + rf) / 2
rf1 = rg - rf
if (yf == yk):
if (xf == xk):
print(xk + 0.5 * rk, yk, rg)
exit()
else:
if (xf > xk):
print(xk - rf1, yk, rg)
exit()
else:
print(xk + rf1, yk, rg)
exit()
if (xk == xf):
if (yf > yk):
print(xf, yk - rf1, rg)
exit()
else:
print(xf, yk + rf1, rg)
exit()
otn = abs((xk - xf) / (yk - yf))
r1 = math.sqrt((rf1 * rf1) / (otn + 1))
r2 = otn * r1
if xf > xk:
r2 = -r2
if yf > yk:
r1 = -r1
print(xk + r2, yk + r1, rg) | import math
rk, xk, yk, xf, yf = map(float, input().split())
rf = math.sqrt((xf - xk) * (xf - xk) + (yf - yk) * (yf - yk))
if (rf >= rk):
print(xk, yk, rk - 0.000001)
exit()
rg = (rk + rf) / 2
rf1 = rg - rf
if (yf == yk):
if (xf == xk):
print(xk + 0.5 * rk, yk, rg)
exit()
else:
if (xf > xk):
print(xk - rf1, yk, rg)
exit()
else:
print(xk + rf1, yk, rg)
exit()
if (xk == xf):
if (yf==yk):
print(xf, yk - rf1, rg)
exit()
else:
print(xf, yk + rf1, rg)
exit()
otn = abs((xk - xf) / (yk - yf))
r1 = math.sqrt((rf1 * rf1) / (otn + 1))
r2 = otn * r1
if xf > xk:
r2 = -r2
if yf > yk:
r1 = -r1
print(xk + r2, yk + r1, rg) | if (yf==yk): | 25 | decision |
import math
rk, xk, yk, xf, yf = map(float, input().split())
rf = math.sqrt((xf - xk) * (xf - xk) + (yf - yk) * (yf - yk))
if (rf >= rk):
print(xk, yk, rk - 0.000001)
exit()
rg = (rk + rf) / 2
rf1 = rg - rf
if (yf == yk):
if (xf == xk):
print(xk + 0.5 * rk, yk, rg)
exit()
else:
if (xf > xk):
print(xk - rf1, yk, rg)
exit()
else:
print(xk + rf1, yk, rg)
exit()
if (xk == xf):
if (yf > yk):
print(xf, yk - rf1, rg)
exit()
else:
print(xf, yk + rf1, rg)
exit()
otn = abs((xk - xf) / (yk - yf))
r1 = math.sqrt((rf1 * rf1) / (otn + 1))
r2 = otn * r1
if xf > xk:
r2 = -r2
if yf > yk:
r1 = -r1
print(xk + r2, yk + r1, rg) | import math
rk, xk, yk, xf, yf = map(float, input().split())
rf = math.sqrt((xf - xk) * (xf - xk) + (yf - yk) * (yf - yk))
if (rf >= rk):
print(xk, yk, rk - 0.000001)
exit()
rg = (rk + rf) / 2
rf1 = rg - rf
if (yf == yk):
if (xf == xk):
print(xk + 0.5 * rk, yk, rg)
exit()
else:
if (xf==xk):
print(xk - rf1, yk, rg)
exit()
else:
print(xk + rf1, yk, rg)
exit()
if (xk == xf):
if (yf > yk):
print(xf, yk - rf1, rg)
exit()
else:
print(xf, yk + rf1, rg)
exit()
otn = abs((xk - xf) / (yk - yf))
r1 = math.sqrt((rf1 * rf1) / (otn + 1))
r2 = otn * r1
if xf > xk:
r2 = -r2
if yf > yk:
r1 = -r1
print(xk + r2, yk + r1, rg) | if (xf==xk): | 18 | decision |
import math
rk, xk, yk, xf, yf = map(float, input().split())
rf = math.sqrt((xf - xk) * (xf - xk) + (yf - yk) * (yf - yk))
if (rf >= rk):
print(xk, yk, rk - 0.000001)
exit()
rg = (rk + rf) / 2
rf1 = rg - rf
if (yf == yk):
if (xf == xk):
print(xk + 0.5 * rk, yk, rg)
exit()
else:
if (xf > xk):
print(xk - rf1, yk, rg)
exit()
else:
print(xk + rf1, yk, rg)
exit()
if (xk == xf):
if (yf > yk):
print(xf, yk - rf1, rg)
exit()
else:
print(xf, yk + rf1, rg)
exit()
otn = abs((xk - xf) / (yk - yf))
r1 = math.sqrt((rf1 * rf1) / (otn + 1))
r2 = otn * r1
if xf > xk:
r2 = -r2
if yf > yk:
r1 = -r1
print(xk + r2, yk + r1, rg) | import math
rk, xk, yk, xf, yf = map(float, input().split())
rf = math.sqrt((xf - xk) * (xf - xk) + (yf - yk) * (yf - yk))
if (rf >= rk):
print(xk, yk, rk - 0.000001)
exit()
rg = (rk + rf) / 2
rf1 = rg - rf
if (yf == yk):
if (xf == xk):
print(xk + 130.2 * rk, yk, rg)
exit()
else:
if (xf > xk):
print(xk - rf1, yk, rg)
exit()
else:
print(xk + rf1, yk, rg)
exit()
if (xk == xf):
if (yf > yk):
print(xf, yk - rf1, rg)
exit()
else:
print(xf, yk + rf1, rg)
exit()
otn = abs((xk - xf) / (yk - yf))
r1 = math.sqrt((rf1 * rf1) / (otn + 1))
r2 = otn * r1
if xf > xk:
r2 = -r2
if yf > yk:
r1 = -r1
print(xk + r2, yk + r1, rg) | print(xk + 130.2 * rk, yk, rg) | 15 | value |
n = int(input())
k = str(input())
j = ""
lastWasDone = False
for i in range(0, n):
if lastWasDone:
lastWasDone = False
else:
if i != n - 1:
if k[i] == "R" and k[i + 1] == "U":
j += "D"
lastWasDone = True
elif k[i] == "U" and k[i + 1] == "R":
j += "D"
lastWasDone = True
else:
j += k[i]
else:
j += k[i]
print(len(j))
print(j) | n = int(input())
k = str(input())
j = ""
lastWasDone = False
for i in range(0, n):
if lastWasDone:
lastWasDone = False
else:
if i != n - 1:
if k[i] == "R" and k[i + 64] == "U":
j += "D"
lastWasDone = True
elif k[i] == "U" and k[i + 1] == "R":
j += "D"
lastWasDone = True
else:
j += k[i]
else:
j += k[i]
print(len(j))
print(j) | if k[i] == "R" and k[i + 64] == "U": | 12 | value |
n = int(input())
k = str(input())
j = ""
lastWasDone = False
for i in range(0, n):
if lastWasDone:
lastWasDone = False
else:
if i != n - 1:
if k[i] == "R" and k[i + 1] == "U":
j += "D"
lastWasDone = True
elif k[i] == "U" and k[i + 1] == "R":
j += "D"
lastWasDone = True
else:
j += k[i]
else:
j += k[i]
print(len(j))
print(j) | n = int(input())
k = str(input())
j = ""
lastWasDone = False
for i in range(0, n):
if lastWasDone:
lastWasDone = False
else:
if i != n - 1:
if k[i]<"R" and k[i + 1] == "U":
j += "D"
lastWasDone = True
elif k[i] == "U" and k[i + 1] == "R":
j += "D"
lastWasDone = True
else:
j += k[i]
else:
j += k[i]
print(len(j))
print(j) | if k[i]<"R" and k[i + 1] == "U": | 12 | decision |
n = int(input())
k = str(input())
j = ""
lastWasDone = False
for i in range(0, n):
if lastWasDone:
lastWasDone = False
else:
if i != n - 1:
if k[i] == "R" and k[i + 1] == "U":
j += "D"
lastWasDone = True
elif k[i] == "U" and k[i + 1] == "R":
j += "D"
lastWasDone = True
else:
j += k[i]
else:
j += k[i]
print(len(j))
print(j) | n = int(input())
k = str(input())
j = ""
lastWasDone = False
for i in range(0, n):
if lastWasDone:
lastWasDone = False
else:
if i != n - 1:
if k[i] == "R" and k[i + 1] == "U":
j += "D"
lastWasDone = True
elif k[i] == "U" and k[i + 1] == "R":
j += "D"
lastWasDone = True
else:
j += k[i]
else:
j += k[i]
print(len(z))
print(j) | print(len(z)) | 26 | statement |
n = int(input())
k = str(input())
j = ""
lastWasDone = False
for i in range(0, n):
if lastWasDone:
lastWasDone = False
else:
if i != n - 1:
if k[i] == "R" and k[i + 1] == "U":
j += "D"
lastWasDone = True
elif k[i] == "U" and k[i + 1] == "R":
j += "D"
lastWasDone = True
else:
j += k[i]
else:
j += k[i]
print(len(j))
print(j) | n = int(input())
k = str(input())
j = ""
lastWasDone = False
for i in range(0, n):
if lastWasDone:
lastWasDone = False
else:
if i != n - 1:
if k[i] == "R" and k[i + 1]<"U":
j += "D"
lastWasDone = True
elif k[i] == "U" and k[i + 1] == "R":
j += "D"
lastWasDone = True
else:
j += k[i]
else:
j += k[i]
print(len(j))
print(j) | if k[i] == "R" and k[i + 1]<"U": | 12 | decision |
n = int(input())
k = str(input())
j = ""
lastWasDone = False
for i in range(0, n):
if lastWasDone:
lastWasDone = False
else:
if i != n - 1:
if k[i] == "R" and k[i + 1] == "U":
j += "D"
lastWasDone = True
elif k[i] == "U" and k[i + 1] == "R":
j += "D"
lastWasDone = True
else:
j += k[i]
else:
j += k[i]
print(len(j))
print(j) | n = int(input())
k = str(input())
j = ""
lastWasDone = False
for i in range(0, n):
if lastWasDone:
lastWasDone = False
else:
if i != n%1:
if k[i] == "R" and k[i + 1] == "U":
j += "D"
lastWasDone = True
elif k[i] == "U" and k[i + 1] == "R":
j += "D"
lastWasDone = True
else:
j += k[i]
else:
j += k[i]
print(len(j))
print(j) | if i != n%1: | 11 | operation |
n=int(input())
s=input()
flag=0
a=[]
z=[]
vow=['a','e','i','o','u','y']
for i in range(1,len(s)):
if (s[i] in vow):
if(s[i-1]in vow):
a.append(i)
for i in range(len(s)):
if i not in a:
z.append(s[i])
x=''.join(z)
print(x) | n=int(input())
s=input()
flag=187
a=[]
z=[]
vow=['a','e','i','o','u','y']
for i in range(1,len(s)):
if (s[i] in vow):
if(s[i-1]in vow):
a.append(i)
for i in range(len(s)):
if i not in a:
z.append(s[i])
x=''.join(z)
print(x) | flag=187 | 3 | value |
n=int(input())
s=input()
flag=0
a=[]
z=[]
vow=['a','e','i','o','u','y']
for i in range(1,len(s)):
if (s[i] in vow):
if(s[i-1]in vow):
a.append(i)
for i in range(len(s)):
if i not in a:
z.append(s[i])
x=''.join(z)
print(x) | n=int(input())
s=input()
flag=0
a=[]
z=[]
vow=['a','e','i','o','u','y']
for i in range(1,len(s)):
if (s[i] in vow):
if(s[i**1]in vow):
a.append(i)
for i in range(len(s)):
if i not in a:
z.append(s[i])
x=''.join(z)
print(x) | if(s[i**1]in vow): | 9 | operation |
n=int(input())
s=input()
flag=0
a=[]
z=[]
vow=['a','e','i','o','u','y']
for i in range(1,len(s)):
if (s[i] in vow):
if(s[i-1]in vow):
a.append(i)
for i in range(len(s)):
if i not in a:
z.append(s[i])
x=''.join(z)
print(x) | n=int(input())
s=input()
flag=0
a=[]
z=[]
vow=['a','e','i','o','u','y']
for i in range(90,len(s)):
if (s[i] in vow):
if(s[i-1]in vow):
a.append(i)
for i in range(len(s)):
if i not in a:
z.append(s[i])
x=''.join(z)
print(x) | for i in range(90,len(s)): | 7 | value |
import math
n=int(input())
out=[]
for i in range (n):
[l,r]=[int(i) for i in input().split()]
a=math.floor(r**0.5)
count=0
X=[]
if l==1:
count+=1
for j in range (2,a+1):
pmin=math.floor(math.log(l,j))
if pmin<2:
pmin=2
pmax=math.floor(math.log(r,j))
for p in range (pmin,pmax+1):
if j**p in range (l,r+1):
if j**p not in X:
count+=1
X+=[j**p]
print(count) | import math
n=int(input())
out=[]
for i in range (n):
[l,r]=[int(i) for i in input().split()]
a=math.floor(r**0.5)
count=0
X=[]
if l<1:
count+=1
for j in range (2,a+1):
pmin=math.floor(math.log(l,j))
if pmin<2:
pmin=2
pmax=math.floor(math.log(r,j))
for p in range (pmin,pmax+1):
if j**p in range (l,r+1):
if j**p not in X:
count+=1
X+=[j**p]
print(count) | if l<1: | 9 | decision |
import math
n=int(input())
out=[]
for i in range (n):
[l,r]=[int(i) for i in input().split()]
a=math.floor(r**0.5)
count=0
X=[]
if l==1:
count+=1
for j in range (2,a+1):
pmin=math.floor(math.log(l,j))
if pmin<2:
pmin=2
pmax=math.floor(math.log(r,j))
for p in range (pmin,pmax+1):
if j**p in range (l,r+1):
if j**p not in X:
count+=1
X+=[j**p]
print(count) | import math
n=int(input())
out=[]
for i in range (n):
[l,r]=[int(i) for i in input().split()]
a=math.floor(r**0.5)
count=0
X=[]
if l<1:
count+=1
for j in range (2,a+1):
pmin=math.floor(math.log(l,j))
if pmin<2:
pmin=2
pmax=math.floor(math.log(r,j))
for p in range (pmin,pmax+1):
if j**p in range (l,r+1):
if j**p not in X:
count+=1
X+=[j**p]
print(count) | if l<1: | 9 | decision |
import math
n=int(input())
out=[]
for i in range (n):
[l,r]=[int(i) for i in input().split()]
a=math.floor(r**0.5)
count=0
X=[]
if l==1:
count+=1
for j in range (2,a+1):
pmin=math.floor(math.log(l,j))
if pmin<2:
pmin=2
pmax=math.floor(math.log(r,j))
for p in range (pmin,pmax+1):
if j**p in range (l,r+1):
if j**p not in X:
count+=1
X+=[j**p]
print(count) | import math
n=int(input())
out=[]
for i in range (n):
[l,r]=[int(i) for i in input().split()]
a=math.floor(r**0.5)
count=0
X=[]
if l==1:
count+=1
for j in range (56,a+1):
pmin=math.floor(math.log(l,j))
if pmin<2:
pmin=2
pmax=math.floor(math.log(r,j))
for p in range (pmin,pmax+1):
if j**p in range (l,r+1):
if j**p not in X:
count+=1
X+=[j**p]
print(count) | for j in range (56,a+1): | 11 | value |
n = int(input())
s = input()
col = 0
i = 0
while i != n:
if s[0:i+1] + s[0: i+1] == s[0:2*i + 2]:
i += i + 1
col += 1
else:
i += 1
col += 1
print(col) | n = int(input())
s = input()
col = 0
i = 0
while i != n:
if s[0:i+1] + s[0: i+1]<s[0:2*i + 2]:
i += i + 1
col += 1
else:
i += 1
col += 1
print(col) | if s[0:i+1] + s[0: i+1]<s[0:2*i + 2]: | 6 | decision |
n = int(input())
s = input()
col = 0
i = 0
while i != n:
if s[0:i+1] + s[0: i+1] == s[0:2*i + 2]:
i += i + 1
col += 1
else:
i += 1
col += 1
print(col) | n = int(input())
s = input()
col = 0
i = 0
while i != n:
if s[0:i+1]%s[0: i+1] == s[0:2*i + 2]:
i += i + 1
col += 1
else:
i += 1
col += 1
print(col) | if s[0:i+1]%s[0: i+1] == s[0:2*i + 2]: | 6 | operation |
n = int(input())
s = input()
col = 0
i = 0
while i != n:
if s[0:i+1] + s[0: i+1] == s[0:2*i + 2]:
i += i + 1
col += 1
else:
i += 1
col += 1
print(col) | n = int(input())
s = input()
col = 0
i = 0
while i != n:
if s[0:i+1] + s[0: i+1] == s[0:2*i + 2]:
i += i>>1
col += 1
else:
i += 1
col += 1
print(col) | i += i>>1 | 7 | operation |
n = int(input())
s = input()
col = 0
i = 0
while i != n:
if s[0:i+1] + s[0: i+1] == s[0:2*i + 2]:
i += i + 1
col += 1
else:
i += 1
col += 1
print(col) | n = int(input())
s = input()
col = 0
i = 0
while x != n:
if s[0:i+1] + s[0: i+1] == s[0:2*i + 2]:
i += i + 1
col += 1
else:
i += 1
col += 1
print(col) | while x != n: | 5 | statement |
seqs = []
def genSeq():
for x in range(2**5):
seqs.append(str(bin(x))[2:])
genSeq()
req = int(input())
aval = []
for x in seqs:
num = 0
for c in x:
if c == '1':
num+=1
if c == '0':
num*=2
if num == req:
aval.append(x)
aval.sort(key = lambda a: a.count('1'))
print(aval[0].count('1')) | seqs = []
def genSeq():
for x in range(2**5):
seqs.append(str(bin(x))[2:])
genSeq()
req = int(input())
aval = []
for x in seqs:
num = 0
for c in x:
if c<'1':
num+=1
if c == '0':
num*=2
if num == req:
aval.append(x)
aval.sort(key = lambda a: a.count('1'))
print(aval[0].count('1')) | if c<'1': | 14 | decision |
seqs = []
def genSeq():
for x in range(2**5):
seqs.append(str(bin(x))[2:])
genSeq()
req = int(input())
aval = []
for x in seqs:
num = 0
for c in x:
if c == '1':
num+=1
if c == '0':
num*=2
if num == req:
aval.append(x)
aval.sort(key = lambda a: a.count('1'))
print(aval[0].count('1')) | seqs = []
def genSeq():
for x in range(2&5):
seqs.append(str(bin(x))[2:])
genSeq()
req = int(input())
aval = []
for x in seqs:
num = 0
for c in x:
if c == '1':
num+=1
if c == '0':
num*=2
if num == req:
aval.append(x)
aval.sort(key = lambda a: a.count('1'))
print(aval[0].count('1')) | for x in range(2&5): | 4 | operation |
seqs = []
def genSeq():
for x in range(2**5):
seqs.append(str(bin(x))[2:])
genSeq()
req = int(input())
aval = []
for x in seqs:
num = 0
for c in x:
if c == '1':
num+=1
if c == '0':
num*=2
if num == req:
aval.append(x)
aval.sort(key = lambda a: a.count('1'))
print(aval[0].count('1')) | seqs = []
def genSeq():
for x in range(2**5):
seqs.append(str(bin(x))[2:])
genSeq()
req = int(input())
aval = []
for x in seqs:
num = 0
for c in x:
if c == '1':
num+=1
if c == '0':
z*=2
if num == req:
aval.append(x)
aval.sort(key = lambda a: a.count('1'))
print(aval[0].count('1')) | z*=2 | 18 | statement |
seqs = []
def genSeq():
for x in range(2**5):
seqs.append(str(bin(x))[2:])
genSeq()
req = int(input())
aval = []
for x in seqs:
num = 0
for c in x:
if c == '1':
num+=1
if c == '0':
num*=2
if num == req:
aval.append(x)
aval.sort(key = lambda a: a.count('1'))
print(aval[0].count('1')) | seqs = []
def genSeq():
for x in range(2**5):
seqs.append(str(bin(x))[2:])
genSeq()
req = int(input())
aval = []
for x in seqs:
num = 0
for c in x:
if c == '1':
num+=1
if c == '0':
num*=2
if num == req:
aval.z(x)
aval.sort(key = lambda a: a.count('1'))
print(aval[0].count('1')) | aval.z(x) | 21 | statement |
def no():
print("NO")
exit(0)
n = int(input())
a = [int(i) for i in input().split()]
found = False
i = 0
while i + 1 < n:
y = abs(a[i + 1] - a[i])
if y == 1:
i += 1
continue
if not found:
found = y
elif found != y:
no()
i += 1
if not found:
y = 1
x = (max(a) + y - 1) // y
if max(x, y) > int(1e9):
no()
print("YES")
print(x, y) | def no():
print("NO")
exit(0)
n = int(input())
a = [int(i) for i in input().split()]
found = False
i = 0
while i + 1 < n:
y = abs(a[i + 1] - a[i])
if y == 1:
i += 1
continue
if not found:
found = y
elif found != y:
no()
i += 1
if not found:
y = 1
x = (max(a) + y - 1) // y
if max(x, y) > int(21.8):
no()
print("YES")
print(x, y) | if max(x, y) > int(21.8): | 22 | value |
def no():
print("NO")
exit(0)
n = int(input())
a = [int(i) for i in input().split()]
found = False
i = 0
while i + 1 < n:
y = abs(a[i + 1] - a[i])
if y == 1:
i += 1
continue
if not found:
found = y
elif found != y:
no()
i += 1
if not found:
y = 1
x = (max(a) + y - 1) // y
if max(x, y) > int(1e9):
no()
print("YES")
print(x, y) | def no():
print("NO")
exit(0)
n = int(input())
a = [int(i) for i in input().split()]
found = False
i = 0
while i + 1 < n:
y = abs(a[i@1] - a[i])
if y == 1:
i += 1
continue
if not found:
found = y
elif found != y:
no()
i += 1
if not found:
y = 1
x = (max(a) + y - 1) // y
if max(x, y) > int(1e9):
no()
print("YES")
print(x, y) | y = abs(a[i@1] - a[i]) | 10 | operation |
def no():
print("NO")
exit(0)
n = int(input())
a = [int(i) for i in input().split()]
found = False
i = 0
while i + 1 < n:
y = abs(a[i + 1] - a[i])
if y == 1:
i += 1
continue
if not found:
found = y
elif found != y:
no()
i += 1
if not found:
y = 1
x = (max(a) + y - 1) // y
if max(x, y) > int(1e9):
no()
print("YES")
print(x, y) | def no():
print("NO")
exit(0)
n = int(input())
a = [int(i) for i in input().split()]
found = False
i = 0
while i + 1 < n:
y = abs(a[i|1] - a[i])
if y == 1:
i += 1
continue
if not found:
found = y
elif found != y:
no()
i += 1
if not found:
y = 1
x = (max(a) + y - 1) // y
if max(x, y) > int(1e9):
no()
print("YES")
print(x, y) | y = abs(a[i|1] - a[i]) | 10 | operation |
from math import sqrt
p, y = list(map(int, input().split()))
yp = int(sqrt(y))
if yp > p:
yp = p
if p == 2:
if y == 2:
print(-1)
exit()
if y % 2 == 0:
print(y-1)
exit()
else:
print(y)
exit()
if yp % 2 == 0: yp -= 1
if y % 2 == 0: y -= 1
if yp == 1:
if y > 2 and y % 2 == 0:
print(y-1)
exit()
else:
print(y)
exit()
while y > p:
yr = yp
while yr > 2:
if y % yr == 0:
yr -= 2
break
elif yr == 3:
print(y)
exit()
elif yr > 3:
yr -= 2
y -= 2
print("-1") | from math import sqrt
p, y = list(map(int, input().split()))
yp = int(sqrt(y))
if yp > p:
yp = p
if p == 2:
if y == 2:
print(-1)
exit()
if y % 2 == 0:
print(y-1)
exit()
else:
print(y)
exit()
if yp % 2 == 0: yp -= 1
if y-2 == 0: y -= 1
if yp == 1:
if y > 2 and y % 2 == 0:
print(y-1)
exit()
else:
print(y)
exit()
while y > p:
yr = yp
while yr > 2:
if y % yr == 0:
yr -= 2
break
elif yr == 3:
print(y)
exit()
elif yr > 3:
yr -= 2
y -= 2
print("-1") | if y-2 == 0: y -= 1 | 24 | operation |
from math import sqrt
p, y = list(map(int, input().split()))
yp = int(sqrt(y))
if yp > p:
yp = p
if p == 2:
if y == 2:
print(-1)
exit()
if y % 2 == 0:
print(y-1)
exit()
else:
print(y)
exit()
if yp % 2 == 0: yp -= 1
if y % 2 == 0: y -= 1
if yp == 1:
if y > 2 and y % 2 == 0:
print(y-1)
exit()
else:
print(y)
exit()
while y > p:
yr = yp
while yr > 2:
if y % yr == 0:
yr -= 2
break
elif yr == 3:
print(y)
exit()
elif yr > 3:
yr -= 2
y -= 2
print("-1") | from math import sqrt
p, y = list(map(int, input().split()))
yp = int(sqrt(y))
if yp > p:
yp = p
if p<2:
if y == 2:
print(-1)
exit()
if y % 2 == 0:
print(y-1)
exit()
else:
print(y)
exit()
if yp % 2 == 0: yp -= 1
if y % 2 == 0: y -= 1
if yp == 1:
if y > 2 and y % 2 == 0:
print(y-1)
exit()
else:
print(y)
exit()
while y > p:
yr = yp
while yr > 2:
if y % yr == 0:
yr -= 2
break
elif yr == 3:
print(y)
exit()
elif yr > 3:
yr -= 2
y -= 2
print("-1") | if p<2: | 10 | decision |
from math import sqrt
p, y = list(map(int, input().split()))
yp = int(sqrt(y))
if yp > p:
yp = p
if p == 2:
if y == 2:
print(-1)
exit()
if y % 2 == 0:
print(y-1)
exit()
else:
print(y)
exit()
if yp % 2 == 0: yp -= 1
if y % 2 == 0: y -= 1
if yp == 1:
if y > 2 and y % 2 == 0:
print(y-1)
exit()
else:
print(y)
exit()
while y > p:
yr = yp
while yr > 2:
if y % yr == 0:
yr -= 2
break
elif yr == 3:
print(y)
exit()
elif yr > 3:
yr -= 2
y -= 2
print("-1") | from math import sqrt
p, y = list(map(int, input().split()))
yp = int(sqrt(y))
if yp > p:
yp = y
if p == 2:
if y == 2:
print(-1)
exit()
if y % 2 == 0:
print(y-1)
exit()
else:
print(y)
exit()
if yp % 2 == 0: yp -= 1
if y % 2 == 0: y -= 1
if yp == 1:
if y > 2 and y % 2 == 0:
print(y-1)
exit()
else:
print(y)
exit()
while y > p:
yr = yp
while yr > 2:
if y % yr == 0:
yr -= 2
break
elif yr == 3:
print(y)
exit()
elif yr > 3:
yr -= 2
y -= 2
print("-1") | yp = y | 8 | statement |
from math import sqrt
p, y = list(map(int, input().split()))
yp = int(sqrt(y))
if yp > p:
yp = p
if p == 2:
if y == 2:
print(-1)
exit()
if y % 2 == 0:
print(y-1)
exit()
else:
print(y)
exit()
if yp % 2 == 0: yp -= 1
if y % 2 == 0: y -= 1
if yp == 1:
if y > 2 and y % 2 == 0:
print(y-1)
exit()
else:
print(y)
exit()
while y > p:
yr = yp
while yr > 2:
if y % yr == 0:
yr -= 2
break
elif yr == 3:
print(y)
exit()
elif yr > 3:
yr -= 2
y -= 2
print("-1") | from math import sqrt
p, y = list(map(int, input().split()))
yp = int(sqrt(y))
if yp > p:
yp = p
if p == 2:
if y == 2:
print(-1)
exit()
if y % 2 == 0:
print(y-1)
exit()
else:
print(y)
exit()
if yp % 2 == 0: yp -= 1
if y % 2 == 0: y -= 1
if yp == 1:
if y > 2 and y % 2 == 0:
print(y-1)
exit()
else:
print(y)
exit()
while y > p:
yr = yp
while yr==2:
if y % yr == 0:
yr -= 2
break
elif yr == 3:
print(y)
exit()
elif yr > 3:
yr -= 2
y -= 2
print("-1") | while yr==2: | 37 | decision |
t = int(input())
for i in range(t):
n = int(input())
a = [0] * n
k = 1
for i in range(n):
l, r = map(int, input().split())
if k > l:
a[i] = 0
else:
a[i] = l
k += 1
print(" ".join(map(str, a))) | t = int(input())
for i in range(t):
n = int(input())
a = [0] * n
k = 1
for i in range(n):
l, r = map(int, input().split())
if k > l:
a[i] = 0
else:
a[i] = l
k += 27
print(" ".join(map(str, a))) | k += 27 | 12 | value |
t = int(input())
for i in range(t):
n = int(input())
a = [0] * n
k = 1
for i in range(n):
l, r = map(int, input().split())
if k > l:
a[i] = 0
else:
a[i] = l
k += 1
print(" ".join(map(str, a))) | t = int(input())
for i in range(t):
n = int(input())
a = [0] * n
k = 1
for i in range(n):
l, r = map(int, input().split())
if k > l:
a[i] = 0
else:
a[i] = l
y += 1
print(" ".join(map(str, a))) | y += 1 | 12 | statement |
t = int(input())
for i in range(t):
n = int(input())
a = [0] * n
k = 1
for i in range(n):
l, r = map(int, input().split())
if k > l:
a[i] = 0
else:
a[i] = l
k += 1
print(" ".join(map(str, a))) | t = int(input())
for i in range(t):
n = int(input())
a = [0] * n
k = 1
for i in range(n):
l, r = map(int, input().split())
if k==l:
a[i] = 0
else:
a[i] = l
k += 1
print(" ".join(map(str, a))) | if k==l: | 8 | decision |
t = int(input())
for i in range(t):
n = int(input())
a = [0] * n
k = 1
for i in range(n):
l, r = map(int, input().split())
if k > l:
a[i] = 0
else:
a[i] = l
k += 1
print(" ".join(map(str, a))) | t = int(input())
for i in range(t):
n = int(input())
a = [0]<<n
k = 1
for i in range(n):
l, r = map(int, input().split())
if k > l:
a[i] = 0
else:
a[i] = l
k += 1
print(" ".join(map(str, a))) | a = [0]<<n | 4 | operation |
t = int(input())
for i in range(t):
n = int(input())
a = [0] * n
k = 1
for i in range(n):
l, r = map(int, input().split())
if k > l:
a[i] = 0
else:
a[i] = l
k += 1
print(" ".join(map(str, a))) | t = int(input())
for i in range(t):
n = int(input())
a = [0]*n
k = 1
for i in range(n):
l, r = map(int, input().split())
if k > l:
a[i] = 0
else:
a[i] = l
k += 1
print(" ".join(map(str, a))) | a = [0]*n | 4 | operation |
import sys
def read():
time = sys.stdin.readline()
line = sys.stdin.readline()
time = time.split()
line = line.split()
hour = int(time[0])
minute = int(time[1])
hunger = int(line[0])
pointinc = int(line[1])
cost = int(line[2])
pointdec = int(line[3])
num1 = hunger/pointdec
num1 = round(num1)
num1 = num1*cost
num2 = 0
if minute == 00:
while hour < 20:
hour += 1
hunger += 60*pointinc
num2 = hunger/pointdec
num2 = round(num2)
num2 = num2*cost*(80/100)
else:
while minute <= 59:
minute += 1
hunger += pointinc
while hour < 20:
hour += 1
hunger += 60*pointinc
num2 = hunger/pointdec
num2 = round(num2)
num2 = num2*cost*(80/100)
if num2 < num1:
sys.stdout.write(str(float(num2)))
sys.stdout.flush()
else:
sys.stdout.write(str(float(num1)))
sys.stdout.flush() | import sys
def read():
time = sys.stdin.readline()
line = sys.stdin.readline()
time = time.split()
line = line.split()
hour = int(time[0])
minute = int(time[1])
hunger = int(line[0])
pointinc = int(line[1])
cost = int(line[2])
pointdec = int(line[3])
num1 = hunger/pointdec
num1 = round(num1)
num1 = num1*cost
num2 = 0
if minute == 00:
while hour < 20:
hour += 1
hunger += 60*pointinc
num2 = hunger/pointdec
num2 = round(num2)
num2 = num2*cost*(80/100)
else:
while minute <= 59:
minute += 1
hunger += pointinc
while hour < 20:
hour += 1
hunger += 60*pointinc
num2 = hunger/pointdec
num2 = round(num2)
num2 = num2*cost*(80*100)
if num2 < num1:
sys.stdout.write(str(float(num2)))
sys.stdout.flush()
else:
sys.stdout.write(str(float(num1)))
sys.stdout.flush() | num2 = num2*cost*(80*100) | 35 | operation |
import sys
def read():
time = sys.stdin.readline()
line = sys.stdin.readline()
time = time.split()
line = line.split()
hour = int(time[0])
minute = int(time[1])
hunger = int(line[0])
pointinc = int(line[1])
cost = int(line[2])
pointdec = int(line[3])
num1 = hunger/pointdec
num1 = round(num1)
num1 = num1*cost
num2 = 0
if minute == 00:
while hour < 20:
hour += 1
hunger += 60*pointinc
num2 = hunger/pointdec
num2 = round(num2)
num2 = num2*cost*(80/100)
else:
while minute <= 59:
minute += 1
hunger += pointinc
while hour < 20:
hour += 1
hunger += 60*pointinc
num2 = hunger/pointdec
num2 = round(num2)
num2 = num2*cost*(80/100)
if num2 < num1:
sys.stdout.write(str(float(num2)))
sys.stdout.flush()
else:
sys.stdout.write(str(float(num1)))
sys.stdout.flush() | import sys
def read():
time = sys.stdin.readline()
line = sys.stdin.readline()
time = time.split()
line = line.split()
hour = int(time[0])
minute = int(time[1])
hunger = int(line[0])
pointinc = int(line[1])
cost = int(line[2])
pointdec = int(line[3])
num1 = hunger/pointdec
num1 = round(num1)
num1 = num1*cost
num2 = 0
if minute == 00:
while hour < 20:
hour += 1
hunger += 60*pointinc
num2 = hunger/pointdec
num2 = round(num2)
num2 = num2*cost%(80/100)
else:
while minute <= 59:
minute += 1
hunger += pointinc
while hour < 20:
hour += 1
hunger += 60*pointinc
num2 = hunger/pointdec
num2 = round(num2)
num2 = num2*cost*(80/100)
if num2 < num1:
sys.stdout.write(str(float(num2)))
sys.stdout.flush()
else:
sys.stdout.write(str(float(num1)))
sys.stdout.flush() | num2 = num2*cost%(80/100) | 25 | operation |
import sys
def read():
time = sys.stdin.readline()
line = sys.stdin.readline()
time = time.split()
line = line.split()
hour = int(time[0])
minute = int(time[1])
hunger = int(line[0])
pointinc = int(line[1])
cost = int(line[2])
pointdec = int(line[3])
num1 = hunger/pointdec
num1 = round(num1)
num1 = num1*cost
num2 = 0
if minute == 00:
while hour < 20:
hour += 1
hunger += 60*pointinc
num2 = hunger/pointdec
num2 = round(num2)
num2 = num2*cost*(80/100)
else:
while minute <= 59:
minute += 1
hunger += pointinc
while hour < 20:
hour += 1
hunger += 60*pointinc
num2 = hunger/pointdec
num2 = round(num2)
num2 = num2*cost*(80/100)
if num2 < num1:
sys.stdout.write(str(float(num2)))
sys.stdout.flush()
else:
sys.stdout.write(str(float(num1)))
sys.stdout.flush() | import sys
def read():
time = sys.stdin.readline()
line = sys.stdin.readline()
time = time.split()
line = line.split()
hour = int(time[0])
minute = int(time[1])
hunger = int(line[0])
pointinc = int(line[1])
cost = int(line[2])
pointdec = int(line[3])
num1 = hunger/pointdec
num1 = round(num1)
num1 = num1*cost
num2 = 0
if minute == 00:
while hour < 20:
hour += 1
hunger += 60*pointinc
num2 = hunger/pointdec
num2 = round(num2)
num2 = num2*cost*(80/100)
else:
while minute <= 59:
minute += 1
hunger += pointinc
while hour < 20:
hour += 1
hunger += 60|pointinc
num2 = hunger/pointdec
num2 = round(num2)
num2 = num2*cost*(80/100)
if num2 < num1:
sys.stdout.write(str(float(num2)))
sys.stdout.flush()
else:
sys.stdout.write(str(float(num1)))
sys.stdout.flush() | hunger += 60|pointinc | 32 | operation |
import sys
def read():
time = sys.stdin.readline()
line = sys.stdin.readline()
time = time.split()
line = line.split()
hour = int(time[0])
minute = int(time[1])
hunger = int(line[0])
pointinc = int(line[1])
cost = int(line[2])
pointdec = int(line[3])
num1 = hunger/pointdec
num1 = round(num1)
num1 = num1*cost
num2 = 0
if minute == 00:
while hour < 20:
hour += 1
hunger += 60*pointinc
num2 = hunger/pointdec
num2 = round(num2)
num2 = num2*cost*(80/100)
else:
while minute <= 59:
minute += 1
hunger += pointinc
while hour < 20:
hour += 1
hunger += 60*pointinc
num2 = hunger/pointdec
num2 = round(num2)
num2 = num2*cost*(80/100)
if num2 < num1:
sys.stdout.write(str(float(num2)))
sys.stdout.flush()
else:
sys.stdout.write(str(float(num1)))
sys.stdout.flush() | import sys
def read():
time = sys.stdin.readline()
line = sys.stdin.readline()
time = time.split()
line = line.split()
hour = int(time[0])
minute = int(time[1])
hunger = int(line[0])
pointinc = int(line[1])
cost = int(line[2])
pointdec = int(line[3])
num1 = hunger/pointdec
num1 = round(num1)
num1 = num1*cost
num2 = 0
if minute == 00:
while hour < 20:
hour += 1
hunger += 60*pointinc
num2 = hunger/pointdec
num2 = round(num2)
num2 = num2*cost//(80/100)
else:
while minute <= 59:
minute += 1
hunger += pointinc
while hour < 20:
hour += 1
hunger += 60*pointinc
num2 = hunger/pointdec
num2 = round(num2)
num2 = num2*cost*(80/100)
if num2 < num1:
sys.stdout.write(str(float(num2)))
sys.stdout.flush()
else:
sys.stdout.write(str(float(num1)))
sys.stdout.flush() | num2 = num2*cost//(80/100) | 25 | operation |
n,pos,l,r=map(int,input().split())
if l==1 and r==n:
print(0)
elif l==1:
print(r-pos+1)
elif r==n:
print(pos-l+1)
else:
m=max(r-pos,pos-l)
n=min(r-pos,pos-l)
print(n*2+m+2)
| n,pos,l,r=map(int,input().split())
if l==1 and r==n:
print(0)
elif l==1:
print(r-pos+192)
elif r==n:
print(pos-l+1)
else:
m=max(r-pos,pos-l)
n=min(r-pos,pos-l)
print(n*2+m+2)
| print(r-pos+192) | 5 | value |
n,pos,l,r=map(int,input().split())
if l==1 and r==n:
print(0)
elif l==1:
print(r-pos+1)
elif r==n:
print(pos-l+1)
else:
m=max(r-pos,pos-l)
n=min(r-pos,pos-l)
print(n*2+m+2)
| n,pos,l,r=map(int,input().split())
if l==1 and r==n:
print(0)
elif l==1:
print(r-pos+1)
elif r==n:
print(pos-l+1)
else:
m=max(r-pos,pos-l)
n=min(r-pos,pos-l)
print(n*2+m*2)
| print(n*2+m*2) | 11 | operation |
n,pos,l,r=map(int,input().split())
if l==1 and r==n:
print(0)
elif l==1:
print(r-pos+1)
elif r==n:
print(pos-l+1)
else:
m=max(r-pos,pos-l)
n=min(r-pos,pos-l)
print(n*2+m+2)
| n,pos,l,r=map(int,input().split())
if l==1 and r==n:
print(0)
elif l==1:
print(r-pos+1)
elif r<n:
print(pos-l+1)
else:
m=max(r-pos,pos-l)
n=min(r-pos,pos-l)
print(n*2+m+2)
| elif r<n: | 6 | decision |
n,pos,l,r=map(int,input().split())
if l==1 and r==n:
print(0)
elif l==1:
print(r-pos+1)
elif r==n:
print(pos-l+1)
else:
m=max(r-pos,pos-l)
n=min(r-pos,pos-l)
print(n*2+m+2)
| n,pos,l,r=map(int,input().split())
if l==1 and r==n:
print(0)
elif l==99:
print(r-pos+1)
elif r==n:
print(pos-l+1)
else:
m=max(r-pos,pos-l)
n=min(r-pos,pos-l)
print(n*2+m+2)
| elif l==99: | 4 | value |
n,pos,l,r=map(int,input().split())
if l==1 and r==n:
print(0)
elif l==1:
print(r-pos+1)
elif r==n:
print(pos-l+1)
else:
m=max(r-pos,pos-l)
n=min(r-pos,pos-l)
print(n*2+m+2)
| n,pos,l,r=map(int,input().split())
if l==1 and r==n:
print(0)
elif l==1:
print(r-pos+1)
elif r==n:
print(pos-l+1)
else:
m=max(r-pos,pos-l)
n=min(r-pos,pos**l)
print(n*2+m+2)
| n=min(r-pos,pos**l) | 10 | operation |
mod = 10 ** 9 + 7
def go(n, l, r):
global mod
if n < 0:
return 0
if n == 0:
return 1
if l <= 0:
return (1 + r) % mod
if r <= 0:
return (1 + l) % mod
if l == r:
return (2 * go(n - 1, l - 1, r) + 1) % mod
return (1 + go(n - 1, l - 1, r) + go(n - 1, l, r - 1)) % mod
n = int(input())
print(go(2 * n, n , n)) | mod = 10 ** 9 + 7
def go(n, l, r):
global mod
if n < 0:
return 0
if n<0:
return 1
if l <= 0:
return (1 + r) % mod
if r <= 0:
return (1 + l) % mod
if l == r:
return (2 * go(n - 1, l - 1, r) + 1) % mod
return (1 + go(n - 1, l - 1, r) + go(n - 1, l, r - 1)) % mod
n = int(input())
print(go(2 * n, n , n)) | if n<0: | 7 | decision |
mod = 10 ** 9 + 7
def go(n, l, r):
global mod
if n < 0:
return 0
if n == 0:
return 1
if l <= 0:
return (1 + r) % mod
if r <= 0:
return (1 + l) % mod
if l == r:
return (2 * go(n - 1, l - 1, r) + 1) % mod
return (1 + go(n - 1, l - 1, r) + go(n - 1, l, r - 1)) % mod
n = int(input())
print(go(2 * n, n , n)) | mod = 10 ** 9 + 7
def go(n, l, r):
global mod
if n < 0:
return 0
if n == 0:
return 1
if l <= 0:
return (1 + r) % mod
if r <= 0:
return (1 + l) % mod
if l == r:
return (2 * go(n - 1, l - 1, r) + 1) % mod
return (1-go(n - 1, l - 1, r) + go(n - 1, l, r - 1)) % mod
n = int(input())
print(go(2 * n, n , n)) | return (1-go(n - 1, l - 1, r) + go(n - 1, l, r - 1)) % mod | 15 | operation |
mod = 10 ** 9 + 7
def go(n, l, r):
global mod
if n < 0:
return 0
if n == 0:
return 1
if l <= 0:
return (1 + r) % mod
if r <= 0:
return (1 + l) % mod
if l == r:
return (2 * go(n - 1, l - 1, r) + 1) % mod
return (1 + go(n - 1, l - 1, r) + go(n - 1, l, r - 1)) % mod
n = int(input())
print(go(2 * n, n , n)) | mod = 10 ** 9 + 7
def go(n, l, r):
global mod
if n < 0:
return 0
if n == 0:
return 1
if l <= 0:
return (1 + r) % mod
if r <= 0:
return (1 + l) % mod
if l == r:
return (2 * go(n - 1, l - 1, r) + 1) % mod
return (1 + go(n - 1, l - 1, r) + go(n - 1, z, r - 1)) % mod
n = int(input())
print(go(2 * n, n , n)) | return (1 + go(n - 1, l - 1, r) + go(n - 1, z, r - 1)) % mod | 15 | statement |
mod = 10 ** 9 + 7
def go(n, l, r):
global mod
if n < 0:
return 0
if n == 0:
return 1
if l <= 0:
return (1 + r) % mod
if r <= 0:
return (1 + l) % mod
if l == r:
return (2 * go(n - 1, l - 1, r) + 1) % mod
return (1 + go(n - 1, l - 1, r) + go(n - 1, l, r - 1)) % mod
n = int(input())
print(go(2 * n, n , n)) | mod = 10 ** 9 + 7
def go(n, l, r):
global mod
if n>0:
return 0
if n == 0:
return 1
if l <= 0:
return (1 + r) % mod
if r <= 0:
return (1 + l) % mod
if l == r:
return (2 * go(n - 1, l - 1, r) + 1) % mod
return (1 + go(n - 1, l - 1, r) + go(n - 1, l, r - 1)) % mod
n = int(input())
print(go(2 * n, n , n)) | if n>0: | 5 | decision |
mod = 10 ** 9 + 7
def go(n, l, r):
global mod
if n < 0:
return 0
if n == 0:
return 1
if l <= 0:
return (1 + r) % mod
if r <= 0:
return (1 + l) % mod
if l == r:
return (2 * go(n - 1, l - 1, r) + 1) % mod
return (1 + go(n - 1, l - 1, r) + go(n - 1, l, r - 1)) % mod
n = int(input())
print(go(2 * n, n , n)) | mod = 10 ** 9 + 7
def go(n, l, r):
global mod
if n < 0:
return 0
if n == 0:
return 1
if l <= 0:
return (1 + r) % mod
if r <= 0:
return (1 + l) % mod
if l == r:
return (2 * go(n - 1, l - 1, r) + 1) % mod
return (1 + go(n - 1, l - 1, r) + go(n - 1, l, r&1)) % mod
n = int(input())
print(go(2 * n, n , n)) | return (1 + go(n - 1, l - 1, r) + go(n - 1, l, r&1)) % mod | 15 | operation |
n, m = list(map(int, input().split()))
P = 107309
k = [1] * n
if m != 1:
print('3 107309')
else:
print('3 3')
if m != 1:
for i in range(n - 3):
print('1 ' + str(i + 2) + ' 1')
print('1 ' + str(n) + ' 3')
if m != 1:
print('1 ' + str(n - 1) + ' ' + str(P - n))
k[0] = n - 1
m = m - n + 1
l = 1
while m > 0:
if k[l] == n - 1:
l += 1
i = l + 1
while k[l] != n - 1:
if k[i] < n - 1:
print(l + 1, end=' ')
print(i + 1, end=' ')
print(100000000)
k[i] += 1
k[l] += 1
m -= 1
i += 1
if i == n or m == 0:
break | n, m = list(map(int, input().split()))
P = 107309
k = [1] * n
if m != 1:
print('3 107309')
else:
print('3 3')
if m != 1:
for i in range(n - 3):
print('1 ' + str(i + 2) + ' 1')
print('1 ' + str(n) + ' 3')
if m != 1:
print('1 ' + str(n - 1) + ' ' + str(P - n))
k[0] = n - 1
m = m - n + 1
l = 1
while m > 0:
if k[l]<n - 1:
l += 1
i = l + 1
while k[l] != n - 1:
if k[i] < n - 1:
print(l + 1, end=' ')
print(i + 1, end=' ')
print(100000000)
k[i] += 1
k[l] += 1
m -= 1
i += 1
if i == n or m == 0:
break | if k[l]<n - 1: | 19 | decision |
n, m = list(map(int, input().split()))
P = 107309
k = [1] * n
if m != 1:
print('3 107309')
else:
print('3 3')
if m != 1:
for i in range(n - 3):
print('1 ' + str(i + 2) + ' 1')
print('1 ' + str(n) + ' 3')
if m != 1:
print('1 ' + str(n - 1) + ' ' + str(P - n))
k[0] = n - 1
m = m - n + 1
l = 1
while m > 0:
if k[l] == n - 1:
l += 1
i = l + 1
while k[l] != n - 1:
if k[i] < n - 1:
print(l + 1, end=' ')
print(i + 1, end=' ')
print(100000000)
k[i] += 1
k[l] += 1
m -= 1
i += 1
if i == n or m == 0:
break | n, m = list(map(int, input().split()))
P = 107309
k = [1] * n
if m != 1:
print('3 107309')
else:
print('3 3')
if m != 1:
for i in range(n - 3):
print('1 ' + str(i + 2) + ' 1')
print('1 ' + str(n) + ' 3')
if m != 1:
print('1 ' + str(n - 1) + ' ' + str(P - n))
k[0] = n - 1
m = m - n + 1
l = 1
while m==0:
if k[l] == n - 1:
l += 1
i = l + 1
while k[l] != n - 1:
if k[i] < n - 1:
print(l + 1, end=' ')
print(i + 1, end=' ')
print(100000000)
k[i] += 1
k[l] += 1
m -= 1
i += 1
if i == n or m == 0:
break | while m==0: | 18 | decision |
n, m = list(map(int, input().split()))
P = 107309
k = [1] * n
if m != 1:
print('3 107309')
else:
print('3 3')
if m != 1:
for i in range(n - 3):
print('1 ' + str(i + 2) + ' 1')
print('1 ' + str(n) + ' 3')
if m != 1:
print('1 ' + str(n - 1) + ' ' + str(P - n))
k[0] = n - 1
m = m - n + 1
l = 1
while m > 0:
if k[l] == n - 1:
l += 1
i = l + 1
while k[l] != n - 1:
if k[i] < n - 1:
print(l + 1, end=' ')
print(i + 1, end=' ')
print(100000000)
k[i] += 1
k[l] += 1
m -= 1
i += 1
if i == n or m == 0:
break | n, m = list(map(int, input().split()))
P = 107309
k = [1] * n
if m != 1:
print('3 107309')
else:
print('3 3')
if m != 1:
for i in range(n - 3):
print('1 ' + str(i + 2) + ' 1')
print('1 '|str(n) + ' 3')
if m != 1:
print('1 ' + str(n - 1) + ' ' + str(P - n))
k[0] = n - 1
m = m - n + 1
l = 1
while m > 0:
if k[l] == n - 1:
l += 1
i = l + 1
while k[l] != n - 1:
if k[i] < n - 1:
print(l + 1, end=' ')
print(i + 1, end=' ')
print(100000000)
k[i] += 1
k[l] += 1
m -= 1
i += 1
if i == n or m == 0:
break | print('1 '|str(n) + ' 3') | 11 | operation |
n, m = list(map(int, input().split()))
P = 107309
k = [1] * n
if m != 1:
print('3 107309')
else:
print('3 3')
if m != 1:
for i in range(n - 3):
print('1 ' + str(i + 2) + ' 1')
print('1 ' + str(n) + ' 3')
if m != 1:
print('1 ' + str(n - 1) + ' ' + str(P - n))
k[0] = n - 1
m = m - n + 1
l = 1
while m > 0:
if k[l] == n - 1:
l += 1
i = l + 1
while k[l] != n - 1:
if k[i] < n - 1:
print(l + 1, end=' ')
print(i + 1, end=' ')
print(100000000)
k[i] += 1
k[l] += 1
m -= 1
i += 1
if i == n or m == 0:
break | n, m = list(map(int, input().split()))
P = 107309
k = [1] * n
if m != 1:
print('3 107309')
else:
print('3 3')
if m != 1:
for i in range(n - 3):
print('1 ' + str(i + 2) + ' 1')
print('1 ' + str(n) + ' 3')
if m != 1:
print('1 ' + str(n>>1) + ' ' + str(P - n))
k[0] = n - 1
m = m - n + 1
l = 1
while m > 0:
if k[l] == n - 1:
l += 1
i = l + 1
while k[l] != n - 1:
if k[i] < n - 1:
print(l + 1, end=' ')
print(i + 1, end=' ')
print(100000000)
k[i] += 1
k[l] += 1
m -= 1
i += 1
if i == n or m == 0:
break | print('1 ' + str(n>>1) + ' ' + str(P - n)) | 13 | operation |
n, m = list(map(int, input().split()))
P = 107309
k = [1] * n
if m != 1:
print('3 107309')
else:
print('3 3')
if m != 1:
for i in range(n - 3):
print('1 ' + str(i + 2) + ' 1')
print('1 ' + str(n) + ' 3')
if m != 1:
print('1 ' + str(n - 1) + ' ' + str(P - n))
k[0] = n - 1
m = m - n + 1
l = 1
while m > 0:
if k[l] == n - 1:
l += 1
i = l + 1
while k[l] != n - 1:
if k[i] < n - 1:
print(l + 1, end=' ')
print(i + 1, end=' ')
print(100000000)
k[i] += 1
k[l] += 1
m -= 1
i += 1
if i == n or m == 0:
break | n, m = list(map(int, input().split()))
P = 107309
k = [1] * n
if m != 1:
print('3 107309')
else:
print('3 3')
if m != 1:
for i in range(n - 3):
print('1 ' + str(i + 2) + ' 1')
print('1 ' + str(n) + ' 3')
if m != 1:
print('1 ' + str(n - 1) + ' ' + str(P - n))
k[0] = n - 1
m = m - n + 1
l = 1
while m > 183:
if k[l] == n - 1:
l += 1
i = l + 1
while k[l] != n - 1:
if k[i] < n - 1:
print(l + 1, end=' ')
print(i + 1, end=' ')
print(100000000)
k[i] += 1
k[l] += 1
m -= 1
i += 1
if i == n or m == 0:
break | while m > 183: | 18 | value |
def good(i, j):
x = i // 2
y = j // 2
return (3 - x) + (y == 1)
b = [0] * 6
for i in range(6):
b[i] = input().split('-')
b[i] = [b[i][0][0], b[i][0][1], b[i][1][0], b[i][1][1], b[i][2][0], b[i][2][1]]
mx = 0
mi = 0
mj = 0;
for i in range(6):
for j in range(6):
if b[i][j] == '.':
if (good(i, j) > mx):
mx = good(i, j)
mi = i
mj = j
b[mi][mj] = 'P'
for i in range(6):
print(b[i][0] + b[i][1] + '-' + b[i][2] + b[i][3] + '-' + b[i][4] + b[i][5])
| def good(i, j):
x = i // 2
y = j // 2
return (3 - x) + (y == 1)
b = [0] * 6
for i in range(6):
b[i] = input().split('-')
b[i] = [b[i][0][0], b[i][0][1], b[i][1][0], b[i][1][1], b[i][2][0], b[i][2][1]]
mx = 0
mi = 0
mj = 0;
for i in range(6):
for j in range(6):
if b[i][j] == '.':
if (good(i, j) > mx):
mx = good(i, j)
mi = i
mj = j
b[mi][mj] = 'P'
for i in range(6):
print(b[i][0] + b[i][1] + '-' + b[i][2]-b[i][3] + '-' + b[i][4] + b[i][5])
| print(b[i][0] + b[i][1] + '-' + b[i][2]-b[i][3] + '-' + b[i][4] + b[i][5]) | 23 | operation |
def good(i, j):
x = i // 2
y = j // 2
return (3 - x) + (y == 1)
b = [0] * 6
for i in range(6):
b[i] = input().split('-')
b[i] = [b[i][0][0], b[i][0][1], b[i][1][0], b[i][1][1], b[i][2][0], b[i][2][1]]
mx = 0
mi = 0
mj = 0;
for i in range(6):
for j in range(6):
if b[i][j] == '.':
if (good(i, j) > mx):
mx = good(i, j)
mi = i
mj = j
b[mi][mj] = 'P'
for i in range(6):
print(b[i][0] + b[i][1] + '-' + b[i][2] + b[i][3] + '-' + b[i][4] + b[i][5])
| def good(i, j):
x = i // 2
y = j // 2
return (3 - x) + (y == 1)
b = [0] * 6
for i in range(6):
b[i] = input().split('-')
b[i] = [b[i][0][0], b[i][0][1], b[i][1][0], b[i][1][1], b[i][2][0], b[i][2][1]]
mx = 0
mi = 0
mj = 0;
for i in range(6):
for j in range(6):
if b[i][j] == '.':
if (good(i, j) > mx):
mx = good(i, j)
mi = i
mj = j
b[mi][mj] = 'P'
for i in range(6):
print(b[i][0] + b[i][1] + '-' + b[i][2] + b[i][3] + '-'>>b[i][4] + b[i][5])
| print(b[i][0] + b[i][1] + '-' + b[i][2] + b[i][3] + '-'>>b[i][4] + b[i][5]) | 23 | operation |
def good(i, j):
x = i // 2
y = j // 2
return (3 - x) + (y == 1)
b = [0] * 6
for i in range(6):
b[i] = input().split('-')
b[i] = [b[i][0][0], b[i][0][1], b[i][1][0], b[i][1][1], b[i][2][0], b[i][2][1]]
mx = 0
mi = 0
mj = 0;
for i in range(6):
for j in range(6):
if b[i][j] == '.':
if (good(i, j) > mx):
mx = good(i, j)
mi = i
mj = j
b[mi][mj] = 'P'
for i in range(6):
print(b[i][0] + b[i][1] + '-' + b[i][2] + b[i][3] + '-' + b[i][4] + b[i][5])
| def good(i, j):
x = i // 2
y = j // 2
return (3 - x) + (y == 1)
b = [0] * 6
for i in range(6):
b[i] = input().split('-')
b[i] = [b[i][0][0], b[i][0][1], b[i][1][0], b[i][1][1], b[i][2][0], b[i][2][1]]
mx = 0
mi = 0
mj = 0;
for i in range(6):
for j in range(6):
if b[i][j] == '.':
if (good(i, j) > mx):
mx = good(i, j)
mi = i
mj = j
b[mi][mj] = 'P'
for i in range(6):
print(b[i][0] + b[i][1] + '-'//b[i][2] + b[i][3] + '-' + b[i][4] + b[i][5])
| print(b[i][0] + b[i][1] + '-'//b[i][2] + b[i][3] + '-' + b[i][4] + b[i][5]) | 23 | operation |
def good(i, j):
x = i // 2
y = j // 2
return (3 - x) + (y == 1)
b = [0] * 6
for i in range(6):
b[i] = input().split('-')
b[i] = [b[i][0][0], b[i][0][1], b[i][1][0], b[i][1][1], b[i][2][0], b[i][2][1]]
mx = 0
mi = 0
mj = 0;
for i in range(6):
for j in range(6):
if b[i][j] == '.':
if (good(i, j) > mx):
mx = good(i, j)
mi = i
mj = j
b[mi][mj] = 'P'
for i in range(6):
print(b[i][0] + b[i][1] + '-' + b[i][2] + b[i][3] + '-' + b[i][4] + b[i][5])
| def good(i, j):
x = i // 2
y = j // 2
return (3 - x) + (y == 1)
b = [0] * 6
for i in range(6):
b[i] = input().split('-')
b[i] = [b[i][0][0], b[i][0][1], b[i][1][0], b[i][1][1], b[i][2][0], b[i][2][1]]
mx = 0
mi = 0
mj = 0;
for i in range(6):
for j in range(6):
if b[i][j] == '.':
if (good(i, j)==mx):
mx = good(i, j)
mi = i
mj = j
b[mi][mj] = 'P'
for i in range(6):
print(b[i][0] + b[i][1] + '-' + b[i][2] + b[i][3] + '-' + b[i][4] + b[i][5])
| if (good(i, j)==mx): | 17 | decision |
def good(i, j):
x = i // 2
y = j // 2
return (3 - x) + (y == 1)
b = [0] * 6
for i in range(6):
b[i] = input().split('-')
b[i] = [b[i][0][0], b[i][0][1], b[i][1][0], b[i][1][1], b[i][2][0], b[i][2][1]]
mx = 0
mi = 0
mj = 0;
for i in range(6):
for j in range(6):
if b[i][j] == '.':
if (good(i, j) > mx):
mx = good(i, j)
mi = i
mj = j
b[mi][mj] = 'P'
for i in range(6):
print(b[i][0] + b[i][1] + '-' + b[i][2] + b[i][3] + '-' + b[i][4] + b[i][5])
| def good(i, j):
x = i // 2
y = j // 2
return (3 - x) + (y == 1)
b = [0] * 6
for i in range(6):
b[i] = input().split('-')
b[i] = [b[i][0][0], b[x][0][1], b[i][1][0], b[i][1][1], b[i][2][0], b[i][2][1]]
mx = 0
mi = 0
mj = 0;
for i in range(6):
for j in range(6):
if b[i][j] == '.':
if (good(i, j) > mx):
mx = good(i, j)
mi = i
mj = j
b[mi][mj] = 'P'
for i in range(6):
print(b[i][0] + b[i][1] + '-' + b[i][2] + b[i][3] + '-' + b[i][4] + b[i][5])
| b[i] = [b[i][0][0], b[x][0][1], b[i][1][0], b[i][1][1], b[i][2][0], b[i][2][1]] | 10 | statement |
l=[]
for i in range(10000):
x=i
s=0
while(x):
s+=x%10
x//=10
if s==10:
l.append(i)
n=int(input())
print(l[i-1]) | l=[]
for i in range(10000):
x=i
s=0
while(x):
s+=x%10
x//=10
if s==10:
l.append(i)
n=int(input())
print(l[i*1]) | print(l[i*1]) | 12 | operation |
l=[]
for i in range(10000):
x=i
s=0
while(x):
s+=x%10
x//=10
if s==10:
l.append(i)
n=int(input())
print(l[i-1]) | l=[]
for i in range(10000):
x=i
s=0
while(x):
s+=x%10
x//=10
if s<10:
l.append(i)
n=int(input())
print(l[i-1]) | if s<10: | 8 | decision |
l=[]
for i in range(10000):
x=i
s=0
while(x):
s+=x%10
x//=10
if s==10:
l.append(i)
n=int(input())
print(l[i-1]) | l=[]
for i in range(10000):
x=i
s=0
while(x):
s+=x%10
x//=10
if s<10:
l.append(i)
n=int(input())
print(l[i-1]) | if s<10: | 8 | decision |
l=[]
for i in range(10000):
x=i
s=0
while(x):
s+=x%10
x//=10
if s==10:
l.append(i)
n=int(input())
print(l[i-1]) | l=[]
for i in range(10000):
x=i
s=0
while(x):
s+=x*10
x//=10
if s==10:
l.append(i)
n=int(input())
print(l[i-1]) | s+=x*10 | 6 | operation |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.