Photo
cliquez pour afficher
1.4K · cliquez pour afficher
def MathChallenge(num):
coins = [1, 5, 7, 9, 11]
dp = [float('inf')] * (num + 1)
dp[0] = 0
for i in range(1, num + 1):
for coin in coins:
if i >= coin:
dp[i] = min(dp[i], dp[i - coin] + 1)
return dp[num]
AssestSense✅
//q2
3 · 1.5K · def ArrayChallenge(strArr):
s1, s2 = strArr[0], strArr[1]
n, m = len(s1), len(s2)
dp = [[0] * (m + 1) for _ in range(n + 1)]
for i in range(1, n + 1):
for j in range(1, m + 1):
if s1[i - 1] == s2[j - 1]:
dp[i][j] = dp[i - 1][j - 1] + 1
else:
dp[i][j] = max(dp[i - 1][j], dp[i][j - 1])
return dp[n][m]
AssestSense ✅
//q1
2 · 1.6K · Deloitte | COGNIZANT | IBM | CAPGEMINI
Photo
cliquez pour afficher
cliquez pour afficher
Photo
cliquez pour afficher
cliquez pour afficher
IBM✅✅
2.1K · Deloitte | COGNIZANT | IBM | CAPGEMINI
import math
def is_possible(K, houses, H):
total_time = 0
for house in houses:
total_time += math.ceil(house / K)
return total_time <= H
def find_min_K(n, H, houses):
low = 1
high = max(houses)
answer = high
while low <= high:
mid = (low + high) // 2
if is_possible(mid, houses, H):
answer = mid
high = mid - 1
else:
low = mid + 1
return answer
n, H = map(int, input().split())
houses = list(map(int, input().split()))
print(find_min_K(n, H, houses))
q1
//quantiphi✅
1.3K · def max_points(points):
n = len(points)
if n == 0:
return 0
if n == 1:
return points[0]
dp = [0] * n
dp[0] = points[0]
dp[1] = max(points[0], points[1])
for i in range(2, n):
dp[i] = max(dp[i-1], points[i] + dp[i-2])
return dp[-1]
n = int(input())
points = list(map(int, input().split()))
print(max_points(points))
q2
//quantiphi ✅
1.2K · import heapq
from collections import defaultdict
def solve(n, m, k, treasures, bridges, queries):
graph = defaultdict(list)
for u, v, w in bridges:
graph[u - 1].append((v - 1, w))
results = []
for start, end in queries:
start -= 1
end -= 1
pq = [(-treasures[start], 0, start)]
visited = {}
while pq:
neg_tres, time, node = heapq.heappop(pq)
total_treasure = -neg_tres
if node == end:
results.append((total_treasure, time))
break
if node in visited and visited[node] >= total_treasure:
continue
visited[node] = total_treasure
for nei, wt in graph[node]:
if nei not in visited or visited[nei] < total_treasure + treasures[nei]:
heapq.heappush(pq, (-(total_treasure + treasures[nei]), time + wt, nei))
return results
n, m, k = map(int, input().split())
treasures = list(map(int, input().split()))
bridges = [tuple(map(int, input().split())) for _ in range(m)]
queries = [tuple(map(int, input().split())) for _ in range(k)]
result = solve(n, m, k, treasures, bridges, queries)
for treasure, time in result:
print(treasure, time)
q3
//quantiphi ✅
1.8K ·