Search found 148 matches

by 10153EN
Wed May 08, 2002 12:20 pm
Forum: Volume 100 (10000-10099)
Topic: 10007 - Count the Trees
Replies: 39
Views: 6840

Hi~~

You can convert the number to base 10000, which is capable of addition and multiplication without exceeding the boundary of int.

I have used this method to solve the problems which need the calculation of big numbers.
by 10153EN
Wed May 08, 2002 12:15 pm
Forum: Volume 1 (100-199)
Topic: 105 - The Skyline Problem
Replies: 160
Views: 28786

Oh, I found another minor printing error by having taken a look at your code. Your output is printed by [cpp] for(int i=1;i<10002;i++) { if(H !=H[i-1]) FOUT<<i<<' '<<H <<' '; } [/cpp] The above code will print the numbers with a space after each number. Right? e.g. If the number to be outputted is 1...
by 10153EN
Wed May 08, 2002 9:35 am
Forum: Volume 1 (100-199)
Topic: 105 - The Skyline Problem
Replies: 160
Views: 28786

I think for this problem (105), the P.E. is resulted from missing the '\n' at the end of the sequence of output numbers.

Try to add a '\n' at the end of the numbers and it will be got accepted.
by 10153EN
Tue May 07, 2002 7:23 pm
Forum: Volume 100 (10000-10099)
Topic: 10070 - Leap Year or Not Leap Year and ...
Replies: 233
Views: 54881

HI~

In the problem description it states that "All the years will not be less than 2000 (to avoid the earlier different rules for leap years). Please don
by 10153EN
Mon May 06, 2002 1:53 pm
Forum: Volume 1 (100-199)
Topic: 105 - The Skyline Problem
Replies: 160
Views: 28786

Hi~~

You received Accepted (P.E.). Right?

That means that your output matches with the sample output for the content, but differs with some minor things. e.g. space, the return at the end of the line, a blank line, etc.
by 10153EN
Sun May 05, 2002 7:27 am
Forum: Volume 4 (400-499)
Topic: 485 - Pascal's Triangle of Death
Replies: 50
Views: 5195

take an example for your 201 output: The largest number being 18020 05093 65116 43083 41211 84084 89422 71165 88341 82928 79277 73320 which has 60 digits. Number of 60 digits is larger than 10^59, but smaller than 10^60. A number is equal or larger than 10^60 if it's larger than 99999 99999 99999 99...
by 10153EN
Sat May 04, 2002 9:48 pm
Forum: Volume 4 (400-499)
Topic: 485 - Pascal's Triangle of Death
Replies: 50
Views: 5195

HI~~

For my accepted program, the last n = 204, but not the n = 201 in your output.

I think you have calculated with a smaller max-number-of-digit~
by 10153EN
Tue Apr 23, 2002 8:36 pm
Forum: Volume 102 (10200-10299)
Topic: 10268 - 498-bis
Replies: 51
Views: 17876

10268 - 498-bis

I would like to ask why there's runtime error in my program on the online judge?

Any traps or tricks on this problem?
by 10153EN
Sun Apr 07, 2002 3:32 pm
Forum: Volume 102 (10200-10299)
Topic: 10211 - Divisibility Testing! Wow!
Replies: 10
Views: 4648

10211 - Divisibility Testing! Wow!

I have tired this problem but got wrong answer...

Could anyone tell me what's the base of the second input of each input set?

e.g. if the input is 16 20
then it means the base is 16
but the 20 means a decimal 20 or 20 of base 16?

Thx in advance =)
by 10153EN
Mon Mar 25, 2002 5:59 pm
Forum: Volume 4 (400-499)
Topic: 425 - Enigmatic Encryption
Replies: 6
Views: 2041

Any hints about this problem?

I can just think of brute force..
But seems may get time limit exceeded...
any other tricks??

Thx
by 10153EN
Mon Mar 25, 2002 5:59 pm
Forum: Volume 4 (400-499)
Topic: 425 - Enigmatic Encryption
Replies: 6
Views: 2041

Any hints about this problem?

I can just think of brute force..
But seems may get time limit exceeded...
any other tricks??

Thx
by 10153EN
Sun Jan 06, 2002 9:17 pm
Forum: Volume 4 (400-499)
Topic: 402 - M*A*S*H
Replies: 56
Views: 13758

Problem solved. thx~~

but it seems to have contradiction with the problem =(
by 10153EN
Sun Jan 06, 2002 8:46 pm
Forum: Volume 4 (400-499)
Topic: 402 - M*A*S*H
Replies: 56
Views: 13758

My program gets wrong answer after the rejudgement. But I don't know what's wrong with it after testing it with many special data.

Can anyone tell me what's tricky for this problem or any special cases for this problem?? thx

Go to advanced search