zoj 3175 Number of Containers （nbut1375） 计算n /1+n/2+n/3+n/4....+n/n

http://acm.nbut.cn/Problem/view.xhtml?id=1375

http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemId=3216

hnust_xiehonghao

• [1375] Guess The Number

• 时间限制: 1000 ms　内存限制: 65535 K

• 问题描述

• For two integers m and k, k is said to be a container of m if k is divisible by m. Given 2 positive integers n and m (m < n), the function f(n, m) is defined to be the number of containers of m which are also no greater than n. For example, f(5, 1)=4, f(8, 2)=3, f(7, 3)=1, f(5, 4)=0...

  
  

  Let us define another function F(n) by the following equation: