OJ Board

My original method ( printf( "%d\n", best ); ) prints a line per set.

I'm printing the output with
just as the problem suggests it and I don't know how to get rid of the presentation error.
I tried leaving blank after each set and leaving a blank line between each set.

You might wanna watch out for this... ( I got TLE becouse of it )

i wrote instead of enjoy...

Input: Your Output: Correct Output: Two identical permutations muss not be printed...

I got AC. but..
but, when change the my code ( pow -> my function )

i got AC ( 0:05.619 ; CPU )


I was just wondering... Try using a pow function that runs in O( lg n ) time, but uses recursion which is sooo slow. What running time will you get ?

typedef unsigned int uint;

uint power( uint ...

Thx Little Joey , I finally got Acc.

The Problem was that there was a (dirty ) trick in the input files (which I believe you already know about). I hope my input will help someone.

I got many WA becouse of this problem. Can somebodey werify the correctness of this test cases?

19
20 20
1 17 19 0 0 19 D ...

You were this close to solving this problem... Look at your excetion check (if(n==1e)). Remove the "writenln" and replace it with the writeln, that should do the trick (I hope so).

There's no compile error becouse the i's are in different scopes, thus the i in the first loop doesn't clash with the second i. Think about it as a function. The local variables do not clash with the globals so you can adress the outer scope with the scope operator ( :: ). :)
BTW, you can be ...

SIGSEGV is a runtime error that happens when you reference memory out of bounds. It can happen when you (let's say) allocate an array of 100 members and then you start to write on position array[150] or so.

No need to bother. I figured it out. r2=r1/sqrt(2)

You could do two things: optimise your check which asks has that permutation been listed :) or you can write an algorithm that doesn't even need to check that. Consider this: when you have a string "aab" you repeat the "aab" only if you place two "a"s on the same position in the generation. Try to ...

Can somebody explain me the process of fission in 10096? Does the initial virus (with the specs got from the input) splits in two viruses with radii equal one half the initial or we have to split up two viruses of input sizes?

Perhaps the difference between two consecutive numbers does not ascend (or decend) sequentaly . Consieder the sequence 1 2 5 3. Your program tells you that it's not jolly, but actualy it is because the difference between the elements are 1, 3 and 2 which are all the values from 1 to 3. I hope this ...

As you found out your program is too slow because it runs in apx 10^1 (if n=100). We could solve this problem using DP in a similar way as if we would check for the maximum sum of consecutive element in an array (lets assume that there isn't any O(n) nor O(n log n) algorithm). First, we need a ...