Description: Description of laquo:
Given a natural number of n, the number of the half set(n) can be generated by n starting from n.
(1) n ∈ set (n);
(2) add a natural number to the left of n, but the natural number cannot exceed half of the recent additions;
(3) follow this rule until no more natural Numbers can be added.
For example, set(6)={6,16,26, 26,36, 36, 136}. Half set(6) has six elements.
Notice that half of the episodes are not multiple sets. The elements already in the collection are no longer added to the collection.
« programming tasks:
For a given natural number n, the number of elements in half set(n) is calculated.
« data input:
The input data is provided by a text file called input.txt.
Each file only has 1 row and gives an integer n. (0 & lt; N< 201).
« result output:
At the end of the program run, the result is output to the file output.txt. The output file is only 1 row and 1/2
The number of elements in set (n).
An example of the input file example output file
Input. TXT output. TXT
6 6
To Search:
- [banshuji-dynamicstate] - half set of issues-- dynamic programming
- [ex06a] - Simple to use VC++ 6.0 prepared dialog,
- [PCXLIB] - This procedure includes voice compressio
- [POST] - The problem of location selection of pos
- [Introduction_to_Linux] - & lt; Introduction to Linux--A Hands on
- [final] - Warehouse Management System Design and I
- [2-6banshu] - Given a natural number n, by n the begin
- [banshuji] - Set half of the problem
- [banjishu] - banjishuwenti
File list (Check if you may need any files):