HDU 4059 The Boss on Mars(容斥原理)
2016-05-04 15:15
399 查看
The Boss on Mars
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2494 Accepted Submission(s): 775
Problem Description
On Mars, there is a huge company called ACM (A huge Company on Mars), and it’s owned by a younger boss.
Due to no moons around Mars, the employees can only get the salaries per-year. There are n employees in ACM, and it’s time for them to get salaries from their boss. All employees are numbered from 1 to n. With the unknown reasons, if the employee’s work number
is k, he can get k^4 Mars dollars this year. So the employees working for the ACM are very rich.
Because the number of employees is so large that the boss of ACM must distribute too much money, he wants to fire the people whose work number is co-prime with n next year. Now the boss wants to know how much he will save after the dismissal.
Input
The first line contains an integer T indicating the number of test cases. (1 ≤ T ≤ 1000) Each test case, there is only one integer n, indicating the number of employees in ACM. (1 ≤ n ≤ 10^8)
Output
For each test case, output an integer indicating the money the boss can save. Because the answer is so large, please module the answer with 1,000,000,007.
Sample Input
2 4 5
Sample Output
82 354 这道题目是求小于n和n互质的数的四次方的和 利用容斥原理,可以用总和减去不和n互质的和也可以直接求互质的数的和这里还涉及到了sum{1^4,2^4,3^4....n^4}求和公式n*(n+1)*(2*n+1)*((3*n*n+3*n-1)/30[code]求和公式里有/ 那么在用同余定理的时候就要用逆元
b/c(mod m)=b(mod m)* c^(m-2)(mod m)
证明略
#include <iostream> #include <string.h> #include <algorithm> #include <math.h> #include <stdio.h> #include <stdlib.h> using namespace std; typedef long long int LL; #define MAX 1000000 LL prime[MAX+5]; LL sprime[MAX+5]; bool check[MAX+5]; const LL mod=1e9+7; LL INF; LL cnt; LL quick(LL x,LL a) { LL sum=1; for(x;x>0;x>>=1) { if(x&1) sum=(sum*a)%mod; a=(a*a)%mod; } return sum; } LL sum1(LL n) { INF=quick(mod-2,30); return n*(n+1)%mod*(2*n+1)%mod*((3*n*n%mod+3*n-1)%mod)%mod*INF%mod; } LL sum2(LL n) { return (((n*n)%mod*n)%mod*n)%mod; } void eular() { memset(check,false,sizeof(check)); int tot=0; for(LL i=2;i<MAX+5;i++) { if(!check[i]) prime[tot++]=i; for(int j=0;j<tot;j++) { if(i*prime[j]>MAX+5) break; check[i*prime[j]]=true; if(i%prime[j]==0) break; } } } void Divide(LL n) { cnt=0; LL t=(LL)sqrt(n*1.0); for(LL i=0;prime[i]<=t;i++) { if(n%prime[i]==0) { sprime[cnt++]=prime[i]; while(n%prime[i]==0) n/=prime[i]; } } if(n>1) sprime[cnt++]=n; } int main() { eular(); int t; scanf("%d",&t); while(t--) { LL n; scanf("%lld",&n); Divide(n); LL ans=0; LL res=sum1(n); for(int i=1;i<((LL)(1<<(cnt)));i++) { int num=0; LL tmp=1; for(int j=0;j<cnt;j++) { if(i&(1<<j)) { num++; tmp*=sprime[j]; } } if(num&1) ans=(ans+(sum1(n/tmp)*sum2(tmp))%mod)%mod; else ans=((ans-(sum1(n/tmp)*sum2(tmp))%mod)%mod+mod)%mod; } printf("%lld\n",(res-ans+mod)%mod); } return 0; }
[/code]
[/code]
相关文章推荐
- 最新版CentOS6.5上安装部署ASP.NET MVC4和WebApi
- [翻译]在gulp构建工具中使用PostCSS
- XMLPuLL解析
- Java资源大全中文版
- 第三届山东省ACM The Best Seat in ACM Contest
- javaweb学习总结(十六)——JSP指令
- iOS热更新,JSPatch初探
- 学习周计划
- Struts2注解配置之@Action(二)
- 构造AJAX参数, 表单元素JSON相互转换
- 笔试题46. LeetCode OJ (33)
- HttpEntity转换Inputstream(红色)加XmlPull解析
- html与Android——webView
- 数据库根据当前时间分区
- 获取Skype用户IP地址
- 第三届山东ACM省赛 Pixel density
- javaweb学习总结(十五)——JSP基础语法
- 深入剖析HTML5 内联框架iFrame
- 如何快速清理Mac系统上的大额文件
- 分析不同类型页面渲染过程