fork download
  1. def main():
  2. def isPrime(n):
  3. if n <= 1: return False
  4. if n == 2 or n == 3: return True
  5. prime = True
  6. i = 2
  7. while i * i <= n and prime is True:
  8. prime = (n % i) != 0
  9. i += 1
  10. return prime
  11.  
  12. n = int(input("n="))
  13. m = int(input("m="))
  14. matrix = [[0 for j in range(0,m)] for i in range(0,n+1)]
  15. for i in range(0,n):
  16. for j in range(0,m):
  17. matrix[i][j] = int(input("elem="))
  18. for i in range(0,n):
  19. for j in range(0,m):
  20. print(matrix[i][j], end=" ")
  21. print()
  22.  
  23. for i in range(0, n):
  24. for j in range(0,m):
  25. if not(matrix[i][j]&1):
  26. print("matrix[%d][%d] = %d"%(i,j,matrix[i][j]), end ="\n")
  27. for k in range(2, matrix[i][j]//2+1):
  28. if isPrime(k) is True and isPrime(matrix[i][j]-k) is True:
  29. print("%d = %d + %d "%(matrix[i][j], k, matrix[i][j] - k), end="\n")
  30.  
  31. main()
  32. # your code goes here
Success #stdin #stdout 0.04s 9680KB
stdin
2
3
12  
346 
789
44    
7   
82
stdout
n=m=elem=elem=elem=elem=elem=elem=12 346 789 
44 7 82 
matrix[0][0] = 12
12 = 5 + 7 
matrix[0][1] = 346
346 = 29 + 317 
346 = 53 + 293 
346 = 83 + 263 
346 = 89 + 257 
346 = 107 + 239 
346 = 113 + 233 
346 = 149 + 197 
346 = 167 + 179 
346 = 173 + 173 
matrix[1][0] = 44
44 = 3 + 41 
44 = 7 + 37 
44 = 13 + 31 
matrix[1][2] = 82
82 = 3 + 79 
82 = 11 + 71 
82 = 23 + 59 
82 = 29 + 53 
82 = 41 + 41