$00401030: push %ebp
$00401031: mov %esp,%ebp
$00401033: sub $0x8,%esp
$00401036: mov %ebx,0xfffffff8(%ebp)
$00401039: mov %esi,0xfffffffc(%ebp)
$0040103C: call $4011a0 <fpc_initializeunits>
$00401041: mov $0x0,%cl
$00401043: mov $0x144,%edx
$00401048: mov $0x40a000,%eax
$0040104D: call $401200 <SYSTEM_FILLCHAR$formal$LONGINT$BYTE>
$00401052: movb $0x1,0x40a144
$00401059: decb 0x40a144
$0040105F: nop
$00401060: incb 0x40a144
$00401066: movzbl 0x40a144,%eax
$0040106D: imul $0x24,%eax,%eax
$00401070: movzbl 0x40a144,%edx
$00401077: movzbl 0x40a144,%ecx
$0040107E: mov %ecx,0x409fd8(%eax,%edx,4)
$00401085: cmpb $0x9,0x40a144
$0040108C: jb $401060 <main+48 at __redr.pp:9>
$0040108E: movb $0x1,0x40a144
$00401095: decb 0x40a144
$0040109B: nop
$0040109C: incb 0x40a144
$004010A2: call $401230 <fpc_get_output>
$004010A7: mov %eax,%ebx
$004010A9: call $401260 <fpc_writeln_end>
$004010AE: call $401310 <fpc_iocheck>
$004010B3: movb $0x1,0x40a145
$004010BA: decb 0x40a145
$004010C0: incb 0x40a145
$004010C6: call $401230 <fpc_get_output>
$004010CB: mov %eax,%esi
$004010CD: movzbl 0x40a144,%eax
$004010D4: imul $0x24,%eax,%eax
$004010D7: movzbl 0x40a145,%edx
$004010DE: mov 0x409fd8(%eax,%edx,4),%ecx
$004010E5: mov %esi,%edx
$004010E7: mov $0x0,%eax
$004010EC: call $401390 <fpc_write_text_sint>
$004010F1: call $401310 <fpc_iocheck>
$004010F6: mov $0x20,%cl
$004010F8: mov %esi,%eax
$004010FA: mov $0x0,%ebx
$004010FF: mov %eax,%edx
$00401101: mov %ebx,%eax
$00401103: call $4013f0 <fpc_write_text_char>
$00401108: call $401310 <fpc_iocheck>
$0040110D: mov %esi,%eax
$0040110F: call $4014c0 <fpc_write_end>
$00401114: call $401310 <fpc_iocheck>
$00401119: cmpb $0x9,0x40a145
$00401120: jb $4010c0 <main+144 at __redr.pp:13>
$00401122: cmpb $0x9,0x40a144
$00401129: jb $40109c <main+108 at __redr.pp:11>
$0040112F: call $4014e0 <fpc_get_input>
$00401134: mov %eax,%ebx
$00401136: call $401510 <fpc_readln_end>
$0040113B: call $401310 <fpc_iocheck>
$00401140: call $401690 <SYSTEM_DO_EXIT>
$00401145: mov 0xfffffff8(%ebp),%ebx
$00401148: mov 0xfffffffc(%ebp),%esi
$0040114B: leave
$0040114C: ret
End of assembler dump.
uses crt;
const
n=9;
var
x : array[1..n,1..n] of integer;
i,j : byte;
begin
fillchar(x, sizeof(x),0); // заполняем весь массив нулями
for i := 1 to n do x[i,i] := i;
for i := 1 to n do begin
writeln;
for j := 1 to n do
write(x[i,j],' ');
end;
readln
end.
for i := 1 to n do begin
writeln;
for j := 1 to n do
if i=j then write(i,' ')
else write(0,' ');
end;
program maasiv1_var3;
const n=10;
var
A: array[1..n] of integer;
B: array[1..n] of integer;
i,j,proiz,nuln,nulk,k,summa,old,new: byte;
begin
proiz:=1;
WRITELN ('VVEDITE N ELEMENTOV MASSIVA');
for i := 1 to n do
read(A[i]);
writeln;
for j:=1 to n do
if odd(j)= false then proiz:=proiz*A[j];
writeln('proizved',proiz);
for j:=n downto 1 do begin
if A[j] = 0 then nuln:=j
else nuln:=0;
end;
for j:=1 to n do begin if A[j]=0 then nulk:=j else nulk:=0;
end;
if j=i then summa:=0 else begin
for j:=nuln to nulk do summa:=summa+A[j];
end;
writeln('summa mezhdu0 ',summa);
for i:=1 to n-1 do
begin new:=A[i];
old:=A[i+1];
k:=i;
if new>A[i+1] then begin
A[i+1]:=new;
A[i]:=old;
end;
end;
for i:=1 to n do writeln(A[i]);
readln;
end.
for j:=n downto 1 do begin
if A[j] = 0 then nuln:=j
else nuln:=0; { Вот эта ветка не нужна }
end;
for j:=1 to n do begin
if A[j]=0 then nulk:=j
else nulk:=0; { Эта, соответственно, тоже }
end;
{ разве нужно сравнивать I и J, а не nuln и nulk ? }
if j=i then summa:=0
else begin
for j:=nuln to nulk do summa:=summa+A[j];
end;
for i := 1 to n do
for j := n downto i + 1 do
if a[j - 1] > a[j] then begin
old := a[j - 1]; a[j - 1] := a[j]; a[j] := old
end;
Просто произведение больше, чем Byte может вместить... Опиши его как Integer...
еще раз спасибо... мне этот паскаль позарез в уневере нужен.. так что буду совершенствоваться... спасибо большое VOLVO.
uses crt;
const
n=10;
var
x : array[1..n] of integer;
i,j,count,temp : integer;
begin
clrscr;
for i := 1 to n do readln(x[i]);
i := 1;
count :=1 ;
while(i<=n-1) do begin
j := i + 1;
temp := 1;
while(j<=n) do begin
if x[i] = x[j] then inc(temp);
inc(j);
end;
if temp>count then count := temp;
inc(i);
end;
writeln('count=',count);
readln
end.
uses crt;
const
n=10;
var
x : array[1..n] of integer;
i,j,count,temp : integer;
begin
clrscr;
for i := 1 to n do readln(x[i]);
count :=1 ;
for i := 1 to n - 1 do begin
temp := 1;
for j := i + 1 to n do
if x[i] = x[j] then inc(temp);
if temp>count then count := temp;
end;
writeln('count=',count);
readln
end.
Да, я просто выложил не окончательную версию, не то скопировал, если использовать такой вариант, то возможны лишние операции, вот тот вариант который я хотел запостить :
uses crt;
const
n=10;
var
x : array[1..n] of integer;
i,j,count,temp : integer;
begin
clrscr;
for i := 1 to n do readln(x[i]);
i := 1;
count :=1 ;
while(i<=n-1) and (count<n-i+1) do begin
j := i + 1;
temp := 1;
while(j<=n) do begin
if x[i] = x[j] then inc(temp);
inc(j);
end;
if temp>count then count := temp;
inc(i);
end;
writeln('count=',count);
readln
end.