{"push_id":1356573930,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"836d9988292c8037f858cefe55388a5d5aa1f86d","before":"7bb31c384b2bcda50913f18f79231e8dd39b78ee","commits":[{"sha":"836d9988292c8037f858cefe55388a5d5aa1f86d","author":{"name":"Sathyaish Chakravarthy","email":"d27ef7756109711c12960e28fc55b2a71f3d889a@gmail.com"},"message":"/*\n\nhttps://codility.com/programmers/lessons/5-prefix_sums/count_div/\n\nCountDiv\nCompute number of integers divisible by k in range [a..b].\n\nWrite a function:\n\n    class Solution { public int solution(int A, int B, int K); }\n\nthat, given three integers A, B and K, returns the number of integers within the range [A..B] that are divisible by K, i.e.:\n\n    { i : A ≤ i ≤ B, i mod K = 0 }\n\nFor example, for A = 6, B = 11 and K = 2, your function should return 3, because there are three numbers divisible by 2 within the range [6..11], namely 6, 8 and 10.\n\nAssume that:\n\n        A and B are integers within the range [0..2,000,000,000];\n        K is an integer within the range [1..2,000,000,000];\n        A ≤ B.\n\nComplexity:\n\n        expected worst-case time complexity is O(1);\n        expected worst-case space complexity is O(1).\n\n*/","distinct":true,"url":"https://api.github.com/repos/Sathyaish/Codility/commits/836d9988292c8037f858cefe55388a5d5aa1f86d"}]}
{"actor":{"display_login":"Sathyaish"}}