codeforces236B Easy Number Challenge
来源:互联网 发布:sql怎么统计班级人数 编辑:程序博客网 时间:2024/06/05 23:44
B. Easy Number Challenge
time limit per test
2 secondsmemory limit per test
256 megabytesinput
standard inputoutput
standard outputLet's denote d(n) as the number of divisors of a positive integer n. You are given three integers a, b and c. Your task is to calculate the following sum:
Find the sum modulo 1073741824 (230).
Input
The first line contains three space-separated integers a, b and c (1 ≤ a, b, c ≤ 100).
Output
Print a single integer — the required sum modulo 1073741824 (230).
Sample test(s)
input
2 2 2
output
20
input
5 6 7
output
1520
Note
For the first example.
- d(1·1·1) = d(1) = 1;
- d(1·1·2) = d(2) = 2;
- d(1·2·1) = d(2) = 2;
- d(1·2·2) = d(4) = 3;
- d(2·1·1) = d(2) = 2;
- d(2·1·2) = d(4) = 3;
- d(2·2·1) = d(4) = 3;
- d(2·2·2) = d(8) = 4.
So the result is 1 + 2 + 2 + 3 + 2 + 3 + 3 + 4 = 20.
分析:求一个数的约数有几个
#include<cstdio>#include<cstring>const int N=1000001;const int M=1<<30;int d[N],p[N];bool f[N];void get_prime(int n){int i,j,cnt=0;f[0]=f[1]=1;for(i=2;i<n;i++){if(!f[i])p[cnt++]=i;for(j=0;j<cnt&&p[j]*i<N;j++){f[i*p[j]]=1;if(i%p[j]==0)break;}}}void get_prime1(int n){int i,j,cnt=0;f[0]=f[1]=1;for(i=2;i*i<n;i++){if(f[i])continue;for(j=i;j*j<n;j++)f[i*j]=1;}for(i=2;i<N;i++)if(!f[i])p[cnt++]=i;}int count(int n){if(d[n])return d[n];int i=0,a=n,cnt;d[n]=1;while(a!=1){cnt=0;while(a%p[i]==0){cnt++;a/=p[i];}if(cnt)d[n]*=(1+cnt);i++;}return d[n];}int main(){int a,b,c,i,j,k,ans;get_prime(N);while(~scanf("%d%d%d",&a,&b,&c)){ans=0;for(i=1;i<=a;i++)for(j=1;j<=b;j++)for(k=1;k<=c;k++){ans+=count(i*j*k);if(ans>=M)ans-=M;}printf("%d\n",ans);}return 0;}
方法二:
#include<cstdio>#include<cstring>const int N=1000001;const int M=1<<30;int d[N];int main(){int a,b,c,i,j,k,ans,J;while(~scanf("%d%d%d",&a,&b,&c)){ans=0;J=a*b*c;memset(d,0,sizeof(d));for(i=1;i<=J;i++)for(j=1;i*j<=J;j++)d[i*j]++;for(i=1;i<=a;i++)for(j=1;j<=b;j++)for(k=1;k<=c;k++){ans+=d[i*j*k];if(ans>=M)ans-=M;}printf("%d\n",ans);}return 0;}
- codeforces236B Easy Number Challenge
- B. Easy Number Challenge
- B. Easy Number Challenge
- Easy Number Challenge(求因子个数)
- codeforces 236 B. Easy Number Challenge
- CodeForces 236 B. Easy Number Challenge
- Codeforces Round #146 (Div. 2) B. Easy Number Challenge
- codeforces Round #146(div2) B.Easy Number Challenge
- CF236 B. Easy Number Challenge【求约数个数】
- CodeForces - 236B Easy Number Challenge (暴力)
- Codeforces 236B Easy Number Challenge 【因子和】
- CodeForces 236B - Easy Number Challenge(数论:求因子个数)
- CodeForce 236B Easy Number Challenge(筛法求素数 + 整数因式分解)
- [CF235E]Number Challenge
- 『NYIST』第八届河南省ACM竞赛训练赛[正式赛一]CF-236B. Easy Number Challenge
- 【CF 235E】Number Challenge
- leetcode_263_Ugly Number(C++)(easy)
- 136. Single Number (Easy)
- 摄像头拍照
- GPIO的推挽输出和开漏输出
- sort排序
- openscale函数解析
- 游戏后台的快速开发
- codeforces236B Easy Number Challenge
- GPIO相关
- 解决Outlook打不开邮件里的链接的方法
- TRS WCM SQL injection
- Java加密技术——非对称加密算法RSA
- sun cluster
- ZOJ 2136 Longest Ordered Subsequence(LIS)
- 有关Expander组件的研究
- 再读算法导论关于归并排序