Hamming numbers | Rosetta Code | #18
URL to the problem page: https://rosettacode.org/wiki/Hamming_numbers Hamming numbers are numbers of the form H = 2 i × 3 j × 5 k where i, j, k ≥ 0 Hamming numbers are also known as ugly numbers and also 5-smooth numbers (numbers whose prime divisors are less or equal to 5). Show the first twenty Hamming numbers. Show the 1691 st Hamming number (the last one below 2 3 1 ). #include <iostream> using namespace std ; long long int power ( int a , int b ) { long long int result = 1 ; for ( int i = 0 ; i < b; i++) { result *= a; } return result; } int main () { int cnt, a = 0 ,...
