CF484B.Maximum Value

普及/提高-

通过率：0%

AC君温馨提醒

该题目为【codeforces】题库的题目，您提交的代码将被提交至codeforces进行远程评测，并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供，我们无法保证该服务的稳定性，若提交后无反应，请等待一段时间后再进行重试。

题目描述

You are given a sequence $a$ consisting of $n$ integers. Find the maximum possible value of (integer remainder of $a_{i}$ divided by $a_{j}$ ), where $1<=i,j<=n$ and $a_{i}>=a_{j}$ .

输入格式

You are given a sequence $a$ consisting of $n$ integers. Find the maximum possible value of (integer remainder of $a_{i}$ divided by $a_{j}$ ), where $1<=i,j<=n$ and $a_{i}>=a_{j}$ .

输出格式

Print the answer to the problem.

输入输出样例

输入#1
```
3
3 4 5
```
输出#1
```
2
```

首页