fork(1) download 
  1. t=[18,15,12,10,8,6,4,2,1]
  2. l=[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0]
  3. for i in range(0,20):
  4.     l[0]=l[0]+25
  5.     for j in range(0,9):
  6.         l[1+((i+j)%19)]=l[1+((i+j)%19)]+t[j]
  7.     print(l)
  8.     #print(sorted(l,reverse=True))
  9.     if l[0] > max(l[1:20])+(25*(20-i)):
  10.         print(i+1)
  11.         break
  12.  
Success #stdin #stdout 0.01s 27664KB
comments (?)
stdin 
Standard input is empty
stdout 
[25, 18, 15, 12, 10, 8, 6, 4, 2, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
[50, 18, 33, 27, 22, 18, 14, 10, 6, 3, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0]
[75, 18, 33, 45, 37, 30, 24, 18, 12, 7, 3, 1, 0, 0, 0, 0, 0, 0, 0, 0]
[100, 18, 33, 45, 55, 45, 36, 28, 20, 13, 7, 3, 1, 0, 0, 0, 0, 0, 0, 0]
[125, 18, 33, 45, 55, 63, 51, 40, 30, 21, 13, 7, 3, 1, 0, 0, 0, 0, 0, 0]
[150, 18, 33, 45, 55, 63, 69, 55, 42, 31, 21, 13, 7, 3, 1, 0, 0, 0, 0, 0]
[175, 18, 33, 45, 55, 63, 69, 73, 57, 43, 31, 21, 13, 7, 3, 1, 0, 0, 0, 0]
[200, 18, 33, 45, 55, 63, 69, 73, 75, 58, 43, 31, 21, 13, 7, 3, 1, 0, 0, 0]
[225, 18, 33, 45, 55, 63, 69, 73, 75, 76, 58, 43, 31, 21, 13, 7, 3, 1, 0, 0]
[250, 18, 33, 45, 55, 63, 69, 73, 75, 76, 76, 58, 43, 31, 21, 13, 7, 3, 1, 0]
[275, 18, 33, 45, 55, 63, 69, 73, 75, 76, 76, 76, 58, 43, 31, 21, 13, 7, 3, 1]
[300, 19, 33, 45, 55, 63, 69, 73, 75, 76, 76, 76, 76, 58, 43, 31, 21, 13, 7, 3]
[325, 21, 34, 45, 55, 63, 69, 73, 75, 76, 76, 76, 76, 76, 58, 43, 31, 21, 13, 7]
13
https://ideone.com/aKpEWX
language:
Python 3 (python  3.12)
created:
8 years ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!