OJ Board

CodeMaker wrote: This is a DP (Dynamic Programming) problem. Backtrack will give u nothing but TLE.

May be you don't like backtracking or you are very good in DP. But your statement is not correct. I got ACCEPTED using backtrack and it took .008 sec.

I've given up this problem months ago,
until I tried to solve it again today,
and I get Accepted after experimenting with
a lot of submission

the max row and column never exceed 15,
hope this could help anyone out there that still
got time limit or memory limit in this problem

bye

Thanks for ...

Thanks a lot.There was a silly mistake in my code and the test case 94764610 284293833 helped me finding that.

Here's my code that gives presentation error with oj.... is it because of the endl on seeing eof??
I think you have printed the trailing spaces of the input string and getting PE.

In general,the leading and trailing spaces must be deleted when print the input string as output.

Warning: No,spaces ...

I got 3 seconds with read(0, buf, 1024*1024) and a linear-time algorithm. It also helps not to store the numbers that you read. Read them one at a time and throw them away immediately.

Can anyone send the code segment where this read() function has been used and the data has been processed ...

I got 3 seconds with read(0, buf, 1024*1024) and a linear-time algorithm. It also helps not to store the numbers that you read. Read them one at a time and throw them away immediately.

I tried to use this function read(). The judge replied me CE with the following message-

Here are the compiler ...

Yes, I use 3 flag, but in this way:
Let program works for case #X(from 1 to 100);
Than I use f1=2*X flag for elements which are not unique, f2=2*X-1
flag for elements which are unique yet, and f0<2*X-1 for elements which
are not exist yet. So in the next test case all my 2*X and 2*X-1 flags
becomes ...

got AC in 1.822. how to reduce it?

i did:

modified sieve ran upto 2000000

then recursion to get depth[]

then O(1) output

Mahbub

I have generated all prime factorization and generated value for the phi(n) at the same time.

You can get the prime factorization and number of relative primes of ...

I don't need initialize it with 0's, because I use different flags for each
test case, i. e. I use flags 1 and 2 for test case 1, 3 and 4 for test case 2
and so... I changed char[20000005] to unsigned char[20000005] but
got WA again :(

In my implementation, at the end of each test case i have ...

sunny wrote:can u pls describe ur algo a little bit.

You can use a%k and store necessary data in a 500 size array and for testing repeat data u can use flag array of size 20000002.

Remember,never try to initialize the full flag array for each test case. Handle it intelligently.

If the problem is simple & specific, then where is our challenges?


So, you think a problem which is !(specific & simple),that is challenging?

!(specific & simple) = (!specific) || (!simple)

Ok, i am giving you a simple and (!specific) problem-
#Find A+B where A>10 && B>10 (It's not typing ...

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

thanks

Your program's worst case complexity = T*nlgn*C = 100*(lg100000)*100000*C=1.7*10^8*C,where C is cost of unit operation in each iteration. If this C is larger then there is no way of running within the time limit. I think this ...

After long time i got a number theory problem with such an undefined statement like "N integers are positive-natural numbers". What does natural number means? Shall we try upto INFINITY?? Would you please tell me what would be the trouble if you had specified it with specific number. By the way i ...

tuman wrote:I badly need some input-output for the problem PLAY on WORDS its a simple Euler path problem but i cant do anything unless i experience some critical input and output.

Try This:

Input:
2
4
ad
da
pq
qp
4
ad
da
ad
da

Output:
The door cannot be opened.
Ordering is possible.

can someone post the paper that is to be read or how should one go about solving this problem. i have tried it but am out of ideas. All i know i could find from observations is that the odd solutions lie between n+1 and 4*n (maybe wrong). But for 10^9 it is too long.

I didn't considered any ...