UVA1258 LA4721 Nowhere Money【数学计算】

In Nowhere town, people use “coin and slot” as their money. There are 2 types of coins called size1 and size2. Size2 coin is twice the thickness of size1. People stack their coins in slots and use them as money. There are many size of slots. The slot of size n is able to stack up n size1 coins. Only filled- up slot is considered as legal money. The value of each filled- up slot is the distinct ways its can stack coins inside. For example, for size- 1 slot, there is only one way to stack a single size1 coin inside. For size- 2 slot, there are 2 ways to stack two size1 coins or one size2 coin inside. And for size- 5 slot, there are 8 ways to stack coins inside, which can be illustrated as follow: 1 1 1 1 1, 1 1 1 2, 1 1 2 1, 1 2 1 1, 2 1 1 1, 1 2 2, 2 1 2, 2 2 1. So the value of filled up slot with size- 1, size- 2 and size- 5 are 1, 2 and 8 (monetary) units respectively (regardless of the type of coins or the ways they are stacked).
Mr. Thinktwice is an owner of a grocery store in this town. He noticed that customers are likely to go to the shop that can return the (money) change in the form that suits their customer. And from his little survey, he found that most customers would like to get their amount of change in the form according to these 2 simple constraints.

The number of slots is minimum.
The size of each slot must be different from each other by at least 2. —This means that customers does not want any slots with the same size and it will be easier for them to distinguish these differences if the sizes are not too close.
    So Mr. Thinktwice ask you to write a program that can give him a series of slot sizes for a
given amount of change according to the previous constraints. Moreover, the series must be sorted in
descending order. For more specific, any amount of change can be written in this formula.
X=∑i=1nT(si)=T(s1)+⋅⋅⋅+T(si)+⋅⋅⋅+T(sn),s1≫s2≫⋅⋅⋅≫si≫⋅⋅⋅≫sn>0X = \sum_{i=1}^nT(s_i)\\ = T(s1) + · · · + T(si) + · · · + T(sn), s1 ≫ s2 ≫ · · · ≫ si ≫ · · · ≫ sn > 0X=∑i=1nT(si)=T(s1)+⋅⋅⋅+T(si)+⋅⋅⋅+T(sn),s1≫s2≫⋅⋅⋅≫si≫⋅⋅⋅≫sn>0
where
    X is an amount of change.
    n is the total number of slot.
    sⁱ is the size of i-th slot.
    T is a function mapping from a slot size to a number of distinct ways of stacking coins. and when j ≫ k ≡ j ≥ k + 2
    For example :

                 10 = T(5) + T(2)= 8 + 2
1, 000, 000 = T(29) + T(25) + T(23) + T(11) + T(9)= 832, 040 + 121, 393 + 46, 368 + 144 + 55

Input
Input is a standard input which contains a set of integer. Each line of the input is an amount of change which represents by a positive integer less than or equal to 5,000,000,000,000,000,000 or 5 × 1018. The input is terminated when the EOF (End- Of- File) is reached.
Output
For each amount of change, generate 4 lines of output data. The first line is the amount of change itself. The second line is a series of slot sizes (in descending order) separated by spaces. (The maximum slot size is less than or equal to 90.) The third line is a series of corresponding slot values. The fourth line is a blank line.
Sample Input
1
10
1000000
Sample Output
1
1
1

10
5 2
8 2

1000000
29 25 23 11 9
832040 121393 46368 144 55

问题链接：UVA1258 LA4721 Nowhere Money
问题简述：（略）
问题分析：数学计算问题，不解释。
程序说明：（略）
参考链接：（略）
题记：（略）

AC的Java语言程序如下：

/* UVA1258 LA4721 Nowhere Money */#include <bits/stdc++.h>using namespace std;typedef long long LL ;
const int N = 90;
LL a[N + 1], b[N + 1];
int flag[N + 1];void calc(LL n, int m)
{if (n == 0 || m < 0)return;else if(a[m] <= n) {flag[m] = 1;calc(n - a[m], m - 1);} elsecalc(n, m - 1);
}int main()
{a[0] = 0;a[1] = 1;a[2] = 2;for (int i = 3; i <= N; i++)a[i] = a[i - 2] + a[i - 1];LL n;while (~scanf("%lld", &n)) {memset(flag, 0, sizeof flag);calc(n, N);int cnt = 0;for (int i = N; i >= 0; i--)if (flag[i]) b[cnt++] = i;printf("%lld\n", n);for (int i = 0; i < cnt; i++)printf("%lld ", b[i]);printf("\n");for (int i = 0; i < cnt; i++)printf("%lld ", a[b[i]]);printf("\n\n");}return 0;
}

UVA1258 LA4721 Nowhere Money【数学计算】相关推荐

js函数语法：ASCII 码的相互转换，字符串操作，数学计算
ASCII 码的相互转换 for (let i = 'a'.charCodeAt(); i <= 'z'.charCodeAt(); i++) {a.push(String.fromCharCo ...
P4588 [TJOI2018]数学计算（线段树维护区间乘和单点修改）
P4588 [TJOI2018]数学计算刚看到这题根本每想到用线段树,直接每次记录计算结果然后找到要除的数字就好了呗但是!你会注意到,如果连续乘很多很多次,然后再除的话,如果不取模会爆 long ...
MATLAB数学计算与工程分析范例教程,MATLAB数学计算与工程分析范例教程
基本信息书名:MATLAB数学计算与工程分析范例教程定价:28.00元作者:石博强,赵金编著出版社:中国铁道出版社出版日期:2005-05-01 ISBN:9787#113057596 字 ...
Shell脚本笔记（三）shell中的数学计算
shell中的数学计算一.使用方括号 #!/bin/bash a=10 b=29 c=88res=$[$a * ($c-$b)] echo $res 二.使用(()) echo $((1+9)) ( ...
python数值运算答案_笨方法学Python 习题3：数字和数学计算
数字和数学计算 print("I will now count my chickens") print("Hens",25+30/6) print(" ...
用计算机计算的手抄报内容,关于数学计算手抄报
开办手抄报对学生是一项综合性很强的实践活动.下面是学习啦小编为大家带来的关于数学计算手抄报,希望大家喜欢. 数学计算手抄报的图片欣赏数学计算手抄报图一数学计算手抄报图二数学计算手抄报图三数学计 ...
php+数学计算公式,PHP数学计算函数总结
PHP数学计算函数总结发布于 2015-01-21 16:53:26 | 189 次阅读 | 评论: 0 | 来源: 网友投递 PHP开源脚本语言PHP(外文名: Hypertext Preproc ...
《“笨办法”学Python（第3版）》——习题3　数字和数学计算
本节书摘来自异步社区<"笨办法"学Python(第3版)>一书中的习题3,作者[美]Zed A. Shaw,王巍巍译,更多章节内容可以访问云栖社区"异步社区 ...
R开发(part2)--R语言中的数学计算
学习笔记,仅供参考,有错必纠参考自:<R的极客理想>-- 张丹文章目录 R开发 R语言中的数学计算对数加权平均.连乘.差分.秩.任意数.全体数阶乘.组合.排列累加.累乘.最小累 ...

UVA1258 LA4721 Nowhere Money【数学计算】

UVA1258 LA4721 Nowhere Money【数学计算】相关推荐

最新文章

热门文章