GCF
October 17, 2002 10:59 PM
Is there a C++ function that finds the GCF of two integers? If so what do I need to #include to use it?
Thanks ahead of time.
136
October 17, 2002 11:14 PM
Not that I''ve ever seen, but it shouldn''t be too hard to write one (may not be too efficient though!)
Chris Z.
ZeroFX Interactive
Chris Z.
ZeroFX Interactive
Chris Z. GPU FX
October 17, 2002 11:20 PM
I''ll just have to write one. I know how, it will just be tedious.
712
October 18, 2002 04:06 AM
GCF? You mean GCD, greatest common divisor?
It's something like this:
EDIT:
And just for fun, here's some code that forces the compiler to calculate the GCD of two constants. There are no calculations at runtime
[edited by - Beer Hunter on October 18, 2002 5:17:08 AM]
It's something like this:
// I didn't test this very much...int gcd(int x, int y){ if (x < y) std::swap(x, y); while (y != 0) { int t = x%y; x = y; y = t; } return x;} And just for fun, here's some code that forces the compiler to calculate the GCD of two constants. There are no calculations at runtime
#define gcd(x, y) (gcd_t<x,y>::value)template <int x, int y>struct gcd_t{ static const int next_x = y; static const int next_y = x%y; static const int guard = static_cast<int>(next_y != 0); static const int value = (guard) ? (gcd_t<next_x*guard, next_y>::value) : (next_x);};template <>struct gcd_t<0, 0>{ static const int value = 0;}; [edited by - Beer Hunter on October 18, 2002 5:17:08 AM]
This topic is closed to new replies.
Advertisement
Popular Topics
Advertisement
