## Search found 192 matches

Mon May 26, 2003 4:34 am
Forum: General
Topic: never mind
Replies: 3
Views: 1035
Yes, you can send it to me via PM.

Mon May 19, 2003 4:35 am
Forum: Volume 3 (300-399)
Topic: 336 - A Node Too Far
Replies: 121
Views: 42198
Thanks, for replying. In my code, node 4 have TTL = 1. if the input : 4 1 2 2 3 3 4 1 4 1 1 1 2 1 3 1 0 0 0 My output produce: Case 1: 1 nodes not reachable from node 1 with TTL = 1. Case 2: 0 nodes not reachable from node 1 with TTL = 2. Case 3: 0 nodes not reachable from node 1 with TTL = 3. Case ...
Sat May 17, 2003 10:36 am
Forum: Volume 1 (100-199)
Topic: 170 - Clock Patience
Replies: 28
Views: 2689
No, the output for sample input in problem is KD, not KC.
Sat May 17, 2003 5:35 am
Forum: Volume 4 (400-499)
Topic: 424 - Integer Inquiry
Replies: 96
Views: 21393
Hi!

your code still wrong, try this:
93
93
93
93
0
Sat May 17, 2003 5:27 am
Forum: General
Topic: never mind
Replies: 3
Views: 1035
Have you memorized all of the burned segment?
Sat May 17, 2003 5:18 am
Forum: General
Topic: tell me some easy problems in Volume I ,thanks a lot.
Replies: 15
Views: 9055
In V-4, try to solve P-453(Intersecting Circle). The problem is very easy, but very hard to got AC.
In V-102, there are many of math problem,
try "Math Lovers
Sat May 17, 2003 5:00 am
Forum: Volume 3 (300-399)
Topic: 339 - SameGame Simulation
Replies: 26
Views: 11892
After we encounter the "0, 0", we must check 2 condition:
1. If the game won, we must output : "Game Won".
2. Otherwise you must output the final configuation of that game.

Hope this helps.
Sat May 17, 2003 4:47 am
Forum: Volume 104 (10400-10499)
Topic: 10468 - Rigid Circle Packing
Replies: 1
Views: 1447

### 10468 - Rigid Circle Packing

Can anyone enlightened me, how to solve this kind of problem ?

Thanks.
Sat May 17, 2003 4:32 am
Forum: Volume 102 (10200-10299)
Topic: 10236 - The Fibonacci Primes
Replies: 28
Views: 11818

### 10236

Hi, I always got WA, maybe this is precision error problem.

Can anyone tell me what the output for this test case:
10133
9912
7710
1929
19991
20011
91
1771
2771
899
1019
113
7192
9412
761
1991
57

Thanks
Sat May 17, 2003 3:59 am
Forum: Volume 104 (10400-10499)
Topic: 10421 - Critical Wave
Replies: 17
Views: 5447
Hahaha...
Finally I got AC. Thanks Little John.
The only mistake is my code give 1, when the input = 0.

Huge Thanks,
RS
Sat May 17, 2003 3:57 am
Forum: Volume 104 (10400-10499)
Topic: 10491 - Cows and Cars
Replies: 17
Views: 8744
Yes, this is an easy problem, try to think about possibilities.
Wed May 14, 2003 4:45 am
Forum: Volume 104 (10400-10499)
Topic: 10421 - Critical Wave
Replies: 17
Views: 5447
Hi!,

I always got WA on this problem, Is there any critical input ? I use DP(LIS) to break this problem.

Can anyone give me some test case.
Thanks,
RS
Wed May 14, 2003 4:35 am
Forum: Volume 2 (200-299)
Topic: 275 - Expanding Fractions
Replies: 47
Views: 22296
Yes, since ascii '0' is 48, so I use div+48, to make char '0', '1', '2', '3', '4', ....

'0' = 0 + 48;
'1' = 1 + 48;
'2' = 2 + 48;
'3' = 3 + 48;
'4' = 4 + 48;
etc.
Tue May 13, 2003 4:26 am
Forum: Volume 2 (200-299)
Topic: 275 - Expanding Fractions
Replies: 47
Views: 22296
Sure. My method is like this: 3 / 7 = ? 0.428571 /--------- 7 / 30 28 ------- - 20 14 ------- - 60 56 ------ - 40 35 ------- - 50 49 ------- - 10 7 ------- - 3 ->here you see the pattern repeated. What I do is build a string division, and divide the number until we find the pattern repeated. (I save...
Mon May 12, 2003 8:28 am
Forum: Volume 3 (300-399)
Topic: 311 - Packets
Replies: 29
Views: 17370
Hi! :lol: :lol: :lol: The problem is to count how many packets of size 6x6 that can fit all the delivery packets (size 1x1, 2x2, 3x3, 4x4, 5x5, 6x6). "These products are always delivered to customers in the square parcels of the same height h as the products have and of the size 6x6" (All box (Squar...