【BZOJ1257】[CQOI2007]余数之和sum【余数求和】【分块】
2016-02-22 13:25
323 查看
详见
http://blog.csdn.net/braketbn/article/details/50715971
#include <cstdio>
typedef unsigned long long ULL;
ULL n, k;
int main() {
scanf("%llu%llu", &n, &k);
ULL ans = 0;
for(ULL i = 1, l, r; i <= n; i = r + 1) {
ULL d = k / i;
l = k / (d + 1) + 1;
r = d ? k / d : n;
r = r > n ? n : r;
ans += (k - d * l + k - d * r) * (r - l + 1) / 2;
}
printf("%llu\n", ans);
}
http://blog.csdn.net/braketbn/article/details/50715971
#include <cstdio>
typedef unsigned long long ULL;
ULL n, k;
int main() {
scanf("%llu%llu", &n, &k);
ULL ans = 0;
for(ULL i = 1, l, r; i <= n; i = r + 1) {
ULL d = k / i;
l = k / (d + 1) + 1;
r = d ? k / d : n;
r = r > n ? n : r;
ans += (k - d * l + k - d * r) * (r - l + 1) / 2;
}
printf("%llu\n", ans);
}
相关文章推荐
- [BZOJ2038][2009国家集训队][莫队][分块]小z的袜子
- Codeforces538F A Heap of Heaps【分块+差分求前缀和】
- 大矩阵的分块乘法及matlab实现
- bzoj-2741 L
- bzoj-3585 mex
- bzoj-2051 A Problem For Fun
- 算法马拉松8(差和问题)
- 1290 Counting Diff Pairs
- 【Violet 6】【BZOJ2724】蒲公英
- 【BZOJ4320】Homework
- 【BZOJ4216】Pig
- [2009国家集训队]小Z的袜子(hose) 分块做法
- NBUT 1457 分块
- codeforces #307 E. GukiZ and GukiZiana (分块)
- Codeforces Round #307 (Div. 2)E. GukiZ and GukiZiana(分块)
- 【分块】 CF 551 E GukiZ and GukiZiana
- Codeforces Round #307 (Div. 2) E. GukiZ and GukiZiana (分块)
- Codeforces Gym 100589A Queries on the Tree(树状数组+分块)
- HDU 4467 Graph(分块)
- GFS中的数据完整性校验