OJ Board

Consider every border case.

fpnc is the one that should be on top of it. Normally, he does these things in hours. Maybe he is MIA... Oh no, maybe he got kidnapped by those ACM.TIMUS.RU people...

Compiler functions and user functions are different. For example, consider when you use operators with side-effects (e.g., ++, --).

Another shameless bump since the 8XX and the 103XX are flooding this forum...^^^

Not if you wanted to make a multi-platform text editor. Add multi-platform to anything and you get a java problem:)

The runtime error is probably due to the gratuitous use of pointers... Try running through it with a debugger. There is probably an indexOutOfBounds exception somewhere.

But not for as many different flavors as PHP does.

Works for all test cases. WAs! Please help. Thanks! [cpp]#include <stdio.h> #include <vector> #include <algorithm> #include <math.h> using namespace std; double df(double a,double b) { return sqrt(a*a+b*b); } void main() { int i,j,N,z; vector<vector<double> > dist; vector<pair<int,int> > points; vec...

Shameless bump^^^.

PHP vs JSP is just like C++ vs Java. Depends on what you like:) PHP has the unique advantage of having database accessors built-in for all kinds of DBs.

Bah, I am so retarded. Fixed it... lol... I forgot to optimize the length. I knew there had to be a "decision statement" some where:) One max and it's all good.

That line is fulfill the specifications for the "multiple input".

Floyd fails for negative cycles and Dijkstra fails for negative edges. Sorry...

Can someone tell me why this WAs? [cpp] #include <stdio.h> #include <map> #include <string> #include <algorithm> using namespace std; void main() { string Translation="ABCDEFGHIJKLMNOPRSTUVWXY"; map<string,int> Directory; map<string,int>::iterator DirectoryIT; char B[1000]; char C[10]; int i,j,N,k,O...

I think it should be: "A Great Helping Guru"