OJ Board

fh

You haven't solved the coming home problem:

Code: Select all

Daniel can save $0.03

fh

@AKJ88: try this input:

Code: Select all

The output should be:

Code: Select all

Daniel can save $0.02

fh

zoranh's order is not correct.
The first thing to check should be : if the denominator is zero (t == 1).
There is no test case where t,a,b is less than 1, so no need to check for a == 0 or b == 0.

fh

Consider this input:

3 2
1 1 1
0 1 10
1 2 10

So:
Town 0 will hear the gossip in hour 0.
Town 1 will hear the gossip in hour 10.
Town 2 will hear the gossip in hour 20.
Regardless of which town Billy visit, is that true?

Suppose that Billy starts from Town 0, clear the gossip in 1 hour, then ...

fh

Questions:

1. Billy starts from town 0, but where does the rumor starts from?
2. If the rumor starts from town 0, then Billy arrived at town 0 the same time as the rumor, so Billy saved only 1 town and the rumor stopped?
3. It seemed no 2 is incorrect since the sample output says Billy can save 4 ...

fh

Are you guys using this url to look at other people statistics:

http://icpcres.ecs.baylor.edu/onlinejudge/index.php?option=com_onlinejudge&page=show_authorstats&userid=339

I also get the same message here but the strange thing is that my tool can still access the page and read the statistics ...

fh

Thx, emotional blind, just got it AC.

fh

Can anyone explain the meaning of "three pairwise-isomorphic subgraphs"? and the two sample cases? I completely don't understand them.

fh

First of all it suffices to look at the numbers 3,33,333, 3333 etc., since any number ending in some number of 0s can be expressed as the difference of two of these numbers with no 0s, ie. 333 - 33 = 300.

Hint: If you start marking the remainders you get mod K from this sequence, what happens when ...

fh

The problem is to find (a,b) such that 0<=a<=b and 10^b+10^(b-1)+...+10^a is divisible k.
This could be done by O(n) algorithm.

My algo is O(L + K) where L is the length of the multiple in the output. K iteration is needed to initalize the array. I use GCD in each iteration of L. I got TLE. How ...

fh

Can somebody check whether my output is correct?
Or is there any tricky input?

Input:

1
2
3
4
5
6
7
8
9
10
11
12
13
236773
42610
207363
428950
718729
958356
227092
63702
922718
84511
298077
803248
249764
882133
249776
858939
723076
244080
954760
335073

Output:

1 1 0
2 1 1
1 1 0
3 1 2
2 1 1 ...

fh

Mushfiqur Rahman wrote:But in the above case the correct output will be TOO COMPLICATED not 4.
Because:
(940+940i)^2 = 1767200i
(1767200i)^2 = -3122995840000
here |-3122995840000| is greater than 2^30.

Ups.. yes, you are correct it's TOO COMPLICATED
Sorry for the mistake.

fh

I always got PE for this problem...

what is the output for this:

Code: Select all

In theory, there is no difference between theory and practice, but in practice, there is.
2
4
9
                             
2
4
9
In theory, there is no difference between theory and practice, but in practice, there is.
2
4
9

fh

Just reminding... The sample input is still not updated.

fh

It would not be much harder. The trick is to do the compression using Union/Find. Then you don't even need to change the graph. After you compress, whenever you see an edge (u, v), you simply treat it as an edge (Find(u), Find(v)).

IMHO, using union/find does not keep the graph unchanged since to ...

OJ Board

Search found 59 matches

Re: 11284 - Shopping Trip

Re: 11284 - Shopping Trip

Re: 10083 - Division

Re: 977 - Old West Rumours

977 - Old West Rumours

Re: You are not authorised to view this resource.

I'm using GCD in

What's the output for this