歐拉計劃8: 連續數字最大乘積 Largest product in a series

• 題目描述

  

  

• 結果

#include<iostream>
using namespace std;
char str[10005];
int main() {
    cin >> str;
    long long ans = 1, zero = 0, now = 1;
    for (int i = 0; i < 1000; ++i) {
        if (i < 13) 
            now *= str[i] - '0';
        else {
            if (str[i] == '0') 
                ++zero;
            else 
                now *= str[i] - '0';
            
            if (str[i - 13] == '0') 
                --zero;
            else 
                now /= str[i - 13] - '0';
        }
        if (0 == zero) 
            ans = max(ans, now);
    }
    cout << ans << endl;
    return 0;
}