-2^63 2^63 - 1 UInt64 64 0 2^64 - 1 Int128 ✓ 128 -2^127 2^127 - 1 UInt128 128 0 2^128 - 1 Bool N/A 8 false (0) true (1) • Floating-point types: Additionally, full support for Complex and Rational representable by T. • x % T converts an integer x to a value of integer type T congruent to x modulo 2^n, where n is the number of bits in T. In other words, the binary representation is truncated to fit. • exponential function at x expm1(x) accurate exp(x)-1 for x near zero ldexp(x,n) x*2^n computed efficiently for integer values of n log(x) natural logarithm of x log(b,x) base b logarithm of x log2(x) base

-2^63 2^63 - 1 UInt64 64 0 2^64 - 1 Int128 ✓ 128 -2^127 2^127 - 1 UInt128 128 0 2^128 - 1 Bool N/A 8 false (0) true (1) • Floating-point types: Additionally, full support for Complex and Rational representable by T. • x % T converts an integer x to a value of integer type T congruent to x modulo 2^n, where n is the number of bits in T. In other words, the binary representation is truncated to fit. • exponential function at x expm1(x) accurate exp(x)-1 for x near zero ldexp(x,n) x*2^n computed efficiently for integer values of n log(x) natural logarithm of x log(b,x) base b logarithm of x log2(x) base

-2^63 2^63 - 1 UInt64 64 0 2^64 - 1 Int128 ✓ 128 -2^127 2^127 - 1 UInt128 128 0 2^128 - 1 Bool N/A 8 false (0) true (1) • Floating-point types: 15CHAPTER 5. INTEGERS AND FLOATING-POINT NUMBERS 16 representable by T. • x % T converts an integer x to a value of integer type T congruent to x modulo 2^n, where n is the number of bits in T. In other words, the binary representation is truncated to fit. • exponential function at x expm1(x) accurate exp(x) - 1 for x near zero ldexp(x, n) x * 2^n computed efficiently for integer values of n log(x) natural logarithm of x log(b, x) base b logarithm of x log2(x)

-2^63 2^63 - 1 UInt64 64 0 2^64 - 1 Int128 ✓ 128 -2^127 2^127 - 1 UInt128 128 0 2^128 - 1 Bool N/A 8 false (0) true (1) • Floating-point types: 15CHAPTER 5. INTEGERS AND FLOATING-POINT NUMBERS 16 representable by T. • x % T converts an integer x to a value of integer type T congruent to x modulo 2^n, where n is the number of bits in T. In other words, the binary representation is truncated to fit. • exponential function at x expm1(x) accurate exp(x) - 1 for x near zero ldexp(x, n) x * 2^n computed efficiently for integer values of n log(x) natural logarithm of x log(b, x) base b logarithm of x log2(x)

-2^63 2^63 - 1 UInt64 64 0 2^64 - 1 Int128 ✓ 128 -2^127 2^127 - 1 UInt128 128 0 2^128 - 1 Bool N/A 8 false (0) true (1) • Floating-point types: 15CHAPTER 5. INTEGERS AND FLOATING-POINT NUMBERS 16 representable by T. • x % T converts an integer x to a value of integer type T congruent to x modulo 2^n, where n is the number of bits in T. In other words, the binary representation is truncated to fit. • exponential function at x expm1(x) accurate exp(x) - 1 for x near zero ldexp(x, n) x * 2^n computed efficiently for integer values of n log(x) natural logarithm of x log(b, x) base b logarithm of x log2(x)

292 13.3 子集和問題 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 298 13.4 n 皇后問題 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 305 13.5 小結 . . 自動生成的順序）：krahets、coderonion、Gonglja、nuomi1、Reanon、justin‑tse、hpstory、 danielsss、curtishd、night‑cruise、S‑N‑O‑R‑L‑A‑X、msk397、gvenusleo、khoaxuantu、RiverTwilight、 rongyi、gyt95、zhuoqinyue、K3v123、Zuoxun、mingXta 1 ： // === File: iteration.c === /* for 迴圈 */ int forLoop(int n) { int res = 0; // 迴圈求和 1, 2, ..., n-1, n for (int i = 1; i <= n; i++) { res += i; } return res; } 第 2 章 複雜度分析 www.hello‑algo

-2^63 2^63 - 1 UInt64 64 0 2^64 - 1 Int128 ✓ 128 -2^127 2^127 - 1 UInt128 128 0 2^128 - 1 Bool N/A 8 false (0) true (1) • Floating-point types: 15CHAPTER 5. INTEGERS AND FLOATING-POINT NUMBERS 16 representable by T. • x % T converts an integer x to a value of integer type T congruent to x modulo 2^n, where n is the number of bits in T. In other words, the binary representation is truncated to fit. • exponential function at x expm1(x) accurate exp(x) - 1 for x near zero ldexp(x, n) x * 2^n computed efficiently for integer values of n log(x) natural logarithm of x log(b, x) base b logarithm of x log2(x)

-2^63 2^63 - 1 UInt64 64 0 2^64 - 1 Int128 ✓ 128 -2^127 2^127 - 1 UInt128 128 0 2^128 - 1 Bool N/A 8 false (0) true (1) • Floating-point types: 15CHAPTER 5. INTEGERS AND FLOATING-POINT NUMBERS 16 representable by T. • x % T converts an integer x to a value of integer type T congruent to x modulo 2^n, where n is the number of bits in T. In other words, the binary representation is truncated to fit. • exponential function at x expm1(x) accurate exp(x) - 1 for x near zero ldexp(x, n) x * 2^n computed efficiently for integer values of n log(x) natural logarithm of x log(b, x) base b logarithm of x log2(x)

-2^63 2^63 - 1 UInt64 64 0 2^64 - 1 Int128 ✓ 128 -2^127 2^127 - 1 UInt128 128 0 2^128 - 1 Bool N/A 8 false (0) true (1) • Floating-point types: 15CHAPTER 5. INTEGERS AND FLOATING-POINT NUMBERS 16 representable by T. • x % T converts an integer x to a value of integer type T congruent to x modulo 2^n, where n is the number of bits in T. In other words, the binary representation is truncated to fit. • exponential function at x expm1(x) accurate exp(x) - 1 for x near zero ldexp(x, n) x * 2^n computed efficiently for integer values of n log(x) natural logarithm of x log(b, x) base b logarithm of x log2(x)

-2^63 2^63 - 1 UInt64 64 0 2^64 - 1 Int128 ✓ 128 -2^127 2^127 - 1 UInt128 128 0 2^128 - 1 Bool N/A 8 false (0) true (1) • Floating-point types: 15CHAPTER 5. INTEGERS AND FLOATING-POINT NUMBERS 16 representable by T. • x % T converts an integer x to a value of integer type T congruent to x modulo 2^n, where n is the number of bits in T. In other words, the binary representation is truncated to fit. • exponential function at x expm1(x) accurate exp(x) - 1 for x near zero ldexp(x, n) x * 2^n computed efficiently for integer values of n log(x) natural logarithm of x log(b, x) base b logarithm of x log2(x)