-
Notifications
You must be signed in to change notification settings - Fork 0
/
CodilityDivisilbeNumbers.cs
41 lines (32 loc) · 1.02 KB
/
CodilityDivisilbeNumbers.cs
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
using System;
namespace ConsoleApp6
{
class Program
{
//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.
//Write an efficient algorithm for the following assumptions:
//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.
static void Main(string[] args)
{
int n = solution(6, 11, 2);
}
public static int solution(int A, int B, int K)
{
int b = B / K;
int a = 0;
if (A > 0)
a = (A - 1) / K;
else
b++;
return (b - a);
}
}
}