Please open Telegram to view this post
VIEW IN TELEGRAM
Please open Telegram to view this post
VIEW IN TELEGRAM
n = int(input())
a = list(map(int, input().split()))
s_pos = 1
l_pos = 1
s = a[0]
l = a[0]
for i in range(1, n):
if a[i] < s:
s = a[i]
s_pos = i + 1
if a[i] > l:
l = a[i]
l_pos = i + 1
print(s_pos, l_pos)
Smallest element in array
Please open Telegram to view this post
VIEW IN TELEGRAM
def f_p(s, e):
return [n for n in range(max(2, s + 1), e) if all(n % i != 0 for i in range(2, int(n**0.5) + 1))]
import sys
s, e = map(int, sys.stdin.read().split())
print(f_p(s, e))
Prime number bw two numbers// Accenture
Please open Telegram to view this post
VIEW IN TELEGRAM
Accenture π― {2pm}
All MCQs & coding are done β
Round 1& Round 2 Clearedπ£ βΆοΈ
Test accomplished βΊοΈ
-@mrtrueliving_ixβοΈ
-@mrtrueliving_ixβοΈ
All placement help available
#Accenture #PADA #offcampus
All MCQs & coding are done β
Round 1& Round 2 Cleared
Test accomplished βΊοΈ
-@mrtrueliving_ix
-@mrtrueliving_ix
All placement help available
#Accenture #PADA #offcampus
7 pm slots are available
Please open Telegram to view this post
VIEW IN TELEGRAM
Please open Telegram to view this post
VIEW IN TELEGRAM