OJ Board

not sure if this will help, but i solved this problem a long time ago ... you can look at my source code if you want, it's at http://itnoise.com, you have to register though to see the solution repository. There are quite a few solutions there, and you can upload some of yours too if you like, it's ...

thanks for your reply.

You make a good point. Code collectors really have nothing to prove though by increasing their numbers, it's just that, a number, it doesn't carry much weight. The repository would be more geared toward teams who are actually practising to qualify for regionals or worlds ...

Thanks Misof. The concept of posting only the algorithm is certainly a good approach to helping people. However, for a lot of the UVA problems the algorithm is the easy part, actually producing the code is harder, especially when you may be restricted to a certain language. The idea is just for ...

Hey,

I'm building a repository of solutions. If you want to share your AC solutions then please do so. You can also share other IT knowledge on my site and you are encouraged to do so, i.e. algorithms and methods, really just about anything that is IT related.

Please remove your author ID from ...

Anyone know why this is WA?

[cpp]
#include <iostream>
#include <vector>
#include <cmath>
#include <cctype>
using namespace std;

const double PI=3.1415926535898;
int main()
{
double x, y, d, real;
char ch;
vector<char> map;
int mapNum=0;

while(true)
{
x=0; y=0; d=0;
do
{
cin.get(ch ...