본문 바로가기

Codefights

(96)
How to make Windows10 iso booting usb in Ubuntu, 우분투에서 윈도우즈 10 부팅 usb 만들기, 리눅스 우분트 윈도우즈 설치 How to make Windows10 iso booting usb in Ubuntu, 우분투에서 윈도우즈 10 부팅 usb 만들기, 리눅스 우분트 윈도우즈 설치 In Ubuntu, download iso file first, Download Windows10 iso ( Here ) Windows10 iso 다운로드 ( 여기 ) and then.. 0. Insert USB Start menu 1. startup disk creator 2. other 3. create 0. USB를 꽂는다. 시작메뉴 1. 시동디스크 만들기 2. 기타 3. 만들기 Something else you might like... 2018/12/10 - [Algorithm/Code Fights (Code Signal)] - Arac..
Aracade Intro #39 knapsackLight. Algorithm, 알고리즘, Codefights, CodeSignal, 코드파이트, 코드시그널, 예제, example, c++ java c# scalar Aracade Intro #39 knapsackLight. Algorithm, 알고리즘, Codefights, CodeSignal, 코드파이트, 코드시그널, 예제, example, c++ java c# scalar Q. You found two items in a treasure chest! The first item weighs weight1 and is worth value1, and the second item weighs weight2 and is worth value2. What is the total maximum value of the items you can take with you, assuming that your max weight capacity is maxW and you can'..
Aracade Intro #38 growingPlant. Algorithm, 알고리즘, Codefights, CodeSignal, 코드파이트, 코드시그널, 예제, example, c++ java c# scalar Aracade Intro #38 growingPlant. Algorithm, 알고리즘, Codefights, CodeSignal, 코드파이트, 코드시그널, 예제, example, c++ java c# scalar Q. Each day a plant is growing by upSpeed meters. Each night that plant's height decreases by downSpeed meters due to the lack of sun heat. Initially, plant is 0 meters tall. We plant the seed at the beginning of a day. We want to know when the height of the plant will reach a c..
Aracade Intro #37 arrayMaxConsecutiveSum. Algorithm, 알고리즘, Codefights, CodeSignal, 코드파이트, 코드시그널, 예제, example, c++ java c# scalar Aracade Intro #37 arrayMaxConsecutiveSum. Algorithm, 알고리즘, Codefights, CodeSignal, 코드파이트, 코드시그널, 예제, example, c++ java c# scalar Q. Given array of integers, find the maximal possible sum of some of its k consecutive elements. 주어진 정수에서 길이값 k 의 수만큼 연속된 길이의 내용물들의 합 최대값을 구하여라 e.g. Input -> inputArray = [2, 3, 5, 1, 6] and k = 2 Output -> arrayMaxConsecutiveSum(inputArray, k) = 8 All possible sums of..
Aracade Intro #36 differentSymbolsNaive. Algorithm, 알고리즘, Codefights, CodeSignal, 코드파이트, 코드시그널, 예제, example, c++ java c# scalar Aracade Intro #36 differentSymbolsNaive. Algorithm, 알고리즘, Codefights, CodeSignal, 코드파이트, 코드시그널, 예제, example, c++ java c# scalar Q. Given a string, find the number of different characters in it. 주어진 string에서, 각자 다른 character 의 개수를 찾아봐라 e.g. Input -> s = "cabca" Output -> differentSymbolsNaive(s) = 3 There are 3 different characters a, b and c. // Process// 1. Input string s// 2. Iterate from begi..
Maca 마카 usage/side effects/dosage 효능/부작용/용법 Maca 마카 usage/side effects/dosage 효능/부작용/용법(1) 2019/01/25 - [Life/Health care] - Maca 마카 usage/side effects/dosage 효능/부작용/성인,소아 용법(2) 먹고있어서 공부할겸 원문 Origin ( Here ) Maca (Lepidium meyenii) is the root of a vegetable native to the Andes region of Peru. Known as "Peruvian ginseng" (even though it doesn't belong to the same botanical family as ginseng), maca is consumed as a food and is said to boos..
OpenCV How to get min/max value from matrix, 매트릭스 최소값/최대값. Java,c++,cpp,imageprocessing - Core 함수에서 minMaxLoc(Matrix) 를 호출하면 MinMaxLocResult 객체를 반환한다. 반환받은 객체에서 다양한 값들을 뽑아낼 수 있는데, 최소/최대 값을 뽑는 것은.. If you call "minMaxLoc(Matrix)" method in Core class, you could get MinMaxLocResult instance. And we could get various val from it, anyway, the way to get min/max val... 코드.. 코드를 보자!!!! Code.. lemme see code!!!!!! example public double getMax(final Mat inputMat) { return Core.minMaxLoc(in..
OpenCV How to handle single channel image matrix each pixel, add/subtract/multiply/division (1), 이미지 매트릭스 각 픽셀단위 값 조정하기 (영상처리, image processing) (1) OpenCV How to handle single channel image matrix each pixel, add/subtract/multiply/division (1) 이미지 매트릭스 각 픽셀단위 값 조정하기 (영상처리, image processing) (1) Handling each pixel in matrix using put/get in OpenCV 1) / 2) both worked well, but second one did better performance. I changed to 3) using Core in OpenCV, and i'll post later. You can use any operator, but example code is about append. 1/2 둘다 동작하고,..