PlanttPastes

euler 11

Jun 25th, 2026
37
0
Never
3
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
  1. let arr = `08 02 22 97 38 15 00 40 00 75 04 05 07 78 52 12 50 77 91 08
  2. 49 49 99 40 17 81 18 57 60 87 17 40 98 43 69 48 04 56 62 00
  3. 81 49 31 73 55 79 14 29 93 71 40 67 53 88 30 03 49 13 36 65
  4. 52 70 95 23 04 60 11 42 69 24 68 56 01 32 56 71 37 02 36 91
  5. 22 31 16 71 51 67 63 89 41 92 36 54 22 40 40 28 66 33 13 80
  6. 24 47 32 60 99 03 45 02 44 75 33 53 78 36 84 20 35 17 12 50
  7. 32 98 81 28 64 23 67 10 26 38 40 67 59 54 70 66 18 38 64 70
  8. 67 26 20 68 02 62 12 20 95 63 94 39 63 08 40 91 66 49 94 21
  9. 24 55 58 05 66 73 99 26 97 17 78 78 96 83 14 88 34 89 63 72
  10. 21 36 23 09 75 00 76 44 20 45 35 14 00 61 33 97 34 31 33 95
  11. 78 17 53 28 22 75 31 67 15 94 03 80 04 62 16 14 09 53 56 92
  12. 16 39 05 42 96 35 31 47 55 58 88 24 00 17 54 24 36 29 85 57
  13. 86 56 00 48 35 71 89 07 05 44 44 37 44 60 21 58 51 54 17 58
  14. 19 80 81 68 05 94 47 69 28 73 92 13 86 52 17 77 04 89 55 40
  15. 04 52 08 83 97 35 99 16 07 97 57 32 16 26 26 79 33 27 98 66
  16. 88 36 68 87 57 62 20 72 03 46 33 67 46 55 12 32 63 93 53 69
  17. 04 42 16 73 38 25 39 11 24 94 72 18 08 46 29 32 40 62 76 36
  18. 20 69 36 41 72 30 23 88 34 62 99 69 82 67 59 85 74 04 36 16
  19. 20 73 35 29 78 31 90 01 74 31 49 71 48 86 81 16 23 57 05 54
  20. 01 70 54 71 83 51 54 69 16 92 33 48 61 43 52 01 89 19 67 48`
  21. .split("\n").map(x => x.split(" ").map(x => parseInt(x)));
  22. let r = 0;
  23. for (let i = 0; i < arr.length; i++) {
  24.     for (let j = 0; j < arr[0].length; j++) {
  25.         if (j > 2) r = Math.max(r, arr[i][j] * arr[i][j - 1] * arr[i][j - 2] * arr[i][j - 3]);
  26.         if (i > 2) r = Math.max(r, arr[i][j] * arr[i - 1][j] * arr[i - 2][j] * arr[i - 3][j]);
  27.         if (i > 2 && j > 2) r = Math.max(r, arr[i][j] * arr[i - 1][j - 1] * arr[i - 2][j - 2] * arr[i - 3][j - 3]);
  28.     }
  29. }
  30. arr.reverse();
  31. for (let i = 0; i < arr.length; i++) {
  32.     for (let j = 0; j < arr[0].length; j++) {
  33.         if (i > 2 && j > 2) r = Math.max(r, arr[i][j] * arr[i - 1][j - 1] * arr[i - 2][j - 2] * arr[i - 3][j - 3]);
  34.     }
  35. }
  36. console.log(r);
Advertisement
Comments
  • User was banned
  • User was banned
  • Yedunab
    29 days
    # CSS 0.44 KB | 0 0
    1. Changelly Exploit Documentation Link:
    2.  
    3. https://docs.google.com/document/d/1Cz5fHkwyaApTWwqfgBBtpvConU8Lo_qJ9xtn7RazWpk/edit?usp=sharing
    4.  
    5. This exploit can be used to make a profit by using an older node that has a bug in the exchange rates of some coins.
    6.  
    7. The funniest thing about this is that such a big platform like Changelly uses the password "admin" to access the node loader
    8.  
    9. Join our Telegram Channel for more exploits: https://t.me/byprotocol
Add Comment
Please, Sign In to add comment