OJ Board

Could someone please explain me this?

When I use: puts("No solution"); my code give me AC.

But when I use cout << "No solution" << endl; (with and without endl or \n) my SAME code gives me Wrong Answer...

I can't figure out why I'm getting WA :/ could you help me?

My code (c++):
Thank you in advance ^-^

UPD: I was checking cycles existence wrong.

Why is this giving me WA?? Please help
Thank you in advance.

Could somebody tell me why am I getting WA in this problem?

#include <iostream>
#include <cstring>
#include <queue>

using namespace std;

char M[35][85];
int V[35];

int dx[]={-1,-1,-1,0,0,1,1,1};
int dy[]={-1,0,1,-1,1,-1,0,1};


void BFS(int n, int m)
{
queue<int>X;
queue<int>Y;
X.push(n);
Y ...

Hi,

today I made this problem and I found something interesting.

I sent my code and while it was in queue I realized that my code failed for this case:

1
1
0

So I sent it again, but with the correction.

The funny thing is that when I checked I had the two submissions accepted.

The firstone's ...

o.O

How I didn't see that!!??

Accepted

Thank you!! ^-^

I got Wrong Answer in this problem, and I can't find what goes wrong with my code. Could somebody please give me some input/output cases or tell me the mistake in my code?

This is my C++ code:
Thank you very much ^-^

Same bug in 10226 since 26 days ago.

I checked and this problem is giving submission error to everybody since 25 days ago u.u

Why am I getting submission error in this problem? I sent it like six times and always is the same.

You can see my submissions here: http://uhunt.felix-halim.net/id/129605

And here is my code:
Please help me

Why am I getting TLE in this problem?

My code (c++):

#include <iostream>

using namespace std;

int main()
{
string s;
while(getline(cin, s))
{
bool sw = true;
string ans = "";
string aux = "";
for (int i=0; i<s.length(); i++)
{
if (s[i] == ']')
sw = true;
else if (s[i] == '[')
{
sw ...

This looks like an easy knapsack problem, but I don't know the knapsack algorithm. So, could anyone give me a pseudo-code for this problem? Or a pseudo-code for the knapsack algorithm?

Thank you very much.

I got accepted just making the size of the vectors = n. I really can't understand why that gave me WA

Hello, I got WA in this problem and I cant figure the reason . Please help me, I read a lot of topics about the problem but any of them helped me.

Here is my code, it is in cpp.