OJ Board

Try these

Input: Output:

I used sieve for generating primes upto sqrt(9e14) (only this takes around 0.9 secs)
Then I calculate number of odd divisors for each given number.
The total time it took was more than 2 secs. I see a lot of people got it AC in < 0.5 secs. Is there any better way of solving this?

It is easier to think of critical test cases if you give us overview of your approach. It is a typical Grammar Problem. All other approaches may result in Wrong Answers.

I have solved the problem using the Formula provided in http://mathworld.wolfram.com
I wanted to know whether there is any recurrance or DP solution for this problem ...

There is no breaking condition in your "while" loop ...
try some thing like
while(1) defines an infinite loop ... while(gets(str)) will break when it reaches End of Input File

- the extra words that seem to be in the input (I chose to regard them as wrong rather than ignore them) - the apostroph in the output (I just copied it from the example output, even though it seems to have ascii value > 127) - the "VERBs" in the definition of VERB (I chose to consider a ...

Your program does not pass the following case: 5 1 1 2 2 3 3 4 1 3 4 5 0 0 About your input I dont think there is any such input in the judge data .. though the logical ans should be (0,5) but my AC code does not pass that as well .. And I agree with Jan .. making new threads for each new problems o...

Hello shamim,

Can u plz post some test cases for which the cosine rule may not work ?? I am stuck ... My code seems to work for all the cases that I can think of

thnx in advance

Hi bijon, first of all thanx to you as I used your I/O to get AC

just a hint .. there can be negative values as input ... (at least that was the reason for which I was suffering)

Hi .. I have wasted a whole today thinking about a traditional solution to this problem ... is GOOGLE the only solution to this problem ??? If anyone has solved it with some other way plz can u share your algo ?? And I completely agree with Darko .. GOOGLE is an english verb now (at least for us :wi...

Hi, Thanks to mf for mentioning the Floyd's Algorithm. It was really a nice algo and I have just got AC .. but the timing came really bad (about 4 sec). I had a few questions: 1. Well .. according to wiki .. I made two iterations and calculated the GCD to get the actual period. Is there any better w...

rammestain wrote:I tried to solve this problem with dynamic programming but got TLE

I have solved the problem using memoization.

visited[a][c][d][e][f] becomes true when I have tried giving 'a' no of XS, 'b' no of S .... 'f' no of XXL t-shirts

When you convert the number to polar form ... then

SPOILER
(a+ib)^n
= r^n (cos (n.t) + i sin (n.t) )

You can safely say that if r^n is greater than 2^30 then TOO COMPLICATED

Hi all, I have been gettin TLE in this problem for quite a long time now. My solution is as follows: 1. I have created a graph with Cities as Vertices and Train Routes as edges. 2. I maintain an array bestDepTime[][] bestDepTime [j] contains "If city(i) can be reached in time(j) then the best i...

The first line of each set of input is an integer N (1 ≤ N ≤ 1000). This is followed by N lines, each with two integers, both ≤ 3000, representing the weight and maximum load of each box respectively. Input ends with a case where N = 0. There can be multiple input sets. I am not sure whether your c...