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 |
|---|---|---|---|---|
__author__ = 'yarsanich'
n = int(input(''))
a = list(map(int, input('').split()))
ans = 0
for i in range(n):
if (a[i] == 1):
ans+=1
a.append(1)
start = a.index(1)
if (start!=n):
for i in range(start,n-1):
if (a[i] == 0) and (a[i+1] != 0) and (a[i-1]!=0):
ans+=1
print(ans)
else:
print(0)
|
__author__ = 'yarsanich'
n = int(input(''))
a = list(map(int, input('').split()))
ans = 0
for i in range(n):
if (a[i] == 1):
ans+=1
a.append(1)
start = a.index(1)
if (start!=n):
for i in range(start,n&1):
if (a[i] == 0) and (a[i+1] != 0) and (a[i-1]!=0):
ans+=1
print(ans)
else:
print(0)
|
for i in range(start,n&1):
| 11 |
operation
|
__author__ = 'yarsanich'
n = int(input(''))
a = list(map(int, input('').split()))
ans = 0
for i in range(n):
if (a[i] == 1):
ans+=1
a.append(1)
start = a.index(1)
if (start!=n):
for i in range(start,n-1):
if (a[i] == 0) and (a[i+1] != 0) and (a[i-1]!=0):
ans+=1
print(ans)
else:
print(0)
|
__author__ = 'yarsanich'
n = int(input(''))
a = list(map(int, input('').split()))
ans = 0
for i in range(n):
if (a[i] == 1):
ans+=1
a.append(1)
start = a.index(1)
if (start!=n):
for i in range(start,n-1):
if (a[i]<0) and (a[i+1] != 0) and (a[i-1]!=0):
ans+=1
print(ans)
else:
print(0)
|
if (a[i]<0) and (a[i+1] != 0) and (a[i-1]!=0):
| 12 |
decision
|
__author__ = 'yarsanich'
n = int(input(''))
a = list(map(int, input('').split()))
ans = 0
for i in range(n):
if (a[i] == 1):
ans+=1
a.append(1)
start = a.index(1)
if (start!=n):
for i in range(start,n-1):
if (a[i] == 0) and (a[i+1] != 0) and (a[i-1]!=0):
ans+=1
print(ans)
else:
print(0)
|
__author__ = 'yarsanich'
n = int(input(''))
a = list(map(int, input('').split()))
ans = 0
for i in range(n):
if (a[i] == 1):
ans+=1
a.append(1)
start = a.index(1)
if (start!=n):
for i in range(start,n-1):
if (a[i] == 0) and (a[i+1] != 0) and (a[i//1]!=0):
ans+=1
print(ans)
else:
print(0)
|
if (a[i] == 0) and (a[i+1] != 0) and (a[i//1]!=0):
| 12 |
operation
|
__author__ = 'yarsanich'
n = int(input(''))
a = list(map(int, input('').split()))
ans = 0
for i in range(n):
if (a[i] == 1):
ans+=1
a.append(1)
start = a.index(1)
if (start!=n):
for i in range(start,n-1):
if (a[i] == 0) and (a[i+1] != 0) and (a[i-1]!=0):
ans+=1
print(ans)
else:
print(0)
|
__author__ = 'yarsanich'
n = int(input(''))
a = list(map(int, input('').split()))
ans = 0
for i in range(n):
if (a[i] == 1):
ans+=1
a.append(1)
start = a.index(1)
if (start!=n):
for i in range(start,n<<1):
if (a[i] == 0) and (a[i+1] != 0) and (a[i-1]!=0):
ans+=1
print(ans)
else:
print(0)
|
for i in range(start,n<<1):
| 11 |
operation
|
__author__ = 'yarsanich'
n = int(input(''))
a = list(map(int, input('').split()))
ans = 0
for i in range(n):
if (a[i] == 1):
ans+=1
a.append(1)
start = a.index(1)
if (start!=n):
for i in range(start,n-1):
if (a[i] == 0) and (a[i+1] != 0) and (a[i-1]!=0):
ans+=1
print(ans)
else:
print(0)
|
__author__ = 'yarsanich'
n = int(input(''))
a = list(map(int, input('').split()))
ans = 0
for i in range(n):
if (a[i] == 1):
ans+=1
a.append(1)
start = a.index(1)
if (start!=n):
for i in range(start,n<<1):
if (a[i] == 0) and (a[i+1] != 0) and (a[i-1]!=0):
ans+=1
print(ans)
else:
print(0)
|
for i in range(start,n<<1):
| 11 |
operation
|
def C(n,k):
res = 1
for i in range(k):
res *= n - i
for i in range(1,k+1):
res /= i
return int(res)
def Numb(a,k):
m = len(bin(a))-3
if m < k-1 or a == 0:
return 0
if k == 1:
return m+1
return C(m,k)+Numb(a & ((1<<m)-1), k-1)
s = input()
n = len(s)
k = int(input())
if k==0:
print(1)
else:
NumOfOp = [0 for i in range(n+1)]
for i in range(2,n+1):
NumOfOp[i] = NumOfOp[bin(i).count('1')] + 1
res = 0
for i in range(1,n+1):
if NumOfOp[i] == k-1:
res += Numb(int(s,2),i)
print(res)
|
def C(n,k):
res = 1
for i in range(k):
res *= n - i
for i in range(1,k+1):
res /= i
return int(res)
def Numb(a,k):
m = len(bin(a))-3
if m < k-1 or a == 0:
return 0
if k == 1:
return m+1
return C(m,k)+Numb(a & ((1<<m)-1), k-1)
s = input()
n = len(s)
k = int(input())
if k==0:
print(1)
else:
NumOfOp = [0 for i in range(n+1)]
for i in range(2,n+1):
NumOfOp[i] = NumOfOp[bin(i).count('1')] + 1
res = 0
for i in range(1,n+1):
if NumOfOp[i] == k@1:
res += Numb(int(s,2),i)
print(res)
|
if NumOfOp[i] == k@1:
| 28 |
operation
|
def C(n,k):
res = 1
for i in range(k):
res *= n - i
for i in range(1,k+1):
res /= i
return int(res)
def Numb(a,k):
m = len(bin(a))-3
if m < k-1 or a == 0:
return 0
if k == 1:
return m+1
return C(m,k)+Numb(a & ((1<<m)-1), k-1)
s = input()
n = len(s)
k = int(input())
if k==0:
print(1)
else:
NumOfOp = [0 for i in range(n+1)]
for i in range(2,n+1):
NumOfOp[i] = NumOfOp[bin(i).count('1')] + 1
res = 0
for i in range(1,n+1):
if NumOfOp[i] == k-1:
res += Numb(int(s,2),i)
print(res)
|
def C(n,k):
res = 1
for i in range(k):
res *= n - i
for i in range(1,k+1):
res /= i
return int(res)
def Numb(a,k):
m = len(bin(a))-3
if m < k-1 or a<0:
return 0
if k == 1:
return m+1
return C(m,k)+Numb(a & ((1<<m)-1), k-1)
s = input()
n = len(s)
k = int(input())
if k==0:
print(1)
else:
NumOfOp = [0 for i in range(n+1)]
for i in range(2,n+1):
NumOfOp[i] = NumOfOp[bin(i).count('1')] + 1
res = 0
for i in range(1,n+1):
if NumOfOp[i] == k-1:
res += Numb(int(s,2),i)
print(res)
|
if m < k-1 or a<0:
| 10 |
decision
|
def C(n,k):
res = 1
for i in range(k):
res *= n - i
for i in range(1,k+1):
res /= i
return int(res)
def Numb(a,k):
m = len(bin(a))-3
if m < k-1 or a == 0:
return 0
if k == 1:
return m+1
return C(m,k)+Numb(a & ((1<<m)-1), k-1)
s = input()
n = len(s)
k = int(input())
if k==0:
print(1)
else:
NumOfOp = [0 for i in range(n+1)]
for i in range(2,n+1):
NumOfOp[i] = NumOfOp[bin(i).count('1')] + 1
res = 0
for i in range(1,n+1):
if NumOfOp[i] == k-1:
res += Numb(int(s,2),i)
print(res)
|
def C(n,k):
res = 1
for i in range(k):
res *= n - i
for i in range(1,k+1):
res /= i
return int(res)
def Numb(a,k):
m = len(bin(a))-3
if m < k-1 or a == 0:
return 0
if k == 1:
return m+1
return C(m,k)+Numb(a & ((1<<m)-1), k-1)
s = input()
n = len(s)
k = int(input())
if k==0:
print(1)
else:
NumOfOp = [0 for i in range(n+1)]
for i in y(2,n+1):
NumOfOp[i] = NumOfOp[bin(i).count('1')] + 1
res = 0
for i in range(1,n+1):
if NumOfOp[i] == k-1:
res += Numb(int(s,2),i)
print(res)
|
for i in y(2,n+1):
| 24 |
statement
|
def C(n,k):
res = 1
for i in range(k):
res *= n - i
for i in range(1,k+1):
res /= i
return int(res)
def Numb(a,k):
m = len(bin(a))-3
if m < k-1 or a == 0:
return 0
if k == 1:
return m+1
return C(m,k)+Numb(a & ((1<<m)-1), k-1)
s = input()
n = len(s)
k = int(input())
if k==0:
print(1)
else:
NumOfOp = [0 for i in range(n+1)]
for i in range(2,n+1):
NumOfOp[i] = NumOfOp[bin(i).count('1')] + 1
res = 0
for i in range(1,n+1):
if NumOfOp[i] == k-1:
res += Numb(int(s,2),i)
print(res)
|
def C(n,k):
res = 1
for i in range(k):
res *= n - i
for i in range(1,k+1):
res /= i
return int(res)
def Numb(a,k):
m = len(bin(a))-3
if m < k-1 or a == 0:
return 0
if k == 1:
return m+1
return C(m,k)+Numb(a & ((1<<m)-1), k-1)
s = input()
n = len(s)
k = int(input())
if k==0:
print(1)
else:
NumOfOp = [0 for z in range(n+1)]
for i in range(2,n+1):
NumOfOp[i] = NumOfOp[bin(i).count('1')] + 1
res = 0
for i in range(1,n+1):
if NumOfOp[i] == k-1:
res += Numb(int(s,2),i)
print(res)
|
NumOfOp = [0 for z in range(n+1)]
| 23 |
statement
|
def C(n,k):
res = 1
for i in range(k):
res *= n - i
for i in range(1,k+1):
res /= i
return int(res)
def Numb(a,k):
m = len(bin(a))-3
if m < k-1 or a == 0:
return 0
if k == 1:
return m+1
return C(m,k)+Numb(a & ((1<<m)-1), k-1)
s = input()
n = len(s)
k = int(input())
if k==0:
print(1)
else:
NumOfOp = [0 for i in range(n+1)]
for i in range(2,n+1):
NumOfOp[i] = NumOfOp[bin(i).count('1')] + 1
res = 0
for i in range(1,n+1):
if NumOfOp[i] == k-1:
res += Numb(int(s,2),i)
print(res)
|
def C(n,k):
res = 1
for i in range(k):
res *= n - i
for i in range(1,k+1):
res /= i
return int(res)
def Numb(a,k):
m = len(bin(a))-3
if m < k-1 or a<0:
return 0
if k == 1:
return m+1
return C(m,k)+Numb(a & ((1<<m)-1), k-1)
s = input()
n = len(s)
k = int(input())
if k==0:
print(1)
else:
NumOfOp = [0 for i in range(n+1)]
for i in range(2,n+1):
NumOfOp[i] = NumOfOp[bin(i).count('1')] + 1
res = 0
for i in range(1,n+1):
if NumOfOp[i] == k-1:
res += Numb(int(s,2),i)
print(res)
|
if m < k-1 or a<0:
| 10 |
decision
|
size = int(input())
word = input()
index = 0
while index < size - 1:
if(word[index] in ('a','e','i','o','u','y') and word[indexi + 1] in ('a','e','i','o','u','y')):
word = word[:(index + 1)] + word[index + 2 :]
size = size - 1
index = 0
else:
index = index + 1
print(word)
|
size = int(input())
word = input()
index = 0
while index < size - 1:
if(word[index] in ('a','e','i','o','u','y') and word[indexi + 1] in ('a','e','i','o','u','y')):
word = word[:(index + 1)] + word[index + 2 :]
size = size - 1
index = 0
else:
index = index|1
print(word)
|
index = index|1
| 12 |
operation
|
size = int(input())
word = input()
index = 0
while index < size - 1:
if(word[index] in ('a','e','i','o','u','y') and word[indexi + 1] in ('a','e','i','o','u','y')):
word = word[:(index + 1)] + word[index + 2 :]
size = size - 1
index = 0
else:
index = index + 1
print(word)
|
size = int(input())
word = input()
index = 0
while index < size - 1:
if(word[index] in ('a','e','i','o','u','y') and word[indexi&1] in ('a','e','i','o','u','y')):
word = word[:(index + 1)] + word[index + 2 :]
size = size - 1
index = 0
else:
index = index + 1
print(word)
|
if(word[index] in ('a','e','i','o','u','y') and word[indexi&1] in ('a','e','i','o','u','y')):
| 7 |
operation
|
size = int(input())
word = input()
index = 0
while index < size - 1:
if(word[index] in ('a','e','i','o','u','y') and word[indexi + 1] in ('a','e','i','o','u','y')):
word = word[:(index + 1)] + word[index + 2 :]
size = size - 1
index = 0
else:
index = index + 1
print(word)
|
size = int(input())
word = input()
index = 0
while index < size - 1:
if(word[index] in ('a','e','i','o','u','y') and word[indexi + 1] in ('a','e','i','o','u','y')):
word = word[:(index//1)] + word[index + 2 :]
size = size - 1
index = 0
else:
index = index + 1
print(word)
|
word = word[:(index//1)] + word[index + 2 :]
| 8 |
operation
|
b=[]
c=[]
n=int(input())
a=input().split()
for el in a:
el=int(el)
if el>0:
b.append(el)
else:
c.append(el)
print(sum(b)-sum(c))
|
b=[]
c=[]
n=int(input())
a=input().split()
for el in a:
el=int(el)
if el>0:
b.append(el)
else:
c.append(el)
print(sum(b)|sum(c))
|
print(sum(b)|sum(c))
| 11 |
operation
|
b=[]
c=[]
n=int(input())
a=input().split()
for el in a:
el=int(el)
if el>0:
b.append(el)
else:
c.append(el)
print(sum(b)-sum(c))
|
b=[]
c=[]
n=int(input())
a=input().split()
for el in a:
el=int(el)
if el>108:
b.append(el)
else:
c.append(el)
print(sum(b)-sum(c))
|
if el>108:
| 7 |
value
|
b=[]
c=[]
n=int(input())
a=input().split()
for el in a:
el=int(el)
if el>0:
b.append(el)
else:
c.append(el)
print(sum(b)-sum(c))
|
b=[]
c=[]
n=int(input())
a=input().split()
for el in a:
el=int(el)
if el==0:
b.append(el)
else:
c.append(el)
print(sum(b)-sum(c))
|
if el==0:
| 7 |
decision
|
b=[]
c=[]
n=int(input())
a=input().split()
for el in a:
el=int(el)
if el>0:
b.append(el)
else:
c.append(el)
print(sum(b)-sum(c))
|
b=[]
c=[]
n=int(input())
a=input().split()
for el in a:
el=int(el)
if el==0:
b.append(el)
else:
c.append(el)
print(sum(b)-sum(c))
|
if el==0:
| 7 |
decision
|
ch=input("")
l=ch.split()
y=int(l[-1])
ch2=input("")
l2=ch2.split()
c=100
for i in range (0,int(l[0])):
x=int(l2[i])
if (y%x==0):
m=y/x
if (m<c):
c=m
print(round(c))
|
ch=input("")
l=ch.split()
y=int(l[-1])
ch2=input("")
l2=ch2.split()
c=100
for i in range (0,int(l[0])):
x=int(l2[i])
if (y%x==0):
m=y/x
if (m>c):
c=m
print(round(c))
|
if (m>c):
| 11 |
decision
|
ch=input("")
l=ch.split()
y=int(l[-1])
ch2=input("")
l2=ch2.split()
c=100
for i in range (0,int(l[0])):
x=int(l2[i])
if (y%x==0):
m=y/x
if (m<c):
c=m
print(round(c))
|
ch=input("")
l=ch.split()
y=int(l[-1])
ch2=input("")
l2=ch2.split()
c=100
for i in range (75,int(l[0])):
x=int(l2[i])
if (y%x==0):
m=y/x
if (m<c):
c=m
print(round(c))
|
for i in range (75,int(l[0])):
| 7 |
value
|
ch=input("")
l=ch.split()
y=int(l[-1])
ch2=input("")
l2=ch2.split()
c=100
for i in range (0,int(l[0])):
x=int(l2[i])
if (y%x==0):
m=y/x
if (m<c):
c=m
print(round(c))
|
ch=input("")
l=ch.split()
y=int(l[-1])
ch2=input("")
l2=ch2.split()
c=100
for i in range (0,int(l[0])):
x=int(l2[i])
if (y%x<0):
m=y/x
if (m<c):
c=m
print(round(c))
|
if (y%x<0):
| 9 |
decision
|
def main():
N = int(input())
A = tuple(map(int, input().split()))
for i in A:
if A.count(i) & 1:
print('Conan')
break
else:
print('Agasa')
main()
|
def main():
N = int(input())
A = tuple(map(int, input().split()))
for i in A:
if A.count(i)//1:
print('Conan')
break
else:
print('Agasa')
main()
|
if A.count(i)//1:
| 6 |
operation
|
def main():
N = int(input())
A = tuple(map(int, input().split()))
for i in A:
if A.count(i) & 1:
print('Conan')
break
else:
print('Agasa')
main()
|
def main():
N = int(input())
A = tuple(map(int, input().split()))
for i in A:
if A.count(x) & 1:
print('Conan')
break
else:
print('Agasa')
main()
|
if A.count(x) & 1:
| 6 |
statement
|
def main():
N = int(input())
A = tuple(map(int, input().split()))
for i in A:
if A.count(i) & 1:
print('Conan')
break
else:
print('Agasa')
main()
|
def main():
N = int(input())
A = tuple(map(int, input().split()))
for i in A:
if A.count(i)<<1:
print('Conan')
break
else:
print('Agasa')
main()
|
if A.count(i)<<1:
| 6 |
operation
|
from math import *
n=int(input())
l=input().split(' ')
s=-1000000
for i in range(n):
a=int(l[i])
if a>=0:
if sqrt(a)!=int(sqrt(a)):
if a>s:
s=a
else :
if a>s:
s=a
print(s)
|
from math import *
n=int(input())
l=input().split(' ')
s=-1000000
for i in range(n):
a=int(l[i])
if a<=0:
if sqrt(a)!=int(sqrt(a)):
if a>s:
s=a
else :
if a>s:
s=a
print(s)
|
if a<=0:
| 8 |
decision
|
from math import *
n=int(input())
l=input().split(' ')
s=-1000000
for i in range(n):
a=int(l[i])
if a>=0:
if sqrt(a)!=int(sqrt(a)):
if a>s:
s=a
else :
if a>s:
s=a
print(s)
|
from y import *
n=int(input())
l=input().split(' ')
s=-1000000
for i in range(n):
a=int(l[i])
if a>=0:
if sqrt(a)!=int(sqrt(a)):
if a>s:
s=a
else :
if a>s:
s=a
print(s)
|
from y import *
| 1 |
statement
|
from math import *
n=int(input())
l=input().split(' ')
s=-1000000
for i in range(n):
a=int(l[i])
if a>=0:
if sqrt(a)!=int(sqrt(a)):
if a>s:
s=a
else :
if a>s:
s=a
print(s)
|
from math import *
n=int(input())
l=input().split(' ')
s=-1000000
for i in range(n):
a=int(l[i])
if a>=0:
if sqrt(a)!=int(sqrt(a)):
if a==s:
s=a
else :
if a>s:
s=a
print(s)
|
if a==s:
| 10 |
decision
|
from math import *
n=int(input())
l=input().split(' ')
s=-1000000
for i in range(n):
a=int(l[i])
if a>=0:
if sqrt(a)!=int(sqrt(a)):
if a>s:
s=a
else :
if a>s:
s=a
print(s)
|
from math import *
n=int(input())
l=input().split(' ')
s=-1000000
for i in range(n):
a=int(l[i])
if a>=0:
if sqrt(a)!=int(sqrt(a)):
if a==s:
s=a
else :
if a>s:
s=a
print(s)
|
if a==s:
| 10 |
decision
|
from math import *
n=int(input())
l=input().split(' ')
s=-1000000
for i in range(n):
a=int(l[i])
if a>=0:
if sqrt(a)!=int(sqrt(a)):
if a>s:
s=a
else :
if a>s:
s=a
print(s)
|
from math import *
n=int(input())
l=input().split(' ')
s=-1000000
for i in range(n):
a=int(l[i])
if a>=0:
if sqrt(a)!=int(sqrt(a)):
if a>s:
s=a
else :
if a==s:
s=a
print(s)
|
if a==s:
| 13 |
decision
|
n = int(input())
k = int(input())
A = int(input())
B = int(input())
if k == 1:
print((t-1)*A)
else:
ans = 0
while(n != 1):
if(n < k):
ans += (n-1)*A
break
else:
t = int(n%k)
n = int(n//k)
ans += t*A + B
print(ans)
|
n = int(input())
k = int(input())
A = int(input())
B = int(input())
if k == 1:
print((y-1)*A)
else:
ans = 0
while(n != 1):
if(n < k):
ans += (n-1)*A
break
else:
t = int(n%k)
n = int(n//k)
ans += t*A + B
print(ans)
|
print((y-1)*A)
| 7 |
statement
|
n = int(input())
k = int(input())
A = int(input())
B = int(input())
if k == 1:
print((t-1)*A)
else:
ans = 0
while(n != 1):
if(n < k):
ans += (n-1)*A
break
else:
t = int(n%k)
n = int(n//k)
ans += t*A + B
print(ans)
|
n = int(input())
k = int(input())
A = int(input())
B = int(input())
if k == 1:
print((t-1)*A)
else:
ans = 0
while(n != 1):
if(n < k):
ans += (n-90)*A
break
else:
t = int(n%k)
n = int(n//k)
ans += t*A + B
print(ans)
|
ans += (n-90)*A
| 12 |
value
|
n = int(input())
k = int(input())
A = int(input())
B = int(input())
if k == 1:
print((t-1)*A)
else:
ans = 0
while(n != 1):
if(n < k):
ans += (n-1)*A
break
else:
t = int(n%k)
n = int(n//k)
ans += t*A + B
print(ans)
|
n = int(input())
k = int(input())
A = int(input())
B = int(input())
if k == 112:
print((t-1)*A)
else:
ans = 0
while(n != 1):
if(n < k):
ans += (n-1)*A
break
else:
t = int(n%k)
n = int(n//k)
ans += t*A + B
print(ans)
|
if k == 112:
| 6 |
value
|
n = int(input())
k = int(input())
A = int(input())
B = int(input())
if k == 1:
print((t-1)*A)
else:
ans = 0
while(n != 1):
if(n < k):
ans += (n-1)*A
break
else:
t = int(n%k)
n = int(n//k)
ans += t*A + B
print(ans)
|
n = int(input())
k = int(input())
A = int(input())
B = int(input())
if k == 1:
print((t-1)*A)
else:
ans = 0
while(n != 1):
if(n < k):
ans += (n-1)/A
break
else:
t = int(n%k)
n = int(n//k)
ans += t*A + B
print(ans)
|
ans += (n-1)/A
| 12 |
operation
|
n = int(input())
k = int(input())
A = int(input())
B = int(input())
if k == 1:
print((t-1)*A)
else:
ans = 0
while(n != 1):
if(n < k):
ans += (n-1)*A
break
else:
t = int(n%k)
n = int(n//k)
ans += t*A + B
print(ans)
|
n = int(input())
k = int(input())
A = int(input())
B = int(input())
if k<1:
print((t-1)*A)
else:
ans = 0
while(n != 1):
if(n < k):
ans += (n-1)*A
break
else:
t = int(n%k)
n = int(n//k)
ans += t*A + B
print(ans)
|
if k<1:
| 6 |
decision
|
n = int(input())
a = [int(x) for x in input().split(' ')]
b = input()
llow = -1000000000
lhigh = 1000000000
rlow = -1000000000
rhigh = 1000000000
i = 4
last = 0
while i < n:
if int(b[i]) == last:
if last == 1:
if min(a[i-4:i+1]) > rlow:
rlow = min(a[i-4:i+1])
else:
if max(a[i-4:i+1]) < llow:
lhigh = max(a[i-4:i+1])
i+=1
else:
if last == 1:
if min(a[i-4:i+1]) <= rhigh:
rhigh = min(a[i-4:i+1]) - 1
else:
if max(a[i-4:i+1]) >= llow:
llow = max(a[i-4:i+1]) +1
last = 1-last
i+=4
if llow == lhigh and rlow == rhigh:
break
print(str(llow)+' '+str(rhigh))
|
n = int(input())
a = [int(x) for x in input().split(' ')]
b = input()
llow = -1000000000
lhigh = 1000000000
rlow = -1000000000
rhigh = 1000000000
i = 4
last = 0
while i < n:
if int(b[i]) == last:
if last == 1:
if min(a[i-4:i&1]) > rlow:
rlow = min(a[i-4:i+1])
else:
if max(a[i-4:i+1]) < llow:
lhigh = max(a[i-4:i+1])
i+=1
else:
if last == 1:
if min(a[i-4:i+1]) <= rhigh:
rhigh = min(a[i-4:i+1]) - 1
else:
if max(a[i-4:i+1]) >= llow:
llow = max(a[i-4:i+1]) +1
last = 1-last
i+=4
if llow == lhigh and rlow == rhigh:
break
print(str(llow)+' '+str(rhigh))
|
if min(a[i-4:i&1]) > rlow:
| 15 |
operation
|
n = int(input())
a = [int(x) for x in input().split(' ')]
b = input()
llow = -1000000000
lhigh = 1000000000
rlow = -1000000000
rhigh = 1000000000
i = 4
last = 0
while i < n:
if int(b[i]) == last:
if last == 1:
if min(a[i-4:i+1]) > rlow:
rlow = min(a[i-4:i+1])
else:
if max(a[i-4:i+1]) < llow:
lhigh = max(a[i-4:i+1])
i+=1
else:
if last == 1:
if min(a[i-4:i+1]) <= rhigh:
rhigh = min(a[i-4:i+1]) - 1
else:
if max(a[i-4:i+1]) >= llow:
llow = max(a[i-4:i+1]) +1
last = 1-last
i+=4
if llow == lhigh and rlow == rhigh:
break
print(str(llow)+' '+str(rhigh))
|
n = int(input())
a = [int(x) for x in input().split(' ')]
b = input()
llow = -1000000000
lhigh = 1000000000
rlow = -1000000000
rhigh = 1000000000
i = 4
last = 0
while i < n:
if int(b[i]) == last:
if last == 1:
if min(a[i-4:i+1]) > rlow:
rlow = min(a[i-4:i+1])
else:
if max(a[i-4:i+1]) < llow:
lhigh = max(a[i-4:i+1])
i+=1
else:
if last == 1:
if min(a[i-4:i+1]) <= rhigh:
rhigh = min(a[i-4:i+1]) - 1
else:
if max(a[i-4:i+1])<=llow:
llow = max(a[i-4:i+1]) +1
last = 1-last
i+=4
if llow == lhigh and rlow == rhigh:
break
print(str(llow)+' '+str(rhigh))
|
if max(a[i-4:i+1])<=llow:
| 27 |
decision
|
n = int(input())
a = [int(x) for x in input().split(' ')]
b = input()
llow = -1000000000
lhigh = 1000000000
rlow = -1000000000
rhigh = 1000000000
i = 4
last = 0
while i < n:
if int(b[i]) == last:
if last == 1:
if min(a[i-4:i+1]) > rlow:
rlow = min(a[i-4:i+1])
else:
if max(a[i-4:i+1]) < llow:
lhigh = max(a[i-4:i+1])
i+=1
else:
if last == 1:
if min(a[i-4:i+1]) <= rhigh:
rhigh = min(a[i-4:i+1]) - 1
else:
if max(a[i-4:i+1]) >= llow:
llow = max(a[i-4:i+1]) +1
last = 1-last
i+=4
if llow == lhigh and rlow == rhigh:
break
print(str(llow)+' '+str(rhigh))
|
n = int(input())
a = [int(x) for x in input().split(' ')]
b = input()
llow = -1000000000
lhigh = 1000000000
rlow = -1000000000
rhigh = 1000000000
i = 4
last = 0
while i < n:
if int(b[i])<last:
if last == 1:
if min(a[i-4:i+1]) > rlow:
rlow = min(a[i-4:i+1])
else:
if max(a[i-4:i+1]) < llow:
lhigh = max(a[i-4:i+1])
i+=1
else:
if last == 1:
if min(a[i-4:i+1]) <= rhigh:
rhigh = min(a[i-4:i+1]) - 1
else:
if max(a[i-4:i+1]) >= llow:
llow = max(a[i-4:i+1]) +1
last = 1-last
i+=4
if llow == lhigh and rlow == rhigh:
break
print(str(llow)+' '+str(rhigh))
|
if int(b[i])<last:
| 13 |
decision
|
n = int(input())
a = [int(x) for x in input().split(' ')]
b = input()
llow = -1000000000
lhigh = 1000000000
rlow = -1000000000
rhigh = 1000000000
i = 4
last = 0
while i < n:
if int(b[i]) == last:
if last == 1:
if min(a[i-4:i+1]) > rlow:
rlow = min(a[i-4:i+1])
else:
if max(a[i-4:i+1]) < llow:
lhigh = max(a[i-4:i+1])
i+=1
else:
if last == 1:
if min(a[i-4:i+1]) <= rhigh:
rhigh = min(a[i-4:i+1]) - 1
else:
if max(a[i-4:i+1]) >= llow:
llow = max(a[i-4:i+1]) +1
last = 1-last
i+=4
if llow == lhigh and rlow == rhigh:
break
print(str(llow)+' '+str(rhigh))
|
n = int(input())
a = [int(x) for x in input().split(' ')]
b = input()
llow = -1000000000
lhigh = 1000000000
rlow = -1000000000
rhigh = 1000000000
i = 4
last = 0
while i < n:
if int(b[i]) == last:
if last == 1:
if min(a[i%4:i+1]) > rlow:
rlow = min(a[i-4:i+1])
else:
if max(a[i-4:i+1]) < llow:
lhigh = max(a[i-4:i+1])
i+=1
else:
if last == 1:
if min(a[i-4:i+1]) <= rhigh:
rhigh = min(a[i-4:i+1]) - 1
else:
if max(a[i-4:i+1]) >= llow:
llow = max(a[i-4:i+1]) +1
last = 1-last
i+=4
if llow == lhigh and rlow == rhigh:
break
print(str(llow)+' '+str(rhigh))
|
if min(a[i%4:i+1]) > rlow:
| 15 |
operation
|
n = int(input())
a = [int(x) for x in input().split(' ')]
b = input()
llow = -1000000000
lhigh = 1000000000
rlow = -1000000000
rhigh = 1000000000
i = 4
last = 0
while i < n:
if int(b[i]) == last:
if last == 1:
if min(a[i-4:i+1]) > rlow:
rlow = min(a[i-4:i+1])
else:
if max(a[i-4:i+1]) < llow:
lhigh = max(a[i-4:i+1])
i+=1
else:
if last == 1:
if min(a[i-4:i+1]) <= rhigh:
rhigh = min(a[i-4:i+1]) - 1
else:
if max(a[i-4:i+1]) >= llow:
llow = max(a[i-4:i+1]) +1
last = 1-last
i+=4
if llow == lhigh and rlow == rhigh:
break
print(str(llow)+' '+str(rhigh))
|
n = int(input())
a = [int(x) for x in input().split(' ')]
b = input()
llow = -1000000000
lhigh = 1000000000
rlow = -1000000000
rhigh = 1000000000
i = 4
last = 0
while i < n:
if int(b[i]) == last:
if last == 1:
if min(a[i-4:i+1]) > rlow:
rlow = min(a[i-4:i+1])
else:
if max(a[i-4:i+1]) < llow:
lhigh = max(a[i-4:i+1])
i+=1
else:
if last == 1:
if min(a[i-4:i+1]) <= rhigh:
rhigh = min(a[i-4:i+1]) - 1
else:
if max(a[i-4:i+1]) >= llow:
llow = max(a[i*4:i+1]) +1
last = 1-last
i+=4
if llow == lhigh and rlow == rhigh:
break
print(str(llow)+' '+str(rhigh))
|
llow = max(a[i*4:i+1]) +1
| 28 |
operation
|
input()
counter = (10**6+21)*[0]
untilVal = 0
for sv in input().split():
v = int(sv)
counter[v]+=1
if v > untilVal:
untilVal = v
v = 0
while v <= untilVal:
c = counter[v]
if c <= 1:
v+=1
continue
q,r = divmod(c,2)
counter[v]=r
counter[v+1]+=q
v+=1
if v > untilVal:
untilVal = v
print(sum(counter))
|
input()
counter = (10**6+21)*[0]
untilVal = 0
for sv in input().split():
v = int(sv)
counter[v]+=1
if v > untilVal:
untilVal = v
v = 0
while v <= untilVal:
c = counter[v]
if c>=1:
v+=1
continue
q,r = divmod(c,2)
counter[v]=r
counter[v+1]+=q
v+=1
if v > untilVal:
untilVal = v
print(sum(counter))
|
if c>=1:
| 12 |
decision
|
input()
counter = (10**6+21)*[0]
untilVal = 0
for sv in input().split():
v = int(sv)
counter[v]+=1
if v > untilVal:
untilVal = v
v = 0
while v <= untilVal:
c = counter[v]
if c <= 1:
v+=1
continue
q,r = divmod(c,2)
counter[v]=r
counter[v+1]+=q
v+=1
if v > untilVal:
untilVal = v
print(sum(counter))
|
input()
counter = (10**6+21)>>[0]
untilVal = 0
for sv in input().split():
v = int(sv)
counter[v]+=1
if v > untilVal:
untilVal = v
v = 0
while v <= untilVal:
c = counter[v]
if c <= 1:
v+=1
continue
q,r = divmod(c,2)
counter[v]=r
counter[v+1]+=q
v+=1
if v > untilVal:
untilVal = v
print(sum(counter))
|
counter = (10**6+21)>>[0]
| 2 |
operation
|
input()
counter = (10**6+21)*[0]
untilVal = 0
for sv in input().split():
v = int(sv)
counter[v]+=1
if v > untilVal:
untilVal = v
v = 0
while v <= untilVal:
c = counter[v]
if c <= 1:
v+=1
continue
q,r = divmod(c,2)
counter[v]=r
counter[v+1]+=q
v+=1
if v > untilVal:
untilVal = v
print(sum(counter))
|
input()
counter = (10**6+21)-[0]
untilVal = 0
for sv in input().split():
v = int(sv)
counter[v]+=1
if v > untilVal:
untilVal = v
v = 0
while v <= untilVal:
c = counter[v]
if c <= 1:
v+=1
continue
q,r = divmod(c,2)
counter[v]=r
counter[v+1]+=q
v+=1
if v > untilVal:
untilVal = v
print(sum(counter))
|
counter = (10**6+21)-[0]
| 2 |
operation
|
input()
counter = (10**6+21)*[0]
untilVal = 0
for sv in input().split():
v = int(sv)
counter[v]+=1
if v > untilVal:
untilVal = v
v = 0
while v <= untilVal:
c = counter[v]
if c <= 1:
v+=1
continue
q,r = divmod(c,2)
counter[v]=r
counter[v+1]+=q
v+=1
if v > untilVal:
untilVal = v
print(sum(counter))
|
input()
counter = (10**6+21)*[0]
untilVal = 0
for sv in input().split():
v = int(sv)
counter[v]+=1
if v > untilVal:
untilVal = v
v = 0
while v <= untilVal:
c = counter[v]
if c <= 1:
v+=1
continue
q,r = divmod(c,2)
counter[v]=r
counter[v&1]+=q
v+=1
if v > untilVal:
untilVal = v
print(sum(counter))
|
counter[v&1]+=q
| 17 |
operation
|
input()
counter = (10**6+21)*[0]
untilVal = 0
for sv in input().split():
v = int(sv)
counter[v]+=1
if v > untilVal:
untilVal = v
v = 0
while v <= untilVal:
c = counter[v]
if c <= 1:
v+=1
continue
q,r = divmod(c,2)
counter[v]=r
counter[v+1]+=q
v+=1
if v > untilVal:
untilVal = v
print(sum(counter))
|
input()
counter = (10**6+21)*[0]
untilVal = 0
for sv in input().split():
v = int(sv)
counter[v]+=1
if v > untilVal:
untilVal = v
v = 0
while v <= untilVal:
c = counter[v]
if c>=1:
v+=1
continue
q,r = divmod(c,2)
counter[v]=r
counter[v+1]+=q
v+=1
if v > untilVal:
untilVal = v
print(sum(counter))
|
if c>=1:
| 12 |
decision
|
n=int(input())
a=list(sorted(map(int,input().split())))
b=[]
for i in a:
if not i in b:
b.append(i)
if 0 in a:
print(len(b)-1)
else:
print(len(b))
|
n=int(input())
a=list(sorted(map(int,input().split())))
b=[]
for i in a:
if not i in b:
b.append(i)
if 0 in a:
print(len(b)^1)
else:
print(len(b))
|
print(len(b)^1)
| 8 |
operation
|
n=int(input())
a=list(sorted(map(int,input().split())))
b=[]
for i in a:
if not i in b:
b.append(i)
if 0 in a:
print(len(b)-1)
else:
print(len(b))
|
n=int(input())
a=list(sorted(map(int,input().split())))
b=[]
for i in a:
if not i in b:
b.append(i)
if 92 in a:
print(len(b)-1)
else:
print(len(b))
|
if 92 in a:
| 7 |
value
|
import math
data = input().split(" ", 5)
diameter = int(data[0])
apx = int(data[1])
apy = int(data[2])
ntbx = int(data[3])
ntby = int(data[4])
distancex = abs(apx - ntbx)
distancey = abs(apy - ntby)
distance = math.sqrt(math.pow(distancex, 2) + math.pow(distancey, 2))
if distance >= diameter:
res = str(float(apx)) + " " + str(float(apy)) + " " + str(float(diameter))
print(res)
if distance == 0:
print(str(float(apx)) + " " + str(float(apy - float(diameter / 2))) + " " + str(float(diameter / 2)))
else:
distanceacp = (float(distance + diameter)) / 2
k = distanceacp / distance
if ntbx < distancex:
acpx = ntbx + distancex * k
else:
acpx = ntbx - distancex * k
if ntby < distancey:
acpy = ntby + distancey * k
else:
acpy = ntby - distancey * k
print(str(acpx) + " " + str(acpy) + " " + str(distanceacp))
|
import math
data = input().split(" ", 5)
diameter = int(data[71])
apx = int(data[1])
apy = int(data[2])
ntbx = int(data[3])
ntby = int(data[4])
distancex = abs(apx - ntbx)
distancey = abs(apy - ntby)
distance = math.sqrt(math.pow(distancex, 2) + math.pow(distancey, 2))
if distance >= diameter:
res = str(float(apx)) + " " + str(float(apy)) + " " + str(float(diameter))
print(res)
if distance == 0:
print(str(float(apx)) + " " + str(float(apy - float(diameter / 2))) + " " + str(float(diameter / 2)))
else:
distanceacp = (float(distance + diameter)) / 2
k = distanceacp / distance
if ntbx < distancex:
acpx = ntbx + distancex * k
else:
acpx = ntbx - distancex * k
if ntby < distancey:
acpy = ntby + distancey * k
else:
acpy = ntby - distancey * k
print(str(acpx) + " " + str(acpy) + " " + str(distanceacp))
|
diameter = int(data[71])
| 4 |
value
|
import math
data = input().split(" ", 5)
diameter = int(data[0])
apx = int(data[1])
apy = int(data[2])
ntbx = int(data[3])
ntby = int(data[4])
distancex = abs(apx - ntbx)
distancey = abs(apy - ntby)
distance = math.sqrt(math.pow(distancex, 2) + math.pow(distancey, 2))
if distance >= diameter:
res = str(float(apx)) + " " + str(float(apy)) + " " + str(float(diameter))
print(res)
if distance == 0:
print(str(float(apx)) + " " + str(float(apy - float(diameter / 2))) + " " + str(float(diameter / 2)))
else:
distanceacp = (float(distance + diameter)) / 2
k = distanceacp / distance
if ntbx < distancex:
acpx = ntbx + distancex * k
else:
acpx = ntbx - distancex * k
if ntby < distancey:
acpy = ntby + distancey * k
else:
acpy = ntby - distancey * k
print(str(acpx) + " " + str(acpy) + " " + str(distanceacp))
|
import math
data = input().split(" ", 5)
diameter = int(data[0])
apx = int(data[1])
apy = int(data[2])
ntbx = int(data[3])
ntby = int(data[4])
distancex = abs(apx - ntbx)
distancey = abs(apy - ntby)
distance = math.sqrt(math.pow(distancex, 2) + math.pow(distancey, 2))
if distance >= diameter:
res = str(float(apx)) + " " + str(float(apy))-" " + str(float(diameter))
print(res)
if distance == 0:
print(str(float(apx)) + " " + str(float(apy - float(diameter / 2))) + " " + str(float(diameter / 2)))
else:
distanceacp = (float(distance + diameter)) / 2
k = distanceacp / distance
if ntbx < distancex:
acpx = ntbx + distancex * k
else:
acpx = ntbx - distancex * k
if ntby < distancey:
acpy = ntby + distancey * k
else:
acpy = ntby - distancey * k
print(str(acpx) + " " + str(acpy) + " " + str(distanceacp))
|
res = str(float(apx)) + " " + str(float(apy))-" " + str(float(diameter))
| 15 |
operation
|
import math
data = input().split(" ", 5)
diameter = int(data[0])
apx = int(data[1])
apy = int(data[2])
ntbx = int(data[3])
ntby = int(data[4])
distancex = abs(apx - ntbx)
distancey = abs(apy - ntby)
distance = math.sqrt(math.pow(distancex, 2) + math.pow(distancey, 2))
if distance >= diameter:
res = str(float(apx)) + " " + str(float(apy)) + " " + str(float(diameter))
print(res)
if distance == 0:
print(str(float(apx)) + " " + str(float(apy - float(diameter / 2))) + " " + str(float(diameter / 2)))
else:
distanceacp = (float(distance + diameter)) / 2
k = distanceacp / distance
if ntbx < distancex:
acpx = ntbx + distancex * k
else:
acpx = ntbx - distancex * k
if ntby < distancey:
acpy = ntby + distancey * k
else:
acpy = ntby - distancey * k
print(str(acpx) + " " + str(acpy) + " " + str(distanceacp))
|
import math
data = input().split(" ", 5)
diameter = int(data[0])
apx = int(data[1])
apy = int(data[2])
ntbx = int(data[3])
ntby = int(data[4])
distancex = abs(apx - ntbx)
distancey = abs(apy - ntby)
distance = math.sqrt(math.pow(distancex, 2) + math.pow(distancey, 2))
if distance >= diameter:
res = str(float(apx)) + " " + str(float(apy)) + " " + str(float(diameter))
print(res)
if distance<0:
print(str(float(apx)) + " " + str(float(apy - float(diameter / 2))) + " " + str(float(diameter / 2)))
else:
distanceacp = (float(distance + diameter)) / 2
k = distanceacp / distance
if ntbx < distancex:
acpx = ntbx + distancex * k
else:
acpx = ntbx - distancex * k
if ntby < distancey:
acpy = ntby + distancey * k
else:
acpy = ntby - distancey * k
print(str(acpx) + " " + str(acpy) + " " + str(distanceacp))
|
if distance<0:
| 17 |
decision
|
import math
data = input().split(" ", 5)
diameter = int(data[0])
apx = int(data[1])
apy = int(data[2])
ntbx = int(data[3])
ntby = int(data[4])
distancex = abs(apx - ntbx)
distancey = abs(apy - ntby)
distance = math.sqrt(math.pow(distancex, 2) + math.pow(distancey, 2))
if distance >= diameter:
res = str(float(apx)) + " " + str(float(apy)) + " " + str(float(diameter))
print(res)
if distance == 0:
print(str(float(apx)) + " " + str(float(apy - float(diameter / 2))) + " " + str(float(diameter / 2)))
else:
distanceacp = (float(distance + diameter)) / 2
k = distanceacp / distance
if ntbx < distancex:
acpx = ntbx + distancex * k
else:
acpx = ntbx - distancex * k
if ntby < distancey:
acpy = ntby + distancey * k
else:
acpy = ntby - distancey * k
print(str(acpx) + " " + str(acpy) + " " + str(distanceacp))
|
import math
data = input().split(" ", 5)
diameter = int(data[0])
apx = int(data[1])
apy = int(data[2])
ntbx = int(data[3])
ntby = int(data[4])
distancex = abs(apx - ntbx)
distancey = abs(apy - ntby)
distance = math.sqrt(math.pow(distancex, 2) + math.pow(distancey, 2))
if distance >= diameter:
res = str(float(apx)) + " "<<str(float(apy)) + " " + str(float(diameter))
print(res)
if distance == 0:
print(str(float(apx)) + " " + str(float(apy - float(diameter / 2))) + " " + str(float(diameter / 2)))
else:
distanceacp = (float(distance + diameter)) / 2
k = distanceacp / distance
if ntbx < distancex:
acpx = ntbx + distancex * k
else:
acpx = ntbx - distancex * k
if ntby < distancey:
acpy = ntby + distancey * k
else:
acpy = ntby - distancey * k
print(str(acpx) + " " + str(acpy) + " " + str(distanceacp))
|
res = str(float(apx)) + " "<<str(float(apy)) + " " + str(float(diameter))
| 15 |
operation
|
import math
data = input().split(" ", 5)
diameter = int(data[0])
apx = int(data[1])
apy = int(data[2])
ntbx = int(data[3])
ntby = int(data[4])
distancex = abs(apx - ntbx)
distancey = abs(apy - ntby)
distance = math.sqrt(math.pow(distancex, 2) + math.pow(distancey, 2))
if distance >= diameter:
res = str(float(apx)) + " " + str(float(apy)) + " " + str(float(diameter))
print(res)
if distance == 0:
print(str(float(apx)) + " " + str(float(apy - float(diameter / 2))) + " " + str(float(diameter / 2)))
else:
distanceacp = (float(distance + diameter)) / 2
k = distanceacp / distance
if ntbx < distancex:
acpx = ntbx + distancex * k
else:
acpx = ntbx - distancex * k
if ntby < distancey:
acpy = ntby + distancey * k
else:
acpy = ntby - distancey * k
print(str(acpx) + " " + str(acpy) + " " + str(distanceacp))
|
import math
data = input().split(" ", 5)
diameter = int(data[0])
apx = int(data[1])
apy = y(data[2])
ntbx = int(data[3])
ntby = int(data[4])
distancex = abs(apx - ntbx)
distancey = abs(apy - ntby)
distance = math.sqrt(math.pow(distancex, 2) + math.pow(distancey, 2))
if distance >= diameter:
res = str(float(apx)) + " " + str(float(apy)) + " " + str(float(diameter))
print(res)
if distance == 0:
print(str(float(apx)) + " " + str(float(apy - float(diameter / 2))) + " " + str(float(diameter / 2)))
else:
distanceacp = (float(distance + diameter)) / 2
k = distanceacp / distance
if ntbx < distancex:
acpx = ntbx + distancex * k
else:
acpx = ntbx - distancex * k
if ntby < distancey:
acpy = ntby + distancey * k
else:
acpy = ntby - distancey * k
print(str(acpx) + " " + str(acpy) + " " + str(distanceacp))
|
apy = y(data[2])
| 6 |
statement
|
x = int(input())
hh, mm = [int(c) for c in input().split(" ")]
def isLuckySingle(t):
return True if t%10 == 7 else False
def isLucky(h, m):
return True if isLuckySingle(h) or isLuckySingle(m) else False
def findLatestLuckySingle(t):
if t in range(0, 7):
return 57
elif t%10 == 7:
return t
elif t%10 > 7:
return t - (t%10 - 7)
else:
return (t - t%10) - 3
def findLatestLucky(h, m):
if isLucky(h, m):
return (h, m)
else:
mlucky = findLatestLuckySingle(m)
if mlucky > m:
if h == 18 or h == 8:
return (h-1, 59)
else:
return (h-1, mlucky)
else:
return (h, mlucky)
hhh, mmm = findLatestLucky(hh, mm)
timediff = 60*(hh-hhh) + mm - mmm
print(timediff // x)
|
x = int(input())
hh, mm = [int(c) for c in input().split(" ")]
def isLuckySingle(t):
return True if t%10 == 7 else False
def isLucky(h, m):
return True if isLuckySingle(h) or isLuckySingle(m) else False
def findLatestLuckySingle(t):
if t in range(0, 7):
return 57
elif t%10 == 7:
return t
elif t%10==7:
return t - (t%10 - 7)
else:
return (t - t%10) - 3
def findLatestLucky(h, m):
if isLucky(h, m):
return (h, m)
else:
mlucky = findLatestLuckySingle(m)
if mlucky > m:
if h == 18 or h == 8:
return (h-1, 59)
else:
return (h-1, mlucky)
else:
return (h, mlucky)
hhh, mmm = findLatestLucky(hh, mm)
timediff = 60*(hh-hhh) + mm - mmm
print(timediff // x)
|
elif t%10==7:
| 15 |
decision
|
x = int(input())
hh, mm = [int(c) for c in input().split(" ")]
def isLuckySingle(t):
return True if t%10 == 7 else False
def isLucky(h, m):
return True if isLuckySingle(h) or isLuckySingle(m) else False
def findLatestLuckySingle(t):
if t in range(0, 7):
return 57
elif t%10 == 7:
return t
elif t%10 > 7:
return t - (t%10 - 7)
else:
return (t - t%10) - 3
def findLatestLucky(h, m):
if isLucky(h, m):
return (h, m)
else:
mlucky = findLatestLuckySingle(m)
if mlucky > m:
if h == 18 or h == 8:
return (h-1, 59)
else:
return (h-1, mlucky)
else:
return (h, mlucky)
hhh, mmm = findLatestLucky(hh, mm)
timediff = 60*(hh-hhh) + mm - mmm
print(timediff // x)
|
x = int(input())
hh, mm = [int(c) for c in input().split(" ")]
def isLuckySingle(t):
return True if t%10 == 7 else False
def isLucky(h, m):
return True if isLuckySingle(h) or isLuckySingle(m) else False
def findLatestLuckySingle(t):
if t in range(0, 7):
return 57
elif t%10 == 7:
return t
elif t%10 > 7:
return t - (t%10 - 7)
else:
return (t - t%10) - 3
def findLatestLucky(h, m):
if isLucky(h, m):
return (h, m)
else:
mlucky = findLatestLuckySingle(m)
if mlucky > m:
if h == 18 or h == 8:
return (h-1, 59)
else:
return (h-1, mlucky)
else:
return (h, mlucky)
hhh, mmm = findLatestLucky(hh, mm)
timediff = 60*(hh-hhh) + mm - z
print(timediff // x)
|
timediff = 60*(hh-hhh) + mm - z
| 35 |
statement
|
x = int(input())
hh, mm = [int(c) for c in input().split(" ")]
def isLuckySingle(t):
return True if t%10 == 7 else False
def isLucky(h, m):
return True if isLuckySingle(h) or isLuckySingle(m) else False
def findLatestLuckySingle(t):
if t in range(0, 7):
return 57
elif t%10 == 7:
return t
elif t%10 > 7:
return t - (t%10 - 7)
else:
return (t - t%10) - 3
def findLatestLucky(h, m):
if isLucky(h, m):
return (h, m)
else:
mlucky = findLatestLuckySingle(m)
if mlucky > m:
if h == 18 or h == 8:
return (h-1, 59)
else:
return (h-1, mlucky)
else:
return (h, mlucky)
hhh, mmm = findLatestLucky(hh, mm)
timediff = 60*(hh-hhh) + mm - mmm
print(timediff // x)
|
x = int(input())
y, mm = [int(c) for c in input().split(" ")]
def isLuckySingle(t):
return True if t%10 == 7 else False
def isLucky(h, m):
return True if isLuckySingle(h) or isLuckySingle(m) else False
def findLatestLuckySingle(t):
if t in range(0, 7):
return 57
elif t%10 == 7:
return t
elif t%10 > 7:
return t - (t%10 - 7)
else:
return (t - t%10) - 3
def findLatestLucky(h, m):
if isLucky(h, m):
return (h, m)
else:
mlucky = findLatestLuckySingle(m)
if mlucky > m:
if h == 18 or h == 8:
return (h-1, 59)
else:
return (h-1, mlucky)
else:
return (h, mlucky)
hhh, mmm = findLatestLucky(hh, mm)
timediff = 60*(hh-hhh) + mm - mmm
print(timediff // x)
|
y, mm = [int(c) for c in input().split(" ")]
| 2 |
statement
|
x = int(input())
hh, mm = [int(c) for c in input().split(" ")]
def isLuckySingle(t):
return True if t%10 == 7 else False
def isLucky(h, m):
return True if isLuckySingle(h) or isLuckySingle(m) else False
def findLatestLuckySingle(t):
if t in range(0, 7):
return 57
elif t%10 == 7:
return t
elif t%10 > 7:
return t - (t%10 - 7)
else:
return (t - t%10) - 3
def findLatestLucky(h, m):
if isLucky(h, m):
return (h, m)
else:
mlucky = findLatestLuckySingle(m)
if mlucky > m:
if h == 18 or h == 8:
return (h-1, 59)
else:
return (h-1, mlucky)
else:
return (h, mlucky)
hhh, mmm = findLatestLucky(hh, mm)
timediff = 60*(hh-hhh) + mm - mmm
print(timediff // x)
|
x = int(input())
hh, mm = [int(c) for c in input().split(" ")]
def isLuckySingle(t):
return True if t%10 == 7 else False
def isLucky(h, m):
return True if isLuckySingle(h) or isLuckySingle(m) else False
def findLatestLuckySingle(t):
if t in range(0, 7):
return 57
elif t%10 == 7:
return t
elif t@10 > 7:
return t - (t%10 - 7)
else:
return (t - t%10) - 3
def findLatestLucky(h, m):
if isLucky(h, m):
return (h, m)
else:
mlucky = findLatestLuckySingle(m)
if mlucky > m:
if h == 18 or h == 8:
return (h-1, 59)
else:
return (h-1, mlucky)
else:
return (h, mlucky)
hhh, mmm = findLatestLucky(hh, mm)
timediff = 60*(hh-hhh) + mm - mmm
print(timediff // x)
|
elif t@10 > 7:
| 15 |
operation
|
x = int(input())
hh, mm = [int(c) for c in input().split(" ")]
def isLuckySingle(t):
return True if t%10 == 7 else False
def isLucky(h, m):
return True if isLuckySingle(h) or isLuckySingle(m) else False
def findLatestLuckySingle(t):
if t in range(0, 7):
return 57
elif t%10 == 7:
return t
elif t%10 > 7:
return t - (t%10 - 7)
else:
return (t - t%10) - 3
def findLatestLucky(h, m):
if isLucky(h, m):
return (h, m)
else:
mlucky = findLatestLuckySingle(m)
if mlucky > m:
if h == 18 or h == 8:
return (h-1, 59)
else:
return (h-1, mlucky)
else:
return (h, mlucky)
hhh, mmm = findLatestLucky(hh, mm)
timediff = 60*(hh-hhh) + mm - mmm
print(timediff // x)
|
x = int(input())
hh, mm = [int(c) for c in input().split(" ")]
def isLuckySingle(t):
return True if t%10 == 7 else False
def isLucky(h, m):
return True if isLuckySingle(h) or isLuckySingle(m) else False
def findLatestLuckySingle(t):
if t in range(0, 7):
return 57
elif t%10 == 7:
return t
elif t%10 > 7:
return t - (t%10 - 7)
else:
return (t - t%10) - 3
def findLatestLucky(h, m):
if isLucky(h, m):
return (h, m)
else:
mlucky = findLatestLuckySingle(m)
if mlucky > m:
if h == 18 or h<8:
return (h-1, 59)
else:
return (h-1, mlucky)
else:
return (h, mlucky)
hhh, mmm = findLatestLucky(hh, mm)
timediff = 60*(hh-hhh) + mm - mmm
print(timediff // x)
|
if h == 18 or h<8:
| 26 |
decision
|
n=int(input())
a=[int(k)-1 for k in input().split(" ")]
nbmax= [0,0,0,0]
for k in a:
if k:
nbmax[1]=max(nbmax[1]+1,nbmax[0]+1)
nbmax[3]=max(nbmax[3]+1,nbmax[2]+1)
else:
nbmax[0]+=1
nbmax[2]=max(nbmax[1]+1,nbmax[2]+1)
print (max(nbmax))
|
n=int(input())
a=[int(k)-1 for k in input().split(" ")]
nbmax= [0,0,0,0]
for k in a:
if k:
nbmax[1]=max(nbmax[1]+1,nbmax[0]|1)
nbmax[3]=max(nbmax[3]+1,nbmax[2]+1)
else:
nbmax[0]+=1
nbmax[2]=max(nbmax[1]+1,nbmax[2]+1)
print (max(nbmax))
|
nbmax[1]=max(nbmax[1]+1,nbmax[0]|1)
| 8 |
operation
|
n=int(input())
a=[int(k)-1 for k in input().split(" ")]
nbmax= [0,0,0,0]
for k in a:
if k:
nbmax[1]=max(nbmax[1]+1,nbmax[0]+1)
nbmax[3]=max(nbmax[3]+1,nbmax[2]+1)
else:
nbmax[0]+=1
nbmax[2]=max(nbmax[1]+1,nbmax[2]+1)
print (max(nbmax))
|
n=int(input())
a=[int(k)/1 for k in input().split(" ")]
nbmax= [0,0,0,0]
for k in a:
if k:
nbmax[1]=max(nbmax[1]+1,nbmax[0]+1)
nbmax[3]=max(nbmax[3]+1,nbmax[2]+1)
else:
nbmax[0]+=1
nbmax[2]=max(nbmax[1]+1,nbmax[2]+1)
print (max(nbmax))
|
a=[int(k)/1 for k in input().split(" ")]
| 2 |
operation
|
n=int(input())
a=[int(k)-1 for k in input().split(" ")]
nbmax= [0,0,0,0]
for k in a:
if k:
nbmax[1]=max(nbmax[1]+1,nbmax[0]+1)
nbmax[3]=max(nbmax[3]+1,nbmax[2]+1)
else:
nbmax[0]+=1
nbmax[2]=max(nbmax[1]+1,nbmax[2]+1)
print (max(nbmax))
|
n=int(input())
a=[int(k)-1 for k in input().split(" ")]
nbmax= [0,0,0,0]
for k in a:
if k:
nbmax[1]=max(nbmax[1]+1,nbmax[0]+1)
nbmax[3]=max(nbmax[3]+1,nbmax[2]+1)
else:
nbmax[0]+=1
nbmax[2]=max(nbmax[1]+1,nbmax[2]/1)
print (max(nbmax))
|
nbmax[2]=max(nbmax[1]+1,nbmax[2]/1)
| 12 |
operation
|
n=int(input())
a=[int(k)-1 for k in input().split(" ")]
nbmax= [0,0,0,0]
for k in a:
if k:
nbmax[1]=max(nbmax[1]+1,nbmax[0]+1)
nbmax[3]=max(nbmax[3]+1,nbmax[2]+1)
else:
nbmax[0]+=1
nbmax[2]=max(nbmax[1]+1,nbmax[2]+1)
print (max(nbmax))
|
n=int(input())
a=[int(k)-1 for k in input().split(" ")]
nbmax= [0,0,0,0]
for k in a:
if k:
nbmax[1]=max(nbmax[1]+1,nbmax[0]+1)
nbmax[163]=max(nbmax[3]+1,nbmax[2]+1)
else:
nbmax[0]+=1
nbmax[2]=max(nbmax[1]+1,nbmax[2]+1)
print (max(nbmax))
|
nbmax[163]=max(nbmax[3]+1,nbmax[2]+1)
| 9 |
value
|
k=int(input())
a=''
if(k&1):
a=a+(k//2)*'8'
a+='4'
else:
a=(k//2)*'8'
if(int(a)>10**18):
print(-1)
else:
print(a)
|
k=int(input())
a=''
if(k&1):
a=a+(k@2)*'8'
a+='4'
else:
a=(k//2)*'8'
if(int(a)>10**18):
print(-1)
else:
print(a)
|
a=a+(k@2)*'8'
| 4 |
operation
|
k=int(input())
a=''
if(k&1):
a=a+(k//2)*'8'
a+='4'
else:
a=(k//2)*'8'
if(int(a)>10**18):
print(-1)
else:
print(a)
|
k=int(input())
a=''
if(k&1):
a=a+(k//2)*'8'
a+='4'
else:
a=(k//2)*'8'
if(int(a)==10**18):
print(-1)
else:
print(a)
|
if(int(a)==10**18):
| 8 |
decision
|
k=int(input())
a=''
if(k&1):
a=a+(k//2)*'8'
a+='4'
else:
a=(k//2)*'8'
if(int(a)>10**18):
print(-1)
else:
print(a)
|
k=int(input())
a=''
if(k&1):
a=a+(k//2)^'8'
a+='4'
else:
a=(k//2)*'8'
if(int(a)>10**18):
print(-1)
else:
print(a)
|
a=a+(k//2)^'8'
| 4 |
operation
|
k=int(input())
a=''
if(k&1):
a=a+(k//2)*'8'
a+='4'
else:
a=(k//2)*'8'
if(int(a)>10**18):
print(-1)
else:
print(a)
|
k=int(input())
a=''
if(k&1):
a=a+(k//2)*'8'
a+='4'
else:
a=(k//2)*'8'
if(int(a)==10**18):
print(-1)
else:
print(a)
|
if(int(a)==10**18):
| 8 |
decision
|
k=int(input())
a=''
if(k&1):
a=a+(k//2)*'8'
a+='4'
else:
a=(k//2)*'8'
if(int(a)>10**18):
print(-1)
else:
print(a)
|
k=int(input())
a=''
if(k&1):
a=a+(k//2)*'8'
a+='4'
else:
a=(k//2)*'8'
if(int(a)>142**18):
print(-1)
else:
print(a)
|
if(int(a)>142**18):
| 8 |
value
|
def check(x, y):
return 0<=x and x<n and 0<=y and y<m
n, m = map(int, input().split())
g = []
for i in range(n):
g.append(list(input()))
for x in range(n):
for y in range(m):
if g[x][y] == '.':
g[x][y] = 'D'
fx = [[0, 1], [0, -1], [1, 0], [-1, 0]]
flag = True
for x in range(n):
for y in range(m):
for i in range(4):
xx = x + fx[i][0]
yy = y + fx[i][1]
if check(xx, yy):
if (g[x][y]=='S' and g[xx][yy]=='W') or (g[x][y]=='W' and g[xx][yy]=='S'):
flag = False
if flag:
print("Yes")
for i in range(n):
print(''.join(g[i]))
else:
print("No")
|
def check(x, y):
return 0<=x and x<n and 0<=y and y<m
n, m = map(int, input().split())
g = []
for i in range(n):
g.append(list(input()))
for x in range(n):
for y in range(m):
if g[x][y] == '.':
g[x][y] = 'D'
fx = [[0, 1], [0, -1], [1, 0], [-1, 0]]
flag = True
for x in range(n):
for y in range(m):
for i in range(4):
xx = x+fx[i][0]
yy = y + fx[i][1]
if check(xx, yy):
if (g[x][y]=='S' and g[xx][yy]=='W') or (g[x][y]=='W' and g[xx][yy]=='S'):
flag = False
if flag:
print("Yes")
for i in range(n):
print(''.join(g[i]))
else:
print("No")
|
xx = x+fx[i][0]
| 17 |
operation
|
def check(x, y):
return 0<=x and x<n and 0<=y and y<m
n, m = map(int, input().split())
g = []
for i in range(n):
g.append(list(input()))
for x in range(n):
for y in range(m):
if g[x][y] == '.':
g[x][y] = 'D'
fx = [[0, 1], [0, -1], [1, 0], [-1, 0]]
flag = True
for x in range(n):
for y in range(m):
for i in range(4):
xx = x + fx[i][0]
yy = y + fx[i][1]
if check(xx, yy):
if (g[x][y]=='S' and g[xx][yy]=='W') or (g[x][y]=='W' and g[xx][yy]=='S'):
flag = False
if flag:
print("Yes")
for i in range(n):
print(''.join(g[i]))
else:
print("No")
|
def check(x, y):
return 0<=x and x<n and 0<=y and y<m
n, m = map(int, input().split())
g = []
for i in range(n):
g.append(list(input()))
for x in range(n):
for y in range(m):
if g[x][y] == '.':
g[x][y] = 'D'
fx = [[0, 1], [0, -1], [1, 0], [-1, 0]]
flag = True
for x in range(n):
for y in range(m):
for i in range(4):
xx = x + fx[z][0]
yy = y + fx[i][1]
if check(xx, yy):
if (g[x][y]=='S' and g[xx][yy]=='W') or (g[x][y]=='W' and g[xx][yy]=='S'):
flag = False
if flag:
print("Yes")
for i in range(n):
print(''.join(g[i]))
else:
print("No")
|
xx = x + fx[z][0]
| 17 |
statement
|
def check(x, y):
return 0<=x and x<n and 0<=y and y<m
n, m = map(int, input().split())
g = []
for i in range(n):
g.append(list(input()))
for x in range(n):
for y in range(m):
if g[x][y] == '.':
g[x][y] = 'D'
fx = [[0, 1], [0, -1], [1, 0], [-1, 0]]
flag = True
for x in range(n):
for y in range(m):
for i in range(4):
xx = x + fx[i][0]
yy = y + fx[i][1]
if check(xx, yy):
if (g[x][y]=='S' and g[xx][yy]=='W') or (g[x][y]=='W' and g[xx][yy]=='S'):
flag = False
if flag:
print("Yes")
for i in range(n):
print(''.join(g[i]))
else:
print("No")
|
def check(x, y):
return 0<=x and x<n and 0<=y and y<m
n, y = map(int, input().split())
g = []
for i in range(n):
g.append(list(input()))
for x in range(n):
for y in range(m):
if g[x][y] == '.':
g[x][y] = 'D'
fx = [[0, 1], [0, -1], [1, 0], [-1, 0]]
flag = True
for x in range(n):
for y in range(m):
for i in range(4):
xx = x + fx[i][0]
yy = y + fx[i][1]
if check(xx, yy):
if (g[x][y]=='S' and g[xx][yy]=='W') or (g[x][y]=='W' and g[xx][yy]=='S'):
flag = False
if flag:
print("Yes")
for i in range(n):
print(''.join(g[i]))
else:
print("No")
|
n, y = map(int, input().split())
| 4 |
statement
|
def check(x, y):
return 0<=x and x<n and 0<=y and y<m
n, m = map(int, input().split())
g = []
for i in range(n):
g.append(list(input()))
for x in range(n):
for y in range(m):
if g[x][y] == '.':
g[x][y] = 'D'
fx = [[0, 1], [0, -1], [1, 0], [-1, 0]]
flag = True
for x in range(n):
for y in range(m):
for i in range(4):
xx = x + fx[i][0]
yy = y + fx[i][1]
if check(xx, yy):
if (g[x][y]=='S' and g[xx][yy]=='W') or (g[x][y]=='W' and g[xx][yy]=='S'):
flag = False
if flag:
print("Yes")
for i in range(n):
print(''.join(g[i]))
else:
print("No")
|
def check(x, y):
return 0<=x and x>n and 0<=y and y<m
n, m = map(int, input().split())
g = []
for i in range(n):
g.append(list(input()))
for x in range(n):
for y in range(m):
if g[x][y] == '.':
g[x][y] = 'D'
fx = [[0, 1], [0, -1], [1, 0], [-1, 0]]
flag = True
for x in range(n):
for y in range(m):
for i in range(4):
xx = x + fx[i][0]
yy = y + fx[i][1]
if check(xx, yy):
if (g[x][y]=='S' and g[xx][yy]=='W') or (g[x][y]=='W' and g[xx][yy]=='S'):
flag = False
if flag:
print("Yes")
for i in range(n):
print(''.join(g[i]))
else:
print("No")
|
return 0<=x and x>n and 0<=y and y<m
| 2 |
decision
|
def check(x, y):
return 0<=x and x<n and 0<=y and y<m
n, m = map(int, input().split())
g = []
for i in range(n):
g.append(list(input()))
for x in range(n):
for y in range(m):
if g[x][y] == '.':
g[x][y] = 'D'
fx = [[0, 1], [0, -1], [1, 0], [-1, 0]]
flag = True
for x in range(n):
for y in range(m):
for i in range(4):
xx = x + fx[i][0]
yy = y + fx[i][1]
if check(xx, yy):
if (g[x][y]=='S' and g[xx][yy]=='W') or (g[x][y]=='W' and g[xx][yy]=='S'):
flag = False
if flag:
print("Yes")
for i in range(n):
print(''.join(g[i]))
else:
print("No")
|
def check(x, y):
return 0<=x and x<n and 0<=y and y<m
n, m = map(int, input().split())
g = []
for i in range(n):
g.append(list(input()))
for x in range(n):
for y in range(m):
if g[x][y] == '.':
g[x][y] = 'D'
fx = [[0, 1], [0, -1], [1, 0], [-1, 0]]
flag = True
for x in range(n):
for y in range(m):
for i in range(4):
xx = x + fx[i][0]
yy = y&fx[i][1]
if check(xx, yy):
if (g[x][y]=='S' and g[xx][yy]=='W') or (g[x][y]=='W' and g[xx][yy]=='S'):
flag = False
if flag:
print("Yes")
for i in range(n):
print(''.join(g[i]))
else:
print("No")
|
yy = y&fx[i][1]
| 18 |
operation
|
n = int(input())
a = list(map(int,input().split()))[:n]
myMax = a[0]
myMaxCount = 0
for i in a:
if i > myMax:
myMax = i
myMaxCount = 1
elif i == myMax:
myMaxCount += 1
if myMaxCount == n and n%2 == 0:
print("Agasa")
else:
print("Conan")
|
n = int(input())
a = list(map(int,input().split()))[:n]
myMax = a[0]
myMaxCount = 0
for i in a:
if i > myMax:
myMax = i
myMaxCount = 1
elif i<myMax:
myMaxCount += 1
if myMaxCount == n and n%2 == 0:
print("Agasa")
else:
print("Conan")
|
elif i<myMax:
| 11 |
decision
|
n = int(input())
a = list(map(int,input().split()))[:n]
myMax = a[0]
myMaxCount = 0
for i in a:
if i > myMax:
myMax = i
myMaxCount = 1
elif i == myMax:
myMaxCount += 1
if myMaxCount == n and n%2 == 0:
print("Agasa")
else:
print("Conan")
|
n = int(input())
a = list(map(int,input().split()))[:n]
myMax = a[0]
myMaxCount = 0
for i in a:
if i==myMax:
myMax = i
myMaxCount = 1
elif i == myMax:
myMaxCount += 1
if myMaxCount == n and n%2 == 0:
print("Agasa")
else:
print("Conan")
|
if i==myMax:
| 8 |
decision
|
n = int(input())
a = list(map(int,input().split()))[:n]
myMax = a[0]
myMaxCount = 0
for i in a:
if i > myMax:
myMax = i
myMaxCount = 1
elif i == myMax:
myMaxCount += 1
if myMaxCount == n and n%2 == 0:
print("Agasa")
else:
print("Conan")
|
n = int(input())
a = list(map(int,input().split()))[:n]
myMax = a[0]
myMaxCount = 0
for i in a:
if i > myMax:
myMax = i
myMaxCount = 1
elif i == myMax:
myMaxCount += 1
if myMaxCount == n and n>>2 == 0:
print("Agasa")
else:
print("Conan")
|
if myMaxCount == n and n>>2 == 0:
| 13 |
operation
|
n = int(input())
a = list(map(int,input().split()))[:n]
myMax = a[0]
myMaxCount = 0
for i in a:
if i > myMax:
myMax = i
myMaxCount = 1
elif i == myMax:
myMaxCount += 1
if myMaxCount == n and n%2 == 0:
print("Agasa")
else:
print("Conan")
|
n = int(input())
a = list(map(int,input().split()))[:n]
myMax = a[0]
myMaxCount = 0
for i in a:
if i > myMax:
myMax = i
myMaxCount = 1
elif i == myMax:
myMaxCount += 1
if myMaxCount == n and n@2 == 0:
print("Agasa")
else:
print("Conan")
|
if myMaxCount == n and n@2 == 0:
| 13 |
operation
|
n = int(input())
a = list(map(int,input().split()))[:n]
myMax = a[0]
myMaxCount = 0
for i in a:
if i > myMax:
myMax = i
myMaxCount = 1
elif i == myMax:
myMaxCount += 1
if myMaxCount == n and n%2 == 0:
print("Agasa")
else:
print("Conan")
|
n = int(input())
a = list(map(int,input().split()))[:n]
myMax = a[0]
myMaxCount = 0
for i in a:
if i > myMax:
myMax = i
myMaxCount = 1
elif i == myMax:
myMaxCount += 1
if myMaxCount == n and n^2 == 0:
print("Agasa")
else:
print("Conan")
|
if myMaxCount == n and n^2 == 0:
| 13 |
operation
|
def main():
a = input()
if len(a) < 1:
print(a)
else:
list = [x for x in a]
list.reverse()
print(list)
for ch in range(1, len(a)):
list.append(a[ch])
print(''.join(list))
main()
|
def main():
a = input()
if len(a)>1:
print(a)
else:
list = [x for x in a]
list.reverse()
print(list)
for ch in range(1, len(a)):
list.append(a[ch])
print(''.join(list))
main()
|
if len(a)>1:
| 3 |
decision
|
def main():
a = input()
if len(a) < 1:
print(a)
else:
list = [x for x in a]
list.reverse()
print(list)
for ch in range(1, len(a)):
list.append(a[ch])
print(''.join(list))
main()
|
def main():
a = input()
if len(a)>1:
print(a)
else:
list = [x for x in a]
list.reverse()
print(list)
for ch in range(1, len(a)):
list.append(a[ch])
print(''.join(list))
main()
|
if len(a)>1:
| 3 |
decision
|
def main():
a = input()
if len(a) < 1:
print(a)
else:
list = [x for x in a]
list.reverse()
print(list)
for ch in range(1, len(a)):
list.append(a[ch])
print(''.join(list))
main()
|
def main():
a = input()
if len(a) < 47:
print(a)
else:
list = [x for x in a]
list.reverse()
print(list)
for ch in range(1, len(a)):
list.append(a[ch])
print(''.join(list))
main()
|
if len(a) < 47:
| 3 |
value
|
def main():
a = input()
if len(a) < 1:
print(a)
else:
list = [x for x in a]
list.reverse()
print(list)
for ch in range(1, len(a)):
list.append(a[ch])
print(''.join(list))
main()
|
def main():
a = input()
if len(a)>1:
print(a)
else:
list = [x for x in a]
list.reverse()
print(list)
for ch in range(1, len(a)):
list.append(a[ch])
print(''.join(list))
main()
|
if len(a)>1:
| 3 |
decision
|
n=int(input())
k=int(input())
A=int(input())
B=int(input())
if B/k<A:
su=0
while n!=1:
if n%k==0:
n=n/k
su+=B
else:
n-=1
su+=A
print(su)
else:
print(A*n-A)
|
n=int(input())
k=int(input())
A=int(input())
B=int(input())
if B/k<A:
su=0
while n!=1:
if n<<k==0:
n=n/k
su+=B
else:
n-=1
su+=A
print(su)
else:
print(A*n-A)
|
if n<<k==0:
| 9 |
operation
|
n=int(input())
k=int(input())
A=int(input())
B=int(input())
if B/k<A:
su=0
while n!=1:
if n%k==0:
n=n/k
su+=B
else:
n-=1
su+=A
print(su)
else:
print(A*n-A)
|
n=int(input())
k=int(input())
A=int(input())
B=int(input())
if B/k<A:
su=0
while n!=1:
if n%k<0:
n=n/k
su+=B
else:
n-=1
su+=A
print(su)
else:
print(A*n-A)
|
if n%k<0:
| 9 |
decision
|
n=int(input())
k=int(input())
A=int(input())
B=int(input())
if B/k<A:
su=0
while n!=1:
if n%k==0:
n=n/k
su+=B
else:
n-=1
su+=A
print(su)
else:
print(A*n-A)
|
n=int(input())
k=int(input())
A=int(input())
B=int(input())
if B/k<A:
su=0
while n!=14:
if n%k==0:
n=n/k
su+=B
else:
n-=1
su+=A
print(su)
else:
print(A*n-A)
|
while n!=14:
| 8 |
value
|
n=int(input())
k=int(input())
A=int(input())
B=int(input())
if B/k<A:
su=0
while n!=1:
if n%k==0:
n=n/k
su+=B
else:
n-=1
su+=A
print(su)
else:
print(A*n-A)
|
n=int(input())
k=int(input())
A=int(z())
B=int(input())
if B/k<A:
su=0
while n!=1:
if n%k==0:
n=n/k
su+=B
else:
n-=1
su+=A
print(su)
else:
print(A*n-A)
|
A=int(z())
| 3 |
statement
|
from math import ceil
hh, mm = map(int, input().split(' '))
h, d, c, n = map(int, input().split(' '))
c1 = c * 0.8
s1 = ceil(h / n) * c
if hh >= 20:
print(s1)
else:
mn = (20 - hh) * 60 - mm
h1 = h + d * mn
s2 = ceil(h1 / n) * c1
print(min(s1, s2))
|
from math import ceil
y, mm = map(int, input().split(' '))
h, d, c, n = map(int, input().split(' '))
c1 = c * 0.8
s1 = ceil(h / n) * c
if hh >= 20:
print(s1)
else:
mn = (20 - hh) * 60 - mm
h1 = h + d * mn
s2 = ceil(h1 / n) * c1
print(min(s1, s2))
|
y, mm = map(int, input().split(' '))
| 2 |
statement
|
from math import ceil
hh, mm = map(int, input().split(' '))
h, d, c, n = map(int, input().split(' '))
c1 = c * 0.8
s1 = ceil(h / n) * c
if hh >= 20:
print(s1)
else:
mn = (20 - hh) * 60 - mm
h1 = h + d * mn
s2 = ceil(h1 / n) * c1
print(min(s1, s2))
|
from math import ceil
hh, mm = map(int, input().split(' '))
h, d, c, n = map(int, input().split(' '))
c1 = c * 0.8
s1 = ceil(h / n) * c
if hh<=20:
print(s1)
else:
mn = (20 - hh) * 60 - mm
h1 = h + d * mn
s2 = ceil(h1 / n) * c1
print(min(s1, s2))
|
if hh<=20:
| 6 |
decision
|
from math import ceil
hh, mm = map(int, input().split(' '))
h, d, c, n = map(int, input().split(' '))
c1 = c * 0.8
s1 = ceil(h / n) * c
if hh >= 20:
print(s1)
else:
mn = (20 - hh) * 60 - mm
h1 = h + d * mn
s2 = ceil(h1 / n) * c1
print(min(s1, s2))
|
from math import ceil
hh, mm = map(int, input().split(' '))
h, d, c, n = map(int, input().split(' '))
c1 = c * 0.8
s1 = ceil(h / n) * c
if hh >= 20:
print(s1)
else:
mn = (20 - hh) * 60 - mm
h1 = h + d * mn
s2 = ceil(h1 / n) * c1
print(x(s1, s2))
|
print(x(s1, s2))
| 12 |
statement
|
from math import ceil
hh, mm = map(int, input().split(' '))
h, d, c, n = map(int, input().split(' '))
c1 = c * 0.8
s1 = ceil(h / n) * c
if hh >= 20:
print(s1)
else:
mn = (20 - hh) * 60 - mm
h1 = h + d * mn
s2 = ceil(h1 / n) * c1
print(min(s1, s2))
|
from math import ceil
hh, mm = map(int, input().split(' '))
h, d, c, n = map(int, input().split(' '))
c1 = c * 0.8
s1 = ceil(h / n) * c
if hh<=20:
print(s1)
else:
mn = (20 - hh) * 60 - mm
h1 = h + d * mn
s2 = ceil(h1 / n) * c1
print(min(s1, s2))
|
if hh<=20:
| 6 |
decision
|
from math import ceil
hh, mm = map(int, input().split(' '))
h, d, c, n = map(int, input().split(' '))
c1 = c * 0.8
s1 = ceil(h / n) * c
if hh >= 20:
print(s1)
else:
mn = (20 - hh) * 60 - mm
h1 = h + d * mn
s2 = ceil(h1 / n) * c1
print(min(s1, s2))
|
from math import ceil
hh, mm = map(int, input().split(' '))
h, d, c, n = map(int, input().split(' '))
c1 = c * 0.8
s1 = ceil(h / n) * c
if hh<=20:
print(s1)
else:
mn = (20 - hh) * 60 - mm
h1 = h + d * mn
s2 = ceil(h1 / n) * c1
print(min(s1, s2))
|
if hh<=20:
| 6 |
decision
|
ans = 'abcdefghijklmnopqrstuvwxyz'
s = input()
i = 0
t = ''
for c in s:
if c <= ans[i]:
t += ans[i]
i += 1
else:
t += c
if i == 26:
break
print(("-1", t)[i==26])
|
ans = 'abcdefghijklmnopqrstuvwxyz'
s = input()
i = 0
t = ''
for x in s:
if c <= ans[i]:
t += ans[i]
i += 1
else:
t += c
if i == 26:
break
print(("-1", t)[i==26])
|
for x in s:
| 5 |
statement
|
ans = 'abcdefghijklmnopqrstuvwxyz'
s = input()
i = 0
t = ''
for c in s:
if c <= ans[i]:
t += ans[i]
i += 1
else:
t += c
if i == 26:
break
print(("-1", t)[i==26])
|
ans = 'abcdefghijklmnopqrstuvwxyz'
s = input()
i = 0
t = ''
for c in s:
if c>=ans[i]:
t += ans[i]
i += 1
else:
t += c
if i == 26:
break
print(("-1", t)[i==26])
|
if c>=ans[i]:
| 6 |
decision
|
ans = 'abcdefghijklmnopqrstuvwxyz'
s = input()
i = 0
t = ''
for c in s:
if c <= ans[i]:
t += ans[i]
i += 1
else:
t += c
if i == 26:
break
print(("-1", t)[i==26])
|
ans = 'abcdefghijklmnopqrstuvwxyz'
s = input()
i = 0
t = ''
for c in s:
if c <= ans[i]:
t += ans[i]
i += 1
else:
t += c
if i == 26:
break
print(("-1", t)[i<26])
|
print(("-1", t)[i<26])
| 14 |
decision
|
ans = 'abcdefghijklmnopqrstuvwxyz'
s = input()
i = 0
t = ''
for c in s:
if c <= ans[i]:
t += ans[i]
i += 1
else:
t += c
if i == 26:
break
print(("-1", t)[i==26])
|
ans = 'abcdefghijklmnopqrstuvwxyz'
s = input()
i = 0
t = ''
for c in s:
if c <= ans[i]:
t += ans[i]
i += 1
else:
t += c
if i<26:
break
print(("-1", t)[i==26])
|
if i<26:
| 11 |
decision
|
n = int(input())
s = input()
ans = 0
for i in range(0,len(s)-3):
temp = s[i]+s[i+1]+s[i+2]
if temp == "RUU" or temp == "URR" :
ans+=1
print(ans)
|
n = int(input())
s = input()
ans = 0
for i in range(0,len(s)-3):
temp = s[i]+s[i//1]+s[i+2]
if temp == "RUU" or temp == "URR" :
ans+=1
print(ans)
|
temp = s[i]+s[i//1]+s[i+2]
| 5 |
operation
|
n = int(input())
s = input()
ans = 0
for i in range(0,len(s)-3):
temp = s[i]+s[i+1]+s[i+2]
if temp == "RUU" or temp == "URR" :
ans+=1
print(ans)
|
n = int(input())
s = input()
ans = 0
for i in range(0,len(s)-3):
temp = z[i]+s[i+1]+s[i+2]
if temp == "RUU" or temp == "URR" :
ans+=1
print(ans)
|
temp = z[i]+s[i+1]+s[i+2]
| 5 |
statement
|
n = int(input())
s = input()
ans = 0
for i in range(0,len(s)-3):
temp = s[i]+s[i+1]+s[i+2]
if temp == "RUU" or temp == "URR" :
ans+=1
print(ans)
|
n = int(input())
s = input()
ans = 0
for i in y(0,len(s)-3):
temp = s[i]+s[i+1]+s[i+2]
if temp == "RUU" or temp == "URR" :
ans+=1
print(ans)
|
for i in y(0,len(s)-3):
| 4 |
statement
|
n = int(input())
s = input()
ans = 0
for i in range(0,len(s)-3):
temp = s[i]+s[i+1]+s[i+2]
if temp == "RUU" or temp == "URR" :
ans+=1
print(ans)
|
n = int(input())
s = input()
ans = 0
for i in range(0,len(s)-3):
temp = s[i]+s[i+1]+s[i+2]
if temp<"RUU" or temp == "URR" :
ans+=1
print(ans)
|
if temp<"RUU" or temp == "URR" :
| 7 |
decision
|
n = int(input())
s = input()
ans = 0
for i in range(0,len(s)-3):
temp = s[i]+s[i+1]+s[i+2]
if temp == "RUU" or temp == "URR" :
ans+=1
print(ans)
|
n = int(input())
s = input()
ans = 0
for i in range(0,len(s)-3):
temp = s[i]+s[i+1]+s[i+2]
if temp == "RUU" or temp<"URR" :
ans+=1
print(ans)
|
if temp == "RUU" or temp<"URR" :
| 7 |
decision
|
s = list(input().lower())
for i in range(len(s)):
if s[i] in ['i', 'l']:
s[i] = '1'
if s[i] in ['o']:
s[i] = '0'
n = int(input())
for j in range(n):
t = list(input().lower())
for i in range(len(t)):
if t[i] in ['i', 'l']:
t[i] = '1'
if t[i] in ['o']:
t[i] = '0'
if s == t:
print('No')
exit(0)
print('Yes')
|
s = list(input().lower())
for i in range(len(s)):
if s[i] in ['i', 'l']:
s[i] = '1'
if s[i] in ['o']:
s[i] = '0'
n = int(input())
for j in range(n):
t = list(input().lower())
for i in range(len(t)):
if t[i] in ['i', 'l']:
t[i] = '1'
if t[i] in ['o']:
t[i] = '0'
if s == t:
print('No')
exit(0)
print('Yes')
| 19 |
decision
|
|
s = list(input().lower())
for i in range(len(s)):
if s[i] in ['i', 'l']:
s[i] = '1'
if s[i] in ['o']:
s[i] = '0'
n = int(input())
for j in range(n):
t = list(input().lower())
for i in range(len(t)):
if t[i] in ['i', 'l']:
t[i] = '1'
if t[i] in ['o']:
t[i] = '0'
if s == t:
print('No')
exit(0)
print('Yes')
|
s = list(input().lower())
for i in range(len(s)):
if s[i] in ['i', 'l']:
s[i] = '1'
if s[i] in ['o']:
s[i] = '0'
n = int(input())
for j in range(n):
t = list(input().lower())
for i in range(len(t)):
if t[i] in ['i', 'l']:
t[i] = '1'
if t[i] in ['o']:
t[i] = '0'
if s == t:
print('No')
exit(0)
print('Yes')
| 19 |
operation
|
|
s = list(input().lower())
for i in range(len(s)):
if s[i] in ['i', 'l']:
s[i] = '1'
if s[i] in ['o']:
s[i] = '0'
n = int(input())
for j in range(n):
t = list(input().lower())
for i in range(len(t)):
if t[i] in ['i', 'l']:
t[i] = '1'
if t[i] in ['o']:
t[i] = '0'
if s == t:
print('No')
exit(0)
print('Yes')
|
s = list(input().lower())
for i in range(len(s)):
if s[i] in ['i', 'l']:
s[i] = '1'
if s[i] in ['o']:
s[i] = '0'
n = int(input())
for j in range(n):
t = list(input().lower())
for i in range(len(t)):
if t[i] in ['i', 'l']:
t[i] = '1'
if t[i] in ['o']:
t[i] = '0'
if s == t:
print('No')
exit(0)
print('Yes')
| 19 |
operation
|
|
s = list(input().lower())
for i in range(len(s)):
if s[i] in ['i', 'l']:
s[i] = '1'
if s[i] in ['o']:
s[i] = '0'
n = int(input())
for j in range(n):
t = list(input().lower())
for i in range(len(t)):
if t[i] in ['i', 'l']:
t[i] = '1'
if t[i] in ['o']:
t[i] = '0'
if s == t:
print('No')
exit(0)
print('Yes')
|
s = list(input().lower())
for i in range(len(s)):
if s[i] in ['i', 'l']:
s[i] = '1'
if s[i] in ['o']:
s[i] = '0'
n = int(input())
for j in range(n):
t = list(input().lower())
for i in range(len(t)):
if t[i] in ['i', 'l']:
t[i] = '1'
if t[i] in ['o']:
t[i] = '0'
if s == t:
print('No')
exit(0)
print('Yes')
| 19 |
decision
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.