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 

문제 풀이 설명: 이 문제는 소규모의 데이터부터 규칙을 찾는 것이다. 귀속 연산이기 때문에 유사성이 존재한다. n=2는 21에게 주면 작은 것부터 큰 것까지 배열된 데이터를 얻을 수 있고 n=3을 주면 분석을 통해 312의 조합만 결과를 얻을 수 있으며 n=4는 4123만 결과를 얻을 수 있으며 데이터는 n12로 추정할 수 있다.n-1이어야 돼요.

#include <iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
using namespace std;

int main()
{
	int n,i;
	scanf("%d",&n);
	printf("%d ",n);
	for(i=1;i<n;i++)
	{
		printf("%d ",i);
	}
	return 0;
}