TOJ 2909 ZOJ 3175 Number of Containers / 数论
2013-11-14 16:11
295 查看
Number of Containers
时间限制(普通/Java):1000MS/3000MS 运行内存限制:65536KByteFor 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 1 4
样例输出
0 4
/article/2411221.html
#include <stdio.h> #include <stdlib.h> #include <iostream> #include <string.h> #include <math.h> using namespace std; int main() { int ncases,i,n; __int64 ans; scanf("%d",&ncases); while( ncases-- ) { ans = 0; scanf("%d",&n); for(i=1; i<=sqrt(n); i++) ans += (n/i); ans *= 2; i--; ans = ans - i*i - n; printf("%I64d\n",ans); } return 0; }
相关文章推荐
- zoj 3175 Number of Containers (nbut1375) 计算n /1+n/2+n/3+n/4....+n/n
- zoj 3175 Number of Containers(数论~)
- ZOJ - 3175 Number of Containers
- zoj 3175 Number of Containers (大数灵活题,除2改成平方根)
- zoj 3175 Number of Containers 分块加速
- zoj 3175 Number of Containers
- ZOJ 3175 Number of Containers 【数学图像性质(一个常见算式的经典计算)】
- ZOJ 3175 Number of Containers(n/1+n/2+...+n/(n-1)+n/n求法)
- Number of Containers [ZOJ 3126]
- ZOJ 2523 —— Number of People(数论,胡搞)
- [zoj 3774]Power of Fibonacci 数论(二次剩余 拓展欧几里得 等比数列求和)
- TOJ 2690 ZOJ 2849 Attack of Panda Virus / 优先队列+广搜
- [CodeForces 27E] Number With The Given Amount Of Divisors (数论 + 反素数)
- [zoj 3774]Power of Fibonacci 数论(二次剩余 拓展欧几里得 等比数列求和)
- LeetCode解题报告—— Container With Most Water & 3Sum Closest & Letter Combinations of a Phone Number
- Ccodeforces 27E Number With The Given Amount Of Divisors(数论+搜索)
- toj 4613 Number of Battlefields
- ACM 数论 hdu 1492 The number of divisors(约数) about Humble Numbers
- HDU 1492 The number of divisors(约数) about Humble Numbers(数论题目要知道定理呀....)
- 数论之神 god of number theory