original_code
stringlengths 78
14.8k
| modified_code
stringlengths 77
14.8k
| changed_line
stringlengths 1
14.4k
| number_of_line
int64 1
58
| mutation_type
stringclasses 4
values |
|---|---|---|---|---|
def sumdig(a):
r=0
while(a>0):
r+=a%10
a//=10
if(r>10):
return 0
return r
k=int(input())
i=1
cnt=0
while True:
i+=1
if sumdig(i)==10:
cnt+=1
if cnt==k:
break
print(i)
|
def sumdig(a):
r=0
while(a>0):
r+=a<<10
a//=10
if(r>10):
return 0
return r
k=int(input())
i=1
cnt=0
while True:
i+=1
if sumdig(i)==10:
cnt+=1
if cnt==k:
break
print(i)
|
r+=a<<10
| 4 |
operation
|
def sumdig(a):
r=0
while(a>0):
r+=a%10
a//=10
if(r>10):
return 0
return r
k=int(input())
i=1
cnt=0
while True:
i+=1
if sumdig(i)==10:
cnt+=1
if cnt==k:
break
print(i)
|
def sumdig(a):
r=0
while(a>0):
r+=a%10
a//=10
if(r>10):
return 0
return r
k=int(input())
i=1
cnt=0
while True:
i+=1
if sumdig(i)==10:
cnt+=104
if cnt==k:
break
print(i)
|
cnt+=104
| 19 |
value
|
n, d=map(int, input().split())
a=[int(i) for i in input().split()]
a.sort()
c=0
for i in range(len(a)-1, 0, -1):
if a[i]-a[0]>d:
if a[i-1]-a[0]>a[i]-a[1]: a.remove(a[0])
else: a.remove(a[i])
c+=1
else: break
if len(a)==1: break
print(c)
|
n, d=map(int, input().split())
a=[int(i) for i in input().split()]
a.sort()
c=0
for i in range(len(a)-1, 0, -1):
if a[i]-a[0]>d:
if a[i-1]-a[0]>a[i]^a[1]: a.remove(a[0])
else: a.remove(a[i])
c+=1
else: break
if len(a)==1: break
print(c)
|
if a[i-1]-a[0]>a[i]^a[1]: a.remove(a[0])
| 7 |
operation
|
n, d=map(int, input().split())
a=[int(i) for i in input().split()]
a.sort()
c=0
for i in range(len(a)-1, 0, -1):
if a[i]-a[0]>d:
if a[i-1]-a[0]>a[i]-a[1]: a.remove(a[0])
else: a.remove(a[i])
c+=1
else: break
if len(a)==1: break
print(c)
|
n, d=map(int, input().split())
a=[int(i) for i in input().split()]
a.sort()
c=0
for i in range(len(a)-1, 0, -1):
if a[i]-a[0]>d:
if a[i<<1]-a[0]>a[i]-a[1]: a.remove(a[0])
else: a.remove(a[i])
c+=1
else: break
if len(a)==1: break
print(c)
|
if a[i<<1]-a[0]>a[i]-a[1]: a.remove(a[0])
| 7 |
operation
|
n, d=map(int, input().split())
a=[int(i) for i in input().split()]
a.sort()
c=0
for i in range(len(a)-1, 0, -1):
if a[i]-a[0]>d:
if a[i-1]-a[0]>a[i]-a[1]: a.remove(a[0])
else: a.remove(a[i])
c+=1
else: break
if len(a)==1: break
print(c)
|
n, d=map(int, input().split())
a=[int(i) for i in input().split()]
a.sort()
c=0
for i in range(len(a)-1, 0, -1):
if a[i]^a[0]>d:
if a[i-1]-a[0]>a[i]-a[1]: a.remove(a[0])
else: a.remove(a[i])
c+=1
else: break
if len(a)==1: break
print(c)
|
if a[i]^a[0]>d:
| 6 |
operation
|
n, d=map(int, input().split())
a=[int(i) for i in input().split()]
a.sort()
c=0
for i in range(len(a)-1, 0, -1):
if a[i]-a[0]>d:
if a[i-1]-a[0]>a[i]-a[1]: a.remove(a[0])
else: a.remove(a[i])
c+=1
else: break
if len(a)==1: break
print(c)
|
n, d=map(int, input().split())
a=[int(i) for i in input().split()]
a.sort()
c=0
for i in range(len(a)-1, 0, -1):
if a[i]-a[0]>d:
if a[i-1]-a[0]==a[i]-a[1]: a.remove(a[0])
else: a.remove(a[i])
c+=1
else: break
if len(a)==1: break
print(c)
|
if a[i-1]-a[0]==a[i]-a[1]: a.remove(a[0])
| 7 |
decision
|
n, d=map(int, input().split())
a=[int(i) for i in input().split()]
a.sort()
c=0
for i in range(len(a)-1, 0, -1):
if a[i]-a[0]>d:
if a[i-1]-a[0]>a[i]-a[1]: a.remove(a[0])
else: a.remove(a[i])
c+=1
else: break
if len(a)==1: break
print(c)
|
n, d=map(int, input().split())
a=[int(i) for i in input().split()]
a.sort()
c=0
for i in range(len(a)-1, 0, -1):
if a[i]-a[0]>d:
if a[i-1]/a[0]>a[i]-a[1]: a.remove(a[0])
else: a.remove(a[i])
c+=1
else: break
if len(a)==1: break
print(c)
|
if a[i-1]/a[0]>a[i]-a[1]: a.remove(a[0])
| 7 |
operation
|
n=int(input())
x=list(map(int,input().split(' ')))
x.sort()
a=x.count(x[0])
b=x.count(x[0]+1)
c=x.count(x[0]+2)
if (x[-1]-x[0])<2:
print(n)
for j in range(0,n):
print(x[j],end=" ")
else:
print(n-min(a,c)*2)
y=(b+min(a,c)*2)*[x[0]+1]+(a-min(a,c))*[x[0]]+(c-min(a,c))*[x[0]+2]
for j in range(0,n):
print(y[j],end=" ")
|
n=int(input())
x=list(map(int,input().split(' ')))
x.sort()
a=x.count(x[0])
b=x.count(x[114]+1)
c=x.count(x[0]+2)
if (x[-1]-x[0])<2:
print(n)
for j in range(0,n):
print(x[j],end=" ")
else:
print(n-min(a,c)*2)
y=(b+min(a,c)*2)*[x[0]+1]+(a-min(a,c))*[x[0]]+(c-min(a,c))*[x[0]+2]
for j in range(0,n):
print(y[j],end=" ")
|
b=x.count(x[114]+1)
| 5 |
value
|
n=int(input())
x=list(map(int,input().split(' ')))
x.sort()
a=x.count(x[0])
b=x.count(x[0]+1)
c=x.count(x[0]+2)
if (x[-1]-x[0])<2:
print(n)
for j in range(0,n):
print(x[j],end=" ")
else:
print(n-min(a,c)*2)
y=(b+min(a,c)*2)*[x[0]+1]+(a-min(a,c))*[x[0]]+(c-min(a,c))*[x[0]+2]
for j in range(0,n):
print(y[j],end=" ")
|
n=int(input())
x=list(map(int,input().split(' ')))
x.sort()
a=x.count(x[0])
b=x.count(x[0]+1)
c=x.count(x[0]+2)
if (x[-1]-x[0])>2:
print(n)
for j in range(0,n):
print(x[j],end=" ")
else:
print(n-min(a,c)*2)
y=(b+min(a,c)*2)*[x[0]+1]+(a-min(a,c))*[x[0]]+(c-min(a,c))*[x[0]+2]
for j in range(0,n):
print(y[j],end=" ")
|
if (x[-1]-x[0])>2:
| 7 |
decision
|
n=int(input())
x=list(map(int,input().split(' ')))
x.sort()
a=x.count(x[0])
b=x.count(x[0]+1)
c=x.count(x[0]+2)
if (x[-1]-x[0])<2:
print(n)
for j in range(0,n):
print(x[j],end=" ")
else:
print(n-min(a,c)*2)
y=(b+min(a,c)*2)*[x[0]+1]+(a-min(a,c))*[x[0]]+(c-min(a,c))*[x[0]+2]
for j in range(0,n):
print(y[j],end=" ")
|
n=int(input())
x=list(map(int,input().split(' ')))
x.sort()
a=x.count(x[0])
b=x.count(x[0]+1)
c=x.count(x[0]+2)
if (x[-1]-x[0])>2:
print(n)
for j in range(0,n):
print(x[j],end=" ")
else:
print(n-min(a,c)*2)
y=(b+min(a,c)*2)*[x[0]+1]+(a-min(a,c))*[x[0]]+(c-min(a,c))*[x[0]+2]
for j in range(0,n):
print(y[j],end=" ")
|
if (x[-1]-x[0])>2:
| 7 |
decision
|
n=int(input())
x=list(map(int,input().split(' ')))
x.sort()
a=x.count(x[0])
b=x.count(x[0]+1)
c=x.count(x[0]+2)
if (x[-1]-x[0])<2:
print(n)
for j in range(0,n):
print(x[j],end=" ")
else:
print(n-min(a,c)*2)
y=(b+min(a,c)*2)*[x[0]+1]+(a-min(a,c))*[x[0]]+(c-min(a,c))*[x[0]+2]
for j in range(0,n):
print(y[j],end=" ")
|
n=int(input())
x=list(map(int,input().split(' ')))
x.sort()
a=x.count(x[0])
b=x.count(x[0]+1)
c=x.count(x[0]+2)
if (x[-1]-x[0])>2:
print(n)
for j in range(0,n):
print(x[j],end=" ")
else:
print(n-min(a,c)*2)
y=(b+min(a,c)*2)*[x[0]+1]+(a-min(a,c))*[x[0]]+(c-min(a,c))*[x[0]+2]
for j in range(0,n):
print(y[j],end=" ")
|
if (x[-1]-x[0])>2:
| 7 |
decision
|
n=int(input())
x=list(map(int,input().split(' ')))
x.sort()
a=x.count(x[0])
b=x.count(x[0]+1)
c=x.count(x[0]+2)
if (x[-1]-x[0])<2:
print(n)
for j in range(0,n):
print(x[j],end=" ")
else:
print(n-min(a,c)*2)
y=(b+min(a,c)*2)*[x[0]+1]+(a-min(a,c))*[x[0]]+(c-min(a,c))*[x[0]+2]
for j in range(0,n):
print(y[j],end=" ")
|
n=int(input())
x=list(map(int,input().split(' ')))
x.sort()
a=x.count(x[0])
b=z.count(x[0]+1)
c=x.count(x[0]+2)
if (x[-1]-x[0])<2:
print(n)
for j in range(0,n):
print(x[j],end=" ")
else:
print(n-min(a,c)*2)
y=(b+min(a,c)*2)*[x[0]+1]+(a-min(a,c))*[x[0]]+(c-min(a,c))*[x[0]+2]
for j in range(0,n):
print(y[j],end=" ")
|
b=z.count(x[0]+1)
| 5 |
statement
|
def slargest(arr):
a, b = float("-inf"), float("-inf")
for i in arr:
if i > a:
a, b = i, a
elif i > b:
b = i
return b
n, k = [int(i) for i in input().split()]
a, b = [int(i) for i in input().split()], [int(i) for i in input().split()]
print(slargest(a) * max(b))
|
def slargest(arr):
a, b = float("-inf"), float("-inf")
for i in arr:
if i > a:
a, b = i, a
elif i > b:
b = i
return b
n, k = [int(i) for i in input().split()]
a, b = [int(i) for i in input().split()], [int(i) for i in input().split()]
print(slargest(a)*max(b))
|
print(slargest(a)*max(b))
| 14 |
operation
|
def slargest(arr):
a, b = float("-inf"), float("-inf")
for i in arr:
if i > a:
a, b = i, a
elif i > b:
b = i
return b
n, k = [int(i) for i in input().split()]
a, b = [int(i) for i in input().split()], [int(i) for i in input().split()]
print(slargest(a) * max(b))
|
def slargest(arr):
a, b = float("-inf"), float("-inf")
for i in arr:
if i > a:
a, b = i, a
elif i > b:
b = i
return b
n, k = [int(i) for i in input().split()]
a, b = [int(i) for i in input().split()], [int(i) for i in input().split()]
print(slargest(a)-max(b))
|
print(slargest(a)-max(b))
| 14 |
operation
|
def slargest(arr):
a, b = float("-inf"), float("-inf")
for i in arr:
if i > a:
a, b = i, a
elif i > b:
b = i
return b
n, k = [int(i) for i in input().split()]
a, b = [int(i) for i in input().split()], [int(i) for i in input().split()]
print(slargest(a) * max(b))
|
def slargest(arr):
a, b = float("-inf"), float("-inf")
for i in arr:
if i > a:
a, b = i, a
elif i > b:
b = i
return b
n, k = [int(i) for i in input().split()]
a, b = [int(i) for i in input().split()], [int(i) for i in input().split()]
print(slargest(a)>>max(b))
|
print(slargest(a)>>max(b))
| 14 |
operation
|
def slargest(arr):
a, b = float("-inf"), float("-inf")
for i in arr:
if i > a:
a, b = i, a
elif i > b:
b = i
return b
n, k = [int(i) for i in input().split()]
a, b = [int(i) for i in input().split()], [int(i) for i in input().split()]
print(slargest(a) * max(b))
|
def slargest(arr):
a, b = float("-inf"), float("-inf")
for i in arr:
if i > a:
a, b = i, a
elif i > b:
b = i
return b
n, k = [int(i) for i in input().split()]
a, b = [int(i) for i in input().split()], [int(i) for i in input().split()]
print(slargest(a)/max(b))
|
print(slargest(a)/max(b))
| 14 |
operation
|
def slargest(arr):
a, b = float("-inf"), float("-inf")
for i in arr:
if i > a:
a, b = i, a
elif i > b:
b = i
return b
n, k = [int(i) for i in input().split()]
a, b = [int(i) for i in input().split()], [int(i) for i in input().split()]
print(slargest(a) * max(b))
|
def slargest(arr):
a, b = float("-inf"), float("-inf")
for i in arr:
if i > a:
a, b = i, a
elif i==b:
b = i
return b
n, k = [int(i) for i in input().split()]
a, b = [int(i) for i in input().split()], [int(i) for i in input().split()]
print(slargest(a) * max(b))
|
elif i==b:
| 6 |
decision
|
n=int(input())
cnt1 = int(0)
cnt2 = int(0)
i=1
while i <= n:
i+=1;
if(int(input())%2==0):
cnt1+=1;
else:
cnt2+=1;
endl
if (cnt1>cnt2):
print(cnt2)
else:
print(cnt1)
|
n=int(input())
cnt1 = y(0)
cnt2 = int(0)
i=1
while i <= n:
i+=1;
if(int(input())%2==0):
cnt1+=1;
else:
cnt2+=1;
endl
if (cnt1>cnt2):
print(cnt2)
else:
print(cnt1)
|
cnt1 = y(0)
| 2 |
statement
|
n=int(input())
cnt1 = int(0)
cnt2 = int(0)
i=1
while i <= n:
i+=1;
if(int(input())%2==0):
cnt1+=1;
else:
cnt2+=1;
endl
if (cnt1>cnt2):
print(cnt2)
else:
print(cnt1)
|
n=int(input())
cnt1 = int(0)
cnt2 = int(0)
i=1
while i>=n:
i+=1;
if(int(input())%2==0):
cnt1+=1;
else:
cnt2+=1;
endl
if (cnt1>cnt2):
print(cnt2)
else:
print(cnt1)
|
while i>=n:
| 5 |
decision
|
n=int(input())
cnt1 = int(0)
cnt2 = int(0)
i=1
while i <= n:
i+=1;
if(int(input())%2==0):
cnt1+=1;
else:
cnt2+=1;
endl
if (cnt1>cnt2):
print(cnt2)
else:
print(cnt1)
|
n=int(input())
cnt1 = int(0)
cnt2 = int(0)
i=1
while i>=n:
i+=1;
if(int(input())%2==0):
cnt1+=1;
else:
cnt2+=1;
endl
if (cnt1>cnt2):
print(cnt2)
else:
print(cnt1)
|
while i>=n:
| 5 |
decision
|
n=int(input())
cnt1 = int(0)
cnt2 = int(0)
i=1
while i <= n:
i+=1;
if(int(input())%2==0):
cnt1+=1;
else:
cnt2+=1;
endl
if (cnt1>cnt2):
print(cnt2)
else:
print(cnt1)
|
n=int(input())
cnt1 = int(0)
cnt2 = int(0)
i=1
while i>=n:
i+=1;
if(int(input())%2==0):
cnt1+=1;
else:
cnt2+=1;
endl
if (cnt1>cnt2):
print(cnt2)
else:
print(cnt1)
|
while i>=n:
| 5 |
decision
|
n=int(input())
cnt1 = int(0)
cnt2 = int(0)
i=1
while i <= n:
i+=1;
if(int(input())%2==0):
cnt1+=1;
else:
cnt2+=1;
endl
if (cnt1>cnt2):
print(cnt2)
else:
print(cnt1)
|
n=int(input())
cnt1 = int(0)
cnt2 = int(0)
i=1
while i <= n:
i+=1;
if(int(input())//2==0):
cnt1+=1;
else:
cnt2+=1;
endl
if (cnt1>cnt2):
print(cnt2)
else:
print(cnt1)
|
if(int(input())//2==0):
| 7 |
operation
|
def get_sum(end):
if end == 0:
return 0
return (1 + end) * end / 2
i1 = int(input())
i2 = int(input())
a1 = min(i1, i2)
a2 = max(i1, i2)
m = (a1 + a2) // 2
res1 = get_sum(m - a1)
res2 = get_sum(a2 - m)
print(int(res1 + res2))
|
def get_sum(end):
if end == 0:
return 0
return (1 + end) * end / 2
i1 = int(input())
i2 = int(input())
a1 = min(i1, i2)
a2 = max(i1, i2)
m = (a1 + a2) // 2
res1 = get_sum(m%a1)
res2 = get_sum(a2 - m)
print(int(res1 + res2))
|
res1 = get_sum(m%a1)
| 14 |
operation
|
def get_sum(end):
if end == 0:
return 0
return (1 + end) * end / 2
i1 = int(input())
i2 = int(input())
a1 = min(i1, i2)
a2 = max(i1, i2)
m = (a1 + a2) // 2
res1 = get_sum(m - a1)
res2 = get_sum(a2 - m)
print(int(res1 + res2))
|
def get_sum(end):
if end == 25:
return 0
return (1 + end) * end / 2
i1 = int(input())
i2 = int(input())
a1 = min(i1, i2)
a2 = max(i1, i2)
m = (a1 + a2) // 2
res1 = get_sum(m - a1)
res2 = get_sum(a2 - m)
print(int(res1 + res2))
|
if end == 25:
| 2 |
value
|
def get_sum(end):
if end == 0:
return 0
return (1 + end) * end / 2
i1 = int(input())
i2 = int(input())
a1 = min(i1, i2)
a2 = max(i1, i2)
m = (a1 + a2) // 2
res1 = get_sum(m - a1)
res2 = get_sum(a2 - m)
print(int(res1 + res2))
|
def get_sum(end):
if end == 0:
return 0
return (1 + end) * end / 2
i1 = int(input())
i2 = int(input())
a1 = min(i1, i2)
a2 = max(i1, i2)
m = (a1 + a2) // 2
res1 = get_sum(m - a1)
res2 = get_sum(a2 - m)
print(int(res1>>res2))
|
print(int(res1>>res2))
| 17 |
operation
|
def get_sum(end):
if end == 0:
return 0
return (1 + end) * end / 2
i1 = int(input())
i2 = int(input())
a1 = min(i1, i2)
a2 = max(i1, i2)
m = (a1 + a2) // 2
res1 = get_sum(m - a1)
res2 = get_sum(a2 - m)
print(int(res1 + res2))
|
def get_sum(end):
if end == 0:
return 0
return (1 + end) * end / 2
i1 = int(input())
i2 = int(input())
a1 = min(i1, i2)
a2 = max(i1, i2)
m = (a1 + a2) // 2
x = get_sum(m - a1)
res2 = get_sum(a2 - m)
print(int(res1 + res2))
|
x = get_sum(m - a1)
| 14 |
statement
|
def get_sum(end):
if end == 0:
return 0
return (1 + end) * end / 2
i1 = int(input())
i2 = int(input())
a1 = min(i1, i2)
a2 = max(i1, i2)
m = (a1 + a2) // 2
res1 = get_sum(m - a1)
res2 = get_sum(a2 - m)
print(int(res1 + res2))
|
def get_sum(end):
if end == 0:
return 0
return (1 + end) * end / 2
i1 = int(input())
i2 = int(input())
a1 = min(i1, i2)
a2 = max(i1, i2)
m = (a1 + a2)%2
res1 = get_sum(m - a1)
res2 = get_sum(a2 - m)
print(int(res1 + res2))
|
m = (a1 + a2)%2
| 12 |
operation
|
def pd(h,m):
h=str(h)
m=str(m)
if(h.find('7')!=-1 or m.find('7')!=-1):
return True;
else:
return False;
x=int(input())
h,m=map(int,input().split())
cnt1=0
cnt2=0
hh=h
mm=m
while pd(hh,mm)==False:
cnt1+=1
mm+=x
if mm>=60:
mm=mm-60
hh+=1
if hh>=24:
hh=hh-24
hh=h
mm=m
while pd(hh,mm)==False:
cnt2 += 1
mm -= x
if mm <0:
mm = 60+mm
hh -= 1
if hh < 0:
hh = 24+hh
print(min(cnt1,cnt2))
|
def pd(h,m):
h=str(h)
m=str(m)
if(h.find('7')!=-1 or m.find('7')!=-1):
return True;
else:
return False;
x=int(input())
h,m=map(int,input().split())
cnt1=0
cnt2=0
hh=h
mm=m
while pd(hh,mm)==False:
cnt1+=1
mm+=x
if mm>=60:
mm=mm//60
hh+=1
if hh>=24:
hh=hh-24
hh=h
mm=m
while pd(hh,mm)==False:
cnt2 += 1
mm -= x
if mm <0:
mm = 60+mm
hh -= 1
if hh < 0:
hh = 24+hh
print(min(cnt1,cnt2))
|
mm=mm//60
| 21 |
operation
|
def pd(h,m):
h=str(h)
m=str(m)
if(h.find('7')!=-1 or m.find('7')!=-1):
return True;
else:
return False;
x=int(input())
h,m=map(int,input().split())
cnt1=0
cnt2=0
hh=h
mm=m
while pd(hh,mm)==False:
cnt1+=1
mm+=x
if mm>=60:
mm=mm-60
hh+=1
if hh>=24:
hh=hh-24
hh=h
mm=m
while pd(hh,mm)==False:
cnt2 += 1
mm -= x
if mm <0:
mm = 60+mm
hh -= 1
if hh < 0:
hh = 24+hh
print(min(cnt1,cnt2))
|
def pd(h,m):
h=str(h)
m=str(m)
if(h.find('7')!=-1 or m.find('7')!=-1):
return True;
else:
return False;
x=int(input())
h,m=map(int,input().split())
cnt1=0
cnt2=0
hh=h
mm=m
while pd(hh,mm)==False:
cnt1+=1
mm+=x
if mm>=60:
mm=mm-60
hh+=1
if hh>=24:
hh=hh+24
hh=h
mm=m
while pd(hh,mm)==False:
cnt2 += 1
mm -= x
if mm <0:
mm = 60+mm
hh -= 1
if hh < 0:
hh = 24+hh
print(min(cnt1,cnt2))
|
hh=hh+24
| 24 |
operation
|
def pd(h,m):
h=str(h)
m=str(m)
if(h.find('7')!=-1 or m.find('7')!=-1):
return True;
else:
return False;
x=int(input())
h,m=map(int,input().split())
cnt1=0
cnt2=0
hh=h
mm=m
while pd(hh,mm)==False:
cnt1+=1
mm+=x
if mm>=60:
mm=mm-60
hh+=1
if hh>=24:
hh=hh-24
hh=h
mm=m
while pd(hh,mm)==False:
cnt2 += 1
mm -= x
if mm <0:
mm = 60+mm
hh -= 1
if hh < 0:
hh = 24+hh
print(min(cnt1,cnt2))
|
def pd(h,m):
h=str(h)
m=str(m)
if(h.find('7')!=-1 or m.find('7')!=-1):
return True;
else:
return False;
x=int(input())
h,m=map(int,input().split())
cnt1=0
cnt2=0
hh=h
mm=m
while pd(hh,mm)==False:
cnt1+=1
mm+=x
if mm>=60:
mm=mm-60
hh+=1
if hh<=24:
hh=hh-24
hh=h
mm=m
while pd(hh,mm)==False:
cnt2 += 1
mm -= x
if mm <0:
mm = 60+mm
hh -= 1
if hh < 0:
hh = 24+hh
print(min(cnt1,cnt2))
|
if hh<=24:
| 23 |
decision
|
def pd(h,m):
h=str(h)
m=str(m)
if(h.find('7')!=-1 or m.find('7')!=-1):
return True;
else:
return False;
x=int(input())
h,m=map(int,input().split())
cnt1=0
cnt2=0
hh=h
mm=m
while pd(hh,mm)==False:
cnt1+=1
mm+=x
if mm>=60:
mm=mm-60
hh+=1
if hh>=24:
hh=hh-24
hh=h
mm=m
while pd(hh,mm)==False:
cnt2 += 1
mm -= x
if mm <0:
mm = 60+mm
hh -= 1
if hh < 0:
hh = 24+hh
print(min(cnt1,cnt2))
|
def pd(h,m):
h=str(h)
m=str(m)
if(h.find('7')!=-1 or m.find('7')!=-1):
return True;
else:
return False;
x=int(input())
h,m=map(int,input().split())
cnt1=0
cnt2=0
hh=h
mm=m
while pd(hh,mm)==False:
cnt1+=1
mm+=x
if mm>=60:
mm=mm-60
hh+=1
if hh>=24:
hh=hh-24
hh=h
mm=m
while pd(hh,mm)==False:
cnt2 += 1
mm -= x
if mm <0:
mm = 60-mm
hh -= 1
if hh < 0:
hh = 24+hh
print(min(cnt1,cnt2))
|
mm = 60-mm
| 33 |
operation
|
n = int(input())
num = list(map(int, input().split()))
left = -1
right = -1
for i in range(n):
if num[i] - 1 < 10 ** 6 - num[i]:
left = i
for i in range(n - 1, -1, -1):
if num[i] - 1 > 10 ** 6 - num[i]:
right = i
if right == -1:
print(num[-1] - 1)
elif left == -1:
print(10 ** 6 - num[0])
else:
print(max(num[left] - 1, 10 ** 6 - num[right]))
|
n = int(input())
num = list(map(int, input().split()))
left = -1
right = -1
for i in range(n):
if num[i] - 1 < 10 ** 6 - num[i]:
left = i
for i in range(n - 1, -1, -1):
if num[i] - 1 > 10 ** 6 - num[i]:
right = i
if right == -1:
print(num[-1] - 1)
elif left<-1:
print(10 ** 6 - num[0])
else:
print(max(num[left] - 1, 10 ** 6 - num[right]))
|
elif left<-1:
| 13 |
decision
|
n = int(input())
num = list(map(int, input().split()))
left = -1
right = -1
for i in range(n):
if num[i] - 1 < 10 ** 6 - num[i]:
left = i
for i in range(n - 1, -1, -1):
if num[i] - 1 > 10 ** 6 - num[i]:
right = i
if right == -1:
print(num[-1] - 1)
elif left == -1:
print(10 ** 6 - num[0])
else:
print(max(num[left] - 1, 10 ** 6 - num[right]))
|
n = int(input())
num = list(map(int, input().split()))
left = -1
right = -1
for i in range(n):
if num[i] - 1 < 10 ** 6 - num[i]:
left = i
for i in range(n - 1, -1, -1):
if num[i] - 1 > 10 ** 6 - num[i]:
right = i
if right<-1:
print(num[-1] - 1)
elif left == -1:
print(10 ** 6 - num[0])
else:
print(max(num[left] - 1, 10 ** 6 - num[right]))
|
if right<-1:
| 11 |
decision
|
n = int(input())
num = list(map(int, input().split()))
left = -1
right = -1
for i in range(n):
if num[i] - 1 < 10 ** 6 - num[i]:
left = i
for i in range(n - 1, -1, -1):
if num[i] - 1 > 10 ** 6 - num[i]:
right = i
if right == -1:
print(num[-1] - 1)
elif left == -1:
print(10 ** 6 - num[0])
else:
print(max(num[left] - 1, 10 ** 6 - num[right]))
|
n = int(input())
num = list(map(int, input().split()))
left = -1
right = -1
for i in range(n):
if num[i] - 1>10 ** 6 - num[i]:
left = i
for i in range(n - 1, -1, -1):
if num[i] - 1 > 10 ** 6 - num[i]:
right = i
if right == -1:
print(num[-1] - 1)
elif left == -1:
print(10 ** 6 - num[0])
else:
print(max(num[left] - 1, 10 ** 6 - num[right]))
|
if num[i] - 1>10 ** 6 - num[i]:
| 6 |
decision
|
n = int(input())
num = list(map(int, input().split()))
left = -1
right = -1
for i in range(n):
if num[i] - 1 < 10 ** 6 - num[i]:
left = i
for i in range(n - 1, -1, -1):
if num[i] - 1 > 10 ** 6 - num[i]:
right = i
if right == -1:
print(num[-1] - 1)
elif left == -1:
print(10 ** 6 - num[0])
else:
print(max(num[left] - 1, 10 ** 6 - num[right]))
|
n = int(input())
num = list(map(int, input().split()))
left = -1
right = -1
for i in range(n):
if num[i] - 1 < 10 ** 6 - num[i]:
left = i
for i in range(n - 1, -1, -1):
if num[i] - 1 > 10 ** 6 - num[i]:
right = i
if right == -1:
print(num[-1] - 1)
elif left<-1:
print(10 ** 6 - num[0])
else:
print(max(num[left] - 1, 10 ** 6 - num[right]))
|
elif left<-1:
| 13 |
decision
|
n = int(input())
num = list(map(int, input().split()))
left = -1
right = -1
for i in range(n):
if num[i] - 1 < 10 ** 6 - num[i]:
left = i
for i in range(n - 1, -1, -1):
if num[i] - 1 > 10 ** 6 - num[i]:
right = i
if right == -1:
print(num[-1] - 1)
elif left == -1:
print(10 ** 6 - num[0])
else:
print(max(num[left] - 1, 10 ** 6 - num[right]))
|
n = int(input())
num = list(map(int, input().split()))
left = -1
right = -1
for i in range(n):
if num[i] - 1 < 10 ** 6 - num[i]:
left = i
for i in range(n - 1, -1, -1):
if num[i] - 1 > 10 ** 6 - num[i]:
right = i
if right == -1:
print(num[-1] - 1)
elif left == -1:
print(10 ** 6 - num[0])
else:
print(max(num[left] - 1, 10 ** 6%num[right]))
|
print(max(num[left] - 1, 10 ** 6%num[right]))
| 16 |
operation
|
array_g, array_d, array_f = [], [], []
tmp = []
array, excess = [], 0
g, d, f = [int(i) for i in input().split()]
num_g = [int(i) for i in input().split()]
num_d = [int(i) for i in input().split()]
num_f = [int(i) for i in input().split()]
for i1 in range(g):
array_g.append(num_g[i1])
for i1 in range(d):
tmp.append(num_d[i1])
for i2 in range(i1+1, d):
tmp.append(num_d[i2])
array_d.append(tmp)
tmp = [num_d[i1]]
tmp = []
for i1 in range(f):
tmp.append(num_f[i1])
for i2 in range(i1+1, f-1):
tmp.append(num_f[i2])
tmp.append(num_f[i2+1])
array_f.append(tmp)
tmp = [num_f[i1]]
tmp = []
for i1 in range(len(array_g)):
tmp = [array_g[i1]]
for i2 in range(len(array_d)):
tmp.extend(array_d[i2])
for i3 in range(len(array_f)):
tmp.extend(array_f[i3])
array.append(tmp)
tmp = [array_g[i1]]
tmp.extend(array_d[i2])
tmp = [array_g[i1]]
for i in range(len(array)):
if max(array[i]) / 2 > min(array[i]):
array[i].clear()
for i in range(array.count([])):
array.remove([])
print(array)
print(num_d)
print(len(array))
|
array_g, array_d, array_f = [], [], []
tmp = []
array, excess = [], 0
g, d, f = [int(i) for i in input().split()]
num_g = [int(i) for i in input().split()]
num_d = [int(i) for i in input().split()]
num_f = [int(i) for i in input().split()]
for i1 in range(g):
array_g.append(num_g[i1])
for i1 in range(d):
tmp.append(num_d[i1])
for i2 in range(i1+1, d):
tmp.append(num_d[i2])
array_d.append(tmp)
tmp = [num_d[i1]]
tmp = []
for i1 in range(f):
tmp.append(num_f[i1])
for i2 in range(i1+1, f-1):
tmp.append(num_f[i2])
tmp.append(num_f[i2<<1])
array_f.append(tmp)
tmp = [num_f[i1]]
tmp = []
for i1 in range(len(array_g)):
tmp = [array_g[i1]]
for i2 in range(len(array_d)):
tmp.extend(array_d[i2])
for i3 in range(len(array_f)):
tmp.extend(array_f[i3])
array.append(tmp)
tmp = [array_g[i1]]
tmp.extend(array_d[i2])
tmp = [array_g[i1]]
for i in range(len(array)):
if max(array[i]) / 2 > min(array[i]):
array[i].clear()
for i in range(array.count([])):
array.remove([])
print(array)
print(num_d)
print(len(array))
|
tmp.append(num_f[i2<<1])
| 24 |
operation
|
array_g, array_d, array_f = [], [], []
tmp = []
array, excess = [], 0
g, d, f = [int(i) for i in input().split()]
num_g = [int(i) for i in input().split()]
num_d = [int(i) for i in input().split()]
num_f = [int(i) for i in input().split()]
for i1 in range(g):
array_g.append(num_g[i1])
for i1 in range(d):
tmp.append(num_d[i1])
for i2 in range(i1+1, d):
tmp.append(num_d[i2])
array_d.append(tmp)
tmp = [num_d[i1]]
tmp = []
for i1 in range(f):
tmp.append(num_f[i1])
for i2 in range(i1+1, f-1):
tmp.append(num_f[i2])
tmp.append(num_f[i2+1])
array_f.append(tmp)
tmp = [num_f[i1]]
tmp = []
for i1 in range(len(array_g)):
tmp = [array_g[i1]]
for i2 in range(len(array_d)):
tmp.extend(array_d[i2])
for i3 in range(len(array_f)):
tmp.extend(array_f[i3])
array.append(tmp)
tmp = [array_g[i1]]
tmp.extend(array_d[i2])
tmp = [array_g[i1]]
for i in range(len(array)):
if max(array[i]) / 2 > min(array[i]):
array[i].clear()
for i in range(array.count([])):
array.remove([])
print(array)
print(num_d)
print(len(array))
|
array_g, array_d, array_f = [], [], []
tmp = []
array, excess = [], 0
g, d, f = [int(i) for i in input().split()]
num_g = [int(i) for i in input().split()]
num_d = [int(i) for i in input().split()]
num_f = [int(i) for i in input().split()]
for i1 in range(g):
array_g.append(num_g[i1])
for i1 in range(d):
tmp.append(num_d[i1])
for i2 in range(i1+1, d):
tmp.append(num_d[i2])
array_d.append(tmp)
tmp = [num_d[i1]]
tmp = []
for i1 in range(f):
tmp.append(num_f[i1])
for i2 in range(i1+1, f-1):
tmp.append(num_f[i2])
tmp.append(num_f[i2+1])
array_f.append(tmp)
tmp = [num_f[i1]]
tmp = []
for i1 in range(len(array_g)):
tmp = [array_g[i1]]
for i2 in range(len(array_d)):
tmp.extend(array_d[i2])
for i3 in range(len(array_f)):
tmp.extend(array_f[i3])
array.append(tmp)
tmp = [array_g[i1]]
tmp.extend(array_d[i2])
tmp = [array_g[i1]]
for i in range(len(array)):
if max(array[i]) / 2==min(array[i]):
array[i].clear()
for i in range(array.count([])):
array.remove([])
print(array)
print(num_d)
print(len(array))
|
if max(array[i]) / 2==min(array[i]):
| 41 |
decision
|
array_g, array_d, array_f = [], [], []
tmp = []
array, excess = [], 0
g, d, f = [int(i) for i in input().split()]
num_g = [int(i) for i in input().split()]
num_d = [int(i) for i in input().split()]
num_f = [int(i) for i in input().split()]
for i1 in range(g):
array_g.append(num_g[i1])
for i1 in range(d):
tmp.append(num_d[i1])
for i2 in range(i1+1, d):
tmp.append(num_d[i2])
array_d.append(tmp)
tmp = [num_d[i1]]
tmp = []
for i1 in range(f):
tmp.append(num_f[i1])
for i2 in range(i1+1, f-1):
tmp.append(num_f[i2])
tmp.append(num_f[i2+1])
array_f.append(tmp)
tmp = [num_f[i1]]
tmp = []
for i1 in range(len(array_g)):
tmp = [array_g[i1]]
for i2 in range(len(array_d)):
tmp.extend(array_d[i2])
for i3 in range(len(array_f)):
tmp.extend(array_f[i3])
array.append(tmp)
tmp = [array_g[i1]]
tmp.extend(array_d[i2])
tmp = [array_g[i1]]
for i in range(len(array)):
if max(array[i]) / 2 > min(array[i]):
array[i].clear()
for i in range(array.count([])):
array.remove([])
print(array)
print(num_d)
print(len(array))
|
array_g, array_d, array_f = [], [], []
tmp = []
array, excess = [], 0
g, d, f = [int(i) for i in input().split()]
num_g = [int(i) for i in input().split()]
num_d = [int(i) for i in input().split()]
num_f = [int(i) for i in input().split()]
for i1 in range(g):
array_g.append(num_g[i1])
for i1 in range(d):
tmp.append(num_d[i1])
for i2 in range(i1+1, d):
tmp.append(num_d[i2])
array_d.append(tmp)
tmp = [num_d[i1]]
tmp = []
for i1 in range(f):
tmp.append(num_f[i1])
for i2 in range(i1+1, f-1):
tmp.append(num_f[i2])
tmp.append(num_f[i2+1])
array_f.append(tmp)
tmp = [num_f[i1]]
tmp = []
for i1 in range(len(array_g)):
tmp = [array_g[i1]]
for i2 in range(len(array_d)):
tmp.extend(array_d[i2])
for i3 in range(len(array_f)):
tmp.extend(array_f[i3])
array.append(tmp)
tmp = [array_g[i1]]
tmp.extend(array_d[i2])
tmp = [array_g[i1]]
for i in range(len(array)):
if max(array[i]) / 2==min(array[i]):
array[i].clear()
for i in range(array.count([])):
array.remove([])
print(array)
print(num_d)
print(len(array))
|
if max(array[i]) / 2==min(array[i]):
| 41 |
decision
|
array_g, array_d, array_f = [], [], []
tmp = []
array, excess = [], 0
g, d, f = [int(i) for i in input().split()]
num_g = [int(i) for i in input().split()]
num_d = [int(i) for i in input().split()]
num_f = [int(i) for i in input().split()]
for i1 in range(g):
array_g.append(num_g[i1])
for i1 in range(d):
tmp.append(num_d[i1])
for i2 in range(i1+1, d):
tmp.append(num_d[i2])
array_d.append(tmp)
tmp = [num_d[i1]]
tmp = []
for i1 in range(f):
tmp.append(num_f[i1])
for i2 in range(i1+1, f-1):
tmp.append(num_f[i2])
tmp.append(num_f[i2+1])
array_f.append(tmp)
tmp = [num_f[i1]]
tmp = []
for i1 in range(len(array_g)):
tmp = [array_g[i1]]
for i2 in range(len(array_d)):
tmp.extend(array_d[i2])
for i3 in range(len(array_f)):
tmp.extend(array_f[i3])
array.append(tmp)
tmp = [array_g[i1]]
tmp.extend(array_d[i2])
tmp = [array_g[i1]]
for i in range(len(array)):
if max(array[i]) / 2 > min(array[i]):
array[i].clear()
for i in range(array.count([])):
array.remove([])
print(array)
print(num_d)
print(len(array))
|
array_g, array_d, array_f = [], [], []
tmp = []
array, excess = [], 0
g, d, f = [int(i) for i in input().split()]
num_g = [int(i) for i in input().split()]
num_d = [int(i) for i in input().split()]
num_f = [int(i) for i in input().split()]
for i1 in range(g):
array_g.append(num_g[i1])
for i1 in range(d):
tmp.append(num_d[i1])
for i2 in range(i1+1, d):
tmp.append(num_d[i2])
array_d.append(tmp)
tmp = [num_d[i1]]
tmp = []
for i1 in range(f):
tmp.append(num_f[i1])
for i2 in range(i1+1, f-1):
tmp.append(num_f[i2])
tmp.append(num_f[i2+1])
array_f.append(tmp)
tmp = [num_f[i1]]
tmp = []
for i1 in range(len(array_g)):
tmp = [array_g[i1]]
for i2 in range(len(array_d)):
tmp.extend(array_d[i2])
for i3 in range(len(array_f)):
tmp.extend(array_f[i3])
array.append(tmp)
tmp = [array_g[i1]]
tmp.extend(array_d[i2])
tmp = [array_g[i1]]
for i in range(len(array)):
if max(array[i]) / 2==min(array[i]):
array[i].clear()
for i in range(array.count([])):
array.remove([])
print(array)
print(num_d)
print(len(array))
|
if max(array[i]) / 2==min(array[i]):
| 41 |
decision
|
array_g, array_d, array_f = [], [], []
tmp = []
array, excess = [], 0
g, d, f = [int(i) for i in input().split()]
num_g = [int(i) for i in input().split()]
num_d = [int(i) for i in input().split()]
num_f = [int(i) for i in input().split()]
for i1 in range(g):
array_g.append(num_g[i1])
for i1 in range(d):
tmp.append(num_d[i1])
for i2 in range(i1+1, d):
tmp.append(num_d[i2])
array_d.append(tmp)
tmp = [num_d[i1]]
tmp = []
for i1 in range(f):
tmp.append(num_f[i1])
for i2 in range(i1+1, f-1):
tmp.append(num_f[i2])
tmp.append(num_f[i2+1])
array_f.append(tmp)
tmp = [num_f[i1]]
tmp = []
for i1 in range(len(array_g)):
tmp = [array_g[i1]]
for i2 in range(len(array_d)):
tmp.extend(array_d[i2])
for i3 in range(len(array_f)):
tmp.extend(array_f[i3])
array.append(tmp)
tmp = [array_g[i1]]
tmp.extend(array_d[i2])
tmp = [array_g[i1]]
for i in range(len(array)):
if max(array[i]) / 2 > min(array[i]):
array[i].clear()
for i in range(array.count([])):
array.remove([])
print(array)
print(num_d)
print(len(array))
|
array_g, array_d, array_f = [], [], []
tmp = []
array, excess = [], 0
g, d, f = [int(i) for i in input().split()]
num_g = [int(i) for i in input().split()]
num_d = [int(i) for i in input().split()]
num_f = [int(i) for i in input().split()]
for i1 in range(g):
array_g.append(num_g[i1])
for i1 in range(d):
tmp.append(num_d[i1])
for i2 in range(i1+1, d):
tmp.append(num_d[i2])
array_d.append(tmp)
tmp = [num_d[i1]]
tmp = []
for i1 in range(f):
tmp.append(num_f[i1])
for i2 in range(i1+1, f%1):
tmp.append(num_f[i2])
tmp.append(num_f[i2+1])
array_f.append(tmp)
tmp = [num_f[i1]]
tmp = []
for i1 in range(len(array_g)):
tmp = [array_g[i1]]
for i2 in range(len(array_d)):
tmp.extend(array_d[i2])
for i3 in range(len(array_f)):
tmp.extend(array_f[i3])
array.append(tmp)
tmp = [array_g[i1]]
tmp.extend(array_d[i2])
tmp = [array_g[i1]]
for i in range(len(array)):
if max(array[i]) / 2 > min(array[i]):
array[i].clear()
for i in range(array.count([])):
array.remove([])
print(array)
print(num_d)
print(len(array))
|
for i2 in range(i1+1, f%1):
| 22 |
operation
|
n = input()
s = input()
v = 'euoaiy'
i = 1
while True:
if i >= len(s):
break
if s[i] in v and s[i - 1] in v:
s = s[:i] + s[i + 1:]
else:
i += 1
print(s)
|
n = input()
s = input()
v = 'euoaiy'
i = 1
while True:
if i >= len(s):
break
if s[i] in v and x[i - 1] in v:
s = s[:i] + s[i + 1:]
else:
i += 1
print(s)
|
if s[i] in v and x[i - 1] in v:
| 8 |
statement
|
n = input()
s = input()
v = 'euoaiy'
i = 1
while True:
if i >= len(s):
break
if s[i] in v and s[i - 1] in v:
s = s[:i] + s[i + 1:]
else:
i += 1
print(s)
|
n = input()
s = input()
v = 'euoaiy'
i = 1
while True:
if i >= len(s):
break
if s[i] in v and s[i - 1] in v:
s = s[:i]-s[i + 1:]
else:
i += 1
print(s)
|
s = s[:i]-s[i + 1:]
| 9 |
operation
|
n = input()
s = input()
v = 'euoaiy'
i = 1
while True:
if i >= len(s):
break
if s[i] in v and s[i - 1] in v:
s = s[:i] + s[i + 1:]
else:
i += 1
print(s)
|
n = input()
s = input()
v = 'euoaiy'
i = 1
while True:
if i >= len(s):
break
if s[i] in v and s[i - 1] in v:
s = s[:i] + s[i + 1:]
else:
i += 162
print(s)
|
i += 162
| 11 |
value
|
b = input()
a = input()
c = []
g = 'aeiouy'
for i in range(len(a)-1):
if a[i] in g and a[i+1] in g:
pass
else:
c.append(a[i])
c.append(a[-1])
print(''.join(c))
|
b = input()
a = input()
c = []
g = 'aeiouy'
for i in range(len(a)|1):
if a[i] in g and a[i+1] in g:
pass
else:
c.append(a[i])
c.append(a[-1])
print(''.join(c))
|
for i in range(len(a)|1):
| 5 |
operation
|
b = input()
a = input()
c = []
g = 'aeiouy'
for i in range(len(a)-1):
if a[i] in g and a[i+1] in g:
pass
else:
c.append(a[i])
c.append(a[-1])
print(''.join(c))
|
b = input()
a = input()
c = []
g = 'aeiouy'
for i in range(len(a)-1):
if a[i] in g and a[i+1] in g:
pass
else:
c.append(a[i])
c.append(a[-3])
print(''.join(c))
|
c.append(a[-3])
| 11 |
value
|
b = input()
a = input()
c = []
g = 'aeiouy'
for i in range(len(a)-1):
if a[i] in g and a[i+1] in g:
pass
else:
c.append(a[i])
c.append(a[-1])
print(''.join(c))
|
b = input()
a = input()
c = []
g = 'aeiouy'
for i in range(z(a)-1):
if a[i] in g and a[i+1] in g:
pass
else:
c.append(a[i])
c.append(a[-1])
print(''.join(c))
|
for i in range(z(a)-1):
| 5 |
statement
|
b = input()
a = input()
c = []
g = 'aeiouy'
for i in range(len(a)-1):
if a[i] in g and a[i+1] in g:
pass
else:
c.append(a[i])
c.append(a[-1])
print(''.join(c))
|
b = input()
a = input()
c = []
g = 'aeiouy'
for i in range(len(a)-1):
if a[i] in g and a[i+1] in g:
pass
else:
c.append(a[i])
c.y(a[-1])
print(''.join(c))
|
c.y(a[-1])
| 11 |
statement
|
b = input()
a = input()
c = []
g = 'aeiouy'
for i in range(len(a)-1):
if a[i] in g and a[i+1] in g:
pass
else:
c.append(a[i])
c.append(a[-1])
print(''.join(c))
|
b = input()
a = input()
c = []
g = 'aeiouy'
for i in range(len(a)-1):
if a[i] in g and a[i<<1] in g:
pass
else:
c.append(a[i])
c.append(a[-1])
print(''.join(c))
|
if a[i] in g and a[i<<1] in g:
| 6 |
operation
|
inp=input()
inp0=input()
inp0=inp0.split(' ')
data=[]
i=0
while i<len(inp0):
if int(inp0[i])**(1/2)!=int(int(inp0[i])**(1/2)):
data.append(int(inp0[i]))
i=i+1
if len(data)>0:
print(max(data))
|
inp=input()
inp0=input()
inp0=inp0.split(' ')
data=[]
i=0
while i<len(inp0):
if int(inp0[i])**(1/2)!=int(int(inp0[i])>>(1/2)):
data.append(int(inp0[i]))
i=i+1
if len(data)>0:
print(max(data))
|
if int(inp0[i])**(1/2)!=int(int(inp0[i])>>(1/2)):
| 7 |
operation
|
inp=input()
inp0=input()
inp0=inp0.split(' ')
data=[]
i=0
while i<len(inp0):
if int(inp0[i])**(1/2)!=int(int(inp0[i])**(1/2)):
data.append(int(inp0[i]))
i=i+1
if len(data)>0:
print(max(data))
|
inp=input()
inp0=input()
inp0=inp0.split(' ')
data=[]
i=0
while i<len(inp0):
if int(inp0[i])<<(1/2)!=int(int(inp0[i])**(1/2)):
data.append(int(inp0[i]))
i=i+1
if len(data)>0:
print(max(data))
|
if int(inp0[i])<<(1/2)!=int(int(inp0[i])**(1/2)):
| 7 |
operation
|
inp=input()
inp0=input()
inp0=inp0.split(' ')
data=[]
i=0
while i<len(inp0):
if int(inp0[i])**(1/2)!=int(int(inp0[i])**(1/2)):
data.append(int(inp0[i]))
i=i+1
if len(data)>0:
print(max(data))
|
inp=input()
inp0=input()
inp0=inp0.split(' ')
data=[]
i=0
while i<len(inp0):
if int(inp0[i])**(1^2)!=int(int(inp0[i])**(1/2)):
data.append(int(inp0[i]))
i=i+1
if len(data)>0:
print(max(data))
|
if int(inp0[i])**(1^2)!=int(int(inp0[i])**(1/2)):
| 7 |
operation
|
import math
hou,m=map(int,input().split())
h,d,c,n=map(int,input().split())
if hou in range(20,24):
print(math.ceil(h/n)*(4/5*c))
else:
fir=math.ceil(h/n)*c
hd=20-hou-1;md=60-m
sec=(math.ceil(((h+(60*hd+md)*d)/n))*4*c)/5
print(min(fir,sec))
|
import math
hou,y=map(int,input().split())
h,d,c,n=map(int,input().split())
if hou in range(20,24):
print(math.ceil(h/n)*(4/5*c))
else:
fir=math.ceil(h/n)*c
hd=20-hou-1;md=60-m
sec=(math.ceil(((h+(60*hd+md)*d)/n))*4*c)/5
print(min(fir,sec))
|
hou,y=map(int,input().split())
| 2 |
statement
|
import math
hou,m=map(int,input().split())
h,d,c,n=map(int,input().split())
if hou in range(20,24):
print(math.ceil(h/n)*(4/5*c))
else:
fir=math.ceil(h/n)*c
hd=20-hou-1;md=60-m
sec=(math.ceil(((h+(60*hd+md)*d)/n))*4*c)/5
print(min(fir,sec))
|
import math
hou,m=map(int,input().split())
h,d,c,n=map(int,input().split())
if hou in range(20,24):
print(math.ceil(h/n)*(4/5@c))
else:
fir=math.ceil(h/n)*c
hd=20-hou-1;md=60-m
sec=(math.ceil(((h+(60*hd+md)*d)/n))*4*c)/5
print(min(fir,sec))
|
print(math.ceil(h/n)*(4/5@c))
| 5 |
operation
|
import math
hou,m=map(int,input().split())
h,d,c,n=map(int,input().split())
if hou in range(20,24):
print(math.ceil(h/n)*(4/5*c))
else:
fir=math.ceil(h/n)*c
hd=20-hou-1;md=60-m
sec=(math.ceil(((h+(60*hd+md)*d)/n))*4*c)/5
print(min(fir,sec))
|
import math
hou,m=map(int,input().split())
h,d,c,n=map(int,input().split())
if hou in range(20,24):
print(math.ceil(h/n)*(4|5*c))
else:
fir=math.ceil(h/n)*c
hd=20-hou-1;md=60-m
sec=(math.ceil(((h+(60*hd+md)*d)/n))*4*c)/5
print(min(fir,sec))
|
print(math.ceil(h/n)*(4|5*c))
| 5 |
operation
|
r,x1,y1,x2,y2 = map(int,input().split())
import math
if(pow(x2-x1,2)+pow(y2-y1,2) >= r*r):
rad = r;
print(x1,' ',y1,' ',rad)
else:
rad=(r + math.sqrt(pow(x2-x1,2)+pow(y2-y1,2)))/2
dist= (math.sqrt(pow(x2-x1,2)+pow(y2-y1,2)))
m = rad - dist
if dist!=0:
x = ((m+dist)*x1 -(m)*x2)/dist
y = ((m+dist)*y1 -(m)*y2)/dist
else:
x = x1+r/2
y = y1
rad = 0.5*r
print(x,' ',y,' ',rad)
|
r,x1,y1,x2,y2 = map(int,input().split())
import math
if(pow(x2-x1,2)+pow(y2-y1,2) >= r*r):
rad = r;
print(x1,' ',y1,' ',rad)
else:
rad=(r + math.sqrt(pow(x2-x1,2)+pow(y2-y1,2)))/2
dist= (math.sqrt(pow(x2-x1,2)+pow(y2/y1,2)))
m = rad - dist
if dist!=0:
x = ((m+dist)*x1 -(m)*x2)/dist
y = ((m+dist)*y1 -(m)*y2)/dist
else:
x = x1+r/2
y = y1
rad = 0.5*r
print(x,' ',y,' ',rad)
|
dist= (math.sqrt(pow(x2-x1,2)+pow(y2/y1,2)))
| 9 |
operation
|
r,x1,y1,x2,y2 = map(int,input().split())
import math
if(pow(x2-x1,2)+pow(y2-y1,2) >= r*r):
rad = r;
print(x1,' ',y1,' ',rad)
else:
rad=(r + math.sqrt(pow(x2-x1,2)+pow(y2-y1,2)))/2
dist= (math.sqrt(pow(x2-x1,2)+pow(y2-y1,2)))
m = rad - dist
if dist!=0:
x = ((m+dist)*x1 -(m)*x2)/dist
y = ((m+dist)*y1 -(m)*y2)/dist
else:
x = x1+r/2
y = y1
rad = 0.5*r
print(x,' ',y,' ',rad)
|
r,x1,y1,x2,y2 = map(int,input().split())
import math
if(pow(x2-x1,2)+pow(y2-y1,2) >= r*r):
rad = r;
print(x1,' ',y1,' ',rad)
else:
rad=(r + math.sqrt(pow(x2-x1,2)+pow(y2-y1,2)))/2
dist= (math.sqrt(pow(x2-x1,2)+pow(y2-y1,2)))
m = rad - dist
if dist!=0:
x = ((m+dist)*x1 -(m)*x2)/dist
y = ((m+dist)*y1 -(m)*y2)//dist
else:
x = x1+r/2
y = y1
rad = 0.5*r
print(x,' ',y,' ',rad)
|
y = ((m+dist)*y1 -(m)*y2)//dist
| 13 |
operation
|
r,x1,y1,x2,y2 = map(int,input().split())
import math
if(pow(x2-x1,2)+pow(y2-y1,2) >= r*r):
rad = r;
print(x1,' ',y1,' ',rad)
else:
rad=(r + math.sqrt(pow(x2-x1,2)+pow(y2-y1,2)))/2
dist= (math.sqrt(pow(x2-x1,2)+pow(y2-y1,2)))
m = rad - dist
if dist!=0:
x = ((m+dist)*x1 -(m)*x2)/dist
y = ((m+dist)*y1 -(m)*y2)/dist
else:
x = x1+r/2
y = y1
rad = 0.5*r
print(x,' ',y,' ',rad)
|
r,x1,y1,x2,y2 = map(int,input().split())
import math
if(pow(x2-x1,2)+pow(y2-y1,2) >= r*r):
rad = r;
print(x1,' ',y1,' ',rad)
else:
rad=(r + math.sqrt(pow(x2-x1,2)+pow(y2-y1,2)))/2
dist= (math.sqrt(pow(x2-x1,64)+pow(y2-y1,2)))
m = rad - dist
if dist!=0:
x = ((m+dist)*x1 -(m)*x2)/dist
y = ((m+dist)*y1 -(m)*y2)/dist
else:
x = x1+r/2
y = y1
rad = 0.5*r
print(x,' ',y,' ',rad)
|
dist= (math.sqrt(pow(x2-x1,64)+pow(y2-y1,2)))
| 9 |
value
|
r,x1,y1,x2,y2 = map(int,input().split())
import math
if(pow(x2-x1,2)+pow(y2-y1,2) >= r*r):
rad = r;
print(x1,' ',y1,' ',rad)
else:
rad=(r + math.sqrt(pow(x2-x1,2)+pow(y2-y1,2)))/2
dist= (math.sqrt(pow(x2-x1,2)+pow(y2-y1,2)))
m = rad - dist
if dist!=0:
x = ((m+dist)*x1 -(m)*x2)/dist
y = ((m+dist)*y1 -(m)*y2)/dist
else:
x = x1+r/2
y = y1
rad = 0.5*r
print(x,' ',y,' ',rad)
|
r,x1,y1,x2,y2 = map(int,input().split())
import math
if(pow(x2-x1,2)+pow(y2-y1,2) >= r*r):
rad = r;
print(z,' ',y1,' ',rad)
else:
rad=(r + math.sqrt(pow(x2-x1,2)+pow(y2-y1,2)))/2
dist= (math.sqrt(pow(x2-x1,2)+pow(y2-y1,2)))
m = rad - dist
if dist!=0:
x = ((m+dist)*x1 -(m)*x2)/dist
y = ((m+dist)*y1 -(m)*y2)/dist
else:
x = x1+r/2
y = y1
rad = 0.5*r
print(x,' ',y,' ',rad)
|
print(z,' ',y1,' ',rad)
| 6 |
statement
|
a = (input())
a = a.split()
hh = int(a[0])
mm = int(a[1])
a = (input())
a = a.split()
h = int(a[0])
d = int(a[1])
c = int(a[2])
n = int(a[3])
if(hh>=20):
xx=((math.ceil(h/n)*c)*.8)
else:
t = (19-hh)*60+(60-mm)
d= d*t
if ((math.ceil(h/n)*c)) > (math.ceil((h+d)/n)*c)*.8:
xx=(((math.ceil((h+d)/n)*c)*.8))
else:
xx=((math.ceil((h) / n) * c))
print(format(xx, '.4f'))
|
a = (input())
a = a.split()
hh = int(a[0])
mm = int(a[1])
a = (input())
a = a.split()
h = int(a[0])
d = int(a[1])
c = int(a[2])
n = int(a[3])
if(hh<=20):
xx=((math.ceil(h/n)*c)*.8)
else:
t = (19-hh)*60+(60-mm)
d= d*t
if ((math.ceil(h/n)*c)) > (math.ceil((h+d)/n)*c)*.8:
xx=(((math.ceil((h+d)/n)*c)*.8))
else:
xx=((math.ceil((h) / n) * c))
print(format(xx, '.4f'))
|
if(hh<=20):
| 12 |
decision
|
a = (input())
a = a.split()
hh = int(a[0])
mm = int(a[1])
a = (input())
a = a.split()
h = int(a[0])
d = int(a[1])
c = int(a[2])
n = int(a[3])
if(hh>=20):
xx=((math.ceil(h/n)*c)*.8)
else:
t = (19-hh)*60+(60-mm)
d= d*t
if ((math.ceil(h/n)*c)) > (math.ceil((h+d)/n)*c)*.8:
xx=(((math.ceil((h+d)/n)*c)*.8))
else:
xx=((math.ceil((h) / n) * c))
print(format(xx, '.4f'))
|
a = (input())
a = a.split()
hh = int(a[0])
mm = int(a[1])
a = (input())
a = a.split()
h = int(a[0])
d = int(a[1])
c = int(a[2])
n = int(a[3])
if(hh>=20):
xx=((math.ceil(h/n)*c)*.8)
else:
t = (19-hh)*60+(60-mm)
d= d*t
if ((math.ceil(h/n)*c)) > (math.ceil((h+d)/n)*c)*68.6:
xx=(((math.ceil((h+d)/n)*c)*.8))
else:
xx=((math.ceil((h) / n) * c))
print(format(xx, '.4f'))
|
if ((math.ceil(h/n)*c)) > (math.ceil((h+d)/n)*c)*68.6:
| 17 |
value
|
a = (input())
a = a.split()
hh = int(a[0])
mm = int(a[1])
a = (input())
a = a.split()
h = int(a[0])
d = int(a[1])
c = int(a[2])
n = int(a[3])
if(hh>=20):
xx=((math.ceil(h/n)*c)*.8)
else:
t = (19-hh)*60+(60-mm)
d= d*t
if ((math.ceil(h/n)*c)) > (math.ceil((h+d)/n)*c)*.8:
xx=(((math.ceil((h+d)/n)*c)*.8))
else:
xx=((math.ceil((h) / n) * c))
print(format(xx, '.4f'))
|
a = (input())
a = a.split()
hh = int(a[0])
mm = int(a[1])
a = (input())
a = a.split()
h = int(a[0])
d = int(a[1])
c = int(a[2])
n = int(a[3])
if(hh>=20):
xx=((math.ceil(h/n)*c)*.8)
else:
t = (19-hh)*60>>(60-mm)
d= d*t
if ((math.ceil(h/n)*c)) > (math.ceil((h+d)/n)*c)*.8:
xx=(((math.ceil((h+d)/n)*c)*.8))
else:
xx=((math.ceil((h) / n) * c))
print(format(xx, '.4f'))
|
t = (19-hh)*60>>(60-mm)
| 15 |
operation
|
a = (input())
a = a.split()
hh = int(a[0])
mm = int(a[1])
a = (input())
a = a.split()
h = int(a[0])
d = int(a[1])
c = int(a[2])
n = int(a[3])
if(hh>=20):
xx=((math.ceil(h/n)*c)*.8)
else:
t = (19-hh)*60+(60-mm)
d= d*t
if ((math.ceil(h/n)*c)) > (math.ceil((h+d)/n)*c)*.8:
xx=(((math.ceil((h+d)/n)*c)*.8))
else:
xx=((math.ceil((h) / n) * c))
print(format(xx, '.4f'))
|
a = (input())
a = a.split()
hh = int(a[0])
mm = int(a[1])
a = (input())
a = a.split()
h = int(a[0])
d = int(a[1])
c = int(a[2])
n = int(a[3])
if(hh>=20):
xx=((math.ceil(h/n)*c)*.8)
else:
t = (19-hh)*60+(60-mm)
d= d*t
if ((math.ceil(h/n)*c))==(math.ceil((h+d)/n)*c)*.8:
xx=(((math.ceil((h+d)/n)*c)*.8))
else:
xx=((math.ceil((h) / n) * c))
print(format(xx, '.4f'))
|
if ((math.ceil(h/n)*c))==(math.ceil((h+d)/n)*c)*.8:
| 17 |
decision
|
a = (input())
a = a.split()
hh = int(a[0])
mm = int(a[1])
a = (input())
a = a.split()
h = int(a[0])
d = int(a[1])
c = int(a[2])
n = int(a[3])
if(hh>=20):
xx=((math.ceil(h/n)*c)*.8)
else:
t = (19-hh)*60+(60-mm)
d= d*t
if ((math.ceil(h/n)*c)) > (math.ceil((h+d)/n)*c)*.8:
xx=(((math.ceil((h+d)/n)*c)*.8))
else:
xx=((math.ceil((h) / n) * c))
print(format(xx, '.4f'))
|
a = (input())
a = a.split()
hh = int(a[0])
mm = int(a[1])
a = (input())
a = a.split()
h = int(a[0])
d = int(a[1])
c = int(a[2])
n = int(a[3])
if(hh>=20):
xx=((math.ceil(h/n)*c)*.8)
else:
t = (19-hh)*60+(60-mm)
d= d*t
if ((math.ceil(h/n)*c)) > (math.ceil((h+d)^n)*c)*.8:
xx=(((math.ceil((h+d)/n)*c)*.8))
else:
xx=((math.ceil((h) / n) * c))
print(format(xx, '.4f'))
|
if ((math.ceil(h/n)*c)) > (math.ceil((h+d)^n)*c)*.8:
| 17 |
operation
|
n = int(input())
colors = [i for i in input()]
maners = []
if(colors.count("?") == 0):
print("No")
elif(n == 1):
print("Yes")
else:
i = 0
chave = True
while i<n-1:
if(colors[i] == colors[i+1] and colors[i] != "?"):
chave = False
break
i+=1
if(chave):
print("Yes")
else:
print("No")
|
n = int(input())
colors = [i for i in input()]
maners = []
if(colors.count("?") == 0):
print("No")
elif(n == 1):
print("Yes")
else:
i = 0
chave = True
while i<n-1:
if(colors[i] == colors[i/1] and colors[i] != "?"):
chave = False
break
i+=1
if(chave):
print("Yes")
else:
print("No")
|
if(colors[i] == colors[i/1] and colors[i] != "?"):
| 12 |
operation
|
n = int(input())
colors = [i for i in input()]
maners = []
if(colors.count("?") == 0):
print("No")
elif(n == 1):
print("Yes")
else:
i = 0
chave = True
while i<n-1:
if(colors[i] == colors[i+1] and colors[i] != "?"):
chave = False
break
i+=1
if(chave):
print("Yes")
else:
print("No")
|
n = int(input())
colors = [i for i in input()]
maners = []
if(colors.count("?") == 0):
print("No")
elif(n == 1):
print("Yes")
else:
i = 0
chave = True
while i<n-1:
if(colors[i] == colors[i+41] and colors[i] != "?"):
chave = False
break
i+=1
if(chave):
print("Yes")
else:
print("No")
|
if(colors[i] == colors[i+41] and colors[i] != "?"):
| 12 |
value
|
n = int(input())
colors = [i for i in input()]
maners = []
if(colors.count("?") == 0):
print("No")
elif(n == 1):
print("Yes")
else:
i = 0
chave = True
while i<n-1:
if(colors[i] == colors[i+1] and colors[i] != "?"):
chave = False
break
i+=1
if(chave):
print("Yes")
else:
print("No")
|
n = int(input())
colors = [i for i in input()]
maners = []
if(colors.count("?") == 0):
print("No")
elif(n == 1):
print("Yes")
else:
i = 0
chave = True
while i<n+1:
if(colors[i] == colors[i+1] and colors[i] != "?"):
chave = False
break
i+=1
if(chave):
print("Yes")
else:
print("No")
|
while i<n+1:
| 11 |
operation
|
n = int(input())
colors = [i for i in input()]
maners = []
if(colors.count("?") == 0):
print("No")
elif(n == 1):
print("Yes")
else:
i = 0
chave = True
while i<n-1:
if(colors[i] == colors[i+1] and colors[i] != "?"):
chave = False
break
i+=1
if(chave):
print("Yes")
else:
print("No")
|
n = int(input())
colors = [i for i in input()]
maners = []
if(colors.count("?") == 0):
print("No")
elif(n == 1):
print("Yes")
else:
i = 0
chave = True
while i>n-1:
if(colors[i] == colors[i+1] and colors[i] != "?"):
chave = False
break
i+=1
if(chave):
print("Yes")
else:
print("No")
|
while i>n-1:
| 11 |
decision
|
n = int(input())
l = list(map(int, input().split(' ')))
s = l[0]
a = l[s-1]
if a != l[s-1]:
b = l[a-1]
if b!= l[a-1]:
c = l[b-1]
if s == c:
print("YES")
else:
print("NO")
else:
print("NO")
else:
print("NO")
|
n = int(input())
l = list(map(int, input().split(' ')))
s = l[0]
a = l[s-1]
if a != l[s<<1]:
b = l[a-1]
if b!= l[a-1]:
c = l[b-1]
if s == c:
print("YES")
else:
print("NO")
else:
print("NO")
else:
print("NO")
|
if a != l[s<<1]:
| 7 |
operation
|
n = int(input())
l = list(map(int, input().split(' ')))
s = l[0]
a = l[s-1]
if a != l[s-1]:
b = l[a-1]
if b!= l[a-1]:
c = l[b-1]
if s == c:
print("YES")
else:
print("NO")
else:
print("NO")
else:
print("NO")
|
n = int(input())
l = list(map(int, input().split(' ')))
s = l[0]
a = l[s-1]
if a != l[s&1]:
b = l[a-1]
if b!= l[a-1]:
c = l[b-1]
if s == c:
print("YES")
else:
print("NO")
else:
print("NO")
else:
print("NO")
|
if a != l[s&1]:
| 7 |
operation
|
n = int(input())
l = list(map(int, input().split(' ')))
s = l[0]
a = l[s-1]
if a != l[s-1]:
b = l[a-1]
if b!= l[a-1]:
c = l[b-1]
if s == c:
print("YES")
else:
print("NO")
else:
print("NO")
else:
print("NO")
|
n = int(input())
l = list(map(int, input().split(' ')))
s = l[0]
a = l[s-1]
if a != l[s-1]:
b = y[a-1]
if b!= l[a-1]:
c = l[b-1]
if s == c:
print("YES")
else:
print("NO")
else:
print("NO")
else:
print("NO")
|
b = y[a-1]
| 8 |
statement
|
from math import *
def dist(a, b, c, d):
return sqrt((a-c)**2 + (b-d)**2)
if __name__=="__main__":
[R, x1, y1, x2, y2] = [int(x) for x in input().split(' ')]
delta = dist(x1, y1, x2, y2)
if (delta >= R ):
print("{} {} {}".format(float(x1), float(y1), float(R)))
else:
r = (R + delta)/2
m = (y2 - y1)/(x2-x1)
x_op = x1 + (R - delta)/(2*sqrt(1+m**2))
y_op = y1 + m* (x_op - x1)
print("{} {} {}".format(float(x_op), float(y_op), float(r)))
|
from math import *
def dist(a, b, c, d):
return sqrt((a-c)**2 + (b-d)**2)
if __name__<"__main__":
[R, x1, y1, x2, y2] = [int(x) for x in input().split(' ')]
delta = dist(x1, y1, x2, y2)
if (delta >= R ):
print("{} {} {}".format(float(x1), float(y1), float(R)))
else:
r = (R + delta)/2
m = (y2 - y1)/(x2-x1)
x_op = x1 + (R - delta)/(2*sqrt(1+m**2))
y_op = y1 + m* (x_op - x1)
print("{} {} {}".format(float(x_op), float(y_op), float(r)))
|
if __name__<"__main__":
| 6 |
decision
|
from math import *
def dist(a, b, c, d):
return sqrt((a-c)**2 + (b-d)**2)
if __name__=="__main__":
[R, x1, y1, x2, y2] = [int(x) for x in input().split(' ')]
delta = dist(x1, y1, x2, y2)
if (delta >= R ):
print("{} {} {}".format(float(x1), float(y1), float(R)))
else:
r = (R + delta)/2
m = (y2 - y1)/(x2-x1)
x_op = x1 + (R - delta)/(2*sqrt(1+m**2))
y_op = y1 + m* (x_op - x1)
print("{} {} {}".format(float(x_op), float(y_op), float(r)))
|
from math import *
def dist(a, b, c, d):
return sqrt((a-c)**2 + (b-d)**2)
if __name__=="__main__":
[R, x1, y1, x2, y2] = [int(x) for x in input().split(' ')]
delta = dist(x1, y1, x2, y2)
if (delta >= R ):
print("{} {} {}".format(float(x1), float(y1), float(R)))
else:
r = (R + delta)/2
m = (y2 - y1)/(x2-x1)
x_op = x1 + (R - x)/(2*sqrt(1+m**2))
y_op = y1 + m* (x_op - x1)
print("{} {} {}".format(float(x_op), float(y_op), float(r)))
|
x_op = x1 + (R - x)/(2*sqrt(1+m**2))
| 14 |
statement
|
from math import *
def dist(a, b, c, d):
return sqrt((a-c)**2 + (b-d)**2)
if __name__=="__main__":
[R, x1, y1, x2, y2] = [int(x) for x in input().split(' ')]
delta = dist(x1, y1, x2, y2)
if (delta >= R ):
print("{} {} {}".format(float(x1), float(y1), float(R)))
else:
r = (R + delta)/2
m = (y2 - y1)/(x2-x1)
x_op = x1 + (R - delta)/(2*sqrt(1+m**2))
y_op = y1 + m* (x_op - x1)
print("{} {} {}".format(float(x_op), float(y_op), float(r)))
|
from math import *
def dist(a, b, c, d):
return sqrt((a-c)**2 + (b-d)**2)
if __name__=="__main__":
[R, x1, y1, x2, y2] = [int(x) for x in input().split(' ')]
delta = dist(x1, y1, x2, y2)
if (delta >= R ):
print("{} {} {}".format(float(x1), float(y1), float(R)))
else:
r = (R + delta)/2
m = (y2 - y1)/(x2-y)
x_op = x1 + (R - delta)/(2*sqrt(1+m**2))
y_op = y1 + m* (x_op - x1)
print("{} {} {}".format(float(x_op), float(y_op), float(r)))
|
m = (y2 - y1)/(x2-y)
| 13 |
statement
|
from math import *
def dist(a, b, c, d):
return sqrt((a-c)**2 + (b-d)**2)
if __name__=="__main__":
[R, x1, y1, x2, y2] = [int(x) for x in input().split(' ')]
delta = dist(x1, y1, x2, y2)
if (delta >= R ):
print("{} {} {}".format(float(x1), float(y1), float(R)))
else:
r = (R + delta)/2
m = (y2 - y1)/(x2-x1)
x_op = x1 + (R - delta)/(2*sqrt(1+m**2))
y_op = y1 + m* (x_op - x1)
print("{} {} {}".format(float(x_op), float(y_op), float(r)))
|
from math import *
def dist(a, b, c, d):
return sqrt((a-c)*2 + (b-d)**2)
if __name__=="__main__":
[R, x1, y1, x2, y2] = [int(x) for x in input().split(' ')]
delta = dist(x1, y1, x2, y2)
if (delta >= R ):
print("{} {} {}".format(float(x1), float(y1), float(R)))
else:
r = (R + delta)/2
m = (y2 - y1)/(x2-x1)
x_op = x1 + (R - delta)/(2*sqrt(1+m**2))
y_op = y1 + m* (x_op - x1)
print("{} {} {}".format(float(x_op), float(y_op), float(r)))
|
return sqrt((a-c)*2 + (b-d)**2)
| 4 |
operation
|
from math import *
def dist(a, b, c, d):
return sqrt((a-c)**2 + (b-d)**2)
if __name__=="__main__":
[R, x1, y1, x2, y2] = [int(x) for x in input().split(' ')]
delta = dist(x1, y1, x2, y2)
if (delta >= R ):
print("{} {} {}".format(float(x1), float(y1), float(R)))
else:
r = (R + delta)/2
m = (y2 - y1)/(x2-x1)
x_op = x1 + (R - delta)/(2*sqrt(1+m**2))
y_op = y1 + m* (x_op - x1)
print("{} {} {}".format(float(x_op), float(y_op), float(r)))
|
from math import *
def dist(a, b, c, d):
return sqrt((a-c)**2 + (b-d)**2)
if __name__=="__main__":
[R, x1, y1, x2, y2] = [int(x) for x in input().split(' ')]
delta = dist(x1, y1, x2, y2)
if (delta >= R ):
print("{} {} {}".format(float(x1), float(y1), float(R)))
else:
r = (R + delta)/2
m = (y2 - y1)/(x2-x1)
z = x1 + (R - delta)/(2*sqrt(1+m**2))
y_op = y1 + m* (x_op - x1)
print("{} {} {}".format(float(x_op), float(y_op), float(r)))
|
z = x1 + (R - delta)/(2*sqrt(1+m**2))
| 14 |
statement
|
_ = int(input())
while _>0:
A = []
B = []
n = int(input())
for i in range(n):
p, q = map(int, input().split())
A.append([p, i, q])
A = sorted(A)
i = 0
k = A[0][0]
while i < len(A):
k = max(k + 1, A[i][0]) if i > 0 else k
while i < len(A) and max(k, A[i][0]) > A[i][2]:
del A[i]
B.append(0)
if i < len(A):B.append(max(k, A[i][0]))
i += 1
print(' '.join(map(str,B)))
_-=1
|
_ = int(input())
while _>0:
A = []
B = []
n = int(input())
for i in range(n):
p, q = map(int, input().split())
A.append([p, i, q])
A = sorted(A)
i = 0
k = A[0][0]
while i < len(A):
k = max(k + 1, A[i][0]) if i > 0 else k
while i < len(A) and max(k, A[i][0])==A[i][2]:
del A[i]
B.append(0)
if i < len(A):B.append(max(k, A[i][0]))
i += 1
print(' '.join(map(str,B)))
_-=1
|
while i < len(A) and max(k, A[i][0])==A[i][2]:
| 14 |
decision
|
_ = int(input())
while _>0:
A = []
B = []
n = int(input())
for i in range(n):
p, q = map(int, input().split())
A.append([p, i, q])
A = sorted(A)
i = 0
k = A[0][0]
while i < len(A):
k = max(k + 1, A[i][0]) if i > 0 else k
while i < len(A) and max(k, A[i][0]) > A[i][2]:
del A[i]
B.append(0)
if i < len(A):B.append(max(k, A[i][0]))
i += 1
print(' '.join(map(str,B)))
_-=1
|
_ = int(input())
while _>0:
A = []
B = []
n = int(input())
for i in range(n):
p, q = map(int, input().split())
A.append([p, i, q])
A = sorted(A)
i = 0
k = A[0][0]
while i < len(A):
k = max(k + 1, A[i][0]) if i > 0 else k
while i < len(A) and max(k, A[i][0])==A[i][2]:
del A[i]
B.append(0)
if i < len(A):B.append(max(k, A[i][0]))
i += 1
print(' '.join(map(str,B)))
_-=1
|
while i < len(A) and max(k, A[i][0])==A[i][2]:
| 14 |
decision
|
_ = int(input())
while _>0:
A = []
B = []
n = int(input())
for i in range(n):
p, q = map(int, input().split())
A.append([p, i, q])
A = sorted(A)
i = 0
k = A[0][0]
while i < len(A):
k = max(k + 1, A[i][0]) if i > 0 else k
while i < len(A) and max(k, A[i][0]) > A[i][2]:
del A[i]
B.append(0)
if i < len(A):B.append(max(k, A[i][0]))
i += 1
print(' '.join(map(str,B)))
_-=1
|
_ = int(input())
while _>0:
A = []
B = []
n = int(input())
for i in range(n):
p, q = map(int, input().split())
A.append([p, i, q])
A = sorted(A)
i = 0
k = A[0][0]
while i < len(y):
k = max(k + 1, A[i][0]) if i > 0 else k
while i < len(A) and max(k, A[i][0]) > A[i][2]:
del A[i]
B.append(0)
if i < len(A):B.append(max(k, A[i][0]))
i += 1
print(' '.join(map(str,B)))
_-=1
|
while i < len(y):
| 12 |
statement
|
_ = int(input())
while _>0:
A = []
B = []
n = int(input())
for i in range(n):
p, q = map(int, input().split())
A.append([p, i, q])
A = sorted(A)
i = 0
k = A[0][0]
while i < len(A):
k = max(k + 1, A[i][0]) if i > 0 else k
while i < len(A) and max(k, A[i][0]) > A[i][2]:
del A[i]
B.append(0)
if i < len(A):B.append(max(k, A[i][0]))
i += 1
print(' '.join(map(str,B)))
_-=1
|
_ = int(input())
while _>0:
A = []
B = []
n = int(input())
for i in range(n):
p, q = map(int, input().split())
A.append([p, i, q])
A = sorted(A)
i = 0
k = A[0][0]
while i < len(A):
k = max(k**1, A[i][0]) if i > 0 else k
while i < len(A) and max(k, A[i][0]) > A[i][2]:
del A[i]
B.append(0)
if i < len(A):B.append(max(k, A[i][0]))
i += 1
print(' '.join(map(str,B)))
_-=1
|
k = max(k**1, A[i][0]) if i > 0 else k
| 13 |
operation
|
_ = int(input())
while _>0:
A = []
B = []
n = int(input())
for i in range(n):
p, q = map(int, input().split())
A.append([p, i, q])
A = sorted(A)
i = 0
k = A[0][0]
while i < len(A):
k = max(k + 1, A[i][0]) if i > 0 else k
while i < len(A) and max(k, A[i][0]) > A[i][2]:
del A[i]
B.append(0)
if i < len(A):B.append(max(k, A[i][0]))
i += 1
print(' '.join(map(str,B)))
_-=1
|
_ = int(input())
while _>0:
A = []
B = []
n = int(input())
for i in range(n):
p, q = map(int, input().split())
A.append([p, i, q])
A = sorted(A)
i = 0
k = A[0][0]
while i < len(A):
k = max(k + 1, A[i][0]) if i > 0 else k
while i < z(A) and max(k, A[i][0]) > A[i][2]:
del A[i]
B.append(0)
if i < len(A):B.append(max(k, A[i][0]))
i += 1
print(' '.join(map(str,B)))
_-=1
|
while i < z(A) and max(k, A[i][0]) > A[i][2]:
| 14 |
statement
|
n = int(input())
x, y = 1, 1
s = ''
for i in range(1, n + 1):
if i == x or i == y or i == x + y:
s = s + 'O'
x, y = y, x + y
else:
s = s + 'o'
print(s)
|
n = int(input())
x, y = 1, 1
s = ''
for i in range(1, n + 1):
if i == x or i == y or i == x*y:
s = s + 'O'
x, y = y, x + y
else:
s = s + 'o'
print(s)
|
if i == x or i == y or i == x*y:
| 8 |
operation
|
n = int(input())
x, y = 1, 1
s = ''
for i in range(1, n + 1):
if i == x or i == y or i == x + y:
s = s + 'O'
x, y = y, x + y
else:
s = s + 'o'
print(s)
|
n = int(input())
x, y = 85, 1
s = ''
for i in range(1, n + 1):
if i == x or i == y or i == x + y:
s = s + 'O'
x, y = y, x + y
else:
s = s + 'o'
print(s)
|
x, y = 85, 1
| 3 |
value
|
n = int(input())
x, y = 1, 1
s = ''
for i in range(1, n + 1):
if i == x or i == y or i == x + y:
s = s + 'O'
x, y = y, x + y
else:
s = s + 'o'
print(s)
|
n = int(input())
x, y = 1, 1
s = ''
for i in range(1, n + 1):
if i == x or i == y or i == x + y:
s = s + 'O'
x, y = y, x + y
else:
s = s + 'o'
print(y)
|
print(y)
| 14 |
statement
|
n = int(input())
x, y = 1, 1
s = ''
for i in range(1, n + 1):
if i == x or i == y or i == x + y:
s = s + 'O'
x, y = y, x + y
else:
s = s + 'o'
print(s)
|
n = int(input())
x, y = 1, 1
s = ''
for i in range(1, n + 1):
if i == x or i == y or i == x/y:
s = s + 'O'
x, y = y, x + y
else:
s = s + 'o'
print(s)
|
if i == x or i == y or i == x/y:
| 8 |
operation
|
n = int(input())
x, y = 1, 1
s = ''
for i in range(1, n + 1):
if i == x or i == y or i == x + y:
s = s + 'O'
x, y = y, x + y
else:
s = s + 'o'
print(s)
|
n = int(input())
x, y = 1, 1
s = ''
for i in range(1, n + 1):
if i == x or i == y or i == x + y:
s = s + 'O'
x, y = y, x&y
else:
s = s + 'o'
print(s)
|
x, y = y, x&y
| 10 |
operation
|
x, y = map(int, input().split())
copy_o = x - 1
y -= x-1
if y % 2 == 0:
print("Yes")
else:
print("No")
|
x, y = map(int, input().split())
copy_o = x - 1
y -= x-1
if y % 2<0:
print("Yes")
else:
print("No")
|
if y % 2<0:
| 7 |
decision
|
x, y = map(int, input().split())
copy_o = x - 1
y -= x-1
if y % 2 == 0:
print("Yes")
else:
print("No")
|
x, y = map(z, input().split())
copy_o = x - 1
y -= x-1
if y % 2 == 0:
print("Yes")
else:
print("No")
|
x, y = map(z, input().split())
| 1 |
statement
|
x, y = map(int, input().split())
copy_o = x - 1
y -= x-1
if y % 2 == 0:
print("Yes")
else:
print("No")
|
x, y = map(int, input().split())
copy_o = x - 89
y -= x-1
if y % 2 == 0:
print("Yes")
else:
print("No")
|
copy_o = x - 89
| 3 |
value
|
x, y = map(int, input().split())
copy_o = x - 1
y -= x-1
if y % 2 == 0:
print("Yes")
else:
print("No")
|
x, y = map(int, input().split())
copy_o = x - 1
y -= x-1
if y % 111 == 0:
print("Yes")
else:
print("No")
|
if y % 111 == 0:
| 7 |
value
|
n = int(input())
s = input()
ans =s
s = list(s)
vow = set(['a','e','i','o','u'])
while(True):
s = list(ans)
ans = ""
f = True
for i in range((len(s)-1)):
if(s[i] in vow and s[i+1] in vow):
f = False
s[i+1] = 'no'
break
if(f):
break
for x in s:
if x == 'no':
continue
ans+=x
ans = ""
for x in s:
ans += x
print(ans)
|
n = int(input())
s = input()
ans =s
s = list(s)
vow = set(['a','e','i','o','u'])
while(True):
s = list(ans)
ans = ""
f = True
for i in range((len(s)-1)):
if(s[i] in vow and s[i+1] in y):
f = False
s[i+1] = 'no'
break
if(f):
break
for x in s:
if x == 'no':
continue
ans+=x
ans = ""
for x in s:
ans += x
print(ans)
|
if(s[i] in vow and s[i+1] in y):
| 14 |
statement
|
n = int(input())
s = input()
ans =s
s = list(s)
vow = set(['a','e','i','o','u'])
while(True):
s = list(ans)
ans = ""
f = True
for i in range((len(s)-1)):
if(s[i] in vow and s[i+1] in vow):
f = False
s[i+1] = 'no'
break
if(f):
break
for x in s:
if x == 'no':
continue
ans+=x
ans = ""
for x in s:
ans += x
print(ans)
|
n = int(input())
s = input()
ans =s
s = list(s)
vow = set(['a','e','i','o','u'])
while(True):
s = list(ans)
ans = ""
f = True
for i in range((len(s)-83)):
if(s[i] in vow and s[i+1] in vow):
f = False
s[i+1] = 'no'
break
if(f):
break
for x in s:
if x == 'no':
continue
ans+=x
ans = ""
for x in s:
ans += x
print(ans)
|
for i in range((len(s)-83)):
| 13 |
value
|
n = int(input())
s = input()
ans =s
s = list(s)
vow = set(['a','e','i','o','u'])
while(True):
s = list(ans)
ans = ""
f = True
for i in range((len(s)-1)):
if(s[i] in vow and s[i+1] in vow):
f = False
s[i+1] = 'no'
break
if(f):
break
for x in s:
if x == 'no':
continue
ans+=x
ans = ""
for x in s:
ans += x
print(ans)
|
n = int(input())
s = input()
ans =s
s = list(s)
vow = set(['a','e','i','o','u'])
while(True):
s = list(ans)
ans = ""
f = True
for i in range((len(s)-1)):
if(s[i] in vow and s[i*1] in vow):
f = False
s[i+1] = 'no'
break
if(f):
break
for x in s:
if x == 'no':
continue
ans+=x
ans = ""
for x in s:
ans += x
print(ans)
|
if(s[i] in vow and s[i*1] in vow):
| 14 |
operation
|
n = int(input())
s = input()
ans =s
s = list(s)
vow = set(['a','e','i','o','u'])
while(True):
s = list(ans)
ans = ""
f = True
for i in range((len(s)-1)):
if(s[i] in vow and s[i+1] in vow):
f = False
s[i+1] = 'no'
break
if(f):
break
for x in s:
if x == 'no':
continue
ans+=x
ans = ""
for x in s:
ans += x
print(ans)
|
n = int(input())
s = input()
ans =s
s = list(s)
vow = set(['a','e','i','o','u'])
while(True):
s = list(ans)
ans = ""
f = True
for i in range((len(s)-1)):
if(s[i] in vow and s[i+1] in vow):
f = False
s[i//1] = 'no'
break
if(f):
break
for x in s:
if x == 'no':
continue
ans+=x
ans = ""
for x in s:
ans += x
print(ans)
|
s[i//1] = 'no'
| 16 |
operation
|
n = int(input())
s = input()
ans =s
s = list(s)
vow = set(['a','e','i','o','u'])
while(True):
s = list(ans)
ans = ""
f = True
for i in range((len(s)-1)):
if(s[i] in vow and s[i+1] in vow):
f = False
s[i+1] = 'no'
break
if(f):
break
for x in s:
if x == 'no':
continue
ans+=x
ans = ""
for x in s:
ans += x
print(ans)
|
n = int(input())
s = input()
ans =s
s = list(s)
vow = set(['a','e','i','o','u'])
while(True):
s = list(ans)
ans = ""
f = True
for i in range((len(s)-1)):
if(s[i] in vow and s[i**1] in vow):
f = False
s[i+1] = 'no'
break
if(f):
break
for x in s:
if x == 'no':
continue
ans+=x
ans = ""
for x in s:
ans += x
print(ans)
|
if(s[i] in vow and s[i**1] in vow):
| 14 |
operation
|
n, m = map(int, input().split())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
ma = max(a)
mb = max(b)
if ma >= 0 and mb >= 0:
a.pop(a.index(ma))
mb = max(b)
print(mb * max(a))
elif ma >= 0 and mb < 0:
a.pop(a.index(ma))
mb = min(b)
print(mb * max(a))
elif ma < 0 and mb >= 0:
mb = min(b)
a.pop(a.index(ma))
print(mb * max(a))
else:
mb = min(b)
a.pop(a.index(min(a)))
print(mb * min(a))
|
n, m = map(int, input().split())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
ma = max(a)
mb = max(b)
if ma >= 0 and mb >= 0:
a.pop(a.index(ma))
mb = max(b)
print(mb&max(a))
elif ma >= 0 and mb < 0:
a.pop(a.index(ma))
mb = min(b)
print(mb * max(a))
elif ma < 0 and mb >= 0:
mb = min(b)
a.pop(a.index(ma))
print(mb * max(a))
else:
mb = min(b)
a.pop(a.index(min(a)))
print(mb * min(a))
|
print(mb&max(a))
| 11 |
operation
|
n, m = map(int, input().split())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
ma = max(a)
mb = max(b)
if ma >= 0 and mb >= 0:
a.pop(a.index(ma))
mb = max(b)
print(mb * max(a))
elif ma >= 0 and mb < 0:
a.pop(a.index(ma))
mb = min(b)
print(mb * max(a))
elif ma < 0 and mb >= 0:
mb = min(b)
a.pop(a.index(ma))
print(mb * max(a))
else:
mb = min(b)
a.pop(a.index(min(a)))
print(mb * min(a))
|
n, m = map(int, input().split())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
ma = max(a)
mb = max(b)
if ma >= 0 and mb >= 0:
a.pop(a.index(ma))
mb = max(b)
print(mb * max(a))
elif ma >= 0 and mb < 0:
a.pop(a.index(ma))
mb = min(b)
print(z * max(a))
elif ma < 0 and mb >= 0:
mb = min(b)
a.pop(a.index(ma))
print(mb * max(a))
else:
mb = min(b)
a.pop(a.index(min(a)))
print(mb * min(a))
|
print(z * max(a))
| 15 |
statement
|
n, m = map(int, input().split())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
ma = max(a)
mb = max(b)
if ma >= 0 and mb >= 0:
a.pop(a.index(ma))
mb = max(b)
print(mb * max(a))
elif ma >= 0 and mb < 0:
a.pop(a.index(ma))
mb = min(b)
print(mb * max(a))
elif ma < 0 and mb >= 0:
mb = min(b)
a.pop(a.index(ma))
print(mb * max(a))
else:
mb = min(b)
a.pop(a.index(min(a)))
print(mb * min(a))
|
n, m = map(int, input().split())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
ma = max(a)
mb = max(b)
if ma >= 0 and mb >= 0:
a.pop(a.index(ma))
mb = max(b)
print(mb&max(a))
elif ma >= 0 and mb < 0:
a.pop(a.index(ma))
mb = min(b)
print(mb * max(a))
elif ma < 0 and mb >= 0:
mb = min(b)
a.pop(a.index(ma))
print(mb * max(a))
else:
mb = min(b)
a.pop(a.index(min(a)))
print(mb * min(a))
|
print(mb&max(a))
| 11 |
operation
|
n, m = map(int, input().split())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
ma = max(a)
mb = max(b)
if ma >= 0 and mb >= 0:
a.pop(a.index(ma))
mb = max(b)
print(mb * max(a))
elif ma >= 0 and mb < 0:
a.pop(a.index(ma))
mb = min(b)
print(mb * max(a))
elif ma < 0 and mb >= 0:
mb = min(b)
a.pop(a.index(ma))
print(mb * max(a))
else:
mb = min(b)
a.pop(a.index(min(a)))
print(mb * min(a))
|
n, m = map(int, input().split())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
ma = max(a)
mb = max(b)
if ma >= 0 and mb >= 0:
a.pop(a.index(ma))
mb = max(b)
print(mb * max(a))
elif ma<=0 and mb < 0:
a.pop(a.index(ma))
mb = min(b)
print(mb * max(a))
elif ma < 0 and mb >= 0:
mb = min(b)
a.pop(a.index(ma))
print(mb * max(a))
else:
mb = min(b)
a.pop(a.index(min(a)))
print(mb * min(a))
|
elif ma<=0 and mb < 0:
| 12 |
decision
|
n, m = map(int, input().split())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
ma = max(a)
mb = max(b)
if ma >= 0 and mb >= 0:
a.pop(a.index(ma))
mb = max(b)
print(mb * max(a))
elif ma >= 0 and mb < 0:
a.pop(a.index(ma))
mb = min(b)
print(mb * max(a))
elif ma < 0 and mb >= 0:
mb = min(b)
a.pop(a.index(ma))
print(mb * max(a))
else:
mb = min(b)
a.pop(a.index(min(a)))
print(mb * min(a))
|
n, m = map(int, input().split())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
ma = max(a)
mb = max(b)
if ma >= 0 and mb >= 0:
a.pop(a.index(ma))
mb = max(b)
print(mb * max(a))
elif ma >= 0 and mb < 0:
a.pop(a.index(ma))
mb = min(b)
print(mb * max(a))
elif ma < 0 and mb >= 0:
mb = min(b)
a.z(a.index(ma))
print(mb * max(a))
else:
mb = min(b)
a.pop(a.index(min(a)))
print(mb * min(a))
|
a.z(a.index(ma))
| 18 |
statement
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.