UVa OJ Board

i wonder how they managed to even change the test data on the fly
For some problem the sample data spoke of something else and what got ACC finally was something entirely different....

Isn't it possible to borrow the questions & test data of old ACM problems officially

these ppl don't realize that accomodation n hospitality r secondary issues....
unless a gud programing contest is made, these "secondary" issues go in vain...

can anyone give some test cases atleast...
i think its some boundary conditions...

can anyone help me on my code plz..

its WA..

its given above in this thread...

no one replying..??

i had that nlogn algo in mind when going for the N^2 one ... but the N^2 tled.. then i tried nlong n , but it gives WA... any one can have a look at it?? :( #include<vector> #include<algorithm> #include<cmath> #include<cstdio> #include<iostream> #include<string> #include<stack> #include<cstdlib> #in...

i know that rows n columns can be solved independently..
but how to do that in efficient way...
i tried O(n^2) but its clearly going to time limit .. any better algo??

thanks ...
its AC in 1.682 secs..

strings are really very slow....
i need to minimize thrie usage

it tle's.....
here is my code...

how can i improve upon it??

what is ur algo...???

do respond if accepted...

thanks in advance..

some one hhelp on this topic...

no reponses yet

Or a more easier suggestion: how about only allow the moderators to create new topics. Normal users will just be able to reply. So when 10 new problems will be added moderators will create 10 new threads to discuss those problems. And the problems themselves can have a link to this thread. Some oth...

i m really poor in geometry...

any hints of how to approach this problem???

will the brute force approach do here...???