ModSum
Problem Statement
For an integer N, we will choose a permutation {P1,P2,…,PN} of {1,2,…,N}.
Then, for each i=1,2,…,N, let Mi be the remainder when i is divided by Pi.
Find the maximum possible value of M1+M2+[cdots]+MN.
Constraints
- N is an integer satisfying 1≤N≤109.
Input
Input is given from Standard Input in the following format:
N
Output
Print the maximum possible value of M1+M2+[cdots]+MN.
Sample Input 1
2
Sample Output 1
1
When the permutation {P1,P2}={2,1} is chosen, M1+M2=1+0=1.
Sample Input 2
13
Sample Output 2
78
Sample Input 3
1
Sample Output 3
0
思路:这道题看样例就很容易可以猜出是求(1+2+...+n-1)。
这里的最优策略是
如样例13
除数 12 11 10 9 8 7 6 5 4 3 2 1 13
被除数 13 12 11 10 9 8 7 6 5 4 3 2 1
余数 12 11 10 9 8 7 6 5 4 3 2 1 0
因此最大值即为n-1的累加。
代码就超级简单。
#include<iostream>
using namespace std;
int main(){
long long n;
cin>>n;
long long sum=0;
for(long long i=1;i<n;i++){
sum+=i;
}
cout<<sum<<endl;
return 0;
}
如果数据范围比较大,也有公式1+2+3+...+k=(k+1)*k/2。