Search found 16 matches

by oker
Tue Jul 30, 2002 11:19 am
Forum: Volume 103 (10300-10399)
Topic: 10331 - The Flyover Construction
Replies: 19
Views: 5140

I've considered your opinion and changed my program. But still I got WA. [pascal] program k331; type Tpoint=^Tr; Tr=record a :integer; next :Tpoint; end; var v,e,i,j :integer; a,b,c :integer; link,dist,tt :array[1..100,1..100] of integer; so :array[1..10000] of integer; path,hash :array[1..100,1..10...
by oker
Mon Jul 29, 2002 6:27 am
Forum: Volume 102 (10200-10299)
Topic: 10288 - Coupons
Replies: 8
Views: 3597

10288 - Coupons

I have no idea what formular to use to solve this math problem. Please give me a hint. Thank you!
by oker
Thu Jul 18, 2002 2:12 pm
Forum: Volume 103 (10300-10399)
Topic: 10332 - The Absent Minded Professor
Replies: 22
Views: 6635

Oh, I see... Thank you!
by oker
Thu Jul 18, 2002 7:28 am
Forum: Volume 103 (10300-10399)
Topic: 10332 - The Absent Minded Professor
Replies: 22
Views: 6635

But the correct answer for this test case is (0,2,3) and (0,1,3) is not correct. (I took a look at the problem index and this problem is single-answered.) How to explain this? :(
by oker
Thu Jul 18, 2002 7:22 am
Forum: Volume 103 (10300-10399)
Topic: 10326 - The Polynomial Equation
Replies: 18
Views: 6222

Thank you!

Thank you for your help! I made so foolish mistake :) I got AC now!
by oker
Thu Jul 18, 2002 1:01 am
Forum: Volume 103 (10300-10399)
Topic: 10332 - The Absent Minded Professor
Replies: 22
Views: 6635

10332 - A question with the problem description

I have a question with the problem: In the sample #1 (0,2,3) and (0,1,3) are both solutions .Why say (0,2,3) is the correct solution and (0,1,3) is the 'image' ? Why cannot (0,2,3) be the 'image' of (0,1,3)?
by oker
Thu Jul 18, 2002 12:58 am
Forum: Volume 103 (10300-10399)
Topic: 10326 - The Polynomial Equation
Replies: 18
Views: 6222

10326 - Polynomail Equation - Why I got WA?

Here's my code. I can't find the bugs. :( Help me! Thank you! [pascal] program k326; type Tshi=array[0..50] of extended; var shi :array[1..50] of Tshi; n,i :integer; a :extended; procedure Pmul(a,b:Tshi; var c:Tshi); var i,j :integer; begin fillchar(c,sizeof(c),0); for i:=0 to n do if a <>0 then for...
by oker
Wed Jul 17, 2002 4:11 am
Forum: Volume 102 (10200-10299)
Topic: 10271 - Chopsticks
Replies: 20
Views: 10824

10271 - Chopsticks

I guess that Dynamic Programming should be used to solve this problem, but I don't know the details. Please help me and thank you very much!
by oker
Wed Jul 17, 2002 4:00 am
Forum: Volume 103 (10300-10399)
Topic: 10332 - The Absent Minded Professor
Replies: 22
Views: 6635

10332 - The Absent Minded Professor

This problem seems so hard. I don't know what algorithm to use. :( Please help me! Thanks!
by oker
Wed Jul 17, 2002 2:19 am
Forum: Volume 103 (10300-10399)
Topic: 10331 - The Flyover Construction
Replies: 19
Views: 5140

10331 - The Flyover Construction

Why did my code get WA? Help me, please! [pascal] program k331; type Tpoint=^Tr; Tr=record a :integer; next :Tpoint; end; var v,e,i :integer; a,b,c :integer; hash,link,dist,tt :array[1..100,1..100] of integer; so :array[1..10000] of integer; path :array[1..100,1..100] of Tpoint; ma :pointer; procedu...
by oker
Wed Apr 17, 2002 2:52 am
Forum: Volume 1 (100-199)
Topic: 138 - Street Numbers
Replies: 93
Views: 7685

Thank you!
by oker
Tue Apr 16, 2002 9:13 am
Forum: Volume 1 (100-199)
Topic: 138 - Street Numbers
Replies: 93
Views: 7685

Will you please show me your program? Thanks a lot!
by oker
Tue Apr 16, 2002 7:24 am
Forum: Volume 1 (100-199)
Topic: 138 - Street Numbers
Replies: 93
Views: 7685

I have a correct output here, you can compare it with the output which your program makes: 6 8 35 49 204 288 1189 1681 6930 9800 40391 57121 235416 332928 1372105 1940449 7997214 11309768 46611179 65918160 (The output format is not as the problem demands.)
by oker
Mon Apr 15, 2002 11:22 am
Forum: Volume 1 (100-199)
Topic: 138 - Street Numbers
Replies: 93
Views: 7685

I don't think it is enough by trying y either. I saw someone sloved it in math may -- just create a list of numbers: A(1)=0 , A(2)=1, and then A(n)=6*A(n-1)-A(n-2), and A(3)~A(12) are the first ten y's. This is extramely fast! But working out the formula was too hard!
by oker
Tue Apr 09, 2002 2:22 pm
Forum: Volume 1 (100-199)
Topic: 138 - Street Numbers
Replies: 93
Views: 7685

I cannot find one.Can u help me?

I cannot find one.Can u help me?

Go to advanced search