Search found 29 matches

by QulinXao
Sun Jun 12, 2005 7:22 am
Forum: Volume 1 (100-199)
Topic: 116 - Unidirectional TSP
Replies: 226
Views: 36489

re

PLEASE HELP ME. WERE I am WRONG????
for all test from board my prog (see in top)gen good result
but judge get WA
where bug???
by QulinXao
Mon Jun 06, 2005 7:24 pm
Forum: Volume 1 (100-199)
Topic: 116 - Unidirectional TSP
Replies: 226
Views: 36489

What wrong with 116

pls get me hint:what wrong with my source for all test I can find here my prog gen right output: const mm=10;mn=100;type l=longint; var a,b,c:array[1..mm,1..mn] of l;o,q,m,n,t,x,y:l; begin {assign(input,'inp.3');reset(input);} while not eof do begin read(m,n);if(m<1)or(n<1) then break; for y:=1 to m...
by QulinXao
Sat Jun 04, 2005 3:33 pm
Forum: Pascal
Topic: What wrong with Pascal compiler in UVA?
Replies: 4
Views: 6766

What wrong with Pascal compiler in UVA?

here 2 solution for 10790 problem:
Cut after answer
they get same output BUT in UVA
sol1 AC & sol2 is WA ,
where I wrong? or Uva realy have strange bihavier?

PS. misof thank you!
by QulinXao
Mon May 09, 2005 10:36 pm
Forum: Algorithms
Topic: Enumerating labeled trees
Replies: 1
Views: 703

hint: rooted trees of height at most 2. == Bell number's 1 1 2 2 3 5 5 7 10 15 ... where B(n)=F(n,1) F(1,1)==0 F(n,1)=F(n-1,n-1) F(n,k)=F(n,k-1)+F(n-1,k-1) but tle cose T(n)~O(n^2) and need c*n^2 memory for long number but for good side B(n)<n! B(n)~O((n/log(n))^n) good luck, try 10844(wich was E on...
by QulinXao
Mon May 09, 2005 10:15 pm
Forum: Volume 108 (10800-10899)
Topic: 10848 - Make Palindrome Checker
Replies: 26
Views: 14872

All simple
u MUST very cerefull
u must right test p1
0<length(s1)<1001 0<=n<... etc
by QulinXao
Wed Apr 27, 2005 4:28 am
Forum: Volume 107 (10700-10799)
Topic: 10720 - Graph Construction
Replies: 49
Views: 30746

What wrong?

var c:boolean;e,i,m,s,t,v:longint; begin repeat read(v); if v=0 then break; s:=0;c:=true;m:=0;t:=0; for i:=1 to v do begin read(e); if e<0 then c:=false; if e>0 then inc(t); if e>m then m:=e; s:=(s+(e mod 2))mod 2; end; if t>0 then if m>t-1 then c:=false; if c and (s=0) then writeln('Possible') else...
by QulinXao
Mon Apr 25, 2005 9:42 pm
Forum: Volume 107 (10700-10799)
Topic: 10790 - How Many Points of Intersection?
Replies: 28
Views: 16447

Sorry but what here wrong?

o:comp;function T(a:longint):longint;begin t:=a*(a-1)div 2;end;
begin n:=0;
repeat
read(a,b);
if(a=0)and(b=0)then break;
o:=t(a); o:=o*T(b);
inc(n);
writeln('Case ',n,': ',o:0:0);
until false;
end.
by QulinXao
Sat Jan 15, 2005 6:59 am
Forum: Volume 105 (10500-10599)
Topic: 10596 - Morning Walk
Replies: 41
Views: 14851

U must remember The Graf must be connected, Not Forrest,
from any point must be path to any other
by QulinXao
Mon Jan 03, 2005 3:49 pm
Forum: Off topic (General chit-chat)
Topic: How old are you? Statistics.
Replies: 121
Views: 175869

I am 24 old . here I from dec 1998 now Ac 162
my plan evry 4 day 0,0,10,10 = 20 Ac evry 4 day
if your get 3 ac by day you never solve all cose judge add speedy.
CUL :cry:
by QulinXao
Mon Jan 03, 2005 2:41 pm
Forum: Off topic (General chit-chat)
Topic: What happened to acm.timus.ru
Replies: 5
Views: 2857

that :( hapaned

As say master of site asm.timus.ru in forum on some russian site
(algolist.manual.ru maybe ?) the Isever was on mashine which
was in his work from he fired.
when he find plase he runagain his good site
by QulinXao
Mon Jan 03, 2005 12:33 pm
Forum: Volume 3 (300-399)
Topic: 371 - Ackermann Functions
Replies: 196
Views: 28807

hint for 371

Only one hint need for this problem if l>h then swap(l,h) {code for find longest seq} out (l,h,minnumberwhenseqlongest,seqlong) ONLY ONE HINT. NOT MORE the type wich need simple signed 32 bit (read carefuly problem: "The largest value in the sequence will not be larger than can be accomodated in a 3...
by QulinXao
Mon Apr 12, 2004 11:06 am
Forum: Volume 1 (100-199)
Topic: 107 - The Cat in the Hat
Replies: 278
Views: 20756

sorry to all cose I test on all test here and get some hint what was wrong in my "Good sol...",now I get acccepted 107 problem.
And what amazing the algo more simple then pred I post :o
by QulinXao
Mon Apr 05, 2004 11:39 am
Forum: Volume 1 (100-199)
Topic: 107 - The Cat in the Hat
Replies: 278
Views: 20756

Good solution in 107 but get WA!!! What wrong in algo?

here good solution but WA what wrong: get x y where x==a^b (1) and y==(a-1)^b (2) sheach b with this property: exp(ln(exp(ln(x)/b) -1)*b)==y then out is: ((a-1)^b-1)/(a-1-1) and (a^(b+1)-(a-1)^(b+1))/(a-(a-1)) or same (y-1)/(a-2) and a*x-(a-1)*y [pascal]var x,y,a,b:int64;begin repeat readln(x,y); if...
by QulinXao
Mon Apr 05, 2004 11:37 am
Forum: Volume 1 (100-199)
Topic: 107 - The Cat in the Hat
Replies: 278
Views: 20756

Good but WA

here good solution but WA what wrong: get x y where x==a^b (1) and y==(a-1)^b (2) sheach b with this property: exp(ln(exp(ln(x)/b) -1)*b)==y then out is: ((a-1)^b-1)/(a-1-1) and (a^(b+1)-(a-1)^(b+1))/(a-(a-1)) or same (y-1)/(a-2) and a*x-(a-1)*y [pascal]var x,y,a,b:int64;begin repeat readln(x,y); if...

Go to advanced search