Search found 193 matches

by turuthok
Wed May 28, 2003 2:30 am
Forum: Volume 104 (10400-10499)
Topic: 10499 - The Land of Justice
Replies: 51
Views: 19558

You misunderstood the problem ... You have to find the initial-cost of the whole sphere using a very well-known formula. Then, since we divide it into n parts, the sell-value will be n x sell-value of each part. The sell-value of each part is also pretty obvious, just be careful on certain input(s)....
by turuthok
Sat May 24, 2003 4:54 am
Forum: ACM ICPC Archive Board
Topic: Problems 2000-2720 .....
Replies: 15
Views: 3736

This is really great!!! Thanks for all the effort ...

I tried it for "Building Bridges" ... got AC-ed too :)

-turuthok-
by turuthok
Thu May 22, 2003 9:31 am
Forum: Other words
Topic: The new leader is coming........
Replies: 6
Views: 4116

It definitely takes great dedication to be able to solve that many problems. Congratulations ...

-turuthok-
by turuthok
Sat May 10, 2003 4:17 pm
Forum: Volume 1 (100-199)
Topic: 170 - Clock Patience
Replies: 28
Views: 2517

Yes.

-turuthok-
by turuthok
Fri May 09, 2003 10:48 pm
Forum: Volume 1 (100-199)
Topic: 170 - Clock Patience
Replies: 28
Views: 2517

Hello titid, ... 51,KC seems very familiar to me ... it's all about this input description (especially the last sentence): The input will consist of decks of cards arranged in four lines of 13 cards, cards separated by a single blank. Each card is represented by two characters, the first is the rank...
by turuthok
Fri May 09, 2003 8:47 pm
Forum: Volume 104 (10400-10499)
Topic: 10487 - Closest Sums
Replies: 89
Views: 30291

Let's say you have these numbers in the input: 1, 1, and 3 ... (notice there are two ones there) ... The possible sum is: 1+3 -> 4 Notice that 1+1 -> 2 cannot be used since both numbers are the same. The problem description requires the numbers to be distinct. So, for input 3 1 1 3 1 2 0 The output ...
by turuthok
Fri May 09, 2003 2:15 am
Forum: Volume 3 (300-399)
Topic: 382 - Perfection
Replies: 95
Views: 19414

I think you've overdone this problem by implementing a linked-list ... but, probably you have good reasons ...

Code: Select all

for(p=head;p->next;p=p->next)
Don't you think it's should be:

Code: Select all

for(p=head;p;p=p->next)
And the output specification explicitly says 2 blank-spaces after n ...

-turuthok-
by turuthok
Thu May 08, 2003 10:25 pm
Forum: Volume 104 (10400-10499)
Topic: 10487 - Closest Sums
Replies: 89
Views: 30291

For 10487, probably the solution to your WA is to ignore the (a+b) where a == b ...

For 10489, I don't think your p := p*a statement can survive overflow problem eventhough you declared p as longint.

-turuthok-
by turuthok
Thu May 01, 2003 10:31 am
Forum: Volume 104 (10400-10499)
Topic: 10484 - Divisibility of Factors
Replies: 39
Views: 18797

Tomson, ... did you try d=-1 ???

I didn't look at the rest of your code, though ... just spotted that particular case.

Good luck,

-turuthok-
by turuthok
Thu May 01, 2003 8:20 am
Forum: Volume 104 (10400-10499)
Topic: 10484 - Divisibility of Factors
Replies: 39
Views: 18797

Don't get me wrong ...

n=0, d=1, output=1 ... (there is only one factor of 0! that is divisible by d)
n=0, d=2, output=0 ... (no factor of 0! that can divide d)

-turuthok-
by turuthok
Wed Apr 30, 2003 9:11 pm
Forum: Volume 104 (10400-10499)
Topic: 10484 - Divisibility of Factors
Replies: 39
Views: 18797

When n == 0, it's not necessary that the output will always be 0.
0! is divisible by 1 ...

-turuthok-
by turuthok
Wed Apr 30, 2003 11:42 am
Forum: Volume 104 (10400-10499)
Topic: 10489 - Boxes of Chocolates
Replies: 28
Views: 8222

Whinii, I think the one that made it clear is the last sentence:
Only the smallest boxes always contain some chocolates.
-turuthok-
by turuthok
Wed Apr 30, 2003 9:42 am
Forum: Volume 104 (10400-10499)
Topic: 10484 - Divisibility of Factors
Replies: 39
Views: 18797

I sent a reply ... good luck :)

-turuthok-
by turuthok
Wed Apr 30, 2003 8:16 am
Forum: Volume 104 (10400-10499)
Topic: 10484 - Divisibility of Factors
Replies: 39
Views: 18797

I just can think of boundary cases ... remember that n can be 0.

Code: Select all

0 2147483647
100 1
Dominik, you can send me your solution if you want ...

-turuthok-
by turuthok
Wed Apr 30, 2003 7:09 am
Forum: Volume 104 (10400-10499)
Topic: 10489 - Boxes of Chocolates
Replies: 28
Views: 8222

Whinii, I agree that it is somewhat confusing ...

Code: Select all

1
5 2
3 2 3 4
4 5 2 3 1
I interpreted that input to the following:
Box #1 contains 2 boxes. Each of those 2 boxes contains 3 smaller boxes, each of them contains 4 smaller boxes (these smallest boxes contain chocolates).

-turuthok-

Go to advanced search