OJ Board

Can I solve the problem 10099 using a variation of Dijkstra algorithm?
In each step, instead of looking for the lowest cost, I look for the highest minimum cost of the whole path.
I'm in the right way, or not ?

Thanks!!
I got AC, but with PE.

What may be??
I output results this way:

[cpp]
if (bisiesto(numero))
{
cout << "This is leap year." << endl;
bis = true;
fiesta=true;
}

if (huluculu(numero))
{
cout << "This is huluculu festival year." << endl;
fiesta = true;
}

if (bis && bulukulu ...

[quote="10153EN"]I solved this problem by storing the year number (which can be very large) in an integer array. Then check this year with some number theory.

For example, if a numbe if divible by 3, then the sum of all of it's digits is ....[/quote]

Excellent idea!!
What's the rule for knowing if ...

[quote="Adrian Kuegel"]Read this:
Straight: the five cards of the hand may be sorted on rank so that an unbroken sequence of 5 ranks is formed and the hand does not qualify for any of the following.
--> There can be cycle through Ace. <--
That is AC, 2H, 4D, 3H, 5S forms a straight, as does JH, XD ...

kmhasan wrote:Try the following input:

Code: Select all

1
aaaaaaaaaaaaaa

I believe that the output should be one line, your program will probably produce factorial(14) lines of output.

with that input, output should be:


or
(only once)?

Can it happen with long integers?
I

I