UVA10190 Divide, But Not Quite Conquer!【等差数列】

Your goal in this problem is to divide a certain integer n by another integer m until n = 1, obtaining a sequence of numbers. Lets call a[i] each number of this sequence, and let’s say it has k numbers (i.e. you must do k − 1 succesive divisions to reach n = 1). You can only have this sequence if the following restrictions are met:
• a[1] = n, a[i] = a[i − 1] ÷ m, for all 1 < i ≤ k
• a[i] is divisible by m (that is, a[i] mod m = 0) for all 1 ≤ i < k
• a[1] > a[2] > a[3] > . . . > a[k]
For instance, if n = 125 and m = 5, you have 125, 25, 5 and 1 (you did 3 divisions: 125/5, 25/5 and 5/5). So, k = 4, a[1] = 125, a[2] = 25, a[3] = 5 and a[4] = 1.
If n = 30 and m = 3, you have 30, 10, 3 and 1. But a[2] = 10, and 10 mod 3 = 1, so there is no sequence because it violates restriction 2. When the sequence doesn’t exist we think it’s not fun and, thus, very boring!
Input
The input will consist on an arbitrary number of lines. Each line will consist of two non-negative integers n, m which are both less than 2000000000. You must read until you reach the end of file.
Output
For each pair n, m you must print the correspondent sequence a (as defined above) in a single line, with each adjacent numbers of the sequence separated by a single space. In the case the sequence doesn’t exist because it violates some restriction, just print the phrase ‘Boring!’ in a single line (without the quotes).
Sample Input
125 5
30 3
80 2
81 3
Sample Output
125 25 5 1
Boring!
Boring!
81 27 9 3 1

问题链接：UVA10190 Divide, But Not Quite Conquer!
问题简述：给定数列的首项和公比的倒数，问该数列的尾项是否为1，如果是则输出数列，否则输出“Boring!”
问题分析：数列问题，不解释。
程序说明：（略）
参考链接：（略）
题记：（略）

AC的C++语言程序如下：

/* UVA10190 Divide, But Not Quite Conquer! */#include <bits/stdc++.h>using namespace std;int a[100];int main()
{int n, m;while (~scanf("%d%d", &n, &m)) {if (m < 2 || n < m) {printf("Boring!\n");} else {int cnt = 0;while (n % m == 0 && n >= m)a[cnt++] = n, n /= m;a[cnt] = n;if (a[cnt] != 1 || cnt == 0)printf("Boring!\n");else {for (int i = 0; i < cnt; i++)printf("%d ", a[i]);printf("%d\n", a[cnt]);}}}return 0;
}

TLE的C++语言程序如下：

/* UVA10190 Divide, But Not Quite Conquer! */#include <bits/stdc++.h>using namespace std;int main()
{int n, m;while (~scanf("%d%d", &n, &m)) {int a = 1;while (a < n) a *= m;if (a != n)printf("Boring!\n");else {while (n > 1) {printf("%d ", n);n /= m;}printf("%d\n", n);}}return 0;
}

UVA10190 Divide, But Not Quite Conquer!【等差数列】相关推荐

UVa 10190 - Divide, But Not Quite Conquer!
题目:给你一个等比数列的首项和公比的倒数,如果尾项是1输出这个数列,否则输出Boring!. 分析:数学题.按照题目要求数列是递减的,所以公比的倒数一定要大于1,即m > 1. 然后在附加一个条 ...
python算法书籍-有哪些用 Python 语言讲算法和数据结构的书？
1.Python数据结构篇数据结构篇主要是阅读[Problem Solving with Python](Welcome to Problem Solving with Algorithms and ...
排队论是计算机科学新分支,(计算机科学的分支领域体系.doc
(计算机科学的分支领域体系计算机科学的分支领域体系算法和数据结构程序设计语言体系结构数值和符号计算操作系统软件方法学和工程数据库和信息检索系统人工智能和机器人学人机通信算法和数据 ...
《Design of Computer Programs》学习笔记（2 - 1）Back of the Envelope - Lesson 2
Back of the Envelope envelope n.信封(金山词霸) Lesson 2 视频链接: Lesson 2 - Udacity 1. 练习:Zebra Puzzle zebra ...
商业智能软件在汽车销售中的应用分析
一 . 引言在激烈的市场竞争环境中,一个企业如果要生存和发展,就必需了解市场.了解客户树立 "以市场为导向,以客户为中心"的经营理念.汽车销售企业作为服务业尤其如此面对瞬息万变的 ...
python基本原理概论_怎样开始自学Python？
本人才疏学浅,学识大多浅尝辄止,故文章若有错误,不论是文字笔误还是理解有错,烦请您留言以告知,本人必定感激不尽! **Python分类下的系列文章,不断更新中,如果你迫不及待地想要看看写得如何可以先试 ...
分治法分治法求解递推式
分治法分治法基本就是下面的三步分(divide):无法有效解决的划分更小的问题治(conquer):递归求每一个子问题的解合(combine):合并解得出原问题解 MergeSort:排列 1 ...
Lecture 3 Divide and Conquer
1.Divide the problem(instance) into one or more sub-problem; 2.Conquer each sub-problem recursively; ...
分治法 divide and conquer
分治算法包含以下步骤: 1.分(divide):将一个大问题分解成若干个子问题,每个子问题的问题规模n更小了,这样就有了好几个待解决的子问题. 2.治(conquer):递归的去解决每个子问题. 3. ...

UVA10190 Divide, But Not Quite Conquer!【等差数列】

UVA10190 Divide, But Not Quite Conquer!【等差数列】相关推荐

最新文章

热门文章