lightoj 1328 - A Gift from the Setter 【数学】
来源:互联网 发布:疯狂联盟座狼升级数据 编辑:程序博客网 时间:2024/06/07 19:42
题目链接:lightoj 1328 - A Gift from the Setter
1328 - A Gift from the Setter
PDF (English) Statistics Forum
Time Limit: 2 second(s) Memory Limit: 32 MB
Problem setting is somewhat of a cruel task of throwing something at the contestants and having them scratch their head to derive a solution. In this problem, the setter is a bit kind and has decided to gift the contestants an algorithm which they should code and submit. The C/C++ equivalent code of the algorithm is given below:
long long GetDiffSum( int a[], int n )
{
long long sum = 0;
int i, j;
for( i = 0; i < n; i++ )
for( j = i + 1; j < n; j++ )
sum += abs( a[i] - a[j] ); // abs means absolute value
return sum;
}
The values of array a[] are generated by the following recurrence relation:
a[i] = (K * a[i-1] + C) % 1000007 for i > 0
where K, C and a[0] are predefined values. In this problem, given the values of K, C, n and a[0], you have find the result of the function
“long long GetDiffSum( int a[], int n )”
But the setter soon realizes that the straight forward implementation of the code is not efficient enough and may return the famous “TLE” and that’s why he asks you to optimize the code.
Input
Input starts with an integer T (≤ 100), denoting the number of test cases.
Each case contains four integers K, C, n and a[0]. You can assume that (1 ≤ K, C, a[0] ≤ 104) and (2 ≤ n ≤ 105).
Output
For each case, print the case number and the value returned by the function as stated above.
Sample Input
Output for Sample Input
2
1 1 2 1
10 10 10 5
Case 1: 1
Case 2: 7136758
求解函数值。
AC代码:
#include <iostream>#include <cstdio>#include <algorithm>using namespace std;typedef long long LL;const int MAXN = 1e5 +10;const int MOD = 1e6 + 7;LL a[MAXN];LL sum[MAXN];int main(){ int t, kcase = 1; scanf("%d", &t); while(t--) { int K, C, n, v; scanf("%d%d%d%d", &K, &C, &n, &v); a[1] = v; for(int i = 2; i <= n; i++) { a[i] = (a[i-1] * K % MOD + C) % MOD; } sort(a+1, a+n+1); LL ans = 0; sum[0] = 0; for(int i = 1; i <= n; i++) { sum[i] = sum[i-1] + a[i]; } for(int i = 1; i <= n; i++) { ans += sum[n] - sum[i] - 1LL * (n - i) * a[i]; } printf("Case %d: %lld\n", kcase++, ans); } return 0;}
- lightoj 1328 - A Gift from the Setter 【数学】
- LightOJ - 1328 A Gift from the Setter (数学)
- LightOJ 1328 A Gift from the Setter
- lightoj 1328 - A Gift from the Setter 贪心
- Light OJ:1328 A Gift from the Setter(数学)
- Codeforces 625A Guest From the Past 【基础数学】
- ♥CodeForces 609B-B. The Best Gift【组合数学】
- Educational Codeforces Round 3 B.The Best Gift (数学)
- Aizu 1315 Gift from the Goddess of Programming 解题报告
- Aizu 1315 Gift from the Goddess of Programming
- lightoj 1095 - Arrange the Numbers 组合数学
- 【概率&数学期望】A Dangerous Maze LightOJ
- 3989. I guess the gift is a calculator! toj
- 3985. I guess the gift is a bag!
- 3990 G. I guess the gift is a bag! II
- Toj 3990. I guess the gift is a bag! II
- Codeforces Round #342 (Div. 2)-A. Guest From the Past(数学)
- LightOJ 1349 - Aladdin and the Optimal Invitation(数学啊)
- 致自己
- 开发工具
- js中call与apply用法
- 深入理解JVM(九)——类加载的过程
- leetcode 93. Restore IP Addresses
- lightoj 1328 - A Gift from the Setter 【数学】
- 欢迎使用CSDN-markdown编辑器
- VS2015/2013兼容老版本程序问题
- 关于C++中的友元函数的总结
- 如何在 visio 中精确地调整图形的角度和大小
- const的用法及使用的优点
- php non-thread-safe和thread-safe这两个版本有何区别
- 那些你经常会用的Jquery语法
- java设计模式的归类