math - 计算“给定'n'个相邻数字的最大乘积”的不一致行为(D语言)
问题描述
我正在为 Project Euler(问题 8)制定解决方案,其中涉及计算出 13 个相邻数字的最大乘积。我写了一个解决方案(如下),但是当切片的长度为 13 时,它似乎没有输出正确的答案。当我将相邻数字的长度设置为“4”而不是“13”时,这是正确的。你能帮我找出错误吗?
这是用D 编程语言编写的:
/*
* Project Euler: Classic, "Largest product in a series" solution
* Implementation by A. S. "Aleksey" Ahmann <hackermaneia@riseup.net>
* - https://github.com/Alekseyyy
*
* Problem link: https://projecteuler.net/problem=8
*/
import std.stdio : writeln;
import std.array : replace;
import std.conv : to;
string number = "73167176531330624919225119674426574742355349194934
96983520312774506326239578318016984801869478851843
85861560789112949495459501737958331952853208805511
12540698747158523863050715693290963295227443043557
66896648950445244523161731856403098711121722383113
62229893423380308135336276614282806444486645238749
30358907296290491560440772390713810515859307960866
70172427121883998797908792274921901699720888093776
65727333001053367881220235421809751254540594752243
52584907711670556013604839586446706324415722155397
53697817977846174064955149290862569321978468622482
83972241375657056057490261407972968652414535100474
82166370484403199890008895243450658541227588666881
16427171479924442928230863465674813919123162824586
17866458359124566529476545682848912883142607690042
24219022671055626321111109370544217506941658960408
07198403850962455444362981230987879927244284909188
84580156166097919133875499200524063689912560717606
05886116467109405077541002256983155200055935729725
71636269561882670428252483600823257530420752963450";
void main() {
number = replace(number, "\n", "");
int[] x = format_adjacent(number);
int largest_product = largestProduct(x, 13);
writeln(largest_product);
}
int[] format_adjacent(string number) {
int[] adjacent_numbers;
for (int i = 0; i < number.length; i++)
adjacent_numbers ~= to!int(number[i] - to!char("0"));
return adjacent_numbers;
}
int computeProduct(int[] sequence) {
int product = sequence[0];
for (int i = 1; i < sequence.length; i++)
product = product * sequence[i];
return product;
}
int largestProduct(int[] sequence, int slice) {
int largest_product = 0;
int n = 0;
int fin = to!int(sequence.length) - (slice - 1);
while (n < fin) {
int[] seq = sequence[n .. n + slice];
int product = computeProduct(seq);
if (product > largest_product)
largest_product = product;
n = n + 1;
}
return largest_product;
}
解决方案
int 有多大?我尝试在 C 中使用 64 位整数来编写这样的程序,并发现 13 个字符的最大值来自字符串 5576689664895(字符串第 4 行末尾的 557),并且产品在十六进制 0x57994b000 不适合 32 位。
推荐阅读
- javascript - GraphQL:返回新的 Promise((resolve,object)
- ios - 如何在 Crashlytics 中使用 CLSStackFrame?
- webpage - 网页启动错误
- python - Google App Engine dev_appserver.py:watcher_ignore_re 标志“不是 JSON 可序列化的”
- r - R中的菊花功能警告
- java - Apache Maven:-source 1.5 中不支持 Diamond 运算符
- python-2.7 - Pycharm 后台任务永远占用
- c# - 如何像 C++ 一样在 C# 中初始化
- symfony - Doctrine ORM:使用更新级联选项手动添加 fk 来验证模式
- android - 所有 WebView 都以某种方式共享访问历史记录