## Search found 192 matches

Sat May 10, 2003 10:22 am
Forum: Volume 6 (600-699)
Replies: 14
Views: 9381

Hi,
Can anyone tell me what the output for this test cases:

1
2
student
2
#0#0
#00

Thanks.
RS
Sat May 10, 2003 9:11 am
Forum: Volume 3 (300-399)
Topic: 311 - Packets
Replies: 29
Views: 17047
Hi,

input:
5000 1400 300 200 100 100

output:
628
Fri May 09, 2003 9:07 am
Forum: Volume 3 (300-399)
Topic: 336 - A Node Too Far
Replies: 121
Views: 40814

### Always - Getting WA ... 336 - A node too Far

Hi, I don't know why I always got WA. I have try all the possibilities for input.
and it woks. But I don't know why always got WA.
Any hint ?
my method : DFS.

Code: Select all

``Cut..``
Thanks.
Fri May 09, 2003 3:34 am
Forum: Volume 101 (10100-10199)
Topic: 10154 - Weights and Measures
Replies: 60
Views: 40478
Hehe....
This is just a one dimension LIS.
Thanks maxim, now I got AC.
Fri May 09, 2003 3:28 am
Forum: Volume 104 (10400-10499)
Topic: 10465 - Homer Simpson
Replies: 75
Views: 23027

### 10465.

Hi, elsa@nnnn
but still crash in this input:
Input:

9 7 6 2
2 5 6
45 23 91
5 9 19

Regards,
RS
Thu May 08, 2003 5:23 am
Forum: Volume 104 (10400-10499)
Topic: 10465 - Homer Simpson
Replies: 75
Views: 23027
Hi!

Try this test cases:
9 7 6 2
2 5 6
45 23 91
5 9 19

output
8
3
3
3

Wed May 07, 2003 12:28 pm
Forum: Volume 5 (500-599)
Topic: 594 - One Little, Two Little, Three Little Endians
Replies: 46
Views: 13667
You don't need to convert decimal to binary. Just using shift right - shift left to solve this problem. Or using "memcpy". I think that can break this problem easily.

hope this helps.
Wed May 07, 2003 12:20 pm
Forum: Volume 6 (600-699)
Topic: 615 - Is It A Tree?
Replies: 71
Views: 23797
Please be carefull, the input can be like this:

input:
1 2
1
4 5
0 0

output:
Case 1 is not a tree.

Hope this helps.
Wed May 07, 2003 12:11 pm
Forum: Volume 6 (600-699)
Topic: 644 - Immediate Decodability
Replies: 13
Views: 5924
Becareful the 'enter' can be appear everywhere.
I solve this problem by using function getchar, and if the character not '0' or '1', I ignore it.
The hardest of this problem is parsing input, and it always cause WA.

Consider the input can be like this:
0
1
1
0
0
010
00
0
0
9

Hope this helps.
Wed May 07, 2003 11:42 am
Forum: Volume 101 (10100-10199)
Topic: 10154 - Weights and Measures
Replies: 60
Views: 40478
Hi!
I Have solved all problem that Maxim said. (except 10051).
But I don't have any idea how to solve this problem. It is like an LIS with two dimension. There are weights and strenght.
Can anybody tell me the basic idea how to solve this problem.

Thanks.
RS
Wed May 07, 2003 3:51 am
Forum: Volume 104 (10400-10499)
Topic: 10489 - Boxes of Chocolates
Replies: 28
Views: 8288
Hi!

I think this problem don't need special techniques.
Just calculate the number of chocolates by : a1*a2*a3*...*an.

And for modulus use this equation:
(a * b) mod m = ((a mod m) * (b mod m)) mod m

Hope this helps.
Mon May 05, 2003 11:33 am
Forum: Volume 104 (10400-10499)
Topic: 10490 - Mr. Azad and his Son!!!!!
Replies: 20
Views: 10286
Hi! Pingus.

I think your code is right.
I don't find anything wrong with your code!
Thu May 01, 2003 4:42 am
Forum: Volume 4 (400-499)
Topic: 498 - Polly the Polynomial
Replies: 73
Views: 13842
Hi!

First Glance at your code, it seems alright,
but there's still some mistake.

Consider this input:

Code: Select all

``````input:
10   2    3
11   12   -2

Output:
1235 1467 39``````
Your code become wrong when there exist space.
Hope this helps.
Wed Apr 30, 2003 3:31 am
Forum: Volume 2 (200-299)
Topic: 280 - Vertex
Replies: 95
Views: 22514
Hi, Thanks per.
I got AC.
Sat Apr 26, 2003 9:46 am
Forum: Volume 104 (10400-10499)
Topic: 10466 - How Far?
Replies: 25
Views: 8488
Oh, how stupid Am I.

I have fixed my mistakes and got AC.
Thanks, shamim.