OJ Board

It looks like you're printing extra spaces at the end of some lines. You probably don't want to do that.

I keep getting a presentation error on this problem, and it doesn't really describe what the format of the output should be. For those of you in a similar situation, there shouldn't be any blank lines between output cases.

If you look at hex F in the example, it only has two valid rotations, so you shouldn't try all six for it.

Also, think about which hex you want to put down first.

So I keep getting WA. I implemented, but didn't post, a class Z which is meant to be an arbitrary precision integer class (it is meant to act like int, overloaded operaters etc.). I'm pretty sure the +,* and - work with the Z class, since I've used it on other problems. ** also seems to work (I test...

Another thing about the STL is that if used properly it can be faster than C code. Consider the qsort() function. It takes a function pointer as a parameter and uses that to compare two items. std::sort() does the comparision through a function object. A smart compiler could maybe inline the functio...

Thanks Joey!

yeah, my problem was I was returning 2 instead of 1 from ssa (I had refactored my code like 7 different times, and forgot to change a constant).

(with the includes, I just didn't paste all my code).

Well, then I have no idea what my error is. Here's my convoluted code and reasoning about what it's supposed to do. Here's the general idea of my code: First I look for non-positive values, and if there are any, return "bad" which means to print invalid input. Then I check that the angles ...

I don't get the second example. The information it gives is a = 62.72048064, alpha = 2.26853639, and beta = 0.56794657. so, I calculate (from the angles summing to pi) gamma = .30510969... Then I use c = a * sin(gamma)/sin(alpha) = 24.58722428... So when I print it out I get 24.587224, which differs...

I got AC, so I'd like to share what my program assumes: Basically, ignore houses and consider every driveway as distinct (even if they do go to the same house). I don't know if the same driveway can be both the source and destination, but I answer 0 in that case. I define "cul de sac" when...

http://online-judge.uva.es/board/viewtopic.php?t=177
If you're still confused, I could try to explain it in more detail.

As misof said, scanf/printf are significantly faster than cin/cout. I've been hit by this on quite a few problems (including one I recently solved that took me about 20 submits). Most of the problems that are really that critical on runtime are in the earlier volumes and I find in such cases that I ...

Ok, I just got AC and I spent so much time on this problem that I would like to make clear what the rules are: First check if the turn makes sense at all (i.e. there is a road in the direction you want to turn). If not then obviously the turn is NOT valid. Next check if you are entering or exiting a...

The slow part is probably your factoring. If you are iterating up to the square root of i and using the totient function then I would think that would be fast enough.

You could always try to use a faster factoring method.

Well, I ran your code and mine on every input the diff said they were exactly the same (and my code got AC).

This is a really odd situation.

I basically did this pair<int,int> yours(int n){ // I put the main part of your code here, but took out the scanf return make_pair(len,n); //and did this instead of printf } pair<int,int> mine(int n){ // my code here } int main(){ for(int i=1;i<N;i++) if(yours(i)!=mine(i)){ cout<<"Oh pants, we ...