Advertisement
apl-mhd

CountDivCodility

Aug 19th, 2016
133
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
C 0.65 KB | None | 0 0
  1. #include<cstdio>
  2.  
  3.  
  4. int solution(int A, int B, int K){
  5.  
  6.     int totalDivNumber;
  7.  
  8.         if( A == 0)
  9.             totalDivNumber= B / K;
  10.  
  11.         else
  12.  
  13.           totalDivNumber = (B / K) - ( (A-1) / K);
  14.  
  15.  
  16.     return totalDivNumber;
  17.  
  18. }
  19.  
  20.  
  21. int main(){
  22.  
  23.  
  24.    printf(" %d \n ", solution(6, 11, 2) == 3);
  25.    printf(" %d \n ", solution(6, 15,2) == 5);
  26.    printf(" %d \n ", solution(0, 5, 1) == 5 );
  27.    printf(" %d \n ", solution(0, 0, 1) == 0 );
  28.    printf(" %d \n ", solution(0, 1, 1) == 1 );
  29.    printf(" %d \n ", solution(1, 1, 1) == 1 );
  30.    printf(" %d \n ", solution(0, 0, 11) == 1 );
  31.  
  32.    printf(" %d ", 0 /11 );
  33.  
  34.  
  35.  
  36.  
  37.  
  38.  
  39.  
  40.    return 0;
  41. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement