mirror of
https://github.com/autc04/Retro68.git
synced 2024-12-02 18:53:22 +00:00
45 lines
1.7 KiB
C++
45 lines
1.7 KiB
C++
// Copyright (C) 2015-2019 Free Software Foundation, Inc.
|
|
//
|
|
// This file is part of the GNU ISO C++ Library. This library is free
|
|
// software; you can redistribute it and/or modify it under the
|
|
// terms of the GNU General Public License as published by the
|
|
// Free Software Foundation; either version 3, or (at your option)
|
|
// any later version.
|
|
|
|
// This library is distributed in the hope that it will be useful,
|
|
// but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
// GNU General Public License for more details.
|
|
|
|
// You should have received a copy of the GNU General Public License along
|
|
// with this library; see the file COPYING3. If not see
|
|
// <http://www.gnu.org/licenses/>.
|
|
|
|
// { dg-options "-std=gnu++17" }
|
|
// { dg-do compile { target c++17 } }
|
|
|
|
#include <numeric>
|
|
|
|
#ifndef __cpp_lib_gcd_lcm
|
|
# error "Feature-test macro for gcd missing"
|
|
#elif __cpp_lib_gcd_lcm != 201606
|
|
# error "Feature-test macro for gcd has wrong value"
|
|
#endif
|
|
|
|
using std::gcd;
|
|
|
|
static_assert( gcd(1071, 462) == 21, "" );
|
|
static_assert( gcd(2000, 20) == 20, "" );
|
|
static_assert( gcd(2011, 17) == 1, "GCD of two primes is 1" );
|
|
static_assert( gcd(200, 200) == 200, "GCD of equal numbers is that number" );
|
|
static_assert( gcd(0, 13) == 13, "GCD of any number and 0 is that number" );
|
|
static_assert( gcd(29, 0) == 29, "GCD of any number and 0 is that number" );
|
|
static_assert( gcd(0, 0) == 0, "" );
|
|
|
|
static_assert(gcd(1u, 2) == 1, "unsigned and signed");
|
|
static_assert(gcd(3, 4u) == 1, "signed and unsigned");
|
|
static_assert(gcd(5u, 6u) == 1, "unsigned and unsigned");
|
|
|
|
static_assert( std::is_same_v<decltype(gcd(1l, 1)), long> );
|
|
static_assert( std::is_same_v<decltype(gcd(1ul, 1ull)), unsigned long long> );
|