I think this kind of problems don't belong in a programming contest. It's just finding a mathematical formula and then writing a 10-line program to implement it. It doesn't have anything to do with clever programming or problem solving, just mathematics...
I'm curious about other people's opinions.
Search found 7 matches
Search found 7 matches • Page 1 of 1
- Mon Mar 10, 2003 6:25 pm
- Forum: Volume 4 (400-499)
- Topic: 453 - Intersecting Circles
- Replies: 84
- Views: 15032
Mmm... funny, the only thing that was different was the case 1.0 1.0 0.0 1.0 1.0 0.0 where my program said "THE CIRCLES ARE THE SAME" and yours said (1.000,1.000). But my changed program that replicates this still gets a WA. A few tests (using assert) showed that my program sometimes wants to output...
- Thu Mar 06, 2003 5:10 pm
- Forum: Volume 100 (10000-10099)
- Topic: 10002 - Center of Masses
- Replies: 59
- Views: 26438
I solved the problem by choosing one (x,y) value, sorting all points by angle around that point, making triangles consisting of two subsequent vertices of the polygon and (x,y) and calculating the center of mass. The funny thing is: I first used the average of all points as the (x,y) value and it di...
- Wed Mar 05, 2003 3:35 pm
- Forum: Volume 104 (10400-10499)
- Topic: 10457 - Magic Car
- Replies: 20
- Views: 10760
I handled it as a complicated shortest-path problem, but the data stored at each vertex is not just one length, but a list of possible (minspeed, maxspeed, energyused) records. I iteratively relaxed edges just like in Bellman Ford, and compared records in the same vertex list with eachother to deter...