Run Code
|
API
|
Code Wall
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Patreon
aefrt
//fpc 3.0.0 program x; uses crt; var a,i,B,k:integer; c:array [1..100] of integer; begin writeln ('задайте размерность массива'); readln (a); writeln ('введите B'); readln (B); if a>B then begin for i:=1 to a do readln (c[i]); k:=0; for i:=1 to a do if (c[i]>0) and ((c[i] mod 5)=0) then k:=k+1; writeln ('количество элементов: ', k); if a<=B then writeln ('error'); end; readkey; end.
run
|
edit
|
history
|
help
0
1
https://m.facebook.com/akansha.panchal.906?refid=12&ref=opera_speed_dial
Sasmandar
Llenar un arreglo (con for)
Find the greatest integers - v3
test11
Pokazivac-dinamicka alokacija memorije
practica 1 ejercicio 3
ANA LUCIA CRUZ NERIS RODRIGUES 600623319
Project Euler 18 - Maximum path sum