오뚝이개발자

문제 https://codingcompetitions.withgoogle.com/kickstart/round/00000000008caa74/0000000000acee89 Kick Start - Google’s Coding Competitions Hone your coding skills with algorithmic puzzles meant for students and those new to coding competitions. Participate in one round or join them all. codingcompetitions.withgoogle.com 나의 풀이 1. 약수를 구하는 함수 findFactors()를 만든다. 2. 팰린드롬인지를 판별하는 isPalindrome() 함수를 만든다..

문제 https://codingcompetitions.withgoogle.com/kickstart/round/00000000004361e3/000000000082b933#problem Kick Start - Google’s Coding Competitions Hone your coding skills with algorithmic puzzles meant for students and those new to coding competitions. Participate in one round or join them all. codingcompetitions.withgoogle.com 나의 풀이 보통 이런 문제는 그리디 방식으로 풀면 되고, 시간복잡도를 고려하면 중간의 range가 아닌 각 구간의 양 끝단에만..

문제 https://codingcompetitions.withgoogle.com/kickstart/round/0000000000435a5b/000000000077a8e6 Kick Start - Google’s Coding Competitions Hone your coding skills with algorithmic puzzles meant for students and those new to coding competitions. Participate in one round or join them all. codingcompetitions.withgoogle.com 나의 풀이 이 문제에서의 핵심은 주어진 조건 Z의 상한이 10^8인데 1~10^8까지의 소수를 모두 구할 필요가 없다는 것이다. 또한 탐색을..

문제 https://codingcompetitions.withgoogle.com/kickstart/round/0000000000436140/000000000068cb14 Kick Start - Google’s Coding Competitions Hone your coding skills with algorithmic puzzles meant for students and those new to coding competitions. Participate in one round or join them all. codingcompetitions.withgoogle.com 나의 풀이 BFS를 사용하면 된다. 핵심은 상자가 많은 칸의 주변을 먼저 채워준다는 것이다. 이를 위해 우선순위 큐를 사용하였다. 생각해보면..

문제 https://codingcompetitions.withgoogle.com/kickstart/round/0000000000436140/000000000068c509#problem Kick Start - Google’s Coding Competitions Hone your coding skills with algorithmic puzzles meant for students and those new to coding competitions. Participate in one round or join them all. codingcompetitions.withgoogle.com 나의 풀이 본 무제는 DP를 사용하는 문제이다. test set 2의 사이즈를 보면 유추할 수 있겠지만 대략 O(R*C) 시간..

문제 https://codingcompetitions.withgoogle.com/kickstart/round/00000000004362d6/00000000008b3a1c Kick Start - Google’s Coding Competitions Hone your coding skills with algorithmic puzzles meant for students and those new to coding competitions. Participate in one round or join them all. codingcompetitions.withgoogle.com 나의 풀이 단순히 brute-force 방식으로 풀면 시간 초과 에러가 난다. 이 문제에서 핵심은 search를 어떻게 효율적으로 할 것인가..

문제 https://codingcompetitions.withgoogle.com/kickstart/round/0000000000435914/00000000008d9a88#problem Kick Start - Google’s Coding Competitions Hone your coding skills with algorithmic puzzles meant for students and those new to coding competitions. Participate in one round or join them all. codingcompetitions.withgoogle.com 나의 풀이 문제가 조금 복잡하지만 구현 자체는 생각보다 단순하다. d = {'R':['R'], 'B':['B'], 'Y':['..

문제 https://codingcompetitions.withgoogle.com/kickstart/round/0000000000435914/00000000008da461 Kick Start - Google’s Coding Competitions Hone your coding skills with algorithmic puzzles meant for students and those new to coding competitions. Participate in one round or join them all. codingcompetitions.withgoogle.com 나의 풀이 단순한 구현 문제이다. 우선 F를 set으로 바꿔주어야 한다. 어차피 우리가 필요한 것은 S에 F의 글자가 있는지만 확인하면 되니..