ZOJ.3175 Number of Containers【数学问题】 2015/10/11
2015-10-11 16:52
429 查看
Number of Containers
Time Limit: 1 Second
Memory Limit: 32768 KB
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).
Input
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.
Output
For each test case, output the result F(n) in a single line.
Sample Input
Sample Output
Author: CAO, Peng
Source: The 9th Zhejiang University Programming Contest
有点摸不着头脑,不是很懂(。・∀・)ノ゙
Time Limit: 1 Second
Memory Limit: 32768 KB
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).
Input
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.
Output
For each test case, output the result F(n) in a single line.
Sample Input
2 1 4
Sample Output
0 4
Author: CAO, Peng
Source: The 9th Zhejiang University Programming Contest
有点摸不着头脑,不是很懂(。・∀・)ノ゙
#include<iostream> #include<cstdio> #include<cstring> #include<cmath> using namespace std; int main(){ long long n,ans,t,i; cin>>t; while(t--){ cin>>n; ans = 0; for( i = 1 ; i*i <= n ; ++i ){ ans += n/i; } ans *= 2; i--; ans = ans - i*i-n; cout<<ans<<endl; } return 0; }
相关文章推荐
- (vcpu-0)vcpu-0:VEREIFY vmcore/vmm/main/physMem_monitor.c.1123日志文件位于“E:OS X\vmware.log”
- main函数(本文较老,仅作参考)
- STL中的模板类pair
- hdu4770 暴力状压 Lights Against Dudely (2013 Asia Hangzhou Regional Contest problem A)
- Rails读书笔记第三章
- 【人工智能】农夫过河问题
- httpd: Could not reliably determine the server's fully qualified domain name
- LEETCODE-Factorial Trailing Zeroes
- LeetCode-Contains Duplicate III
- RAID
- 【人工智能】八皇后问题-启发式求解
- Container With Most Water
- Rails读书笔记第二章
- Rails读书笔记第一章
- NSURLSession/NSURLConnection HTTP load failed (kCFStreamErrorDomainSSL, -9802)
- LeetCode-Contains Duplicate III
- use `free` to check available memory
- LeetCode-Contains Duplicate II
- LeetCode-Contains Duplicate 217
- http://blog.csdn.net/liulina603/article/details/8617281