Codeforces Round 117 (Div. 2)
B
Vasya's Calendar
Codeforces
1000
原题
← AC →
翻译中…

Vasya lives in a strange world. The year has $*n*$ months and the $*i*$-th month has $*a*_{*i*}$ days. Vasya got a New Year present — the clock that shows not only the time, but also the date.

翻译中…

The clock's face can display any number from $1$ to $*d*$. It is guaranteed that $*a*_{*i*} ≤ *d*$ for all $*i*$ from $1$ to $*n*$. The clock does not keep information about the current month, so when a new day comes, it simply increases the current day number by one. The clock cannot display number $*d* + 1$, so after day number $*d*$ it shows day $1$ (the current day counter resets). The mechanism of the clock allows you to increase the day number by one manually. When you execute this operation, day $*d*$ is also followed by day $1$.

翻译中…

Vasya begins each day checking the day number on the clock. If the day number on the clock does not match the actual day number in the current month, then Vasya manually increases it by one. Vasya is persistent and repeats this operation until the day number on the clock matches the actual number of the current day in the current month.

翻译中…

A year passed and Vasya wonders how many times he manually increased the day number by one, from the first day of the first month to the last day of the $*n*$-th month inclusive, considering that on the first day of the first month the clock display showed day $1$.

翻译中…

Input

翻译中…

The first line contains the single number $*d*$ — the maximum number of the day that Vasya's clock can show $(1 ≤ *d* ≤ 10^{6})$.

翻译中…

The second line contains a single integer $*n*$ — the number of months in the year $(1 ≤ *n* ≤ 2000)$.

翻译中…

The third line contains $*n*$ space-separated integers: $*a*_{*i*}$ $(1 ≤ *a*_{*i*} ≤ *d*)$ — the number of days in each month in the order in which they follow, starting from the first one.

翻译中…

Output

翻译中…

Print a single number — the number of times Vasya manually increased the day number by one throughout the last year.

翻译中…

Note

翻译中…

In the first sample the situation is like this:

翻译中…
  • Day 1. Month 1. The clock shows $1$. Vasya changes nothing.
  • Day 2. Month 1. The clock shows $2$. Vasya changes nothing.
  • Day 1. Month 2. The clock shows $3$. Vasya manually increases the day number by $1$. After that the clock shows $4$. Vasya increases the day number by $1$ manually. After that the clock shows $1$.
  • Day 2. Month 2. The clock shows $2$. Vasya changes nothing.
翻译中…

In total, Vasya manually changed the day number by

翻译中…

1

翻译中…

exactly

翻译中…

2

翻译中…

times.

翻译中…

样例

Input #1
4
2
2 2
Output #1
2
InputCopy OutputCopy
Input #2
5
3
3 4 3
Output #2
3
InputCopy OutputCopy
Input #3
31
12
31 28 31 30 31 30 31 31 30 31 30 31
Output #3
7
InputCopy OutputCopy
题目信息
题号
182B
时间限制
1 s
内存限制
256 MB
标签
模拟

题面与样例版权归 Codeforces 及出题人所有;中文翻译由 AI 生成(CI 管线),如有出入请以原文为准。