Mathematically Hard LightOJ
来源:互联网 发布:vb数据库教程 编辑:程序博客网 时间:2024/05/16 08:39
Mathematically some problems look hard. But with the help of the computer, some problems can be easily solvable.
In this problem, you will be given two integers a and b. You have to find the summation of the scores of the numbers from a to b (inclusive). The score of a number is defined as the following function.
score (x) = n2, where n is the number of relatively prime numbers with x, which are smaller than x
For example,
For 6, the relatively prime numbers with 6 are 1 and 5. So, score (6) = 22 = 4.
For 8, the relatively prime numbers with 8 are 1, 3, 5 and 7. So, score (8) = 42 = 16.
Now you have to solve this task.
Input
Input starts with an integer T (≤ 105), denoting the number of test cases.
Each case will contain two integers a and b (2 ≤ a ≤ b ≤ 5 * 106).
Output
For each case, print the case number and the summation of all the scores from a to b.
Sample Input
3
6 6
8 8
2 20
Sample Output
Case 1: 4
Case 2: 16
Case 3: 1237
大致题意:就是让你求区间[a,b]内的各个数的欧拉值平方的和
思路:先用欧拉筛打个表,然后用前缀和预处理下,注意最后结果会爆longlong,得用unsign long long,然后内存也得注意下,写搓了很容易爆。
代码如下
#include<bits/stdc++.h>using namespace std;#define LL long long #define ULL unsigned long long const int M=5000010;ULL p[M];//先用于欧拉筛里存素数,然后再用来保存前缀和,如果再开一个数组的话会爆内存int phi[M];bool vis[M];int p_num=0;void get_phi(){ for(int i=2;i<=M;i++) { if(!vis[i]) { p[p_num++]=i; phi[i]=i-1; } for(int j=0;j<p_num&&p[j]*i<=M;j++) { vis[p[j]*i]=1; if(i%p[j]==0) { phi[i*p[j]]=phi[i]*p[j]; break; } else phi[i*p[j]]=phi[i]*(p[j]-1); } }}int main(){ get_phi(); phi[1]=1; p[0]=0; for(int i=1;i<=M;i++) { p[i]=(ULL)phi[i]*phi[i]+p[i-1];//注意phi[i]*phi[i]会爆int } int T,a,b; scanf("%d",&T); for(int cas=1;cas<=T;cas++) { scanf("%d%d",&a,&b); printf("Case %d: %llu\n",cas,p[b]-p[a-1]); }}
- LightOJ 1007 Mathematically Hard
- LightOJ 1007 Mathematically Hard
- Mathematically Hard LightOJ
- lightoj 1007 - Mathematically Hard 欧拉函数
- lightoj 1007 - Mathematically Hard 欧拉函数
- LightOJ 1007 Mathematically Hard 欧拉函数
- LightOJ-1007-Mathematically Hard [欧拉函数]
- LIGHTOJ 1007 – MATHEMATICALLY HARD【欧拉函数】
- LightOJ 1007 - Mathematically Hard (欧拉筛+预处理前缀和)
- lightoj 1007Mathematically Hard (欧拉函数水题)
- LightOJ1007 - Mathematically Hard
- LightOJ1007 Mathematically Hard
- Light OJ 1007 - Mathematically Hard
- Light oj 1007 - Mathematically Hard
- Mathematically Hard (欧拉定理)
- LightOJ1007---Mathematically Hard (欧拉函数)
- LightOJ1007-Mathematically Hard-maths,前缀和
- light oj 1007 Mathematically Hard (欧拉函数)
- Mac 配置Apache和php环境以及自定义目录配置
- 苹果拒缴130亿欧元税款,称欧盟裁决不公
- 降低能耗,节约成本,微软在IEEE Spectrum发文描述深海数据中心(多图)
- 爱奇艺完成15亿美元可转债认购 不涉董事与股权结构
- 华为荣耀发布旗舰新品V9,500天不卡顿是怎么做到的?
- Mathematically Hard LightOJ
- 360发布年度主力机N5,主打黑科技,售价1399元起
- 蚂蚁金服2亿美元注资韩国Kakao Pay,去韩国刷支付宝将更方便
- 微博发布第四季度及全年财报 短视频与直播强力拉动
- 美图上市后首款“黑科技”手机T8发布,意欲进军国际市场
- 字符串翻转
- 智城网络LPWAN产品发布会在天津召开
- python处理百度统计csv数据
- Codeforces Round #443(div 2)