For this Question: English Team has now adopted a rotation policy for two of their players: Dom and Leach. 
On the first day, both of them played but, from the second day onwards, Dom plays every second day, while Leach plays every third day.

For example, on:
Day 1 - Both players play, 
Day 2 - Neither of them plays,
Day 3 - Only Dom plays,
Day 4 - Only Leach plays,
Day 5 - Only Dom plays,
Day 6 - Neither of them plays,
Day 7 - Both the players play.. and so on.

Find the number of days in the interval [A, B] (A and B, both inclusive) when neither Dom nor Leach plays.<b>User Task:</b>
Since this will be a functional problem, you don't have to take input. You just have to complete the function <b>RotationPolicy()</b> that takes integers A, and B as arguments.

Constraints:-
1 <= A, B <=100000Return the number of days when neither of the two players played the game.Sample Input:-
3 8

Sample Output:-
2

Sample Input:-
1 4

Sample Output:-
1, I have written this Solution Code: 
int RotationPolicy(int A, int B){

 int cnt=0;
 for(int i=A;i<=B;i++){
     if((i-1)%2!=0 && (i-1)%3!=0){cnt++;}
 }
 return cnt;
}
, In this Programming Language: C++, Now tell me if this Code is compilable or not?