CF1041A Heist

原题链接：http://codeforces.com/contest/1041/problem/A

CF1041A Heist

There was an electronic store heist last night.

All keyboards which were in the store yesterday were numbered in ascending order from some integer number xxx. For example, if x=4x=4x=4 and there were 333 keyboards in the store, then the devices had indices 4,54, 54,5 and 666, and if
x=10x=10x=10 and there were 777 of them then the keyboards had indices 10,11,12,13,14,1510, 11, 12, 13, 14, 1510,11,12,13,14,15 and 161616.

After the heist, only nnn keyboards remain, and they have indices a1,a2,⋯ ,ana_1,a_2,\cdots,a_na1,a2,⋯,an. Calculate the minimum possible number of keyboards that have been stolen. The staff remember neither xxx nor the number of keyboards in the store before the heist.

Input

The first line contains single integer n(1≤n≤1000)n(1≤n≤1000)n(1≤n≤1000) — the number of keyboards in the store that remained after the heist.

The second line contains nnn distinct integers a1,a2,⋯ ,an(1≤ai≤109)a_1,a_2,\cdots,a_n(1≤a_i≤10^9)a1,a2,⋯,an(1≤ai≤109) — the indices of the remaining keyboards. The integers aia_iai are given in arbitrary order and are pairwise distinct.

Output

Print the minimum possible number of keyboards that have been stolen if the staff remember neither xxx nor the number of keyboards in the store before the heist.

Examples

input

4
10 13 12 8

output

input

5
7 5 6 4 8

output

Note

In the first example, if x=8x=8x=8 then minimum number of stolen keyboards is equal to 222. The keyboards with indices 999 and 111111 were stolen during the heist.

In the second example, if x=4x=4x=4 then nothing was stolen during the heist.

题解

排序强校表示，排一遍序就能A （其实不用）。

代码

#include<bits/stdc++.h>
using namespace std;
int a[105],n;
void in(){scanf("%d",&n);for(int i=1;i<=n;++i)scanf("%d",&a[i]);}
void ac(){sort(a+1,a+1+n);printf("%d",a[n]-a[1]+1-n);}
int main(){in();ac();}

CF1041A Heist相关推荐

【题解】【CF1041A】Heist
题意: 有许多的键盘,这些键盘的编号连续,但是某些键盘被偷了,现在给你剩下的键盘的编号,求被偷的键盘数量的最小值. 题解: 由于键盘编号连续,那么最少的键盘数量就一定是最大的键盘编号减去最小的键盘编号 ...
[HTB]“Heist”靶机渗透详细思路
今天我们来看一下hackthebox里的一个靶机"Heist",直接开始渗透. 一.信息搜集先打开网站看看.是一个登陆框,使用弱口令和注入都无果.在网页中发现了 login as ...
Honey Heist
5092: Honey Heist 时间限制: 1 Sec 内存限制: 128 MB 题目描述 0x67 is a scout ant searching for food and discover ...
Money Heist: 1 vulnhub walkthrough
Money Heist: 1 虚拟机页面:http://www.vulnhub.com/entry/money-heist-1,592/ Description "The Professor ...
Honey Heist(mcpc2017 )
5092: Honey Heist 时间限制: 1 Sec 内存限制: 128 MB 提交: 27 解决: 10 [提交][状态][讨论版][命题人:admin] 题目描述 0x67 is a s ...
mcpc2017 Honey Heist (模拟)
5092: Honey Heist 时间限制: 1 Sec 内存限制: 128 MB 提交: 21 解决: 9 [提交][状态][讨论版][命题人:admin] 题目描述 0x67 is a sc ...
HEIST攻击：从HTTPS加密数据中获取明文
在Black Hat 2016大会上,两名比利时的安全研究人员展示了他们今年的研究成果.他们发现了一个WEB攻击方式可以绕过HTTPS加密得到明文信息.他们把这种攻击方式叫做HEIST攻击.HEIST ...
实战HackTheBox里的Heist
首要是运行Nmap来查找主机上正在运行的服务. # Nmap 7.70 scan initiated Wed Aug 14 21:08:24 2019 as: nmap -A -p- -oN scan ...
Vulnhub-Money Heist: 1
靶机下载:点我测试过程: 1.下载好靶机以后导入虚拟机,网络设置为VMnet8 2.打开虚拟机,需要用户名和密码登录,在这里,我们百度一下Ubuntu密码破解点我 3.进入系统后查看IP,发现不能获 ...
无需训练RNN或生成模型，我写了一个AI来讲故事
作者 | Andre Ye 译者 | 弯月出品 | AI科技大本营(ID:rgznai100) 这段日子里,我们都被隔离了,就特别想听故事.然而,我们并非对所有故事都感兴趣,有些人喜欢浪漫的故事,他 ...

CF1041A Heist

CF1041A Heist

Input

Output

Examples

input

output

input

output

Note

题解

代码

CF1041A Heist相关推荐

最新文章

热门文章