2017 Multi-University Training Contest
来源:互联网 发布:泪目什么意思网络词 编辑:程序博客网 时间:2024/05/16 06:12
http://acm.hdu.edu.cn/showproblem.php?pid=6069
题意:
按题目描述需要求
思路:
设
枚举不超过
时间复杂度
代码:
#include<bits/stdc++.h>using namespace std;#define ll long longconst ll N = 1000010;const ll MOD = 998244353;ll T,i,j,k,p[N / 10],tot,g[N],ans;ll n,lt,rt,f[N];bool v[N];void work(ll p){ for(ll i = lt / p * p;i <= rt;i += p){ if(i >= lt){ ll temp = 0; while(f[i - lt] % p == 0){ f[i - lt] /= p; temp++; } g[i - lt] = 1LL * g[i - lt] * (temp * k + 1) % MOD; } }}int main(){ for(i = 2;i < N;i++){ if(!v[i]){ p[tot++] = i; } for(j = 0; j < tot && i * p[j] < N;j++){ v[i * p[j]] = 1; if(i % p[j] == 0){ break; } } } scanf("%lld",&T); while(T--){ scanf("%lld %lld %lld",<,&rt,&k); for(i = 0;i <= rt - lt;i++){ f[i] = i + lt; g[i] = 1; } for(i = 0;i < tot;i++){ if(1LL * p[i] * p[i] > rt){ break; } work(p[i]); } ll ans = 0; for(i = 0;i <= rt - lt;i++){ if(f[i] > 1){ g[i] = 1LL * g[i] * (k + 1) % MOD; } ans = (ans + g[i]) % MOD; } printf("%lld\n",ans); } return 0;}
阅读全文
0 0
- 2017 Multi-University Training Contest
- 2017 Multi-University Training Contest
- 2017 Multi-University Training Contest
- 2017 Multi-University Training Contest
- 2017 Multi-University Training Contest
- 2017 Multi-University Training Contest
- 2017 Multi-University Training Contest
- 2017 Multi-University Training Contest
- 2017 Multi-University Training Contest
- 2017 Multi-University Training Contest
- 2017 Multi-University Training Contest
- 2017 Multi-University Training Contest
- #2017 Multi-University Training Contest
- 2017 Multi-University Training Contest
- #2017 Multi-University Training Contest
- 2017 Multi-University Training Contest
- 2017 Multi-University Training Contest
- 2017 Multi-University Training Contest
- jzoj3777. 【NOI2015模拟8.17】最短路(shortest)
- Android 中动态设置控件高宽
- MySQL数据库概述和常用管理命令
- Elevator
- 蓝创大庆十周年,三重大礼享不停
- 2017 Multi-University Training Contest
- 数据库设计四范式
- 史上最简单的 MySQL 教程(二十)「数据的高级操作 之 主键冲突」
- UML中关系在代码中的体现
- Java的封装
- 【实战】电脑 开发板 虚拟机三者互ping通教程
- H2:构建单元测试的本地内存数据库
- leetcode hard模式专杀之135. Candy
- 史上最简单的 MySQL 教程(二十一)「数据的高级操作 之 蠕虫复制」