OJ Board

Finally found a bug:
there should be 'knights' string all the time, even if result is 1

Here's my code, please help! #include <stdio.h> int max(int a, int b) { return a>b? a:b; } int mid(int p) { int d = p/2; return max(d, p-d); } int main() { while (true) { int n,m,l; scanf("%d%d", &n, &m); if (n==0 && m==0) break; l=max(n,m); int r = mid(n*m); if (n>0) r=max...

Surely, Counter Strike and WOW rules!
Guys, just try DotA All Starts form WOW

i'm 24 and I've solved about 400 when i was 20

Kallol wrote:can anyone provide me with some links or soft book/tutorial/pdf for network flow algorithm and its variations??

here's couple:
http://ww3.algorithmdesign.net/handouts/MaxFlow.pdf
http://web.mit.edu/15.053/www/AMP-Appendix-C.pdf
http://activities.tjhsst.edu/sct/lectures/netflow.pdf

I'm interested in java support, too. Do anyone know information about packages?