PrefixSum 4

문제 // Codility // Prefix Sum // GenoricRangeQuery // (성능부족)

업데이트 :: 2018.08.19 문제코드결과학습문제A DNA sequence can be represented as a string consisting of the letters A, C, G and T, which correspond to the types of successive nucleotides in the sequence. Each nucleotide has an impact factor, which is an integer. Nucleotides of types A, C, G and T have impact factors of 1, 2, 3 and 4, respectively. You are going to answer several queries of the form: What is th..

CS/코딜리티 2018.08.20

문제 // Codility // Prefix Sum // CountDiv

업데이트 :: 2018.08.19 문제코드결과학습문제Write a function: class Solution { public int solution(int A, int B, int K); } that, given three integers A, B and K, returns the number of integers within the range [A..B] that are divisible by K, i.e.: { i : A ≤ i ≤ B, i mod K = 0 } For example, for A = 6, B = 11 and K = 2, your function should return 3, because there are three numbers divisible by 2 within the ran..

CS/코딜리티 2018.08.19

문제 // Codility // Prefix Sum // PassingCars

업데이트 :: 2018.08.19 문제코드결과문제A non-empty array A consisting of N integers is given. The consecutive elements of array A represent consecutive cars on a road. Array A contains only 0s and/or 1s: 0 represents a car traveling east, 1 represents a car traveling west. The goal is to count passing cars. We say that a pair of cars (P, Q), where 0 ≤ P < Q < N, is passing when P is traveling to the east an..

CS/코딜리티 2018.08.19