primes__galore | IITM OPPE-2 March 2022 #python #OPPE

primes__galore | IITM OPPE-2 March 2022

[NitinSingh-wqxg]

can you check my code:


def prime(n):
count = 0
for i in range(1, n):
if n%i==0:
count+=1

if (count==1):
return 1
else:
return 0


def primes_galore(L):
s=0
x=0
for i in range(len(L)):
if prime(i)==1:
x=L[i]
if prime(x)==1:
s+=1

return s

[devloper_hs]

Buddy, i guess we can use fn to solve this, it will be much easier, if we can use 2 fn to check 2 things using same fn. Nice work btw

[NitinSingh-wqxg]

bro great save, I would not have done anything after the frustration.

[gkumar]

Can you help with the below one if possible?
Accept two positive integers aa and bb as arguments and print a rectangular pattern that has aa lines. The first and last line should have bb stars, all other lines should have exactly two stars that are aligned with either end of the rectangle. You can assume that a, b \geq 2a, b≥2 for all test cases

[gkumar]

Hats off to the great presence of mind in the end! Is it possible to know where exactly was it going wrong in the initial program ?