Codeforces Round #136 (Div. 2) / 221A Little Elephant and Function (数学)
来源:互联网 发布:淘宝网卖家服务电话 编辑:程序博客网 时间:2024/05/29 17:58
The Little Elephant enjoys recursive functions.
This time he enjoys the sorting function. Let a is a permutation of an integers from 1 to n, inclusive, and ai denotes the i-th element of the permutation. The Little Elephant's recursive function f(x), that sorts the first x permutation's elements, works as follows:
- If x = 1, exit the function.
- Otherwise, call f(x - 1), and then make swap(ax - 1, ax) (swap the x-th and (x - 1)-th elements of a).
The Little Elephant's teacher believes that this function does not work correctly. But that-be do not get an F, the Little Elephant wants to show the performance of its function. Help him, find a permutation of numbers from 1 to n, such that after performing the Little Elephant's function (that is call f(n)), the permutation will be sorted in ascending order.
A single line contains integer n (1 ≤ n ≤ 1000) — the size of permutation.
In a single line print n distinct integers from 1 to n — the required permutation. Numbers in a line should be separated by spaces.
It is guaranteed that the answer exists.
1
1
2
2 1
从后往前反推+找规律。
完整代码:
/*30ms,0KB*/#include<cstdio>int main(void){int n;scanf("%d", &n);if (n == 1)putchar('1');else{ printf("%d", n);for (int i = 1; i < n; ++i)printf(" %d", i);}return 0;}
- Codeforces Round #136 (Div. 2) / 221A Little Elephant and Function (数学)
- Codeforces Round #136 (Div. 2) A. Little Elephant and Function
- (Codeforces Round #136 (Div. 2))A. Little Elephant and Function(递归分析,简单)
- Codeforces Round #129 (Div. 2)A. Little Elephant and Rozdil
- Codeforces Round #136 (Div. 2) D. Little Elephant and Array
- Codeforces Round #136 (Div. 2) B. Little Elephant and Numbers
- Codeforces Round #136 (Div. 2) C. Little Elephant and Problem
- Codeforces Round #136 (Div. 2) D. Little Elephant and Array
- Codeforces Round #136 (Div. 2) Little Elephant and Array
- Codeforces Round #129 (Div. 1) A Little Elephant and Interval
- Codeforces Round #157 (Div. 1)---A. Little Elephant and Bits
- Codeforces Round #136 (Div. 2) / 221B Little Elephant and Numbers (数论)
- Codeforces Round #136 (Div. 1) B. Little Elephant and Array
- Codeforces Round #136 (Div. 1) B. Little Elephant and Array
- Codeforces Round #129 (Div. 2) B. Little Elephant and Sorting
- Codeforces Round #136 (Div. 2) D. Little Elephant and Array 线段树 离线处理
- Codeforces Round #157 (Div. 1), problem: (C) Little Elephant and LCM DP+组合数学 0(n^(5/2))
- Codeforces Round #157 (Div. 1) C. Little Elephant and LCM (数学、dp)
- linux 免密码 ssh 互相连接
- linux c 关闭回显
- 2013-08-18
- 黑马程序员---汉字转拼音
- 两阶段提交与三阶段提交的区别
- Codeforces Round #136 (Div. 2) / 221A Little Elephant and Function (数学)
- 快速寻找满足条件的两个数(编程之美)
- 有谁知道深圳市斯普瑞特通信技术怎么样?(发展,待遇等)都可以谈谈。
- PHP+Mysql中文问题
- 第九章 目标系统的软件安装(下)
- 网友推荐数学书目备份,感谢无私的帮助
- c#winform中使用WebKit传递js对象实现与网页交互
- Android平台上面输入法遮挡问题-android:windowSoftInputMode属性使用
- 一个即将大四的程序猿的学习计划