已知数组a[]中含有N个整数，试为a[]中各个元素按其值从大到小的熟悉连续编号， a[i]中的编号对应于b[i]中，要求a[]中允许有相同的编号-Known to the array a [] contains an integer N a test for a [] in the smallest value of the various elements according to their familiarity with the consecutive number, a [i] c

数据结构—大整数加减乘除,利用一维数组做的-Data structures- integer addition and subtraction, multiplication and division

“最大约数问题” 正整数x 的约数是能整除x 的正整数。正整数x的约数个数记为div(x)。例如,1,2, 5,10 都是正整数10的约数,且div(10)=4。-" The most about several questions" about the number of the positive integer x is a positive integer divisible by x. The approximate number of positive integ