Worst Case of GCD
题号:NC218177
时间限制:C/C++/Rust/Pascal 1秒,其他语言2秒
空间限制:C/C++/Rust/Pascal 256 M,其他语言512 M
64bit IO Format: %lld

题目描述

We all have learned the Euclidean Algorithm. So what's the worst case of it?
You need output a progression from its very front, for example:
An arithmetic progression 1, 2, 3, 4, ... or 1, 3, 5, 7, ...
A geometric progression 1, 2, 4, 8, ... or 1, 4, 16, 64, ...
You need to output the first 20 numbers of the progression.

输入描述:

None

输出描述:

The first 20 numbers of the progression separated by spaces.
For Example:
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1