def getMaxEfficiency(arrivalTime):
    arrivalTime.sort()
    n = len(arrivalTime)
    max_efficiency = float('-inf')
    
    i = 0
    for j in range(n):
        tested_cases = j - i + 1
        active_time = arrivalTime[j] - arrivalTime[i]
        efficiency = tested_cases - active_time
        
        max_efficiency = max(max_efficiency, efficiency)

        while active_time >= tested_cases:
            i += 1
            active_time = arrivalTime[j] - arrivalTime[i]
            tested_cases = j - i + 1

    return max_efficiency
 

IBM

def sum_pf(n):
    s = 0
    f = 2
    if n % f == 0:
        s += f
        while n % f == 0:
            n //= f
    for f in range(3, int(n**0.5) + 1, 2):
        if n % f == 0:
            s += f
            while n % f == 0:
                n //= f
    if n > 2:
        s += n
    return s

n = int(input())
print(sum_pf(n))

Sum of prime factors // HSBC

Spinny hiring Business Analyst

0-1 year experience
Upto 8 LPA expected

Join Telegram : https://t.me/code_alphix

https://cuvette.tech/app/other-jobs/66faa15a40c8c4972292bf86?referralCode=GEA52O

https://docs.google.com/forms/d/e/1FAIpQLSd7no8gFu608o_Hs_8KL5grWMHVrsBcuZL46KsUHD-2BP0Ydg/viewform


From 21 to 2024 batch

SELECT l.id, l.title, l.rating, l.year
FROM library l
JOIN (
    SELECT year, MAX(rating) AS max_rating
    FROM library
    GROUP BY year
) AS year_max
ON l.year = year_max.year AND l.rating = year_max.max_rating
ORDER BY l.year ASC;

Book of the year // fractal