101080: [AtCoder]ABC108 A - Pair

Memory Limit:256 MB Time Limit:2 S
Judge Style:Text Compare Creator:
Submit:0 Solved:0

Description

Score : $100$ points

Problem Statement

Find the number of ways to choose a pair of an even number and an odd number from the positive integers between $1$ and $K$ (inclusive). The order does not matter.

Constraints

  • $2\leq K\leq 100$
  • $K$ is an integer.

Input

Input is given from Standard Input in the following format:

$K$

Output

Print the number of ways to choose a pair of an even number and an odd number from the positive integers between $1$ and $K$ (inclusive).


Sample Input 1

3

Sample Output 1

2

Two pairs can be chosen: $(2,1)$ and $(2,3)$.


Sample Input 2

6

Sample Output 2

9

Sample Input 3

11

Sample Output 3

30

Sample Input 4

50

Sample Output 4

625

Input

题意翻译

请求出从 $1$ 以上,$K$ 以下(包括$1$和$K$)的正整数中,偶数和奇数各选一个的方法的个数。不考虑选择的顺序,即,$(a,b)$ 和 $(b,a)$ 算作同一种方案。 ### 输入格式 一个正整数$K$。 ### 输出格式 方案数。 ### 数据范围与样例解释 $2 \le K \le 100$ 。 第一组样例:只有 $(2,1)$ 和 $(2,3)$ 两种方案符合条件。

加入题单

算法标签: