난쟁이 개발자

Roman to IntegerRoman numerals are represented by seven different symbols: I, V, X, L, C, D and M.Symbol ValueI 1V 5X 10L 50C 100D 500M 1000For example, 2 is written as II in Roman numeral, just two ones added together. 12 is written as XII, which is simply X + II. The number 27 is written as XXVII, which i..

Longest Consecutive SequenceGiven an unsorted array of integers nums, return the length of the longest consecutive elements sequence.You must write an algorithm that runs in O(n) time. Example 1:Input: nums = [100,4,200,1,3,2]Output: 4Explanation: The longest consecutive elements sequence is [1, 2, 3, 4]. Therefore its length is 4.Example 2:Input: nums = [0,3,7,2,5,8,4,6,0,1]Output: 9Example 3:I..

Factorial Trailing ZeroesGiven an integer n, return the number of trailing zeroes in n!.Note that n! = n * (n - 1) * (n - 2) * ... * 3 * 2 * 1. Example 1:Input: n = 3Output: 0Explanation: 3! = 6, no trailing zero.Example 2:Input: n = 5Output: 1Explanation: 5! = 120, one trailing zero.Example 3:Input: n = 0Output: 0 Constraints:0 4 Follow up: Could you write a solution that works in logarithmic t..

Plus OneYou are given a large integer represented as an integer array digits, where each digits[i] is the ith digit of the integer. The digits are ordered from most significant to least significant in left-to-right order. The large integer does not contain any leading 0's.Increment the large integer by one and return the resulting array of digits. Example 1:Input: digits = [1,2,3]Output: [1,2,4]..

Basic CalculatorGiven a string s representing a valid expression, implement a basic calculator to evaluate it, and return the result of the evaluation.Note: You are not allowed to use any built-in function which evaluates strings as mathematical expressions, such as eval(). Example 1:Input: s = "1 + 1"Output: 2Example 2:Input: s = " 2-1 + 2 "Output: 3Example 3:Input: s = "(1+(4+5+2)-3)+(6+8)"Out..

[Bronze I] 세로 달력 - 26148문제 링크성능 요약메모리: 108384 KB, 시간: 96 ms분류애드 혹, 수학제출 일자2025년 3월 6일 08:25:32문제 설명달력을 유심히 바라보던 성현이는 달력의 어떤 열은 5$5$칸으로 이루어져 있다는 사실을 발견했다.성현이는 5$5$칸으로 이루어져 있는 달력의 열을 "세로 달력"이라고 부르기로 했다.성현이는 N$N$년 달력에는 총 몇 개의 "세로 달력"이 있는 지 궁금해한다.성현이를 위해 N$N$년 달력의 "세로 달력" 수를 구해주자!입력첫 번째 줄에 N$N$이 주어진다. (1 900≤N≤109)$(1\ 900 \le N \le 10^9)$ 두 번째 줄에 N$N$년 달력 1월 1일의 요일이 주어진다.요일은 1$1$에서 7$7$까지의 숫자로 주어지며..

[Gold V] Growling Gears - 10325문제 링크성능 요약메모리: 108384 KB, 시간: 96 ms분류수학제출 일자2025년 2월 18일 19:48:35문제 설명The Best Acceleration Production Company specializes in multi-gear engines. The performance of an engine in a certain gear, measured in the amount of torque produced, is not constant: the amount of torque depends on the RPM of the engine. This relationship can be described using a torque-RPM curv..

[Silver III] Password Problem (Large) - 12395문제 링크성능 요약메모리: 143524 KB, 시간: 180 ms분류브루트포스 알고리즘, 수학, 확률론제출 일자2025년 2월 13일 18:46:10문제 설명I have a really long password, and sometimes I make a mistake when I type it. Right now I've typed part of my password, but I might have made some mistakes. In particular, I might have pressed the wrong key while typing one or more of the previous characters. Given..

[Bronze I] The Easiest Problem is This One - 6627문제 링크성능 요약메모리: 110708 KB, 시간: 144 ms분류브루트포스 알고리즘, 구현, 수학제출 일자2025년 2월 12일 18:09:15문제 설명If you are the lucky one to advance to the ACM-ICPC World Finals, one of the situations you will face is the world finals competition itself. Wait, isn’t that the main reason to go there?In the beginning of each ACM-ICPC competition, there are two separate goals..

[Silver III] Champernowne Count - 27569문제 링크성능 요약메모리: 109544 KB, 시간: 100 ms분류수학, 정수론제출 일자2025년 2월 7일 02:22:19문제 설명The $n$th Champernowne word is obtained by writing down the first $n$ positive integers and concatenating them together. For example, the $10$th Champernowne word is "12345678910".Given two positive integers $n$ and $k$, count how many of the first $n$ Champernowne words are divisibl..