## Search found 28 matches

Wed Mar 28, 2007 10:02 pm
Forum: Volume 111 (11100-11199)
Topic: 11186 - Circum Triangle
Replies: 18
Views: 7278

### O(n^2) algorithm

we know that triangle-area is | (x1*y2) + (x2*y3) + (x3*y1) - (x2*y1) + (x3*y2) + (x1*y3) | / 2 simply, area of all of trianlges is ( A_ij ) * ( x_i ) * ( y_j ) / 2 if you know that A_ij for ( 1 <= i , j <= n ) then, you can calculate the all of triangles with complexity O(n^2) addtionally, the A_ij...
Sat Feb 10, 2007 3:57 pm
Forum: Volume 111 (11100-11199)
Topic: 11152 - Colourful Flowers
Replies: 45
Views: 21964
helloneo wrote:Sometimes, just a small difference make a rounding error..
For example, if you got the value 1.2345499999999999, 0.0000000000001 is very important..
Fri Feb 09, 2007 3:36 pm
Forum: Volume 111 (11100-11199)
Topic: 11152 - Colourful Flowers
Replies: 45
Views: 21964

### hm..

helloneo wrote:See sohel's post..
what's the difference between 3.1415926 and 3.141593 ??

it is related in the requirement of problem ( 4 precious ? )

Fri Feb 09, 2007 1:49 pm
Forum: Volume 111 (11100-11199)
Topic: 11152 - Colourful Flowers
Replies: 45
Views: 21964

### i got WA

could you check the my code ??

would you teach me what is wrong ?

Code: Select all

`` cut ``
Wed Feb 07, 2007 12:17 pm
Forum: Volume 1 (100-199)
Topic: 123 - Searching Quickly
Replies: 55
Views: 5068

### Oh my god!

The online judge should send you an email explaining the reason for compile error. Please check the mails. If you don't receive any mail with each submission, you have the option disabled. So edit your accounts' profile so that you receive the mails. oh my god ! i forget them. i was soooooooooooooo...
Wed Feb 07, 2007 1:06 am
Forum: Volume 1 (100-199)
Topic: 123 - Searching Quickly
Replies: 55
Views: 5068

### problem 123. / i got compile error

when i use the VC 6 or gcc 3.4.4 (cygwin), i did'nt find the any erorrs

just, some warnings are found.

but, the result(submission status) in online-judge is compile error.

could you try to compile the following code ?

Code: Select all

`` cut ``
Sun Aug 27, 2006 7:46 pm
Forum: Volume 103 (10300-10399)
Topic: 10330 - Power Transmission
Replies: 43
Views: 15958

### 10330

I got correct answers for most of input datas in this board. my the submissions' status is 2006-08-27 17:32:56 Wrong Answer 0.139 528 0.139 sec. please, give me some critical input datas or .... if you can test my code, i'll send it to you. thanks. addtional, following datas are founded in this boar...
Thu Oct 27, 2005 5:52 pm
Forum: Volume 109 (10900-10999)
Topic: 10943 - How do you add?
Replies: 38
Views: 13290

### It's easy DP.

D[ l, s ] = { l : Length of expression, s : sum of expression } D[ l, s ] = SUM{ D[ l-1 , m ] } for m=0 to N and l <= K and, output is Since Larry is only interested in the last few digits of the answer, for each pair of numbers N and K, print a single number mod 1,000,000 on a single line.
Thu Jun 23, 2005 12:41 am
Forum: Volume 1 (100-199)
Topic: 113 - Power of Cryptography
Replies: 162
Views: 16244

### prototype.

scanf( const char *format, ... );

must be pointer variables like int* , char *, double*, in the "..."

so,

scanf("%lf", &p);
Thu Jun 23, 2005 12:31 am
Forum: Volume 1 (100-199)
Topic: 136 - Ugly Numbers
Replies: 156
Views: 18676

### hm.

( 2 * x ) or ( 3 * y ) or ( 4 * z ) <= 1500 prepare. x = 1, y = 1, z = 1 and the STACK[0] = 1 first. STACK[1] number is smallest number in ( 2*x ), ( 3*y), ( 4*z ) . you can found it ( 2 * x ) when x = 1 ; it is smallest number ; so, STACK[1] = 2 . and next number is must be larger then 2 so, set x=...
Thu Jun 16, 2005 4:19 pm
Forum: Volume 1 (100-199)
Topic: 104 - Arbitrage
Replies: 223
Views: 14107

### hints.

Thu Jun 16, 2005 1:04 am
Forum: Volume 1 (100-199)
Topic: 112 - Tree Summing
Replies: 137
Views: 14085

### 112. please, give me the test cases,..

Please give me the test cases.. input 22 (5(4(11(7()())(2()()))()) (8(13()())(4()(1()())))) 20 (5(4(11(7()())(2()()))()) (8(13()())(4()(1()())))) 10 (3 (2 (4 () () ) (8 () () ) ) (1 (6 () () ) (4 () () ) ) ) 5 () 0 () -1 (-1()()) 77 (77(1()())()) -77 (-77()()) -7 (1 (-6 (2 (1 ()()) (-4 ()(1 (1 ()())...
Tue Jun 14, 2005 10:12 am
Forum: Volume 107 (10700-10799)
Topic: 10774 - Repeated Josephus
Replies: 31
Views: 8188
Well the code you posted and ryan posted differs in output. My code produces the output exactly that ryan gave. Btw galious, how is input for 3 a length of 1 . For n=3 my output is 0 3. For n=1 my output is 0 1. Your output is 1 1. In problem it is stated that after the elimination round.For n=2 it...
Mon Jun 13, 2005 3:48 pm
Forum: Volume 107 (10700-10799)
Topic: 10774 - Repeated Josephus
Replies: 31
Views: 8188

### hi..

if you not solved this problem, then how about visit to follow page url.

http://isd.korea.ac.kr/~ajava/10774.php?n=23403

it programming by php script languagae....
Mon Jun 13, 2005 6:18 am
Forum: Volume 1 (100-199)
Topic: 107 - The Cat in the Hat
Replies: 278
Views: 20752

### got AC.

got AC when use the your power function.

time is 0:06.000(CPU).