Reply to thread

Message

<blockquote data-quote="madurax86" data-source="post: 5977118" data-attributes="member: 1293">Mine takes 17.625 seconds when there are 6 digits <img src="/styles/default/xenforo/smilies/default/D.gif"&nbsp; class="smilie" loading="lazy" alt=":D" title="Big grin&nbsp; &nbsp; :D" data-shortname=":D" /> lol it should be slow man! its not taking time to fill the memory its for the video buffer(console display) anyway good that you made the algorithm ! <img src="/styles/default/xenforo/smilies/default/D.gif"&nbsp; class="smilie" loading="lazy" alt=":D" title="Big grin&nbsp; &nbsp; :D" data-shortname=":D" />So far i don't handle duplicates <img src="/styles/default/xenforo/smilies/default/P.gif"&nbsp; class="smilie" loading="lazy" alt=":P" title=":P&nbsp; &nbsp; :P" data-shortname=":P" />, I'm trying to make an algorithm for non repeating digits (පුනරාවර්තනය රහිත) we'll see! <img src="/styles/default/xenforo/smilies/default/P.gif"&nbsp; class="smilie" loading="lazy" alt=":P" title=":P&nbsp; &nbsp; :P" data-shortname=":P" /> i'm still thinking the algo will most probably be made tomorrow heres the pascal/delphi procedure[code]const ELEMENTS&nbsp; = 5;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp;&nbsp; //element count -1const PLACES&nbsp; &nbsp; = 5;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp;&nbsp; //place count&nbsp; -1var&nbsp; &nbsp; lst:array [0..ELEMENTS] of integer;&nbsp; &nbsp; nlst:array of array [0..PLACES] of integer;procedure SetListWR();var i,j,LEN,k:integer;begin&nbsp; &nbsp; LEN:=Pow(ELEMENTS+1,PLACES+1);&nbsp; &nbsp; SetLength(nlst,LEN);&nbsp; &nbsp; k:=0;&nbsp; &nbsp; for j:=0 to PLACES do&nbsp; &nbsp; &nbsp; &nbsp; for i:=0 to LEN-1 do&nbsp; &nbsp; &nbsp; &nbsp; begin&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if ((i) mod pow(ELEMENTS+1,j)) = 0 then&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; begin&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if (k=ELEMENTS) then&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; k:=0&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; else&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; k:=k+1;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; end;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; nlst[i,j]:=lst[k];&nbsp; &nbsp; &nbsp; &nbsp; end;&nbsp; &nbsp; k:=0 ;&nbsp; &nbsp; for j:=0 to LEN -1 do&nbsp; &nbsp; begin&nbsp; &nbsp; &nbsp; &nbsp; for i:=0 to PLACES do&nbsp; &nbsp; &nbsp; &nbsp; begin&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; write(nlst[j,i]);&nbsp; &nbsp; &nbsp; &nbsp; end;&nbsp; &nbsp; &nbsp; &nbsp; writeln('');&nbsp; &nbsp; &nbsp; &nbsp; k:=k+1;&nbsp; &nbsp; end;&nbsp; &nbsp; Writeln('Number of permutations : ',k);end;[/code]</blockquote>

[QUOTE="madurax86, post: 5977118, member: 1293"] Mine takes 17.625 seconds when there are 6 digits :D lol it should be slow man! its not taking time to fill the memory its for the video buffer(console display) anyway good that you made the algorithm ! :D So far i don't handle duplicates :P, I'm trying to make an algorithm for non repeating digits (පුනරාවර්තනය රහිත) we'll see! :P i'm still thinking the algo will most probably be made tomorrow heres the pascal/delphi procedure [code] const ELEMENTS = 5; //element count -1 const PLACES = 5; //place count -1 var lst:array [0..ELEMENTS] of integer; nlst:array of array [0..PLACES] of integer; procedure SetListWR(); var i,j,LEN,k:integer; begin LEN:=Pow(ELEMENTS+1,PLACES+1); SetLength(nlst,LEN); k:=0; for j:=0 to PLACES do for i:=0 to LEN-1 do begin if ((i) mod pow(ELEMENTS+1,j)) = 0 then begin if (k=ELEMENTS) then k:=0 else k:=k+1; end; nlst[i,j]:=lst[k]; end; k:=0 ; for j:=0 to LEN -1 do begin for i:=0 to PLACES do begin write(nlst[j,i]); end; writeln(''); k:=k+1; end; Writeln('Number of permutations : ',k); end; [/code] [/QUOTE]

Verification

Winadiyakata thappara keeyak tibeda?

Search

Latest ads

Reply to thread