661A.md (706B)
1 Source: https://codeforces.com/problemset/problem/661/A 2 3 A. Lazy Caterer Sequence 4 5 time limit per test 6 7 2 seconds 8 9 memory limit per test 10 11 64 megabytes 12 13 input 14 15 standard input 16 17 output 18 19 standard output 20 21 Lazy caterer sequence is defined as the maximum number of pieces formed when slicing a convex pancake with *n* cuts (each cut is a straight line). The formula is *C**n* = *n*·(*n* + 1) / 2 + 1. You are given *n*; calculate *n*-th element of the sequence. 22 23 Input 24 25 The only line of the input contains an integer *n* (0 ≤ *n* ≤ 100). 26 27 Output 28 29 Output the *n*-th element of lazy caterer sequence. 30 31 Examples 32 33 Input 34 35 ``` 36 2 37 ``` 38 39 Output 40 41 ``` 42 4 43 ``` 44 45 Input 46 47 ``` 48 5 49 ``` 50 51 Output 52 53 ``` 54 16 55 ```