OJ Board

your output is correct.

but, maximum value for array of temp can be more than integer range (499958000882)

gutlak ...

hehehe

Think about linear diophantine equation.

gutlak

He wants to do this in a way that at least one of two junctions at the end of each street have a tourist information center

Ouu, ic ... You can doing 2 N + K algo without sorting before ...

Thanks

why n lg n algo get TLE > 10 s ? since T < 100 and n < 100001 ?

thanks

hi b3yours3lf ... First : Your mistake is in next_permute function. int next_permute(char *str, int len) { int key = len - 1; int newkey = len - 1; while ((key > 0) && (str[key] <= str[key-1])) // == > here key--; key--; if (key < 0) return 0; newkey = len - 1; while ((newkey > key) && (str[newkey] ...

hai dominik...

300.00 181490736388615

good luck

maybe like this :

1. array [100][101] => because of string => "aaaa\0" => NULL character
2. when i || j == 0 => k=-1 || l=-1.
3. when i || j == 100 => k=101 || l=101.

I just found this...

[c]int main()
{
scanf("%d\n",&testcase);
while(testcase--)
{
your_input ...
Process();
your_output ...
if(testcase) puts("");
}
return 0;
}[/c]

My program handle that. So I think I have problem with my algorithm. I use pure algorithm for this problem, and I'm still comfuce why my program got WA. From previous message, this problem must be solved with max-flow.

Can you find a sample IO that can break my previous algo ?

for output we just print a sequence with profit more than 1 percent with minimal sequence, not the best profit only. So there are many correct answer for the third input : 1 2 4 1, 1 2 3 1, 2 4 3 2.

GOOD LUCK.

hey b3yours3lf... for output you must print
he..he..he.. bye........

aaaaaaaaaaaaaa ( only once ).

Because when you do permutation again you will get the same answer again, and for output you must print the combination only once not more.

Must be like mine. Try to solve it. ISBN is a serial number ( 0123456789X ) in 10 digits. X is a valid ISBN if in 10th digit. for example : 0-13-162959-X : 0 : valid character - : invalid char 1 : valid char 3 : valid char - : invalid char . . . X : valid char ( because in 10th digit ). if ISBN is X...