Tasks Details
hard
Find a path in given matrix, such that the product of all the numbers on the path has the minimal number of trailing zeros.
Task Score
83%
Correctness
100%
Performance
66%
Matrix A, consisting of N rows and N columns of non-negative integers, is given. Rows are numbered from 0 to N−1 (from top to bottom). Columns are numbered from 0 to N−1 (from left to right). We would like to find a path that starts at the upper-left corner (0, 0) and, moving only right and down, finishes at the bottom-right corner (N−1, N−1). Then, all the numbers on this path will be multiplied together.
Find a path such that the product of all the numbers on the path contain the minimal number of trailing zeros. We assume that 0 has 1 trailing zero.
Write a function:
def solution(A)
that, given matrix A, returns the minimal number of trailing zeros.
Examples:
1. Given matrix A below:
the function should return 1. The optimal path is: (0,0) → (0,1) → (0,2) → (1,2) → (2,2) → (2,3) → (3,3). The product of numbers 2, 10, 1, 4, 2, 1, 1 is 160, which has one trailing zero. There is no path that yields a product with no trailing zeros.
2. Given matrix A below:
the function should return 2. One of the optimal paths is: (0,0) → (1,0) → (1,1) → (1,2) → (2,2) → (3,2) → (3,3). The product of numbers 10, 1, 1, 1, 10, 1, 1 is 100, which has two trailing zeros. There is no path that yields a product with fewer than two trailing zeros.
3. Given matrix A below:
the function should return 1. One of the optimal paths is: (0,0) → (0,1) → (1,1) → (1,2) → (2,2). The product of numbers 10, 10, 0, 10, 10 is 0, which has one trailing zero. There is no path that yields a product with no trailing zeros.
Write an efficient algorithm for the following assumptions:
- N is an integer within the range [1..500];
- each element of matrix A is an integer within the range [0..1,000,000,000].
Copyright 2009–2025 by Codility Limited. All Rights Reserved. Unauthorized copying, publication or disclosure prohibited.
Solution
Programming language used Python
Time spent on task 8 minutes
Notes
not defined yet
Code: 21:05:05 UTC,
java,
autosave
Code: 21:05:18 UTC,
py,
autosave
#changing numbers (and if it have zeroes then them are kept)
def change_number(n):
if n==0: return(0)
if (n%10)==0:
zeros=int('1'+zeros_amount(n)*'0')
n=n/zeros
else: zeros=1
if (n%5)==0: n=5
elif (n%2)==0: n=2
else: n=1
return (n*zeros)
#counting amount of zeroes in a number
def zeros_amount(n):
return (len(str(n)) - len(str(n).rstrip('0')))
#finding minimum number with minimum amount of zeroes
def find_min(n,m):
nzeros=zeros_amount(n)
mzeros=zeros_amount(m)
if (nzeros<mzeros): return(n)
elif (nzeros==mzeros) and n<m: return(n)
else: return(m)
def solution(A):
N=len(A)
zero_included=zero=0
#print (A)
#creating 1st line
firstline=A[0]
for x in range(1,N): firstline[x] = change_number(firstline[x-1]) * change_number(firstline[x])
m=1
while m<N:
secondline=A[m]
newline=[]
for x in range(0,N):
secondline[x]=change_number(secondline[x])
if (x==0): newline.append(firstline[0]*secondline[0])
elif (secondline[x]==0):
zero_included=1
newline.append(0)
else:
newline.append(find_min(firstline[x]*secondline[x],secondline[x]*newline[-1]))
firstline=newline
m +=1
result=zeros_amount(firstline[-1])
if zero_included!=0: result=min(result,1)
#print (result)
return(result)
Code: 21:05:46 UTC,
py,
autosave
#changing numbers (and if it have zeroes then them are kept)
def change_number(n):
if n==0: return(0)
zeros=1
if (n%10)==0:
zeros=int('1'+zeros_amount(n)*'0')
n=n/zeros
else: zeros=1
if (n%5)==0: n=5
elif (n%2)==0: n=2
else: n=1
return (n*zeros)
#counting amount of zeroes in a number
def zeros_amount(n):
return (len(str(n)) - len(str(n).rstrip('0')))
#finding minimum number with minimum amount of zeroes
def find_min(n,m):
nzeros=zeros_amount(n)
mzeros=zeros_amount(m)
if (nzeros<mzeros): return(n)
elif (nzeros==mzeros) and n<m: return(n)
else: return(m)
def solution(A):
N=len(A)
zero_included=zero=0
#print (A)
#creating 1st line
firstline=A[0]
for x in range(1,N): firstline[x] = change_number(firstline[x-1]) * change_number(firstline[x])
m=1
while m<N:
secondline=A[m]
newline=[]
for x in range(0,N):
secondline[x]=change_number(secondline[x])
if (x==0): newline.append(firstline[0]*secondline[0])
elif (secondline[x]==0):
zero_included=1
newline.append(0)
else:
newline.append(find_min(firstline[x]*secondline[x],secondline[x]*newline[-1]))
firstline=newline
m +=1
result=zeros_amount(firstline[-1])
if zero_included!=0: result=min(result,1)
#print (result)
return(result)
Code: 21:05:56 UTC,
py,
autosave
#changing numbers (and if it have zeroes then them are kept)
def change_number(n):
if n==0: return(0)
zeros=1
if (n%10)==0:
zeros=int('1'+zeros_amount(n)*'0')
n=n/zeros
if (n%5)==0: n=5
elif (n%2)==0: n=2
else: n=1
return (n*zeros)
#counting amount of zeroes in a number
def zeros_amount(n):
return (len(str(n)) - len(str(n).rstrip('0')))
#finding minimum number with minimum amount of zeroes
def find_min(n,m):
nzeros=zeros_amount(n)
mzeros=zeros_amount(m)
if (nzeros<mzeros): return(n)
elif (nzeros==mzeros) and n<m: return(n)
else: return(m)
def solution(A):
N=len(A)
zero_included=zero=0
#print (A)
#creating 1st line
firstline=A[0]
for x in range(1,N): firstline[x] = change_number(firstline[x-1]) * change_number(firstline[x])
m=1
while m<N:
secondline=A[m]
newline=[]
for x in range(0,N):
secondline[x]=change_number(secondline[x])
if (x==0): newline.append(firstline[0]*secondline[0])
elif (secondline[x]==0):
zero_included=1
newline.append(0)
else:
newline.append(find_min(firstline[x]*secondline[x],secondline[x]*newline[-1]))
firstline=newline
m +=1
result=zeros_amount(firstline[-1])
if zero_included!=0: result=min(result,1)
#print (result)
return(result)
Code: 21:06:27 UTC,
py,
autosave
#minimizing numbers (and if it have zeroes then them are kept)
def change_number(n):
if n==0: return(0)
zeros=1
if (n%10)==0:
zeros=int('1'+zeros_amount(n)*'0')
n=n/zeros
if (n%5)==0: n=5
elif (n%2)==0: n=2
else: n=1
return (n*zeros)
#counting amount of zeroes in a number
def zeros_amount(n):
return (len(str(n)) - len(str(n).rstrip('0')))
#finding minimum number with minimum amount of zeroes
def find_min(n,m):
nzeros=zeros_amount(n)
mzeros=zeros_amount(m)
if (nzeros<mzeros): return(n)
elif (nzeros==mzeros) and n<m: return(n)
else: return(m)
def solution(A):
N=len(A)
zero_included=zero=0
#print (A)
#creating 1st line
firstline=A[0]
for x in range(1,N): firstline[x] = change_number(firstline[x-1]) * change_number(firstline[x])
m=1
while m<N:
secondline=A[m]
newline=[]
for x in range(0,N):
secondline[x]=change_number(secondline[x])
if (x==0): newline.append(firstline[0]*secondline[0])
elif (secondline[x]==0):
zero_included=1
newline.append(0)
else:
newline.append(find_min(firstline[x]*secondline[x],secondline[x]*newline[-1]))
firstline=newline
m +=1
result=zeros_amount(firstline[-1])
if zero_included!=0: result=min(result,1)
#print (result)
return(result)
Code: 21:07:20 UTC,
py,
autosave
#minimizing numbers (and if it have zeroes then them are kept)
def change_number(n):
if n==0: return(0)
zeros=1
if (n%10)==0:
zeros=1'+zeros_amount(n)*'0')
n=n/zeros
if (n%5)==0: n=5
elif (n%2)==0: n=2
else: n=1
return (n*zeros)
#counting amount of zeroes in a number
def zeros_amount(n):
return (len(str(n)) - len(str(n).rstrip('0')))
#finding minimum number with minimum amount of zeroes
def find_min(n,m):
nzeros=zeros_amount(n)
mzeros=zeros_amount(m)
if (nzeros<mzeros): return(n)
elif (nzeros==mzeros) and n<m: return(n)
else: return(m)
def solution(A):
N=len(A)
zero_included=zero=0
#print (A)
#creating 1st line
firstline=A[0]
for x in range(1,N): firstline[x] = change_number(firstline[x-1]) * change_number(firstline[x])
m=1
while m<N:
secondline=A[m]
newline=[]
for x in range(0,N):
secondline[x]=change_number(secondline[x])
if (x==0): newline.append(firstline[0]*secondline[0])
elif (secondline[x]==0):
zero_included=1
newline.append(0)
else:
newline.append(find_min(firstline[x]*secondline[x],secondline[x]*newline[-1]))
firstline=newline
m +=1
result=zeros_amount(firstline[-1])
if zero_included!=0: result=min(result,1)
#print (result)
return(result)
Code: 21:07:30 UTC,
py,
autosave
#minimizing numbers (and if it have zeroes then them are kept)
def change_number(n):
if n==0: return(0)
zeros=1
if (n%10)==0:
zeros=int('1'+zeros_amount(n)*'0')
n=n/zeros
if (n%5)==0: n=5
elif (n%2)==0: n=2
else: n=1
return (n*zeros)
#counting amount of zeroes in a number
def zeros_amount(n):
return (len(str(n)) - len(str(n).rstrip('0')))
#finding minimum number with minimum amount of zeroes
def find_min(n,m):
nzeros=zeros_amount(n)
mzeros=zeros_amount(m)
if (nzeros<mzeros): return(n)
elif (nzeros==mzeros) and n<m: return(n)
else: return(m)
def solution(A):
N=len(A)
zero_included=zero=0
#print (A)
#creating 1st line
firstline=A[0]
for x in range(1,N): firstline[x] = change_number(firstline[x-1]) * change_number(firstline[x])
m=1
while m<N:
secondline=A[m]
newline=[]
for x in range(0,N):
secondline[x]=change_number(secondline[x])
if (x==0): newline.append(firstline[0]*secondline[0])
elif (secondline[x]==0):
zero_included=1
newline.append(0)
else:
newline.append(find_min(firstline[x]*secondline[x],secondline[x]*newline[-1]))
firstline=newline
m +=1
result=zeros_amount(firstline[-1])
if zero_included!=0: result=min(result,1)
#print (result)
return(result)
Code: 21:08:23 UTC,
py,
verify,
result: Passed
#minimizing numbers (and if it have zeroes then them are kept)
def change_number(n):
if n==0: return(0)
zeros=1
if (n%10)==0:
zeros=int('1'+zeros_amount(n)*'0')
n=n/zeros
if (n%5)==0: n=5
elif (n%2)==0: n=2
else: n=1
return (n*zeros)
#counting amount of zeroes in a number
def zeros_amount(n):
return (len(str(n)) - len(str(n).rstrip('0')))
#finding minimum number with minimum amount of zeroes
def find_min(n,m):
nzeros=zeros_amount(n)
mzeros=zeros_amount(m)
if (nzeros<mzeros): return(n)
elif (nzeros==mzeros) and n<m: return(n)
else: return(m)
def solution(A):
N=len(A)
zero_included=zero=0
#print (A)
#creating 1st line
firstline=A[0]
for x in range(1,N): firstline[x] = change_number(firstline[x-1]) * change_number(firstline[x])
m=1
while m<N:
secondline=A[m]
newline=[]
for x in range(0,N):
secondline[x]=change_number(secondline[x])
if (x==0): newline.append(firstline[0]*secondline[0])
elif (secondline[x]==0):
zero_included=1
newline.append(0)
else:
newline.append(find_min(firstline[x]*secondline[x],secondline[x]*newline[-1]))
firstline=newline
m +=1
result=zeros_amount(firstline[-1])
if zero_included!=0: result=min(result,1)
#print (result)
return(result)
Analysis
Code: 21:08:30 UTC,
py,
autosave
#minimizing numbers (and if it have zeroes then them are kept)
def change_number(n):
if n==0: return(0)
zeros=1
if (n%10)==0:
zeros=int('1'+zeros_amount(n)*'0')
n=n/zeros
if (n%5)==0: n=5
elif (n%2)==0: n=2
else: n=1
return (n*zeros)
#counting amount of zeroes in a number
def zeros_amount(n):
return (len(str(n)) - len(str(n).rstrip('0')))
#finding minimum number with minimum amount of zeroes
def find_min(n,m):
nzeros=zeros_amount(n)
mzeros=zeros_amount(m)
if (nzeros<mzeros): return(n)
elif (nzeros==mzeros) and n<m: return(n)
else: return(m)
def solution(A):
N=len(A)
zero_included=zero=0
#creating 1st line
firstline=A[0]
for x in range(1,N): firstline[x] = change_number(firstline[x-1]) * change_number(firstline[x])
m=1
while m<N:
secondline=A[m]
newline=[]
for x in range(0,N):
secondline[x]=change_number(secondline[x])
if (x==0): newline.append(firstline[0]*secondline[0])
elif (secondline[x]==0):
zero_included=1
newline.append(0)
else:
newline.append(find_min(firstline[x]*secondline[x],secondline[x]*newline[-1]))
firstline=newline
m +=1
result=zeros_amount(firstline[-1])
if zero_included!=0: result=min(result,1)
#print (result)
return(result)
Code: 21:08:40 UTC,
py,
autosave
#minimizing numbers (and if it have zeroes then them are kept)
def change_number(n):
if n==0: return(0)
zeros=1
if (n%10)==0:
zeros=int('1'+zeros_amount(n)*'0')
n=n/zeros
if (n%5)==0: n=5
elif (n%2)==0: n=2
else: n=1
return (n*zeros)
#counting amount of zeroes in a number
def zeros_amount(n):
return (len(str(n)) - len(str(n).rstrip('0')))
#finding minimum number with minimum amount of zeroes
def find_min(n,m):
nzeros=zeros_amount(n)
mzeros=zeros_amount(m)
if (nzeros<mzeros): return(n)
elif (nzeros==mzeros) and n<m: return(n)
else: return(m)
def solution(A):
N=len(A)
zero_included=zero=0
#creating 1st line
firstline=A[0]
for x in range(1,N): firstline[x] = change_number(firstline[x-1]) * change_number(firstline[x])
m=1
while m<N:
secondline=A[m]
newline=[]
for x in range(0,N):
secondline[x]=change_number(secondline[x])
if (x==0): newline.append(firstline[0]*secondline[0])
elif (secondline[x]==0):
zero_included=1
newline.append(0)
else:
newline.append(find_min(firstline[x]*secondline[x],secondline[x]*newline[-1]))
firstline=newline
m +=1
result=zeros_amount(firstline[-1])
if zero_included!=0: result=min(result,1)
#print (result)
return(result)
Code: 21:09:08 UTC,
py,
autosave
#minimizing numbers (and if it have zeros then them are kept)
def change_number(n):
if n==0: return(0)
zeros=1
if (n%10)==0:
zeros=int('1'+zeros_amount(n)*'0')
n=n/zeros
if (n%5)==0: n=5
elif (n%2)==0: n=2
else: n=1
return (n*zeros)
#counting amount of zeros in a number
def zeros_amount(n):
return (len(str(n)) - len(str(n).rstrip('0')))
#finding minimum number with minimum amount of zeroes
def find_min(n,m):
nzeros=zeros_amount(n)
mzeros=zeros_amount(m)
if (nzeros<mzeros): return(n)
elif (nzeros==mzeros) and n<m: return(n)
else: return(m)
def solution(A):
N=len(A)
zero_included=zero=0
#creating 1st line
firstline=A[0]
for x in range(1,N): firstline[x] = change_number(firstline[x-1]) * change_number(firstline[x])
m=1
while m<N:
secondline=A[m]
newline=[]
for x in range(0,N):
secondline[x]=change_number(secondline[x])
if (x==0): newline.append(firstline[0]*secondline[0])
elif (secondline[x]==0):
zero_included=1
newline.append(0)
else:
newline.append(find_min(firstline[x]*secondline[x],secondline[x]*newline[-1]))
firstline=newline
m +=1
result=zeros_amount(firstline[-1])
if zero_included!=0: result=min(result,1)
#print (result)
return(result)
Code: 21:09:18 UTC,
py,
autosave
#minimizing numbers (and if it have zeros then them are kept)
def change_number(n):
if n==0: return(0)
zeros=1
if (n%10)==0:
zeros=int('1'+zeros_amount(n)*'0')
n=n/zeros
if (n%5)==0: n=5
elif (n%2)==0: n=2
else: n=1
return (n*zeros)
#counting amount of zeros in a number
def zeros_amount(n):
return (len(str(n)) - len(str(n).rstrip('0')))
#finding minimum number with minimum amount of zeroes
def find_min(n,m):
nzeros, =zeros_amount(n)
mzeros=zeros_amount(m)
if (nzeros<mzeros): return(n)
elif (nzeros==mzeros) and n<m: return(n)
else: return(m)
def solution(A):
N=len(A)
zero_included=zero=0
#creating 1st line
firstline=A[0]
for x in range(1,N): firstline[x] = change_number(firstline[x-1]) * change_number(firstline[x])
m=1
while m<N:
secondline=A[m]
newline=[]
for x in range(0,N):
secondline[x]=change_number(secondline[x])
if (x==0): newline.append(firstline[0]*secondline[0])
elif (secondline[x]==0):
zero_included=1
newline.append(0)
else:
newline.append(find_min(firstline[x]*secondline[x],secondline[x]*newline[-1]))
firstline=newline
m +=1
result=zeros_amount(firstline[-1])
if zero_included!=0: result=min(result,1)
#print (result)
return(result)
Code: 21:09:30 UTC,
py,
autosave
#minimizing numbers (and if it have zeros then them are kept)
def change_number(n):
if n==0: return(0)
zeros=1
if (n%10)==0:
zeros=int('1'+zeros_amount(n)*'0')
n=n/zeros
if (n%5)==0: n=5
elif (n%2)==0: n=2
else: n=1
return (n*zeros)
#counting amount of zeros in a number
def zeros_amount(n):
return (len(str(n)) - len(str(n).rstrip('0')))
#finding minimum number with minimum amount of zeroes
def find_min(n,m):
nzeros, mzeros =zeros_amount(n),zeros_amount(m)
if (nzeros<mzeros): return(n)
elif (nzeros==mzeros) and n<m: return(n)
else: return(m)
def solution(A):
N=len(A)
zero_included=zero=0
#creating 1st line
firstline=A[0]
for x in range(1,N): firstline[x] = change_number(firstline[x-1]) * change_number(firstline[x])
m=1
while m<N:
secondline=A[m]
newline=[]
for x in range(0,N):
secondline[x]=change_number(secondline[x])
if (x==0): newline.append(firstline[0]*secondline[0])
elif (secondline[x]==0):
zero_included=1
newline.append(0)
else:
newline.append(find_min(firstline[x]*secondline[x],secondline[x]*newline[-1]))
firstline=newline
m +=1
result=zeros_amount(firstline[-1])
if zero_included!=0: result=min(result,1)
#print (result)
return(result)
Code: 21:09:40 UTC,
py,
verify,
result: Passed
#minimizing numbers (and if it have zeros then them are kept)
def change_number(n):
if n==0: return(0)
zeros=1
if (n%10)==0:
zeros=int('1'+zeros_amount(n)*'0')
n=n/zeros
if (n%5)==0: n=5
elif (n%2)==0: n=2
else: n=1
return (n*zeros)
#counting amount of zeros in a number
def zeros_amount(n):
return (len(str(n)) - len(str(n).rstrip('0')))
#finding minimum number with minimum amount of zeroes
def find_min(n,m):
nzeros, mzeros =zeros_amount(n),zeros_amount(m)
if (nzeros<mzeros): return(n)
elif (nzeros==mzeros) and n<m: return(n)
else: return(m)
def solution(A):
N=len(A)
zero_included=zero=0
#creating 1st line
firstline=A[0]
for x in range(1,N): firstline[x] = change_number(firstline[x-1]) * change_number(firstline[x])
m=1
while m<N:
secondline=A[m]
newline=[]
for x in range(0,N):
secondline[x]=change_number(secondline[x])
if (x==0): newline.append(firstline[0]*secondline[0])
elif (secondline[x]==0):
zero_included=1
newline.append(0)
else:
newline.append(find_min(firstline[x]*secondline[x],secondline[x]*newline[-1]))
firstline=newline
m +=1
result=zeros_amount(firstline[-1])
if zero_included!=0: result=min(result,1)
#print (result)
return(result)
Analysis
Code: 21:09:49 UTC,
py,
verify,
result: Passed
#minimizing numbers (and if it have zeros then them are kept)
def change_number(n):
if n==0: return(0)
zeros=1
if (n%10)==0:
zeros=int('1'+zeros_amount(n)*'0')
n=n/zeros
if (n%5)==0: n=5
elif (n%2)==0: n=2
else: n=1
return (n*zeros)
#counting amount of zeros in a number
def zeros_amount(n):
return (len(str(n)) - len(str(n).rstrip('0')))
#finding minimum number with minimum amount of zeroes
def find_min(n,m):
nzeros, mzeros =zeros_amount(n),zeros_amount(m)
if (nzeros<mzeros): return(n)
elif (nzeros==mzeros) and n<m: return(n)
else: return(m)
def solution(A):
N=len(A)
zero_included=0
#creating 1st line
firstline=A[0]
for x in range(1,N): firstline[x] = change_number(firstline[x-1]) * change_number(firstline[x])
m=1
while m<N:
secondline=A[m]
newline=[]
for x in range(0,N):
secondline[x]=change_number(secondline[x])
if (x==0): newline.append(firstline[0]*secondline[0])
elif (secondline[x]==0):
zero_included=1
newline.append(0)
else:
newline.append(find_min(firstline[x]*secondline[x],secondline[x]*newline[-1]))
firstline=newline
m +=1
result=zeros_amount(firstline[-1])
if zero_included!=0: result=min(result,1)
#print (result)
return(result)
Analysis
Code: 21:10:03 UTC,
py,
autosave
#minimizing numbers (and if it have zeros then them are kept)
def change_number(n):
if n==0: return(0)
zeros=1
if (n%10)==0:
zeros=int('1'+zeros_amount(n)*'0')
n=n/zeros
if (n%5)==0: n=5
elif (n%2)==0: n=2
else: n=1
return (n*zeros)
#counting amount of zeros in a number
def zeros_amount(n):
return (len(str(n)) - len(str(n).rstrip('0')))
#finding minimum number with minimum amount of zeroes
def find_min(n,m):
nzeros, mzeros =zeros_amount(n),zeros_amount(m)
if (nzeros<mzeros): return(n)
elif (nzeros==mzeros) and n<m: return(n)
else: return(m)
def solution(A):
N=len(A)
zero_included=0
#creating first1st line
firstline=A[0]
for x in range(1,N): firstline[x] = change_number(firstline[x-1]) * change_number(firstline[x])
m=1
while m<N:
secondline=A[m]
newline=[]
for x in range(0,N):
secondline[x]=change_number(secondline[x])
if (x==0): newline.append(firstline[0]*secondline[0])
elif (secondline[x]==0):
zero_included=1
newline.append(0)
else:
newline.append(find_min(firstline[x]*secondline[x],secondline[x]*newline[-1]))
firstline=newline
m +=1
result=zeros_amount(firstline[-1])
if zero_included!=0: result=min(result,1)
#print (result)
return(result)
Code: 21:10:21 UTC,
py,
autosave
#minimizing numbers (and if it have zeros then them are kept)
def change_number(n):
if n==0: return(0)
zeros=1
if (n%10)==0:
zeros=int('1'+zeros_amount(n)*'0')
n=n/zeros
if (n%5)==0: n=5
elif (n%2)==0: n=2
else: n=1
return (n*zeros)
#counting amount of zeros in a number
def zeros_amount(n):
return (len(str(n)) - len(str(n).rstrip('0')))
#finding minimum number with minimum amount of zeroes
def find_min(n,m):
nzeros, mzeros =zeros_amount(n),zeros_amount(m)
if (nzeros<mzeros): return(n)
elif (nzeros==mzeros) and n<m: return(n)
else: return(m)
def solution(A):
N=len(A)
zero_included=0
#creating first 1st line(it is different from other lines
firstline=A[0]
for x in range(1,N): firstline[x] = change_number(firstline[x-1]) * change_number(firstline[x])
m=1
while m<N:
secondline=A[m]
newline=[]
for x in range(0,N):
secondline[x]=change_number(secondline[x])
if (x==0): newline.append(firstline[0]*secondline[0])
elif (secondline[x]==0):
zero_included=1
newline.append(0)
else:
newline.append(find_min(firstline[x]*secondline[x],secondline[x]*newline[-1]))
firstline=newline
m +=1
result=zeros_amount(firstline[-1])
if zero_included!=0: result=min(result,1)
#print (result)
return(result)
Code: 21:10:52 UTC,
py,
autosave
#minimizing numbers (and if it have zeros then them are kept)
def change_number(n):
if n==0: return(0)
zeros=1
if (n%10)==0:
zeros=int('1'+zeros_amount(n)*'0')
n=n/zeros
if (n%5)==0: n=5
elif (n%2)==0: n=2
else: n=1
return (n*zeros)
#counting amount of zeros in a number
def zeros_amount(n):
return (len(str(n)) - len(str(n).rstrip('0')))
#finding minimum number with minimum amount of zeroes
def find_min(n,m):
nzeros, mzeros =zeros_amount(n),zeros_amount(m)
if (nzeros<mzeros): return(n)
elif (nzeros==mzeros) and n<m: return(n)
else: return(m)
def solution(A):
N=len(A)
zero_included=0
#creating first 1st line(it is different from other lines
firstline=A[0]
for x in range(1,N): firstline[x] = change_number(firstline[x-1]) * change_number(firstline[x])
m=1
while m<N:
secondline=A[m]
newline=[]
for x in range(0,N):
secondline[x]=change_number(secondline[x])
if (x==0): newline.append(firstline[0]*secondline[0])
elif (secondline[x]==0):
zero_included=1
newline.append(0)
else:
newline.append(find_min(firstline[x]*secondline[x],secondline[x]*newline[-1]))
firstline=newline
m +=1
#finding
result=zeros_amount(firstline[-1])
if zero_included!=0: result=min(result,1)
#print (result)
return(result)
Code: 21:11:22 UTC,
py,
autosave
#minimizing numbers (and if it have zeros then them are kept)
def change_number(n):
if n==0: return(0)
zeros=1
if (n%10)==0:
zeros=int('1'+zeros_amount(n)*'0')
n=n/zeros
if (n%5)==0: n=5
elif (n%2)==0: n=2
else: n=1
return (n*zeros)
#counting amount of zeros in a number
def zeros_amount(n):
return (len(str(n)) - len(str(n).rstrip('0')))
#finding minimum number with minimum amount of zeroes
def find_min(n,m):
nzeros, mzeros =zeros_amount(n),zeros_amount(m)
if (nzeros<mzeros): return(n)
elif (nzeros==mzeros) and n<m: return(n)
else: return(m)
def solution(A):
N=len(A)
zero_included=0
#creating first 1st line(it is different from other lines
firstline=A[0]
for x in range(1,N): firstline[x] = change_number(firstline[x-1]) * change_number(firstline[x])
m=1
while m<N:
secondline=A[m]
newline=[]
for x in range(0,N):
secondline[x]=change_number(secondline[x])
if (x==0): newline.append(firstline[0]*secondline[0])
elif (secondline[x]==0):
zero_included=1
newline.append(0)
else:
newline.append(find_min(firstline[x]*secondline[x],secondline[x]*newline[-1]))
firstline=newline
m +=1
#finding result(last number in array), and comparing it to 1 if there was t
result=zeros_amount(firstline[-1])
if zero_included!=0: result=min(result,1)
#print (result)
return(result)
Code: 21:11:38 UTC,
py,
autosave
#minimizing numbers (and if it have zeros then them are kept)
def change_number(n):
if n==0: return(0)
zeros=1
if (n%10)==0:
zeros=int('1'+zeros_amount(n)*'0')
n=n/zeros
if (n%5)==0: n=5
elif (n%2)==0: n=2
else: n=1
return (n*zeros)
#counting amount of zeros in a number
def zeros_amount(n):
return (len(str(n)) - len(str(n).rstrip('0')))
#finding minimum number with minimum amount of zeroes
def find_min(n,m):
nzeros, mzeros =zeros_amount(n),zeros_amount(m)
if (nzeros<mzeros): return(n)
elif (nzeros==mzeros) and n<m: return(n)
else: return(m)
def solution(A):
N=len(A)
zero_included=0
#creating first 1st line(it is different from other lines
firstline=A[0]
for x in range(1,N): firstline[x] = change_number(firstline[x-1]) * change_number(firstline[x])
m=1
while m<N:
secondline=A[m]
newline=[]
for x in range(0,N):
secondline[x]=change_number(secondline[x])
if (x==0): newline.append(firstline[0]*secondline[0])
elif (secondline[x]==0):
zero_included=1
newline.append(0)
else:
newline.append(find_min(firstline[x]*secondline[x],secondline[x]*newline[-1]))
firstline=newline
m +=1
#finding result(last number in array), and comparing it to 1 if there was there was 0 element somewhere
result=zeros_amount(firstline[-1])
if zero_included!=0: result=min(result,1)
#print (result)
return(result)
Code: 21:11:48 UTC,
py,
autosave
#minimizing numbers (and if it have zeros then them are kept)
def change_number(n):
if n==0: return(0)
zeros=1
if (n%10)==0:
zeros=int('1'+zeros_amount(n)*'0')
n=n/zeros
if (n%5)==0: n=5
elif (n%2)==0: n=2
else: n=1
return (n*zeros)
#counting amount of zeros in a number
def zeros_amount(n):
return (len(str(n)) - len(str(n).rstrip('0')))
#finding minimum number with minimum amount of zeroes
def find_min(n,m):
nzeros, mzeros =zeros_amount(n),zeros_amount(m)
if (nzeros<mzeros): return(n)
elif (nzeros==mzeros) and n<m: return(n)
else: return(m)
def solution(A):
N=len(A)
zero_included=0
#creating first 1st line(it is different from other lines
firstline=A[0]
for x in range(1,N): firstline[x] = change_number(firstline[x-1]) * change_number(firstline[x])
m=1
while m<N:
secondline=A[m]
newline=[]
for x in range(0,N):
secondline[x]=change_number(secondline[x])
if (x==0): newline.append(firstline[0]*secondline[0])
elif (secondline[x]==0):
zero_included=1
newline.append(0)
else:
newline.append(find_min(firstline[x]*secondline[x],secondline[x]*newline[-1]))
firstline=newline
m +=1
#finding result(last number in array), and comparing it to 1 if there was there was 0 element somewhere
result=zeros_amount(firstline[-1])
if zero_included!=0: result=min(result,1)
return(result)
Code: 21:12:05 UTC,
py,
verify,
result: Passed
#minimizing numbers (and if it have zeros then them are kept)
def change_number(n):
if n==0: return(0)
zeros=1
if (n%10)==0:
zeros=int('1'+zeros_amount(n)*'0')
n=n/zeros
if (n%5)==0: n=5
elif (n%2)==0: n=2
else: n=1
return (n*zeros)
#counting amount of zeros in a number
def zeros_amount(n):
return (len(str(n)) - len(str(n).rstrip('0')))
#finding minimum number with minimum amount of zeroes
def find_min(n,m):
nzeros, mzeros =zeros_amount(n),zeros_amount(m)
if (nzeros<mzeros): return(n)
elif (nzeros==mzeros) and n<m: return(n)
else: return(m)
def solution(A):
N=len(A)
zero_included=0
#creating first 1st line(it is different from other lines
firstline=A[0]
for x in range(1,N): firstline[x] = change_number(firstline[x-1]) * change_number(firstline[x])
m=1
while m<N:
secondline=A[m]
newline=[]
for x in range(0,N):
secondline[x]=change_number(secondline[x])
if (x==0): newline.append(firstline[0]*secondline[0])
elif (secondline[x]==0):
zero_included=1
newline.append(0)
else:
newline.append(find_min(firstline[x]*secondline[x],secondline[x]*newline[-1]))
firstline=newline
m +=1
#finding result(last number in array), and comparing it to 1 if there was there was 0 element somewhere
result=zeros_amount(firstline[-1])
if zero_included!=0: result=min(result,1)
return(result)
Analysis
Code: 21:12:09 UTC,
py,
verify,
result: Passed
#minimizing numbers (and if it have zeros then them are kept)
def change_number(n):
if n==0: return(0)
zeros=1
if (n%10)==0:
zeros=int('1'+zeros_amount(n)*'0')
n=n/zeros
if (n%5)==0: n=5
elif (n%2)==0: n=2
else: n=1
return (n*zeros)
#counting amount of zeros in a number
def zeros_amount(n):
return (len(str(n)) - len(str(n).rstrip('0')))
#finding minimum number with minimum amount of zeroes
def find_min(n,m):
nzeros, mzeros =zeros_amount(n),zeros_amount(m)
if (nzeros<mzeros): return(n)
elif (nzeros==mzeros) and n<m: return(n)
else: return(m)
def solution(A):
N=len(A)
zero_included=0
#creating first 1st line(it is different from other lines
firstline=A[0]
for x in range(1,N): firstline[x] = change_number(firstline[x-1]) * change_number(firstline[x])
m=1
while m<N:
secondline=A[m]
newline=[]
for x in range(0,N):
secondline[x]=change_number(secondline[x])
if (x==0): newline.append(firstline[0]*secondline[0])
elif (secondline[x]==0):
zero_included=1
newline.append(0)
else:
newline.append(find_min(firstline[x]*secondline[x],secondline[x]*newline[-1]))
firstline=newline
m +=1
#finding result(last number in array), and comparing it to 1 if there was there was 0 element somewhere
result=zeros_amount(firstline[-1])
if zero_included!=0: result=min(result,1)
return(result)
Analysis
Code: 21:12:12 UTC,
py,
final,
score:
83
#minimizing numbers (and if it have zeros then them are kept)
def change_number(n):
if n==0: return(0)
zeros=1
if (n%10)==0:
zeros=int('1'+zeros_amount(n)*'0')
n=n/zeros
if (n%5)==0: n=5
elif (n%2)==0: n=2
else: n=1
return (n*zeros)
#counting amount of zeros in a number
def zeros_amount(n):
return (len(str(n)) - len(str(n).rstrip('0')))
#finding minimum number with minimum amount of zeroes
def find_min(n,m):
nzeros, mzeros =zeros_amount(n),zeros_amount(m)
if (nzeros<mzeros): return(n)
elif (nzeros==mzeros) and n<m: return(n)
else: return(m)
def solution(A):
N=len(A)
zero_included=0
#creating first 1st line(it is different from other lines
firstline=A[0]
for x in range(1,N): firstline[x] = change_number(firstline[x-1]) * change_number(firstline[x])
m=1
while m<N:
secondline=A[m]
newline=[]
for x in range(0,N):
secondline[x]=change_number(secondline[x])
if (x==0): newline.append(firstline[0]*secondline[0])
elif (secondline[x]==0):
zero_included=1
newline.append(0)
else:
newline.append(find_min(firstline[x]*secondline[x],secondline[x]*newline[-1]))
firstline=newline
m +=1
#finding result(last number in array), and comparing it to 1 if there was there was 0 element somewhere
result=zeros_amount(firstline[-1])
if zero_included!=0: result=min(result,1)
return(result)Analysis summary
The following issues have been detected: timeout errors.
Analysis
Detected time complexity:
O(N**2*log(max(max(A))))
expand all
Correctness tests
1.
0.036 s
OK
2.
0.036 s
OK
3.
0.036 s
OK
1.
0.036 s
OK
2.
0.036 s
OK
3.
0.036 s
OK
4.
0.036 s
OK
5.
0.036 s
OK
1.
0.036 s
OK
2.
0.036 s
OK
3.
0.036 s
OK
4.
0.036 s
OK
5.
0.036 s
OK
6.
0.036 s
OK
7.
0.036 s
OK
8.
0.036 s
OK
9.
0.036 s
OK
1.
0.036 s
OK
2.
0.040 s
OK
3.
0.040 s
OK
1.
0.036 s
OK
2.
0.036 s
OK
3.
0.036 s
OK
4.
0.036 s
OK
1.
0.036 s
OK
2.
0.036 s
OK
3.
0.036 s
OK
4.
0.036 s
OK
1.
0.036 s
OK
2.
0.036 s
OK
3.
0.036 s
OK
1.
0.036 s
OK
2.
0.036 s
OK
3.
0.036 s
OK
4.
0.036 s
OK
5.
0.036 s
OK
6.
0.036 s
OK
7.
0.036 s
OK
8.
0.036 s
OK
9.
0.036 s
OK
1.
0.036 s
OK
2.
0.036 s
OK
3.
0.036 s
OK
expand all
Performance tests
1.
0.036 s
OK
1.
0.036 s
OK
2.
0.048 s
OK
3.
0.088 s
OK
1.
0.072 s
OK
big_zero_result
all elements in A are neither dividable by 2 or 5; length of A is close to 500
all elements in A are neither dividable by 2 or 5; length of A is close to 500
✔
OK
1.
0.080 s
OK
2.
0.212 s
OK
3.
0.456 s
OK
4.
0.736 s
OK
5.
1.188 s
OK
big_all_dividable
all elements in A are dividable by either power of 2 or 5; length of A is close to 500
all elements in A are dividable by either power of 2 or 5; length of A is close to 500
✔
OK
1.
0.084 s
OK
2.
0.252 s
OK
3.
0.504 s
OK
4.
1.100 s
OK
5.
1.944 s
OK
1.
1.416 s
OK
2.
1.412 s
OK
3.
1.472 s
OK
4.
1.460 s
OK
5.
1.412 s
OK
big_corner_cases
tests with corner cases values, maximal A size
tests with corner cases values, maximal A size
✘
TIMEOUT ERROR
Killed. Hard limit reached: 11.000 sec.
Killed. Hard limit reached: 11.000 sec.
1.
11.000 s
TIMEOUT ERROR,
Killed. Hard limit reached: 11.000 sec.
2.
0.340 s
OK
big_exact_result
tests with defined result; length of A is close to 500
tests with defined result; length of A is close to 500
✘
TIMEOUT ERROR
running time: 2.652 sec., time limit: 2.528 sec.
running time: 2.652 sec., time limit: 2.528 sec.
1.
0.120 s
OK
2.
0.112 s
OK
3.
0.084 s
OK
4.
0.432 s
OK
5.
0.412 s
OK
6.
0.316 s
OK
7.
1.084 s
OK
8.
1.044 s
OK
9.
0.856 s
OK
10.
2.652 s
TIMEOUT ERROR,
running time: 2.652 sec., time limit: 2.528 sec.
11.
2.160 s
OK
12.
1.868 s
OK
13.
4.288 s
TIMEOUT ERROR,
running time: 4.288 sec., time limit: 3.536 sec.
14.
4.040 s
TIMEOUT ERROR,
running time: 4.040 sec., time limit: 3.344 sec.
15.
3.484 s
OK
alternating_diagonals_2_5
alternating diagonals consist of 2 or 5
alternating diagonals consist of 2 or 5
✘
TIMEOUT ERROR
running time: 3.420 sec., time limit: 3.200 sec.
running time: 3.420 sec., time limit: 3.200 sec.
1.
3.420 s
TIMEOUT ERROR,
running time: 3.420 sec., time limit: 3.200 sec.