diff --git a/CPP/08.Largest_product_in_a_series/17-Vishal.cpp b/CPP/08.Largest_product_in_a_series/17-Vishal.cpp new file mode 100644 index 0000000..aed2a6e --- /dev/null +++ b/CPP/08.Largest_product_in_a_series/17-Vishal.cpp @@ -0,0 +1,28 @@ +//Euler 08 + +#include +using namespace std; + +int main() +{ + unsigned long int sum, large =0; + char num[]="7316717653133062491922511967442657474235534919493496983520312774506326239578318016984801869478851843858615607891129494954595017379583319528532088055111254069874715852386305071569329096329522744304355766896648950445244523161731856403098711121722383113622298934233803081353362766142828064444866452387493035890729629049156044077239071381051585930796086670172427121883998797908792274921901699720888093776657273330010533678812202354218097512545405947522435258490771167055601360483958644670632441572215539753697817977846174064955149290862569321978468622482839722413756570560574902614079729686524145351004748216637048440319989000889524345065854122758866688116427171479924442928230863465674813919123162824586178664583591245665294765456828489128831426076900422421902267105562632111110937054421750694165896040807198403850962455444362981230987879927244284909188845801561660979191338754992005240636899125607176060588611646710940507754100225698315520005593572972571636269561882670428252483600823257530420752963450"; + + for(int i=0; i<=999-12;++i) //iterates from the beginning of the number to the end + { + sum=1; + + for(int j=i;jlarge) + large=sum; + + } + + cout<<"The required number is: " << large; + + return 0; +} diff --git a/README.md b/README.md index b794d72..db227e2 100644 --- a/README.md +++ b/README.md @@ -37,7 +37,7 @@ Happy Contributing! 😃 | 05 | [Smallest multiple](https://projecteuler.net/problem=5) | :white_check_mark: | | | :white_check_mark: | | | | | :white_check_mark: | | | | | 06 | [Sum square difference](https://projecteuler.net/problem=6) | :white_check_mark: | :white_check_mark: | | :white_check_mark: | | :white_check_mark: | :white_check_mark: | | :white_check_mark: | | | | | 07 | [10001st prime](https://projecteuler.net/problem=7) | :white_check_mark: | | | :white_check_mark: | | :white_check_mark: | :white_check_mark: | | | | | | -| 08 | [Largest product in a series](https://projecteuler.net/problem=8) | | | | :white_check_mark: | | | | | | | | | +| 08 | [Largest product in a series](https://projecteuler.net/problem=8) | | | | :white_check_mark: | | :white_check_mark: | | | | | | | | 09 | [Special Pythagorean triplet](https://projecteuler.net/problem=9) | :white_check_mark: | | | :white_check_mark: | | | | | | | | | | 10 | [Summation of primes](https://projecteuler.net/problem=10) | | | | :white_check_mark: | | | :white_check_mark: | | | | | | | 11 | [Largest product in a grid](https://projecteuler.net/problem=11) | | | | :white_check_mark: | | | :white_check_mark: | | | | | |