(Codeforces Round #136 (Div. 2))A. Little Elephant and Function(遞迴分析,簡單)
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
模擬一下即可。假設滿足題意的數列為a1, a2, a3, a4,...,an,由an到a1依次執行遞迴函式後,得到的數列為: a2, a3, ...,an,a1.也就是說只是把原數列的頭元素掉到最後面。遞迴函式要得到一個遞增序列,就是1,2,3,...,n,那麼原數列就自然是n,1,2,...,n-1,這樣把頭元素調到最後面就是所要求的序列。
AC CODE
#include <iostream>
#include <string>
#include <cstdio>
#include <cmath>
#include <cstring>
#include <algorithm>
#include <vector>
#define LL long long
#define MAXI 2147483647
#define MAXL 9223372036854775807
#define eps (1e-8)
#define dg(i) cout << "*" << i << endl;
using namespace std;
int main()
{
int n;
while(scanf("%d", &n) != EOF)
{
printf("%d ", n);
for(int i = 1; i < n - 1; i++)
printf("%d ", i);
if(n != 1) printf("%d\n", n - 1);
}
return 0;
}
相關文章
- Codeforces Round #242 (Div. 2) A. Squats
- Codeforces Round #213 (Div. 2) A. Good NumberGo
- Codeforces Round #243 (Div. 2) A. Sereja and Mugs
- Codeforces Round #253 (Div. 2) A. Anton and Letters
- Codeforces Round #250 (Div. 2) A. The Child and Homework
- Codeforces Round #244 (Div. 2) A. Police RecruitsUI
- Codeforces Round #249 (Div. 2) A. Black Square
- Codeforces Round #246 (Div. 2) A. Choosing Teams
- Codeforces Round #216 (Div. 2)A. Valera and Plates
- Codeforces Round #209 (Div. 2) A. Table
- Codeforces Round #210 (Div. 2) A. Levko and Table
- Codeforces Round #192 (Div. 2) A. Cakeminator
- Codeforces Round #189 (Div. 2) A. Magic Numbers
- Codeforces Round #228 (Div. 2) A. Fox and Number GameGAM
- Codeforces Round #215 (Div. 2) A. Sereja and Coat Rack
- Codeforces Round #248 (Div. 2) A. Kitahara Haruki's Gift
- Codeforces Round #235 (Div. 2) A. Vanya and Cards
- Codeforces Round #207 (Div. 2) A. Group of Students
- Codeforces Round #195 (Div. 2) A. Vasily the Bear and Triangle
- Codeforces Round #325 (Div. 2) B 遞推
- Codeforces Round #206 (Div. 2) A. Vasya and Digital RootGit
- Codeforces Beta Round #76 (Div. 1 Only) A. Frames
- Codeforces Round #639 (Div. 2)
- Codeforces Round #541 (Div. 2)
- Codeforces Round #682 (Div. 2)
- Codeforces Round #678 (Div. 2)
- Codeforces Round #747 (Div. 2)
- Codeforces Round #673 (Div. 2)
- Codeforces Round #672 (Div. 2)
- Codeforces Round #448 (Div. 2) A
- Codeforces Round #217 (Div. 2)
- Codeforces Round #256 (Div. 2)
- Codeforces Round #259 (Div. 2)
- Codeforces Round #257 (Div. 2)
- Codeforces Round #258 (Div. 2)
- Codeforces Round #171 (Div. 2)
- Codeforces Round #173 (Div. 2)
- Codeforces Round 932 (Div. 2)