ComDoc ComDoc

Pico W onboard LED not working import machine import utime led_onboard = machine.Pin("LED", machine.Pin.OUT) while True: led_onboard.toggle() utime.sleep(.5) https://datasheets.raspberrypi.com/picow/connecting-to-the-internet-with-pico-w.pdf 3.4. The on-board LED Unlike the original Raspberry Pi Pico, the on-board LED on Pico W is not connected to a pin on RP2040, but instead to a GPIO pin on th..

https://school.programmers.co.kr/learn/courses/30/lessons/136798 파이썬 약수는 제곱근(루트)를 이용해서 계산을 줄일 수 있다. def solution(number, limit, power): answer = 0 for i in range(1, number + 1): sqrt_i = i ** .5 count = sum(1 for j in range(1, int(sqrt_i) + 1) if i % j == 0) * 2 - (0 if sqrt_i % 1 else 1) answer += power if limit < count else count return answer 코틀린 class Solution { fun solution(number: Int, lim..

https://school.programmers.co.kr/learn/courses/30/lessons/12942 def solution(matrix_sizes): table = [[0 for _ in matrix_sizes] for _ in matrix_sizes] for i in range(1, len(matrix_sizes)): for j in range(len(matrix_sizes) - i): k = j + i table[j][k] = min( table[j][m] + table[m + 1][k] + matrix_sizes[j][0] * matrix_sizes[m][1] * matrix_sizes[k][1] for m in range(j, k)) return table[0][-1]

https://school.programmers.co.kr/learn/courses/30/lessons/118669 다익스트라 알고리듬의 변형이다. from collections import defaultdict from heapq import heappop, heappush def solution(n, paths, gates, summits): summits_set = set(summits) graph = defaultdict(list) for i, j, w in paths: graph[i].append((j, w)) graph[j].append((i, w)) gates_queue = [(0, gate) for gate in gates] intensities = [float('inf') for _ in..

https://school.programmers.co.kr/learn/courses/30/lessons/132266 destination에서 출발해서 각각의 부대로 도착하는 거리를 측정하는 것이 더 쉽다. 최단 거리이므로 너비 우선 탐색을 응용하면 된다. from collections import defaultdict, deque def solution(n: int, roads: list, sources: list, destination: int): graph = defaultdict(set) for v1, v2 in roads: graph[v1].add(v2) graph[v2].add(v1) visited = {} queue = deque() # queue = deque([(destination, 0)..

https://school.programmers.co.kr/learn/courses/30/lessons/135807 gcd를 이용하면 통과. from math import gcd def solution(nums1, nums2): gcd1, gcd2 = nums1[0], nums2[0] for each1, each2 in zip(nums1[1:], nums2[1:]): gcd1, gcd2 = gcd(each1, gcd1), gcd(each2, gcd2) answer = [] for each1 in nums1: if each1 % gcd2 == 0: break else: answer.append(gcd2) for each2 in nums2: if each2 % gcd1 == 0: break else: ans..

https://school.programmers.co.kr/learn/courses/30/lessons/135808 파이썬 for 문을 이용. def solution(k, m, score): score.sort(reverse=True) return sum(score[index] * m for index in range(m - 1, len(score), m)) slice를 이용. def solution(k, m, score): return sum(sorted(score, reverse=True)[m - 1:: m]) * m 코틀린 class Solution { fun solution(k: Int, m: Int, score: IntArray): Int { val sortedScore = score.sorte..

https://school.programmers.co.kr/learn/courses/30/lessons/133501 문제에 오류가 있어 프로그래머스에 수정을 요청했다. 잘못된 보기를 고치랬더니 문제를 억지스럽게 수정했다. 경비병은 1초 후에 감시를 시작한다라... ㅎㅎㅎ solution = lambda distance, scopes, times: result[0] if (result := [index for scope, time in sorted(zip(scopes, times)) for index in range(min(scope), max(scope) + 1) if (index - 1) % sum(time) < time[0]]) else distance 약간 억지스러운 부분도 있지만 한줄로 코딩하기 ..