Run Code
|
API
|
Code Wall
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Patreon
zadacha7
const n=5; ver m:array [1..n] of integer; i,k:integer; a:real; begin randomize; read(a); k:=0; for i:=1 to n do begin m[i]:=random(5)+1; writeln(m[i]); end; for i:=1 to n do if m[i]<a then k:=k+1; write(k); end.
run
|
edit
|
history
|
help
0
Largest Prime Factor
calcular_sumatoria_N
Project Euler 20 - Factorial digit sum
Сумма пар чисел кратных и некратных 11 с дельтой неэффективная
Test 1
Homework 9
Enigma
1
Test
Homework 8