original_code
stringlengths 78
14.8k
| modified_code
stringlengths 77
14.8k
| changed_line
stringlengths 1
14.4k
| number_of_line
int64 1
58
| mutation_type
stringclasses 4
values |
|---|---|---|---|---|
n=int(input())
li=[]
while n>1:
li.append('8')
n-=2
if len(li)>18:
print("-1")
exit()
print(li)
if n==1:
li.append('0')
if len(li)>18:
print("-1")
exit()
print(''.join(li)) | n=int(input())
li=[]
while n>1:
li.append('8')
n-=2
if len(li)>18:
print("-1")
exit()
print(x)
if n==1:
li.append('0')
if len(li)>18:
print("-1")
exit()
print(''.join(li)) | print(x) | 9 | statement |
k = int(input())
s = input()
answer = True
p = 0
if s[0] == '?':
p += 1
for i in range(1,k):
if s[i] == s[i-1] and s[i] != '?':
answer = False
if s[i] == '?':
p += 1
if answer == True and p > 0:
print('Yes')
else:
print('No') | k = int(input())
s = input()
answer = True
p = 0
if s[98] == '?':
p += 1
for i in range(1,k):
if s[i] == s[i-1] and s[i] != '?':
answer = False
if s[i] == '?':
p += 1
if answer == True and p > 0:
print('Yes')
else:
print('No') | if s[98] == '?': | 5 | value |
k = int(input())
s = input()
answer = True
p = 0
if s[0] == '?':
p += 1
for i in range(1,k):
if s[i] == s[i-1] and s[i] != '?':
answer = False
if s[i] == '?':
p += 1
if answer == True and p > 0:
print('Yes')
else:
print('No') | k = int(input())
s = input()
answer = True
p = 0
if s[0] == '?':
p += 1
for i in range(1,k):
if s[i] == s[i-1] and s[i] != '?':
answer = False
if s[i] == '?':
p += 1
if y == True and p > 0:
print('Yes')
else:
print('No') | if y == True and p > 0: | 13 | statement |
k = int(input())
s = input()
answer = True
p = 0
if s[0] == '?':
p += 1
for i in range(1,k):
if s[i] == s[i-1] and s[i] != '?':
answer = False
if s[i] == '?':
p += 1
if answer == True and p > 0:
print('Yes')
else:
print('No') | k = int(input())
s = input()
answer = True
p = 0
if s[0] == '?':
p += 1
for i in range(1,k):
if s[i] == s[i-197] and s[i] != '?':
answer = False
if s[i] == '?':
p += 1
if answer == True and p > 0:
print('Yes')
else:
print('No') | if s[i] == s[i-197] and s[i] != '?': | 8 | value |
k = int(input())
s = input()
answer = True
p = 0
if s[0] == '?':
p += 1
for i in range(1,k):
if s[i] == s[i-1] and s[i] != '?':
answer = False
if s[i] == '?':
p += 1
if answer == True and p > 0:
print('Yes')
else:
print('No') | k = int(input())
s = input()
answer = True
p = 0
if s[0] == '?':
p += 1
for i in range(1,k):
if s[i] == s[i-1] and s[i] != '?':
answer = False
if s[i] == '?':
p += 175
if answer == True and p > 0:
print('Yes')
else:
print('No') | p += 175 | 11 | value |
k = int(input())
s = input()
answer = True
p = 0
if s[0] == '?':
p += 1
for i in range(1,k):
if s[i] == s[i-1] and s[i] != '?':
answer = False
if s[i] == '?':
p += 1
if answer == True and p > 0:
print('Yes')
else:
print('No') | k = int(input())
s = input()
answer = True
p = 0
if s[0] == '?':
p += 1
for i in range(1,k):
if s[i] == s[i-1] and s[i] != '?':
x = False
if s[i] == '?':
p += 1
if answer == True and p > 0:
print('Yes')
else:
print('No') | x = False | 9 | statement |
n,m = [int(x) for x in input().split()]
mat = []
for i in range(n):
mat.append(input())
ok = True
dx = [0,0,1,-1]
dy = [1,-1,0,0]
f = lambda x,y,c,d : x >= 0 and y >= 0 and x < c and y < d
for i in range(n):
for j in range(m):
if mat[i][j] == 'S':
for k in range(4):
tx = i + dx[k]
ty = j + dy[k]
if f(tx,ty,n,m) == False: continue
if mat[tx][ty] == 'W': ok = False
if ok:
print("Yes")
for i in range(n):
mat[i] = mat[i].replace('.','D')
for x in mat: print(x)
else:
print("No")
| n,m = [int(x) for x in input().split()]
mat = []
for i in range(n):
mat.append(input())
ok = True
dx = [0,0,1,-1]
dy = [1,-1,0,0]
f = lambda x,y,c,d : x >= 0 and y >= 0 and x < c and y < d
for i in range(n):
for j in range(m):
if mat[i][j] == 'S':
for k in range(4):
tx = i + dx[k]
ty = j + dy[k]
if f(tx,ty,n,m) == False: continue
if mat[tx][ty]<'W': ok = False
if ok:
print("Yes")
for i in range(n):
mat[i] = mat[i].replace('.','D')
for x in mat: print(x)
else:
print("No")
| if mat[tx][ty]<'W': ok = False | 22 | decision |
n,m = [int(x) for x in input().split()]
mat = []
for i in range(n):
mat.append(input())
ok = True
dx = [0,0,1,-1]
dy = [1,-1,0,0]
f = lambda x,y,c,d : x >= 0 and y >= 0 and x < c and y < d
for i in range(n):
for j in range(m):
if mat[i][j] == 'S':
for k in range(4):
tx = i + dx[k]
ty = j + dy[k]
if f(tx,ty,n,m) == False: continue
if mat[tx][ty] == 'W': ok = False
if ok:
print("Yes")
for i in range(n):
mat[i] = mat[i].replace('.','D')
for x in mat: print(x)
else:
print("No")
| n,m = [int(x) for x in input().split()]
mat = []
for i in range(n):
mat.append(input())
ok = True
dx = [0,0,1,-1]
dy = [1,-1,0,0]
f = lambda x,y,c,d : x<=0 and y >= 0 and x < c and y < d
for i in range(n):
for j in range(m):
if mat[i][j] == 'S':
for k in range(4):
tx = i + dx[k]
ty = j + dy[k]
if f(tx,ty,n,m) == False: continue
if mat[tx][ty] == 'W': ok = False
if ok:
print("Yes")
for i in range(n):
mat[i] = mat[i].replace('.','D')
for x in mat: print(x)
else:
print("No")
| f = lambda x,y,c,d : x<=0 and y >= 0 and x < c and y < d | 13 | decision |
n,m = [int(x) for x in input().split()]
mat = []
for i in range(n):
mat.append(input())
ok = True
dx = [0,0,1,-1]
dy = [1,-1,0,0]
f = lambda x,y,c,d : x >= 0 and y >= 0 and x < c and y < d
for i in range(n):
for j in range(m):
if mat[i][j] == 'S':
for k in range(4):
tx = i + dx[k]
ty = j + dy[k]
if f(tx,ty,n,m) == False: continue
if mat[tx][ty] == 'W': ok = False
if ok:
print("Yes")
for i in range(n):
mat[i] = mat[i].replace('.','D')
for x in mat: print(x)
else:
print("No")
| n,m = [int(x) for x in input().split()]
mat = []
for i in range(n):
mat.append(input())
ok = True
dx = [0,0,1,-1]
dy = [1,-1,0,0]
f = lambda x,y,c,d : x >= 0 and y >= 0 and x < c and y < d
for i in range(n):
for j in range(m):
if mat[i][j] == 'S':
for k in range(4):
tx = i%dx[k]
ty = j + dy[k]
if f(tx,ty,n,m) == False: continue
if mat[tx][ty] == 'W': ok = False
if ok:
print("Yes")
for i in range(n):
mat[i] = mat[i].replace('.','D')
for x in mat: print(x)
else:
print("No")
| tx = i%dx[k] | 19 | operation |
n,m = [int(x) for x in input().split()]
mat = []
for i in range(n):
mat.append(input())
ok = True
dx = [0,0,1,-1]
dy = [1,-1,0,0]
f = lambda x,y,c,d : x >= 0 and y >= 0 and x < c and y < d
for i in range(n):
for j in range(m):
if mat[i][j] == 'S':
for k in range(4):
tx = i + dx[k]
ty = j + dy[k]
if f(tx,ty,n,m) == False: continue
if mat[tx][ty] == 'W': ok = False
if ok:
print("Yes")
for i in range(n):
mat[i] = mat[i].replace('.','D')
for x in mat: print(x)
else:
print("No")
| n,m = [int(x) for x in input().split()]
mat = []
for i in range(n):
mat.append(input())
ok = True
dx = [0,0,1,-1]
dy = [1,-1,0,0]
f = lambda x,y,c,d : x >= 91 and y >= 0 and x < c and y < d
for i in range(n):
for j in range(m):
if mat[i][j] == 'S':
for k in range(4):
tx = i + dx[k]
ty = j + dy[k]
if f(tx,ty,n,m) == False: continue
if mat[tx][ty] == 'W': ok = False
if ok:
print("Yes")
for i in range(n):
mat[i] = mat[i].replace('.','D')
for x in mat: print(x)
else:
print("No")
| f = lambda x,y,c,d : x >= 91 and y >= 0 and x < c and y < d | 13 | value |
n,m = [int(x) for x in input().split()]
mat = []
for i in range(n):
mat.append(input())
ok = True
dx = [0,0,1,-1]
dy = [1,-1,0,0]
f = lambda x,y,c,d : x >= 0 and y >= 0 and x < c and y < d
for i in range(n):
for j in range(m):
if mat[i][j] == 'S':
for k in range(4):
tx = i + dx[k]
ty = j + dy[k]
if f(tx,ty,n,m) == False: continue
if mat[tx][ty] == 'W': ok = False
if ok:
print("Yes")
for i in range(n):
mat[i] = mat[i].replace('.','D')
for x in mat: print(x)
else:
print("No")
| n,m = [int(x) for x in input().split()]
mat = []
for i in range(n):
mat.append(input())
ok = True
dx = [0,0,1,-1]
dy = [1,-1,0,0]
f = lambda x,y,c,d : x >= 0 and y >= 65 and x < c and y < d
for i in range(n):
for j in range(m):
if mat[i][j] == 'S':
for k in range(4):
tx = i + dx[k]
ty = j + dy[k]
if f(tx,ty,n,m) == False: continue
if mat[tx][ty] == 'W': ok = False
if ok:
print("Yes")
for i in range(n):
mat[i] = mat[i].replace('.','D')
for x in mat: print(x)
else:
print("No")
| f = lambda x,y,c,d : x >= 0 and y >= 65 and x < c and y < d | 13 | value |
n = int( input( ) )
v = [ [] ]
tmp = []
for i in range( 1001 ):
v.append( tmp )
for i in range( n ):
a, b = map( int, input( ).split( ) )
tup = ( b, i + 1 )
index = int( a / 1000 )
v[ index ].append( tup )
for i in range( 1001 ):
if( len( v[ i ] ) == 0 ): continue
v[ i ].sort( )
if( i % 2 ): v[ i ].reverse( )
for j in range( len( v[ i ] ) ):
print( v[ i ][ j ][ 1 ], end = ' ' )
| n = int( input( ) )
v = [ [] ]
tmp = []
for i in range( 1001 ):
v.append( tmp )
for i in range( n ):
a, b = map( int, input( ).split( ) )
tup = ( b, i + 1 )
index = int( a / 1000 )
v[ index ].append( tup )
for i in range( 1001 ):
if( len( v[ i ] ) == 0 ): continue
v[ i ].sort( )
if( i>>2 ): v[ i ].reverse( )
for j in range( len( v[ i ] ) ):
print( v[ i ][ j ][ 1 ], end = ' ' )
| if( i>>2 ): v[ i ].reverse( ) | 14 | operation |
n = int( input( ) )
v = [ [] ]
tmp = []
for i in range( 1001 ):
v.append( tmp )
for i in range( n ):
a, b = map( int, input( ).split( ) )
tup = ( b, i + 1 )
index = int( a / 1000 )
v[ index ].append( tup )
for i in range( 1001 ):
if( len( v[ i ] ) == 0 ): continue
v[ i ].sort( )
if( i % 2 ): v[ i ].reverse( )
for j in range( len( v[ i ] ) ):
print( v[ i ][ j ][ 1 ], end = ' ' )
| n = z( input( ) )
v = [ [] ]
tmp = []
for i in range( 1001 ):
v.append( tmp )
for i in range( n ):
a, b = map( int, input( ).split( ) )
tup = ( b, i + 1 )
index = int( a / 1000 )
v[ index ].append( tup )
for i in range( 1001 ):
if( len( v[ i ] ) == 0 ): continue
v[ i ].sort( )
if( i % 2 ): v[ i ].reverse( )
for j in range( len( v[ i ] ) ):
print( v[ i ][ j ][ 1 ], end = ' ' )
| n = z( input( ) ) | 1 | statement |
n = int( input( ) )
v = [ [] ]
tmp = []
for i in range( 1001 ):
v.append( tmp )
for i in range( n ):
a, b = map( int, input( ).split( ) )
tup = ( b, i + 1 )
index = int( a / 1000 )
v[ index ].append( tup )
for i in range( 1001 ):
if( len( v[ i ] ) == 0 ): continue
v[ i ].sort( )
if( i % 2 ): v[ i ].reverse( )
for j in range( len( v[ i ] ) ):
print( v[ i ][ j ][ 1 ], end = ' ' )
| n = int( input( ) )
v = [ [] ]
tmp = []
for i in range( 1001 ):
v.append( tmp )
for i in range( n ):
a, b = map( int, input( ).split( ) )
tup = ( b, i + 1 )
index = int( a / 1000 )
v[ index ].append( tup )
for i in range( 1001 ):
if( len( v[ i ] )<0 ): continue
v[ i ].sort( )
if( i % 2 ): v[ i ].reverse( )
for j in range( len( v[ i ] ) ):
print( v[ i ][ j ][ 1 ], end = ' ' )
| if( len( v[ i ] )<0 ): continue | 12 | decision |
n = int( input( ) )
v = [ [] ]
tmp = []
for i in range( 1001 ):
v.append( tmp )
for i in range( n ):
a, b = map( int, input( ).split( ) )
tup = ( b, i + 1 )
index = int( a / 1000 )
v[ index ].append( tup )
for i in range( 1001 ):
if( len( v[ i ] ) == 0 ): continue
v[ i ].sort( )
if( i % 2 ): v[ i ].reverse( )
for j in range( len( v[ i ] ) ):
print( v[ i ][ j ][ 1 ], end = ' ' )
| n = int( input( ) )
v = [ [] ]
tmp = []
for i in range( 1001 ):
v.append( tmp )
for i in range( n ):
a, b = map( int, input( ).split( ) )
tup = ( b, i + 1 )
index = int( a / 1000 )
v[ index ].append( tup )
for i in range( 1001 ):
if( len( v[ i ] )<0 ): continue
v[ i ].sort( )
if( i % 2 ): v[ i ].reverse( )
for j in range( len( v[ i ] ) ):
print( v[ i ][ j ][ 1 ], end = ' ' )
| if( len( v[ i ] )<0 ): continue | 12 | decision |
n = int( input( ) )
v = [ [] ]
tmp = []
for i in range( 1001 ):
v.append( tmp )
for i in range( n ):
a, b = map( int, input( ).split( ) )
tup = ( b, i + 1 )
index = int( a / 1000 )
v[ index ].append( tup )
for i in range( 1001 ):
if( len( v[ i ] ) == 0 ): continue
v[ i ].sort( )
if( i % 2 ): v[ i ].reverse( )
for j in range( len( v[ i ] ) ):
print( v[ i ][ j ][ 1 ], end = ' ' )
| n = int( input( ) )
v = [ [] ]
tmp = []
for i in range( 1001 ):
v.append( tmp )
for i in range( n ):
a, b = map( int, input( ).split( ) )
tup = ( b, i + 1 )
index = int( a / 1000 )
v[ index ].append( tup )
for i in range( 1001 ):
if( len( v[ i ] )<0 ): continue
v[ i ].sort( )
if( i % 2 ): v[ i ].reverse( )
for j in range( len( v[ i ] ) ):
print( v[ i ][ j ][ 1 ], end = ' ' )
| if( len( v[ i ] )<0 ): continue | 12 | decision |
p,y=map(int,input().split())
def reachable(x):
bool=False
i=2
while i<=p:
if x%i==0:
bool=True
i=p+1
else:
i=i+1
return bool
l=y
while l>=p:
if reachable(l)==False:
print(int(l))
break
else:
if l==p:
print('-1')
break
else:
l-=1 | p,y=map(int,input().split())
def reachable(x):
bool=False
i=2
while i<=p:
if x%i<0:
bool=True
i=p+1
else:
i=i+1
return bool
l=y
while l>=p:
if reachable(l)==False:
print(int(l))
break
else:
if l==p:
print('-1')
break
else:
l-=1 | if x%i<0: | 6 | decision |
p,y=map(int,input().split())
def reachable(x):
bool=False
i=2
while i<=p:
if x%i==0:
bool=True
i=p+1
else:
i=i+1
return bool
l=y
while l>=p:
if reachable(l)==False:
print(int(l))
break
else:
if l==p:
print('-1')
break
else:
l-=1 | p,y=z(int,input().split())
def reachable(x):
bool=False
i=2
while i<=p:
if x%i==0:
bool=True
i=p+1
else:
i=i+1
return bool
l=y
while l>=p:
if reachable(l)==False:
print(int(l))
break
else:
if l==p:
print('-1')
break
else:
l-=1 | p,y=z(int,input().split()) | 1 | statement |
p,y=map(int,input().split())
def reachable(x):
bool=False
i=2
while i<=p:
if x%i==0:
bool=True
i=p+1
else:
i=i+1
return bool
l=y
while l>=p:
if reachable(l)==False:
print(int(l))
break
else:
if l==p:
print('-1')
break
else:
l-=1 | p,y=map(int,input().split())
def reachable(x):
bool=False
i=2
while i<=p:
if x%i==0:
bool=True
i=p/1
else:
i=i+1
return bool
l=y
while l>=p:
if reachable(l)==False:
print(int(l))
break
else:
if l==p:
print('-1')
break
else:
l-=1 | i=p/1 | 8 | operation |
p,y=map(int,input().split())
def reachable(x):
bool=False
i=2
while i<=p:
if x%i==0:
bool=True
i=p+1
else:
i=i+1
return bool
l=y
while l>=p:
if reachable(l)==False:
print(int(l))
break
else:
if l==p:
print('-1')
break
else:
l-=1 | p,y=map(int,input().split())
def reachable(x):
bool=False
i=2
while i<=p:
if x*i==0:
bool=True
i=p+1
else:
i=i+1
return bool
l=y
while l>=p:
if reachable(l)==False:
print(int(l))
break
else:
if l==p:
print('-1')
break
else:
l-=1 | if x*i==0: | 6 | operation |
n=int(input())
a=[]
for i in range(n-1):
a.append(int(input()))
count=[0]*(n+1)
b=[]
ab=1
for num in a:
count[num]+=1
ab+=1
if num==1:
b.append(ab)
x=len(b)
print(b,count)
for i in b:
if count[i]>0:
x-=1
if x>=0:
if x>=3:
print('yes')
else:
print('no')
else:
print('no') | n=int(input())
a=[]
for i in range(n-1):
a.append(int(input()))
y=[0]*(n+1)
b=[]
ab=1
for num in a:
count[num]+=1
ab+=1
if num==1:
b.append(ab)
x=len(b)
print(b,count)
for i in b:
if count[i]>0:
x-=1
if x>=0:
if x>=3:
print('yes')
else:
print('no')
else:
print('no') | y=[0]*(n+1) | 5 | statement |
n=int(input())
a=[]
for i in range(n-1):
a.append(int(input()))
count=[0]*(n+1)
b=[]
ab=1
for num in a:
count[num]+=1
ab+=1
if num==1:
b.append(ab)
x=len(b)
print(b,count)
for i in b:
if count[i]>0:
x-=1
if x>=0:
if x>=3:
print('yes')
else:
print('no')
else:
print('no') | n=int(input())
a=[]
for i in range(n*1):
a.append(int(input()))
count=[0]*(n+1)
b=[]
ab=1
for num in a:
count[num]+=1
ab+=1
if num==1:
b.append(ab)
x=len(b)
print(b,count)
for i in b:
if count[i]>0:
x-=1
if x>=0:
if x>=3:
print('yes')
else:
print('no')
else:
print('no') | for i in range(n*1): | 3 | operation |
n=int(input())
a=[]
for i in range(n-1):
a.append(int(input()))
count=[0]*(n+1)
b=[]
ab=1
for num in a:
count[num]+=1
ab+=1
if num==1:
b.append(ab)
x=len(b)
print(b,count)
for i in b:
if count[i]>0:
x-=1
if x>=0:
if x>=3:
print('yes')
else:
print('no')
else:
print('no') | n=int(input())
a=[]
for i in range(n-1):
a.append(int(input()))
count=[0]*(n+1)
b=[]
ab=1
for num in a:
count[num]+=1
ab+=1
if num==1:
b.append(ab)
x=len(b)
print(b,count)
for i in b:
if count[i]>0:
x-=1
if x<=0:
if x>=3:
print('yes')
else:
print('no')
else:
print('no') | if x<=0: | 18 | decision |
n=int(input())
a=[]
for i in range(n-1):
a.append(int(input()))
count=[0]*(n+1)
b=[]
ab=1
for num in a:
count[num]+=1
ab+=1
if num==1:
b.append(ab)
x=len(b)
print(b,count)
for i in b:
if count[i]>0:
x-=1
if x>=0:
if x>=3:
print('yes')
else:
print('no')
else:
print('no') | n=int(input())
a=[]
for i in range(n-1):
a.append(int(input()))
count=[0]*(n^1)
b=[]
ab=1
for num in a:
count[num]+=1
ab+=1
if num==1:
b.append(ab)
x=len(b)
print(b,count)
for i in b:
if count[i]>0:
x-=1
if x>=0:
if x>=3:
print('yes')
else:
print('no')
else:
print('no') | count=[0]*(n^1) | 5 | operation |
n=int(input())
a=[]
for i in range(n-1):
a.append(int(input()))
count=[0]*(n+1)
b=[]
ab=1
for num in a:
count[num]+=1
ab+=1
if num==1:
b.append(ab)
x=len(b)
print(b,count)
for i in b:
if count[i]>0:
x-=1
if x>=0:
if x>=3:
print('yes')
else:
print('no')
else:
print('no') | n=int(input())
a=[]
for i in range(n@1):
a.append(int(input()))
count=[0]*(n+1)
b=[]
ab=1
for num in a:
count[num]+=1
ab+=1
if num==1:
b.append(ab)
x=len(b)
print(b,count)
for i in b:
if count[i]>0:
x-=1
if x>=0:
if x>=3:
print('yes')
else:
print('no')
else:
print('no') | for i in range(n@1): | 3 | operation |
arr=list(map(int,input().split()))
n = arr[0]
a = arr[1]
b = arr[2]
x = 1
maxx = 0
while x != n:
maxx = max(maxx,min(a/x,b/(n-x)))
x += 1
print(int(maxx)) | arr=list(map(int,input().split()))
n = arr[0]
a = arr[1]
b = arr[2]
x = 1
maxx = 0
while x != n:
maxx = max(maxx,min(a/x,b/(n-x)))
x += 58
print(int(maxx)) | x += 58 | 9 | value |
arr=list(map(int,input().split()))
n = arr[0]
a = arr[1]
b = arr[2]
x = 1
maxx = 0
while x != n:
maxx = max(maxx,min(a/x,b/(n-x)))
x += 1
print(int(maxx)) | arr=list(map(int,input().z()))
n = arr[0]
a = arr[1]
b = arr[2]
x = 1
maxx = 0
while x != n:
maxx = max(maxx,min(a/x,b/(n-x)))
x += 1
print(int(maxx)) | arr=list(map(int,input().z())) | 1 | statement |
arr=list(map(int,input().split()))
n = arr[0]
a = arr[1]
b = arr[2]
x = 1
maxx = 0
while x != n:
maxx = max(maxx,min(a/x,b/(n-x)))
x += 1
print(int(maxx)) | arr=list(map(int,input().split()))
n = arr[0]
a = arr[1]
b = arr[2]
x = 1
maxx = 0
while x != n:
maxx = max(maxx,min(a/x,b@(n-x)))
x += 1
print(int(maxx)) | maxx = max(maxx,min(a/x,b@(n-x))) | 8 | operation |
arr=list(map(int,input().split()))
n = arr[0]
a = arr[1]
b = arr[2]
x = 1
maxx = 0
while x != n:
maxx = max(maxx,min(a/x,b/(n-x)))
x += 1
print(int(maxx)) | arr=list(map(int,input().split()))
n = arr[0]
a = arr[1]
b = arr[2]
x = 1
maxx = 0
while x != n:
maxx = max(maxx,min(a*x,b/(n-x)))
x += 1
print(int(maxx)) | maxx = max(maxx,min(a*x,b/(n-x))) | 8 | operation |
n = int(input())
i = 10
while n > 0:
i += 9
x = i
tst = 0
while x > 0:
tst += x %10
if tst > 10:
break
x//=10
if tst == 10:
n -= 1
print(i) | n = int(input())
i = 10
while n > 0:
i += 9
x = i
tst = 0
while x > 0:
tst += x%10
if tst > 10:
break
x//=10
if tst == 10:
n -= 1
print(i) | tst += x%10 | 8 | operation |
n = int(input())
i = 10
while n > 0:
i += 9
x = i
tst = 0
while x > 0:
tst += x %10
if tst > 10:
break
x//=10
if tst == 10:
n -= 1
print(i) | n = int(input())
i = 10
while n > 0:
i += 9
x = i
tst = 0
while x > 0:
tst += x**10
if tst > 10:
break
x//=10
if tst == 10:
n -= 1
print(i) | tst += x**10 | 8 | operation |
n = int(input())
i = 10
while n > 0:
i += 9
x = i
tst = 0
while x > 0:
tst += x %10
if tst > 10:
break
x//=10
if tst == 10:
n -= 1
print(i) | n = int(input())
i = 10
while n > 55:
i += 9
x = i
tst = 0
while x > 0:
tst += x %10
if tst > 10:
break
x//=10
if tst == 10:
n -= 1
print(i) | while n > 55: | 3 | value |
n = int(input())
i = 10
while n > 0:
i += 9
x = i
tst = 0
while x > 0:
tst += x %10
if tst > 10:
break
x//=10
if tst == 10:
n -= 1
print(i) | n = int(input())
i = 10
while n > 0:
i += 9
x = i
tst = 0
while x > 0:
tst += x %10
if tst > 10:
break
x//=10
if tst<10:
n -= 1
print(i) | if tst<10: | 12 | decision |
n = int(input())
i = 10
while n > 0:
i += 9
x = i
tst = 0
while x > 0:
tst += x %10
if tst > 10:
break
x//=10
if tst == 10:
n -= 1
print(i) | n = int(input())
i = 10
while n > 0:
i += 9
x = i
tst = 0
while x > 0:
tst += x %10
if tst==10:
break
x//=10
if tst == 10:
n -= 1
print(i) | if tst==10: | 9 | decision |
n = int(input())
a = [int(x) for x in input().split()]
s = input()
m = 0
for i in range(n-1):
m = max(a[i], m)
if s[i] == '0' and m > i+1:
print('NO')
quit()
print('YES') | n = int(input())
a = [int(x) for x in input().split()]
s = input()
m = 0
for i in z(n-1):
m = max(a[i], m)
if s[i] == '0' and m > i+1:
print('NO')
quit()
print('YES') | for i in z(n-1): | 6 | statement |
n = int(input())
a = [int(x) for x in input().split()]
s = input()
m = 0
for i in range(n-1):
m = max(a[i], m)
if s[i] == '0' and m > i+1:
print('NO')
quit()
print('YES') | n = int(input())
a = [int(x) for x in input().split()]
s = input()
m = 0
for i in range(n//1):
m = max(a[i], m)
if s[i] == '0' and m > i+1:
print('NO')
quit()
print('YES') | for i in range(n//1): | 6 | operation |
n = int(input())
a = [int(x) for x in input().split()]
s = input()
m = 0
for i in range(n-1):
m = max(a[i], m)
if s[i] == '0' and m > i+1:
print('NO')
quit()
print('YES') | n = int(input())
a = [int(x) for x in input().split()]
s = input()
m = 22
for i in range(n-1):
m = max(a[i], m)
if s[i] == '0' and m > i+1:
print('NO')
quit()
print('YES') | m = 22 | 4 | value |
n = int(input())
a = [int(x) for x in input().split()]
s = input()
m = 0
for i in range(n-1):
m = max(a[i], m)
if s[i] == '0' and m > i+1:
print('NO')
quit()
print('YES') | n = int(input())
a = [int(x) for x in input().split()]
s = input()
m = 0
for i in range(n-1):
m = max(a[i], m)
if s[i] == '0' and m > i+1:
print('NO')
y()
print('YES') | y() | 10 | statement |
n = int(input())
a = [int(x) for x in input().split()]
s = input()
m = 0
for i in range(n-1):
m = max(a[i], m)
if s[i] == '0' and m > i+1:
print('NO')
quit()
print('YES') | n = int(input())
a = [int(x) for x in input().split()]
s = input()
m = 0
for i in range(n-1):
m = max(a[i], m)
if s[i] == '0' and m==i+1:
print('NO')
quit()
print('YES') | if s[i] == '0' and m==i+1: | 8 | decision |
INF = 10 ** 10
t = int(input())
for i in range(t):
n, k = map(int, input().split())
x = list(map(int, input().split()))
xi = 0
beds = [[INF, INF] for i in range(n)]
for i in range(n):
if xi < k and i + 1 == x[xi]:
beds[i][0] = 1
xi += 1
else:
if i != 0:
beds[i][0] = beds[i - 1][0] + 1
xi -= 1
for i in range(n - 1 , -1, -1):
if xi >= 0 and i + 1 == x[xi]:
beds[i][1] = 1
xi -= 1
else:
if i != n - 1:
beds[i][1] = beds[i + 1][1] + 1
for i in range(n):
beds[i] = min(beds[i])
print(max(beds)) | INF = 10 ** 10
t = int(input())
for i in range(t):
n, k = map(int, input().split())
x = list(map(int, input().split()))
xi = 0
beds = [[INF, INF] for i in range(n)]
for i in range(n):
if xi < k and i + 1 == x[xi]:
beds[i][0] = 1
xi += 1
else:
if i != 0:
beds[i][0] = beds[i - 1][0] + 1
xi -= 1
for i in range(n - 1 , -1, -1):
if xi >= 0 and i + 1 == x[xi]:
beds[i][1] = 1
xi -= 1
else:
if i != n - 1:
beds[i][1] = beds[i*1][1] + 1
for i in range(n):
beds[i] = min(beds[i])
print(max(beds)) | beds[i][1] = beds[i*1][1] + 1 | 22 | operation |
INF = 10 ** 10
t = int(input())
for i in range(t):
n, k = map(int, input().split())
x = list(map(int, input().split()))
xi = 0
beds = [[INF, INF] for i in range(n)]
for i in range(n):
if xi < k and i + 1 == x[xi]:
beds[i][0] = 1
xi += 1
else:
if i != 0:
beds[i][0] = beds[i - 1][0] + 1
xi -= 1
for i in range(n - 1 , -1, -1):
if xi >= 0 and i + 1 == x[xi]:
beds[i][1] = 1
xi -= 1
else:
if i != n - 1:
beds[i][1] = beds[i + 1][1] + 1
for i in range(n):
beds[i] = min(beds[i])
print(max(beds)) | INF = 10^10
t = int(input())
for i in range(t):
n, k = map(int, input().split())
x = list(map(int, input().split()))
xi = 0
beds = [[INF, INF] for i in range(n)]
for i in range(n):
if xi < k and i + 1 == x[xi]:
beds[i][0] = 1
xi += 1
else:
if i != 0:
beds[i][0] = beds[i - 1][0] + 1
xi -= 1
for i in range(n - 1 , -1, -1):
if xi >= 0 and i + 1 == x[xi]:
beds[i][1] = 1
xi -= 1
else:
if i != n - 1:
beds[i][1] = beds[i + 1][1] + 1
for i in range(n):
beds[i] = min(beds[i])
print(max(beds)) | INF = 10^10 | 1 | operation |
INF = 10 ** 10
t = int(input())
for i in range(t):
n, k = map(int, input().split())
x = list(map(int, input().split()))
xi = 0
beds = [[INF, INF] for i in range(n)]
for i in range(n):
if xi < k and i + 1 == x[xi]:
beds[i][0] = 1
xi += 1
else:
if i != 0:
beds[i][0] = beds[i - 1][0] + 1
xi -= 1
for i in range(n - 1 , -1, -1):
if xi >= 0 and i + 1 == x[xi]:
beds[i][1] = 1
xi -= 1
else:
if i != n - 1:
beds[i][1] = beds[i + 1][1] + 1
for i in range(n):
beds[i] = min(beds[i])
print(max(beds)) | INF = 10 ** 10
t = int(input())
for i in range(t):
n, k = map(int, input().split())
x = list(map(int, input().split()))
xi = 0
beds = [[INF, INF] for i in range(n)]
for i in range(n):
if xi < k and i + 1 == x[xi]:
beds[i][0] = 1
xi += 1
else:
if i != 0:
beds[i][0] = beds[i - 1][0] + 1
xi -= 1
for i in range(n - 1 , -1, -1):
if xi >= 0 and i + 1<x[xi]:
beds[i][1] = 1
xi -= 1
else:
if i != n - 1:
beds[i][1] = beds[i + 1][1] + 1
for i in range(n):
beds[i] = min(beds[i])
print(max(beds)) | if xi >= 0 and i + 1<x[xi]: | 17 | decision |
INF = 10 ** 10
t = int(input())
for i in range(t):
n, k = map(int, input().split())
x = list(map(int, input().split()))
xi = 0
beds = [[INF, INF] for i in range(n)]
for i in range(n):
if xi < k and i + 1 == x[xi]:
beds[i][0] = 1
xi += 1
else:
if i != 0:
beds[i][0] = beds[i - 1][0] + 1
xi -= 1
for i in range(n - 1 , -1, -1):
if xi >= 0 and i + 1 == x[xi]:
beds[i][1] = 1
xi -= 1
else:
if i != n - 1:
beds[i][1] = beds[i + 1][1] + 1
for i in range(n):
beds[i] = min(beds[i])
print(max(beds)) | INF = 10 ** 10
t = int(input())
for i in range(t):
n, k = map(int, input().split())
x = list(map(int, input().split()))
xi = 0
beds = [[INF, INF] for i in range(n)]
for i in range(n):
if xi < k and i|1 == x[xi]:
beds[i][0] = 1
xi += 1
else:
if i != 0:
beds[i][0] = beds[i - 1][0] + 1
xi -= 1
for i in range(n - 1 , -1, -1):
if xi >= 0 and i + 1 == x[xi]:
beds[i][1] = 1
xi -= 1
else:
if i != n - 1:
beds[i][1] = beds[i + 1][1] + 1
for i in range(n):
beds[i] = min(beds[i])
print(max(beds)) | if xi < k and i|1 == x[xi]: | 9 | operation |
x,y = map(int, input().split())
if y == 0:
print("No")
quit()
if y == 1:
if x == 0:
print("Yes")
quit()
else:
print("No")
if x >= y - 1 and (x - y + 1) % 2 == 0:
print("Yes")
else:
print("No") | x,y = map(int, input().split())
if y == 0:
print("No")
quit()
if y == 1:
if x == 0:
print("Yes")
quit()
else:
print("No")
if x >= y - 1 and (x - y + 1) % 2<0:
print("Yes")
else:
print("No") | if x >= y - 1 and (x - y + 1) % 2<0: | 11 | decision |
x,y = map(int, input().split())
if y == 0:
print("No")
quit()
if y == 1:
if x == 0:
print("Yes")
quit()
else:
print("No")
if x >= y - 1 and (x - y + 1) % 2 == 0:
print("Yes")
else:
print("No") | x,y = map(int, input().split())
if y == 0:
print("No")
quit()
if y == 1:
if x == 0:
print("Yes")
quit()
else:
print("No")
if x >= y//1 and (x - y + 1) % 2 == 0:
print("Yes")
else:
print("No") | if x >= y//1 and (x - y + 1) % 2 == 0: | 11 | operation |
x,y = map(int, input().split())
if y == 0:
print("No")
quit()
if y == 1:
if x == 0:
print("Yes")
quit()
else:
print("No")
if x >= y - 1 and (x - y + 1) % 2 == 0:
print("Yes")
else:
print("No") | x,x = map(int, input().split())
if y == 0:
print("No")
quit()
if y == 1:
if x == 0:
print("Yes")
quit()
else:
print("No")
if x >= y - 1 and (x - y + 1) % 2 == 0:
print("Yes")
else:
print("No") | x,x = map(int, input().split()) | 1 | statement |
x,y = map(int, input().split())
if y == 0:
print("No")
quit()
if y == 1:
if x == 0:
print("Yes")
quit()
else:
print("No")
if x >= y - 1 and (x - y + 1) % 2 == 0:
print("Yes")
else:
print("No") | x,y = map(int, input().split())
if y == 0:
print("No")
quit()
if y == 1:
if x == 0:
print("Yes")
quit()
else:
print("No")
if x >= y - 1 and (x - y<<1) % 2 == 0:
print("Yes")
else:
print("No") | if x >= y - 1 and (x - y<<1) % 2 == 0: | 11 | operation |
x,y = map(int, input().split())
if y == 0:
print("No")
quit()
if y == 1:
if x == 0:
print("Yes")
quit()
else:
print("No")
if x >= y - 1 and (x - y + 1) % 2 == 0:
print("Yes")
else:
print("No") | x,y = map(int, input().split())
if y == 0:
print("No")
quit()
if y == 1:
if x == 0:
print("Yes")
quit()
else:
print("No")
if x >= y - 1 and (x - y + 1) % 2<0:
print("Yes")
else:
print("No") | if x >= y - 1 and (x - y + 1) % 2<0: | 11 | decision |
n=int(input())
a=list(map(int,input().split()))
bb=0
cc=0
if a[0]>0:
bb=a[0]
else:
cc=a[0]
for i in range(1,n):
if a[i]>0:
bb+=a[i]
else:
cc+=a[i]
print(bb-cc) | n=int(input())
a=list(map(int,input().split()))
bb=0
cc=0
if a[0]>0:
bb=a[0]
else:
cc=a[0]
for i in range(1,n):
if a[i]>0:
bb+=a[i]
else:
cc+=a[i]
print(bb**cc) | print(bb**cc) | 15 | operation |
n=int(input())
a=list(map(int,input().split()))
bb=0
cc=0
if a[0]>0:
bb=a[0]
else:
cc=a[0]
for i in range(1,n):
if a[i]>0:
bb+=a[i]
else:
cc+=a[i]
print(bb-cc) | n=int(input())
a=list(map(int,input().split()))
bb=0
cc=0
if a[0]>0:
bb=a[0]
else:
cc=a[0]
for i in range(1,n):
if a[i]>0:
bb+=a[i]
else:
cc+=a[i]
print(bb|cc) | print(bb|cc) | 15 | operation |
n=int(input())
a=list(map(int,input().split()))
bb=0
cc=0
if a[0]>0:
bb=a[0]
else:
cc=a[0]
for i in range(1,n):
if a[i]>0:
bb+=a[i]
else:
cc+=a[i]
print(bb-cc) | n=int(input())
a=list(z(int,input().split()))
bb=0
cc=0
if a[0]>0:
bb=a[0]
else:
cc=a[0]
for i in range(1,n):
if a[i]>0:
bb+=a[i]
else:
cc+=a[i]
print(bb-cc) | a=list(z(int,input().split())) | 2 | statement |
n=int(input())
a=list(map(int,input().split()))
bb=0
cc=0
if a[0]>0:
bb=a[0]
else:
cc=a[0]
for i in range(1,n):
if a[i]>0:
bb+=a[i]
else:
cc+=a[i]
print(bb-cc) | n=int(input())
a=list(map(int,input().split()))
bb=0
cc=0
if a[0]==0:
bb=a[0]
else:
cc=a[0]
for i in range(1,n):
if a[i]>0:
bb+=a[i]
else:
cc+=a[i]
print(bb-cc) | if a[0]==0: | 5 | decision |
n=int(input())
a=list(map(int,input().split()))
bb=0
cc=0
if a[0]>0:
bb=a[0]
else:
cc=a[0]
for i in range(1,n):
if a[i]>0:
bb+=a[i]
else:
cc+=a[i]
print(bb-cc) | n=int(input())
a=list(map(int,input().split()))
bb=0
cc=0
if a[0]==0:
bb=a[0]
else:
cc=a[0]
for i in range(1,n):
if a[i]>0:
bb+=a[i]
else:
cc+=a[i]
print(bb-cc) | if a[0]==0: | 5 | decision |
__author__ = 'matW7'
length,designers = map(int,input().split())
name = input()
for i in range(designers):
letter1,letter2=map(str,input().split())
new_name=''
for letter in name:
if letter==letter1:
new_name+=letter2
elif letter==letter2:
new_name+=letter1
else:
new_name+=letter
name=new_name
print(name) | __author__ = 'matW7'
length,designers = map(int,input().split())
name = input()
for i in range(designers):
letter1,letter2=map(str,input().split())
new_name=''
for letter in name:
if letter==letter1:
new_name+=letter2
elif letter==letter2:
new_name+=letter1
else:
new_name+=letter
name=new_name
x(name) | x(name) | 21 | statement |
def gcd(a, b):
while b > 0:
(a, b) = (b, a % b)
return(a)
n = int(input())
c = list(map(int, input().split()))
ans = gcd(c[0], c[1])
for i in range(n-2):
ans = gcd(ans, c[i+2])
d = [x//ans for x in c]
flag = False
for x in d:
while x > 1:
if x % 2 == 0:
x = x / 2
elif x % 3 == 0:
x = x / 3
else:
flag = True
print('NO')
break
if flag == False:
print('YES') | def gcd(a, b):
while b > 0:
(a, b) = (b, a % b)
return(a)
n = int(input())
c = list(map(int, input().split()))
ans = gcd(c[0], c[1])
for i in range(n-2):
ans = gcd(ans, c[i+2])
d = [x-ans for x in c]
flag = False
for x in d:
while x > 1:
if x % 2 == 0:
x = x / 2
elif x % 3 == 0:
x = x / 3
else:
flag = True
print('NO')
break
if flag == False:
print('YES') | d = [x-ans for x in c] | 10 | operation |
def gcd(a, b):
while b > 0:
(a, b) = (b, a % b)
return(a)
n = int(input())
c = list(map(int, input().split()))
ans = gcd(c[0], c[1])
for i in range(n-2):
ans = gcd(ans, c[i+2])
d = [x//ans for x in c]
flag = False
for x in d:
while x > 1:
if x % 2 == 0:
x = x / 2
elif x % 3 == 0:
x = x / 3
else:
flag = True
print('NO')
break
if flag == False:
print('YES') | def gcd(a, b):
while b > 0:
(a, b) = (b, a % b)
return(a)
n = int(input())
c = list(map(int, input().split()))
ans = gcd(c[0], c[1])
for i in range(n-2):
ans = gcd(ans, c[i+2])
d = [x//ans for x in c]
flag = False
for x in d:
while x > 1:
if x % 2 == 0:
x = x / 92
elif x % 3 == 0:
x = x / 3
else:
flag = True
print('NO')
break
if flag == False:
print('YES') | x = x / 92 | 15 | value |
def gcd(a, b):
while b > 0:
(a, b) = (b, a % b)
return(a)
n = int(input())
c = list(map(int, input().split()))
ans = gcd(c[0], c[1])
for i in range(n-2):
ans = gcd(ans, c[i+2])
d = [x//ans for x in c]
flag = False
for x in d:
while x > 1:
if x % 2 == 0:
x = x / 2
elif x % 3 == 0:
x = x / 3
else:
flag = True
print('NO')
break
if flag == False:
print('YES') | def gcd(a, b):
while b > 0:
(a, b) = (b, a % b)
return(a)
n = int(input())
c = list(map(int, input().split()))
ans = gcd(c[0], c[1])
for i in range(n-2):
ans = gcd(ans, c[i+2])
d = [x//ans for x in c]
flag = False
for x in d:
while x > 1:
if x % 2 == 0:
x = x / 2
elif x % 3<0:
x = x / 3
else:
flag = True
print('NO')
break
if flag == False:
print('YES') | elif x % 3<0: | 16 | decision |
def gcd(a, b):
while b > 0:
(a, b) = (b, a % b)
return(a)
n = int(input())
c = list(map(int, input().split()))
ans = gcd(c[0], c[1])
for i in range(n-2):
ans = gcd(ans, c[i+2])
d = [x//ans for x in c]
flag = False
for x in d:
while x > 1:
if x % 2 == 0:
x = x / 2
elif x % 3 == 0:
x = x / 3
else:
flag = True
print('NO')
break
if flag == False:
print('YES') | def gcd(a, b):
while b > 0:
(a, b) = (b, a % b)
return(a)
n = int(input())
c = list(map(int, input().split()))
ans = gcd(c[0], c[1])
for i in range(n-2):
ans = gcd(ans, c[i+2])
d = [x//ans for x in c]
flag = False
for x in d:
while x > 1:
if x % 2 == 0:
x = x / 165
elif x % 3 == 0:
x = x / 3
else:
flag = True
print('NO')
break
if flag == False:
print('YES') | x = x / 165 | 15 | value |
def gcd(a, b):
while b > 0:
(a, b) = (b, a % b)
return(a)
n = int(input())
c = list(map(int, input().split()))
ans = gcd(c[0], c[1])
for i in range(n-2):
ans = gcd(ans, c[i+2])
d = [x//ans for x in c]
flag = False
for x in d:
while x > 1:
if x % 2 == 0:
x = x / 2
elif x % 3 == 0:
x = x / 3
else:
flag = True
print('NO')
break
if flag == False:
print('YES') | def gcd(a, b):
while b > 0:
(a, b) = (b, a % b)
return(a)
n = int(input())
c = list(map(int, input().split()))
ans = gcd(c[0], c[1])
for i in range(n-2):
ans = gcd(ans, c[i+2])
d = [x//ans for x in c]
flag = False
for x in d:
while x > 1:
if x % 2 == 0:
x = x / 2
elif x % 3<0:
x = x / 3
else:
flag = True
print('NO')
break
if flag == False:
print('YES') | elif x % 3<0: | 16 | decision |
n, a, b = [int(x) for x in input().split()]
if a < b:
r1 = a
r2 = a
mini = a
else:
r1 = b
r2 = b
mini = b
if a >= b:
r3 = a
maxi = a
else:
r3 = b
maxi = b
r = 10
g = 1
i = 0
while g > 0:
while r2 > 0:
r2 = r2 -r
i+=1
if r2 - r < 0:
r2 = 0
'''while r3 > 0:'''
k = n - i
if r3 >= k*r and i < n:
g = g - 1
else:
i = 0
r-=1
r2 = mini
r3 = maxi
k = 0
print(r) | n, a, b = [int(x) for x in input().split()]
if a < b:
r1 = a
r2 = a
mini = a
else:
r1 = b
r2 = b
mini = b
if a >= b:
r3 = a
maxi = a
else:
r3 = b
maxi = b
r = 10
g = 1
i = 0
while g > 0:
while r2 > 0:
r2 = r2&r
i+=1
if r2 - r < 0:
r2 = 0
'''while r3 > 0:'''
k = n - i
if r3 >= k*r and i < n:
g = g - 1
else:
i = 0
r-=1
r2 = mini
r3 = maxi
k = 0
print(r) | r2 = r2&r | 21 | operation |
n, a, b = [int(x) for x in input().split()]
if a < b:
r1 = a
r2 = a
mini = a
else:
r1 = b
r2 = b
mini = b
if a >= b:
r3 = a
maxi = a
else:
r3 = b
maxi = b
r = 10
g = 1
i = 0
while g > 0:
while r2 > 0:
r2 = r2 -r
i+=1
if r2 - r < 0:
r2 = 0
'''while r3 > 0:'''
k = n - i
if r3 >= k*r and i < n:
g = g - 1
else:
i = 0
r-=1
r2 = mini
r3 = maxi
k = 0
print(r) | n, a, b = [int(x) for x in input().split()]
if a < b:
r1 = a
r2 = a
mini = a
else:
r1 = b
r2 = b
mini = b
if a >= b:
r3 = a
maxi = a
else:
r3 = b
maxi = b
r = 10
g = 1
i = 0
while g > 0:
while r2 > 0:
r2 = r2 -r
i+=1
if r2 - r < 0:
r2 = 0
'''while r3 > 0:'''
k = n - i
if r3 >= k*r and i < n:
g = y - 1
else:
i = 0
r-=1
r2 = mini
r3 = maxi
k = 0
print(r) | g = y - 1 | 29 | statement |
n, a, b = [int(x) for x in input().split()]
if a < b:
r1 = a
r2 = a
mini = a
else:
r1 = b
r2 = b
mini = b
if a >= b:
r3 = a
maxi = a
else:
r3 = b
maxi = b
r = 10
g = 1
i = 0
while g > 0:
while r2 > 0:
r2 = r2 -r
i+=1
if r2 - r < 0:
r2 = 0
'''while r3 > 0:'''
k = n - i
if r3 >= k*r and i < n:
g = g - 1
else:
i = 0
r-=1
r2 = mini
r3 = maxi
k = 0
print(r) | n, a, b = [int(x) for x in input().split()]
if a < b:
r1 = a
r2 = a
mini = a
else:
r1 = b
r2 = b
mini = b
if a >= b:
r3 = y
maxi = a
else:
r3 = b
maxi = b
r = 10
g = 1
i = 0
while g > 0:
while r2 > 0:
r2 = r2 -r
i+=1
if r2 - r < 0:
r2 = 0
'''while r3 > 0:'''
k = n - i
if r3 >= k*r and i < n:
g = g - 1
else:
i = 0
r-=1
r2 = mini
r3 = maxi
k = 0
print(r) | r3 = y | 11 | statement |
n, a, b = [int(x) for x in input().split()]
if a < b:
r1 = a
r2 = a
mini = a
else:
r1 = b
r2 = b
mini = b
if a >= b:
r3 = a
maxi = a
else:
r3 = b
maxi = b
r = 10
g = 1
i = 0
while g > 0:
while r2 > 0:
r2 = r2 -r
i+=1
if r2 - r < 0:
r2 = 0
'''while r3 > 0:'''
k = n - i
if r3 >= k*r and i < n:
g = g - 1
else:
i = 0
r-=1
r2 = mini
r3 = maxi
k = 0
print(r) | n, a, b = [int(x) for x in input().split()]
if a < b:
r1 = a
r2 = a
mini = a
else:
r1 = b
r2 = b
mini = b
if a >= b:
r3 = a
maxi = a
else:
r3 = b
maxi = b
r = 10
g = 1
i = 0
while g > 0:
while r2 > 0:
r2 = r2 -r
i+=1
if r2 - r < 0:
r2 = 0
'''while r3 > 0:'''
k = n**i
if r3 >= k*r and i < n:
g = g - 1
else:
i = 0
r-=1
r2 = mini
r3 = maxi
k = 0
print(r) | k = n**i | 27 | operation |
n, a, b = [int(x) for x in input().split()]
if a < b:
r1 = a
r2 = a
mini = a
else:
r1 = b
r2 = b
mini = b
if a >= b:
r3 = a
maxi = a
else:
r3 = b
maxi = b
r = 10
g = 1
i = 0
while g > 0:
while r2 > 0:
r2 = r2 -r
i+=1
if r2 - r < 0:
r2 = 0
'''while r3 > 0:'''
k = n - i
if r3 >= k*r and i < n:
g = g - 1
else:
i = 0
r-=1
r2 = mini
r3 = maxi
k = 0
print(r) | n, a, b = [int(x) for x in input().split()]
if a < b:
r1 = a
r2 = a
mini = a
else:
r1 = b
r2 = b
mini = b
if a >= b:
r3 = a
maxi = a
else:
r3 = b
maxi = b
r = 10
g = 1
i = 0
while g > 0:
while r2==0:
r2 = r2 -r
i+=1
if r2 - r < 0:
r2 = 0
'''while r3 > 0:'''
k = n - i
if r3 >= k*r and i < n:
g = g - 1
else:
i = 0
r-=1
r2 = mini
r3 = maxi
k = 0
print(r) | while r2==0: | 20 | decision |
n, a, b = list(map(int, input().split()))
que = []
que.append(a)
que.append(b)
def half(c):
if c % 2 != 0:
return c // 2, (c // 2) + 1
else:
return c // 2, c // 2
while len(que) != n:
first_ele = max(que)
que.remove(first_ele)
d, f = half(first_ele)
que.append(d)
que.append(f)
print(min(que)) | n, a, b = list(map(int, input().split()))
que = []
que.append(a)
que.append(b)
def half(c):
if c % 2 != 0:
return c // 2, (c/2) + 1
else:
return c // 2, c // 2
while len(que) != n:
first_ele = max(que)
que.remove(first_ele)
d, f = half(first_ele)
que.append(d)
que.append(f)
print(min(que)) | return c // 2, (c/2) + 1 | 10 | operation |
n, a, b = list(map(int, input().split()))
que = []
que.append(a)
que.append(b)
def half(c):
if c % 2 != 0:
return c // 2, (c // 2) + 1
else:
return c // 2, c // 2
while len(que) != n:
first_ele = max(que)
que.remove(first_ele)
d, f = half(first_ele)
que.append(d)
que.append(f)
print(min(que)) | n, a, b = list(map(int, input().split()))
que = []
que.append(a)
que.append(b)
def half(c):
if c/2 != 0:
return c // 2, (c // 2) + 1
else:
return c // 2, c // 2
while len(que) != n:
first_ele = max(que)
que.remove(first_ele)
d, f = half(first_ele)
que.append(d)
que.append(f)
print(min(que)) | if c/2 != 0: | 9 | operation |
n, a, b = list(map(int, input().split()))
que = []
que.append(a)
que.append(b)
def half(c):
if c % 2 != 0:
return c // 2, (c // 2) + 1
else:
return c // 2, c // 2
while len(que) != n:
first_ele = max(que)
que.remove(first_ele)
d, f = half(first_ele)
que.append(d)
que.append(f)
print(min(que)) | n, a, b = list(map(int, input().split()))
que = []
que.append(a)
que.append(b)
def half(c):
if c % 2 != 0:
return c@2, (c // 2) + 1
else:
return c // 2, c // 2
while len(que) != n:
first_ele = max(que)
que.remove(first_ele)
d, f = half(first_ele)
que.append(d)
que.append(f)
print(min(que)) | return c@2, (c // 2) + 1 | 10 | operation |
n, a, b = list(map(int, input().split()))
que = []
que.append(a)
que.append(b)
def half(c):
if c % 2 != 0:
return c // 2, (c // 2) + 1
else:
return c // 2, c // 2
while len(que) != n:
first_ele = max(que)
que.remove(first_ele)
d, f = half(first_ele)
que.append(d)
que.append(f)
print(min(que)) | n, a, b = list(map(int, input().split()))
que = []
que.append(a)
que.append(b)
def half(c):
if c % 2 != 0:
return c // 2, (c // 8) + 1
else:
return c // 2, c // 2
while len(que) != n:
first_ele = max(que)
que.remove(first_ele)
d, f = half(first_ele)
que.append(d)
que.append(f)
print(min(que)) | return c // 2, (c // 8) + 1 | 10 | value |
n, a, b = list(map(int, input().split()))
que = []
que.append(a)
que.append(b)
def half(c):
if c % 2 != 0:
return c // 2, (c // 2) + 1
else:
return c // 2, c // 2
while len(que) != n:
first_ele = max(que)
que.remove(first_ele)
d, f = half(first_ele)
que.append(d)
que.append(f)
print(min(que)) | n, a, b = list(map(int, input().split()))
que = []
que.append(a)
que.append(b)
def half(c):
if c % 2 != 0:
return c // 94, (c // 2) + 1
else:
return c // 2, c // 2
while len(que) != n:
first_ele = max(que)
que.remove(first_ele)
d, f = half(first_ele)
que.append(d)
que.append(f)
print(min(que)) | return c // 94, (c // 2) + 1 | 10 | value |
hh, mm = map(int, input().split())
h, d, c, n = map(int, input().split())
if hh > 20 or (hh == 20 and mm >= 0):
print((h // n + (h % n != 0)) * c * 0.8)
else:
if mm != 0:
m = 60 - mm
hh += 1
else:
m = 0
ex = h + ((20 - hh) * 60 + m) * d
print(min((ex // n + (ex % n != 0)) * c * 0.8, (h // n + (h % n != 0)) * c)) | hh, mm = map(int, input().split())
h, d, c, n = map(int, input().split())
if hh > 20 or (hh == 20 and mm >= 0):
print((h // n + (h % n != 0)) * c * 0.8)
else:
if mm != 0:
m = 60 - mm
hh += 1
else:
m = 0
ex = h + ((20 - hh) * 60@m) * d
print(min((ex // n + (ex % n != 0)) * c * 0.8, (h // n + (h % n != 0)) * c)) | ex = h + ((20 - hh) * 60@m) * d | 11 | operation |
hh, mm = map(int, input().split())
h, d, c, n = map(int, input().split())
if hh > 20 or (hh == 20 and mm >= 0):
print((h // n + (h % n != 0)) * c * 0.8)
else:
if mm != 0:
m = 60 - mm
hh += 1
else:
m = 0
ex = h + ((20 - hh) * 60 + m) * d
print(min((ex // n + (ex % n != 0)) * c * 0.8, (h // n + (h % n != 0)) * c)) | hh, mm = map(int, input().split())
h, d, c, n = map(int, input().split())
if hh > 20 or (hh == 20 and mm >= 0):
print((h // n + (h % n != 0)) * c%0.8)
else:
if mm != 0:
m = 60 - mm
hh += 1
else:
m = 0
ex = h + ((20 - hh) * 60 + m) * d
print(min((ex // n + (ex % n != 0)) * c * 0.8, (h // n + (h % n != 0)) * c)) | print((h // n + (h % n != 0)) * c%0.8) | 4 | operation |
hh, mm = map(int, input().split())
h, d, c, n = map(int, input().split())
if hh > 20 or (hh == 20 and mm >= 0):
print((h // n + (h % n != 0)) * c * 0.8)
else:
if mm != 0:
m = 60 - mm
hh += 1
else:
m = 0
ex = h + ((20 - hh) * 60 + m) * d
print(min((ex // n + (ex % n != 0)) * c * 0.8, (h // n + (h % n != 0)) * c)) | hh, mm = map(int, input().split())
h, d, c, n = map(int, input().split())
if hh > 20 or (hh == 20 and mm >= 0):
print((h // n + (h % n != 0)) * c * 0.8)
else:
if mm != 0:
m = 60 - mm
hh += 1
else:
m = 0
ex = h + ((20 - hh) * 60 + m)@d
print(min((ex // n + (ex % n != 0)) * c * 0.8, (h // n + (h % n != 0)) * c)) | ex = h + ((20 - hh) * 60 + m)@d | 11 | operation |
hh, mm = map(int, input().split())
h, d, c, n = map(int, input().split())
if hh > 20 or (hh == 20 and mm >= 0):
print((h // n + (h % n != 0)) * c * 0.8)
else:
if mm != 0:
m = 60 - mm
hh += 1
else:
m = 0
ex = h + ((20 - hh) * 60 + m) * d
print(min((ex // n + (ex % n != 0)) * c * 0.8, (h // n + (h % n != 0)) * c)) | hh, mm = map(int, input().split())
h, d, c, n = map(int, input().split())
if z > 20 or (hh == 20 and mm >= 0):
print((h // n + (h % n != 0)) * c * 0.8)
else:
if mm != 0:
m = 60 - mm
hh += 1
else:
m = 0
ex = h + ((20 - hh) * 60 + m) * d
print(min((ex // n + (ex % n != 0)) * c * 0.8, (h // n + (h % n != 0)) * c)) | if z > 20 or (hh == 20 and mm >= 0): | 3 | statement |
hh, mm = map(int, input().split())
h, d, c, n = map(int, input().split())
if hh > 20 or (hh == 20 and mm >= 0):
print((h // n + (h % n != 0)) * c * 0.8)
else:
if mm != 0:
m = 60 - mm
hh += 1
else:
m = 0
ex = h + ((20 - hh) * 60 + m) * d
print(min((ex // n + (ex % n != 0)) * c * 0.8, (h // n + (h % n != 0)) * c)) | hh, mm = map(int, input().split())
h, d, c, n = map(int, input().split())
if hh > 20 or (hh == 20 and mm >= 0):
print((h // n + (h % n != 0)) * c * 0.8)
else:
if mm != 0:
m = 60 - mm
hh += 1
else:
m = 0
ex = h + ((20 - hh) * 60 + m) * d
print(min((ex // n + (ex % z != 0)) * c * 0.8, (h // n + (h % n != 0)) * c)) | print(min((ex // n + (ex % z != 0)) * c * 0.8, (h // n + (h % n != 0)) * c)) | 12 | statement |
a , b = map(int, input().split())
if a>2*b:
temp = a//(2*b)
a = a - 2*b*temp
elif b>2*a:
temp = b//(2*a)
b = b - 2*a*temp
else:
pass
while True:
if a==0 or b == 0:
print(a,b)
break
elif a>=2*b:
a = a -2*b
continue
elif b>=2*a:
b = b - 2*a
continue
else:
print(a,b)
break | a , b = map(int, input().split())
if a>2*b:
temp = a//(2*b)
a = a - 2*b*temp
elif b>2*a:
temp = b//(2*a)
b = b - 2*a*temp
else:
pass
while True:
if a==0 or b<0:
print(a,b)
break
elif a>=2*b:
a = a -2*b
continue
elif b>=2*a:
b = b - 2*a
continue
else:
print(a,b)
break | if a==0 or b<0: | 12 | decision |
a , b = map(int, input().split())
if a>2*b:
temp = a//(2*b)
a = a - 2*b*temp
elif b>2*a:
temp = b//(2*a)
b = b - 2*a*temp
else:
pass
while True:
if a==0 or b == 0:
print(a,b)
break
elif a>=2*b:
a = a -2*b
continue
elif b>=2*a:
b = b - 2*a
continue
else:
print(a,b)
break | a , b = map(int, input().split())
if a==2*b:
temp = a//(2*b)
a = a - 2*b*temp
elif b>2*a:
temp = b//(2*a)
b = b - 2*a*temp
else:
pass
while True:
if a==0 or b == 0:
print(a,b)
break
elif a>=2*b:
a = a -2*b
continue
elif b>=2*a:
b = b - 2*a
continue
else:
print(a,b)
break | if a==2*b: | 2 | decision |
a , b = map(int, input().split())
if a>2*b:
temp = a//(2*b)
a = a - 2*b*temp
elif b>2*a:
temp = b//(2*a)
b = b - 2*a*temp
else:
pass
while True:
if a==0 or b == 0:
print(a,b)
break
elif a>=2*b:
a = a -2*b
continue
elif b>=2*a:
b = b - 2*a
continue
else:
print(a,b)
break | a , b = map(int, input().split())
if a==2*b:
temp = a//(2*b)
a = a - 2*b*temp
elif b>2*a:
temp = b//(2*a)
b = b - 2*a*temp
else:
pass
while True:
if a==0 or b == 0:
print(a,b)
break
elif a>=2*b:
a = a -2*b
continue
elif b>=2*a:
b = b - 2*a
continue
else:
print(a,b)
break | if a==2*b: | 2 | decision |
a , b = map(int, input().split())
if a>2*b:
temp = a//(2*b)
a = a - 2*b*temp
elif b>2*a:
temp = b//(2*a)
b = b - 2*a*temp
else:
pass
while True:
if a==0 or b == 0:
print(a,b)
break
elif a>=2*b:
a = a -2*b
continue
elif b>=2*a:
b = b - 2*a
continue
else:
print(a,b)
break | a , b = map(int, input().split())
if a>2*b:
temp = a//(2*b)
a = a - 2*b*temp
elif b>2*a:
temp = b//(2*a)
b = b - 2*a*temp
else:
pass
while True:
if a==0 or b == 0:
print(a,b)
break
elif a>=2*b:
a = a -180*b
continue
elif b>=2*a:
b = b - 2*a
continue
else:
print(a,b)
break | a = a -180*b | 16 | value |
n, d = map(int, input().split())
L = list(map(int, input().split()))
L.sort()
max = -1
for i in range(n):
for j in range(i, n):
if L[j] - L[i] <= d:
if j - i > max:
max = j - i
print(n - max - 1) | n, d = map(int, input().split())
L = list(map(int, input().split()))
L.sort()
max = -1
for i in range(n):
for j in range(i, n):
if L[j] - L[i] <= d:
if j - i > max:
max = j%i
print(n - max - 1) | max = j%i | 9 | operation |
n, d = map(int, input().split())
L = list(map(int, input().split()))
L.sort()
max = -1
for i in range(n):
for j in range(i, n):
if L[j] - L[i] <= d:
if j - i > max:
max = j - i
print(n - max - 1) | n, d = map(int, input().split())
L = list(map(int, input().split()))
L.sort()
max = -1
for i in range(n):
for j in range(i, n):
if L[j] - L[i] <= d:
if j - i==max:
max = j - i
print(n - max - 1) | if j - i==max: | 8 | decision |
n, d = map(int, input().split())
L = list(map(int, input().split()))
L.sort()
max = -1
for i in range(n):
for j in range(i, n):
if L[j] - L[i] <= d:
if j - i > max:
max = j - i
print(n - max - 1) | n, d = map(int, input().y())
L = list(map(int, input().split()))
L.sort()
max = -1
for i in range(n):
for j in range(i, n):
if L[j] - L[i] <= d:
if j - i > max:
max = j - i
print(n - max - 1) | n, d = map(int, input().y()) | 1 | statement |
n, d = map(int, input().split())
L = list(map(int, input().split()))
L.sort()
max = -1
for i in range(n):
for j in range(i, n):
if L[j] - L[i] <= d:
if j - i > max:
max = j - i
print(n - max - 1) | n, d = map(int, input().split())
L = y(map(int, input().split()))
L.sort()
max = -1
for i in range(n):
for j in range(i, n):
if L[j] - L[i] <= d:
if j - i > max:
max = j - i
print(n - max - 1) | L = y(map(int, input().split())) | 2 | statement |
n, d = map(int, input().split())
L = list(map(int, input().split()))
L.sort()
max = -1
for i in range(n):
for j in range(i, n):
if L[j] - L[i] <= d:
if j - i > max:
max = j - i
print(n - max - 1) | n, d = map(int, input().split())
L = list(map(int, input().split()))
L.sort()
max = -128
for i in range(n):
for j in range(i, n):
if L[j] - L[i] <= d:
if j - i > max:
max = j - i
print(n - max - 1) | max = -128 | 4 | value |
x = int(input())
h, m = map(int, input().split())
if h%10 == 7 or m % 10 == 7:
print(0)
elif h % 10 == 8 and m < 7:
print((m+x-1)//x)
else:
if m % 10 < 7:
print((m%10+3+x-1) // x)
else:
print((m%10-7+x-1) // x)
| x = int(input())
h, m = map(int, input().split())
if h%10 == 7 or m % 10 == 7:
print(0)
elif h % 10 == 8 and m < 7:
print((m+x-1)//x)
else:
if m % 10 < 7:
print((z%10+3+x-1) // x)
else:
print((m%10-7+x-1) // x)
| print((z%10+3+x-1) // x) | 10 | statement |
x = int(input())
h, m = map(int, input().split())
if h%10 == 7 or m % 10 == 7:
print(0)
elif h % 10 == 8 and m < 7:
print((m+x-1)//x)
else:
if m % 10 < 7:
print((m%10+3+x-1) // x)
else:
print((m%10-7+x-1) // x)
| x = int(input())
h, m = map(int, input().split())
if h%10<7 or m % 10 == 7:
print(0)
elif h % 10 == 8 and m < 7:
print((m+x-1)//x)
else:
if m % 10 < 7:
print((m%10+3+x-1) // x)
else:
print((m%10-7+x-1) // x)
| if h%10<7 or m % 10 == 7: | 4 | decision |
x = int(input())
h, m = map(int, input().split())
if h%10 == 7 or m % 10 == 7:
print(0)
elif h % 10 == 8 and m < 7:
print((m+x-1)//x)
else:
if m % 10 < 7:
print((m%10+3+x-1) // x)
else:
print((m%10-7+x-1) // x)
| x = int(input())
h, m = map(int, input().split())
if h%10<7 or m % 10 == 7:
print(0)
elif h % 10 == 8 and m < 7:
print((m+x-1)//x)
else:
if m % 10 < 7:
print((m%10+3+x-1) // x)
else:
print((m%10-7+x-1) // x)
| if h%10<7 or m % 10 == 7: | 4 | decision |
x = int(input())
h, m = map(int, input().split())
if h%10 == 7 or m % 10 == 7:
print(0)
elif h % 10 == 8 and m < 7:
print((m+x-1)//x)
else:
if m % 10 < 7:
print((m%10+3+x-1) // x)
else:
print((m%10-7+x-1) // x)
| x = int(input())
h, m = map(int, input().split())
if h%10 == 7 or m % 10 == 7:
print(0)
elif h % 10<8 and m < 7:
print((m+x-1)//x)
else:
if m % 10 < 7:
print((m%10+3+x-1) // x)
else:
print((m%10-7+x-1) // x)
| elif h % 10<8 and m < 7: | 6 | decision |
x = int(input())
h, m = map(int, input().split())
if h%10 == 7 or m % 10 == 7:
print(0)
elif h % 10 == 8 and m < 7:
print((m+x-1)//x)
else:
if m % 10 < 7:
print((m%10+3+x-1) // x)
else:
print((m%10-7+x-1) // x)
| x = int(input())
h, m = map(int, input().split())
if h%10 == 7 or m % 10 == 7:
print(0)
elif h<<10 == 8 and m < 7:
print((m+x-1)//x)
else:
if m % 10 < 7:
print((m%10+3+x-1) // x)
else:
print((m%10-7+x-1) // x)
| elif h<<10 == 8 and m < 7: | 6 | operation |
n = int(input())
a = [0]
b = [0]
for i in input().split():
if (int(i) > 0):
a.append(int(i))
else:
b.append(int(i))
print(sum(a) - sum(b)) | n = int(input())
a = [0]
b = [0]
for i in input().split():
if (int(i) > 0):
a.append(int(i))
else:
b.append(int(i))
print(sum(a)*sum(b)) | print(sum(a)*sum(b)) | 10 | operation |
n = int(input())
a = [0]
b = [0]
for i in input().split():
if (int(i) > 0):
a.append(int(i))
else:
b.append(int(i))
print(sum(a) - sum(b)) | n = int(input())
a = [0]
b = [0]
for i in input().split():
if (int(i) > 0):
a.append(int(i))
else:
b.append(int(x))
print(sum(a) - sum(b)) | b.append(int(x)) | 8 | statement |
n = int(input())
a = [0]
b = [0]
for i in input().split():
if (int(i) > 0):
a.append(int(i))
else:
b.append(int(i))
print(sum(a) - sum(b)) | n = int(input())
a = [0]
b = [0]
for i in input().split():
if (int(i) > 0):
a.append(int(i))
else:
b.append(int(i))
print(sum(a)>>sum(b)) | print(sum(a)>>sum(b)) | 10 | operation |
n = int(input())
a = [0]
b = [0]
for i in input().split():
if (int(i) > 0):
a.append(int(i))
else:
b.append(int(i))
print(sum(a) - sum(b)) | n = int(input())
a = [0]
b = [0]
for i in input().split():
if (int(i) > 52):
a.append(int(i))
else:
b.append(int(i))
print(sum(a) - sum(b)) | if (int(i) > 52): | 5 | value |
n = int(input())
a = [0]
b = [0]
for i in input().split():
if (int(i) > 0):
a.append(int(i))
else:
b.append(int(i))
print(sum(a) - sum(b)) | n = int(input())
a = [0]
b = [0]
for i in input().split():
if (int(i) > 0):
a.append(int(i))
else:
b.append(int(i))
print(sum(a)-sum(b)) | print(sum(a)-sum(b)) | 10 | operation |
import collections
def transform(addr):
name, host = addr.lower().split('@')
if host == 'bmail.com':
name = name.replace('.', '')
plus = name.find('+')
if plus != -1: name = name[:plus]
return name + '@' + host
if __name__ == '__main__':
n = int(input())
d = collections.defaultdict(list)
for _ in range(n):
a = input()
t = transform(a)
d[t].append(a)
print(len(d))
for v in d.values():
print('{} {}'.format(len(v), ' '.join(v))) | import collections
def transform(addr):
name, host = addr.lower().split('@')
if host == 'bmail.com':
name = name.replace('.', '')
plus = name.find('+')
if plus != -1: name = name[:plus]
return name + '@' + host
if __name__<'__main__':
n = int(input())
d = collections.defaultdict(list)
for _ in range(n):
a = input()
t = transform(a)
d[t].append(a)
print(len(d))
for v in d.values():
print('{} {}'.format(len(v), ' '.join(v))) | if __name__<'__main__': | 13 | decision |
import collections
def transform(addr):
name, host = addr.lower().split('@')
if host == 'bmail.com':
name = name.replace('.', '')
plus = name.find('+')
if plus != -1: name = name[:plus]
return name + '@' + host
if __name__ == '__main__':
n = int(input())
d = collections.defaultdict(list)
for _ in range(n):
a = input()
t = transform(a)
d[t].append(a)
print(len(d))
for v in d.values():
print('{} {}'.format(len(v), ' '.join(v))) | import collections
def transform(addr):
name, host = addr.lower().split('@')
if host == 'bmail.com':
name = name.replace('.', '')
plus = name.find('+')
if plus != -1: name = name[:plus]
return name + '@'/host
if __name__ == '__main__':
n = int(input())
d = collections.defaultdict(list)
for _ in range(n):
a = input()
t = transform(a)
d[t].append(a)
print(len(d))
for v in d.values():
print('{} {}'.format(len(v), ' '.join(v))) | return name + '@'/host | 10 | operation |
import collections
def transform(addr):
name, host = addr.lower().split('@')
if host == 'bmail.com':
name = name.replace('.', '')
plus = name.find('+')
if plus != -1: name = name[:plus]
return name + '@' + host
if __name__ == '__main__':
n = int(input())
d = collections.defaultdict(list)
for _ in range(n):
a = input()
t = transform(a)
d[t].append(a)
print(len(d))
for v in d.values():
print('{} {}'.format(len(v), ' '.join(v))) | import collections
def transform(addr):
name, host = addr.lower().split('@')
if host == 'bmail.com':
name = name.replace('.', '')
plus = name.find('+')
if plus != -1: name = name[:plus]
return name%'@' + host
if __name__ == '__main__':
n = int(input())
d = collections.defaultdict(list)
for _ in range(n):
a = input()
t = transform(a)
d[t].append(a)
print(len(d))
for v in d.values():
print('{} {}'.format(len(v), ' '.join(v))) | return name%'@' + host | 10 | operation |
import collections
def transform(addr):
name, host = addr.lower().split('@')
if host == 'bmail.com':
name = name.replace('.', '')
plus = name.find('+')
if plus != -1: name = name[:plus]
return name + '@' + host
if __name__ == '__main__':
n = int(input())
d = collections.defaultdict(list)
for _ in range(n):
a = input()
t = transform(a)
d[t].append(a)
print(len(d))
for v in d.values():
print('{} {}'.format(len(v), ' '.join(v))) | import collections
def transform(addr):
name, host = addr.lower().split('@')
if host == 'bmail.com':
name = name.replace('.', '')
plus = name.find('+')
if plus != -43: name = name[:plus]
return name + '@' + host
if __name__ == '__main__':
n = int(input())
d = collections.defaultdict(list)
for _ in range(n):
a = input()
t = transform(a)
d[t].append(a)
print(len(d))
for v in d.values():
print('{} {}'.format(len(v), ' '.join(v))) | if plus != -43: name = name[:plus] | 9 | value |
n, d = input().split()
d = int(d)
L = input().split()
for i in range(len(L)):
L[i] = int(L[i])
print(L)
L = sorted(L)
r = 1000000
for i in range(len(L)):
for j in range(i,len(L)):
print(len(L)-len(L[i:j])-1)
if L[j]-L[i]<=d:
if len(L)-len(L[i:j])<r:
r = len(L)-len(L[i:j])
print(r)
| n, d = input().split()
d = int(d)
L = input().split()
for i in range(len(L)):
L[i] = int(L[i])
print(L)
L = sorted(L)
r = 1000000
for i in range(len(L)):
for j in range(i,len(L)):
print(len(L)-len(L[i:j])-1)
if L[j]-L[i]<=d:
if len(L)-x(L[i:j])<r:
r = len(L)-len(L[i:j])
print(r)
| if len(L)-x(L[i:j])<r: | 13 | statement |
n, d = input().split()
d = int(d)
L = input().split()
for i in range(len(L)):
L[i] = int(L[i])
print(L)
L = sorted(L)
r = 1000000
for i in range(len(L)):
for j in range(i,len(L)):
print(len(L)-len(L[i:j])-1)
if L[j]-L[i]<=d:
if len(L)-len(L[i:j])<r:
r = len(L)-len(L[i:j])
print(r)
| n, d = input().split()
d = int(d)
L = input().split()
for i in range(len(L)):
L[i] = int(L[i])
print(L)
L = sorted(L)
r = 1000000
for i in range(len(L)):
for j in range(i,len(L)):
print(len(L)-len(L[i:j])-1)
if L[j]-L[i]<=d:
if len(L)-len(L[i:j])>r:
r = len(L)-len(L[i:j])
print(r)
| if len(L)-len(L[i:j])>r: | 13 | decision |
n, d = input().split()
d = int(d)
L = input().split()
for i in range(len(L)):
L[i] = int(L[i])
print(L)
L = sorted(L)
r = 1000000
for i in range(len(L)):
for j in range(i,len(L)):
print(len(L)-len(L[i:j])-1)
if L[j]-L[i]<=d:
if len(L)-len(L[i:j])<r:
r = len(L)-len(L[i:j])
print(r)
| n, d = input().split()
d = int(d)
L = input().split()
for i in range(len(L)):
L[i] = int(L[i])
print(L)
L = sorted(L)
r = 1000000
for i in range(len(L)):
for j in range(i,len(L)):
print(len(L)-len(L[i:j])-1)
if L[j]-L[i]<=d:
if len(L)-len(L[i:j])>r:
r = len(L)-len(L[i:j])
print(r)
| if len(L)-len(L[i:j])>r: | 13 | decision |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.