dev-note

import math def solution(progresses, speeds): answer = [] progresses = [math.ceil((100-a)/b) for a, b in zip(progresses, speeds)] a = 0 for i in range(len(progresses)): if progresses[a]

#include #include #include using namespace std; int main(void) { cin.tie(0); cin.sync_with_stdio(0); int num, data; queue q; string str; cin >> num; for (int i = 0; i > str; if (str == "push") { cin >> data; q.push(data); } else if (str == "pop") { if (q.size() == 0) std::cout

import heapq def solution(scoville, K): answer = 0 heapq.heapify(scoville) while scoville[0]

def solution(n): a = bin(n).count('1') for i in range(n+1,1000001): if bin(i).count('1') == a: return i

def solution(brown, yellow): s = brown + yellow for longth in range(s,2,-1): if s % longth == 0: length = s // longth if yellow == (longth - 2) * (length - 2): return [longth, length]

#include #include #include using namespace std; int main(void) { int n; cin >> n; stack st; string str; for (int i = 0; i > str; if (str == "push") { int num; cin >> num; st.push(num); } else if (str == "pop") { if (!st.empty()) { cout

from collections import deque def solution(prices): queue = deque(prices) answer = [] while queue: price = queue.popleft() sec = 0 for q in queue: sec += 1 if price > q: break answer.append(sec) return answer

#include using namespace std; int facto(int n) { if (n > n; cout

import numpy as np def solution(A, B): answer = [[]] answer = (np.matrix(A)*np.matrix(B)).tolist() return answer

#include #include using namespace std; int main() { string str; cin >> str; sort(str.begin(), str.end(), greater()); cout