Sub-string divisibility | Project Euler | Problem #43
URL to the problem page: https://projecteuler.net/problem=43 The number, 1406357289, is a 0 to 9 pandigital number because it is made up of each of the digits 0 to 9 in some order, but it also has a rather interesting sub-string divisibility property. Let d 1 be the 1 st digit, d 2 be the 2 n d digit, and so on. In this way, we note the following: d 2 d 3 d 4 =406 is divisible by 2 d 3 d 4 d 5 =063 is divisible by 3 d 4 d 5 d 6 =635 is divisible by 5 d 5 d 6 d 7 =357 is divisible by 7 d 6 d 7 d 8 =572 is divisible by 11 d 7 d 8 d9=728 is divisible by 13 d 8 d 9 d 1 0 =289 is divisible by 17 Find the sum of all 0 to 9 pandigital numbers with this property. #include <iostream> using namespace std ; long long power ( long long a , long long b ) { long long result = 1 ; for ( long ...
