17 多校 3
来源:互联网 发布:北京数据库管理员工资 编辑:程序博客网 时间:2024/05/26 22:08
RXD and math
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 524288/524288 K (Java/Others)Total Submission(s): 984 Accepted Submission(s): 540
Problem Description
RXD is a good mathematician.
One day he wants to calculate:
∑i=1nkμ2(i)×⌊nki‾‾‾√⌋
output the answer module109+7 .
1≤n,k≤1018
μ(n)=1(n=1)
μ(n)=(−1)k(n=p1p2…pk)
μ(n)=0(otherwise)
p1,p2,p3…pk are different prime numbers
One day he wants to calculate:
output the answer module
Input
There are several test cases, please keep reading until EOF.
There are exact 10000 cases.
For each test case, there are 2 numbersn,k .
There are exact 10000 cases.
For each test case, there are 2 numbers
Output
For each test case, output "Case #x: y", which means the test case number and the answer.
Sample Input
10 10
Sample Output
Case #1: 999999937
可以打表发现公式可转换为 n^k
#include<iostream>#include<string.h>#include<stdio.h>using namespace std;#define ll long longll n,k,mod = 1e9 + 7;ll qkm(ll n,ll m){ ll base = n; n = 1; while(m) { if(m%2) n = (n * base) % mod; base = (base * base) % mod; m/=2; } return n;}int main(){ int cas = 0; while(scanf("%lld%lld",&n,&k)!=EOF) printf("Case #%d: %lld\n",++cas,qkm(n%mod,k)); return 0;}
阅读全文
0 0
- 17 多校 3
- 17 多校 3
- 17 多校 3
- 17 多校 3
- 17 多校
- 17 多校
- 17 多校
- 17 多校
- 17 多校
- 17 多校
- 17 多校
- 多校3
- 17多校contest 1
- 17 多校 4
- 17 多校 4
- 2014.7.29 - 多校3
- 多校3-Magician
- 多校3- RGCDQ
- Linux网络编程之网络编程基础客户端
- Excel的创建与解析
- 透明度对应数值
- CCF201403-1 相反数(尝试)
- 把照片拷贝到同一父文件夹下
- 17 多校 3
- Pandas中iloc和loc以及ix的区别
- 分别使用文件流和缓冲流复制一个长度大于100MB的视频文件,并观察效率的差异
- Vue起个步最烦人的路由
- 内存泄露调试——valgrind
- JDK源码分析之PriorityQueue类
- Gabor滤波器学习
- 集训第四天(2017/8/3):继续刷hdu搜索题和第二次练习赛
- Nginx之lua插件开发