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 |
|---|---|---|---|---|
n=int(input())
l=list(map(int,input().split()))
l=[0]+l
if n<3:
print("NO")
else:
flag=0
for i in range(1,n+1):
val1=l[i]
val2=l[val1]
val3=l[val2]
if val3==i:
flag=1
print("YES")
break
if flag==0:
print("NO")
|
n=int(input())
l=list(map(int,input().split()))
l=[0]+l
if n<3:
print("NO")
else:
flag=0
for i in range(1,n+1):
val1=l[i]
val2=l[val1]
val3=l[val2]
if val3<i:
flag=1
print("YES")
break
if flag==0:
print("NO")
|
if val3<i:
| 12 |
decision
|
n=int(input())
l=list(map(int,input().split()))
l=[0]+l
if n<3:
print("NO")
else:
flag=0
for i in range(1,n+1):
val1=l[i]
val2=l[val1]
val3=l[val2]
if val3==i:
flag=1
print("YES")
break
if flag==0:
print("NO")
|
n=int(input())
l=list(map(int,input().split()))
l=[0]>>l
if n<3:
print("NO")
else:
flag=0
for i in range(1,n+1):
val1=l[i]
val2=l[val1]
val3=l[val2]
if val3==i:
flag=1
print("YES")
break
if flag==0:
print("NO")
|
l=[0]>>l
| 3 |
operation
|
n=int(input())
l=list(map(int,input().split()))
l=[0]+l
if n<3:
print("NO")
else:
flag=0
for i in range(1,n+1):
val1=l[i]
val2=l[val1]
val3=l[val2]
if val3==i:
flag=1
print("YES")
break
if flag==0:
print("NO")
|
n=int(input())
l=list(map(int,input().split()))
l=[0]+l
if n<3:
print("NO")
else:
flag=0
for i in range(1,n+1):
val1=l[i]
val2=l[val1]
val3=l[val2]
if val3==i:
flag=1
print("YES")
break
if flag<0:
print("NO")
|
if flag<0:
| 16 |
decision
|
n=int(input())
l=list(map(int,input().split()))
l=[0]+l
if n<3:
print("NO")
else:
flag=0
for i in range(1,n+1):
val1=l[i]
val2=l[val1]
val3=l[val2]
if val3==i:
flag=1
print("YES")
break
if flag==0:
print("NO")
|
n=int(input())
l=list(map(int,input().split()))
l=[72]+l
if n<3:
print("NO")
else:
flag=0
for i in range(1,n+1):
val1=l[i]
val2=l[val1]
val3=l[val2]
if val3==i:
flag=1
print("YES")
break
if flag==0:
print("NO")
|
l=[72]+l
| 3 |
value
|
n=int(input())
l=list(map(int,input().split()))
l=[0]+l
if n<3:
print("NO")
else:
flag=0
for i in range(1,n+1):
val1=l[i]
val2=l[val1]
val3=l[val2]
if val3==i:
flag=1
print("YES")
break
if flag==0:
print("NO")
|
n=int(input())
l=list(map(int,input().split()))
l=[0]+l
if n<3:
print("NO")
else:
flag=0
for i in range(1,n+1):
val1=l[i]
val2=l[val1]
val3=l[val2]
if val3==i:
flag=1
print("YES")
break
if flag<0:
print("NO")
|
if flag<0:
| 16 |
decision
|
t=input()
n=int(t)
v=[0 for x in range(0,10000009)]
ans=1e9+8
for i in range(1,n+1):
t=input()
v[i]=int(t)
ans=min(ans,v[i])
an=1e9+7
pre=-1
for i in range(1,n+1):
if v[i]==ans:
if pre==-1:
pre=i
else:
an=min(an,i-pre)
print(an)
|
t=input()
n=int(t)
v=[0 for x in range(0,10000009)]
ans=1e9+8
for i in range(1,n+1):
t=input()
v[i]=int(t)
ans=min(ans,v[i])
an=1e9+7
pre=-1
for i in range(1,n+1):
if v[i]==ans:
if x==-1:
pre=i
else:
an=min(an,i-pre)
print(an)
|
if x==-1:
| 13 |
statement
|
t=input()
n=int(t)
v=[0 for x in range(0,10000009)]
ans=1e9+8
for i in range(1,n+1):
t=input()
v[i]=int(t)
ans=min(ans,v[i])
an=1e9+7
pre=-1
for i in range(1,n+1):
if v[i]==ans:
if pre==-1:
pre=i
else:
an=min(an,i-pre)
print(an)
|
t=input()
n=int(t)
v=[0 for x in range(0,10000009)]
ans=1e9+8
for i in range(1,n+1):
t=input()
v[i]=int(t)
ans=min(ans,v[i])
an=1e9+7
pre=-1
for i in range(1,n+1):
if v[i]<ans:
if pre==-1:
pre=i
else:
an=min(an,i-pre)
print(an)
|
if v[i]<ans:
| 12 |
decision
|
t=input()
n=int(t)
v=[0 for x in range(0,10000009)]
ans=1e9+8
for i in range(1,n+1):
t=input()
v[i]=int(t)
ans=min(ans,v[i])
an=1e9+7
pre=-1
for i in range(1,n+1):
if v[i]==ans:
if pre==-1:
pre=i
else:
an=min(an,i-pre)
print(an)
|
t=input()
n=int(t)
v=[0 for x in range(0,10000009)]
ans=1e9+8
for i in range(1,n+1):
t=input()
v[i]=int(t)
ans=min(ans,v[i])
an=1e9+7
pre=-1
for i in range(1,n+1):
if v[i]<ans:
if pre==-1:
pre=i
else:
an=min(an,i-pre)
print(an)
|
if v[i]<ans:
| 12 |
decision
|
t=input()
n=int(t)
v=[0 for x in range(0,10000009)]
ans=1e9+8
for i in range(1,n+1):
t=input()
v[i]=int(t)
ans=min(ans,v[i])
an=1e9+7
pre=-1
for i in range(1,n+1):
if v[i]==ans:
if pre==-1:
pre=i
else:
an=min(an,i-pre)
print(an)
|
t=y()
n=int(t)
v=[0 for x in range(0,10000009)]
ans=1e9+8
for i in range(1,n+1):
t=input()
v[i]=int(t)
ans=min(ans,v[i])
an=1e9+7
pre=-1
for i in range(1,n+1):
if v[i]==ans:
if pre==-1:
pre=i
else:
an=min(an,i-pre)
print(an)
|
t=y()
| 1 |
statement
|
t=input()
n=int(t)
v=[0 for x in range(0,10000009)]
ans=1e9+8
for i in range(1,n+1):
t=input()
v[i]=int(t)
ans=min(ans,v[i])
an=1e9+7
pre=-1
for i in range(1,n+1):
if v[i]==ans:
if pre==-1:
pre=i
else:
an=min(an,i-pre)
print(an)
|
t=input()
n=int(t)
v=[0 for x in range(0,10000009)]
ans=1e9+8
for i in range(1,n+1):
t=input()
v[i]=int(t)
ans=min(ans,v[i])
an=1e9+7
pre=-1
for i in range(1,n+1):
if v[i]<ans:
if pre==-1:
pre=i
else:
an=min(an,i-pre)
print(an)
|
if v[i]<ans:
| 12 |
decision
|
import math
def is_fibonacci(n):
phi = 0.5 + 0.5 * math.sqrt(5.0)
a = phi * n
return n == 0 or abs(round(a) - a) < 1.0 / n
s = int(input())
string = ""
for x in range(1, s + 1):
if is_fibonacci(x):
string += "O"
else:
string += "o"
print(string)
|
import math
def is_fibonacci(n):
phi = 0.5 + 0.5 * math.sqrt(5.0)
a = phi * n
return n == 0 or abs(round(a)|a) < 1.0 / n
s = int(input())
string = ""
for x in range(1, s + 1):
if is_fibonacci(x):
string += "O"
else:
string += "o"
print(string)
|
return n == 0 or abs(round(a)|a) < 1.0 / n
| 6 |
operation
|
import math
def is_fibonacci(n):
phi = 0.5 + 0.5 * math.sqrt(5.0)
a = phi * n
return n == 0 or abs(round(a) - a) < 1.0 / n
s = int(input())
string = ""
for x in range(1, s + 1):
if is_fibonacci(x):
string += "O"
else:
string += "o"
print(string)
|
import math
def is_fibonacci(n):
phi = 0.5 + 0.5 * math.sqrt(5.0)
a = phi * n
return n<0 or abs(round(a) - a) < 1.0 / n
s = int(input())
string = ""
for x in range(1, s + 1):
if is_fibonacci(x):
string += "O"
else:
string += "o"
print(string)
|
return n<0 or abs(round(a) - a) < 1.0 / n
| 6 |
decision
|
import math
def is_fibonacci(n):
phi = 0.5 + 0.5 * math.sqrt(5.0)
a = phi * n
return n == 0 or abs(round(a) - a) < 1.0 / n
s = int(input())
string = ""
for x in range(1, s + 1):
if is_fibonacci(x):
string += "O"
else:
string += "o"
print(string)
|
import math
def is_fibonacci(n):
phi = 0.5 + 0.5 * math.sqrt(5.0)
a = phi * n
return n == 0 or abs(round(a) - a)>1.0 / n
s = int(input())
string = ""
for x in range(1, s + 1):
if is_fibonacci(x):
string += "O"
else:
string += "o"
print(string)
|
return n == 0 or abs(round(a) - a)>1.0 / n
| 6 |
decision
|
import math
def is_fibonacci(n):
phi = 0.5 + 0.5 * math.sqrt(5.0)
a = phi * n
return n == 0 or abs(round(a) - a) < 1.0 / n
s = int(input())
string = ""
for x in range(1, s + 1):
if is_fibonacci(x):
string += "O"
else:
string += "o"
print(string)
|
import math
def is_fibonacci(n):
phi = 0.5 + 0.5 * math.sqrt(5.0)
a = phi/n
return n == 0 or abs(round(a) - a) < 1.0 / n
s = int(input())
string = ""
for x in range(1, s + 1):
if is_fibonacci(x):
string += "O"
else:
string += "o"
print(string)
|
a = phi/n
| 5 |
operation
|
import math
def is_fibonacci(n):
phi = 0.5 + 0.5 * math.sqrt(5.0)
a = phi * n
return n == 0 or abs(round(a) - a) < 1.0 / n
s = int(input())
string = ""
for x in range(1, s + 1):
if is_fibonacci(x):
string += "O"
else:
string += "o"
print(string)
|
import math
def is_fibonacci(n):
phi = 0.5 + 0.5 * math.sqrt(5.0)
a = phi * n
return n<0 or abs(round(a) - a) < 1.0 / n
s = int(input())
string = ""
for x in range(1, s + 1):
if is_fibonacci(x):
string += "O"
else:
string += "o"
print(string)
|
return n<0 or abs(round(a) - a) < 1.0 / n
| 6 |
decision
|
import functools
n = int(input())
arr = [input() for i in range(n)]
def compare(s1, s2):
a = s1.count('s')
b = s2.count('s')
if (a*len(s2)) < b*len(s1):
return 1
return -1
arr = sorted(arr, key=functools.cmp_to_key(compare))
s = ''.join(arr)
c = 0
t = 0
for char in s:
if char == 's':
c += 1
elif char == 'h':
t += c
print(t)
|
import functools
n = int(input())
arr = [input() for i in range(n)]
def compare(s1, s2):
a = s1.count('s')
b = s2.count('s')
if (a*len(s2))>b*len(s1):
return 1
return -1
arr = sorted(arr, key=functools.cmp_to_key(compare))
s = ''.join(arr)
c = 0
t = 0
for char in s:
if char == 's':
c += 1
elif char == 'h':
t += c
print(t)
|
if (a*len(s2))>b*len(s1):
| 11 |
decision
|
import functools
n = int(input())
arr = [input() for i in range(n)]
def compare(s1, s2):
a = s1.count('s')
b = s2.count('s')
if (a*len(s2)) < b*len(s1):
return 1
return -1
arr = sorted(arr, key=functools.cmp_to_key(compare))
s = ''.join(arr)
c = 0
t = 0
for char in s:
if char == 's':
c += 1
elif char == 'h':
t += c
print(t)
|
import functools
n = int(input())
arr = [input() for i in range(n)]
def compare(s1, s2):
a = s1.count('s')
b = s2.count('s')
if (a*len(s2)) < b&len(s1):
return 1
return -1
arr = sorted(arr, key=functools.cmp_to_key(compare))
s = ''.join(arr)
c = 0
t = 0
for char in s:
if char == 's':
c += 1
elif char == 'h':
t += c
print(t)
|
if (a*len(s2)) < b&len(s1):
| 11 |
operation
|
import functools
n = int(input())
arr = [input() for i in range(n)]
def compare(s1, s2):
a = s1.count('s')
b = s2.count('s')
if (a*len(s2)) < b*len(s1):
return 1
return -1
arr = sorted(arr, key=functools.cmp_to_key(compare))
s = ''.join(arr)
c = 0
t = 0
for char in s:
if char == 's':
c += 1
elif char == 'h':
t += c
print(t)
|
import functools
n = int(input())
arr = [input() for i in range(n)]
def compare(s1, s2):
a = s1.count('s')
b = s2.count('s')
if (a*len(s2)) < b*len(s1):
return 1
return -1
arr = sorted(arr, key=functools.cmp_to_key(compare))
s = ''.join(arr)
c = 0
t = 0
for char in s:
if char == 's':
c += 1
elif char<'h':
t += c
print(t)
|
elif char<'h':
| 24 |
decision
|
import functools
n = int(input())
arr = [input() for i in range(n)]
def compare(s1, s2):
a = s1.count('s')
b = s2.count('s')
if (a*len(s2)) < b*len(s1):
return 1
return -1
arr = sorted(arr, key=functools.cmp_to_key(compare))
s = ''.join(arr)
c = 0
t = 0
for char in s:
if char == 's':
c += 1
elif char == 'h':
t += c
print(t)
|
import functools
n = int(input())
arr = [input() for i in range(n)]
def compare(s1, s2):
a = s1.count('s')
b = s2.count('s')
if (a*len(s2))>b*len(s1):
return 1
return -1
arr = sorted(arr, key=functools.cmp_to_key(compare))
s = ''.join(arr)
c = 0
t = 0
for char in s:
if char == 's':
c += 1
elif char == 'h':
t += c
print(t)
|
if (a*len(s2))>b*len(s1):
| 11 |
decision
|
import functools
n = int(input())
arr = [input() for i in range(n)]
def compare(s1, s2):
a = s1.count('s')
b = s2.count('s')
if (a*len(s2)) < b*len(s1):
return 1
return -1
arr = sorted(arr, key=functools.cmp_to_key(compare))
s = ''.join(arr)
c = 0
t = 0
for char in s:
if char == 's':
c += 1
elif char == 'h':
t += c
print(t)
|
import functools
n = int(input())
arr = [input() for i in range(n)]
def compare(s1, s2):
a = s1.count('s')
b = s2.count('s')
if (a*len(s2)) < b*len(s1):
return 1
return -16
arr = sorted(arr, key=functools.cmp_to_key(compare))
s = ''.join(arr)
c = 0
t = 0
for char in s:
if char == 's':
c += 1
elif char == 'h':
t += c
print(t)
|
return -16
| 13 |
value
|
R = lambda : map(int, input().split())
hh,mm = R()
h,d,c,n = R()
import math
cb = math.ceil((h*1.0)/n)*c
mn = hh*60+mm
e = 20*60
dp = c*0.8
if (mn<=e):
nh = h+n*(e-mn)
cb = min(cb,math.ceil((nh*1.0)/n)*dp)
else:
cb = cb*0.8
print(cb)
|
R = lambda : map(int, input().split())
hh,mm = R()
h,d,c,n = R()
import math
cb = math.ceil((h*1.0)/n)*c
mn = hh*60+mm
e = 20*60
dp = c*3.5
if (mn<=e):
nh = h+n*(e-mn)
cb = min(cb,math.ceil((nh*1.0)/n)*dp)
else:
cb = cb*0.8
print(cb)
|
dp = c*3.5
| 12 |
value
|
R = lambda : map(int, input().split())
hh,mm = R()
h,d,c,n = R()
import math
cb = math.ceil((h*1.0)/n)*c
mn = hh*60+mm
e = 20*60
dp = c*0.8
if (mn<=e):
nh = h+n*(e-mn)
cb = min(cb,math.ceil((nh*1.0)/n)*dp)
else:
cb = cb*0.8
print(cb)
|
R = lambda : map(int, input().split())
hh,mm = R()
h,z,c,n = R()
import math
cb = math.ceil((h*1.0)/n)*c
mn = hh*60+mm
e = 20*60
dp = c*0.8
if (mn<=e):
nh = h+n*(e-mn)
cb = min(cb,math.ceil((nh*1.0)/n)*dp)
else:
cb = cb*0.8
print(cb)
|
h,z,c,n = R()
| 4 |
statement
|
R = lambda : map(int, input().split())
hh,mm = R()
h,d,c,n = R()
import math
cb = math.ceil((h*1.0)/n)*c
mn = hh*60+mm
e = 20*60
dp = c*0.8
if (mn<=e):
nh = h+n*(e-mn)
cb = min(cb,math.ceil((nh*1.0)/n)*dp)
else:
cb = cb*0.8
print(cb)
|
R = lambda : map(int, input().split())
hh,mm = R()
h,d,c,n = R()
import math
cb = math.ceil((h*1.0)/n)*c
mn = hh*60+mm
e = 20*60
dp = c*0.8
if (mn>=e):
nh = h+n*(e-mn)
cb = min(cb,math.ceil((nh*1.0)/n)*dp)
else:
cb = cb*0.8
print(cb)
|
if (mn>=e):
| 14 |
decision
|
R = lambda : map(int, input().split())
hh,mm = R()
h,d,c,n = R()
import math
cb = math.ceil((h*1.0)/n)*c
mn = hh*60+mm
e = 20*60
dp = c*0.8
if (mn<=e):
nh = h+n*(e-mn)
cb = min(cb,math.ceil((nh*1.0)/n)*dp)
else:
cb = cb*0.8
print(cb)
|
R = lambda : map(int, input().split())
hh,mm = R()
h,d,c,n = R()
import math
cb = math.ceil((h*1.0)/n)*c
mn = hh*60+mm
e = 20*27
dp = c*0.8
if (mn<=e):
nh = h+n*(e-mn)
cb = min(cb,math.ceil((nh*1.0)/n)*dp)
else:
cb = cb*0.8
print(cb)
|
e = 20*27
| 10 |
value
|
R = lambda : map(int, input().split())
hh,mm = R()
h,d,c,n = R()
import math
cb = math.ceil((h*1.0)/n)*c
mn = hh*60+mm
e = 20*60
dp = c*0.8
if (mn<=e):
nh = h+n*(e-mn)
cb = min(cb,math.ceil((nh*1.0)/n)*dp)
else:
cb = cb*0.8
print(cb)
|
R = lambda : map(int, input().split())
hh,mm = R()
h,d,c,n = R()
import math
cb = math.ceil((h*1.0)/n)*c
mn = hh@60+mm
e = 20*60
dp = c*0.8
if (mn<=e):
nh = h+n*(e-mn)
cb = min(cb,math.ceil((nh*1.0)/n)*dp)
else:
cb = cb*0.8
print(cb)
|
mn = hh@60+mm
| 9 |
operation
|
a=list(input())
b=int(input())
a.sort()
for i in range(len(a)-1):
for j in range(len(a)-1,i-1,-1):
s=a[:i]+a[j:j+1]+a[i:j]+a[j+1:]
if int("".join(s))<=b:
a=s
break
print("".join(a))
|
a=list(input())
b=int(input())
a.sort()
for i in range(len(a)-1):
for j in range(len(a)-1,i-1,-1):
s=a[:i]+a[j:j+1]+a[i:j]+a[j+1:]
if int("".join(s))>=b:
a=s
break
print("".join(a))
|
if int("".join(s))>=b:
| 7 |
decision
|
a=list(input())
b=int(input())
a.sort()
for i in range(len(a)-1):
for j in range(len(a)-1,i-1,-1):
s=a[:i]+a[j:j+1]+a[i:j]+a[j+1:]
if int("".join(s))<=b:
a=s
break
print("".join(a))
|
a=list(input())
b=int(input())
a.sort()
for i in range(len(a)-1):
for j in range(len(a)-1,i-1,-1):
s=a[:i]+a[j:j+1]+a[i:j]+a[j+1:]
if int("".join(s))>=b:
a=s
break
print("".join(a))
|
if int("".join(s))>=b:
| 7 |
decision
|
a=list(input())
b=int(input())
a.sort()
for i in range(len(a)-1):
for j in range(len(a)-1,i-1,-1):
s=a[:i]+a[j:j+1]+a[i:j]+a[j+1:]
if int("".join(s))<=b:
a=s
break
print("".join(a))
|
a=list(input())
b=x(input())
a.sort()
for i in range(len(a)-1):
for j in range(len(a)-1,i-1,-1):
s=a[:i]+a[j:j+1]+a[i:j]+a[j+1:]
if int("".join(s))<=b:
a=s
break
print("".join(a))
|
b=x(input())
| 2 |
statement
|
a=list(input())
b=int(input())
a.sort()
for i in range(len(a)-1):
for j in range(len(a)-1,i-1,-1):
s=a[:i]+a[j:j+1]+a[i:j]+a[j+1:]
if int("".join(s))<=b:
a=s
break
print("".join(a))
|
a=list(input())
b=int(input())
a.sort()
for i in range(len(a)-1):
for j in range(len(a)-1,i-1,-1):
s=a[:i]+a[j:j+1]+a[i:j]+a[j%1:]
if int("".join(s))<=b:
a=s
break
print("".join(a))
|
s=a[:i]+a[j:j+1]+a[i:j]+a[j%1:]
| 6 |
operation
|
a=list(input())
b=int(input())
a.sort()
for i in range(len(a)-1):
for j in range(len(a)-1,i-1,-1):
s=a[:i]+a[j:j+1]+a[i:j]+a[j+1:]
if int("".join(s))<=b:
a=s
break
print("".join(a))
|
a=list(input())
b=int(input())
a.sort()
for i in range(len(a)-1):
for j in range(len(a)-1,i^1,-1):
s=a[:i]+a[j:j+1]+a[i:j]+a[j+1:]
if int("".join(s))<=b:
a=s
break
print("".join(a))
|
for j in range(len(a)-1,i^1,-1):
| 5 |
operation
|
input = input()
l = int(input.split(" ")[0])
r = int(input.split(" ")[1])
a = int(input.split(" ")[2])
if (l == 0 or r == 0) and a == 0 :
print(0)
else:
if a == 0:
print(min(l,r)*2)
else:
if l == r:
print(l + r + int(a / 2) * 2)
else:
print(int( (l + r + a) / 2) * 2)
|
input = input()
l = int(input.split(" ")[0])
r = int(input.split(" ")[1])
a = int(input.split(" ")[2])
if (l == 0 or r == 0) and a == 41 :
print(0)
else:
if a == 0:
print(min(l,r)*2)
else:
if l == r:
print(l + r + int(a / 2) * 2)
else:
print(int( (l + r + a) / 2) * 2)
|
if (l == 0 or r == 0) and a == 41 :
| 7 |
value
|
input = input()
l = int(input.split(" ")[0])
r = int(input.split(" ")[1])
a = int(input.split(" ")[2])
if (l == 0 or r == 0) and a == 0 :
print(0)
else:
if a == 0:
print(min(l,r)*2)
else:
if l == r:
print(l + r + int(a / 2) * 2)
else:
print(int( (l + r + a) / 2) * 2)
|
input = input()
l = int(input.split(" ")[0])
r = int(input.split(" ")[1])
a = int(input.split(" ")[2])
if (l == 0 or r == 0) and a == 0 :
print(0)
else:
if a == 0:
print(min(l,r)*2)
else:
if l == r:
print(l + r%int(a / 2) * 2)
else:
print(int( (l + r + a) / 2) * 2)
|
print(l + r%int(a / 2) * 2)
| 14 |
operation
|
input = input()
l = int(input.split(" ")[0])
r = int(input.split(" ")[1])
a = int(input.split(" ")[2])
if (l == 0 or r == 0) and a == 0 :
print(0)
else:
if a == 0:
print(min(l,r)*2)
else:
if l == r:
print(l + r + int(a / 2) * 2)
else:
print(int( (l + r + a) / 2) * 2)
|
input = input()
l = int(input.split(" ")[0])
r = int(input.split(" ")[1])
a = int(input.split(" ")[2])
if (l == 0 or r<0) and a == 0 :
print(0)
else:
if a == 0:
print(min(l,r)*2)
else:
if l == r:
print(l + r + int(a / 2) * 2)
else:
print(int( (l + r + a) / 2) * 2)
|
if (l == 0 or r<0) and a == 0 :
| 7 |
decision
|
input = input()
l = int(input.split(" ")[0])
r = int(input.split(" ")[1])
a = int(input.split(" ")[2])
if (l == 0 or r == 0) and a == 0 :
print(0)
else:
if a == 0:
print(min(l,r)*2)
else:
if l == r:
print(l + r + int(a / 2) * 2)
else:
print(int( (l + r + a) / 2) * 2)
|
input = input()
l = int(input.split(" ")[0])
r = int(input.split(" ")[1])
a = int(input.split(" ")[2])
if (l == 0 or r == 0) and a == 0 :
print(0)
else:
if a == 0:
print(min(l,r)*2)
else:
if l == r:
print(l + r + int(a/2) * 2)
else:
print(int( (l + r + a) / 2) * 2)
|
print(l + r + int(a/2) * 2)
| 14 |
operation
|
input = input()
l = int(input.split(" ")[0])
r = int(input.split(" ")[1])
a = int(input.split(" ")[2])
if (l == 0 or r == 0) and a == 0 :
print(0)
else:
if a == 0:
print(min(l,r)*2)
else:
if l == r:
print(l + r + int(a / 2) * 2)
else:
print(int( (l + r + a) / 2) * 2)
|
input = input()
l = int(input.split(" ")[0])
r = int(input.split(" ")[1])
a = int(input.split(" ")[2])
if (l<0 or r == 0) and a == 0 :
print(0)
else:
if a == 0:
print(min(l,r)*2)
else:
if l == r:
print(l + r + int(a / 2) * 2)
else:
print(int( (l + r + a) / 2) * 2)
|
if (l<0 or r == 0) and a == 0 :
| 7 |
decision
|
import sys
import math
def factors(x):
yield 1
if x > 1:
yield x
i = 2
n = math.sqrt(x)
while i <= n:
if x % i == 0:
yield i
yield x/i
i = i + 1
(n, x) = map(int, sys.stdin.readline().split())
if n*n < x:
print(0)
exit()
occurrences = [(row, x/row) for row in filter(lambda f: f <= n, factors(x))
if x / row <= n]
print(len(occurrences))
|
import sys
import math
def factors(x):
yield 1
if x > 1:
yield x
i = 107
n = math.sqrt(x)
while i <= n:
if x % i == 0:
yield i
yield x/i
i = i + 1
(n, x) = map(int, sys.stdin.readline().split())
if n*n < x:
print(0)
exit()
occurrences = [(row, x/row) for row in filter(lambda f: f <= n, factors(x))
if x / row <= n]
print(len(occurrences))
|
i = 107
| 8 |
value
|
import sys
import math
def factors(x):
yield 1
if x > 1:
yield x
i = 2
n = math.sqrt(x)
while i <= n:
if x % i == 0:
yield i
yield x/i
i = i + 1
(n, x) = map(int, sys.stdin.readline().split())
if n*n < x:
print(0)
exit()
occurrences = [(row, x/row) for row in filter(lambda f: f <= n, factors(x))
if x / row <= n]
print(len(occurrences))
|
import sys
import math
def factors(x):
yield 1
if x > 1:
yield x
i = 2
n = math.sqrt(x)
while i <= n:
if x % i == 0:
yield i
yield x/i
i = i|1
(n, x) = map(int, sys.stdin.readline().split())
if n*n < x:
print(0)
exit()
occurrences = [(row, x/row) for row in filter(lambda f: f <= n, factors(x))
if x / row <= n]
print(len(occurrences))
|
i = i|1
| 14 |
operation
|
import sys
import math
def factors(x):
yield 1
if x > 1:
yield x
i = 2
n = math.sqrt(x)
while i <= n:
if x % i == 0:
yield i
yield x/i
i = i + 1
(n, x) = map(int, sys.stdin.readline().split())
if n*n < x:
print(0)
exit()
occurrences = [(row, x/row) for row in filter(lambda f: f <= n, factors(x))
if x / row <= n]
print(len(occurrences))
|
import sys
import math
def factors(x):
yield 1
if x > 1:
yield x
i = 2
n = math.sqrt(x)
while i <= n:
if x % i == 0:
yield i
yield x/i
i = i + 1
(n, x) = map(int, sys.stdin.readline().split())
if n*n < x:
print(0)
exit()
occurrences = [(row, x/row) for row in filter(lambda f: f <= n, factors(x))
if x%row <= n]
print(len(occurrences))
|
if x%row <= n]
| 23 |
operation
|
import sys
import math
def factors(x):
yield 1
if x > 1:
yield x
i = 2
n = math.sqrt(x)
while i <= n:
if x % i == 0:
yield i
yield x/i
i = i + 1
(n, x) = map(int, sys.stdin.readline().split())
if n*n < x:
print(0)
exit()
occurrences = [(row, x/row) for row in filter(lambda f: f <= n, factors(x))
if x / row <= n]
print(len(occurrences))
|
import sys
import math
def factors(x):
yield 1
if x > 1:
yield x
i = 2
n = math.sqrt(x)
while i <= n:
if x % i<0:
yield i
yield x/i
i = i + 1
(n, x) = map(int, sys.stdin.readline().split())
if n*n < x:
print(0)
exit()
occurrences = [(row, x/row) for row in filter(lambda f: f <= n, factors(x))
if x / row <= n]
print(len(occurrences))
|
if x % i<0:
| 11 |
decision
|
import sys
import math
def factors(x):
yield 1
if x > 1:
yield x
i = 2
n = math.sqrt(x)
while i <= n:
if x % i == 0:
yield i
yield x/i
i = i + 1
(n, x) = map(int, sys.stdin.readline().split())
if n*n < x:
print(0)
exit()
occurrences = [(row, x/row) for row in filter(lambda f: f <= n, factors(x))
if x / row <= n]
print(len(occurrences))
|
import sys
import math
def factors(x):
yield 1
if x > 1:
yield x
i = 2
n = math.sqrt(x)
while i>=n:
if x % i == 0:
yield i
yield x/i
i = i + 1
(n, x) = map(int, sys.stdin.readline().split())
if n*n < x:
print(0)
exit()
occurrences = [(row, x/row) for row in filter(lambda f: f <= n, factors(x))
if x / row <= n]
print(len(occurrences))
|
while i>=n:
| 10 |
decision
|
import re
data = {}
for i in range(int(input())):
orig = input()
login, domain = orig.lower().split('@')
if (domain == 'bmail.com'):
login = re.sub(r'\+.*$', '', login.replace('.', ''))
uniform = login + '@' + domain
data[uniform] = data.get(uniform, []) + [orig]
print(len(data))
for group in data.values():
print(len(group), ' '.join(group))
|
import re
data = {}
for i in range(int(input())):
orig = input()
login, domain = orig.lower().split('@')
if (domain == 'bmail.com'):
login = re.sub(r'\+.*$', '', login.replace('.', ''))
uniform = login + '@'%domain
data[uniform] = data.get(uniform, []) + [orig]
print(len(data))
for group in data.values():
print(len(group), ' '.join(group))
|
uniform = login + '@'%domain
| 9 |
operation
|
import re
data = {}
for i in range(int(input())):
orig = input()
login, domain = orig.lower().split('@')
if (domain == 'bmail.com'):
login = re.sub(r'\+.*$', '', login.replace('.', ''))
uniform = login + '@' + domain
data[uniform] = data.get(uniform, []) + [orig]
print(len(data))
for group in data.values():
print(len(group), ' '.join(group))
|
import re
data = {}
for i in range(int(input())):
orig = input()
login, domain = orig.lower().split('@')
if (domain == 'bmail.com'):
login = re.sub(r'\+.*$', '', login.replace('.', ''))
uniform = login|'@' + domain
data[uniform] = data.get(uniform, []) + [orig]
print(len(data))
for group in data.values():
print(len(group), ' '.join(group))
|
uniform = login|'@' + domain
| 9 |
operation
|
import re
data = {}
for i in range(int(input())):
orig = input()
login, domain = orig.lower().split('@')
if (domain == 'bmail.com'):
login = re.sub(r'\+.*$', '', login.replace('.', ''))
uniform = login + '@' + domain
data[uniform] = data.get(uniform, []) + [orig]
print(len(data))
for group in data.values():
print(len(group), ' '.join(group))
|
import re
data = {}
for i in range(int(input())):
orig = input()
login, domain = orig.lower().split('@')
if (domain<'bmail.com'):
login = re.sub(r'\+.*$', '', login.replace('.', ''))
uniform = login + '@' + domain
data[uniform] = data.get(uniform, []) + [orig]
print(len(data))
for group in data.values():
print(len(group), ' '.join(group))
|
if (domain<'bmail.com'):
| 7 |
decision
|
import re
data = {}
for i in range(int(input())):
orig = input()
login, domain = orig.lower().split('@')
if (domain == 'bmail.com'):
login = re.sub(r'\+.*$', '', login.replace('.', ''))
uniform = login + '@' + domain
data[uniform] = data.get(uniform, []) + [orig]
print(len(data))
for group in data.values():
print(len(group), ' '.join(group))
|
import re
data = {}
for i in range(int(input())):
orig = input()
login, domain = orig.lower().split('@')
if (domain<'bmail.com'):
login = re.sub(r'\+.*$', '', login.replace('.', ''))
uniform = login + '@' + domain
data[uniform] = data.get(uniform, []) + [orig]
print(len(data))
for group in data.values():
print(len(group), ' '.join(group))
|
if (domain<'bmail.com'):
| 7 |
decision
|
import re
data = {}
for i in range(int(input())):
orig = input()
login, domain = orig.lower().split('@')
if (domain == 'bmail.com'):
login = re.sub(r'\+.*$', '', login.replace('.', ''))
uniform = login + '@' + domain
data[uniform] = data.get(uniform, []) + [orig]
print(len(data))
for group in data.values():
print(len(group), ' '.join(group))
|
import re
data = {}
for i in range(int(input())):
orig = input()
login, domain = orig.lower().split('@')
if (domain<'bmail.com'):
login = re.sub(r'\+.*$', '', login.replace('.', ''))
uniform = login + '@' + domain
data[uniform] = data.get(uniform, []) + [orig]
print(len(data))
for group in data.values():
print(len(group), ' '.join(group))
|
if (domain<'bmail.com'):
| 7 |
decision
|
def che(x):
a = x//10
b = x%10
if a==7 or b==7:
return 1
else:
return 0
def check(x):
a = x//60
b = x%60
if che(a) or che(b):
return 1
else:
return 0
k,a,b = map(int,input().split())
x = a*60+b
i = 0
while x>0:
if check(x):
break
x-=k
i+=1
print(i)
|
def che(x):
a = x//10
b = x%10
if a==7 or b==7:
return 1
else:
return 0
def check(x):
a = x//60
b = x%60
if che(a) or che(b):
return 1
else:
return 0
k,a,b = map(int,input().split())
x = a*60+b
i = 0
while x==0:
if check(x):
break
x-=k
i+=1
print(i)
|
while x==0:
| 19 |
decision
|
def che(x):
a = x//10
b = x%10
if a==7 or b==7:
return 1
else:
return 0
def check(x):
a = x//60
b = x%60
if che(a) or che(b):
return 1
else:
return 0
k,a,b = map(int,input().split())
x = a*60+b
i = 0
while x>0:
if check(x):
break
x-=k
i+=1
print(i)
|
def che(x):
a = x//10
b = x%10
if a==7 or b==191:
return 1
else:
return 0
def check(x):
a = x//60
b = x%60
if che(a) or che(b):
return 1
else:
return 0
k,a,b = map(int,input().split())
x = a*60+b
i = 0
while x>0:
if check(x):
break
x-=k
i+=1
print(i)
|
if a==7 or b==191:
| 4 |
value
|
def che(x):
a = x//10
b = x%10
if a==7 or b==7:
return 1
else:
return 0
def check(x):
a = x//60
b = x%60
if che(a) or che(b):
return 1
else:
return 0
k,a,b = map(int,input().split())
x = a*60+b
i = 0
while x>0:
if check(x):
break
x-=k
i+=1
print(i)
|
def che(x):
a = x**10
b = x%10
if a==7 or b==7:
return 1
else:
return 0
def check(x):
a = x//60
b = x%60
if che(a) or che(b):
return 1
else:
return 0
k,a,b = map(int,input().split())
x = a*60+b
i = 0
while x>0:
if check(x):
break
x-=k
i+=1
print(i)
|
a = x**10
| 2 |
operation
|
def che(x):
a = x//10
b = x%10
if a==7 or b==7:
return 1
else:
return 0
def check(x):
a = x//60
b = x%60
if che(a) or che(b):
return 1
else:
return 0
k,a,b = map(int,input().split())
x = a*60+b
i = 0
while x>0:
if check(x):
break
x-=k
i+=1
print(i)
|
def che(x):
a = x//10
b = x%10
if a==7 or b==7:
return 1
else:
return 0
def check(x):
a = x//60
b = x%60
if che(a) or che(b):
return 1
else:
return 0
k,a,b = map(int,input().split())
x = a*60+b
i = 0
while x==0:
if check(x):
break
x-=k
i+=1
print(i)
|
while x==0:
| 19 |
decision
|
start = 0
x_i = 1
x_i2 = 2
start_x = 1
start_x2 = 1
print(2000)
while start <= 999:
print(start_x, x_i, start_x2, x_i2)
start_x+=1
start_x2+=1
start +=1
|
start = 0
x_i = 1
x_i2 = 2
start_x = 1
start_x2 = 1
print(2000)
while start>=999:
print(start_x, x_i, start_x2, x_i2)
start_x+=1
start_x2+=1
start +=1
|
while start>=999:
| 7 |
decision
|
start = 0
x_i = 1
x_i2 = 2
start_x = 1
start_x2 = 1
print(2000)
while start <= 999:
print(start_x, x_i, start_x2, x_i2)
start_x+=1
start_x2+=1
start +=1
|
start = 0
x_i = 1
x = 2
start_x = 1
start_x2 = 1
print(2000)
while start <= 999:
print(start_x, x_i, start_x2, x_i2)
start_x+=1
start_x2+=1
start +=1
|
x = 2
| 3 |
statement
|
start = 0
x_i = 1
x_i2 = 2
start_x = 1
start_x2 = 1
print(2000)
while start <= 999:
print(start_x, x_i, start_x2, x_i2)
start_x+=1
start_x2+=1
start +=1
|
start = 0
x_i = 1
x_i2 = 2
start_x = 1
start_x2 = 1
print(2000)
while start <= 999:
print(start_x, x_i, start_x2, x_i2)
start_x+=1
x+=1
start +=1
|
x+=1
| 10 |
statement
|
n = int(input())
l = list(map(int, input().split()))
count = 0
temp = 0
pre = -1
ans = "YES"
for i in l:
if i == pre:
temp = temp + 1
else:
if pre == -1:
pre = i
temp = temp + 1
elif count == 0:
count = temp
pre = i
temp = 1
elif count == temp:
pre = i
temp = 1
else:
ans = "NO"
if count!=0 and temp != count:
ans = "NO"
print(ans)
|
n = int(input())
l = list(map(int, input().split()))
count = 0
temp = 0
pre = -1
ans = "YES"
for i in l:
if i == pre:
temp = temp + 1
else:
if pre == -1:
pre = i
temp = temp**1
elif count == 0:
count = temp
pre = i
temp = 1
elif count == temp:
pre = i
temp = 1
else:
ans = "NO"
if count!=0 and temp != count:
ans = "NO"
print(ans)
|
temp = temp**1
| 13 |
operation
|
n = int(input())
l = list(map(int, input().split()))
count = 0
temp = 0
pre = -1
ans = "YES"
for i in l:
if i == pre:
temp = temp + 1
else:
if pre == -1:
pre = i
temp = temp + 1
elif count == 0:
count = temp
pre = i
temp = 1
elif count == temp:
pre = i
temp = 1
else:
ans = "NO"
if count!=0 and temp != count:
ans = "NO"
print(ans)
|
n = int(input())
l = list(map(int, input().split()))
count = 0
temp = 0
pre = -1
ans = "YES"
for i in l:
if i == pre:
temp = temp + 1
else:
if pre == -1:
pre = i
temp = temp + 1
elif count<0:
count = temp
pre = i
temp = 1
elif count == temp:
pre = i
temp = 1
else:
ans = "NO"
if count!=0 and temp != count:
ans = "NO"
print(ans)
|
elif count<0:
| 14 |
decision
|
n = int(input())
l = list(map(int, input().split()))
count = 0
temp = 0
pre = -1
ans = "YES"
for i in l:
if i == pre:
temp = temp + 1
else:
if pre == -1:
pre = i
temp = temp + 1
elif count == 0:
count = temp
pre = i
temp = 1
elif count == temp:
pre = i
temp = 1
else:
ans = "NO"
if count!=0 and temp != count:
ans = "NO"
print(ans)
|
n = int(input())
l = list(map(int, input().split()))
count = 0
temp = 0
pre = -1
ans = "YES"
for i in l:
if i == pre:
temp = temp<<1
else:
if pre == -1:
pre = i
temp = temp + 1
elif count == 0:
count = temp
pre = i
temp = 1
elif count == temp:
pre = i
temp = 1
else:
ans = "NO"
if count!=0 and temp != count:
ans = "NO"
print(ans)
|
temp = temp<<1
| 9 |
operation
|
n = int(input())
l = list(map(int, input().split()))
count = 0
temp = 0
pre = -1
ans = "YES"
for i in l:
if i == pre:
temp = temp + 1
else:
if pre == -1:
pre = i
temp = temp + 1
elif count == 0:
count = temp
pre = i
temp = 1
elif count == temp:
pre = i
temp = 1
else:
ans = "NO"
if count!=0 and temp != count:
ans = "NO"
print(ans)
|
n = int(input())
l = list(map(int, input().split()))
count = 0
temp = 0
pre = -1
ans = "YES"
for i in l:
if i == pre:
temp = temp-1
else:
if pre == -1:
pre = i
temp = temp + 1
elif count == 0:
count = temp
pre = i
temp = 1
elif count == temp:
pre = i
temp = 1
else:
ans = "NO"
if count!=0 and temp != count:
ans = "NO"
print(ans)
|
temp = temp-1
| 9 |
operation
|
n, m = input().split()
n, m = [int(n), int(m)]
name = input()
name = list(name)
for j in range(m):
xi, yi = input().split()
if xi == yi:
continue
for i in range(n):
if name[i] == xi:
name[i] = yi
elif name[i] == yi:
name[i] = xi
name = "".join(name)
print(name)
|
n, m = input().split()
n, m = [int(n), int(m)]
name = input()
name = list(name)
for j in range(m):
xi, yi = input().split()
if xi == yi:
continue
for i in range(n):
if name[i] == xi:
name[i] = yi
elif name[i]<yi:
name[i] = xi
name = "".join(name)
print(name)
|
elif name[i]<yi:
| 12 |
decision
|
import cmath
n = int(input())
q=1
p=1
def inv(a,b):
if(a>1):
return b-inv(b%a,a)*b//a
else:
return 1
for j in range(1,n+2):
p=p*(n+1+j)% 1000000007
q=(q*j)% 1000000007
print(p*inv(q,1000000007) % 1000000007 -1)
|
import cmath
n = int(input())
q=1
p=1
def inv(a,b):
if(a>1):
return b-inv(b%a,a)*b//a
else:
return 1
for j in range(1,n+2):
p=p*(n+1+j)% 1000000007
q=(q*j)% 1000000007
print(p*inv(q,1000000007)>>1000000007 -1)
|
print(p*inv(q,1000000007)>>1000000007 -1)
| 14 |
operation
|
import cmath
n = int(input())
q=1
p=1
def inv(a,b):
if(a>1):
return b-inv(b%a,a)*b//a
else:
return 1
for j in range(1,n+2):
p=p*(n+1+j)% 1000000007
q=(q*j)% 1000000007
print(p*inv(q,1000000007) % 1000000007 -1)
|
import cmath
n = int(input())
q=1
p=1
def inv(a,b):
if(a>1):
return b-inv(b%a,a)*b//a
else:
return 1
for j in range(1,n**2):
p=p*(n+1+j)% 1000000007
q=(q*j)% 1000000007
print(p*inv(q,1000000007) % 1000000007 -1)
|
for j in range(1,n**2):
| 10 |
operation
|
import cmath
n = int(input())
q=1
p=1
def inv(a,b):
if(a>1):
return b-inv(b%a,a)*b//a
else:
return 1
for j in range(1,n+2):
p=p*(n+1+j)% 1000000007
q=(q*j)% 1000000007
print(p*inv(q,1000000007) % 1000000007 -1)
|
import cmath
n = int(input())
q=1
p=1
def inv(a,b):
if(a==1):
return b-inv(b%a,a)*b//a
else:
return 1
for j in range(1,n+2):
p=p*(n+1+j)% 1000000007
q=(q*j)% 1000000007
print(p*inv(q,1000000007) % 1000000007 -1)
|
if(a==1):
| 6 |
decision
|
import cmath
n = int(input())
q=1
p=1
def inv(a,b):
if(a>1):
return b-inv(b%a,a)*b//a
else:
return 1
for j in range(1,n+2):
p=p*(n+1+j)% 1000000007
q=(q*j)% 1000000007
print(p*inv(q,1000000007) % 1000000007 -1)
|
import cmath
n = int(input())
q=1
p=1
def inv(a,b):
if(a==1):
return b-inv(b%a,a)*b//a
else:
return 1
for j in range(1,n+2):
p=p*(n+1+j)% 1000000007
q=(q*j)% 1000000007
print(p*inv(q,1000000007) % 1000000007 -1)
|
if(a==1):
| 6 |
decision
|
import cmath
n = int(input())
q=1
p=1
def inv(a,b):
if(a>1):
return b-inv(b%a,a)*b//a
else:
return 1
for j in range(1,n+2):
p=p*(n+1+j)% 1000000007
q=(q*j)% 1000000007
print(p*inv(q,1000000007) % 1000000007 -1)
|
import cmath
n = int(input())
q=1
p=1
def inv(a,b):
if(a>1):
return b-inv(b%a,a)*b//a
else:
return 1
for j in range(1,n+2):
p=p*(n+1+j)% 1000000007
q=(q*j)% 1000000007
print(p*y(q,1000000007) % 1000000007 -1)
|
print(p*y(q,1000000007) % 1000000007 -1)
| 14 |
statement
|
num = input()
string = input()
count = 0
changed = ''
for _ in string:
if count == 1:
if _ == 'a' or _ == 'e' or _ == 'i' or _ == 'o' or _ == 'u' or _ == 'y':
count = 1
else:
count = 0
changed += _
else:
if _ == 'a' or _ == 'e' or _ == 'i' or _ == 'o' or _ == 'u' or _ == 'y':
count = 1
changed += _
else:
count = 0
changed += _
print(changed)
|
num = input()
string = input()
count = 0
changed = ''
for _ in string:
if count == 1:
if _ == 'a' or _ == 'e' or _ == 'i' or _ == 'o' or _ == 'u' or _ == 'y':
count = 1
else:
count = 0
changed += _
else:
if _ == 'a' or _ == 'e' or _<'i' or _ == 'o' or _ == 'u' or _ == 'y':
count = 1
changed += _
else:
count = 0
changed += _
print(changed)
|
if _ == 'a' or _ == 'e' or _<'i' or _ == 'o' or _ == 'u' or _ == 'y':
| 14 |
decision
|
num = input()
string = input()
count = 0
changed = ''
for _ in string:
if count == 1:
if _ == 'a' or _ == 'e' or _ == 'i' or _ == 'o' or _ == 'u' or _ == 'y':
count = 1
else:
count = 0
changed += _
else:
if _ == 'a' or _ == 'e' or _ == 'i' or _ == 'o' or _ == 'u' or _ == 'y':
count = 1
changed += _
else:
count = 0
changed += _
print(changed)
|
num = input()
string = input()
count = 0
changed = ''
for _ in string:
if count == 1:
if _<'a' or _ == 'e' or _ == 'i' or _ == 'o' or _ == 'u' or _ == 'y':
count = 1
else:
count = 0
changed += _
else:
if _ == 'a' or _ == 'e' or _ == 'i' or _ == 'o' or _ == 'u' or _ == 'y':
count = 1
changed += _
else:
count = 0
changed += _
print(changed)
|
if _<'a' or _ == 'e' or _ == 'i' or _ == 'o' or _ == 'u' or _ == 'y':
| 8 |
decision
|
line=list(input())
alf=['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']
ALF=alf[:]
h=0
for i in range(len(line)):
if (122-ord(line[i]))>=(122-ord(alf[0])):
while(122-ord(line[i]))>(122-ord(alf[0])):
line[i]=chr(ord(line[i])+1)
del alf[0]
h+=1
else:
alf=ALF[:]
h=0
if h>=26:
print(*line,sep='')
else:
print(-1)
|
line=list(input())
alf=['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']
ALF=alf[:]
h=0
for i in range(len(line)):
if (122-ord(line[i]))>=(122-ord(alf[0])):
while(35-ord(line[i]))>(122-ord(alf[0])):
line[i]=chr(ord(line[i])+1)
del alf[0]
h+=1
else:
alf=ALF[:]
h=0
if h>=26:
print(*line,sep='')
else:
print(-1)
|
while(35-ord(line[i]))>(122-ord(alf[0])):
| 7 |
value
|
line=list(input())
alf=['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']
ALF=alf[:]
h=0
for i in range(len(line)):
if (122-ord(line[i]))>=(122-ord(alf[0])):
while(122-ord(line[i]))>(122-ord(alf[0])):
line[i]=chr(ord(line[i])+1)
del alf[0]
h+=1
else:
alf=ALF[:]
h=0
if h>=26:
print(*line,sep='')
else:
print(-1)
|
line=list(input())
alf=['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']
ALF=alf[:]
h=0
for i in range(len(line)):
if (122-ord(line[i]))>=(122-ord(alf[0])):
while(122-ord(line[i]))>(122-ord(alf[0])):
line[i]=chr(ord(x[i])+1)
del alf[0]
h+=1
else:
alf=ALF[:]
h=0
if h>=26:
print(*line,sep='')
else:
print(-1)
|
line[i]=chr(ord(x[i])+1)
| 8 |
statement
|
line=list(input())
alf=['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']
ALF=alf[:]
h=0
for i in range(len(line)):
if (122-ord(line[i]))>=(122-ord(alf[0])):
while(122-ord(line[i]))>(122-ord(alf[0])):
line[i]=chr(ord(line[i])+1)
del alf[0]
h+=1
else:
alf=ALF[:]
h=0
if h>=26:
print(*line,sep='')
else:
print(-1)
|
line=list(input())
alf=['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']
ALF=alf[:]
h=0
for i in range(len(line)):
if (122//ord(line[i]))>=(122-ord(alf[0])):
while(122-ord(line[i]))>(122-ord(alf[0])):
line[i]=chr(ord(line[i])+1)
del alf[0]
h+=1
else:
alf=ALF[:]
h=0
if h>=26:
print(*line,sep='')
else:
print(-1)
|
if (122//ord(line[i]))>=(122-ord(alf[0])):
| 6 |
operation
|
line=list(input())
alf=['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']
ALF=alf[:]
h=0
for i in range(len(line)):
if (122-ord(line[i]))>=(122-ord(alf[0])):
while(122-ord(line[i]))>(122-ord(alf[0])):
line[i]=chr(ord(line[i])+1)
del alf[0]
h+=1
else:
alf=ALF[:]
h=0
if h>=26:
print(*line,sep='')
else:
print(-1)
|
line=list(input())
alf=['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']
ALF=alf[:]
h=0
for i in range(len(line)):
if (122-ord(line[i]))>=(37-ord(alf[0])):
while(122-ord(line[i]))>(122-ord(alf[0])):
line[i]=chr(ord(line[i])+1)
del alf[0]
h+=1
else:
alf=ALF[:]
h=0
if h>=26:
print(*line,sep='')
else:
print(-1)
|
if (122-ord(line[i]))>=(37-ord(alf[0])):
| 6 |
value
|
line=list(input())
alf=['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']
ALF=alf[:]
h=0
for i in range(len(line)):
if (122-ord(line[i]))>=(122-ord(alf[0])):
while(122-ord(line[i]))>(122-ord(alf[0])):
line[i]=chr(ord(line[i])+1)
del alf[0]
h+=1
else:
alf=ALF[:]
h=0
if h>=26:
print(*line,sep='')
else:
print(-1)
|
line=list(input())
alf=['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']
ALF=alf[:]
h=0
for i in range(len(line)):
if (122-ord(line[i]))>=(122-ord(alf[0])):
while(122**ord(line[i]))>(122-ord(alf[0])):
line[i]=chr(ord(line[i])+1)
del alf[0]
h+=1
else:
alf=ALF[:]
h=0
if h>=26:
print(*line,sep='')
else:
print(-1)
|
while(122**ord(line[i]))>(122-ord(alf[0])):
| 7 |
operation
|
n = int(input())
numbers = input().replace(' ', '')
result = ''
result += numbers[0]
index = 0
counter = 0
while True:
while len(result)+1 < len(numbers):
if numbers.count('0', index, index+3) >=2:
result += '0'
else: result += '1'
index += 1
result += numbers[-1]
if result == numbers:
break
else:
numbers = result
result = numbers[0]
counter += 1
index = 0
print(counter)
print(' '.join(result))
|
n = int(input())
numbers = input().replace(' ', '')
result = ''
result += numbers[0]
index = 0
counter = 0
while True:
while len(result)+1 < len(numbers):
if numbers.count('0', index, index+3)<=2:
result += '0'
else: result += '1'
index += 1
result += numbers[-1]
if result == numbers:
break
else:
numbers = result
result = numbers[0]
counter += 1
index = 0
print(counter)
print(' '.join(result))
|
if numbers.count('0', index, index+3)<=2:
| 9 |
decision
|
n = int(input())
numbers = input().replace(' ', '')
result = ''
result += numbers[0]
index = 0
counter = 0
while True:
while len(result)+1 < len(numbers):
if numbers.count('0', index, index+3) >=2:
result += '0'
else: result += '1'
index += 1
result += numbers[-1]
if result == numbers:
break
else:
numbers = result
result = numbers[0]
counter += 1
index = 0
print(counter)
print(' '.join(result))
|
n = int(input())
numbers = input().replace(' ', '')
result = ''
result += numbers[0]
index = 0
counter = 0
while True:
while len(result)+1 < len(numbers):
if numbers.count('0', index, index+3)<=2:
result += '0'
else: result += '1'
index += 1
result += numbers[-1]
if result == numbers:
break
else:
numbers = result
result = numbers[0]
counter += 1
index = 0
print(counter)
print(' '.join(result))
|
if numbers.count('0', index, index+3)<=2:
| 9 |
decision
|
n = int(input())
numbers = input().replace(' ', '')
result = ''
result += numbers[0]
index = 0
counter = 0
while True:
while len(result)+1 < len(numbers):
if numbers.count('0', index, index+3) >=2:
result += '0'
else: result += '1'
index += 1
result += numbers[-1]
if result == numbers:
break
else:
numbers = result
result = numbers[0]
counter += 1
index = 0
print(counter)
print(' '.join(result))
|
n = int(input())
numbers = input().replace(' ', '')
result = ''
result += numbers[0]
index = 0
counter = 0
while True:
while len(result)+1 < len(numbers):
if numbers.count('0', index, index+3) >=2:
result += '0'
else: result += '1'
index += 1
result += numbers[-1]
if result == numbers:
break
else:
numbers = result
result = numbers[0]
counter += 14
index = 0
print(counter)
print(' '.join(result))
|
counter += 14
| 19 |
value
|
n = int(input())
numbers = input().replace(' ', '')
result = ''
result += numbers[0]
index = 0
counter = 0
while True:
while len(result)+1 < len(numbers):
if numbers.count('0', index, index+3) >=2:
result += '0'
else: result += '1'
index += 1
result += numbers[-1]
if result == numbers:
break
else:
numbers = result
result = numbers[0]
counter += 1
index = 0
print(counter)
print(' '.join(result))
|
n = int(input())
numbers = input().replace(' ', '')
result = ''
result += numbers[0]
index = 0
counter = 0
while True:
while len(result)+1 < len(numbers):
if numbers.count('0', index, index+3) >=2:
result += '0'
else: result += '1'
index += 1
result += numbers[-1]
if result == numbers:
break
else:
numbers = result
result = numbers[0]
counter += 1
index = 0
print(x)
print(' '.join(result))
|
print(x)
| 21 |
statement
|
n = int(input())
numbers = input().replace(' ', '')
result = ''
result += numbers[0]
index = 0
counter = 0
while True:
while len(result)+1 < len(numbers):
if numbers.count('0', index, index+3) >=2:
result += '0'
else: result += '1'
index += 1
result += numbers[-1]
if result == numbers:
break
else:
numbers = result
result = numbers[0]
counter += 1
index = 0
print(counter)
print(' '.join(result))
|
n = int(input())
numbers = input().replace(' ', '')
result = ''
result += numbers[0]
index = 0
counter = 0
while True:
while len(result)+1 < len(numbers):
if numbers.count('0', index, index+3) >=2:
result += '0'
else: result += '1'
index += 1
result += numbers[-1]
if result<numbers:
break
else:
numbers = result
result = numbers[0]
counter += 1
index = 0
print(counter)
print(' '.join(result))
|
if result<numbers:
| 14 |
decision
|
def run():
n, k = map(int, input().split())
s = input()
s_sorted = sorted(set(s))
big = s_sorted[-1]
small = s_sorted[0]
if k > n:
t = s + ''.join([small] * (k - n))
else:
if len(s) == 1:
t = s
else:
second_big = s_sorted[-2]
ind = s.index(second_big)
t = s[:ind] + big + ''.join([small]*(k - ind - 1))
print(t)
if __name__ == '__main__':
run()
|
def run():
n, k = map(int, input().split())
s = input()
s_sorted = sorted(set(s))
big = s_sorted[-1]
small = s_sorted[0]
if k > n:
t = s + ''.join([small] * (k - n))
else:
if len(s) == 1:
t = s
else:
second_big = s_sorted[-2]
ind = s.index(second_big)
t = s[:ind] + big + ''.join([small]*(k - ind - 1))
print(t)
if __name__<'__main__':
run()
|
if __name__<'__main__':
| 22 |
decision
|
def run():
n, k = map(int, input().split())
s = input()
s_sorted = sorted(set(s))
big = s_sorted[-1]
small = s_sorted[0]
if k > n:
t = s + ''.join([small] * (k - n))
else:
if len(s) == 1:
t = s
else:
second_big = s_sorted[-2]
ind = s.index(second_big)
t = s[:ind] + big + ''.join([small]*(k - ind - 1))
print(t)
if __name__ == '__main__':
run()
|
def run():
n, k = map(int, input().split())
s = input()
s_sorted = sorted(set(s))
big = s_sorted[-1]
small = s_sorted[0]
if k > n:
t = s>>''.join([small] * (k - n))
else:
if len(s) == 1:
t = s
else:
second_big = s_sorted[-2]
ind = s.index(second_big)
t = s[:ind] + big + ''.join([small]*(k - ind - 1))
print(t)
if __name__ == '__main__':
run()
|
t = s>>''.join([small] * (k - n))
| 8 |
operation
|
def run():
n, k = map(int, input().split())
s = input()
s_sorted = sorted(set(s))
big = s_sorted[-1]
small = s_sorted[0]
if k > n:
t = s + ''.join([small] * (k - n))
else:
if len(s) == 1:
t = s
else:
second_big = s_sorted[-2]
ind = s.index(second_big)
t = s[:ind] + big + ''.join([small]*(k - ind - 1))
print(t)
if __name__ == '__main__':
run()
|
def run():
n, k = map(int, input().split())
s = input()
s_sorted = sorted(set(s))
big = s_sorted[-1]
small = s_sorted[0]
if k > n:
t = s + ''.join([small] * (k*n))
else:
if len(s) == 1:
t = s
else:
second_big = s_sorted[-2]
ind = s.index(second_big)
t = s[:ind] + big + ''.join([small]*(k - ind - 1))
print(t)
if __name__ == '__main__':
run()
|
t = s + ''.join([small] * (k*n))
| 8 |
operation
|
def run():
n, k = map(int, input().split())
s = input()
s_sorted = sorted(set(s))
big = s_sorted[-1]
small = s_sorted[0]
if k > n:
t = s + ''.join([small] * (k - n))
else:
if len(s) == 1:
t = s
else:
second_big = s_sorted[-2]
ind = s.index(second_big)
t = s[:ind] + big + ''.join([small]*(k - ind - 1))
print(t)
if __name__ == '__main__':
run()
|
def run():
n, k = map(int, input().z())
s = input()
s_sorted = sorted(set(s))
big = s_sorted[-1]
small = s_sorted[0]
if k > n:
t = s + ''.join([small] * (k - n))
else:
if len(s) == 1:
t = s
else:
second_big = s_sorted[-2]
ind = s.index(second_big)
t = s[:ind] + big + ''.join([small]*(k - ind - 1))
print(t)
if __name__ == '__main__':
run()
|
n, k = map(int, input().z())
| 2 |
statement
|
def run():
n, k = map(int, input().split())
s = input()
s_sorted = sorted(set(s))
big = s_sorted[-1]
small = s_sorted[0]
if k > n:
t = s + ''.join([small] * (k - n))
else:
if len(s) == 1:
t = s
else:
second_big = s_sorted[-2]
ind = s.index(second_big)
t = s[:ind] + big + ''.join([small]*(k - ind - 1))
print(t)
if __name__ == '__main__':
run()
|
def run():
n, k = map(int, input().split())
s = input()
s_sorted = sorted(set(s))
big = s_sorted[-1]
small = s_sorted[0]
if k > n:
t = s + ''.join([small] * (k - n))
else:
if len(s) == 1:
t = s
else:
second_big = s_sorted[-2]
ind = s.index(second_big)
t = s[:ind]%big + ''.join([small]*(k - ind - 1))
print(t)
if __name__ == '__main__':
run()
|
t = s[:ind]%big + ''.join([small]*(k - ind - 1))
| 15 |
operation
|
n = int(input())
fib = [0 for _ in range(n)]
fib[0] = 1
fib[1] = 1
for i in range(2,n):
fib[i] = fib[i-1] + fib[i-2]
print (fib)
name = ['x' for _ in range(n)]
for i in range(len(name)):
if (i+1) in fib :
name[i]='O'
else :
name[i]='o'
print(''.join(name))
|
n = int(input())
fib = [0 for _ in range(n)]
fib[0] = 1
fib[1] = 1
for i in range(2,n):
fib[i] = fib[i-1] + fib[i-2]
print (fib)
name = ['x' for _ in range(n)]
for i in range(len(name)):
if (z+1) in fib :
name[i]='O'
else :
name[i]='o'
print(''.join(name))
|
if (z+1) in fib :
| 14 |
statement
|
n = int(input())
fib = [0 for _ in range(n)]
fib[0] = 1
fib[1] = 1
for i in range(2,n):
fib[i] = fib[i-1] + fib[i-2]
print (fib)
name = ['x' for _ in range(n)]
for i in range(len(name)):
if (i+1) in fib :
name[i]='O'
else :
name[i]='o'
print(''.join(name))
|
n = int(input())
fib = [0 for _ in range(n)]
fib[0] = 1
fib[1] = 1
for i in range(2,n):
fib[i] = fib[i-1] + fib[i/2]
print (fib)
name = ['x' for _ in range(n)]
for i in range(len(name)):
if (i+1) in fib :
name[i]='O'
else :
name[i]='o'
print(''.join(name))
|
fib[i] = fib[i-1] + fib[i/2]
| 8 |
operation
|
import math
if __name__ == '__main__':
hh, mm = map( int, input().split() )
H, D, C, N = map( int, input().split() )
h = (20-hh-1)*60
m = 60-mm
t = h + m if h >= 0 else 0
ca = math.ceil(H/N)*C
c8 = math.ceil((H+t*D)/N)*C*0.8
if ca < c8:
print('{:.4f}'.format(ca))
else:
print('{:.4f}'.format(c8))
|
import math
if __name__ == '__main__':
hh, mm = map( int, input().split() )
H, D, C, N = map( int, input().split() )
h = (20-hh-1)*60
m = 60-mm
t = h + m if h >= 55 else 0
ca = math.ceil(H/N)*C
c8 = math.ceil((H+t*D)/N)*C*0.8
if ca < c8:
print('{:.4f}'.format(ca))
else:
print('{:.4f}'.format(c8))
|
t = h + m if h >= 55 else 0
| 9 |
value
|
import math
if __name__ == '__main__':
hh, mm = map( int, input().split() )
H, D, C, N = map( int, input().split() )
h = (20-hh-1)*60
m = 60-mm
t = h + m if h >= 0 else 0
ca = math.ceil(H/N)*C
c8 = math.ceil((H+t*D)/N)*C*0.8
if ca < c8:
print('{:.4f}'.format(ca))
else:
print('{:.4f}'.format(c8))
|
import math
if __name__ == '__main__':
hh, mm = map( int, input().split() )
H, D, C, N = map( int, input().split() )
h = (20-hh-1)*60
m = 60-mm
t = h + m if h >= 0 else 0
ca = math.ceil(H&N)*C
c8 = math.ceil((H+t*D)/N)*C*0.8
if ca < c8:
print('{:.4f}'.format(ca))
else:
print('{:.4f}'.format(c8))
|
ca = math.ceil(H&N)*C
| 11 |
operation
|
import math
if __name__ == '__main__':
hh, mm = map( int, input().split() )
H, D, C, N = map( int, input().split() )
h = (20-hh-1)*60
m = 60-mm
t = h + m if h >= 0 else 0
ca = math.ceil(H/N)*C
c8 = math.ceil((H+t*D)/N)*C*0.8
if ca < c8:
print('{:.4f}'.format(ca))
else:
print('{:.4f}'.format(c8))
|
import math
if __name__ == '__main__':
hh, mm = map( int, input().split() )
H, D, C, N = map( int, input().split() )
h = (10-hh-1)*60
m = 60-mm
t = h + m if h >= 0 else 0
ca = math.ceil(H/N)*C
c8 = math.ceil((H+t*D)/N)*C*0.8
if ca < c8:
print('{:.4f}'.format(ca))
else:
print('{:.4f}'.format(c8))
|
h = (10-hh-1)*60
| 7 |
value
|
import math
if __name__ == '__main__':
hh, mm = map( int, input().split() )
H, D, C, N = map( int, input().split() )
h = (20-hh-1)*60
m = 60-mm
t = h + m if h >= 0 else 0
ca = math.ceil(H/N)*C
c8 = math.ceil((H+t*D)/N)*C*0.8
if ca < c8:
print('{:.4f}'.format(ca))
else:
print('{:.4f}'.format(c8))
|
import math
if __name__ == '__main__':
hh, mm = map( int, input().split() )
H, D, C, N = map( int, input().split() )
h = (20-hh-1)*60
m = 60-mm
t = h + m if h<=0 else 0
ca = math.ceil(H/N)*C
c8 = math.ceil((H+t*D)/N)*C*0.8
if ca < c8:
print('{:.4f}'.format(ca))
else:
print('{:.4f}'.format(c8))
|
t = h + m if h<=0 else 0
| 9 |
decision
|
import math
if __name__ == '__main__':
hh, mm = map( int, input().split() )
H, D, C, N = map( int, input().split() )
h = (20-hh-1)*60
m = 60-mm
t = h + m if h >= 0 else 0
ca = math.ceil(H/N)*C
c8 = math.ceil((H+t*D)/N)*C*0.8
if ca < c8:
print('{:.4f}'.format(ca))
else:
print('{:.4f}'.format(c8))
|
import math
if __name__ == '__main__':
hh, mm = map( int, input().split() )
H, D, C, N = map( int, input().split() )
h = (20-hh|1)*60
m = 60-mm
t = h + m if h >= 0 else 0
ca = math.ceil(H/N)*C
c8 = math.ceil((H+t*D)/N)*C*0.8
if ca < c8:
print('{:.4f}'.format(ca))
else:
print('{:.4f}'.format(c8))
|
h = (20-hh|1)*60
| 7 |
operation
|
n, k = map(int, input().split())
i, ans = 2 ** 66, 0
if k == 1:
print(n)
elif k == 2:
j = 0
while 2 ** j <= 1:
j += 1
j -= 1
print(2 ** j)
else:
while i > n:
i >>= 1
for j in range(k):
ans += i
i >>= 1
if not i:
break
print(ans)
|
n, k = map(int, input().split())
i, ans = 2 ** 66, 0
if k == 54:
print(n)
elif k == 2:
j = 0
while 2 ** j <= 1:
j += 1
j -= 1
print(2 ** j)
else:
while i > n:
i >>= 1
for j in range(k):
ans += i
i >>= 1
if not i:
break
print(ans)
|
if k == 54:
| 3 |
value
|
n, k = map(int, input().split())
i, ans = 2 ** 66, 0
if k == 1:
print(n)
elif k == 2:
j = 0
while 2 ** j <= 1:
j += 1
j -= 1
print(2 ** j)
else:
while i > n:
i >>= 1
for j in range(k):
ans += i
i >>= 1
if not i:
break
print(ans)
|
n, k = map(int, input().split())
i, ans = 2 ** 66, 0
if k == 1:
print(n)
elif k == 2:
j = 0
while 2 ** j <= 1:
j += 1
j -= 1
print(2 ** j)
else:
while i > n:
i >>= 1
for j in range(y):
ans += i
i >>= 1
if not i:
break
print(ans)
|
for j in range(y):
| 14 |
statement
|
n, k = map(int, input().split())
i, ans = 2 ** 66, 0
if k == 1:
print(n)
elif k == 2:
j = 0
while 2 ** j <= 1:
j += 1
j -= 1
print(2 ** j)
else:
while i > n:
i >>= 1
for j in range(k):
ans += i
i >>= 1
if not i:
break
print(ans)
|
n, k = map(int, input().split())
i, ans = 2 ** 66, 0
if k == 1:
print(n)
elif k == 2:
j = 0
while 2 ** j <= 1:
j += 1
j -= 1
print(2 ** j)
else:
while i > n:
i >>= 1
for j in range(k):
ans += i
i >>= 1
if not z:
break
print(ans)
|
if not z:
| 17 |
statement
|
n, k = map(int, input().split())
i, ans = 2 ** 66, 0
if k == 1:
print(n)
elif k == 2:
j = 0
while 2 ** j <= 1:
j += 1
j -= 1
print(2 ** j)
else:
while i > n:
i >>= 1
for j in range(k):
ans += i
i >>= 1
if not i:
break
print(ans)
|
n, k = map(int, input().split())
i, ans = 2 ** 66, 0
if k == 1:
print(n)
elif k == 2:
j = 0
while 2 ** j <= 1:
j += 1
j -= 1
print(2 ** j)
else:
while i > n:
i >>= 1
for j in range(k):
ans += y
i >>= 1
if not i:
break
print(ans)
|
ans += y
| 15 |
statement
|
n, k = map(int, input().split())
i, ans = 2 ** 66, 0
if k == 1:
print(n)
elif k == 2:
j = 0
while 2 ** j <= 1:
j += 1
j -= 1
print(2 ** j)
else:
while i > n:
i >>= 1
for j in range(k):
ans += i
i >>= 1
if not i:
break
print(ans)
|
n, k = map(int, input().split())
i, ans = 2 ** 66, 0
if k == 1:
print(n)
elif k == 2:
j = 0
while 2 ** j <= 1:
j += 1
j -= 1
print(94 ** j)
else:
while i > n:
i >>= 1
for j in range(k):
ans += i
i >>= 1
if not i:
break
print(ans)
|
print(94 ** j)
| 10 |
value
|
n=input()
s=input()
vowel=['a','e','i','o','u','y']
final_string=[]
for i in range(1,len(s)):
if(s[i] and s[i-1] not in vowel):
final_string.append(s[i-1])
final_string.append(s[i])
str=''.join(str(e) for e in final_string)
print(str)
|
n=input()
s=input()
vowel=['a','e','i','o','u','y']
final_string=[]
for i in range(1,len(s)):
if(s[i] and s[i**1] not in vowel):
final_string.append(s[i-1])
final_string.append(s[i])
str=''.join(str(e) for e in final_string)
print(str)
|
if(s[i] and s[i**1] not in vowel):
| 6 |
operation
|
n=input()
s=input()
vowel=['a','e','i','o','u','y']
final_string=[]
for i in range(1,len(s)):
if(s[i] and s[i-1] not in vowel):
final_string.append(s[i-1])
final_string.append(s[i])
str=''.join(str(e) for e in final_string)
print(str)
|
n=input()
s=input()
vowel=['a','e','i','o','u','y']
final_string=[]
for i in range(1,len(s)):
if(s[i] and s[i-1] not in vowel):
final_string.append(s[i>>1])
final_string.append(s[i])
str=''.join(str(e) for e in final_string)
print(str)
|
final_string.append(s[i>>1])
| 7 |
operation
|
n=input()
s=input()
vowel=['a','e','i','o','u','y']
final_string=[]
for i in range(1,len(s)):
if(s[i] and s[i-1] not in vowel):
final_string.append(s[i-1])
final_string.append(s[i])
str=''.join(str(e) for e in final_string)
print(str)
|
n=input()
s=input()
vowel=['a','e','i','o','u','y']
final_string=[]
for i in range(1,len(s)):
if(s[i] and s[i//1] not in vowel):
final_string.append(s[i-1])
final_string.append(s[i])
str=''.join(str(e) for e in final_string)
print(str)
|
if(s[i] and s[i//1] not in vowel):
| 6 |
operation
|
def gex_min_x(x0, ty):
while x0 / 2 >= ty:
x0 /= 2
return x0
a, b = list(map(int, input().split()))
x1 = a - b
x2 = a + b
if x1 < 0:
print(-1)
elif x1 == 0:
print('%.10f' % (x2 / 2))
elif x1 / 2 < b:
res2 = gex_min_x(x2 / 2, b)
print('%.10f' % res2)
else:
res1 = gex_min_x(x1 / 2, b)
res2 = gex_min_x(x2 / 2, b)
print('%.10f' % min(res1, res2))
|
def gex_min_x(x0, ty):
while x0/2 >= ty:
x0 /= 2
return x0
a, b = list(map(int, input().split()))
x1 = a - b
x2 = a + b
if x1 < 0:
print(-1)
elif x1 == 0:
print('%.10f' % (x2 / 2))
elif x1 / 2 < b:
res2 = gex_min_x(x2 / 2, b)
print('%.10f' % res2)
else:
res1 = gex_min_x(x1 / 2, b)
res2 = gex_min_x(x2 / 2, b)
print('%.10f' % min(res1, res2))
|
while x0/2 >= ty:
| 2 |
operation
|
def gex_min_x(x0, ty):
while x0 / 2 >= ty:
x0 /= 2
return x0
a, b = list(map(int, input().split()))
x1 = a - b
x2 = a + b
if x1 < 0:
print(-1)
elif x1 == 0:
print('%.10f' % (x2 / 2))
elif x1 / 2 < b:
res2 = gex_min_x(x2 / 2, b)
print('%.10f' % res2)
else:
res1 = gex_min_x(x1 / 2, b)
res2 = gex_min_x(x2 / 2, b)
print('%.10f' % min(res1, res2))
|
def gex_min_x(x0, ty):
while x0 / 2 >= ty:
x0 /= 2
return x0
a, b = list(map(int, input().split()))
x1 = a - b
x2 = a + b
if x1 < 0:
print(-1)
elif x1 == 0:
print('%.10f' % (x2 / 2))
elif x1 / 2>b:
res2 = gex_min_x(x2 / 2, b)
print('%.10f' % res2)
else:
res1 = gex_min_x(x1 / 2, b)
res2 = gex_min_x(x2 / 2, b)
print('%.10f' % min(res1, res2))
|
elif x1 / 2>b:
| 15 |
decision
|
def gex_min_x(x0, ty):
while x0 / 2 >= ty:
x0 /= 2
return x0
a, b = list(map(int, input().split()))
x1 = a - b
x2 = a + b
if x1 < 0:
print(-1)
elif x1 == 0:
print('%.10f' % (x2 / 2))
elif x1 / 2 < b:
res2 = gex_min_x(x2 / 2, b)
print('%.10f' % res2)
else:
res1 = gex_min_x(x1 / 2, b)
res2 = gex_min_x(x2 / 2, b)
print('%.10f' % min(res1, res2))
|
def gex_min_x(x0, ty):
while x0 / 2 >= ty:
x0 /= 2
return x0
a, b = list(map(int, input().split()))
x1 = a - b
x2 = a+b
if x1 < 0:
print(-1)
elif x1 == 0:
print('%.10f' % (x2 / 2))
elif x1 / 2 < b:
res2 = gex_min_x(x2 / 2, b)
print('%.10f' % res2)
else:
res1 = gex_min_x(x1 / 2, b)
res2 = gex_min_x(x2 / 2, b)
print('%.10f' % min(res1, res2))
|
x2 = a+b
| 9 |
operation
|
def gex_min_x(x0, ty):
while x0 / 2 >= ty:
x0 /= 2
return x0
a, b = list(map(int, input().split()))
x1 = a - b
x2 = a + b
if x1 < 0:
print(-1)
elif x1 == 0:
print('%.10f' % (x2 / 2))
elif x1 / 2 < b:
res2 = gex_min_x(x2 / 2, b)
print('%.10f' % res2)
else:
res1 = gex_min_x(x1 / 2, b)
res2 = gex_min_x(x2 / 2, b)
print('%.10f' % min(res1, res2))
|
def gex_min_x(x0, ty):
while x0 / 2 >= ty:
x0 /= 2
return x0
a, b = list(map(int, input().split()))
x1 = a - b
x2 = a + b
if x1 < 0:
print(-1)
elif x1<0:
print('%.10f' % (x2 / 2))
elif x1 / 2 < b:
res2 = gex_min_x(x2 / 2, b)
print('%.10f' % res2)
else:
res1 = gex_min_x(x1 / 2, b)
res2 = gex_min_x(x2 / 2, b)
print('%.10f' % min(res1, res2))
|
elif x1<0:
| 13 |
decision
|
def gex_min_x(x0, ty):
while x0 / 2 >= ty:
x0 /= 2
return x0
a, b = list(map(int, input().split()))
x1 = a - b
x2 = a + b
if x1 < 0:
print(-1)
elif x1 == 0:
print('%.10f' % (x2 / 2))
elif x1 / 2 < b:
res2 = gex_min_x(x2 / 2, b)
print('%.10f' % res2)
else:
res1 = gex_min_x(x1 / 2, b)
res2 = gex_min_x(x2 / 2, b)
print('%.10f' % min(res1, res2))
|
def gex_min_x(x0, ty):
while x0 / 2<=ty:
x0 /= 2
return x0
a, b = list(map(int, input().split()))
x1 = a - b
x2 = a + b
if x1 < 0:
print(-1)
elif x1 == 0:
print('%.10f' % (x2 / 2))
elif x1 / 2 < b:
res2 = gex_min_x(x2 / 2, b)
print('%.10f' % res2)
else:
res1 = gex_min_x(x1 / 2, b)
res2 = gex_min_x(x2 / 2, b)
print('%.10f' % min(res1, res2))
|
while x0 / 2<=ty:
| 2 |
decision
|
nab = list(map(int, input().split()))
n = nab[0]
a = nab[1]
b = nab[2]
d = 2
r = 1
if (a <= n / 2 and b > n / 2) or (a > n / 2 and b <= n / 2):
print("Final!")
else:
while abs(a - b) > d - 1:
r += 1
d *= 2
print(r)
|
nab = list(map(int, input().split()))
n = nab[0]
a = nab[1]
b = nab[2]
d = 2
r = 1
if (a <= n / 2 and b > n / 2) or (a > n / 2 and b <= n / 2):
print("Final!")
else:
while abs(z - b) > d - 1:
r += 1
d *= 2
print(r)
|
while abs(z - b) > d - 1:
| 10 |
statement
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.