Run Code
|
API
|
Code Wall
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Patreon
B prethodnih B sledecih
program BprethodnihBsledecih; var a:array[1..50] of integer; b,i,n,j,sum1:integer; begin read(n); for i:=1 to n do read(a[i]); read(b); for i:=1 to n do begin j:=1;sum1:=0; while(j<=b) and ((i-j)>0) do begin sum1:=sum1+a[i-j]; j:=j+1 end; if(((j-1)*a[i])>sum1) then begin j:=1; sum1:=0; while(j<=b) and ((i+j)<=n) do begin sum1:=sum1+a[i+j]; j:=j+1 end; if(((j-1)*a[i])>sum1) then writeln(i) end end end.
run
|
edit
|
history
|
help
0
tarea1
P170808B
floor and ceiling
12345
nomer5
Сортировка массива цифр
f1
Грицанова. Стр. 77. Задача 6.18
practica 5 ejercicio 7
Zadanie 3 a