Search found 6 matches

by minus273
Tue Jan 27, 2004 10:25 am
Forum: Volume 1 (100-199)
Topic: 101 - The Blocks Problem
Replies: 635
Views: 109728

Anyone can help me?
by minus273
Tue Jan 27, 2004 7:49 am
Forum: Volume 1 (100-199)
Topic: 101 - The Blocks Problem
Replies: 635
Views: 109728

Now NO TLE but WA...
[pascal]
program uva101;
{The blocks program}
var
b:packed array[0..24,0..25] of byte;
p:packed array[0..24] of byte;
stack:array[1..25] of byte;
size,i,j,k,stackp:word;
cmd,part1,part2:string;
op1,op2,tm1,tm2:word;
procedure mope(block,dest:word);
begin
dec(b[p[block],0 ...
by minus273
Tue Jan 27, 2004 7:42 am
Forum: Off topic (General chit-chat)
Topic: Language used to create electronic judge
Replies: 4
Views: 3962

bash or other shell?
by minus273
Tue Jan 27, 2004 7:41 am
Forum: Volume 1 (100-199)
Topic: 101 - The Blocks Problem
Replies: 635
Views: 109728

Volume I #101 TLE

[pascal]
program uva101;
{The blocks program}
var
b:packed array[1..25,0..25] of byte;
p:packed array[1..25] of byte;
stack:array[1..25] of byte;
size,i,j,k,stackp:word;
cmd,part1,part2:string;
op1,op2,tm1,tm2:word;
procedure mope(block,dest:word);
begin
dec(b[p[block],0]);
inc(b[dest,0 ...
by minus273
Mon Jan 26, 2004 3:23 pm
Forum: Volume 1 (100-199)
Topic: 100 - The 3n + 1 problem
Replies: 1394
Views: 318836

Well I found my mistake:
[pascal]
for i:=b downto a
[/pascal]
just 's/downto/to/'
by minus273
Mon Jan 26, 2004 3:16 pm
Forum: Volume 1 (100-199)
Topic: 100 - The 3n + 1 problem
Replies: 1394
Views: 318836

[pascal]
program uva100;
{3n+1 problem}
function find(num:longword):longword;
var
fd:integer;
begin
fd:=1;
while (num<>1) do begin
inc(fd);
if num mod 2=1 then
num:=num*3+1
else
num:=num div 2;
end;
find:=fd;
end;
var
a,b,i,c,mc:longword;
begin
repeat
readln(a,b);
mc:=0;
if a<=b then ...

Go to advanced search