dev-note

def solution(s): stack = [] for i in s: if i == '(': stack.append(i) else: if stack == []: return False else: stack.pop() return stack == []

#include using namespace std; int gcd(int a, int b) { int n; while (b != 0) { n = a % b; a = b; b = n; } return a; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); int a, b; cin >> a >> b; cout

def solution(n): answer = '' while n: n, n2 = divmod(n, 3) answer = "412"[n2] + answer if not n2: n -= 1 return answer

#include #include #include using namespace std; int main(){ int n, s, min = 1e9, max = 0; scanf("%d", &n); for (int i = 0; i s) min = s; } printf("%d", min*max); return 0; }

from itertools import permutations def solution(numbers): num_list = [] for i in range(1, len(numbers)+1): test_list = permutations(numbers, i) for j in test_list: num_list.append(int("".join(j))) num_list = set(num_list) if 0 in num_list: num_list.remove(0) if 1 in num_list: num_list.remove(1) answer = len(num_list) for i in num_list: if i != 2: for j in range(2, int(i**0.5)+1): if i % j == 0: ..

#include #include #include #include using namespace std; int main(void) { ios_base::sync_with_stdio(0); cin.tie(0); int N; cin >> N; priority_queue pq; for (int i = 0; i > num; if (!num && pq.empty()) cout

def solution(phone_book): phone_book.sort() for a,b in zip(phone_book, phone_book[1:]): if b.startswith(a): return False return True

#include using namespace std; int main(int argc, char* argv[]) { int x, y; while (1) { cin >> x >> y; if (x == 0 && y == 0) { break; } if (y % x == 0) { cout

def solution(clothes): closet = {} result = 1 for i in clothes: key = i[1] val = i[0] if key in closet: closet[key].append(val) else: closet[key] = [val] for key in closet.keys(): result = result * (len(closet[key]) + 1) return result - 1

#include #include using namespace std; int main(int argc, char** argv) { ios::sync_with_stdio(0); cin.tie(0); queue Q; int N; cin >> N; for (int i = 1;i 1) { Q.pop(); Q.push(Q.front()); Q.pop(); } cout