gre
- From: Bronson <pshemu@xxxxxxxxx>
- Date: Thu, 28 Jun 2007 14:45:31 -0700
Hi,
i'm looking for a fast way to find greatest multiple of a, which is
smaller than b.
Recently i've used b-b%a, but maybe it could be done faster.
Any ideas?
Przemek
.
- Prev by Date: Could You help me? A^2
- Next by Date: greatest multiple algorithm
- Previous by thread: Could You help me? A^2
- Next by thread: greatest multiple algorithm
- Index(es):
