I don't know what's wrong with your program.
But I suggest that you can think the problem
in another way.
Try to consider only 1/4 graph.
Then to check each grid,if the distance from left_up point to original point is larger
than (2*n-1)/2,the grid is out of circle.
Else if the distance form ...
Search found 3 matches
- Fri Mar 15, 2002 5:05 am
- Forum: Volume 3 (300-399)
- Topic: 356 - Square Pegs And Round Holes
- Replies: 41
- Views: 10428
- Fri Mar 15, 2002 5:03 am
- Forum: Volume 3 (300-399)
- Topic: 356 - Square Pegs And Round Holes
- Replies: 41
- Views: 10428
- Wed Mar 06, 2002 3:26 pm
- Forum: Volume 1 (100-199)
- Topic: 112 - Tree Summing
- Replies: 137
- Views: 32293