Search found 145 matches

by DD
Sun Mar 03, 2013 4:04 am
Forum: Volume 104 (10400-10499)
Topic: 10438 - Meta Editor
Replies: 17
Views: 11140

Re: 10438 - Meta Editor

To: TimeString I wonder how for a c b a b a c b c a b a c b c b c b c b a c b a b c b c b a b c a b a c b a b a c the output would be a c b c a b a c I get a c b c a b a c b a b c a b a c My AC code gives this output.. which differs significantly with TimeString's one. a b a c b c a c b a b c b a c...
by DD
Sun Mar 03, 2013 2:38 am
Forum: Volume 103 (10300-10399)
Topic: 10308 - Roads in the North
Replies: 30
Views: 9413

Re:

daveon wrote:INPUT:

Code: Select all

5 1 6
1 4 5
6 3 9
2 6 8
6 1 7
(blank line)
(blank line)
(blank line)
(blank line)
5 1 6
1 4 5
6 3 9
2 6 8
6 1 7
OUTPUT:

Code: Select all

22
0
22
I think there is one extra line in your sample input. You probably may want to remove it.
by DD
Sat Mar 02, 2013 10:36 pm
Forum: Volume 8 (800-899)
Topic: 845 - Gas Station Numbers
Replies: 12
Views: 7703

Re:

Some I/O: 15444.1 0.9 0.1 0.2 0.3 0.6 324317.3 255555.5 2692592.9 0.0 0.1 1.1 5.5 6.6 9.9 6.9 . Output: 21144.4 6.0 1.0 0.5 3.0 0.9 324331.7 522222.2 2692595.6 The price cannot be raised. 1.0 The price cannot be raised. The price cannot be raised. 6.9 The price cannot be raised. 9.6 I think they te...
by DD
Sat Mar 02, 2013 10:09 am
Forum: Volume 109 (10900-10999)
Topic: 10950 - Bad Code
Replies: 19
Views: 9978

Re:

polone wrote:I got WA too

but I think I can support some

Code: Select all

1
a 0
000
0
I think the output should be

Code: Select all

Case #1
aaa

hope it help
My A.C. program outputs the following result for your input:

Code: Select all

aaa
aa
aa
a
So I guess such ambiguous input will not show in the Judge's test data.
by DD
Sat Mar 02, 2013 8:22 am
Forum: Volume 109 (10900-10999)
Topic: 10947 - Bear with me, again..
Replies: 23
Views: 2718

Re: 10947 : wy WA.????

This problem is easy enough so you should not get W.A.
by DD
Fri Mar 01, 2013 9:59 pm
Forum: Volume 107 (10700-10799)
Topic: 10771 - Barbarian tribes
Replies: 12
Views: 3639

Re: 10771 - Barbarian Tribes

The parity trick works like a charm :) However, even with that, I still cannot get 0.00 A.C. Just curious how other people solve this problem?
by DD
Fri Mar 01, 2013 9:00 am
Forum: Volume 109 (10900-10999)
Topic: 10998 - Flipping Colors
Replies: 15
Views: 3379

Re: 10998 - Flipping colors

I was so fool that I first try to initialize an 2D array filled with black. After several failed try, I realized it can only be solved to simulate every time according to the input :o Finally, I got A.C. :D
by DD
Fri Mar 01, 2013 8:08 am
Forum: Volume 7 (700-799)
Topic: 783 - Trains
Replies: 0
Views: 904

783 - Trains

I just tried this problem, and one thing surprise to me that although not so many people tried this before but this one is relative easier compared with other problems in this Volume :D
by DD
Tue Feb 26, 2013 9:09 am
Forum: Volume 7 (700-799)
Topic: 787 - Maximum Sub-sequence Product
Replies: 39
Views: 18285

Re: 787 - Maximum Sub-sequence Product

getting RTE pls help import java.util.Scanner; import java.math.BigInteger; import java.util.*; import java.io.*; public class Main { public static void main(String[] args) { BigInteger pro,mx; int n,i,c,j,k; int ar[]=new int[200]; Scanner scn=new Scanner(System.in); while (scn.hasNextInt()) { n=sc...
by DD
Mon Feb 25, 2013 7:49 am
Forum: Volume 1 (100-199)
Topic: 100 - The 3n + 1 problem
Replies: 1394
Views: 168937

Re: Newbie can't get AC

There is a thread discussing about 100 where contains all solutions for different languages. You should check that.
by DD
Sun Feb 24, 2013 11:04 pm
Forum: Volume 109 (10900-10999)
Topic: 10964 - Strange Planet
Replies: 13
Views: 6084

Re: 10964 - Strange Planet

Just wondering that brute-force simulation can passed this or not although I use the algorithm almost used by everyone on this :roll:
by DD
Sun Feb 24, 2013 8:48 pm
Forum: Volume 7 (700-799)
Topic: 701 - The Archeologists' Dilemma
Replies: 43
Views: 27299

Re: 701 - The Archeologists' Dilemma

I think there will be an answer for this problem so it means we don't need to print "no power of 2".
by DD
Sun Feb 24, 2013 10:22 am
Forum: Volume 109 (10900-10999)
Topic: 10925 - Krakovia
Replies: 50
Views: 20834

Re: 10925 - Krakovia

For bindas Try it 100 2 999999999999999999 999999999999999999 999999999999999999 999999999999999999 999999999999999999 999999999999999999 999999999999999999 999999999999999999 999999999999999999 999999999999999999 999999999999999999 999999999999999999 999999999999999999 999999999999999999 999999999...
by DD
Sun Feb 24, 2013 10:18 am
Forum: Volume 109 (10900-10999)
Topic: 10925 - Krakovia
Replies: 50
Views: 20834

Re:

Hum.. i had accepted all sugestted inputs but I was still getting WA, so i found two inputs that showed me some extra cases. After correct this I got Accepted. Here they are: Input: 1 16 17432479801732498109834891047810 1 15 17432479801732498109834891047810 Output: Bill #1 costs 1743247980173249810...
by DD
Fri Feb 22, 2013 9:48 am
Forum: Volume 109 (10900-10999)
Topic: 10911 - Forming Quiz Teams
Replies: 33
Views: 16175

Re: 10911 - Forming Quiz Teams

I think branch-and-bound with proper tuning is sufficient to solve this problem :D

Go to advanced search