题目链接:fzu 1050 Number lengths 题目大意:计算n!有多少位数。 解题思路:ans = log10(n!) = ∑(1≤i≤n)log(i). #include <stdio.h>#include <math.h>const int N = 1000005;int n, d[N];void init() {double sum = 0;fo
问题链接:https://leetcode.com/problems/maximum-product-of-word-lengths/ Given a string array words, find the maximum value of length(word[i]) * length(word[j]) where the two words do not share common let
题目: Problem 1050 Number lengths Accept: 1096 Submit: 2263 Time Limit: 1000 mSec Memory Limit : 32768 KB Problem Description N! (N factorial) can be quite irritating and difficult