UVa OJ Board

brianfry713 wrote:Either don't use abs or make your abs function return something.

Thanks Solved with that tip Stupid mistake

Also WA, but code seems correct? #include<cstdio> #include<cstring> #include<string> using namespace std; #define MAX_N 2000000 int main(){ int l,i; int dist,finalDist; char c; bool jackpot,rest; /* freopen("burger.in","r",stdin); freopen("burger.out","w",stdout); //*/ while(scanf("%d\n",&l)!=EOF){ ...

Thanks brianfry713, code got AC in the end (even though the algorithm was very unconventional )

brianfry713 wrote:That code won't compile

Huh? Why?
It works perfectly on my c++ compiler and uva is returning me WA, not CE

Please help with my WA code :( Or at least post some testcases for me to use for debugging? #include<cstdio> #include<cstring> #include<string> using namespace std; #define MAX_N 2000000 int main(){ int l,i; int dist,finalDist; char c; bool jackpot,rest; /* freopen("burger.in","r",stdin); freopen("b...

I have got WA for this problem a few times.. I use the d-c = a+b algorithm.. Can I hav some datasets to further test the code (all io is correct)? #include<cstdio> #include<algorithm> #include<vector> #include<set> #include<cmath> #include<map> using namespace std; #define LOOP(times) for(int(i) = 0...

@li_kuet wrote:Try this case
Input :

Code: Select all

4
-3 -3 -3 -9
0

Output :

Code: Select all

-9

The output is wrong I thot? All numbers in the set must be distinct..

I have edited my code a bit so that it prints lines between each output, but it still gets WA.. Is there any testcases that I can use to check my code (my algorithm is very unconventional, but would still work)? #include <cstdio> #include <algorithm> #include <vector> #include <set> #include <cstrin...

Why is my code getting WA? I am printing the lines properly, have passed all test inputs on the forum.. But still WA
Would appreciate some help and test inputs
Thanks,
Sam

/* I have been getting wrong answer as well. My algorithm is a little unconventional, but it should still work.. Tested it and it worked on all the inputs in the forum... Algorithm (quite unconventional): Will be using a 2d array heard[people][trees] to store all values. If the tree is heard, value ...

Hi, I got WA for my code (below) and I really can't understand why. Can someone help me to see if there is something wrong with my code? Thanks. (It's recursive code btw) #include <iostream> #include <fstream> #include <math.h> #include <string.h> using namespace std; #define LOOP(times) for(int(i)=...