OJ Board

When determining if HH:MM is palindromic, ignore all leading zeroes in HH. If HH is zero then ignore all leading zeroes in MM. according to the statement for determining if 01:21 is palindromic, we must ignore all leading zeroes in 01 so we have 1:21. it's obvious that 121 is palindromic. The same ...

Thanks Robert Gerbicz. I got AC. It's too bad that I couldn't consider this case Thanks again.

This problem was the easiest one and many people solve it in the contest time But I don't know why I can't solve it! I use dp: suppose f(i) is the number of 2-by-i box (width = 2 and length = i) so we have: f(i) = 4 * f(i - 2) + f(i - 1) f(i) = 1 if i = 0 f(i) =0 if i < 0 There are four possibilitie...

Try this:

input:
output:

I generate about 1000 testcase and compare your code with my AC code and two files are equal
I don't know why you got WA but I like your idea (using dot product) because it guarantee that always the arc length will be minimum. I think the judge input maybe wrong, I'm not sure.

I thought the IEEE standard for double precision floating point numbers requires them to represent 52bit fractional digits. So it follows that they can represent every 32bit integers exactly. However, some decimal such as 0.1 don't have a finite base 2 representation, so they can't be represented e...

1) Don't use float, double, long double (same as double in some compilers) as sentinel. for example: double i; for (i = 0; i < 3; i++) //dangerous code { } you declare t as long double. In my compiler your program didn't terminate so you must declare t as int. 2) I think you don't understand the rec...

You don't need BigInt. "int" is enough because n <= 1000000 < 2 ^ 31 - 1 You don't say anything about your algorithm but you can use emotional blind recurrence: AFAIK it should be like this f(n,i) = n/(k^i) - f(n, i+1) Result is: f(n,0) SPOILER?? Think about the recurrence. why it's true a...

If you mean the output become 0, I must say "no!" Because n >= 1 and k >= 2 so we always can select at least one number

Thanks emotional blind for your nice recurrence

Thanks for your help

Thanks for your reply sclo. Can you give me some hint? I saw Double-Free Set recurrence that works for k = 2:
But how above recurrence work?

Hi I got AC this question in the contest time but when this question added in online judge problemset I got TLE. What's Wrong? My algorithm is: I first select the numbers that is not the factor of k then consider the factors of k. suppose x is a factor of k (x = ak) if I selected a or a is belong to...

Krzysztof Duleba right there is a converstion operator. for example: #include <iostream> using namespace std; struct test { int a; }; int main() { test a; while (a) // Syntax error { } return 0; } but if you define a conversion operator the code will be correct: #include <iostream> using namespace s...

I think you cannot use two dimensional array in sort function: int a[3][2] = {{1, 2}, {3, 4}, {5, 6}}; sort(a, a + 3); // Syntax eror for solving this problem you must use vector: #include <iostream> #include <string> #include <algorithm> #include <vector> using namespace std; void print(vector<stri...

You can download "Thinking in C++" by Bruce Eckel from:

http://www.mindview.net/Books/DownloadSites/