csv数字不使用科学计数法
Description:
描述:
This is a standard combinatorics problem to count numbers(x) that can be formed with unique digits, where 0<=x<10^n.
这是一个标准的组合问题,用于计算可以由唯一数字形成的数字( x ),其中0 <= x <10 ^ n 。
Problem statement:
问题陈述:
Given a non-negative integer n, count all numbers with unique digits, x, 0<=x<10^n.
给定一个非负整数n ,计算所有具有唯一数字x的数字, x , 0 <= x <10 ^ n 。
Input & output:
n=2
Total numbers that can be formed is 91
Ex