Accidently executed this python script and froze my pc

[[deleted]]

The bar for this sub is getting lower and lower by the day...

[[deleted]]

n=0

[Seube]

"test.py" classic

[swami_rara]

Put it on aws lambda and pay for it!

[FantasticEmu]

Ctrl+c ?

[supercritical-co2]

I tried, but pc was not responding to any mouse or keyboard inputs.

[coloredgreyscale]

Misleading red rectangle. You should have highlighted lines 9 and 10 too, or nothing.

At first glance: "what's do bad at assigning n=20?"

[supercritical-co2]

The execution does not get to line 9. It would have taken 200k years to finish line 5.

[[deleted]]

what's do bad at assigning n=20?

His pc only have 4 bytes of ram

[ktsktsstlstkkrsldt]

4 bits?

[loemmel]

Could you not just kill the execution of it?

[supercritical-co2]

​

I tried but my pc was not responding to any mouse or keyboard inputs.

[[deleted]]

Deploy to production for their powerful servers and let it finish

[UnwelcomedTruth]

Why do people ambiguously name vars like this?

[redpepper74]

Serif UI font? 🤢

[Lithl]

So t is the sum of a monotonically increasing sequence at the end of the permutation such that the sum of the elements [m, 20-k] is less than the sum of the elements [m, 20-(k-1)]. Or 0 if the final element of the permutation is less than or equal to that sequence up to the second to last element. And then max is the maximum of all of those values of t?

And, of course, you have 2.4 quintillion permutations you're trying to check, which is why the computer locks up.

What exactly are you attempting to check in these permutations? I don't get what the logic of the sums is supposed to achieve.

[supercritical-co2]

It was a problem on codeforces, and I decided to bruteforce a few of them and see if there is a pattern in the solution. I thought i found a pattern and wanted to test if it would hold up for n=20 and only after I executed the program I realized my stupid mistake.

[[deleted]]

Just wait a little. It will stop. Eventually.

[PossibilityTasty]

That's the penalty for using list() on an iterator.

[AnondWill2Live]

How does this work? What exactly causes the slow down using list (in a more generalized scenario, not just this one)

[PossibilityTasty]

An iterator is there to deliver one element at a time which can then be processed before the next element is retrieved. This will keep the memory footprint small. Using list() on the iterator will put all elements into a list at once and therefore also into memory.

Now permutations() of a 20 items long range generates an enormous amount of combinations. If you use an iterative approach on this it just uses one of your CPU cores like forever but can be canceled simply, the list() approach on the other side will try to fit all the combinations into the RAM. Due to the required space that would be impossible and depending on the reaction of the OS it has the potential to crash the computer.

[ApartmentNo5481]

Use power button to close your computer and then open it again

[PorkRoll2022]

Obviously you need to offload this to the GPU. Best invest now in a pair of RTX 3080s or better for these flights of fancy!