Trả lời chủ đề

Nội dung

<blockquote data-quote="lamfmhn95" data-source="post: 89821" data-attributes="member: 146031">Đây là cách làm của mình, bạn thử xem sao.
Mặc định là nó vẽ theo chiều kim đồng hồ. Nếu muốn tổng quát hơn thì sửa lạ 1 tí thôi!
Còn về ma trận chuyển vị thì có khi cậu phải hỏi anh Google thui !!
Nhớ chạy bằng Free Pascal nhá, chạy bằng TURBO là Die lun <img src="https://cdn.jsdelivr.net/gh/twitter/twemoji@14.0.2/assets/72x72/1f642.png" class="smilie smilie--emoji" loading="lazy" width="72" height="72" alt=":)" title="Smile&nbsp; &nbsp; :)"&nbsp; data-smilie="1"data-shortname=":)" />))
Program goesaround;
Uses Crt;
var
&nbsp; &nbsp; a:array[0..1000,0..1000] of integer;
&nbsp; &nbsp; i,j,size,max:integer;

&nbsp; &nbsp; n:integer;

Procedure intial( i1,j1:shortint ;time:integer);
begin
&nbsp; &nbsp; &nbsp; &nbsp; While time&lt;max do
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; Begin
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if a[i,j]+1=n then break;
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; inc(time);
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; i:=i+i1;
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; j:=j+j1;
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; a[i,j]:=a[i-i1,j-j1]+1;
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; End;
end;
Procedure findsize;
var
&nbsp; &nbsp; &nbsp; &nbsp; r:real;
begin&nbsp;&nbsp; r:=sqrt<img src="https://cdn.jsdelivr.net/gh/twitter/twemoji@14.0.2/assets/72x72/1f44e.png" class="smilie smilie--emoji" loading="lazy" width="72" height="72" alt="(n)" title="Thumbs down&nbsp; &nbsp; (n)"&nbsp; data-smilie="23"data-shortname="(n)" />;
&nbsp; &nbsp; &nbsp; &nbsp; If r=trunc(r) then
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; size:=trunc(r)
&nbsp; &nbsp; &nbsp; &nbsp; else
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; size:=trunc(r)+1;
&nbsp; &nbsp; &nbsp; &nbsp; if size mod 2=0 then
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; inc(size);
&nbsp; &nbsp; &nbsp; &nbsp; i:= size div 2 +1;
&nbsp; &nbsp; &nbsp; &nbsp; j:= i;
&nbsp; &nbsp; &nbsp; &nbsp; a[i,j]:=1;
End;
Procedure Print;
Var
&nbsp; &nbsp; &nbsp; &nbsp; i,j:integer;
Begin
&nbsp; &nbsp; &nbsp; &nbsp; for i:=1 to size do
&nbsp; &nbsp; &nbsp; &nbsp; Begin
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; for j:=1 to size do
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if a[i,j]=0 then
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; write(&#039; &#039;:4)
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; else
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; write(a[i,j]:4);
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; writeln;
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; writeln;
&nbsp; &nbsp; &nbsp; &nbsp; end;
End;
begin
&nbsp; &nbsp;&nbsp; clrscr;
&nbsp; &nbsp;&nbsp; write(&#039;&nbsp;&nbsp; Insert Number please&nbsp;&nbsp; &#039;);
&nbsp; &nbsp;&nbsp; Readln(&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;&nbsp; n&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; );
&nbsp; &nbsp;&nbsp; findsize;
&nbsp; &nbsp;&nbsp; max:=0;
&nbsp; &nbsp;&nbsp; while max+1&lt;&gt;size do
&nbsp; &nbsp;&nbsp; Begin
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; inc(j);
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; inc(max,2);
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; a[i,j]:=a[i,j-1]+1;
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; intial(1,0,1);
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; intial(0,-1,0);
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; intial(-1,0,0);
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; intial(0,1,0);
&nbsp; &nbsp;&nbsp; end;
&nbsp; &nbsp;&nbsp; print;
readln;
End.

</blockquote>

[QUOTE="lamfmhn95, post: 89821, member: 146031"] [CENTER][CENTER][CENTER]Đây là cách làm của mình, bạn thử xem sao. Mặc định là nó vẽ theo chiều kim đồng hồ. Nếu muốn tổng quát hơn thì sửa lạ 1 tí thôi! Còn về ma trận chuyển vị thì có khi cậu phải hỏi anh Google thui !! Nhớ chạy bằng Free Pascal nhá, chạy bằng TURBO là Die lun :))) Program goesaround; Uses Crt; var a:array[0..1000,0..1000] of integer; i,j,size,max:integer; n:integer; Procedure intial( i1,j1:shortint ;time:integer); begin While time<max do Begin if a[i,j]+1=n then break; inc(time); i:=i+i1; j:=j+j1; a[i,j]:=a[i-i1,j-j1]+1; End; end; Procedure findsize; var r:real; begin r:=sqrt(n); If r=trunc(r) then size:=trunc(r) else size:=trunc(r)+1; if size mod 2=0 then inc(size); i:= size div 2 +1; j:= i; a[i,j]:=1; End; Procedure Print; Var i,j:integer; Begin for i:=1 to size do Begin for j:=1 to size do if a[i,j]=0 then write(' ':4) else write(a[i,j]:4); writeln; writeln; end; End; begin clrscr; write(' Insert Number please '); Readln( n ); findsize; max:=0; while max+1<>size do Begin inc(j); inc(max,2); a[i,j]:=a[i,j-1]+1; intial(1,0,1); intial(0,-1,0); intial(-1,0,0); intial(0,1,0); end; print; readln; End.[/CENTER][/CENTER][/CENTER] [/QUOTE]

Tên

Mã xác nhận