codeforces-scrape

Codeforces scraped problems and editorials
git clone git://git.laack.co/codeforces-scrape.git
Log | Files | Refs | README

197A.md (1651B)


      1 Source: https://codeforces.com/problemset/problem/197/A
      2 
      3 A. Plate Game
      4 
      5 time limit per test
      6 
      7 2 seconds
      8 
      9 memory limit per test
     10 
     11 256 megabytes
     12 
     13 input
     14 
     15 stdin
     16 
     17 output
     18 
     19 stdout
     20 
     21 You've got a rectangular table with length *a* and width *b* and the infinite number of plates of radius *r*. Two players play the following game: they take turns to put the plates on the table so that the plates don't lie on each other (but they can touch each other), and so that any point on any plate is located within the table's border. During the game one cannot move the plates that already lie on the table. The player who cannot make another move loses. Determine which player wins, the one who moves first or the one who moves second, provided that both players play optimally well.
     22 
     23 Input
     24 
     25 A single line contains three space-separated integers *a*, *b*, *r* (1 ≤ *a*, *b*, *r* ≤ 100) — the table sides and the plates' radius, correspondingly.
     26 
     27 Output
     28 
     29 If wins the player who moves first, print "First" (without the quotes). Otherwise print "Second" (without the quotes).
     30 
     31 Examples
     32 
     33 Input
     34 
     35 ```
     36 5 5 2
     37 ```
     38 
     39 Output
     40 
     41 ```
     42 First
     43 ```
     44 
     45 Input
     46 
     47 ```
     48 6 7 4
     49 ```
     50 
     51 Output
     52 
     53 ```
     54 Second
     55 ```
     56 
     57 Note
     58 
     59 In the first sample the table has place for only one plate. The first player puts a plate on the table, the second player can't do that and loses.
     60 
     61  ![](https://espresso.codeforces.com/454f688fd0b73462c71f86bf1de3d9db7f2303e6.png) 
     62 
     63 In the second sample the table is so small that it doesn't have enough place even for one plate. So the first player loses without making a single move.
     64 
     65  ![](https://espresso.codeforces.com/2605d65aca063e9cba7d555b6be2c74da2ea2be0.png)