Improving run-time and max Max-digits of digit summing code
How many different numbers with n digits are there whose digits add up to k?
As this is an embarassinglyembarrassingly parallel problem I decided to use a bit of GPGPU programming (partly for learning purposes) using C++AMP and came up with the following solution:
Moreover, this only allows for up to 8-digits (because of the restriction of the maximum value being less than 2^31231-1) because the GPU only supports types of float, double, int, unsigned int and bool; is there a way to circumvent this and improve the maximum number of digits allowed?
How many different numbers with n digits are there whose digits add up to k
As this is an embarassingly parallel problem I decided to use a bit of GPGPU programming (partly for learning purposes) using C++AMP and came up with the following solution:
Moreover, this only allows for up to 8-digits (because of the restriction of the maximum value being less than 2^31-1) because the GPU only supports types of float, double, int, unsigned int and bool; is there a way to circumvent this and improve the maximum number of digits allowed?
How many different numbers with n digits are there whose digits add up to k?
As this is an embarrassingly parallel problem I decided to use a bit of GPGPU programming (partly for learning purposes) using C++AMP and came up with the following solution:
Moreover, this only allows for up to 8-digits (because of the restriction of the maximum value being less than 231-1) because the GPU only supports types of float, double, int, unsigned int and bool; is there a way to circumvent this and improve the maximum number of digits allowed?