Search found 40 matches

by annhy
Tue Aug 07, 2012 6:07 am
Forum: Volume 124 (12400-12499)
Topic: 12444 - Bits and Pieces
Replies: 4
Views: 2230

Re: 12444 - Bits and Pieces

brianfry713 wrote:For the third case, c=3 and d=15. The correct answer is a=7 and b=11. For your output of a=11 and b=15, a&b=11 which doesn't equal c.
Now I see there is at most one valid solution.
Thanks very much. I made a very silly mistake. :oops:
by annhy
Mon Aug 06, 2012 11:20 am
Forum: Volume 124 (12400-12499)
Topic: 12444 - Bits and Pieces
Replies: 4
Views: 2230

12444 - Bits and Pieces

The sample output:

Code: Select all

2 3
-1
7 11
I got WA, but I think the following answer should also be valid. Am I right?

Code: Select all

2 3
-1
11 15
by annhy
Wed May 23, 2012 11:38 am
Forum: Volume 102 (10200-10299)
Topic: 10271 - Chopsticks
Replies: 20
Views: 10598

Re: 10271 - Chopsticks

If you reverse the input array first (descending order), checking the existence of the longest chopstick of each set would be easier.

Hope it helps. :)
by annhy
Mon Apr 23, 2012 7:10 am
Forum: Volume 8 (800-899)
Topic: 880 - Cantor Fractions
Replies: 24
Views: 17293

Re: 880 - Cantor Fractions

My code got AC in 0.056 seconds. Im not sure about the range of the given integers in this problem. As far as I can remember, I used long long int to get AC first, but when I tried with int, I got WA. My Accepted code gives the following outputs for the following inputs: :) 1 2 3 4 5 6 7 8 9 10 191...
by annhy
Mon Apr 16, 2012 7:45 am
Forum: Volume 8 (800-899)
Topic: 893 - Y3K Problem
Replies: 11
Views: 8701

Re:

fixit wrote:I have the same outputs in my program, but W/A :(
I don't know where is the problem :(
Maybe someone give I/O ?
I think there are invalid dates, try this:

Code: Select all

1 31 2 2012
365 31 2 2012
0 0 0 0
by annhy
Mon Aug 08, 2011 6:03 am
Forum: Volume 111 (11100-11199)
Topic: 11137 - Ingenuous Cubrency
Replies: 16
Views: 9163

Re: 11137 - Ingenuous Cubrency

I run your code on my computer and java.lang.StackOverflowError occurs. Good luck!!
hduong wrote:I always got Runtime Error although I already tested every case from 1 to 9999. Could anyone help me figure out the error in my code?

...deleted...
by annhy
Thu Jun 23, 2011 8:39 am
Forum: Volume 1 (100-199)
Topic: 109 - SCUD Busters
Replies: 96
Views: 24509

Re:

Hi everybody! I am trying to solve the problem using Java. Unfortunately I keep getting a Runtime Error, although everything runs fine on my computer with the same java version (1.6). Has anybody an idea what's wrong with my code? ...deleted... Any hint appreciated. I am wondering if I not am getti...
by annhy
Mon Apr 25, 2011 2:38 pm
Forum: Bugs and suggestions
Topic: (11849-CD) never judge
Replies: 1
Views: 2074

(11849-CD) never judge

Hello..
I have made two submissions of (11849-CD) yesterday, but their verdicts are still "Sent to judge".
Some later submissions of other problems have already been judged.

My submission numbers are 8775775 and 8775800. Please kindly check what's the matter.
Thanks.
by annhy
Wed Apr 06, 2011 12:35 pm
Forum: Volume 101 (10100-10199)
Topic: 10194 - Football (aka Soccer)
Replies: 119
Views: 36847

Re: 10194 - Football (aka Soccer)

:evil: :evil: :evil: I finally solved this problem with Java. There is the same issue similar to problem 10197 - Learning Portuguese. !!! The default system encoding is different from the judge data files. !!! For the detail, please reference this thread: http://acm.uva.es/board/viewtopic.php?f=10&t...
by annhy
Fri Apr 01, 2011 11:43 am
Forum: Volume 101 (10100-10199)
Topic: 10197 - Learning Portuguese
Replies: 45
Views: 15745

Re: 10197 - Learning Portuguese

I finally got AC with Java... (I hate this problem. :-? ) Some things about Java: 1. In Java, char is always unsigned . 2. Java will automatically encodes the output to your default character set. For example, "Big5" is for Traditional Chinese, "GB18030" is for Simplified Chinese, "KOI8-R" is for Ru...
by annhy
Wed Nov 03, 2010 3:15 pm
Forum: Volume 107 (10700-10799)
Topic: 10747 - Maximum Subsequence
Replies: 15
Views: 8996

Re: 10747 - Maximum Subsequence

Hi, I don't know why the following input have such a strange answer... :o can anyone please help me? input 8 1 1 -1 -1 0 1 -3 -1 -1 8 2 1 -1 -1 0 1 -3 -1 -1 8 3 1 -1 -1 0 1 -3 -1 -1 8 4 1 -1 -1 0 1 -3 -1 -1 8 5 1 -1 -1 0 1 -3 -1 -1 8 6 1 -1 -1 0 1 -3 -1 -1 8 7 1 -1 -1 0 1 -3 -1 -1 8 8 1 -1 -1 0 1 -...
by annhy
Sat Aug 14, 2010 5:16 am
Forum: Volume 111 (11100-11199)
Topic: 11112 - Babylonian Roulette
Replies: 6
Views: 6086

Re: 11112 - Babylonian Roulette

I don't like this kind of problem. :-? Since my English is poor, I spent more than 40 minutes for reading and understanding the article. After I understood this problem, I spent only about 4 minutes to coding and submit. I think this problem is suitable for the "English reading contest" rather than ...
by annhy
Thu Jul 22, 2010 8:29 am
Forum: Volume 111 (11100-11199)
Topic: 11103 - WFF 'N PROOF
Replies: 13
Views: 7992

Re: Re:

annhy wrote:
helloneo wrote: Re-ordering is allowed.. :-)
Re-ordering is allowed?
So if the input is qpqKN, the output is still KpNq ?

I am really confused now... :-?
OK... Re-ordering is allowed.
If the input is qpqKN, the answer could be KpNq, NKpq or KqNq.

I got AC now.
by annhy
Thu Jul 22, 2010 7:39 am
Forum: Volume 111 (11100-11199)
Topic: 11103 - WFF 'N PROOF
Replies: 13
Views: 7992

Re:

helloneo wrote:
Khaled_912 wrote:is it asking for a 'sub-sequence' or a 'substring' (consecutive characters)? Is it allowed to re-order the symbols?
Re-ordering is allowed.. :-)
Re-ordering is allowed?
So if the input is qpqKN, the output is still KpNq ?

I am really confused now... :-?
by annhy
Tue Jul 20, 2010 10:03 am
Forum: Volume 111 (11100-11199)
Topic: 11137 - Ingenuous Cubrency
Replies: 16
Views: 9163

Re: 11137 - Ingenuous Cubrency

Could someone check my input/output? Given below: input: 11 33 44 99 100 300 200 499 599 450 789 1000 2000 2165 3000 1111 477 7 49 679 output: 2 6 9 55 35 321 141 777 1028 658 1522 2146 5638 6268 9794 2484 728 1 10 1225 all are right? thnx My AC program outputs: 2 6 9 39 39 683 208 3959 8015 2702 2...

Go to advanced search