Consider a large positive integer entered by the user (potentially more than 11 digits) and a positive integer n. Find the largest product of n consecutive digits in the number. For example, if the user enters the number 12345043 and 3, then the products are:

1x2x3=6,

2x3x4=24,

3x4x5=60,

4x5x0=0,

5x0x4=0,

0x4x3=0,

so the largest product is 60.

Heres what i have so far i know its all basic but im stuck.

#include <iostream> using namespace std; int main() { int n; int k; cout << "Please enter a number" << endl; cin >> n; cout << "Please enter the amount of consecutive numbers" << endl; cin >> k; return 0; }