 |
|
Hi!
sending you some tasks - the interesting ones.
Discrete volume (traditional):
your given an N(<10,000)-gon (not neccesary) convex. Its vertices have
integer coordinates. You have to determine the number of point with
integer
coordinates within the N-gon.
Knights:
You have a map of kingdom M*N square (M<=100 rows and N<=100 clms). The
four
squares in the top left corner are the stall (see pic.):
SS............ S - stall
SS............ . - ordinary sq.
..............
..............
..............
..............
You're given K<=1000 knights in the kingdom. Each knight stands on one
square. One square can hold several knights. You're playing the
following
game. There are two players. They make turns one after another. Your
aim is
to put all knights to the stall. To make one turn means - to choose one
knight and to move it so that its coordinates decrease in its sum. For
clarity - for knight A there are four possible moves, for knight B only
one:
0123456789etc
0SS........B......
1SS......1........
2.................
3...3.4...........
4..2..............
5....A............
6..1..............
You may move only knights not in the stall.
Player who makes the last turn wins the game.
(i.e. the player who cannot make a turn is the LOOOOOOZER). Given these
knights. You have to write a program playing against a library.
Joe
Cao
Privacy Policy-
Terms of Service
-
Guidelines
Copyright © 1994-2001
Yahoo! Inc. All rights reserved.