This project aims to find the highest product by calculating products of a given number of consecutive elements in a given array.
The program operates on a uint8_t type array called buffer with 1000 elements. The array contains the numbers to be multiplied within the scope of the project. The content of the array should be included within the project files.
The project is written in C/C++ and can be compiled with any C/C++ compiler. By running the main.cpp file, the program will display the highest product for 15 consecutive numbers, along with their starting and ending indices.
#include <iostream>
// Other necessary libraries
// ...
int main() {
// Contents of the program
// ...
return 0;
}@Ciktilar :
10 ardisik carpim sonucu = 493807104 elemanlar baslangic 315'dan 324. elemana kadar 926 denemede buldu.
13 ardisik carpim sonucu = 2091059712 elemanlar baslangic 438'dan 450. elemana kadar 923 denemede buldu.
14 ardisik carpim sonucu = 2123366400 elemanlar baslangic 657'dan 670. elemana kadar 922 denemede buldu.
15 ardisik carpim sonucu = 2099380224 elemanlar baslangic 651'dan 665. elemana kadar 921 denemede buldu.
Upon running the program, you will see the highest product along with the starting and ending indices for the consecutive numbers.
This project is licensed under the MIT License. For details, check the LICENSE file.