610A.md (1624B)
1 Source: https://codeforces.com/problemset/problem/610/A 2 3 A. Pasha and Stick 4 5 time limit per test 6 7 1 second 8 9 memory limit per test 10 11 256 megabytes 12 13 input 14 15 standard input 16 17 output 18 19 standard output 20 21 Pasha has a wooden stick of some positive integer length *n*. He wants to perform exactly three cuts to get four parts of the stick. Each part must have some positive integer length and the sum of these lengths will obviously be *n*. 22 23 Pasha likes rectangles but hates squares, so he wonders, how many ways are there to split a stick into four parts so that it's possible to form a rectangle using these parts, but is impossible to form a square. 24 25 Your task is to help Pasha and count the number of such ways. Two ways to cut the stick are considered distinct if there exists some integer *x*, such that the number of parts of length *x* in the first way differ from the number of parts of length *x* in the second way. 26 27 Input 28 29 The first line of the input contains a positive integer *n* (1 ≤ *n* ≤ 2·109) — the length of Pasha's stick. 30 31 Output 32 33 The output should contain a single integer — the number of ways to split Pasha's stick into four parts of positive integer length so that it's possible to make a rectangle by connecting the ends of these parts, but is impossible to form a square. 34 35 Examples 36 37 Input 38 39 ``` 40 6 41 ``` 42 43 Output 44 45 ``` 46 1 47 ``` 48 49 Input 50 51 ``` 52 20 53 ``` 54 55 Output 56 57 ``` 58 4 59 ``` 60 61 Note 62 63 There is only one way to divide the stick in the first sample {1, 1, 2, 2}. 64 65 Four ways to divide the stick in the second sample are {1, 1, 9, 9}, {2, 2, 8, 8}, {3, 3, 7, 7} and {4, 4, 6, 6}. Note that {5, 5, 5, 5} doesn't work.