unsigned int gcm(unsigned int firstNumber, unsigned int seconedNumber)
{
if(firstNumber % seconedNumber == 0)
{
return seconedNumber;
}
else
{
return gcm(seconedNumber,firstNumber%seconedNumber);
}
}
int main() {
std::vector<int> v(500);
sift0(begin(v), 50);
std::cout << "sift0(begin(v), 50):\n";
print_sieve(begin(v), 50);
sift1(begin(v), 50);
std::cout << "sift1(begin(v), 50):\n";
print_sieve(begin(v), 50);
sift(begin(v), 500);
std::cout << "sift(begin(v), 500):\n";
print_sieve(begin(v), 500);
std::cout << "gcm(15, 9) = " << gcm(15, 9) << std::endl;
}
int main() {
std::cout << "gcm0(121, 66) = " << gcm0(121, 66) << std::endl;
std::cout << "gcm1(121, 66) = " << gcm1(121, 66) << std::endl;
std::cout << "gcm(121, 66) = " << gcm(121, 66) << std::endl;
std::cout << "fast_segment_gcm(121, 66) = " << fast_segment_gcm(121, 66) << std::endl;
std::cout << "remainder(100, 7) = " << remainder(100, 7) << std::endl;
std::cout << "quotient(100, 7) = " << quotient(100, 7) << std::endl;
auto p = quotient_remainder(100, 7);
std::cout << "quotient_remainder(100, 7) = pair<" << p.first << ", " << p.second << ">" << std::endl;
std::cout << "remainder_fibonacci(100, 7) = " << remainder_fibonacci(100, 7) << std::endl;
std::cout << "gcm_remainder(121, 66) = " << gcm_remainder(121, 66) << std::endl;
std::cout << "gcd(121, 66) = " << gcd(121, 66) << std::endl;
}
main()
{
// Some sloppy test code.
int n=32, d=4;
printf("%i\n%i\n", n, d);
swap(&n, &d);
printf("%i\n%i\n", n, d);
printf("%i\n%i\n", gcm(n,d), gcm_r(n,d));
int i;
for(i=0; i<10; i++)
printf("%i: %i %i\n", i, fibo(i), fibo_r(i));
char a[5] ="cat";
char b[5];
copyString(b,a);
printf("%s\n%s\n", b, a);
printInBinary(floatBitsAsInt(3.14159));
printInBinary(10);
}
int main(void)
{
printf("%d\n", gcm(8, 12));
printf("%d\n", lcm(8, 12));
return 0;
}
unsigned int lcm(unsigned int firstNumber, unsigned int seconedNumber)
{
return firstNumber * seconedNumber / gcm(firstNumber, seconedNumber);
}
int main(void){
scanf("%d %d",&a,&b);
printf("%d\n%d\n",gcm(a,b),(a*b)/(gcm(a,b)));
return 0;
}
