OJ Board

Finally, I solved it!
Numbers of vitamin are maximum 15, therefore it can be solved by
2^15 complete search.
I used "looping through find all the subsets of a set", and it works very fast. Thx!

I try to solve this problem using backtracking. However, test case 8 caused TLE ( 2sec. ) . Is there other solution? Or I must improve my backtracking algorithm? If you already solved it, plz help me. [Problem Statement] Farmer John prides himself on having the healthiest dairy cows in the world. He...

It's a very easy problem, and I solved it within 10 min.
In my intuition, I can see that answer makes following arithmetic progression
a(n) = 1 + (n(n+1))/2;
However, I want to know why pizza cutting makes this expression.
Anyone tell me the proof of this expression?

Your progam prints wrong blanks...
You must remove only last blanks, and other blanks must same as input string.

For example,

Input ( _ means blank ) Presentation Error Accepted Good luck.

You must remove only last blanks, and other blanks must same as input string.

For example,

Input ( _ means blank ) Presentation Error Accepted Good luck.

Additonal comment about rio's post. =)

It's an undirectional graph. threrfore, 0 -> 1 is same as 1 -> 0.
Good luck.

I don't know the other method to solve this problem. However, it is obvious that permutation method is too slow to find all solutions.
When n = 16, almost 16! times ( 209,227,898,888,000 times ) needs to calculate to search all cases.

I'm so awkward using in STL. When I implemented 2D array sort in C, I used bubble sort. But I want to know how can I sort 2D array in STL sort(). For example, // before sort string data[3][2] = { {"cab","hello"}, {"cba","world"}, {"abc","haha&qu...

My solution still received WA.. Thx, Jan. My program passed all of your test case, but it cannot pass the OJ's test. I found one critical input, so I modified my code. But I recieved WA.. My critical Input 4C 4C 8C 7C 5C 3D 3D 8D 7D 6D In this test case, both hands are flush. According to the proble...

It's really tricky... I can't solve this problem though all of Jan's test case passed... If anyone have critical test case for this problem, plz tell me about it. And I have another question. Full House: 3 cards of the same value, with the remaining 2 cards forming a pair. Ranked by the value of the...

hmm.. It's so tricky. It just looks like an easy problem, but I received WA repeatedly... Is there any critical input?

64351 's current name is Seongwook Ha @ i-Logic He is a tutor of private algorithm & problem solving academy what was named i-Logic. I guess he AC by cheating ( It means he copied others source code ) for his public relations (P.R.) Of course, he also solved some problems by himself, but it is t...

I'm so curious about this year's World Final teams. Especially, I noticed that some of north korean teams joined in this year's regional contest in Xian site, Asia (China). http://icpc.baylor.edu/icpc/regionals/ViewRegionalStandings.asp?ContestID=790 Two schools are represented for North Korea. KimC...

Thx, Rio.

I agree with your opinion.
I changed the type of "int a" to "long long a", then I accepted.
Maybe my loop statement caused an overflow, and it makes infinite loop.
Thx!

ps ) I changed this thread title. ^^;

It's a very easy problem. However, I received TLE from judge.
I don't know why my solution received TLE. It works well my VC++ and
g++ compiler.

Anyone tell me why my solution received TLE. Thx.