Codeforces Round #136 (Div. 2) A. Little Elephant and Function

A. Little Elephant and Function

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

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.

Input

A single line contains integer n (1 ≤ n ≤ 1000) — the size of permutation.

Output

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.

Sample test(s)

input

1

output

1 

input

2

output

2 1 

题意是：给你一组数，完成一个函数功能：当x=1时结束，否则将a[x]与a[x-1]交换，所以以此递推，最后是只把n提到最前面，其余数依次排列。

代码如下：

#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
using namespace std;
int a[1005],n,i;


int main()
{
  while(~scanf("%d",&n))
   {
       for(i=1;i<=n;i++)
        {
            a[i]=i;

        }
      if(n==1)
        printf("1\n");
      else
       if(n==2)
        printf("2 1\n");
      else
      {
          printf("%d",n);
          for(i=1;i<n;i++)
            printf(" %d",i);
          cout<<endl;

      }
   }

  return 0;
}