lightOj 1341Aladdin and the Flying Carpet 算数基本定理
2017-04-26 19:58
417 查看
1341 - Aladdin and the Flying Carpet
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}.
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.
利用算数基本定理, n = p1^a1 * p2^a2*…*pm^am;
和他的一个性质
则 n 的正因数的个数可以表示为: num = (a1+1)*(a2+1)…(am+1);
进行求解
PDF (English) | Statistics | Forum |
Time Limit: 3 second(s) | Memory Limit: 32 MB |
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 | Output for Sample Input |
2 10 2 12 2 | Case 1: 1 Case 2: 2 |
利用算数基本定理, n = p1^a1 * p2^a2*…*pm^am;
和他的一个性质
则 n 的正因数的个数可以表示为: num = (a1+1)*(a2+1)…(am+1);
进行求解
#include <map> #include <set> #include <cstdio> #include <cstring> #include <algorithm> #include <queue> #include <iostream> #include <stack> #include <cmath> #include <string> #include <vector> #include <cstdlib> //#include <bits/stdc++.h> //#define LOACL #define space " " #define lson o<<1, l, mid #define rson o<<1|1, mid+1, r #define ll o<<1 #define rr o<<1|1 using namespace std; typedef long long LL; //typedef __int64 Int; typedef pair<int, int> PAI; const int INF = 0x3f3f3f3f; const double ESP = 1e-5; const double PI = acos(-1.0); const int MOD = 1e9 + 7; const int MAXN = 1e6 + 10; const int MAX = 3000; int prime[MAXN]; bool is_prime[MAXN]; int init() { int p = 0; for (int i = 0; i < MAXN; i++) is_prime[i] = true; is_prime[0] = is_prime[1] = false; for (int i = 2; i < MAXN; i++) { if (is_prime[i]) { prime[p++] = i; for (int j = 2*i; j < MAXN; j += i) is_prime[j] = false; } } } LL get_factor(LL x, LL y) { LL res = 1; LL tmp = x; if (x/y < y) return 0; for (int i = 0; prime[i] <= tmp/prime[i]; i++) { int c = 0; while (tmp%prime[i] == 0) { c++; tmp /= prime[i]; } res *= (c + 1); } if (tmp > 1) res <<= 1; res >>= 1; for (int i = 1; i < y; i++) { if (x%i == 0) res--; } return res; } int main(int argc, char const *argv[]) { int T; LL N, M; init(); int kcase = 0; scanf("%d", &T); while (T--) { //for (int i = 0; i < N; i++) pri scanf("%lld%lld", &N, &M); printf("Case %d: %lld\n", ++kcase, get_factor(N, M)); } return 0; }
相关文章推荐
- lightoj 1220 - Mysterious Bacteria(算数基本定理)
- 【LightOJ - 121】Finding LC M【算数基本定理】
- 【LightOJ - 1116】Ekka Dokka 【算数基本定理】
- LightOJ1028 1090 1138 Trailing Zeroes (I)(Ⅱ)(Ⅲ)[算数基本定理/打表/打表+二分]
- lightoj 1336 - Sigma Function(算数基本定理)
- 【LightOJ - 1278】 Sum of Consecutive Integers 【简单公式变形-算数基本定理】
- LightOJ1035 Intelligent Factorial Factorization(算数基本定理)
- 【算数基本定理(唯一分解定理)】Aladdin and the Flying Carpet LightOJ - 1341
- LightOj1341_Aladdin and the Flying Carpet_算数基本定理
- 【HDU - 5505】GT and numbers 【gcd + 算数基本定理】
- LightOJ 1341 Aladdin and the Flying Carpet(算术基本定理)
- LightOJ 1236 Pairs Forming LCM (算术基本定理)
- Lightoj1341——Aladdin and the Flying Carpet(算术基本定理)
- LightOJ 1341 - Aladdin and the Flying Carpet(算术基本定理啊)
- 数论 - 算数基本定理的运用 --- nefu 118 : n!后面有多少个0
- 数论概论笔记 第7章 因数分解与算数基本定理
- lightoj 1341 - Aladdin and the Flying Carpet / lightoj 1236 - Pairs Forming LCM(算术基本定理)
- HDU1215_七夕节_算数基本定理
- Happy 2004(基本算数定理)
- LightOJ 1341 Aladdin and the Flying Carpet(算术基本定理)