OJ Board

Thanks man! That was a really stupid error

Ok, I've changed that. But still it keeps giving me WA. I have no more idea what to
do!

OK I did that and I still keep getting WA. I thought that it might be that I
implemented the max flow wrong so I copied
Igor Naverniouk's code and still get WA. Please check it out.

Hi,
I've just started figuring out how max flow works. I'm having trouble with this task because the graph is not directed and I thought this was required for max flow. Can anybody explain how does this work? ( max flow with bidirectional edges ).

Hi, I've been getting WA for this problem quite a while. I've searched the forum and tried out the test cases. I still can't find why it gets WA. Can anybody help? My code #include <iostream> #include <string> #include <vector> using namespace std; #define pb(x) push_back(x) #define mp(a,b) make_pai...

I sent my code and the judge just keeps saying Recieved and nothing happens it just hangs like that?! #include <iostream> #include <string> #include <cctype> using namespace std; #define pb(x) push_back(x) #define mp(a,b) make_pair(a,b) int main() { string s; while( getline( cin, s ) ) { int c = 0; ...

I'm having trouble with this task. I keep getting Runtime Error. Does anybody see the bug? #include <iostream> #include <string> #include <algorithm> #include <cstdio> #include <vector> #include <climits> #include <cmath> using namespace std; #define pb(x) push_back(x) #define mp(x,y) make_pair(x,y)...

This is what I coded. And I keep getting WA. What did I forget? #include <iostream> #include <string> #include <algorithm> #include <cstdio> using namespace std; #define pb(x) push_back(x) #define mp(x,y) make_pair(x,y) #define SQ(x) (x)*(x) string solve( string s ) { int cnt[52]; memset( cnt, 0, si...

Hi, I'm not sure anymore whether I have to print ABC...XYZabc...xyz 0 or a blank line or just skip that one. Does the above work for blank lines nad those without any characters. It's a simple task but I'm going crazy tryin figure it out. #include <iostream> #include <string> #include <algorithm> #i...

I'm having trouble with this problem. I written a simple dp. But I can't get the right answears even for the example test cases. Have I understood something wrong? This is my code: #include <iostream> #include <algorithm> #include <cstdio> #include <climits> using namespace std; #define INF INT_MAX ...

Thank you very very much!

i solved it in O(n) time. my dp part looks like : initialize best[10001] array by 0; best[m]=best[n]=1; for(i=min(m,n);i<=t;i++){ if(i>=m && best[i-m]+1 > best && best[i-m]) best =best[i-m]+1; if(i>=n && best[i-n]+1 > best && best[i-n]) best =best[i-n]+1; } if best[t...

Try searching through the forums, you'll find the answer to your question. I had a problem and found a solution without posting a new topic.

Hi, I've been batling this task for a couple of hours now and I really don't see where is the bug in my code. I read a lot of posts wih people having the same problem. But if anyone could simply check it out 'cause I'm loosing my mind here. My code is so simple so I can't understand where could the ...

I added the string header and got AC!
Thanks to you all.