Results 1 to 25 of 30
Hybrid View
-
14th December 2008 21:47 #1
. " "
skype:deyan.minev
:
[10,10] [-100,100]. . :
- , . .
,
program dm;
var
a:array [1..10,1..10] of integer;
i, j:integer;
begin
writeln <vyvedete stoinost za elementa:'>;
randomize;
for i:=1 to 10 do
for j:=1 to do
begin
write<'a[',i,',',j,']='>
a[i,j]:=random<101>-100;
writeln<a[i,j]:3>;
end;
writeln;
readln;
for i:=1 to 10 do
begin
for j:=1 to 10 do
write <a[i,j]:3.;
writeln;
end
readln;
for i:=1 to do
begin
max:=a[i,1];
for j:=1 to 10 do
if a[i,j].max then
begin
max:=a[i,j];
imax:=i;
jmax:=j;
end;Last edited by DeYaNN; 14th December 2008 at 22:58.
-
14th December 2008 23:32 #2Mire-x
Join Date: Apr:2005
Location: Sofia
Posts: 763
, , ( ). , , , (.. [2,2] [9,9]). , :Code:program dm; var a:array [1..10,1..10] of integer; i, j:integer; max, imax, jmax: integer; /* , . */ begin writeln <vyvedete stoinost za elementa:'>; /* () - writeln('vyvedete...'), , */ randomize; for i:=1 to 10 do for j:=1 to do begin write<'a[',i,',',j,']='>; /* - write('...',i,'...',j,'...') */ a[i,j]:=random<101>-100; /* ( , ) -100 0. random(201)-100 -100 +100. */ writeln<a[i,j]:3>; /* . , . , - . ? , readln random+writeln? */ end; writeln; readln; /* input? , . writeln. :) */ for i:=1 to 10 do begin for j:=1 to 10 do write <a[i,j]:3.; writeln; end readln; /* , , , . */ for i:=1 to 10 do begin max:=a[i,1]; for j:=1 to 10 do if a[i,j].max then begin max:=a[i,j]; imax:=i; jmax:=j; end;
, - - .Code:sum := 0; for i:= 2 to 9 do for j := 2 to 9 do sum := sum + a[i,j]; writeln; writeln(sum);
, , , .
, , .
(10b) || !(10b)
-
15th December 2008 17:14 #3
!
; ;
Code:program dm2; var a:array [1..10,1..10] of integer; i,j:integer; max,imax,jmax,sum:integer; begin write('a[',i,',',j,']='); a[i,j]:=random(201)-100; writeln(a[i,j]:3); writeln; for i:=1 to 10 do begin for j:=1 to 10 do write(a[i,j]:3); writeln; end; readln; sum:=0; for i:=2 to 9 do for j:=2 to 9 do sum:=sum+a[i,j]; writeln; writeln(sum); end.Last edited by DeYaNN; 15th December 2008 at 17:22.
-
15th December 2008 19:41 #4
[CODE]program dm2;
var a:array [1..10,1..10] of integer;
i,j:integer;
max,imax,jmax,sum:integer;
?
-
15th December 2008 20:28 #5Mire-x
Join Date: Apr:2005
Location: Sofia
Posts: 763
-
15th December 2008 17:17 #6Mire-x
Join Date: Apr:2005
Location: Sofia
Posts: 763
, EXE PAS miroslav_genev@yahoo.com.
EDIT:
.
1. writeln(a[i,j]:3) :5 ( 1 4 , , ).
2. max, imax, jmax ( ) - .
.
Last edited by Tarvin; 15th December 2008 at 17:36.
(10b) || !(10b)
-
15th December 2008 17:34 #7

