SHARE
TWEET

Largest product in a series №8

ksmk99 Sep 16th, 2019 106 Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
  1. using System;
  2. using System.Collections.Generic;
  3. using System.Linq;
  4. using System.Text;
  5. using System.Threading.Tasks;
  6.  
  7. //The four adjacent digits in the 1000-digit number that have the greatest product are 9 × 9 × 8 × 9 = 5832.
  8.  
  9. //73167176531330624919225119674426574742355349194934
  10. //96983520312774506326239578318016984801869478851843
  11. //85861560789112949495459501737958331952853208805511
  12. //12540698747158523863050715693290963295227443043557
  13. //66896648950445244523161731856403098711121722383113
  14. //62229893423380308135336276614282806444486645238749
  15. //30358907296290491560440772390713810515859307960866
  16. //70172427121883998797908792274921901699720888093776
  17. //65727333001053367881220235421809751254540594752243
  18. //52584907711670556013604839586446706324415722155397
  19. //53697817977846174064955149290862569321978468622482
  20. //83972241375657056057490261407972968652414535100474
  21. //82166370484403199890008895243450658541227588666881
  22. //16427171479924442928230863465674813919123162824586
  23. //17866458359124566529476545682848912883142607690042
  24. //24219022671055626321111109370544217506941658960408
  25. //07198403850962455444362981230987879927244284909188
  26. //84580156166097919133875499200524063689912560717606
  27. //05886116467109405077541002256983155200055935729725
  28. //71636269561882670428252483600823257530420752963450
  29.  
  30. //Find the thirteen adjacent digits in the 1000-digit number that have the greatest product.What is the value of this product?
  31.  
  32. namespace _8
  33. {
  34.     class Program
  35.     {
  36.         static void Main(string[] args)
  37.         {
  38.             var sequence = "7316717653133062491922511967442657474235534919493496983520312774506326239578318016984801869478851843858615607891129494954595017379583319528532088055111254069874715852386305071569329096329522744304355766896648950445244523161731856403098711121722383113622298934233803081353362766142828064444866452387493035890729629049156044077239071381051585930796086670172427121883998797908792274921901699720888093776657273330010533678812202354218097512545405947522435258490771167055601360483958644670632441572215539753697817977846174064955149290862569321978468622482839722413756570560574902614079729686524145351004748216637048440319989000889524345065854122758866688116427171479924442928230863465674813919123162824586178664583591245665294765456828489128831426076900422421902267105562632111110937054421750694165896040807198403850962455444362981230987879927244284909188845801561660979191338754992005240636899125607176060588611646710940507754100225698315520005593572972571636269561882670428252483600823257530420752963450";
  39.             long max = 0;
  40.             long number = 1;
  41.             var timestop = 12;
  42.             for (int i = 0; i < sequence.Length; i++)
  43.             {
  44.                 number *= int.Parse(Convert.ToString(sequence[i]));
  45.                 if(i == timestop)
  46.                 {
  47.                     if (max < number) max = number;
  48.                     number = 1;
  49.                     i -= 12;
  50.                     timestop += 1;
  51.                 }
  52.             }
  53.             Console.WriteLine(max);
  54.         }
  55.     }
  56. }
RAW Paste Data
We use cookies for various purposes including analytics. By continuing to use Pastebin, you agree to our use of cookies as described in the Cookies Policy. OK, I Understand
 
Top