fork download
copy 
  1. pole = [int(_) for _ in input().split()]
  2. print(pole)
  3. print(pole[1]) #druhy prvok
  4. print(pole[3:7]) #od indexu 3 po index 6
  5. for index in range(0, len(pole)):
  6. 	print(index, pole[index])
  7.  
  8. maxim = 0 #nefunguje pre zaporne cisla
  9. for index in range(0, len(pole)):
  10. 	if pole[index] > maxim:
  11. 		maxim = pole[index]
  12. print(maxim)
  13.  
  14. maxim = pole[0] #funguje pre zaporne cisla
  15. for index in range(1, len(pole)):
  16. 	if pole[index] > maxim:
  17. 		maxim = pole[index]
  18. print(maxim)
  19.  
  20. maxindex = 0 #index doteraz najvacsieho prvku
  21. for index in range(1, len(pole)):
  22. 	if pole[index] >= pole[maxindex]: #posledny vyskyt najvacsieho prvku
  23. 		maxindex = index
  24. print(maxindex, ":", pole[maxindex])
  25.  
  26. for prvok in pole: #foreach ... pre kazdy prvok v poli
  27. 	print(prvok)
  28.  
Success #stdin #stdout 0.02s 9240KB
comments (?)
stdin
copy 
-10 -15 -10 -25 -10 -15
1 3 5 7 2 6 9 0 4 11 2 6 7
stdout
copy 
[-10, -15, -10, -25, -10, -15]
-15
[-25, -10, -15]
0 -10
1 -15
2 -10
3 -25
4 -10
5 -15
0
-10
4 : -10
-10
-15
-10
-25
-10
-15
https://ideone.com/XfGZup
language:
Python 3 (python  3.9.5)
created:
4 years ago
visibility:
secret

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!