?
Last edited by delian; 15th December 2008 at 18:06. Reason:
-
15th December 2008 17:44 #8Mire-x
Join Date: Apr:2005
Location: Sofia
Posts: 763
, ! , 2-3 " , "... a[i,j], i = 2..9, j = 2..9. ?
, , - - - , " " ( " "). max min.
(10b) || !(10b)
-
15th December 2008 17:49 #9
:
- -84 - 54
10 10 0
Last edited by delian; 16th December 2008 at 08:14. Reason:
-
15th December 2008 19:06 #10Mire-x
Join Date: Apr:2005
Location: Sofia
Posts: 763
, . :-P
.Code:randomize; for i:=1 to 10 do for j:=1 to 10 do a[i,j]:=...
, , - - ( -)? :
, , , ( ), :Code:for i:=1 to 10 do for j:=1 to 10 do begin if a[i,j] < min then min:=a[i,j]; if a[i,j] > max then max:=a[i,j]; sum:=sum+a[i,j]; end; sum:=sum-(min+max); writeln(sum);
Code:for i:=1 to 10 do for j:=1 to 10 do begin sum:=sum+a[i,j]; end; sum:=sum-a[1,1]-a[10,10]; writeln(sum);(10b) || !(10b)
-
15th December 2008 19:23 #11
, <>
?
Last edited by DeYaNN; 15th December 2008 at 19:29.
-
15th December 2008 19:31 #12Mire-x
Join Date: Apr:2005
Location: Sofia
Posts: 763
-
15th December 2008 20:44 #13
.
Last edited by DeYaNN; 16th December 2008 at 01:07.
-
20th December 2008 18:45 #14, .Code:
program dm; var a:array [1..10,1..10] of integer; i,j:integer; max,min,sum:integer; begin write('a[',i,',',j,']='); for i:=1 to 10 do for j:=1 to 10 do a[i,j]:=random(200)-100 and 100; writeln(a[i,j]:5); readln; for i:=1 to 10 do begin for j:=1 to 10 do write (a[i,j]:5); writeln; end; readln; sum:=0; for i:=1 to 10 do for j:=1 to 10 do begin if a[i,j] < min then min:=a[i,j]; if a[i,j] > max then max:=a[i,j]; sum:=sum+a[i,j]; end; sum:=sum-(min+max); writeln('sum=',sum:5); readln; end.
-
20th December 2008 18:51 #15Mire-x
Join Date: Apr:2005
Location: Sofia
Posts: 763
:Code:a[i,j]:=random(200)-100 and 100;
: "writeln(a[i,j]:5);".Code:random(101)-200;
(10b) || !(10b)
-
20th December 2008 19:38 #16
-
20th December 2008 20:33 #17
Tarvin,
, -100 -200.Code:random(101)-200;
DeYaNN, , . - - . - min max . a[i,j]? min - - , : -110, max, : +110.Code:100 - random(201);
- , " , ", , .
, , "randomize;". , .Fujistu Lifebook E756 | Core i7-6500U / 400MHz-3.1GHz | 8 GB DDR4-2133 | Samsung PM871 / 256 GB SSD | 15" 1920x1080 | Manjaro Linux + kernel 4.19
-
21st December 2008 01:05 #18Mire-x
Join Date: Apr:2005
Location: Sofia
Posts: 763
-
20th December 2008 21:02 #19
"randomize;" -100 +100 , :P
Last edited by DeYaNN; 20th December 2008 at 21:08.
-
20th December 2008 21:21 #20
-
20th December 2008 21:27 #21
-110 +110
Last edited by DeYaNN; 20th December 2008 at 21:59.
-
20th December 2008 23:00 #22
-
21st December 2008 17:33 #23
.
:, min max, . "if a[i,j] < min then min:=a[i,j];", min? . , 10000? min 10000 . .Code:for i:=1 to 10 do for j:=1 to 10 do begin if a[i,j] < min then min:=a[i,j]; if a[i,j] > max then max:=a[i,j]; sum:=sum+a[i,j]; end;
, "min=110;max=-110;" for. -100 +100, min - , = 100. , min, - . if- min . 110 - - - , 100. 101, - 1000... , . 110 .
max.
:.. , , F7, ...Code:min = 110; max = -110; for i:=1 to 10 do for j:=1 to 10 do begin if a[i,j] < min then min:=a[i,j]; if a[i,j] > max then max:=a[i,j]; sum:=sum+a[i,j]; end;
Fujistu Lifebook E756 | Core i7-6500U / 400MHz-3.1GHz | 8 GB DDR4-2133 | Samsung PM871 / 256 GB SSD | 15" 1920x1080 | Manjaro Linux + kernel 4.19
-
21st December 2008 18:53 #24Registered User
Join Date: Oct:2003
Posts: 1,860
, , , ?
-
21st December 2008 22:22 #25Mire-x
Join Date: Apr:2005
Location: Sofia
Posts: 763
, .
"feature":
...Code:{var} mincount, maxcount: Integer; {...} for i:=1 to 10 do for j:=1 to 10 do begin if a[i,j] < min then begin min:=a[i,j]; mincount := 1; end else if a[i,j] = min then mincount := mincount + 1; if a[i,j] > max then begin max:=a[i,j]; maxcount := 1; end else if a[i,j] > max then maxcount := maxcount + 1; sum:=sum+a[i,j]; end; {...} sum := sum - ((min*mincount)+(max*maxcount));(10b) || !(10b)




Reply With Quote
, -n , .
Lenovo ThinkPad 15 IdeaPad 15
5th May 2023, 22:16 in