## Search found 75 matches

- Sat Nov 29, 2003 2:19 am
- Forum: Volume 101 (10100-10199)
- Topic: 10173 - Smallest Bounding Rectangle
- Replies:
**18** - Views:
**5090**

- Tue Jul 01, 2003 5:30 pm
- Forum: Volume 105 (10500-10599)
- Topic: 10508 - Word Morphing
- Replies:
**35** - Views:
**12804**

- Tue Jul 01, 2003 3:03 pm
- Forum: Volume 105 (10500-10599)
- Topic: 10508 - Word Morphing
- Replies:
**35** - Views:
**12804**

- Fri Jun 27, 2003 4:06 am
- Forum: Volume 102 (10200-10299)
- Topic: 10299 - Relatives
- Replies:
**57** - Views:
**15689**

Thanks for your answer. Sorry :oops: I got mixed up with the inputs. I add two more for cheking a possible overflow, they are: INPUT: 1000000000 10000000001 OUTPUT: 400000000 1600000000 second one 9897840000 10000000001 = 101 x 3541 x 27961 Actually, the problem describes that n <= 1000000000, so i...

- Thu Jun 26, 2003 4:11 pm
- Forum: Volume 102 (10200-10299)
- Topic: 10299 - Relatives
- Replies:
**57** - Views:
**15689**

- Thu Jun 19, 2003 1:01 pm
- Forum: Volume 105 (10500-10599)
- Topic: 10508 - Word Morphing
- Replies:
**35** - Views:
**12804**

I've thinked a lot trying to find a way to do this problem without caring about the number of words, but I couldn't find any. I coded with mallocs ... no problems with that, and I made a dfs to find the solution. It's ok , but I got TLE . I optimized it with a matrix pre calculating the distances o...

- Wed Jun 18, 2003 6:29 pm
- Forum: Volume 105 (10500-10599)
- Topic: 10508 - Word Morphing
- Replies:
**35** - Views:
**12804**

### Re: 10508-Word Morphing ,runtime error!

The description of this problem include: The number of words are unlimited! But I don't know how many words there are in one case at most. One method, you can use malloc, because first line of each case will tell you how many words and how long of each word. But, since the problem descript that &qu...

- Tue Jun 10, 2003 3:07 pm
- Forum: Volume 101 (10100-10199)
- Topic: 10139 - Factovisors
- Replies:
**80** - Views:
**30408**

### ...

Maybe you can try this

Input

5 5

Output

5 divides 5!

Input

5 5

Output

5 divides 5!

- Sun Feb 09, 2003 8:50 am
- Forum: Volume 102 (10200-10299)
- Topic: 10299 - Relatives
- Replies:
**57** - Views:
**15689**

### ...

987654321 = 3^2 x 17^2 x 379721 it has three prime factors 3, 17, 379721 your prime table only up to 32000. in this case, you lost the last one prime 379721 and your answer become 987654321 * ( 1-1/3 ) * ( 1-1/17 ) = 619704672 and the correct answer is 987654321 * ( 1-1/3 ) * ( 1-1/17 ) * (1-1/37972...

- Sun Nov 03, 2002 11:02 am
- Forum: Volume 100 (10000-10099)
- Topic: 10011 - Where Can You Hide?
- Replies:
**58** - Views:
**13846**

Thanks for your reply. I have inserted the code for these cases, but I still get wrong answer. Can someone tell me the output for: 4 5 5 5 0.1 6.42 5 5 5 0.1 5.998 5 5 5 0.0005 10 20 -24 6 25 -30 My program prints: 0.100 0.001 0.000 1.810 My program ( AC ) output ... 0.100 0.001 0.001 1.810 and the...

- Fri Nov 01, 2002 10:11 am
- Forum: Volume 100 (10000-10099)
- Topic: 10084 - Hotter Colder
- Replies:
**2** - Views:
**2367**

### 10084 - Hotter Colder

I just wonder that if 'Same' occurs ...how to express area ? 0.00 ?

and after 'Same' ... all cases should be 0.00 ... right ?

plz.. give me more test case, thx

and after 'Same' ... all cases should be 0.00 ... right ?

plz.. give me more test case, thx

- Thu Oct 31, 2002 8:45 am
- Forum: Volume 101 (10100-10199)
- Topic: 10173 - Smallest Bounding Rectangle
- Replies:
**18** - Views:
**5090**

### Re: thank you~~~

The largest rectangle is simply infinitely large. I think your proposition need some more definitions. Maybe you want to put the constraints on the rectangle that should have at least a certain number of points on the boundary or something else...I don't know hmm...only one constrain ... fit tightl...

- Mon Oct 28, 2002 7:41 am
- Forum: Volume 101 (10100-10199)
- Topic: 10173 - Smallest Bounding Rectangle
- Replies:
**18** - Views:
**5090**

### thank you~~~

thank Ivan Golubev and Adrian Kuegel... I starts form theta = 0, inc = 1 to searching for the smallest rectangle. Then decreasing inc to inc/10, searching in smaller interval... repeat ...10 times ... WA ... 11 times ... AC :) thank you all .... and If I wanna search the "largest" rectangl...

- Thu Oct 24, 2002 5:39 pm
- Forum: Volume 101 (10100-10199)
- Topic: 10173 - Smallest Bounding Rectangle
- Replies:
**18** - Views:
**5090**

is there always one side of input polygon be the same side of the smallest rectangle ? I'm not sure about this. My accepted solution computes convex hull and then rotates it from 0 to pi/2 to find smallest possible rectangle. mm.. I rotate it from -PI~PI using rotation matrix, inc theta by PI/1800 ...

- Thu Oct 24, 2002 9:17 am
- Forum: Volume 101 (10100-10199)
- Topic: 10173 - Smallest Bounding Rectangle
- Replies:
**18** - Views:
**5090**