Please post a link to the UVa problem. I’ve browsed through all 9 volumes for that camel trading problem with no results. I’ve found an explination online, but no place where UVa offers me to submit my solution.
Ah ok. the usual format is: if the problem is 10Xxx then it’s in contest volume 10X (written in Roman). And if it’s of the form Xxx, it’s in problem volume X
would it be considered cheating if someone posted what is an acceptable 64-bit integer type for C++ that this server will accept is?
On my windows machine in VS, __64int is working great, but the serve hates this.
I’ve tried long int, unsigned long int, unsigned long long, unsigned long long int
and just for fun to offset my frustrations, I also tried:
unsigned long long long, unsigned long long long long, unsigned long long long long long, unsigned long long long long long long, unsigned long long long long long long long, unsigned long long long long long long long long, unsigned long long long long long long long long long, unsigned long long long long long long long long long long, unsigned long long long long long long long long long long long long long long long long long long long long long long long long long long long long long long long long long long long long long
(not really all of them, but it was fun to type out:)
please, this searching for data type isn’t aiding in my education, I believe, could be wrong,
thanks
The programming assignment works fine in my local box with the sample inputs given on the uVa website. But when I submit to uVa, it gives me WA. I’ve used “long” as suggested. Any other help would be appreciated.
For C++, double works fine. Just make sure to use it for your intermediate values as well, then trim off the decimal values in your output. A good test is 20^12.
For question 6.8, shall we assume that the function f() is monotonically ascending? Otherwise, it won’t make sense to wait for more time before opening fire again
In fact, a reasonable f() requires an assumption even stronger than the ascending assumption: f(n) should be no smaller than any of the combination f(1)+f(n-1), f(2)+f(n-2), and so on. This assumption means that during a certain period, the machine emits more power in firing once than firing multiple times. Otherwise, this machine doesn’t quite obey the physical law.
Basically, the assumptions of this problem is very vague. It’s hard to prove the given algorithm works or to design our own algorithms when the problem is not clearly defined. One can always makes some weird assumptions to fail an algorithm, such as some time no robots coming, or f() will become marginally weaker if waiting too much time.
Hope the lecturer could make a clear set of standards for this problem.
So I think I was being flippant when I first replied to Dafang. I don’t see why *any* assumption is needed on f. Yes, if it’s not monotonically increasing, this might not make “physical sense”; but who cares ?
Dafang, can you clarify why you think that any assumption on f is needed, given that the problem input assumes that f is fully specified ?
I cannot open the UVa site using my firefox saying that “Firefox has detected that the server is redirecting the request for this address in a way that will never complete.” Does anyone encounter this problem now?
I get the same thing, and it seems to be permanent on my laptop. I tried removing the cookie for the site and reloading the page, but that didn’t work either. I finally had to just use a different machine.
It seems to be a case of bad web programming. Which strikes me as a tad ironic. Or maybe it’s just another challenge. :-p
Entries
September 26th, 2008 at 12:29 pm
So the post says it is due Oct 4, but the assignment says Oct 8. Do we get to choose?
September 26th, 2008 at 1:17 pm
my mistake. it’s oct 8
September 29th, 2008 at 4:24 pm
Watch out for type problems if you are getting “wrong answer” on the programming problem.
October 1st, 2008 at 8:12 pm
Please post a link to the UVa problem. I’ve browsed through all 9 volumes for that camel trading problem with no results. I’ve found an explination online, but no place where UVa offers me to submit my solution.
October 1st, 2008 at 8:13 pm
Found it
http://icpcres.ecs.baylor.edu/onlinejudge/index.php?option=com_onlinejudge&Itemid=8&category=19&page=show_problem&problem=1641
October 1st, 2008 at 8:15 pm
Ah ok. the usual format is: if the problem is 10Xxx then it’s in contest volume 10X (written in Roman). And if it’s of the form Xxx, it’s in problem volume X
October 1st, 2008 at 11:01 pm
I keep getting some kind of redirect error when I try to visit the UVa site.
October 1st, 2008 at 11:02 pm
Yes, the server currently appears to be down. hopefully it will be back up soon. We are monitoring it (I always wanted to say that :))
October 2nd, 2008 at 7:40 am
Helpful resource:
http://www.algorithmist.com/index.php/UVa_10700
October 2nd, 2008 at 9:42 am
would it be considered cheating if someone posted what is an acceptable 64-bit integer type for C++ that this server will accept is?
On my windows machine in VS, __64int is working great, but the serve hates this.
I’ve tried long int, unsigned long int, unsigned long long, unsigned long long int
and just for fun to offset my frustrations, I also tried:
unsigned long long long, unsigned long long long long, unsigned long long long long long, unsigned long long long long long long, unsigned long long long long long long long, unsigned long long long long long long long long, unsigned long long long long long long long long long, unsigned long long long long long long long long long long, unsigned long long long long long long long long long long long long long long long long long long long long long long long long long long long long long long long long long long long long long
(not really all of them, but it was fun to type out:)
please, this searching for data type isn’t aiding in my education, I believe, could be wrong,
thanks
October 2nd, 2008 at 9:54 am
Go for it. Any help will be appreciated. On the brighter side, this is the last programming assignment.
October 2nd, 2008 at 11:33 am
Good news and bad news (or good, good), thanks all the same.
Please everyone, if you have the key data type, please o please pass on this golden nugget of knowledge.
thanks
October 2nd, 2008 at 11:36 am
I just used type “long” in my Java solution and it worked fine.
October 2nd, 2008 at 12:55 pm
I used “unsigned long long” in c++ and it worked just fine.
October 2nd, 2008 at 4:31 pm
Hopefully Helpful,
Pay attention to the output everyone, that little tinny period is important.
It may be the difference between several hours,
a done fool
October 4th, 2008 at 11:33 am
The programming assignment works fine in my local box with the sample inputs given on the uVa website. But when I submit to uVa, it gives me WA. I’ve used “long” as suggested. Any other help would be appreciated.
Thanks
October 4th, 2008 at 12:43 pm
For C++, double works fine. Just make sure to use it for your intermediate values as well, then trim off the decimal values in your output. A good test is 20^12.
October 5th, 2008 at 9:38 pm
For question 6.8, shall we assume that the function f() is monotonically ascending? Otherwise, it won’t make sense to wait for more time before opening fire again
October 5th, 2008 at 10:03 pm
Yes, you can assume that
October 5th, 2008 at 10:59 pm
In fact, a reasonable f() requires an assumption even stronger than the ascending assumption: f(n) should be no smaller than any of the combination f(1)+f(n-1), f(2)+f(n-2), and so on. This assumption means that during a certain period, the machine emits more power in firing once than firing multiple times. Otherwise, this machine doesn’t quite obey the physical law.
Basically, the assumptions of this problem is very vague. It’s hard to prove the given algorithm works or to design our own algorithms when the problem is not clearly defined. One can always makes some weird assumptions to fail an algorithm, such as some time no robots coming, or f() will become marginally weaker if waiting too much time.
Hope the lecturer could make a clear set of standards for this problem.
October 5th, 2008 at 11:04 pm
So I think I was being flippant when I first replied to Dafang. I don’t see why *any* assumption is needed on f. Yes, if it’s not monotonically increasing, this might not make “physical sense”; but who cares ?
Dafang, can you clarify why you think that any assumption on f is needed, given that the problem input assumes that f is fully specified ?
October 8th, 2008 at 1:01 am
I cannot open the UVa site using my firefox saying that “Firefox has detected that the server is redirecting the request for this address in a way that will never complete.” Does anyone encounter this problem now?
October 8th, 2008 at 8:23 am
I get the same thing, and it seems to be permanent on my laptop. I tried removing the cookie for the site and reloading the page, but that didn’t work either. I finally had to just use a different machine.
It seems to be a case of bad web programming. Which strikes me as a tad ironic. Or maybe it’s just another challenge. :-p