OJ Board

I think there should be a box to enter problem id and going directly through a problem. Also, there should be a list of already solved problems.

Yep, I've just got AC although my program outputs $0.00 for the above case!

So what is the correct algorithm?

Can someone explain me why there are some problems that i got wa with
while not eof
but got accepted when changing to
while not seekeof

What's equivalent in C++?

Ohh... i changed it to pascal
and when changing
while not eof
to
while not seekeof
it got accept
What's equivalent in C++?
Can someone explain me why?

Still correct and still got WA
I tried while (cin >> n) also

I think this is so simple but still got WA...


#include <iostream>
#include <cmath>
using namespace std;

int main()
{
freopen(FIN, "r", stdin);
freopen(FOUT, "w", stdout);

int n, truoc, sau, co[3010];
while (1)
{

cin >> n;
if (cin.eof()) break;

memset(&co, false, sizeof(co ...

My above program outputs it correctly

Some test cases please, I cannot find what is wrong with my solution!

My implementation:
Sort tasks accroding to min(s, g)
for i=0 -> n-1
if (min(s, g = s)
add task i to the end of list A
else
add task i to begin of list B
merge A B

Thank you!

I got WA many times for this problem and quite dont understand why

After that, I found this on alogrithmist.com:
"
Calculate the average expenditure and round it to two decimal places. (You'll need to write your own rounding function). Now the expenditure can be equalized in two ways. First, by ...

Can anyone give me some test cases?
I use Johnson, but it got WA.

Here is my code:

#include <iostream>

//#include <conio.h>

using namespace std;

#define FIN "" //"11269.in"
#define FOUT "" //"11269.out"

int n, s[25], g[25], lich[25], dau, cuoi;
int main()
{
freopen(FIN, "r", stdin);
freopen ...

Could you give me an idea for this problem?

Could anyone give me an idea for this problem?

Sorry, you're right!

Just notice the case when there's one last number in A.

Your approach is wrong for test 8 above.