追梦船的专栏

question: https://codility.com/programmers/lessons/4 we need two parts to prove our solution. on one hand, there is no false triangular. Given the array has been sorted, if A[i]+A[i+1]>A[i+2]

question:https://codility.com/programmers/lessons/4 trap: int overflow code: #include int solution(vector &A) { // write your code in C++11 int size = A.size(); if (size <2)

question:https://codility.com/programmers/lessons/9 To solve this question , I get each element's divsors which appearing in input Array A using Sieve of Eratosthenes method. Time complexity is O

Solution of Codilitycodility.com is another great place to improve your programming skill. Train myself , and record here.Lesson 1: Time Complexity Lesson 2: Counting Elements Lesson 3: Prefix Sums