• [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:

    Now given a positive integer n, you are supposed to calculate the value of F(n).

  • 输入
  • There are multiple test cases. The first line of input contains an integer T(T<=200) indicating the number of test cases. Then T test cases follow.

    Each test case contains a positive integer n (0 < n <= 2000000000) in a single line.
  • 输出
  • For each test case, output the result F(n) in a single line.
  • 样例输入
  • 2
  • 样例输出
  • 0
  • 提示
  • 来源
  • ZOJ 3175 Number of Containers
  • 操作