Aladdin and the Flying Carpet [整数分解]
来源:互联网 发布:java map遍历 编辑:程序博客网 时间:2024/06/04 18:21
It’s said that Aladdin had to solve seven mysteries before getting the Magical Lamp which summons a powerful Genie. Here we are concerned about the first mystery.
Aladdin was about to enter to a magical cave, led by the evil sorcerer who disguised himself as Aladdin’s uncle, found a strange magical flying carpet at the entrance. There were some strange creatures guarding the entrance of the cave. Aladdin could run, but he knew that there was a high chance of getting caught. So, he decided to use the magical flying carpet. The carpet was rectangular shaped, but not square shaped. Aladdin took the carpet and with the help of it he passed the entrance.
Now you are given the area of the carpet and the length of the minimum possible side of the carpet, your task is to find how many types of carpets are possible. For example, the area of the carpet 12, and the minimum possible side of the carpet is 2, then there can be two types of carpets and their sides are: {2, 6} and {3, 4}.
Input
Input starts with an integer T (≤ 4000), denoting the number of test cases.
Each case starts with a line containing two integers: a b (1 ≤ b ≤ a ≤ 1012) where a denotes the area of the carpet and b denotes the minimum possible side of the carpet.
Output
For each case, print the case number and the number of possible carpets.
Sample Input
2
10 2
12 2
Sample Output
Case 1: 1
Case 2: 2
解题报告
那么,约数个数
这个题在卡质因数分解,得先打个质数表以减少分解时的冗余操作
代码
超时代码
#include<stdio.h>#include<string.h>#include<algorithm>#define LL __int64LL p[64],s,k;int N,ans;void dfs(LL a,LL b,int cnt){ if(a>=k) ans++; for(int i=cnt;i<N;i++){ if(b%p[i]==0){ LL tmp=a*p[i],tmpb=b/p[i]; if(tmpb>=k&&tmp<tmpb){ dfs(tmp,tmpb,i); } } }}void solve(LL n){ ans=N=0; for(LL i=2;i*i<n;i++) if(n%i==0){ p[N++]=i; while(n%i==0) n/=i; } if(n>1) p[N++]=n; dfs(1,s,0);}int main(){ int T; scanf("%d",&T); for(int t=1;t<=T;t++){ scanf("%lld%lld",&s,&k); solve(s); printf("Case %d: %d\n",t,ans); } return 0;}
方法一,对上面代码优化后
#include<stdio.h>#include<string.h>#include<math.h>#include<algorithm>#define MAX_N 1000100#define LL __int64#define p_i prime[i]LL p[64],s,k;int N,ans;bool vis[MAX_N];int prime[MAX_N],pN;void init(){ pN=0; for(int i=2;i<MAX_N;i++) if(!vis[i]){ prime[pN++]=i; for(LL k=(LL)i*i;k<MAX_N;k+=i) vis[k]=true; }}void dfs(LL A,LL B,int cnt){ if(A>=k) ans++; for(int i=cnt;i<N;i++){ if(B%p[i]==0){ LL a=A*p[i],b=B/p[i]; if(b>=k&&a<b){ dfs(a,b,i); } } }}void solve(LL n){ ans=N=0; for(int i=0;(LL)p_i*p_i<=n;i++) if(n%p_i==0){ p[N++]=p_i; while(n%p_i==0) n/=p_i; } if(n>1) p[N++]=n; dfs(1,s,0);}int main(){// FILE *fp;// fp=fopen("out.txt","wt+"); int T;init(); scanf("%d",&T); for(int t=1;t<=T;t++){ scanf("%lld%lld",&s,&k); if(s==1&&k==1) ans=0; //特殊情况 else solve(s); printf("Case %d: %d\n",t,ans);// fprintf(fp,"Case %d: %d\n",t,ans); } return 0;}
方法二,使用上面提到的那个公式
#include<stdio.h>#include<string.h>#include<math.h>#include<algorithm>#define MAX_N 1000100#define LL __int64#define p_i prime[i]LL p[64],s,k;int N,ans;bool vis[MAX_N];int prime[MAX_N],pN;void init(){ pN=0; for(int i=2;i<MAX_N;i++) if(!vis[i]){ prime[pN++]=i; for(LL k=(LL)i*i;k<MAX_N;k+=i) vis[k]=true; }}void dfs(LL A,LL B,int cnt){ ans--; for(int i=cnt;i<N;i++){ if(B%p[i]==0){ LL a=A*p[i],b=B/p[i]; if(a<b&&a<k){ dfs(a,b,i); } } }}void solve(LL n){ ans=1;N=0; for(int i=0;(long long)p_i*p_i<=n;i++) if(n%p_i==0){ p[N++]=p_i; int tmp=1; while(n%p_i==0) n/=p_i,tmp++; ans*=tmp; } if(n>1) p[N++]=n,ans*=2;// LL tmp=sqrt(s);// if(tmp*tmp==s) ans++; ans/=2; dfs(1,s,0); if(k==1) ans++;}int main(){ int T;init(); scanf("%d",&T); for(int t=1;t<=T;t++){ scanf("%lld%lld",&s,&k); solve(s); printf("Case %d: %d\n",t,ans); } return 0;}
- Aladdin and the Flying Carpet [整数分解]
- LightOJ 1341 Aladdin and the Flying Carpet【整数分解】
- Light OJ 1341 Aladdin and the Flying Carpet Pollard_rho整数分解+DFS
- [整数分解+dfs] light oj 1341 Aladdin and the Flying Carpet
- Aladdin and the Flying Carpet
- Aladdin and the Flying Carpet
- Aladdin and the Flying Carpet
- LightOJ 1341 - Aladdin and the Flying Carpet【合数分解】
- lightoj 1341 Aladdin and the Flying Carpet (唯一分解定理)
- lightOJ1341 Aladdin and the Flying Carpet(唯一分解)
- Aladdin and the Flying Carpet 唯一分解定理
- Aladdin and the Flying Carpet 唯一分解定理
- lightOJ 1341 Aladdin and the Flying Carpet
- LightOJ 1341 Aladdin and the Flying Carpet
- LightOJ 1341Aladdin and the Flying Carpet
- LightOJ 1341 - Aladdin and the Flying Carpet
- LightOJ1341 Aladdin and the Flying Carpet
- Aladdin and the Flying Carpet LightOJ
- ios 设置两个方向圆角
- BZOJ 2738: 矩阵乘法
- 【面试题】实现一个栈要求Push,Pop,Min(返回栈中最小值的操作)的时间复杂度为O(1)
- 软件开发中最顶级的 17 个平台和工具
- leetcode第三题: 输出不包含重复字母的最长子串
- Aladdin and the Flying Carpet [整数分解]
- camera视频学习笔记(1)
- 单独编译安装PDO_MySQL
- Oracle 11g R2 RSF(Recurive Subquery factoring)
- 用两个栈实现队列
- 链表
- 北京理工大学2002年机试(A)
- angular2中自定义window对象
- 图结构练习——BFSDFS——判断可达性