Plant Growth Calculation

Plant Growth Calculation

In a matrix containing R rows and C columns, various plants are planted. The growth of a given plant in a calendar month depends on it's current height at the beginning of the month. If the current height is a prime number, the height by which the plant grows in that month is equal to the current height minus previous prime number (If there is no previous prime number consider the previous prime number as zero). If the current height is not a prime number then the height by which the plant grows in that month is equal to the sum of the unit digits of the adjacent plants height at the beginning of the month (If there is no adjacent plant to left or right consider the value as zero). Given the current height of the plants at the beginning of first month, print the height of the plants after N months. 

Input Format: 

The first line contains R and C separated by a space. Next R lines contains C values representing the height of the plants (with the values separated by a space). Last line contains N. 

Output Format: 

R lines containing C values denoting the height of the plants after N months (with the values separated by a space). 

Boundary Conditions: 

1 <= R, C <= 999 

1 <= N <= 100 

1 <= Initial height of the plants <= 100 

Example Input/Output 1: 

Input: 

3 3 

1 2 4 

6 1 11 

5 7 12 

2 

Output: 

4 13 10

9 20 23 

9 25 21 

Explanation: 

After the 1st month, the height of the plants will be 

3 4 6 

7 8 15 

7 9 19 

After 2nd month, the height of the plants will be 

4 13 10 

9 20 23 

9 25 21

Program:

def isprime(x): 
    if x == 1:
        return 0
    for i in range(2, int(x**0.5)+1): 
        if x%i==0:
            return 0 
    return 1        

n,m = map(int,input().split())
l = [] 
for i in range(n): 
    l.append(list(map(int,input().split())))
k = int(input()) 
for i in range(k): 
    q = []
    for j in range(n): 
        w = []
        for z in range(m): 
            if isprime(l[j][z]): 
                prevprime = l[j][z] - 1 
                while prevprime >0 and not isprime(prevprime):
                    prevprime -= 1 
                w.append(l[j][z] + (l[j][z] - prevprime))
            else: 
                sum_adj = 0 
                if z-1 >= 0:
                    sum_adj += l[j][z-1] % 10 
                if z + 1 < m: 
                    sum_adj += l[j][z+1] % 10 
                w.append(l[j][z] + sum_adj)
        q.append(w)
    l = q.copy()  

for i in l:
    print(*i)

Comments

Post a Comment

Popular posts from this blog

Pronic Integers in N - InfyTQ question

Pronic Integers in N - InfyTQ question Problem:  The program must accept an integer N as the input. The program must print all the pronic integers formed by a series of continuously occurring digits (in the same order) in N as the output. The pronic integers can be represented as n*(n+1). Input:  93042861 Output: 930 30 0 42 2 6 Program: import math  s = input().strip() def check_pronic(num):      sq = math.floor(math.sqrt(num))      return (sq*(sq+1)) == num  l = []   for i in range(len(s)):      for j in range(i,len(s)):          substr = int(s[i:j+1])          if s[i:j+1] == "0":             l.append(substr)         elif s[i:j+1][0]!='0' and check_pronic(substr):             l.append(substr)  print(*l)             Expl...
Read more

Count Strong Points - Accenture

 Count Strong Points - Accenture Problem: The program must accept an integer matrix of size RxC as the input. The program must print the number of strong points in the given matrix as the output. The strong points are located at the element(s) whose all the surrounding elements are smaller than the given element. Input:  3 3  56 92 45  19 41 51  55 31 80 Output: 3  Program: n,m = map(int,input().split()) l = []  for i in range(n):      l.append(list(map(int,input().split()))) count = 0      for i in range(n):      for j in range(m):         c = 0         if i-1 >= 0 and l[i-1][j] >= l[i][j]:             c = 1          if i+1 < n and l[i+1][j] >= l[i][j]:              c = 1          if j-1 >= 0 and l[i][j-1] >= l[i][j]:     ...
Read more

Letters at position of multiples of a number

Letters at position of multiples of a number   Problem: A string of length L consists of characters is passed as input to the program. A given number N is also passed as the input to the program. The program must print the characters at the positions which are multiples of the given number.  Input Format:  The first line will contain the string of length L.  The second line will contain the number N.  Boundary Conditions:  3 <= L <= 50  1 <= N <= 30  Output Format:  The characters at the positions which are multiples of the given number.  Example Input/Output 1:  Input:  abcdef  3  Output:  cf  Explanation:  Multiples of 3 are like 3,6,9,... So the characters at positions 3,6 namely c and f are printed as output.  Example Input/Output 2:  Input:  environment  2  Output:  niomn  Explanation:  As it must be multiples of 2, the characters at even pos...
Read more