Codeforces Round #211

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放在开头，后边的从1到n-1输出即可。

#include <iostream>


using namespace std;

int main()
{
    int n;
    while (cin >> n)
    {
        cout << n;
        for (int i = 1;i <= n - 1;i++)
            cout << " " << i;
        cout << endl;

    }



}

B. Little Elephant and Numbers

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

The Little Elephant loves numbers.

He has a positive integer x. The Little Elephant wants to find the number of positive integers d, such that d is the divisor of x, and x andd have at least one common (the same) digit in their decimal representations.

Help the Little Elephant to find the described number.

Input

A single line contains a single integer x (1 ≤ x ≤ 109).

Output

In a single line print an integer — the answer to the problem.

Sample test(s)

input

1

output

1

input

10

output

2

这道题的意思是说找到一个n的除数因子，该因子至少和n有相同的十进制数字。输出这种因子的个数。