Deloitte | PWC | ATS resumes | Wipro | Infosys | Accenture | Capegemini | job links

Infosys codes❤️ 1) Army invasion 2) Disturbuting books 3) Count subtree factors code 4) Task management Contact @placementsBro😎 All test cases passed✅ https://t.me/Infycodes

vol of cylinder

def count_not_divisible(K, L, R):     def sieve_of_eratosthenes(n):         is_prime = [True] * (n + 1)         primes = []         for p in range(2, n + 1):             if is_prime[p]:                 primes.append(p)                 for multiple in range(p * p, n + 1, p):                     is_prime[multiple] = False         return primes     def count_divisible_up_to(x, primes):         from itertools import combinations         count = 0         for i in range(1, len(primes) + 1):             for comb in combinations(primes, i):                 lcm = 1                 for num in comb:                     lcm *= num                     if lcm > x:                         break                 if lcm > x:                     continue                 if i % 2 == 1:                     count += x // lcm                 else:                     count -= x // lcm         return count     def count_not_divisible_up_to(x, primes):         if x == 0:             return 0         return x - count_divisible_up_to(x, primes)     L = int(L)     R = int(R)     primes = sieve_of_eratosthenes(K)         count_R = count_not_divisible_up_to(R, primes)     count_L_minus_1 = count_not_divisible_up_to(L - 1, primes)     return count_R - count_L_minus_1 K = int(input().strip()) L = input().strip() R = input().strip() result = count_not_divisible(K, L, R) print(result) Divisible string ✅ Infosys

Take management code done

from collections import defaultdict, deque def dfs_count(node, parent, adj, A, mod_target): count = 0 stack = [(node, parent)] while stack: current, parent = stack.pop() if A[current] % 3 == mod_target: count += 1 for neighbor in adj[current]: if neighbor != parent: stack.append((neighbor, current)) return count def solve(N, M, A, E, Q, Queries): adj = defaultdict(list) for u, v in E: adj[u-1].append(v-1) adj[v-1].append(u-1) total_result = 0 for query in Queries: if query[0] == 1: _, U, X = query U -= 1 A[U] = X elif query[0] == 2: _, U, X = query U -= 1 mod_target = X % 3 count = dfs_count(U, -1, adj, A, mod_target) total_result += count return total_result % (10**9 + 7) Path Queries On MOD Share our channel https://t.me/Infycodes

Be ready for codes✅

Infosys exam Answer's https://t.me/Infycodes

Last call for techm ✅