🐍Python
[알고리즘] 11. Grading Students
HackerLand University has the following grading policy:Every student receives a in the inclusive range from to .Any less than is a failing grade.Sam is a professor at the university and likes to round each student's according to these rules:If the difference between the and the next multiple of is less than , round up to the next multiple of .If the value of is less than , no rounding occurs as ..
![[알고리즘] 10. Sam and Substrings](https://img1.daumcdn.net/thumb/R750x0/?scode=mtistory2&fname=https%3A%2F%2Ft1.daumcdn.net%2Fcfile%2Ftistory%2F993A68365D8632030C)
[알고리즘] 10. Sam and Substrings
Samantha and Sam are playing a numbers game. Given a number as a string, no leading zeros, determine the sum of all integer values of substrings of the string. For example, if the string is , the substrings are and . Their sum is .Given an integer as a string, sum all of its substrings cast as integers. As the number may become large, return the value modulo .Function DescriptionComplete the sub..
![[OpenCV] 04-16. Interactive Foreground Extraction using GrabCut Algorithm](https://img1.daumcdn.net/thumb/R750x0/?scode=mtistory2&fname=https%3A%2F%2Ft1.daumcdn.net%2Fcfile%2Ftistory%2F999D4F395D86186706)
[OpenCV] 04-16. Interactive Foreground Extraction using GrabCut Algorithm
이번 장에서는이미지에서 전경을 추출하기 위한 GrabCut 알고리즘이를 위한 상호작용 기능에 대해서 알아볼 것이다.TheoryGrabCut 알고리즘은 원저자의 논문인 “GrabCut”: interactive foreground extraction using iterated graph cuts에서 설계되었다. 알고리즘은 사용자 상호작용이 최소화된 전경을 추출하기해 필요했고, 결과가 GrabCut이다.사용자 관점에서 어떻게 작동하는가? 처음에 사용자는 전경을 중심으로 직사각형을 그린다. (전경 영역은 직사각형 내부에 위치해야만 한다.) 그리고 알고리즘은 최상의 결과를 얻기 위해 반복적으로 분할한다. ..
![[OpenCV] 04-15. Image Segmentation with Watershed Algorithm](https://img1.daumcdn.net/thumb/R750x0/?scode=mtistory2&fname=https%3A%2F%2Ft1.daumcdn.net%2Fcfile%2Ftistory%2F99140B505D8463CE0A)
[OpenCV] 04-15. Image Segmentation with Watershed Algorithm
이번 장에서는,Watershed 알고리즘을 이용하여 marker-based 이미지 구분(segmentation)을 하는 법cv2.watershed 함수에 대해서 알아볼 것이다.Theory흑백스케일 이미지의 높은 채도는 봉우리와 언덕을 나타내는 지형 표면이며, 낮은 채도는 계곡을 나타낸다. 다른 색의 물들로 고립된 모든 계곡을 채우기 시작해보자. 물이 차오르면서 근처의 봉우리에 따라 분명히 다른 색깔의 물들이 합쳐지기 시작할 것이다. 이를 피하기 위해 물이 합쳐지는 곳에 장벽을 쌓는다. 봉우리가 물에 잠길 때까지, 물을 채우고 장벽을 세우는 것을 반복한다. 그러면 장벽이 분할(segmentation)의 결과를 반환한다. 이..
[알고리즘] 09. Time Conversion
Given a time in -hour AM/PM format, convert it to military (24-hour) time.Note: Midnight is 12:00:00AM on a 12-hour clock, and 00:00:00 on a 24-hour clock. Noon is 12:00:00PM on a 12-hour clock, and 12:00:00 on a 24-hour clock.Function DescriptionComplete the timeConversion function in the editor below. It should return a new string representing the input time in 24 hour format.timeConversion ha..
[알고리즘] 08. Birthday Cake Candles
You are in charge of the cake for your niece's birthday and have decided the cake will have one candle for each year of her total age. When she blows out the candles, she’ll only be able to blow out the tallest ones. Your task is to find out how many candles she can successfully blow out.For example, if your niece is turning years old, and the cake will have candles of height , , , , she will be..