LightOJ-1314 Aladdin and the Flying Carpet
来源:互联网 发布:ping ip加端口怎么写 编辑:程序博客网 时间:2024/05/22 13:17
Aladdin and the Flying Carpet
LightOJ - 1341It'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 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) wherea denotes the area of the carpet and b denotes the minimum possible side of the carpet.
For each case, print the case number and the number of possible carpets.
2
10 2
12 2
Case 1: 1
Case 2: 2
#include <cstdio>#include <iostream>#include <cstring>using namespace std;typedef long long ll;const int maxn = 1e6 + 7;ll p[maxn],prime[maxn];int get_prime() { int k = 0; for(ll i = 2; i <= maxn; i++) { if(!p[i]) { prime[k++] = i; for(ll j = i+i; j <= maxn; j += i) { p[j] = 1; } } } return k;}ll get_cnt(ll t,int cnt){ ll sum = 1; for(int i = 0; i < cnt && prime[i]*prime[i] <= t; i++) { if(t % prime[i] == 0) { int ans = 0; while(t % prime[i] == 0) { ans++; t /= prime[i]; } sum *= (1+ans); } } if(t > 1) sum *= 2; return sum;}int main() { int cas = 0; int t; cin >> t; int cnt = 0; cnt = get_prime(); while(t--) { int a,b; cin >> a >> b; int num = get_cnt(a,cnt); ///printf("num:%d\n",num); int s = 0; for(int i = 1;i < b;i++) { if(a % i == 0) { s++; } } ///printf("s:%d",s); ///printf("%d\n",num); int res = num/2 - s; printf("Case %d:%d\n",++cas,res); } return 0;}
- LightOJ-1314 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
- Aladdin and the Flying Carpet LightOJ
- Aladdin and the Flying Carpet LightOJ
- LightOJ 1341 Aladdin and the Flying Carpet
- Aladdin and the Flying Carpet LightOJ
- Aladdin and the Flying Carpet LightOJ
- Aladdin and the Flying Carpet LightOJ
- 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 1341 Aladdin and the Flying Carpet(算术基本定理)
- LightOJ 1341 Aladdin and the Flying Carpet【整数分解】
- 基于邻接矩阵的广度优先遍历
- 创建线程的两种传统方式
- 最小生成树MST(Prim/Kruskal模版)
- Makefile工程管理语法与使用技巧
- java正则表达式
- LightOJ-1314 Aladdin and the Flying Carpet
- pipe函数内核实现
- 表格冻结首列及左起指定列数(CongelarFilaColumna插件的使用)
- 一. 流式处理简介
- b reset 和 ldr pc ,reset 的区别?
- spring-boot-mybatis-cache-thymeleaf学习
- Week03_day05 集合(下)
- Ubuntu系统环境变量详解
- mysql5.7官网直译数据结构优化--数据大小优化