我試圖製作一個程序,該程序可以在1000位數字中找到十三個相鄰數字的最大乘積,我將其定義爲一個稱爲系列的long int。C++計算程序沒有響應
它首先計算它的,因爲它由左邊的數字乘以數量和右邊的數除以比來從右向左的13 digith。
例如:它找到988.-1000的產品。數字然後它將它除以第1000個數字並將其乘以第987個數字。直到在這個(或者更有效的數字)的左邊沒有剩下的數字。它比較這些數字並找到最大的數字。或者,至少它應該...
當我運行它沒有響應,關閉,給我一個空的控制檯程序。
#include <iostream>
#include <math.h>
using namespace std;
int seridigit(int r,long int series){
int digit=(series%(int)pow(10,r))-(series%(int)pow(10,r-1));
return digit;
}
int main()
{
int largest_found,current;
long int series = 731671765313306249192251196744265747423553491949349698352031277450632623957831801698480186947885184858615607891129494954595017379583319528532088055111254069874715852386305071569329096329522744304355766896648950445244523161731856403098711121722383113622298934233803081353362766142828064444866452387493035890729629049156044077239071381051585930796086670172427121883998797908792274921901699720888093776657273330010533678812202354218097512545405947522435258490771167055601360483958644670632441572215539753697817977846174064955149290862569321978468622482839722413756570560574902614079729686524145351004748216637048440319989000889524345065854122758866688116427171479924442928230863465674813919123162824586178664583591245665294765456828489128831426076900422421902267105562632111110937054421750694165896040807198403850962455444362981230987879927244284909188845801561660979191338754992005240636899125607176060588611646710940507754100225698315520005593572972571636269561882670428252483600823257530420752963450;
current = series%((int)pow(10,13));
largest_found = current;
for (int i=1;i<=987;i++){
int current = current/seridigit(i,series)*seridigit(i+13,series);
if (current > largest_found){
largest_found = current;
}
}
cout << "Greatest product of thirteen adjacent digits in the 1000-digit number: "<< largest_found <<endl;
}
這個1000位的數字遠遠大到可以存儲在一個'long'中。 – Charles
哇。在什麼樣的計算機上,你可以將這麼龐大的數字合併到一個「long int」中? –
也許處理這個大數字作爲一個字符串會證明更可行? – Charles