Neue Übersetzung für Problem 150

Hinweise zur Erstellung von Übersetzungen

Als Basis für jede Übersetzung dient der Text von projecteuler.net.
Der Originaltitel und Text im untenstehenden Formular sind zu übersetzen.
Der HTML-Quelltext in seiner Struktur sollte im Allgemeinen unverändert bleiben.
Querverweise zu anderen Problemen sollten in der Form /problem=?? erfolgen.
Wenn Grafiken oder Dateien verwendet werden, sollte die URL https://projecteuler.net/... verwendet werden.
Die Sie-Form benutzen.

Titel

Inhalt

In a triangular array of positive and negative integers, we wish to find a sub-triangle such that the sum of the numbers it contains is the smallest possible.
In the example below, it can be easily verified that the marked triangle satisfies this condition having a sum of −42.
<div style="text-align:center;">
<img src="https://projecteuler.net/project/images/p150.gif" class="dark_img" alt="" /></div>
We wish to make such a triangular array with one thousand rows, so we generate 500500 pseudo-random numbers sk in the range ±219, using a type of random number generator (known as a Linear Congruential Generator) as follows:
t := 0
 
for k = 1 up to k = 500500:
 
    t := (615949*t + 797807) modulo 220 
    sk := t−219
Thus: s1 = 273519, s2 = −153582, s3 = 450905 etc
Our triangular array is then formed using the pseudo-random numbers thus:
<div style="text-align:center;font-style:italic;">
s1 
s2  s3 
s4  s5  s6  
 
s7  s8  s9  s10 
...
</div>
Sub-triangles can start at any element of the array and extend down as far as we like (taking-in the two elements directly below it from the next row, the three elements directly below from the row after that, and so on).
 
The "sum of a sub-triangle" is defined as the sum of all the elements it contains.
 
Find the smallest possible sub-triangle sum.

 
<p>In a triangular array of positive and negative integers, we wish to find a sub-triangle such that the sum of the numbers it contains is the smallest possible.</p><p>In the example below, it can be easily verified that the marked triangle satisfies this condition having a sum of −42.</p><div style="text-align:center;"><img src="https://projecteuler.net/project/images/p150.gif" class="dark_img" alt="" /></div><p>We wish to make such a triangular array with one thousand rows, so we generate 500500 pseudo-random numbers <span style="font-style:italic;">s<sub>k</sub></span> in the range ±2<sup>19</sup>, using a type of random number generator (known as a Linear Congruential Generator) as follows:</p><p style="margin-left:50px;"><span style="font-style:italic;">t</span> := 0<br />for k = 1 up to k = 500500:<br />    <span style="font-style:italic;">t</span> := (615949*<span style="font-style:italic;">t</span> + 797807) modulo 2<sup>20</sup><br />    <span style="font-style:italic;">s<sub>k</sub></span> := <span style="font-style:italic;">t</span>−2<sup>19</sup></p><p>Thus: <span style="font-style:italic;">s<sub>1</sub></span> = 273519, <span style="font-style:italic;">s<sub>2</sub></span> = −153582, <span style="font-style:italic;">s<sub>3</sub></span> = 450905 etc</p><p>Our triangular array is then formed using the pseudo-random numbers thus:</p><div style="text-align:center;font-style:italic;">s<sub>1</sub><br />s<sub>2</sub>  s<sub>3</sub><br />s<sub>4</sub>  s<sub>5</sub>  s<sub>6</sub>  <br />s<sub>7</sub>  s<sub>8</sub>  s<sub>9</sub>  s<sub>10</sub><br />...</div><p>Sub-triangles can start at any element of the array and extend down as far as we like (taking-in the two elements directly below it from the next row, the three elements directly below from the row after that, and so on).<br />The "sum of a sub-triangle" is defined as the sum of all the elements it contains.<br />Find the smallest possible sub-triangle sum.</p>

Sie erklären sich einverstanden, dass die Übersetzung unter der Creative Commons Lizenz CC BY-NC-SA 4.0 veröffentlicht wird. Wenn Sie wollen, dass die Übersetzung Ihnen zugeordnet werden kann, müssen Sie sich einloggen (oben rechts), andernfalls ist sie anonym.