codeforces-scrape

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

1459B.md (1504B)


      1 Source: https://codeforces.com/problemset/problem/1459/B
      2 
      3 B. Move and Turn
      4 
      5 time limit per test
      6 
      7 2 seconds
      8 
      9 memory limit per test
     10 
     11 512 megabytes
     12 
     13 input
     14 
     15 standard input
     16 
     17 output
     18 
     19 standard output
     20 
     21 A robot is standing at the origin of the infinite two-dimensional plane. Each second the robot moves exactly $1$ meter in one of the four cardinal directions: north, south, west, and east. For the first step the robot can choose any of the four directions, but then at the end of every second it has to turn 90 degrees left or right with respect to the direction it just moved in. For example, if the robot has just moved north or south, the next step it takes has to be either west or east, and vice versa.
     22 
     23 The robot makes exactly $n$ steps from its starting position according to the rules above. How many different points can the robot arrive to at the end? The final orientation of the robot can be ignored.
     24 
     25 Input
     26 
     27 The only line contains a single integer $n$ ($1 \leq n \leq 1000$) — the number of steps the robot makes.
     28 
     29 Output
     30 
     31 Print a single integer — the number of different possible locations after exactly $n$ steps.
     32 
     33 Examples
     34 
     35 Input
     36 
     37 ```
     38 1
     39 ```
     40 
     41 Output
     42 
     43 ```
     44 4
     45 ```
     46 
     47 Input
     48 
     49 ```
     50 2
     51 ```
     52 
     53 Output
     54 
     55 ```
     56 4
     57 ```
     58 
     59 Input
     60 
     61 ```
     62 3
     63 ```
     64 
     65 Output
     66 
     67 ```
     68 12
     69 ```
     70 
     71 Note
     72 
     73 In the first sample case, the robot will end up 1 meter north, south, west, or east depending on its initial direction.
     74 
     75 In the second sample case, the robot will always end up $\sqrt{2}$ meters north-west, north-east, south-west, or south-east.