Search found 106 matches

by Raiyan Kamal
Sun Jun 25, 2006 6:37 pm
Forum: Volume 101 (10100-10199)
Topic: 10182 - Bee Maja
Replies: 9
Views: 3233

There is a simple way for this problem. You can convert the coordinates using simple mathematical operations, simulation is not necessery.
by Raiyan Kamal
Thu Jun 15, 2006 11:28 am
Forum: Volume 109 (10900-10999)
Topic: 10929 - You can say 11
Replies: 69
Views: 27079

If you just add/substract alternative digits and chek the final sum, then leading zeroes are not supposed to create any problem. Why are a lot of people so worried about the leading zeroes ?
by Raiyan Kamal
Mon Jun 12, 2006 1:54 pm
Forum: Volume 104 (10400-10499)
Topic: 10477 - The Hybrid Knight
Replies: 19
Views: 6656

My answer is also 5. can you think of any other case ? Perhaps you can discuss your method as well. As I said earlier, I use BFS to find shortest path here.
by Raiyan Kamal
Fri Apr 07, 2006 12:07 pm
Forum: Volume 3 (300-399)
Topic: 388 - Galactic Import
Replies: 7
Views: 2930

Never mind, I've figured it by myself. Sometimes you have to face two problems in one. First you convert the fairy tale or sci-fi story like thing to an understandable version, then solve the real thing. It makes things more interesting though.
by Raiyan Kamal
Fri Apr 07, 2006 8:28 am
Forum: Volume 110 (11000-11099)
Topic: 11024 - Circular Lock
Replies: 14
Views: 4406

I don't know how to derive the system of linear equation everyone is talking about, I have solved it using GCD and subtraction only. After subtracting couple of numers, i chek if the lock is opened, i.e. 0,0,0,0 configuration or not. Can anyone explain the relation between these two methods ?
by Raiyan Kamal
Fri Apr 07, 2006 8:19 am
Forum: Volume 3 (300-399)
Topic: 388 - Galactic Import
Replies: 7
Views: 2930

can someone explain to me the significance of '*' in this problem ?
by Raiyan Kamal
Sat Mar 25, 2006 10:11 pm
Forum: Volume 104 (10400-10499)
Topic: 10477 - The Hybrid Knight
Replies: 19
Views: 6656

10477 - The Hybrid Knight

Hello,
i am trying to solve 10477, but getting WA. I am useing BFS. Will anyone please give some test cases ?
by Raiyan Kamal
Sun Mar 19, 2006 3:12 pm
Forum: Volume 110 (11000-11099)
Topic: 11012 - Cosmic Cabbages
Replies: 29
Views: 9016

I had to solve a problem like this some days ago and I came up with a brute-force solution. Later, when discussing it with others, someone gave me a good idea. Make a 3d convex hull and chek the points on the convex hull only. This will speed up the process, but for special cases where all the point...
by Raiyan Kamal
Fri Mar 17, 2006 8:17 am
Forum: Volume 3 (300-399)
Topic: 300 - Maya Calendar
Replies: 69
Views: 10049

a previous post on this problem :
http://online-judge.uva.es/board/viewtopic.php?t=5131

another ( with a good debugging idea ) :
http://online-judge.uva.es/board/viewtopic.php?t=5989

hope it helps
by Raiyan Kamal
Fri Mar 17, 2006 8:15 am
Forum: Volume 3 (300-399)
Topic: 371 - Ackermann Functions
Replies: 196
Views: 29399

they are supposed to send you a mail telling the error msgs. why dont you see that mail.
by Raiyan Kamal
Thu Mar 16, 2006 4:41 pm
Forum: Volume 100 (10000-10099)
Topic: 10009 - All Roads Lead Where?
Replies: 60
Views: 14911

I know its wrong, i did not put a wrong test case here for nothing. I did not check for name of more than one place starting with the same letter. But i got ACC. this implies there is no such case in the judge data. We have to produce only the correct output, remembe ? does not matter how you genera...
by Raiyan Kamal
Wed Mar 01, 2006 8:28 pm
Forum: Volume 102 (10200-10299)
Topic: 10220 - I Love Big Numbers !
Replies: 18
Views: 7745

Thanks Mahmud vai ! Small mistakes make such a big mess.
by Raiyan Kamal
Wed Sep 21, 2005 4:21 pm
Forum: Volume 4 (400-499)
Topic: 438 - The Circumference of the Circle
Replies: 29
Views: 9547

The probelm statement did not say that all three points will be distinct. Can your program generate correct output for cases like :

Code: Select all

1.0 1.0 1.0 1.0 1.0 1.0
by Raiyan Kamal
Wed Sep 21, 2005 4:12 pm
Forum: Volume 4 (400-499)
Topic: 413 - Up and Down Sequences
Replies: 22
Views: 5463

Try these cases : INPUT : 1 2 3 4 5 6 7 8 0 8 7 6 5 4 3 2 1 0 1 1 1 1 1 0 9 9 9 9 0 1 2 1 2 1 2 0 2 1 2 1 2 1 0 1 2 1 0 2 1 2 0 1 2 3 2 1 2 3 2 1 0 1 5 32 32 32 15 15 1 5 1 1 1 1 1 1 0 3 0 100 100 100 99 100 100 99 100 99 0 0 OUTPUT : Nr values = 8: 7.000000 0.000000 Nr values = 8: 0.000000 7.000000...
by Raiyan Kamal
Wed Sep 21, 2005 3:58 pm
Forum: Volume 4 (400-499)
Topic: 483 - Word Scramble
Replies: 122
Views: 20793

Here are some cases, hope it helps. INPUT: every dot is a . but not all dots are .s is it a good test case ? aa.bb.aa. a.....aaaa..a..a.a..a ''.'sd.f'df'.df.'f.' ...adf....fds....sdf .,,;;,',[,;, sdfklj ,s,df, /////sdfdf 123456 aasdf 568 sdf a1b2c3 :) i am r2d2. OUTPUT: yreve tod si a . tub ton lla ...

Go to advanced search