Explanation
t;r;p;f(n,B){ // function taking two int inputs
// n and B
for(r=p=1; // loop over prime factors p of n
// also init return value r to 1
n/++p; // loop while p<=n also bump p
r&=t/n<=B) // at the end of each loop check that
// the current prime power factor of
// n (t/n) is less than or equal to B
for( // loop to strip n of all its
// prime factors p
t=n; // save copy of n in t before
// removing all p factors
n%p<1; // loop while p is a factor of n
n/=p); // reduce n by p
t=r; // return r
}