首页 > 代码库 > Codility---CountDiv

Codility---CountDiv

2024-09-17 22:20:01   218人阅读

Task description

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 range [6..11], namely 6, 8 and 10.

Assume that:

  • A and B are integers within the range [0..2,000,000,000];
  • K is an integer within the range [1..2,000,000,000];
  • A ≤ B.

Complexity:

  • expected worst-case time complexity is O(1);
  • expected worst-case space complexity is O(1).
 
Solution
 
Programming language used: Java
Total time used: 19 minutes
Code: 01:36:49 UTC, java, final, score:  100
show code in pop-up
123456789101112131415161718
// you can also use imports, for example:// import java.util.*;// you can write to stdout for debugging purposes, e.g.// System.out.println("this is a debug message");class Solution {    public int solution(int A, int B, int K) {        // write your code in Java SE 8        int n=0;		if(A % K == 0) {			n = A/K -1;		}else {			n = A/K;		}		return B/K - n ;    }}



https://codility.com/demo/results/training7BZKXP-YGT/

Codility---CountDiv


联系
我们