求n的阶乘的约束的个数

	/**
	 *  约束个数公式 
	 * @param n! 的约束的个数!
	 * @return
	 */
	private long countOfYue(int n) {
		int[] p = new int[n+1];
		for(int i = 2; i <= n; i++ ) {
			int m = i;
			for(int j = 2; j <= m/j; j++) {
				while(m % j == 0) {
					p[j]++;
					m /= j;
				}
			}
			if(m > 1) p[m]++;
		}
		
		long count = 1;
		for(int i = 2; i <= n; i++) {
			if(p[i] > 0) 
				count *= (1+ p[i]);
		}
		return count;
	}