codility3

Write a function:

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).

// you can also use imports, for example:
// #import <Foundation/NSDictionary.h>
int solution(int A, int B, int K) {
    // write your code in Objective-C 2.0
    int i = A, iModResult, iDivisorsFoundTotal = 0;


  if (!(A + B)) {
    return 0;
  }
  if (A == B) {
    return (A % K) ? 0 : 1;
  }


  while (i <= B) {
    iModResult = (i % K);
    iDivisorsFoundTotal += iModResult ? 0 : 1;
    i += iModResult ? 1 : K;
  }


  return iDivisorsFoundTotal;
}